\nwhere\n C: ComponentManager,\n{\n indices: IndexPool,\n indexed_entities: VecMap<IndexedEntity<C>>,\n entities: HashMap<Entity, IndexedEntity<C>>,\n event_queue: Vec<Event>,\n next_id: Id,\n}\n\nimpl<C> EntityManager<C>\nwhere\n C: ComponentManager,\n{\n pub fn new() -> Self {\n EntityManager {\n indices: IndexPool::new(),\n indexed_entities: VecMap::new(),\n entities: HashMap::new(),\n event_queue: Vec::new(),\n next_id: 0,\n }\n }\n\n pub fn flush_queue<M, S>(&mut self, components: &mut C, services: &mut M, systems: &mut S)\n where\n M: ServiceManager,\n S: SystemManager<Components = C, Services = M>,\n {\n use self::Event::*;\n\n let mut queue = mem::replace(&mut self.event_queue, Vec::new());\n for e in queue.drain(..) {\n match e {\n BuildEntity(entity) => {\n systems.activated(EntityData(self.indexed(entity)), components, services);\n }\n RemoveEntity(entity) => {\n systems.deactivated(EntityData(self.indexed(entity)), components, services);\n }\n }\n }\n \n \n self.event_queue = queue;\n }\n\n pub fn create_entity<B, M>(\n &mut self,\n builder: B,\n components: &mut C,\n services: &mut M,\n ) -> Entity\n where\n B: EntityBuilder<C, M>,\n M: ServiceManager,\n {\n let entity = self.create();\n builder.build(BuildData(self.indexed(entity)), components, services);\n self.event_queue.push(Event::BuildEntity(entity));\n entity\n }\n\n pub fn remove_entity(&mut self, entity: Entity) -> bool {\n "},"suffix":{"kind":"string","value":"\n }\n\n pub fn iter(&self) -> EntityIter<C> {\n EntityIter::Indexed(IndexedEntityIter {\n iter: self.indices.all_indices(),\n values: &self.indexed_entities,\n })\n }\n\n pub fn count(&self) -> usize {\n self.indices.maximum()\n }\n\n pub fn indexed(&self, entity: Entity) -> &IndexedEntity<C> {\n &self.entities[&entity]\n }\n\n \n pub fn create(&mut self) -> Entity {\n self.next_id += 1;\n let entity = Entity { id: self.next_id };\n let ie = IndexedEntity {\n index: self.indices.new_id(),\n entity,\n _marker: PhantomData,\n };\n self.indexed_entities.insert(ie.index, ie.__clone());\n self.entities.insert(entity, ie);\n entity\n }\n\n \n #[inline]\n pub fn is_valid(&self, entity: Entity) -> bool {\n self.entities.contains_key(&entity)\n }\n\n \n pub fn remove(&mut self, entity: Entity) {\n self.entities\n .remove(&entity)\n .map(|e| self.indices.return_id(e.index()));\n }\n\n pub fn clear(&mut self) {\n self.entities.clear();\n self.indices = IndexPool::new();\n }\n}\n"},"middle":{"kind":"string","value":"if self.entities.contains_key(&entity) {\n self.event_queue.push(Event::RemoveEntity(entity));\n true\n } else {\n false\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"fn activated(_: &mut IVSystem, _: EntityData, _: &Components, _: &mut Services) {\n\n ATOMIC_BOOP.store(true, std::sync::atomic::Ordering::SeqCst);\n\n}\n\n\n","file_path":"tests/aspects.rs","rank":0,"score":173722.56101871424},{"content":"pub trait EntityBuilder<C, M>\n\nwhere\n\n C: ComponentManager,\n\n M: ServiceManager,\n\n{\n\n fn build<'a>(self, entity: BuildData<'a, C>, components: &mut C, services: &mut M);\n\n}\n\n\n\nimpl<C, M> EntityBuilder<C, M> for ()\n\nwhere\n\n C: ComponentManager,\n\n M: ServiceManager,\n\n{\n\n fn build(self, _: BuildData<C>, _: &mut C, _: &mut M) {}\n\n}\n\n\n\nimpl<C, M, F> EntityBuilder<C, M> for F\n\nwhere\n\n C: ComponentManager,\n\n M: ServiceManager,\n\n F: FnOnce(BuildData<C>, &mut C, &mut M),\n\n{\n\n fn build(self, entity: BuildData<C>, components: &mut C, services: &mut M) {\n\n self(entity, components, services)\n\n }\n\n}\n\n\n","file_path":"src/entity/builder.rs","rank":1,"score":149730.37438659018},{"content":"fn eprocess(_: &mut ESystem, entities: EntityIter, data: &mut DataHelper) {\n\n for entity in entities {\n\n data.components.foo[entity].push_str(\"ghjkl\");\n\n }\n\n}\n\n\n\n#[derive(Debug, Default, System)]\n\n#[system_type(Interact)]\n\n#[process = \"iprocess\"]\n\n#[aspect_a(all(bar), none(baz))]\n\n#[aspect_b(all(baz), none(bar))]\n\npub struct ISystem;\n\n\n","file_path":"tests/aspects.rs","rank":2,"score":144772.27767466046},{"content":"pub trait EntityModifier<C, M>\n\nwhere\n\n C: ComponentManager,\n\n M: ServiceManager,\n\n{\n\n fn modify<'a>(self, entity: ModifyData<'a, C>, components: &mut C, services: &mut M);\n\n}\n\n\n\nimpl<C, M> EntityModifier<C, M> for ()\n\nwhere\n\n C: ComponentManager,\n\n M: ServiceManager,\n\n{\n\n fn modify(self, _: ModifyData<C>, _: &mut C, _: &mut M) {}\n\n}\n\n\n\nimpl<C, M, F> EntityModifier<C, M> for F\n\nwhere\n\n C: ComponentManager,\n\n M: ServiceManager,\n\n F: FnOnce(ModifyData<C>, &mut C, &mut M),\n\n{\n\n fn modify(self, entity: ModifyData<C>, components: &mut C, services: &mut M) {\n\n self(entity, components, services)\n\n }\n\n}\n","file_path":"src/entity/builder.rs","rank":3,"score":140801.4132852698},{"content":"/// This trait is implemented automatically when you `#[derive(System)]` with the following:\n\n///\n\n/// ```\n\n/// # #[macro_use] extern crate conniecs_derive; extern crate conniecs;\n\n/// # use conniecs::{EntityIter, DataHelper};\n\n/// # #[derive(ComponentManager)] struct Components {\n\n/// # #[hot] pub foo: conniecs::ComponentList<Components, ()>, }\n\n/// #[derive(System, Default)]\n\n/// #[system_type(entity)]\n\n/// #[aspect = \"some::aspect::UnitStruct\"]\n\n/// #[process(process)]\n\n/// struct MySystem;\n\n/// # fn process(_: &mut MySystem, _: EntityIter<Components>, _:\n\n/// # &mut DataHelper<Components, Services>) {}\n\n/// # mod some { pub mod aspect { #[derive(Aspect, Copy, Clone)]\n\n/// # #[aspect(all(foo))] pub struct UnitStruct; } }\n\n/// # #[derive(ServiceManager, Default)] struct Services {}\n\n/// # #[derive(SystemManager)] struct Systems {\n\n/// # #[passive] sys: conniecs::system::EntitySystem<MySystem> }\n\n/// # fn main() { conniecs::World::<Systems>::new(); }\n\n/// ```\n\n///\n\n/// or\n\n///\n\n/// ```\n\n/// # #[macro_use] extern crate conniecs_derive; extern crate conniecs;\n\n/// # use conniecs::{EntityIter};\n\n/// # #[derive(ComponentManager)] struct Components { #[hot] pub foo:\n\n/// # conniecs::ComponentList<Components, String>, }\n\n/// #[derive(System, Default)]\n\n/// #[system_type(entity)]\n\n/// #[aspect(all(foo))]\n\n/// #[process = \"process\"]\n\n/// struct MySystem;\n\n///\n\n/// type DataHelper = conniecs::DataHelper<Components, Services>;\n\n/// fn process(_: &mut MySystem, entities: EntityIter<Components>, data: &mut DataHelper) {\n\n/// for entity in entities {\n\n/// println!(\"boop the {}\", &data.components.foo[entity]);\n\n/// }\n\n/// }\n\n/// # #[derive(ServiceManager, Default)] struct Services {}\n\n/// # #[derive(SystemManager)] struct Systems {\n\n/// # #[passive] sys: conniecs::system::EntitySystem<MySystem> }\n\n/// # fn main() { conniecs::World::<Systems>::new(); }\n\n/// ```\n\npub trait FilteredEntitySystem: System {\n\n fn create_aspect() -> Aspect<Self::Components>;\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct EntitySystem<T>\n\nwhere\n\n T: EntityProcess,\n\n{\n\n pub inner: T,\n\n pub watcher: Watcher<T::Components>,\n\n}\n\n\n\nimpl<T> Deref for EntitySystem<T>\n\nwhere\n\n T: EntityProcess,\n\n{\n\n type Target = T;\n\n fn deref(&self) -> &T {\n\n &self.inner\n","file_path":"src/system/entity.rs","rank":5,"score":128674.9644513795},{"content":"pub trait EditData<C: ComponentManager> {\n\n #[doc(hidden)]\n\n fn entity(&self) -> &IndexedEntity<C>;\n\n #[doc(hidden)]\n\n fn can_insert_components() -> bool;\n\n}\n\n\n\nimpl<'a, C: ComponentManager> EditData<C> for ModifyData<'a, C> {\n\n #[doc(hidden)]\n\n #[inline]\n\n fn entity(&self) -> &IndexedEntity<C> {\n\n self.0\n\n }\n\n\n\n #[doc(hidden)]\n\n #[inline]\n\n fn can_insert_components() -> bool {\n\n true\n\n }\n\n}\n","file_path":"src/entity/data.rs","rank":6,"score":128055.03335763628},{"content":"fn iprocess(_: &mut ISystem, bars: EntityIter, bazes: EntityIter, data: &mut DataHelper) {\n\n for bar_entity in bars {\n\n for baz_entity in bazes.clone() {\n\n data.components.baz[baz_entity][0] += data.components.bar[bar_entity];\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Default, System)]\n\n#[system_type(Interval)]\n\n#[process = \"interval_process\"]\n\n#[activated = \"activated\"]\n\n#[interval = \"3\"]\n\npub struct IVSystem {\n\n pub booped: bool,\n\n}\n\n\n","file_path":"tests/aspects.rs","rank":7,"score":117024.93631364533},{"content":"pub trait EntityProcess: FilteredEntitySystem {\n\n fn process<'a>(\n\n &mut self,\n\n entities: EntityIter<'a, Self::Components>,\n\n data: &mut DataHelper<Self::Components, Self::Services>,\n\n );\n\n}\n\n\n","file_path":"src/system/entity.rs","rank":8,"score":104954.29049761867},{"content":"fn interval_process(iv: &mut IVSystem, _: &mut DataHelper) {\n\n iv.booped = !iv.booped;\n\n}\n\n\n\nstatic ATOMIC_BOOP: std::sync::atomic::AtomicBool = std::sync::atomic::ATOMIC_BOOL_INIT;\n\n\n","file_path":"tests/aspects.rs","rank":9,"score":104759.24728308315},{"content":"pub fn read_data_items<'a>(\n\n mut items: impl Iterator<Item = &'a NestedMeta>,\n\n) -> (proc_macro2::TokenStream, proc_macro2::TokenStream) {\n\n let (item0, item1) = match (items.next(), items.next(), items.next()) {\n\n (Some(item0), Some(item1), None) => (item0, item1),\n\n _ => improper_data_fmt(),\n\n };\n\n\n\n let comps = match item0 {\n\n NestedMeta::Literal(Lit::Str(path)) => path.value(),\n\n NestedMeta::Meta(Meta::Word(word)) => word.to_string(),\n\n NestedMeta::Meta(Meta::NameValue(MetaNameValue {\n\n ident,\n\n lit: Lit::Str(path),\n\n ..\n\n })) if ident == \"components\" => path.value(),\n\n _ => improper_data_fmt(),\n\n };\n\n\n\n let servs = match item1 {\n","file_path":"conniecs-derive/src/system.rs","rank":10,"score":103335.42093760139},{"content":"pub trait AspectFilter<C: ComponentManager>: 'static {\n\n fn check<'a>(&self, entity: EntityData<'a, C>, components: &C) -> bool;\n\n}\n\n\n\nimpl<F, C> AspectFilter<C> for F\n\nwhere\n\n C: ComponentManager,\n\n F: Fn(EntityData<C>, &C) -> bool + 'static,\n\n{\n\n #[inline]\n\n fn check<'a>(&self, entity: EntityData<'a, C>, components: &C) -> bool {\n\n (*self)(entity, components)\n\n }\n\n}\n\n\n","file_path":"src/aspect.rs","rank":11,"score":103098.15760177544},{"content":"fn is_passive(attrs: &[Attribute]) -> bool {\n\n for attr in attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n if meta.name() == \"passive\" {\n\n return true;\n\n }\n\n }\n\n\n\n false\n\n}\n","file_path":"conniecs-derive/src/systems.rs","rank":12,"score":103084.62574952564},{"content":"pub trait System {\n\n type Components: ComponentManager;\n\n type Services: ServiceManager;\n\n\n\n fn build_system() -> Self;\n\n\n\n #[inline]\n\n fn activated(\n\n &mut self,\n\n entity: EntityData<Self::Components>,\n\n components: &Self::Components,\n\n services: &mut Self::Services,\n\n ) {\n\n let (_, _, _) = (entity, components, services);\n\n }\n\n\n\n #[inline]\n\n fn reactivated(\n\n &mut self,\n\n entity: EntityData<Self::Components>,\n","file_path":"src/system/mod.rs","rank":13,"score":102998.58634926792},{"content":"pub trait SystemInterval: System {\n\n fn create_interval() -> TickerState;\n\n}\n\n\n\n#[derive(Copy, Clone, Debug)]\n\npub struct IntervalSystem<T>\n\nwhere\n\n T: SystemInterval,\n\n{\n\n pub inner: T,\n\n pub ticker: TickerState,\n\n}\n\n\n\nimpl<T> Deref for IntervalSystem<T>\n\nwhere\n\n T: SystemInterval,\n\n{\n\n type Target = T;\n\n fn deref(&self) -> &T {\n\n &self.inner\n","file_path":"src/system/interval.rs","rank":14,"score":98823.3750660349},{"content":"pub trait InteractSystemFilter: System {\n\n fn create_filter_a() -> Aspect<Self::Components>;\n\n fn create_filter_b() -> Aspect<Self::Components>;\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct InteractSystem<T>\n\nwhere\n\n T: InteractProcess,\n\n{\n\n pub inner: T,\n\n pub watcher_a: Watcher<T::Components>,\n\n pub watcher_b: Watcher<T::Components>,\n\n}\n\n\n\nimpl<T> Deref for InteractSystem<T>\n\nwhere\n\n T: InteractProcess,\n\n{\n\n type Target = T;\n","file_path":"src/system/interact.rs","rank":15,"score":97138.98978068968},{"content":"pub trait Process: System {\n\n fn process(&mut self, data: &mut DataHelper<Self::Components, Self::Services>);\n\n}\n\n\n","file_path":"src/system/mod.rs","rank":16,"score":96840.81473837285},{"content":"#[test]\n\npub fn simulate() {\n\n let mut world = conniecs::World::<Systems>::new();\n\n assert_eq!(world.systems.ivsystem.booped, false);\n\n assert_eq!(ATOMIC_BOOP.load(std::sync::atomic::Ordering::SeqCst), false);\n\n\n\n let asdf = world.data.create_entity(|e, c, _| {\n\n // We need a foo!\n\n c.foo.add(e, \"asdf\".to_string());\n\n });\n\n\n\n let bar = world.data.create_entity(|e, c, _| {\n\n // We need a bar\n\n c.bar.add(e, 0.25);\n\n });\n\n let _bar1 = world.data.create_entity(|e, c, _| {\n\n // We need another bar\n\n c.bar.add(e, 0.25);\n\n });\n\n\n\n let baz = world.data.create_entity(|e, c, _| {\n","file_path":"tests/aspects.rs","rank":17,"score":95164.16475673037},{"content":"#[proc_macro_derive(ServiceManager)]\n\npub fn derive_services(input: TokenStream) -> TokenStream {\n\n // Parse the string representation\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n\n\n // Build the impl\n\n let result = services::impl_services(ast);\n\n\n\n // Return the generated impl\n\n result.into()\n\n}\n\n\n\n#[proc_macro_derive(\n\n System,\n\n attributes(\n\n data,\n\n system_type,\n\n process,\n\n aspect,\n\n aspect_a,\n\n aspect_b,\n\n interval,\n\n timed_interval,\n\n activated,\n\n reactivated,\n\n deactivated\n\n )\n\n)]\n","file_path":"conniecs-derive/src/lib.rs","rank":18,"score":91208.66804811859},{"content":"#[proc_macro_derive(ComponentManager, attributes(hot, cold))]\n\npub fn derive_components(input: TokenStream) -> TokenStream {\n\n // Parse the string representation\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n\n\n // Build the impl\n\n let result = components::impl_components(ast);\n\n\n\n // Return the generated impl\n\n result.into()\n\n}\n\n\n","file_path":"conniecs-derive/src/lib.rs","rank":19,"score":90828.21923434854},{"content":"pub fn impl_services(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let name = ast.ident;\n\n\n\n quote!{\n\n impl ::conniecs::services::ServiceManager for #name {\n\n #[doc(hidden)]\n\n fn __please_use_the_derive_attribute() {}\n\n }\n\n }\n\n}\n","file_path":"conniecs-derive/src/services.rs","rank":20,"score":90227.76621705634},{"content":"pub fn impl_components(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\n\n if ast.generics != Default::default() {\n\n panic!(\"There may not be generics attached to the Components struct\");\n\n }\n\n\n\n let name = ast.ident;\n\n let fields = match &ast.data {\n\n Data::Struct(data) => match &data.fields {\n\n Fields::Named(fields) => Some(&fields.named),\n\n Fields::Unit => None,\n\n Fields::Unnamed(_) => {\n\n panic!(\"Components may not be represented by a tuple struct.\");\n\n }\n\n },\n\n Data::Union(_) => {\n\n panic!(\"Components may not be represented by a union. Structs only.\");\n\n }\n\n Data::Enum(_) => {\n\n panic!(\"Components may not be represented by an enum. Structs only.\");\n\n }\n","file_path":"conniecs-derive/src/components.rs","rank":21,"score":89720.5495584287},{"content":"fn panicker_update(_: &mut Panicker, _: &mut DataHelper) {\n\n panic!(\"this shouldn't get called\");\n\n}\n\n\n\n#[derive(Debug, Default, System)]\n\n#[system_type(Entity)]\n\n#[process = \"eprocess\"]\n\n#[aspect(all(foo), none(qux))]\n\npub struct ESystem;\n\n\n","file_path":"tests/aspects.rs","rank":22,"score":89545.712135905},{"content":"#[proc_macro_derive(SystemManager, attributes(data, passive))]\n\npub fn derive_systems(input: TokenStream) -> TokenStream {\n\n // Parse the string representation\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n\n\n // Build the impl\n\n let result = systems::impl_systems(ast);\n\n\n\n // Return the generated impl\n\n result.into()\n\n}\n\n\n","file_path":"conniecs-derive/src/lib.rs","rank":23,"score":88461.00995124456},{"content":"pub fn derive_system(input: TokenStream) -> TokenStream {\n\n // Parse the string representation\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n\n\n // Build the impl\n\n let result = system::impl_system(ast);\n\n\n\n // Return the generated impl\n\n result.into()\n\n}\n\n\n","file_path":"conniecs-derive/src/lib.rs","rank":24,"score":88458.30032049588},{"content":"pub fn quote_aspect(\n\n ty: &Ident,\n\n cty: &proc_macro2::TokenStream,\n\n all_filters: &[Ident],\n\n none_filters: &[Ident],\n\n) -> proc_macro2::TokenStream {\n\n quote! {\n\n impl ::conniecs::aspect::AspectFilter<#cty> for #ty {\n\n fn check<'a>(&self, entity: ::conniecs::EntityData<'a, #cty >, components: & #cty ) -> bool {\n\n #(\n\n if !components.#all_filters.has(entity) {\n\n return false;\n\n }\n\n )*\n\n #(\n\n if components.#none_filters.has(entity) {\n\n return false;\n\n }\n\n )*\n\n true\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":25,"score":88232.96993270525},{"content":"fn process_update(_: &mut Update, data: &mut DataHelper) {\n\n for entity in data.entities() {\n\n if data.components.foo.has(entity) {\n\n println!(\"{}\", data.components.foo[entity]);\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Default, System)]\n\n#[process(panicker_update)]\n\npub struct Panicker;\n\n\n","file_path":"tests/aspects.rs","rank":26,"score":87891.5438859821},{"content":"pub fn impl_systems(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let name = &ast.ident;\n\n let mut cs_data = None;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"data\" => cs_data = Some(read_data(&meta)),\n\n _ => (),\n\n }\n\n }\n\n\n\n let fields = match &ast.data {\n\n Data::Struct(data) => match &data.fields {\n\n Fields::Named(fields) => Some(&fields.named),\n\n Fields::Unit => None,\n\n Fields::Unnamed(_) => {\n\n panic!(\"Components may not be represented by a tuple struct.\")\n\n }\n\n }\n","file_path":"conniecs-derive/src/systems.rs","rank":27,"score":86559.36300630885},{"content":"pub fn impl_system(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let mut kind = SystemType::Basic;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"system_type\" => kind = read_systy(&meta),\n\n _ => (),\n\n }\n\n }\n\n\n\n match kind {\n\n SystemType::Basic => impl_basic_system(&ast),\n\n SystemType::Entity => impl_entity_system(&ast),\n\n SystemType::Lazy => impl_lazy_system(&ast),\n\n SystemType::Interval => impl_interval_system(&ast),\n\n SystemType::Interact => impl_interact_system(&ast),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":28,"score":86559.36300630885},{"content":"pub fn read_aspect<'a>(\n\n items: impl IntoIterator<Item = &'a NestedMeta>,\n\n all: &mut Vec<Ident>,\n\n none: &mut Vec<Ident>,\n\n) {\n\n for item in items {\n\n let item = unwrap_meta(item);\n\n let items = unwrap_list(item);\n\n match item.name().to_string().as_str() {\n\n \"all\" => {\n\n for item in items {\n\n let item = unwrap_meta(item);\n\n let component = unwrap_word(item);\n\n all.push(component.clone());\n\n }\n\n }\n\n \"none\" => {\n\n for item in items {\n\n let item = unwrap_meta(item);\n\n let component = unwrap_word(item);\n\n none.push(component.clone());\n\n }\n\n }\n\n _ => improper_format(),\n\n }\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":29,"score":84607.61276766294},{"content":"enum SystemType {\n\n Basic,\n\n Entity,\n\n Lazy,\n\n Interval,\n\n Interact,\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":30,"score":82817.91342342037},{"content":"pub fn read_aspect_meta<'a>(\n\n attr: &'a Meta,\n\n all: &mut Vec<Ident>,\n\n none: &mut Vec<Ident>,\n\n) -> Option<proc_macro2::TokenStream> {\n\n match attr {\n\n Meta::List(list) => {\n\n read_aspect(list.nested.iter(), all, none);\n\n None\n\n }\n\n Meta::NameValue(MetaNameValue {\n\n lit: Lit::Str(path),\n\n ..\n\n }) => Some(quote_path(&path.value())),\n\n _ => improper_format(),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":31,"score":82672.37799603821},{"content":"/// Marks types which are suitable for being components. It is implemented for all\n\n/// types which are `'static`.\n\npub trait Component: 'static {}\n\nimpl<T: 'static> Component for T {}\n\n\n","file_path":"src/component.rs","rank":32,"score":81323.40175766646},{"content":"type EntityData<'a> = conniecs::EntityData<'a, Components>;\n\n\n\n#[derive(Aspect)]\n\n#[aspect(all(foo, bar))]\n\npub struct FooBarAspect;\n\n\n\n#[derive(Debug, Default, ServiceManager)]\n\npub struct Services;\n\n\n\n#[derive(Debug, ComponentManager)]\n\npub struct Components {\n\n #[cold]\n\n pub foo: Comps<String>,\n\n\n\n #[hot]\n\n pub bar: Comps<f32>,\n\n #[hot]\n\n pub baz: Comps<[f32; 3]>,\n\n\n\n #[cold]\n","file_path":"tests/aspects.rs","rank":33,"score":79793.31173080736},{"content":"pub trait ServiceManager: 'static {\n\n #[doc(hidden)]\n\n fn __please_use_the_derive_attribute();\n\n}\n\n\n\nimpl ServiceManager for () {\n\n #[doc(hidden)]\n\n fn __please_use_the_derive_attribute() {}\n\n}\n","file_path":"src/services.rs","rank":34,"score":79759.77470232907},{"content":"/// This is the trait implemented for your struct containing all of your\n\n/// component lists. You should not try to implement this manually. Use\n\n/// `#[derive(Components)]` instead. See the module documentation for more\n\n/// information.\n\npub trait ComponentManager: 'static {\n\n fn build_manager() -> Self;\n\n\n\n #[doc(hidden)]\n\n fn __wipe_all(&mut self);\n\n\n\n #[doc(hidden)]\n\n fn __please_use_the_derive_attribute();\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct ComponentList<C, T>\n\nwhere\n\n C: ComponentManager,\n\n T: Component,\n\n{\n\n pub(crate) inner: InnerComponentList<T>,\n\n _marker: PhantomData<C>,\n\n}\n\n\n","file_path":"src/component.rs","rank":35,"score":79125.51502380779},{"content":"pub trait SystemManager {\n\n type Components: ComponentManager;\n\n type Services: ServiceManager;\n\n\n\n fn build_manager() -> Self;\n\n\n\n fn activated(\n\n &mut self,\n\n entity: EntityData<Self::Components>,\n\n components: &Self::Components,\n\n services: &mut Self::Services,\n\n );\n\n\n\n fn reactivated(\n\n &mut self,\n\n entity: EntityData<Self::Components>,\n\n components: &Self::Components,\n\n services: &mut Self::Services,\n\n );\n\n\n","file_path":"src/system/mod.rs","rank":36,"score":77061.21282814152},{"content":"pub fn read_data(item: &Meta) -> (proc_macro2::TokenStream, proc_macro2::TokenStream) {\n\n match item {\n\n Meta::List(items) => read_data_items(items.nested.iter()),\n\n _ => improper_data_fmt(),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":37,"score":74159.29632420116},{"content":"fn impl_entity_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let name = &ast.ident;\n\n let mut cs_data = None;\n\n let mut init_func = None;\n\n let mut process_func = None;\n\n let mut aspect_all = vec![];\n\n let mut aspect_none = vec![];\n\n\n\n let aspect_id = Ident::new(&format!(\"{}EntityAspect\", name), Span::call_site());\n\n let mut aspect_path = None;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"data\" => cs_data = Some(read_data(&meta)),\n\n \"init\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\n\n \"process\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\n\n \"aspect\" => aspect_path = read_aspect_meta(&meta, &mut aspect_all, &mut aspect_none),\n\n _ => (),\n\n }\n","file_path":"conniecs-derive/src/system.rs","rank":38,"score":72653.85847000366},{"content":"#[proc_macro_derive(Aspect, attributes(aspect, components))]\n\npub fn derive_aspect(input: TokenStream) -> TokenStream {\n\n // Parse the string representation\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n\n\n // Build the impl\n\n let result = aspect::impl_aspect(ast);\n\n\n\n //panic!(\"{}\", result);\n\n\n\n result.into()\n\n}\n\n\n","file_path":"conniecs-derive/src/lib.rs","rank":39,"score":70684.21195401519},{"content":"pub trait InteractProcess: InteractSystemFilter {\n\n fn process<'a>(\n\n &mut self,\n\n entities_a: EntityIter<'a, Self::Components>,\n\n entities_b: EntityIter<'a, Self::Components>,\n\n data: &mut DataHelper<Self::Components, Self::Services>,\n\n );\n\n}\n\n\n","file_path":"src/system/interact.rs","rank":40,"score":69716.6293217522},{"content":"fn improper_interval_fmt() -> ! {\n\n improper_attr_format(\"#[interval = ...]\", \"conniecs::system\");\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":41,"score":65864.24787402073},{"content":"fn improper_process_fmt() -> ! {\n\n improper_attr_format(\"#[process(...)]\", \"conniecs::system\");\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":42,"score":65864.24787402073},{"content":"fn improper_reactivated_fmt() -> ! {\n\n improper_attr_format(\"#[reactivated = ...]\", \"conniecs::system\");\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":43,"score":65864.24787402073},{"content":"fn improper_deactivated_fmt() -> ! {\n\n improper_attr_format(\"#[deactivated = ...]\", \"conniecs::system\");\n\n}\n","file_path":"conniecs-derive/src/system.rs","rank":44,"score":65864.24787402073},{"content":"fn improper_activated_fmt() -> ! {\n\n improper_attr_format(\"#[activated = ...]\", \"conniecs::system\");\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":45,"score":65864.24787402073},{"content":"fn improper_init_fmt() -> ! {\n\n improper_attr_format(\"#[init(...)]\", \"conniecs::system\");\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":46,"score":65864.24787402073},{"content":"fn improper_systy_fmt() -> ! {\n\n improper_attr_format(\"#[system_type(...)]\", \"conniecs::system\");\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":47,"score":65864.24787402073},{"content":"fn improper_data_fmt() -> ! {\n\n improper_attr_format(\"#[data(...)]\", \"conniecs::system\");\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":48,"score":65864.24787402073},{"content":"fn parse_explicit_iv<'a>(\n\n mut items: impl Iterator<Item = &'a NestedMeta>,\n\n) -> proc_macro2::TokenStream {\n\n let item = items.next();\n\n if item.is_none() || items.next().is_some() {\n\n improper_interval_fmt();\n\n }\n\n\n\n match item.unwrap() {\n\n NestedMeta::Literal(Lit::Str(time)) => parse_iv_time(&time.value()),\n\n NestedMeta::Literal(Lit::Int(time)) => frame_iv(time.value()),\n\n NestedMeta::Meta(Meta::NameValue(mnv)) => {\n\n let iv = match &mnv.lit {\n\n Lit::Str(time) => parse_u64(&time.value()),\n\n Lit::Int(iv) => iv.value(),\n\n _ => improper_interval_fmt(),\n\n };\n\n let ns = match mnv.ident.to_string().as_str() {\n\n \"ticks\" => return frame_iv(iv),\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":49,"score":63816.95845070253},{"content":"fn read_systy(attr: &Meta) -> SystemType {\n\n let systy = read_path_item(attr, || improper_systy_fmt());\n\n match &systy[..] {\n\n \"Basic\" | \"basic\" => SystemType::Basic,\n\n \"Entity\" | \"entity\" => SystemType::Entity,\n\n \"Lazy\" | \"lazy\" => SystemType::Lazy,\n\n \"Interval\" | \"interval\" => SystemType::Interval,\n\n \"Interact\" | \"interact\" => SystemType::Interact,\n\n _ => improper_systy_fmt(),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":50,"score":63416.73393206665},{"content":"pub fn impl_aspect(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let ty = &ast.ident;\n\n let mut all_filters = vec![];\n\n let mut none_filters = vec![];\n\n let mut components_ty = None;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n\n\n match (attr.path.segments[0].ident.to_string().as_str(), &meta) {\n\n (\"components\", meta) => {\n\n let word = read_path_item(meta, || improper_comp_format());\n\n components_ty = Some(word);\n\n }\n\n (\"aspect\", Meta::List(list)) => {\n\n read_aspect(list.nested.iter(), &mut all_filters, &mut none_filters);\n\n }\n\n _ => continue,\n\n }\n\n }\n\n\n\n let cty = match components_ty {\n\n Some(ty) => quote_path(&ty),\n\n None => quote_path(\"crate::Components\"),\n\n };\n\n\n\n quote_aspect(ty, &cty, &all_filters, &none_filters)\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":51,"score":62824.10493988923},{"content":"use crate::component::ComponentManager;\n\nuse crate::entity::{BuildData, ModifyData};\n\nuse crate::services::ServiceManager;\n\n\n","file_path":"src/entity/builder.rs","rank":52,"score":58872.30554334964},{"content":"struct All;\n","file_path":"src/aspect.rs","rank":53,"score":58382.3852751766},{"content":"fn parse_u64(time: &str) -> u64 {\n\n time.parse().map_err(|_| improper_interval_fmt()).unwrap()\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":54,"score":57218.71902429292},{"content":"fn field_info(field: &Field) -> (&Ident, Ident) {\n\n let kind_attr = field\n\n .attrs\n\n .iter()\n\n .filter_map(|a| a.parse_meta().ok())\n\n .filter(|m| m.name() == \"hot\" || m.name() == \"cold\")\n\n .nth(0);\n\n\n\n match kind_attr {\n\n Some(Meta::Word(kind)) => (field.ident.as_ref().unwrap(), kind),\n\n _ => panic!(\"All component lists must be marked with either #[hot] or #[cold]\"),\n\n }\n\n}\n","file_path":"conniecs-derive/src/components.rs","rank":55,"score":57013.80092252123},{"content":"struct None;\n\n\n\nimpl<C> AspectFilter<C> for All\n\nwhere\n\n C: ComponentManager,\n\n{\n\n #[inline]\n\n fn check<'a>(&self, _: EntityData<'a, C>, _: &C) -> bool {\n\n true\n\n }\n\n}\n\n\n\nimpl<C> AspectFilter<C> for None\n\nwhere\n\n C: ComponentManager,\n\n{\n\n #[inline]\n\n fn check<'a>(&self, _: EntityData<'a, C>, _: &C) -> bool {\n\n false\n\n }\n\n}\n","file_path":"src/aspect.rs","rank":56,"score":56767.607737633705},{"content":"type EntityIter<'a> = conniecs::EntityIter<'a, Components>;\n","file_path":"tests/aspects.rs","rank":57,"score":54929.330668913644},{"content":"fn impl_basic_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let name = &ast.ident;\n\n let mut cs_data = None;\n\n let mut init_func = None;\n\n let mut process_func = None;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"data\" => cs_data = Some(read_data(&meta)),\n\n \"init\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\n\n \"process\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\n\n _ => (),\n\n }\n\n }\n\n\n\n let (components, services) = match cs_data {\n\n Some((c, s)) => (c, s),\n\n None => (quote_path(\"crate::Components\"), quote_path(\"crate::Services\")),\n\n };\n","file_path":"conniecs-derive/src/system.rs","rank":58,"score":54776.470619773725},{"content":"fn impl_lazy_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let name = &ast.ident;\n\n let mut cs_data = None;\n\n let mut process_func = None;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"data\" => cs_data = Some(read_data(&meta)),\n\n \"process\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\n\n _ => (),\n\n }\n\n }\n\n\n\n let (components, services) = match cs_data {\n\n Some((c, s)) => (c, s),\n\n None => (quote_path(\"crate::Components\"), quote_path(\"crate::Services\")),\n\n };\n\n\n\n let process = if let Some(proc_func) = process_func {\n","file_path":"conniecs-derive/src/system.rs","rank":59,"score":54776.470619773725},{"content":"fn impl_interval_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let name = &ast.ident;\n\n let mut cs_data = None;\n\n let mut init_func = None;\n\n let mut process_func = None;\n\n let mut interval = None;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"data\" => cs_data = Some(read_data(&meta)),\n\n \"init\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\n\n \"process\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\n\n \"interval\" => interval = Some(parse_interval(&meta)),\n\n _ => (),\n\n }\n\n }\n\n\n\n let (components, services) = match cs_data {\n\n Some((c, s)) => (c, s),\n","file_path":"conniecs-derive/src/system.rs","rank":60,"score":54776.470619773725},{"content":"fn impl_interact_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\n\n let name = &ast.ident;\n\n let mut cs_data = None;\n\n let mut init_func = None;\n\n let mut process_func = None;\n\n let mut aspect_all_a = vec![];\n\n let mut aspect_none_a = vec![];\n\n let mut aspect_all_b = vec![];\n\n let mut aspect_none_b = vec![];\n\n\n\n let aspect_id_a = Ident::new(&format!(\"{}EntityAspectA\", name), Span::call_site());\n\n let mut aspect_path_a = None;\n\n let aspect_id_b = Ident::new(&format!(\"{}EntityAspectB\", name), Span::call_site());\n\n let mut aspect_path_b = None;\n\n\n\n for attr in &ast.attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"data\" => cs_data = Some(read_data(&meta)),\n\n \"init\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\n","file_path":"conniecs-derive/src/system.rs","rank":61,"score":54776.470619773725},{"content":" }\n\n }\n\n}\n\n\n\nimpl<T> System for EntitySystem<T>\n\nwhere\n\n T: EntityProcess,\n\n{\n\n type Components = T::Components;\n\n type Services = T::Services;\n\n\n\n fn build_system() -> Self {\n\n EntitySystem::new()\n\n }\n\n\n\n fn activated(\n\n &mut self,\n\n entity: EntityData<T::Components>,\n\n components: &T::Components,\n\n services: &mut T::Services,\n","file_path":"src/system/entity.rs","rank":62,"score":54747.74391829918},{"content":" }\n\n}\n\n\n\nimpl<T> DerefMut for EntitySystem<T>\n\nwhere\n\n T: EntityProcess,\n\n{\n\n fn deref_mut(&mut self) -> &mut T {\n\n &mut self.inner\n\n }\n\n}\n\n\n\nimpl<T> EntitySystem<T>\n\nwhere\n\n T: EntityProcess,\n\n{\n\n pub fn new() -> EntitySystem<T> {\n\n EntitySystem {\n\n inner: T::build_system(),\n\n watcher: Watcher::new(T::create_aspect()),\n","file_path":"src/system/entity.rs","rank":63,"score":54742.905328109075},{"content":" ) {\n\n self.watcher\n\n .activated(entity, components, services, &mut self.inner);\n\n }\n\n\n\n fn reactivated(\n\n &mut self,\n\n entity: EntityData<T::Components>,\n\n components: &T::Components,\n\n services: &mut T::Services,\n\n ) {\n\n self.watcher\n\n .reactivated(entity, components, services, &mut self.inner);\n\n }\n\n\n\n fn deactivated(\n\n &mut self,\n\n entity: EntityData<T::Components>,\n\n components: &T::Components,\n\n services: &mut T::Services,\n","file_path":"src/system/entity.rs","rank":64,"score":54741.993639543354},{"content":" ) {\n\n self.watcher\n\n .deactivated(entity, components, services, &mut self.inner);\n\n }\n\n}\n\n\n\nimpl<T> Process for EntitySystem<T>\n\nwhere\n\n T: EntityProcess,\n\n{\n\n fn process(&mut self, data: &mut DataHelper<T::Components, T::Services>) {\n\n self.inner.process(self.watcher.iter(), data);\n\n }\n\n}\n","file_path":"src/system/entity.rs","rank":65,"score":54741.62745973646},{"content":"//! TODO: Add documentation including describing how the derive macros work\n\n\n\nuse std::ops::{Deref, DerefMut};\n\n\n\nuse crate::aspect::Aspect;\n\nuse crate::entity::{EntityData, EntityIter};\n\nuse crate::system::watcher::Watcher;\n\nuse crate::system::{Process, System};\n\nuse crate::world::DataHelper;\n\n\n","file_path":"src/system/entity.rs","rank":66,"score":54739.82934168165},{"content":"fn frame_ns(ns: u64) -> proc_macro2::TokenStream {\n\n quote! {\n\n ::conniecs::system::interval::TickerState::Timed {\n\n interval: #ns,\n\n next_tick: None,\n\n }\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":67,"score":51678.95167196641},{"content":"fn frame_iv(iv: u64) -> proc_macro2::TokenStream {\n\n quote! {\n\n ::conniecs::system::interval::TickerState::Frames {\n\n interval: #iv,\n\n ticks: 0,\n\n }\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":68,"score":51678.95167196641},{"content":"fn parse_interval(attr: &Meta) -> proc_macro2::TokenStream {\n\n match attr {\n\n Meta::NameValue(mnv) => match &mnv.lit {\n\n Lit::Str(time) => parse_iv_time(&time.value()),\n\n Lit::Int(time) => frame_iv(time.value()),\n\n _ => improper_interval_fmt(),\n\n },\n\n Meta::List(list) => parse_explicit_iv(list.nested.iter()),\n\n _ => improper_interval_fmt(),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":69,"score":51678.95167196641},{"content":"fn read_activations(attrs: &[Attribute]) -> proc_macro2::TokenStream {\n\n let mut activated = None;\n\n let mut reactivated = None;\n\n let mut deactivated = None;\n\n\n\n for attr in attrs {\n\n let meta = attr.parse_meta().unwrap();\n\n match meta.name().to_string().as_str() {\n\n \"activated\" => activated = Some(read_path_item(&meta, || improper_activated_fmt())),\n\n \"reactivated\" => {\n\n reactivated = Some(read_path_item(&meta, || improper_reactivated_fmt()))\n\n }\n\n \"deactivated\" => {\n\n deactivated = Some(read_path_item(&meta, || improper_deactivated_fmt()))\n\n }\n\n _ => (),\n\n }\n\n }\n\n\n\n let activated = activation_fn(\n","file_path":"conniecs-derive/src/system.rs","rank":70,"score":51678.95167196641},{"content":"fn parse_iv_time(time: &str) -> proc_macro2::TokenStream {\n\n let len = time.len();\n\n\n\n let ns = if time.ends_with(\"ms\") && len > 2 {\n\n let iv = parse_u64(&time[..len - 2]);\n\n iv * 1_000_000\n\n } else if (time.ends_with(\"us\") || time.ends_with(\"μs\")) && len > 2 {\n\n let iv = parse_u64(&time[..len - 2]);\n\n iv * 1_000\n\n } else if time.ends_with(\"ns\") && len > 2 {\n\n let iv = parse_u64(&time[..len - 2]);\n\n iv\n\n } else if time.ends_with(\"s\") && len > 1 {\n\n let iv = parse_u64(&time[..len - 1]);\n\n iv * 1_000_000_000\n\n } else {\n\n let iv = parse_u64(time);\n\n return frame_iv(iv);\n\n };\n\n\n\n frame_ns(ns)\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":71,"score":50425.40414368996},{"content":"fn activation_fn(name: Ident, item: Option<proc_macro2::TokenStream>) -> proc_macro2::TokenStream {\n\n if let Some(item) = item {\n\n quote! {\n\n fn #name (\n\n &mut self,\n\n entity: ::conniecs::entity::EntityData<Self::Components>,\n\n components: &Self::Components,\n\n services: &mut Self::Services,\n\n ) {\n\n #item (self, entity, components, services)\n\n }\n\n }\n\n } else {\n\n quote! {}\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/system.rs","rank":72,"score":50019.769853784645},{"content":"type DataHelper = conniecs::DataHelper<Components, Services>;\n","file_path":"tests/aspects.rs","rank":73,"score":45427.5395728787},{"content":"fn improper_format() -> ! {\n\n improper_attr_format(\"#[aspect(...)]\", \"conniecs::aspect\")\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":74,"score":45363.79111462626},{"content":"fn improper_comp_format() -> ! {\n\n improper_attr_format(\"#[components(...)]\", \"conniecs::aspect\")\n\n}\n","file_path":"conniecs-derive/src/aspect.rs","rank":75,"score":44326.89363386683},{"content":"fn unwrap_word(item: &Meta) -> &Ident {\n\n match item {\n\n Meta::Word(ident) => ident,\n\n _ => improper_format(),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":76,"score":37361.77109944514},{"content":"fn unwrap_meta(item: &NestedMeta) -> &Meta {\n\n match item {\n\n NestedMeta::Meta(item) => item,\n\n NestedMeta::Literal(_) => improper_format(),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":77,"score":36549.35323839393},{"content":"fn improper_attr_format(attr: &str, module: &str) -> ! {\n\n panic!(\n\n \"{} was not in the correct format. Please refer to the {} \\\n\n module documentation for more information.\",\n\n attr, module\n\n )\n\n}\n\n\n","file_path":"conniecs-derive/src/lib.rs","rank":78,"score":34603.44238246091},{"content":"fn quote_path(path: &str) -> proc_macro2::TokenStream {\n\n let mut tokens = proc_macro2::TokenStream::new();\n\n for (i, part) in path.split(\"::\").enumerate() {\n\n use proc_macro2::{Ident, Punct, Spacing, Span};\n\n if i != 0 {\n\n tokens.append_all(&[\n\n Punct::new(':', Spacing::Joint),\n\n Punct::new(':', Spacing::Joint),\n\n ]);\n\n }\n\n if part.len() > 0 {\n\n tokens.append(Ident::new(part, Span::call_site()));\n\n }\n\n }\n\n tokens\n\n}\n","file_path":"conniecs-derive/src/lib.rs","rank":79,"score":33902.462909842674},{"content":"type Comps<T> = ComponentList<Components, T>;\n","file_path":"tests/aspects.rs","rank":80,"score":32142.33031583885},{"content":"//! TODO: Add documentation including describing how the derive macros work\n\n\n","file_path":"src/services.rs","rank":81,"score":31538.4649034213},{"content":" let result = self.inner.insert(entity.entity().index(), component);\n\n if result.is_none() && !E::can_insert_components() {\n\n panic!(\"ComponentList::set was used to insert a new component when modification of activated components was not allowed\");\n\n }\n\n result\n\n }\n\n\n\n pub fn get<E>(&self, entity: E) -> Option<T>\n\n where\n\n E: EditData<C>,\n\n T: Clone,\n\n {\n\n self.inner.get(entity.entity().index()).cloned()\n\n }\n\n\n\n pub fn has<E>(&self, entity: E) -> bool\n\n where\n\n E: EditData<C>,\n\n {\n\n self.inner.contains_key(entity.entity().index())\n","file_path":"src/component.rs","rank":82,"score":30972.6200604517},{"content":"\n\n pub fn cold() -> Self {\n\n ComponentList {\n\n inner: Cold(HashMap::with_hasher(Default::default())),\n\n _marker: PhantomData,\n\n }\n\n }\n\n\n\n pub fn add(&mut self, entity: BuildData<C>, component: T) -> Option<T> {\n\n self.inner.insert(entity.0.index(), component)\n\n }\n\n\n\n pub fn remove(&mut self, entity: ModifyData<C>) -> Option<T> {\n\n self.inner.remove(entity.0.index())\n\n }\n\n\n\n pub fn set<E>(&mut self, entity: E, component: T) -> Option<T>\n\n where\n\n E: EditData<C>,\n\n {\n","file_path":"src/component.rs","rank":83,"score":30972.02563237945},{"content":"impl<C, T, E> Index<E> for ComponentList<C, T>\n\nwhere\n\n C: ComponentManager,\n\n T: Component,\n\n E: EditData<C>,\n\n{\n\n type Output = T;\n\n fn index(&self, entity: E) -> &T {\n\n self.inner.index(entity.entity().index())\n\n }\n\n}\n\n\n\nimpl<C, T, E> IndexMut<E> for ComponentList<C, T>\n\nwhere\n\n C: ComponentManager,\n\n T: Component,\n\n E: EditData<C>,\n\n{\n\n fn index_mut(&mut self, entity: E) -> &mut T {\n\n self.inner.index_mut(entity.entity().index())\n","file_path":"src/component.rs","rank":84,"score":30970.256787293725},{"content":" }\n\n\n\n pub fn borrow<E>(&mut self, entity: E) -> Option<&mut T>\n\n where\n\n E: EditData<C>,\n\n {\n\n self.inner.get_mut(entity.entity().index())\n\n }\n\n\n\n #[doc(hidden)]\n\n pub fn __clear(&mut self, entity: &IndexedEntity<C>) {\n\n self.inner.remove(entity.index());\n\n }\n\n\n\n #[doc(hidden)]\n\n pub fn __wipe(&mut self) {\n\n self.inner.clear();\n\n }\n\n}\n\n\n","file_path":"src/component.rs","rank":85,"score":30969.78832680097},{"content":"\n\n pub(crate) fn contains_key(&self, index: usize) -> bool {\n\n match *self {\n\n Hot(ref map) => map.contains_key(index),\n\n Cold(ref map) => map.contains_key(&index),\n\n }\n\n }\n\n\n\n pub(crate) fn index(&self, index: usize) -> &T {\n\n self.get(index)\n\n .unwrap_or_else(|| panic!(\"Entity at index {} does not have this component attached\"))\n\n }\n\n\n\n pub(crate) fn index_mut(&mut self, index: usize) -> &mut T {\n\n self.get_mut(index)\n\n .unwrap_or_else(|| panic!(\"Entity at index {} does not have this component attached\"))\n\n }\n\n\n\n pub(crate) fn get(&self, index: usize) -> Option<&T> {\n\n match *self {\n","file_path":"src/component.rs","rank":86,"score":30967.106565232276},{"content":"#[derive(Debug)]\n\npub(crate) enum InnerComponentList<T>\n\nwhere\n\n T: Component,\n\n{\n\n Hot(VecMap<T>),\n\n Cold(FnvHashMap<usize, T>),\n\n}\n\n\n\nimpl<C, T> ComponentList<C, T>\n\nwhere\n\n C: ComponentManager,\n\n T: Component,\n\n{\n\n pub fn hot() -> Self {\n\n ComponentList {\n\n inner: Hot(VecMap::new()),\n\n _marker: PhantomData,\n\n }\n\n }\n","file_path":"src/component.rs","rank":87,"score":30966.16892555551},{"content":" }\n\n}\n\n\n\nimpl<T> InnerComponentList<T>\n\nwhere\n\n T: Component,\n\n{\n\n pub(crate) fn insert(&mut self, index: usize, component: T) -> Option<T> {\n\n match *self {\n\n Hot(ref mut map) => map.insert(index, component),\n\n Cold(ref mut map) => map.insert(index, component),\n\n }\n\n }\n\n\n\n pub(crate) fn remove(&mut self, index: usize) -> Option<T> {\n\n match *self {\n\n Hot(ref mut map) => map.remove(index),\n\n Cold(ref mut map) => map.remove(&index),\n\n }\n\n }\n","file_path":"src/component.rs","rank":88,"score":30964.754039773223},{"content":"//! TODO: Add documentation including describing how the derive macros work\n\n\n\nuse fnv::FnvHashMap;\n\nuse vec_map::VecMap;\n\n\n\nuse std::collections::HashMap;\n\nuse std::marker::PhantomData;\n\nuse std::ops::{Index, IndexMut};\n\n\n\nuse self::InnerComponentList::{Cold, Hot};\n\nuse crate::entity::{BuildData, EditData, IndexedEntity, ModifyData};\n\n\n\n/// Marks types which are suitable for being components. It is implemented for all\n\n/// types which are `'static`.\n","file_path":"src/component.rs","rank":89,"score":30963.35577841149},{"content":" Hot(ref map) => map.get(index),\n\n Cold(ref map) => map.get(&index),\n\n }\n\n }\n\n\n\n pub(crate) fn get_mut(&mut self, index: usize) -> Option<&mut T> {\n\n match *self {\n\n Hot(ref mut map) => map.get_mut(index),\n\n Cold(ref mut map) => map.get_mut(&index),\n\n }\n\n }\n\n\n\n pub(crate) fn clear(&mut self) {\n\n match *self {\n\n Hot(ref mut map) => map.clear(),\n\n Cold(ref mut map) => map.clear(),\n\n }\n\n }\n\n}\n","file_path":"src/component.rs","rank":90,"score":30962.622932916696},{"content":"fn read_path_item<F>(attr: &syn::Meta, fail: F) -> String\n\nwhere\n\n F: FnOnce(),\n\n{\n\n match attr {\n\n syn::Meta::Word(word) => word.to_string(),\n\n syn::Meta::List(list) => {\n\n let items = &list.nested;\n\n if items.len() != 1 {\n\n fail();\n\n unreachable!();\n\n }\n\n\n\n match items[0] {\n\n syn::NestedMeta::Literal(syn::Lit::Str(ref value)) => value.value(),\n\n syn::NestedMeta::Meta(syn::Meta::Word(ref word)) => word.to_string(),\n\n _ => {\n\n fail();\n\n unreachable!();\n\n }\n","file_path":"conniecs-derive/src/lib.rs","rank":91,"score":29944.744622344497},{"content":"fn unwrap_list<'a>(item: &'a Meta) -> impl Iterator<Item = &'a NestedMeta> {\n\n match item {\n\n Meta::List(list) => list.nested.iter(),\n\n _ => improper_format(),\n\n }\n\n}\n\n\n","file_path":"conniecs-derive/src/aspect.rs","rank":92,"score":29253.91949896077},{"content":" }\n\n }\n\n}\n\n\n\npub struct WatchedEntityIter<'a, C>\n\nwhere\n\n C: ComponentManager,\n\n{\n\n pub(crate) current_range: Range,\n\n pub(crate) indices: BIter<'a, Range>,\n\n pub(crate) entities: &'a FnvHashMap<usize, IndexedEntity<C>>,\n\n}\n\n\n\nimpl<'a, C> Clone for WatchedEntityIter<'a, C>\n\nwhere\n\n C: ComponentManager,\n\n{\n\n fn clone(&self) -> Self {\n\n WatchedEntityIter {\n\n current_range: self.current_range,\n","file_path":"src/entity/iter.rs","rank":97,"score":28820.32873995822}],"string":"[\n {\n \"content\": \"fn activated(_: &mut IVSystem, _: EntityData, _: &Components, _: &mut Services) {\\n\\n ATOMIC_BOOP.store(true, std::sync::atomic::Ordering::SeqCst);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 0,\n \"score\": 173722.56101871424\n },\n {\n \"content\": \"pub trait EntityBuilder<C, M>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n M: ServiceManager,\\n\\n{\\n\\n fn build<'a>(self, entity: BuildData<'a, C>, components: &mut C, services: &mut M);\\n\\n}\\n\\n\\n\\nimpl<C, M> EntityBuilder<C, M> for ()\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n M: ServiceManager,\\n\\n{\\n\\n fn build(self, _: BuildData<C>, _: &mut C, _: &mut M) {}\\n\\n}\\n\\n\\n\\nimpl<C, M, F> EntityBuilder<C, M> for F\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n M: ServiceManager,\\n\\n F: FnOnce(BuildData<C>, &mut C, &mut M),\\n\\n{\\n\\n fn build(self, entity: BuildData<C>, components: &mut C, services: &mut M) {\\n\\n self(entity, components, services)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/entity/builder.rs\",\n \"rank\": 1,\n \"score\": 149730.37438659018\n },\n {\n \"content\": \"fn eprocess(_: &mut ESystem, entities: EntityIter, data: &mut DataHelper) {\\n\\n for entity in entities {\\n\\n data.components.foo[entity].push_str(\\\"ghjkl\\\");\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Default, System)]\\n\\n#[system_type(Interact)]\\n\\n#[process = \\\"iprocess\\\"]\\n\\n#[aspect_a(all(bar), none(baz))]\\n\\n#[aspect_b(all(baz), none(bar))]\\n\\npub struct ISystem;\\n\\n\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 2,\n \"score\": 144772.27767466046\n },\n {\n \"content\": \"pub trait EntityModifier<C, M>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n M: ServiceManager,\\n\\n{\\n\\n fn modify<'a>(self, entity: ModifyData<'a, C>, components: &mut C, services: &mut M);\\n\\n}\\n\\n\\n\\nimpl<C, M> EntityModifier<C, M> for ()\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n M: ServiceManager,\\n\\n{\\n\\n fn modify(self, _: ModifyData<C>, _: &mut C, _: &mut M) {}\\n\\n}\\n\\n\\n\\nimpl<C, M, F> EntityModifier<C, M> for F\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n M: ServiceManager,\\n\\n F: FnOnce(ModifyData<C>, &mut C, &mut M),\\n\\n{\\n\\n fn modify(self, entity: ModifyData<C>, components: &mut C, services: &mut M) {\\n\\n self(entity, components, services)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/entity/builder.rs\",\n \"rank\": 3,\n \"score\": 140801.4132852698\n },\n {\n \"content\": \"/// This trait is implemented automatically when you `#[derive(System)]` with the following:\\n\\n///\\n\\n/// ```\\n\\n/// # #[macro_use] extern crate conniecs_derive; extern crate conniecs;\\n\\n/// # use conniecs::{EntityIter, DataHelper};\\n\\n/// # #[derive(ComponentManager)] struct Components {\\n\\n/// # #[hot] pub foo: conniecs::ComponentList<Components, ()>, }\\n\\n/// #[derive(System, Default)]\\n\\n/// #[system_type(entity)]\\n\\n/// #[aspect = \\\"some::aspect::UnitStruct\\\"]\\n\\n/// #[process(process)]\\n\\n/// struct MySystem;\\n\\n/// # fn process(_: &mut MySystem, _: EntityIter<Components>, _:\\n\\n/// # &mut DataHelper<Components, Services>) {}\\n\\n/// # mod some { pub mod aspect { #[derive(Aspect, Copy, Clone)]\\n\\n/// # #[aspect(all(foo))] pub struct UnitStruct; } }\\n\\n/// # #[derive(ServiceManager, Default)] struct Services {}\\n\\n/// # #[derive(SystemManager)] struct Systems {\\n\\n/// # #[passive] sys: conniecs::system::EntitySystem<MySystem> }\\n\\n/// # fn main() { conniecs::World::<Systems>::new(); }\\n\\n/// ```\\n\\n///\\n\\n/// or\\n\\n///\\n\\n/// ```\\n\\n/// # #[macro_use] extern crate conniecs_derive; extern crate conniecs;\\n\\n/// # use conniecs::{EntityIter};\\n\\n/// # #[derive(ComponentManager)] struct Components { #[hot] pub foo:\\n\\n/// # conniecs::ComponentList<Components, String>, }\\n\\n/// #[derive(System, Default)]\\n\\n/// #[system_type(entity)]\\n\\n/// #[aspect(all(foo))]\\n\\n/// #[process = \\\"process\\\"]\\n\\n/// struct MySystem;\\n\\n///\\n\\n/// type DataHelper = conniecs::DataHelper<Components, Services>;\\n\\n/// fn process(_: &mut MySystem, entities: EntityIter<Components>, data: &mut DataHelper) {\\n\\n/// for entity in entities {\\n\\n/// println!(\\\"boop the {}\\\", &data.components.foo[entity]);\\n\\n/// }\\n\\n/// }\\n\\n/// # #[derive(ServiceManager, Default)] struct Services {}\\n\\n/// # #[derive(SystemManager)] struct Systems {\\n\\n/// # #[passive] sys: conniecs::system::EntitySystem<MySystem> }\\n\\n/// # fn main() { conniecs::World::<Systems>::new(); }\\n\\n/// ```\\n\\npub trait FilteredEntitySystem: System {\\n\\n fn create_aspect() -> Aspect<Self::Components>;\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct EntitySystem<T>\\n\\nwhere\\n\\n T: EntityProcess,\\n\\n{\\n\\n pub inner: T,\\n\\n pub watcher: Watcher<T::Components>,\\n\\n}\\n\\n\\n\\nimpl<T> Deref for EntitySystem<T>\\n\\nwhere\\n\\n T: EntityProcess,\\n\\n{\\n\\n type Target = T;\\n\\n fn deref(&self) -> &T {\\n\\n &self.inner\\n\",\n \"file_path\": \"src/system/entity.rs\",\n \"rank\": 5,\n \"score\": 128674.9644513795\n },\n {\n \"content\": \"pub trait EditData<C: ComponentManager> {\\n\\n #[doc(hidden)]\\n\\n fn entity(&self) -> &IndexedEntity<C>;\\n\\n #[doc(hidden)]\\n\\n fn can_insert_components() -> bool;\\n\\n}\\n\\n\\n\\nimpl<'a, C: ComponentManager> EditData<C> for ModifyData<'a, C> {\\n\\n #[doc(hidden)]\\n\\n #[inline]\\n\\n fn entity(&self) -> &IndexedEntity<C> {\\n\\n self.0\\n\\n }\\n\\n\\n\\n #[doc(hidden)]\\n\\n #[inline]\\n\\n fn can_insert_components() -> bool {\\n\\n true\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/entity/data.rs\",\n \"rank\": 6,\n \"score\": 128055.03335763628\n },\n {\n \"content\": \"fn iprocess(_: &mut ISystem, bars: EntityIter, bazes: EntityIter, data: &mut DataHelper) {\\n\\n for bar_entity in bars {\\n\\n for baz_entity in bazes.clone() {\\n\\n data.components.baz[baz_entity][0] += data.components.bar[bar_entity];\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Default, System)]\\n\\n#[system_type(Interval)]\\n\\n#[process = \\\"interval_process\\\"]\\n\\n#[activated = \\\"activated\\\"]\\n\\n#[interval = \\\"3\\\"]\\n\\npub struct IVSystem {\\n\\n pub booped: bool,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 7,\n \"score\": 117024.93631364533\n },\n {\n \"content\": \"pub trait EntityProcess: FilteredEntitySystem {\\n\\n fn process<'a>(\\n\\n &mut self,\\n\\n entities: EntityIter<'a, Self::Components>,\\n\\n data: &mut DataHelper<Self::Components, Self::Services>,\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/entity.rs\",\n \"rank\": 8,\n \"score\": 104954.29049761867\n },\n {\n \"content\": \"fn interval_process(iv: &mut IVSystem, _: &mut DataHelper) {\\n\\n iv.booped = !iv.booped;\\n\\n}\\n\\n\\n\\nstatic ATOMIC_BOOP: std::sync::atomic::AtomicBool = std::sync::atomic::ATOMIC_BOOL_INIT;\\n\\n\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 9,\n \"score\": 104759.24728308315\n },\n {\n \"content\": \"pub fn read_data_items<'a>(\\n\\n mut items: impl Iterator<Item = &'a NestedMeta>,\\n\\n) -> (proc_macro2::TokenStream, proc_macro2::TokenStream) {\\n\\n let (item0, item1) = match (items.next(), items.next(), items.next()) {\\n\\n (Some(item0), Some(item1), None) => (item0, item1),\\n\\n _ => improper_data_fmt(),\\n\\n };\\n\\n\\n\\n let comps = match item0 {\\n\\n NestedMeta::Literal(Lit::Str(path)) => path.value(),\\n\\n NestedMeta::Meta(Meta::Word(word)) => word.to_string(),\\n\\n NestedMeta::Meta(Meta::NameValue(MetaNameValue {\\n\\n ident,\\n\\n lit: Lit::Str(path),\\n\\n ..\\n\\n })) if ident == \\\"components\\\" => path.value(),\\n\\n _ => improper_data_fmt(),\\n\\n };\\n\\n\\n\\n let servs = match item1 {\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 10,\n \"score\": 103335.42093760139\n },\n {\n \"content\": \"pub trait AspectFilter<C: ComponentManager>: 'static {\\n\\n fn check<'a>(&self, entity: EntityData<'a, C>, components: &C) -> bool;\\n\\n}\\n\\n\\n\\nimpl<F, C> AspectFilter<C> for F\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n F: Fn(EntityData<C>, &C) -> bool + 'static,\\n\\n{\\n\\n #[inline]\\n\\n fn check<'a>(&self, entity: EntityData<'a, C>, components: &C) -> bool {\\n\\n (*self)(entity, components)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/aspect.rs\",\n \"rank\": 11,\n \"score\": 103098.15760177544\n },\n {\n \"content\": \"fn is_passive(attrs: &[Attribute]) -> bool {\\n\\n for attr in attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n if meta.name() == \\\"passive\\\" {\\n\\n return true;\\n\\n }\\n\\n }\\n\\n\\n\\n false\\n\\n}\\n\",\n \"file_path\": \"conniecs-derive/src/systems.rs\",\n \"rank\": 12,\n \"score\": 103084.62574952564\n },\n {\n \"content\": \"pub trait System {\\n\\n type Components: ComponentManager;\\n\\n type Services: ServiceManager;\\n\\n\\n\\n fn build_system() -> Self;\\n\\n\\n\\n #[inline]\\n\\n fn activated(\\n\\n &mut self,\\n\\n entity: EntityData<Self::Components>,\\n\\n components: &Self::Components,\\n\\n services: &mut Self::Services,\\n\\n ) {\\n\\n let (_, _, _) = (entity, components, services);\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn reactivated(\\n\\n &mut self,\\n\\n entity: EntityData<Self::Components>,\\n\",\n \"file_path\": \"src/system/mod.rs\",\n \"rank\": 13,\n \"score\": 102998.58634926792\n },\n {\n \"content\": \"pub trait SystemInterval: System {\\n\\n fn create_interval() -> TickerState;\\n\\n}\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\\npub struct IntervalSystem<T>\\n\\nwhere\\n\\n T: SystemInterval,\\n\\n{\\n\\n pub inner: T,\\n\\n pub ticker: TickerState,\\n\\n}\\n\\n\\n\\nimpl<T> Deref for IntervalSystem<T>\\n\\nwhere\\n\\n T: SystemInterval,\\n\\n{\\n\\n type Target = T;\\n\\n fn deref(&self) -> &T {\\n\\n &self.inner\\n\",\n \"file_path\": \"src/system/interval.rs\",\n \"rank\": 14,\n \"score\": 98823.3750660349\n },\n {\n \"content\": \"pub trait InteractSystemFilter: System {\\n\\n fn create_filter_a() -> Aspect<Self::Components>;\\n\\n fn create_filter_b() -> Aspect<Self::Components>;\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct InteractSystem<T>\\n\\nwhere\\n\\n T: InteractProcess,\\n\\n{\\n\\n pub inner: T,\\n\\n pub watcher_a: Watcher<T::Components>,\\n\\n pub watcher_b: Watcher<T::Components>,\\n\\n}\\n\\n\\n\\nimpl<T> Deref for InteractSystem<T>\\n\\nwhere\\n\\n T: InteractProcess,\\n\\n{\\n\\n type Target = T;\\n\",\n \"file_path\": \"src/system/interact.rs\",\n \"rank\": 15,\n \"score\": 97138.98978068968\n },\n {\n \"content\": \"pub trait Process: System {\\n\\n fn process(&mut self, data: &mut DataHelper<Self::Components, Self::Services>);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/mod.rs\",\n \"rank\": 16,\n \"score\": 96840.81473837285\n },\n {\n \"content\": \"#[test]\\n\\npub fn simulate() {\\n\\n let mut world = conniecs::World::<Systems>::new();\\n\\n assert_eq!(world.systems.ivsystem.booped, false);\\n\\n assert_eq!(ATOMIC_BOOP.load(std::sync::atomic::Ordering::SeqCst), false);\\n\\n\\n\\n let asdf = world.data.create_entity(|e, c, _| {\\n\\n // We need a foo!\\n\\n c.foo.add(e, \\\"asdf\\\".to_string());\\n\\n });\\n\\n\\n\\n let bar = world.data.create_entity(|e, c, _| {\\n\\n // We need a bar\\n\\n c.bar.add(e, 0.25);\\n\\n });\\n\\n let _bar1 = world.data.create_entity(|e, c, _| {\\n\\n // We need another bar\\n\\n c.bar.add(e, 0.25);\\n\\n });\\n\\n\\n\\n let baz = world.data.create_entity(|e, c, _| {\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 17,\n \"score\": 95164.16475673037\n },\n {\n \"content\": \"#[proc_macro_derive(ServiceManager)]\\n\\npub fn derive_services(input: TokenStream) -> TokenStream {\\n\\n // Parse the string representation\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n // Build the impl\\n\\n let result = services::impl_services(ast);\\n\\n\\n\\n // Return the generated impl\\n\\n result.into()\\n\\n}\\n\\n\\n\\n#[proc_macro_derive(\\n\\n System,\\n\\n attributes(\\n\\n data,\\n\\n system_type,\\n\\n process,\\n\\n aspect,\\n\\n aspect_a,\\n\\n aspect_b,\\n\\n interval,\\n\\n timed_interval,\\n\\n activated,\\n\\n reactivated,\\n\\n deactivated\\n\\n )\\n\\n)]\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 18,\n \"score\": 91208.66804811859\n },\n {\n \"content\": \"#[proc_macro_derive(ComponentManager, attributes(hot, cold))]\\n\\npub fn derive_components(input: TokenStream) -> TokenStream {\\n\\n // Parse the string representation\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n // Build the impl\\n\\n let result = components::impl_components(ast);\\n\\n\\n\\n // Return the generated impl\\n\\n result.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 19,\n \"score\": 90828.21923434854\n },\n {\n \"content\": \"pub fn impl_services(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let name = ast.ident;\\n\\n\\n\\n quote!{\\n\\n impl ::conniecs::services::ServiceManager for #name {\\n\\n #[doc(hidden)]\\n\\n fn __please_use_the_derive_attribute() {}\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"conniecs-derive/src/services.rs\",\n \"rank\": 20,\n \"score\": 90227.76621705634\n },\n {\n \"content\": \"pub fn impl_components(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n if ast.generics != Default::default() {\\n\\n panic!(\\\"There may not be generics attached to the Components struct\\\");\\n\\n }\\n\\n\\n\\n let name = ast.ident;\\n\\n let fields = match &ast.data {\\n\\n Data::Struct(data) => match &data.fields {\\n\\n Fields::Named(fields) => Some(&fields.named),\\n\\n Fields::Unit => None,\\n\\n Fields::Unnamed(_) => {\\n\\n panic!(\\\"Components may not be represented by a tuple struct.\\\");\\n\\n }\\n\\n },\\n\\n Data::Union(_) => {\\n\\n panic!(\\\"Components may not be represented by a union. Structs only.\\\");\\n\\n }\\n\\n Data::Enum(_) => {\\n\\n panic!(\\\"Components may not be represented by an enum. Structs only.\\\");\\n\\n }\\n\",\n \"file_path\": \"conniecs-derive/src/components.rs\",\n \"rank\": 21,\n \"score\": 89720.5495584287\n },\n {\n \"content\": \"fn panicker_update(_: &mut Panicker, _: &mut DataHelper) {\\n\\n panic!(\\\"this shouldn't get called\\\");\\n\\n}\\n\\n\\n\\n#[derive(Debug, Default, System)]\\n\\n#[system_type(Entity)]\\n\\n#[process = \\\"eprocess\\\"]\\n\\n#[aspect(all(foo), none(qux))]\\n\\npub struct ESystem;\\n\\n\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 22,\n \"score\": 89545.712135905\n },\n {\n \"content\": \"#[proc_macro_derive(SystemManager, attributes(data, passive))]\\n\\npub fn derive_systems(input: TokenStream) -> TokenStream {\\n\\n // Parse the string representation\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n // Build the impl\\n\\n let result = systems::impl_systems(ast);\\n\\n\\n\\n // Return the generated impl\\n\\n result.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 23,\n \"score\": 88461.00995124456\n },\n {\n \"content\": \"pub fn derive_system(input: TokenStream) -> TokenStream {\\n\\n // Parse the string representation\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n // Build the impl\\n\\n let result = system::impl_system(ast);\\n\\n\\n\\n // Return the generated impl\\n\\n result.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 24,\n \"score\": 88458.30032049588\n },\n {\n \"content\": \"pub fn quote_aspect(\\n\\n ty: &Ident,\\n\\n cty: &proc_macro2::TokenStream,\\n\\n all_filters: &[Ident],\\n\\n none_filters: &[Ident],\\n\\n) -> proc_macro2::TokenStream {\\n\\n quote! {\\n\\n impl ::conniecs::aspect::AspectFilter<#cty> for #ty {\\n\\n fn check<'a>(&self, entity: ::conniecs::EntityData<'a, #cty >, components: & #cty ) -> bool {\\n\\n #(\\n\\n if !components.#all_filters.has(entity) {\\n\\n return false;\\n\\n }\\n\\n )*\\n\\n #(\\n\\n if components.#none_filters.has(entity) {\\n\\n return false;\\n\\n }\\n\\n )*\\n\\n true\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 25,\n \"score\": 88232.96993270525\n },\n {\n \"content\": \"fn process_update(_: &mut Update, data: &mut DataHelper) {\\n\\n for entity in data.entities() {\\n\\n if data.components.foo.has(entity) {\\n\\n println!(\\\"{}\\\", data.components.foo[entity]);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Default, System)]\\n\\n#[process(panicker_update)]\\n\\npub struct Panicker;\\n\\n\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 26,\n \"score\": 87891.5438859821\n },\n {\n \"content\": \"pub fn impl_systems(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let name = &ast.ident;\\n\\n let mut cs_data = None;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"data\\\" => cs_data = Some(read_data(&meta)),\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n let fields = match &ast.data {\\n\\n Data::Struct(data) => match &data.fields {\\n\\n Fields::Named(fields) => Some(&fields.named),\\n\\n Fields::Unit => None,\\n\\n Fields::Unnamed(_) => {\\n\\n panic!(\\\"Components may not be represented by a tuple struct.\\\")\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"conniecs-derive/src/systems.rs\",\n \"rank\": 27,\n \"score\": 86559.36300630885\n },\n {\n \"content\": \"pub fn impl_system(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let mut kind = SystemType::Basic;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"system_type\\\" => kind = read_systy(&meta),\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n match kind {\\n\\n SystemType::Basic => impl_basic_system(&ast),\\n\\n SystemType::Entity => impl_entity_system(&ast),\\n\\n SystemType::Lazy => impl_lazy_system(&ast),\\n\\n SystemType::Interval => impl_interval_system(&ast),\\n\\n SystemType::Interact => impl_interact_system(&ast),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 28,\n \"score\": 86559.36300630885\n },\n {\n \"content\": \"pub fn read_aspect<'a>(\\n\\n items: impl IntoIterator<Item = &'a NestedMeta>,\\n\\n all: &mut Vec<Ident>,\\n\\n none: &mut Vec<Ident>,\\n\\n) {\\n\\n for item in items {\\n\\n let item = unwrap_meta(item);\\n\\n let items = unwrap_list(item);\\n\\n match item.name().to_string().as_str() {\\n\\n \\\"all\\\" => {\\n\\n for item in items {\\n\\n let item = unwrap_meta(item);\\n\\n let component = unwrap_word(item);\\n\\n all.push(component.clone());\\n\\n }\\n\\n }\\n\\n \\\"none\\\" => {\\n\\n for item in items {\\n\\n let item = unwrap_meta(item);\\n\\n let component = unwrap_word(item);\\n\\n none.push(component.clone());\\n\\n }\\n\\n }\\n\\n _ => improper_format(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 29,\n \"score\": 84607.61276766294\n },\n {\n \"content\": \"enum SystemType {\\n\\n Basic,\\n\\n Entity,\\n\\n Lazy,\\n\\n Interval,\\n\\n Interact,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 30,\n \"score\": 82817.91342342037\n },\n {\n \"content\": \"pub fn read_aspect_meta<'a>(\\n\\n attr: &'a Meta,\\n\\n all: &mut Vec<Ident>,\\n\\n none: &mut Vec<Ident>,\\n\\n) -> Option<proc_macro2::TokenStream> {\\n\\n match attr {\\n\\n Meta::List(list) => {\\n\\n read_aspect(list.nested.iter(), all, none);\\n\\n None\\n\\n }\\n\\n Meta::NameValue(MetaNameValue {\\n\\n lit: Lit::Str(path),\\n\\n ..\\n\\n }) => Some(quote_path(&path.value())),\\n\\n _ => improper_format(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 31,\n \"score\": 82672.37799603821\n },\n {\n \"content\": \"/// Marks types which are suitable for being components. It is implemented for all\\n\\n/// types which are `'static`.\\n\\npub trait Component: 'static {}\\n\\nimpl<T: 'static> Component for T {}\\n\\n\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 32,\n \"score\": 81323.40175766646\n },\n {\n \"content\": \"type EntityData<'a> = conniecs::EntityData<'a, Components>;\\n\\n\\n\\n#[derive(Aspect)]\\n\\n#[aspect(all(foo, bar))]\\n\\npub struct FooBarAspect;\\n\\n\\n\\n#[derive(Debug, Default, ServiceManager)]\\n\\npub struct Services;\\n\\n\\n\\n#[derive(Debug, ComponentManager)]\\n\\npub struct Components {\\n\\n #[cold]\\n\\n pub foo: Comps<String>,\\n\\n\\n\\n #[hot]\\n\\n pub bar: Comps<f32>,\\n\\n #[hot]\\n\\n pub baz: Comps<[f32; 3]>,\\n\\n\\n\\n #[cold]\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 33,\n \"score\": 79793.31173080736\n },\n {\n \"content\": \"pub trait ServiceManager: 'static {\\n\\n #[doc(hidden)]\\n\\n fn __please_use_the_derive_attribute();\\n\\n}\\n\\n\\n\\nimpl ServiceManager for () {\\n\\n #[doc(hidden)]\\n\\n fn __please_use_the_derive_attribute() {}\\n\\n}\\n\",\n \"file_path\": \"src/services.rs\",\n \"rank\": 34,\n \"score\": 79759.77470232907\n },\n {\n \"content\": \"/// This is the trait implemented for your struct containing all of your\\n\\n/// component lists. You should not try to implement this manually. Use\\n\\n/// `#[derive(Components)]` instead. See the module documentation for more\\n\\n/// information.\\n\\npub trait ComponentManager: 'static {\\n\\n fn build_manager() -> Self;\\n\\n\\n\\n #[doc(hidden)]\\n\\n fn __wipe_all(&mut self);\\n\\n\\n\\n #[doc(hidden)]\\n\\n fn __please_use_the_derive_attribute();\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct ComponentList<C, T>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n T: Component,\\n\\n{\\n\\n pub(crate) inner: InnerComponentList<T>,\\n\\n _marker: PhantomData<C>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 35,\n \"score\": 79125.51502380779\n },\n {\n \"content\": \"pub trait SystemManager {\\n\\n type Components: ComponentManager;\\n\\n type Services: ServiceManager;\\n\\n\\n\\n fn build_manager() -> Self;\\n\\n\\n\\n fn activated(\\n\\n &mut self,\\n\\n entity: EntityData<Self::Components>,\\n\\n components: &Self::Components,\\n\\n services: &mut Self::Services,\\n\\n );\\n\\n\\n\\n fn reactivated(\\n\\n &mut self,\\n\\n entity: EntityData<Self::Components>,\\n\\n components: &Self::Components,\\n\\n services: &mut Self::Services,\\n\\n );\\n\\n\\n\",\n \"file_path\": \"src/system/mod.rs\",\n \"rank\": 36,\n \"score\": 77061.21282814152\n },\n {\n \"content\": \"pub fn read_data(item: &Meta) -> (proc_macro2::TokenStream, proc_macro2::TokenStream) {\\n\\n match item {\\n\\n Meta::List(items) => read_data_items(items.nested.iter()),\\n\\n _ => improper_data_fmt(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 37,\n \"score\": 74159.29632420116\n },\n {\n \"content\": \"fn impl_entity_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let name = &ast.ident;\\n\\n let mut cs_data = None;\\n\\n let mut init_func = None;\\n\\n let mut process_func = None;\\n\\n let mut aspect_all = vec![];\\n\\n let mut aspect_none = vec![];\\n\\n\\n\\n let aspect_id = Ident::new(&format!(\\\"{}EntityAspect\\\", name), Span::call_site());\\n\\n let mut aspect_path = None;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"data\\\" => cs_data = Some(read_data(&meta)),\\n\\n \\\"init\\\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\\n\\n \\\"process\\\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\\n\\n \\\"aspect\\\" => aspect_path = read_aspect_meta(&meta, &mut aspect_all, &mut aspect_none),\\n\\n _ => (),\\n\\n }\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 38,\n \"score\": 72653.85847000366\n },\n {\n \"content\": \"#[proc_macro_derive(Aspect, attributes(aspect, components))]\\n\\npub fn derive_aspect(input: TokenStream) -> TokenStream {\\n\\n // Parse the string representation\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n // Build the impl\\n\\n let result = aspect::impl_aspect(ast);\\n\\n\\n\\n //panic!(\\\"{}\\\", result);\\n\\n\\n\\n result.into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 39,\n \"score\": 70684.21195401519\n },\n {\n \"content\": \"pub trait InteractProcess: InteractSystemFilter {\\n\\n fn process<'a>(\\n\\n &mut self,\\n\\n entities_a: EntityIter<'a, Self::Components>,\\n\\n entities_b: EntityIter<'a, Self::Components>,\\n\\n data: &mut DataHelper<Self::Components, Self::Services>,\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/interact.rs\",\n \"rank\": 40,\n \"score\": 69716.6293217522\n },\n {\n \"content\": \"fn improper_interval_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[interval = ...]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 41,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn improper_process_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[process(...)]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 42,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn improper_reactivated_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[reactivated = ...]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 43,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn improper_deactivated_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[deactivated = ...]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 44,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn improper_activated_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[activated = ...]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 45,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn improper_init_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[init(...)]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 46,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn improper_systy_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[system_type(...)]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 47,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn improper_data_fmt() -> ! {\\n\\n improper_attr_format(\\\"#[data(...)]\\\", \\\"conniecs::system\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 48,\n \"score\": 65864.24787402073\n },\n {\n \"content\": \"fn parse_explicit_iv<'a>(\\n\\n mut items: impl Iterator<Item = &'a NestedMeta>,\\n\\n) -> proc_macro2::TokenStream {\\n\\n let item = items.next();\\n\\n if item.is_none() || items.next().is_some() {\\n\\n improper_interval_fmt();\\n\\n }\\n\\n\\n\\n match item.unwrap() {\\n\\n NestedMeta::Literal(Lit::Str(time)) => parse_iv_time(&time.value()),\\n\\n NestedMeta::Literal(Lit::Int(time)) => frame_iv(time.value()),\\n\\n NestedMeta::Meta(Meta::NameValue(mnv)) => {\\n\\n let iv = match &mnv.lit {\\n\\n Lit::Str(time) => parse_u64(&time.value()),\\n\\n Lit::Int(iv) => iv.value(),\\n\\n _ => improper_interval_fmt(),\\n\\n };\\n\\n let ns = match mnv.ident.to_string().as_str() {\\n\\n \\\"ticks\\\" => return frame_iv(iv),\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 49,\n \"score\": 63816.95845070253\n },\n {\n \"content\": \"fn read_systy(attr: &Meta) -> SystemType {\\n\\n let systy = read_path_item(attr, || improper_systy_fmt());\\n\\n match &systy[..] {\\n\\n \\\"Basic\\\" | \\\"basic\\\" => SystemType::Basic,\\n\\n \\\"Entity\\\" | \\\"entity\\\" => SystemType::Entity,\\n\\n \\\"Lazy\\\" | \\\"lazy\\\" => SystemType::Lazy,\\n\\n \\\"Interval\\\" | \\\"interval\\\" => SystemType::Interval,\\n\\n \\\"Interact\\\" | \\\"interact\\\" => SystemType::Interact,\\n\\n _ => improper_systy_fmt(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 50,\n \"score\": 63416.73393206665\n },\n {\n \"content\": \"pub fn impl_aspect(ast: syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let ty = &ast.ident;\\n\\n let mut all_filters = vec![];\\n\\n let mut none_filters = vec![];\\n\\n let mut components_ty = None;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n\\n\\n match (attr.path.segments[0].ident.to_string().as_str(), &meta) {\\n\\n (\\\"components\\\", meta) => {\\n\\n let word = read_path_item(meta, || improper_comp_format());\\n\\n components_ty = Some(word);\\n\\n }\\n\\n (\\\"aspect\\\", Meta::List(list)) => {\\n\\n read_aspect(list.nested.iter(), &mut all_filters, &mut none_filters);\\n\\n }\\n\\n _ => continue,\\n\\n }\\n\\n }\\n\\n\\n\\n let cty = match components_ty {\\n\\n Some(ty) => quote_path(&ty),\\n\\n None => quote_path(\\\"crate::Components\\\"),\\n\\n };\\n\\n\\n\\n quote_aspect(ty, &cty, &all_filters, &none_filters)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 51,\n \"score\": 62824.10493988923\n },\n {\n \"content\": \"use crate::component::ComponentManager;\\n\\nuse crate::entity::{BuildData, ModifyData};\\n\\nuse crate::services::ServiceManager;\\n\\n\\n\",\n \"file_path\": \"src/entity/builder.rs\",\n \"rank\": 52,\n \"score\": 58872.30554334964\n },\n {\n \"content\": \"struct All;\\n\",\n \"file_path\": \"src/aspect.rs\",\n \"rank\": 53,\n \"score\": 58382.3852751766\n },\n {\n \"content\": \"fn parse_u64(time: &str) -> u64 {\\n\\n time.parse().map_err(|_| improper_interval_fmt()).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 54,\n \"score\": 57218.71902429292\n },\n {\n \"content\": \"fn field_info(field: &Field) -> (&Ident, Ident) {\\n\\n let kind_attr = field\\n\\n .attrs\\n\\n .iter()\\n\\n .filter_map(|a| a.parse_meta().ok())\\n\\n .filter(|m| m.name() == \\\"hot\\\" || m.name() == \\\"cold\\\")\\n\\n .nth(0);\\n\\n\\n\\n match kind_attr {\\n\\n Some(Meta::Word(kind)) => (field.ident.as_ref().unwrap(), kind),\\n\\n _ => panic!(\\\"All component lists must be marked with either #[hot] or #[cold]\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"conniecs-derive/src/components.rs\",\n \"rank\": 55,\n \"score\": 57013.80092252123\n },\n {\n \"content\": \"struct None;\\n\\n\\n\\nimpl<C> AspectFilter<C> for All\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n{\\n\\n #[inline]\\n\\n fn check<'a>(&self, _: EntityData<'a, C>, _: &C) -> bool {\\n\\n true\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<C> AspectFilter<C> for None\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n{\\n\\n #[inline]\\n\\n fn check<'a>(&self, _: EntityData<'a, C>, _: &C) -> bool {\\n\\n false\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/aspect.rs\",\n \"rank\": 56,\n \"score\": 56767.607737633705\n },\n {\n \"content\": \"type EntityIter<'a> = conniecs::EntityIter<'a, Components>;\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 57,\n \"score\": 54929.330668913644\n },\n {\n \"content\": \"fn impl_basic_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let name = &ast.ident;\\n\\n let mut cs_data = None;\\n\\n let mut init_func = None;\\n\\n let mut process_func = None;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"data\\\" => cs_data = Some(read_data(&meta)),\\n\\n \\\"init\\\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\\n\\n \\\"process\\\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n let (components, services) = match cs_data {\\n\\n Some((c, s)) => (c, s),\\n\\n None => (quote_path(\\\"crate::Components\\\"), quote_path(\\\"crate::Services\\\")),\\n\\n };\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 58,\n \"score\": 54776.470619773725\n },\n {\n \"content\": \"fn impl_lazy_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let name = &ast.ident;\\n\\n let mut cs_data = None;\\n\\n let mut process_func = None;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"data\\\" => cs_data = Some(read_data(&meta)),\\n\\n \\\"process\\\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n let (components, services) = match cs_data {\\n\\n Some((c, s)) => (c, s),\\n\\n None => (quote_path(\\\"crate::Components\\\"), quote_path(\\\"crate::Services\\\")),\\n\\n };\\n\\n\\n\\n let process = if let Some(proc_func) = process_func {\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 59,\n \"score\": 54776.470619773725\n },\n {\n \"content\": \"fn impl_interval_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let name = &ast.ident;\\n\\n let mut cs_data = None;\\n\\n let mut init_func = None;\\n\\n let mut process_func = None;\\n\\n let mut interval = None;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"data\\\" => cs_data = Some(read_data(&meta)),\\n\\n \\\"init\\\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\\n\\n \\\"process\\\" => process_func = Some(read_path_item(&meta, || improper_process_fmt())),\\n\\n \\\"interval\\\" => interval = Some(parse_interval(&meta)),\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n let (components, services) = match cs_data {\\n\\n Some((c, s)) => (c, s),\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 60,\n \"score\": 54776.470619773725\n },\n {\n \"content\": \"fn impl_interact_system(ast: &syn::DeriveInput) -> proc_macro2::TokenStream {\\n\\n let name = &ast.ident;\\n\\n let mut cs_data = None;\\n\\n let mut init_func = None;\\n\\n let mut process_func = None;\\n\\n let mut aspect_all_a = vec![];\\n\\n let mut aspect_none_a = vec![];\\n\\n let mut aspect_all_b = vec![];\\n\\n let mut aspect_none_b = vec![];\\n\\n\\n\\n let aspect_id_a = Ident::new(&format!(\\\"{}EntityAspectA\\\", name), Span::call_site());\\n\\n let mut aspect_path_a = None;\\n\\n let aspect_id_b = Ident::new(&format!(\\\"{}EntityAspectB\\\", name), Span::call_site());\\n\\n let mut aspect_path_b = None;\\n\\n\\n\\n for attr in &ast.attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"data\\\" => cs_data = Some(read_data(&meta)),\\n\\n \\\"init\\\" => init_func = Some(read_path_item(&meta, || improper_init_fmt())),\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 61,\n \"score\": 54776.470619773725\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> System for EntitySystem<T>\\n\\nwhere\\n\\n T: EntityProcess,\\n\\n{\\n\\n type Components = T::Components;\\n\\n type Services = T::Services;\\n\\n\\n\\n fn build_system() -> Self {\\n\\n EntitySystem::new()\\n\\n }\\n\\n\\n\\n fn activated(\\n\\n &mut self,\\n\\n entity: EntityData<T::Components>,\\n\\n components: &T::Components,\\n\\n services: &mut T::Services,\\n\",\n \"file_path\": \"src/system/entity.rs\",\n \"rank\": 62,\n \"score\": 54747.74391829918\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<T> DerefMut for EntitySystem<T>\\n\\nwhere\\n\\n T: EntityProcess,\\n\\n{\\n\\n fn deref_mut(&mut self) -> &mut T {\\n\\n &mut self.inner\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> EntitySystem<T>\\n\\nwhere\\n\\n T: EntityProcess,\\n\\n{\\n\\n pub fn new() -> EntitySystem<T> {\\n\\n EntitySystem {\\n\\n inner: T::build_system(),\\n\\n watcher: Watcher::new(T::create_aspect()),\\n\",\n \"file_path\": \"src/system/entity.rs\",\n \"rank\": 63,\n \"score\": 54742.905328109075\n },\n {\n \"content\": \" ) {\\n\\n self.watcher\\n\\n .activated(entity, components, services, &mut self.inner);\\n\\n }\\n\\n\\n\\n fn reactivated(\\n\\n &mut self,\\n\\n entity: EntityData<T::Components>,\\n\\n components: &T::Components,\\n\\n services: &mut T::Services,\\n\\n ) {\\n\\n self.watcher\\n\\n .reactivated(entity, components, services, &mut self.inner);\\n\\n }\\n\\n\\n\\n fn deactivated(\\n\\n &mut self,\\n\\n entity: EntityData<T::Components>,\\n\\n components: &T::Components,\\n\\n services: &mut T::Services,\\n\",\n \"file_path\": \"src/system/entity.rs\",\n \"rank\": 64,\n \"score\": 54741.993639543354\n },\n {\n \"content\": \" ) {\\n\\n self.watcher\\n\\n .deactivated(entity, components, services, &mut self.inner);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Process for EntitySystem<T>\\n\\nwhere\\n\\n T: EntityProcess,\\n\\n{\\n\\n fn process(&mut self, data: &mut DataHelper<T::Components, T::Services>) {\\n\\n self.inner.process(self.watcher.iter(), data);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/system/entity.rs\",\n \"rank\": 65,\n \"score\": 54741.62745973646\n },\n {\n \"content\": \"//! TODO: Add documentation including describing how the derive macros work\\n\\n\\n\\nuse std::ops::{Deref, DerefMut};\\n\\n\\n\\nuse crate::aspect::Aspect;\\n\\nuse crate::entity::{EntityData, EntityIter};\\n\\nuse crate::system::watcher::Watcher;\\n\\nuse crate::system::{Process, System};\\n\\nuse crate::world::DataHelper;\\n\\n\\n\",\n \"file_path\": \"src/system/entity.rs\",\n \"rank\": 66,\n \"score\": 54739.82934168165\n },\n {\n \"content\": \"fn frame_ns(ns: u64) -> proc_macro2::TokenStream {\\n\\n quote! {\\n\\n ::conniecs::system::interval::TickerState::Timed {\\n\\n interval: #ns,\\n\\n next_tick: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 67,\n \"score\": 51678.95167196641\n },\n {\n \"content\": \"fn frame_iv(iv: u64) -> proc_macro2::TokenStream {\\n\\n quote! {\\n\\n ::conniecs::system::interval::TickerState::Frames {\\n\\n interval: #iv,\\n\\n ticks: 0,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 68,\n \"score\": 51678.95167196641\n },\n {\n \"content\": \"fn parse_interval(attr: &Meta) -> proc_macro2::TokenStream {\\n\\n match attr {\\n\\n Meta::NameValue(mnv) => match &mnv.lit {\\n\\n Lit::Str(time) => parse_iv_time(&time.value()),\\n\\n Lit::Int(time) => frame_iv(time.value()),\\n\\n _ => improper_interval_fmt(),\\n\\n },\\n\\n Meta::List(list) => parse_explicit_iv(list.nested.iter()),\\n\\n _ => improper_interval_fmt(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 69,\n \"score\": 51678.95167196641\n },\n {\n \"content\": \"fn read_activations(attrs: &[Attribute]) -> proc_macro2::TokenStream {\\n\\n let mut activated = None;\\n\\n let mut reactivated = None;\\n\\n let mut deactivated = None;\\n\\n\\n\\n for attr in attrs {\\n\\n let meta = attr.parse_meta().unwrap();\\n\\n match meta.name().to_string().as_str() {\\n\\n \\\"activated\\\" => activated = Some(read_path_item(&meta, || improper_activated_fmt())),\\n\\n \\\"reactivated\\\" => {\\n\\n reactivated = Some(read_path_item(&meta, || improper_reactivated_fmt()))\\n\\n }\\n\\n \\\"deactivated\\\" => {\\n\\n deactivated = Some(read_path_item(&meta, || improper_deactivated_fmt()))\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n let activated = activation_fn(\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 70,\n \"score\": 51678.95167196641\n },\n {\n \"content\": \"fn parse_iv_time(time: &str) -> proc_macro2::TokenStream {\\n\\n let len = time.len();\\n\\n\\n\\n let ns = if time.ends_with(\\\"ms\\\") && len > 2 {\\n\\n let iv = parse_u64(&time[..len - 2]);\\n\\n iv * 1_000_000\\n\\n } else if (time.ends_with(\\\"us\\\") || time.ends_with(\\\"μs\\\")) && len > 2 {\\n\\n let iv = parse_u64(&time[..len - 2]);\\n\\n iv * 1_000\\n\\n } else if time.ends_with(\\\"ns\\\") && len > 2 {\\n\\n let iv = parse_u64(&time[..len - 2]);\\n\\n iv\\n\\n } else if time.ends_with(\\\"s\\\") && len > 1 {\\n\\n let iv = parse_u64(&time[..len - 1]);\\n\\n iv * 1_000_000_000\\n\\n } else {\\n\\n let iv = parse_u64(time);\\n\\n return frame_iv(iv);\\n\\n };\\n\\n\\n\\n frame_ns(ns)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 71,\n \"score\": 50425.40414368996\n },\n {\n \"content\": \"fn activation_fn(name: Ident, item: Option<proc_macro2::TokenStream>) -> proc_macro2::TokenStream {\\n\\n if let Some(item) = item {\\n\\n quote! {\\n\\n fn #name (\\n\\n &mut self,\\n\\n entity: ::conniecs::entity::EntityData<Self::Components>,\\n\\n components: &Self::Components,\\n\\n services: &mut Self::Services,\\n\\n ) {\\n\\n #item (self, entity, components, services)\\n\\n }\\n\\n }\\n\\n } else {\\n\\n quote! {}\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/system.rs\",\n \"rank\": 72,\n \"score\": 50019.769853784645\n },\n {\n \"content\": \"type DataHelper = conniecs::DataHelper<Components, Services>;\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 73,\n \"score\": 45427.5395728787\n },\n {\n \"content\": \"fn improper_format() -> ! {\\n\\n improper_attr_format(\\\"#[aspect(...)]\\\", \\\"conniecs::aspect\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 74,\n \"score\": 45363.79111462626\n },\n {\n \"content\": \"fn improper_comp_format() -> ! {\\n\\n improper_attr_format(\\\"#[components(...)]\\\", \\\"conniecs::aspect\\\")\\n\\n}\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 75,\n \"score\": 44326.89363386683\n },\n {\n \"content\": \"fn unwrap_word(item: &Meta) -> &Ident {\\n\\n match item {\\n\\n Meta::Word(ident) => ident,\\n\\n _ => improper_format(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 76,\n \"score\": 37361.77109944514\n },\n {\n \"content\": \"fn unwrap_meta(item: &NestedMeta) -> &Meta {\\n\\n match item {\\n\\n NestedMeta::Meta(item) => item,\\n\\n NestedMeta::Literal(_) => improper_format(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 77,\n \"score\": 36549.35323839393\n },\n {\n \"content\": \"fn improper_attr_format(attr: &str, module: &str) -> ! {\\n\\n panic!(\\n\\n \\\"{} was not in the correct format. Please refer to the {} \\\\\\n\\n module documentation for more information.\\\",\\n\\n attr, module\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 78,\n \"score\": 34603.44238246091\n },\n {\n \"content\": \"fn quote_path(path: &str) -> proc_macro2::TokenStream {\\n\\n let mut tokens = proc_macro2::TokenStream::new();\\n\\n for (i, part) in path.split(\\\"::\\\").enumerate() {\\n\\n use proc_macro2::{Ident, Punct, Spacing, Span};\\n\\n if i != 0 {\\n\\n tokens.append_all(&[\\n\\n Punct::new(':', Spacing::Joint),\\n\\n Punct::new(':', Spacing::Joint),\\n\\n ]);\\n\\n }\\n\\n if part.len() > 0 {\\n\\n tokens.append(Ident::new(part, Span::call_site()));\\n\\n }\\n\\n }\\n\\n tokens\\n\\n}\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 79,\n \"score\": 33902.462909842674\n },\n {\n \"content\": \"type Comps<T> = ComponentList<Components, T>;\\n\",\n \"file_path\": \"tests/aspects.rs\",\n \"rank\": 80,\n \"score\": 32142.33031583885\n },\n {\n \"content\": \"//! TODO: Add documentation including describing how the derive macros work\\n\\n\\n\",\n \"file_path\": \"src/services.rs\",\n \"rank\": 81,\n \"score\": 31538.4649034213\n },\n {\n \"content\": \" let result = self.inner.insert(entity.entity().index(), component);\\n\\n if result.is_none() && !E::can_insert_components() {\\n\\n panic!(\\\"ComponentList::set was used to insert a new component when modification of activated components was not allowed\\\");\\n\\n }\\n\\n result\\n\\n }\\n\\n\\n\\n pub fn get<E>(&self, entity: E) -> Option<T>\\n\\n where\\n\\n E: EditData<C>,\\n\\n T: Clone,\\n\\n {\\n\\n self.inner.get(entity.entity().index()).cloned()\\n\\n }\\n\\n\\n\\n pub fn has<E>(&self, entity: E) -> bool\\n\\n where\\n\\n E: EditData<C>,\\n\\n {\\n\\n self.inner.contains_key(entity.entity().index())\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 82,\n \"score\": 30972.6200604517\n },\n {\n \"content\": \"\\n\\n pub fn cold() -> Self {\\n\\n ComponentList {\\n\\n inner: Cold(HashMap::with_hasher(Default::default())),\\n\\n _marker: PhantomData,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn add(&mut self, entity: BuildData<C>, component: T) -> Option<T> {\\n\\n self.inner.insert(entity.0.index(), component)\\n\\n }\\n\\n\\n\\n pub fn remove(&mut self, entity: ModifyData<C>) -> Option<T> {\\n\\n self.inner.remove(entity.0.index())\\n\\n }\\n\\n\\n\\n pub fn set<E>(&mut self, entity: E, component: T) -> Option<T>\\n\\n where\\n\\n E: EditData<C>,\\n\\n {\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 83,\n \"score\": 30972.02563237945\n },\n {\n \"content\": \"impl<C, T, E> Index<E> for ComponentList<C, T>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n T: Component,\\n\\n E: EditData<C>,\\n\\n{\\n\\n type Output = T;\\n\\n fn index(&self, entity: E) -> &T {\\n\\n self.inner.index(entity.entity().index())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<C, T, E> IndexMut<E> for ComponentList<C, T>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n T: Component,\\n\\n E: EditData<C>,\\n\\n{\\n\\n fn index_mut(&mut self, entity: E) -> &mut T {\\n\\n self.inner.index_mut(entity.entity().index())\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 84,\n \"score\": 30970.256787293725\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn borrow<E>(&mut self, entity: E) -> Option<&mut T>\\n\\n where\\n\\n E: EditData<C>,\\n\\n {\\n\\n self.inner.get_mut(entity.entity().index())\\n\\n }\\n\\n\\n\\n #[doc(hidden)]\\n\\n pub fn __clear(&mut self, entity: &IndexedEntity<C>) {\\n\\n self.inner.remove(entity.index());\\n\\n }\\n\\n\\n\\n #[doc(hidden)]\\n\\n pub fn __wipe(&mut self) {\\n\\n self.inner.clear();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 85,\n \"score\": 30969.78832680097\n },\n {\n \"content\": \"\\n\\n pub(crate) fn contains_key(&self, index: usize) -> bool {\\n\\n match *self {\\n\\n Hot(ref map) => map.contains_key(index),\\n\\n Cold(ref map) => map.contains_key(&index),\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn index(&self, index: usize) -> &T {\\n\\n self.get(index)\\n\\n .unwrap_or_else(|| panic!(\\\"Entity at index {} does not have this component attached\\\"))\\n\\n }\\n\\n\\n\\n pub(crate) fn index_mut(&mut self, index: usize) -> &mut T {\\n\\n self.get_mut(index)\\n\\n .unwrap_or_else(|| panic!(\\\"Entity at index {} does not have this component attached\\\"))\\n\\n }\\n\\n\\n\\n pub(crate) fn get(&self, index: usize) -> Option<&T> {\\n\\n match *self {\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 86,\n \"score\": 30967.106565232276\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\npub(crate) enum InnerComponentList<T>\\n\\nwhere\\n\\n T: Component,\\n\\n{\\n\\n Hot(VecMap<T>),\\n\\n Cold(FnvHashMap<usize, T>),\\n\\n}\\n\\n\\n\\nimpl<C, T> ComponentList<C, T>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n T: Component,\\n\\n{\\n\\n pub fn hot() -> Self {\\n\\n ComponentList {\\n\\n inner: Hot(VecMap::new()),\\n\\n _marker: PhantomData,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 87,\n \"score\": 30966.16892555551\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<T> InnerComponentList<T>\\n\\nwhere\\n\\n T: Component,\\n\\n{\\n\\n pub(crate) fn insert(&mut self, index: usize, component: T) -> Option<T> {\\n\\n match *self {\\n\\n Hot(ref mut map) => map.insert(index, component),\\n\\n Cold(ref mut map) => map.insert(index, component),\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn remove(&mut self, index: usize) -> Option<T> {\\n\\n match *self {\\n\\n Hot(ref mut map) => map.remove(index),\\n\\n Cold(ref mut map) => map.remove(&index),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 88,\n \"score\": 30964.754039773223\n },\n {\n \"content\": \"//! TODO: Add documentation including describing how the derive macros work\\n\\n\\n\\nuse fnv::FnvHashMap;\\n\\nuse vec_map::VecMap;\\n\\n\\n\\nuse std::collections::HashMap;\\n\\nuse std::marker::PhantomData;\\n\\nuse std::ops::{Index, IndexMut};\\n\\n\\n\\nuse self::InnerComponentList::{Cold, Hot};\\n\\nuse crate::entity::{BuildData, EditData, IndexedEntity, ModifyData};\\n\\n\\n\\n/// Marks types which are suitable for being components. It is implemented for all\\n\\n/// types which are `'static`.\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 89,\n \"score\": 30963.35577841149\n },\n {\n \"content\": \" Hot(ref map) => map.get(index),\\n\\n Cold(ref map) => map.get(&index),\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn get_mut(&mut self, index: usize) -> Option<&mut T> {\\n\\n match *self {\\n\\n Hot(ref mut map) => map.get_mut(index),\\n\\n Cold(ref mut map) => map.get_mut(&index),\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn clear(&mut self) {\\n\\n match *self {\\n\\n Hot(ref mut map) => map.clear(),\\n\\n Cold(ref mut map) => map.clear(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/component.rs\",\n \"rank\": 90,\n \"score\": 30962.622932916696\n },\n {\n \"content\": \"fn read_path_item<F>(attr: &syn::Meta, fail: F) -> String\\n\\nwhere\\n\\n F: FnOnce(),\\n\\n{\\n\\n match attr {\\n\\n syn::Meta::Word(word) => word.to_string(),\\n\\n syn::Meta::List(list) => {\\n\\n let items = &list.nested;\\n\\n if items.len() != 1 {\\n\\n fail();\\n\\n unreachable!();\\n\\n }\\n\\n\\n\\n match items[0] {\\n\\n syn::NestedMeta::Literal(syn::Lit::Str(ref value)) => value.value(),\\n\\n syn::NestedMeta::Meta(syn::Meta::Word(ref word)) => word.to_string(),\\n\\n _ => {\\n\\n fail();\\n\\n unreachable!();\\n\\n }\\n\",\n \"file_path\": \"conniecs-derive/src/lib.rs\",\n \"rank\": 91,\n \"score\": 29944.744622344497\n },\n {\n \"content\": \"fn unwrap_list<'a>(item: &'a Meta) -> impl Iterator<Item = &'a NestedMeta> {\\n\\n match item {\\n\\n Meta::List(list) => list.nested.iter(),\\n\\n _ => improper_format(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"conniecs-derive/src/aspect.rs\",\n \"rank\": 92,\n \"score\": 29253.91949896077\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct WatchedEntityIter<'a, C>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n{\\n\\n pub(crate) current_range: Range,\\n\\n pub(crate) indices: BIter<'a, Range>,\\n\\n pub(crate) entities: &'a FnvHashMap<usize, IndexedEntity<C>>,\\n\\n}\\n\\n\\n\\nimpl<'a, C> Clone for WatchedEntityIter<'a, C>\\n\\nwhere\\n\\n C: ComponentManager,\\n\\n{\\n\\n fn clone(&self) -> Self {\\n\\n WatchedEntityIter {\\n\\n current_range: self.current_range,\\n\",\n \"file_path\": \"src/entity/iter.rs\",\n \"rank\": 97,\n \"score\": 28820.32873995822\n }\n]","isConversational":false}}},{"rowIdx":788,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"tests/integration.rs"},"repo_name":{"kind":"string","value":"saltyrtc/saltyrtc-task-relayed-data-rs"},"commit":{"kind":"string","value":"c290b4ae7e1cbed145b16c34b17e1f6bf8380465"},"file_code":{"kind":"string","value":"\n\nextern crate env_logger;\n#[macro_use] extern crate log;\nextern crate saltyrtc_client;\nextern crate saltyrtc_task_relayed_data;\nextern crate tokio_core;\nextern crate tokio_timer;\n\nuse std::boxed::Box;\nuse std::env;\nuse std::fs::File;\nuse std::io::Read;\nuse std::path::Path;\nuse std::sync::{Arc, RwLock};\nuse std::time::Duration;\n\nuse saltyrtc_client::{WsClient, SaltyClient, CloseCode, BoxedFuture};\nuse saltyrtc_client::crypto::{PublicKey, KeyPair, AuthToken};\nuse saltyrtc_client::dep::futures::{Future, Stream, Sink};\nuse saltyrtc_client::dep::futures::future;\nuse saltyrtc_client::dep::futures::sync::mpsc;\nuse saltyrtc_client::dep::native_tls::{Certificate, TlsConnector, Protocol};\nuse saltyrtc_client::dep::rmpv::Value;\nuse saltyrtc_client::tasks::Task;\nuse saltyrtc_task_relayed_data::{RelayedDataTask, MessageEvent, OutgoingMessage, RelayedDataError};\nuse tokio_core::reactor::{Core, Remote};\nuse tokio_timer::Timer;\n\nmacro_rules! boxed {\n ($future:expr) => {{\n Box::new($future) as BoxedFuture<_, _>\n }}\n}\n\nfn setup_initiator(\n keypair: KeyPair,\n remote: Remote,\n) -> (SaltyClient, mpsc::UnboundedReceiver<MessageEvent>) {\n let (tx, rx) = mpsc::unbounded();\n let task = RelayedDataTask::new(remote, tx);\n let salty = SaltyClient::build(keypair)\n .add_task(Box::new(task))\n .initiator()\n .expect(\"Could not create initiator\");\n (salty, rx)\n}\n\nfn setup_responder(\n keypair: KeyPair,\n remote: Remote,\n pubkey: PublicKey,\n auth_token: AuthToken,\n) -> (SaltyClient, mpsc::UnboundedReceiver<MessageEvent>) {\n let (tx, rx) = mpsc::unbounded();\n let task = RelayedDataTask::new(remote, tx);\n let salty = SaltyClient::build(keypair)\n .add_task(Box::new(task))\n .responder(pubkey, auth_token)\n .expect(\"Could not create initiator\");\n (salty, rx)\n}\n\n#[test]\nfn integration_test() {\n \n env::set_var(\"RUST_LOG\", \"saltyrtc_client=debug,saltyrtc_task_relayed_data=debug,integration=trace\");\n env_logger::init();\n\n \n let mut core = Core::new().unwrap();\n\n \n let mut server_cert_bytes: Vec<u8> = vec![];\n File::open(&Path::new(\"saltyrtc.der\"))\n .expect(\"Could not open saltyrtc.der\")\n .read_to_end(&mut server_cert_bytes)\n .expect(\"Could not read saltyrtc.der\");\n\n \n let server_cert = Certificate::from_der(&server_cert_bytes)\n .unwrap_or_else(|e| {\n panic!(\"Problem with CA cert: {}\", e);\n });\n\n \n let tls_connector = TlsConnector::builder()\n .min_protocol_version(Some(Protocol::Tlsv11))\n .add_root_certificate(server_cert)\n .build()\n .unwrap_or_else(|e| panic!(\"Could not initialize TlsConnector: {}\", e));\n\n \n let initiator_keypair = KeyPair::new();\n let responder_keypair = KeyPair::new();\n\n \n let pubkey = initiator_keypair.public_key().clone();\n\n \n let (initiator, rx_initiator) = setup_initiator(initiator_keypair, core.remote());\n let (responder, rx_responder) = setup_responder(responder_keypair, core.remote(), pubkey, initiator.auth_token().cloned().unwrap());\n\n \n let initiator = Arc::new(RwLock::new(initiator));\n let responder = Arc::new(RwLock::new(responder));\n\n \n let timeout = Some(Duration::from_secs(2));\n let (connect_initiator, event_channel_initiator) = saltyrtc_client::connect(\n \"localhost\",\n 8765,\n Some(tls_connector.clone()),\n &core.handle(),\n initiator.clone(),\n )\n .unwrap();\n let handshake_initiator = connect_initiator\n .and_then(|client| saltyrtc_client::do_handshake(\n client,\n initiator.clone(),\n event_channel_initiator.clone_tx(),\n timeout,\n ));\n let (connect_responder, event_channel_responder) = saltyrtc_client::connect(\n \"localhost\",\n 8765,\n Some(tls_connector.clone()),\n &core.handle(),\n responder.clone(),\n )\n .unwrap();\n let handshake_responder = connect_responder\n .and_then(|client| saltyrtc_client::do_handshake(\n client,\n responder.clone(),\n event_channel_responder.clone_tx(),\n timeout,\n ));\n\n \n let (client_initiator, client_responder): (WsClient, WsClient) = core.run(\n handshake_initiator.join(handshake_responder)\n ).unwrap();\n\n \n let (task_initiator, initiator_task_loop) = saltyrtc_client::task_loop(\n client_initiator,\n initiator.clone(),\n event_channel_initiator.clone_tx(),\n ).unwrap();\n let (task_responder, responder_task_loop) = saltyrtc_client::task_loop(\n client_responder,\n responder.clone(),\n event_channel_responder.clone_tx(),\n ).unwrap();\n\n let (tx_initiator, tx_responder) = {\n \n \n let mut t_initiator = task_initiator.lock().expect(\"Could not lock task mutex\");\n let mut t_responder = task_responder.lock().expect(\"Could not lock task mutex\");\n let rd_task_initiator: &mut RelayedDataTask = (&mut **t_initiator as &mut dyn Task)\n .downcast_mut::<RelayedDataTask>()\n .expect(\"Chosen task is not a RelayedDataTask\");\n let rd_task_responder: &mut RelayedDataTask = (&mut **t_responder as &mut dyn Task)\n .downcast_mut::<RelayedDataTask>()\n .expect(\"Chosen task is not a RelayedDataTask\");\n\n \n let tx_initiator = rd_task_initiator.get_sender().unwrap();\n let tx_responder = rd_task_responder.get_sender().unwrap();\n (tx_initiator, tx_responder)\n };\n\n \n \n \n \n \n\n let rx_loop_responder = rx_responder\n .map_err(|_| Err(RelayedDataError::Channel((\"Could not read from rx_responder\").into())))\n .for_each(move |ev: MessageEvent| match ev {\n MessageEvent::Data(data) => {\n \n assert_eq!(data.as_i64(), Some(1));\n debug!(\"R: Received 1\");\n\n \n let future = tx_responder\n .clone()\n .send(OutgoingMessage::Data(Value::Integer(2.into())))\n .map(|tx| { debug!(\"R: Sent 2\"); tx })\n .and_then(|tx| tx.send(OutgoingMessage::Data(Value::Integer(3.into()))))\n .map(|_tx| { debug!(\"R: Sent 3\"); () })\n .map_err(|e| Err(RelayedDataError::Channel(format!(\"Could not send message to tx_responder: {}\", e))));\n boxed!(future)\n },\n MessageEvent::Application(data) => {\n \n assert_eq!(data.as_i64(), Some(4));\n debug!(\"R: Received 4 (application)\");\n\n \n let future = tx_responder\n .clone()\n .send(OutgoingMessage::Application(Value::Integer(5.into())))\n .map(|_tx| { debug!(\"R: Sent 5 (application)\"); () })\n .map_err(|e| Err(RelayedDataError::Channel(format!(\"Could not send message to tx_responder: {}\", e))));\n boxed!(future)\n },\n MessageEvent::Close(reason) => {\n assert_eq!(reason, CloseCode::WsGoingAway);\n boxed!(future::err(Ok(())))\n },\n })\n .or_else(|e| e)\n .then(|f| { debug!(\"† rx_loop_responder done\"); f });\n\n let tx_initiator_clone = tx_initiator.clone();\n let rx_loop_initiator = rx_initiator\n .map_err(|_| RelayedDataError::Channel((\"Could not read from rx_initiator\").into()))\n .for_each(move |ev: MessageEvent| match ev {\n MessageEvent::Data(data) => {\n \n match data.as_i64() {\n Some(2) => {\n debug!(\"I: Received 2\");\n /* Ok, wait for 3 */\n boxed!(future::ok(()))\n },\n Some(3) => {\n debug!(\"I: Received 3\");\n boxed!(\n tx_initiator_clone\n .clone()\n .send(OutgoingMessage::Application(Value::Integer(4.into())))\n .map(|_| debug!(\"I: Sent 4 (application)\"))\n .map_err(|e| RelayedDataError::Channel(e.to_string()))\n )\n },\n _ => panic!(\"I: Received invalid value: {}\", data),\n }\n },\n MessageEvent::Application(data) => match data.as_i64() {\n Some(5) => {\n debug!(\"I: Received 5 (application)\");\n debug!(\"Done, disconnecting\");\n task_initiator.lock().unwrap().close(CloseCode::WsGoingAway);\n boxed!(future::ok(()))\n },\n _ => panic!(\"I: Received invalid application value: {}\", data),\n },\n MessageEvent::Close(_) => panic!(\"Initiator should disconnect first!\"),\n })\n .then(|f| { debug!(\"† rx_loop_initiator done\"); f });\n\n let start = tx_initiator\n .send(OutgoingMessage::Data(Value::Integer(1.into())))\n .map(|_| debug!(\"I: Sent 1\"))\n .map_err(|e| RelayedDataError::Channel(e.to_string()));\n\n let test_future = start\n .join(initiator_task_loop.from_err().select(rx_loop_initiator).map_err(|(e, _)| e))\n .join(responder_task_loop.from_err().select(rx_loop_responder).map_err(|(e, _)| e));\n\n \n let timer = Timer::default();\n let timeout = timer.sleep(Duration::from_secs(3));\n match core.run(test_future.select2(timeout)) {\n Ok(res) => match res {\n future::Either::A(_) => debug!(\"Success\"),\n future::Either::B(_) => panic!(\"The test timed out\"),\n },\n Err(e) => match e {\n future::Either::A((task_error, _)) => panic!(\"A task error occurred: {}\", task_error),\n future::Either::B(_) => panic!(\"The timeout failed\"),\n },\n };\n}\n"},"prefix":{"kind":"string","value":"\n\nextern crate env_logger;\n#[macro_use] extern crate log;\nextern crate saltyrtc_client;\nextern crate saltyrtc_task_relayed_data;\nextern crate tokio_core;\nextern crate tokio_timer;\n\nuse std::boxed::Box;\nuse std::env;\nuse std::fs::File;\nuse std::io::Read;\nuse std::path::Path;\nuse std::sync::{Arc, RwLock};\nuse std::time::Duration;\n\nuse saltyrtc_client::{WsClient, SaltyClient, CloseCode, BoxedFuture};\nuse saltyrtc_client::crypto::{PublicKey, KeyPair, AuthToken};\nuse saltyrtc_client::dep::futures::{Future, Stream, Sink};\nuse saltyrtc_client::dep::futures::future;\nuse saltyrtc_client::dep::futures::sync::mpsc;\nuse saltyrtc_client::dep::native_tls::{Certificate, TlsConnector, Protocol};\nuse saltyrtc_client::dep::rmpv::Value;\nuse saltyrtc_client::tasks::Task;\nuse saltyrtc_task_relayed_data::{RelayedDataTask, MessageEvent, OutgoingMessage, RelayedDataError};\nuse tokio_core::reactor::{Core, Remote};\nuse tokio_timer::Timer;\n\nmacro_rules! boxed {\n ($future:expr) => {{\n Box::new($future) as BoxedFuture<_, _>\n }}\n}\n\nfn setup_initiator(\n keypair: KeyPair,\n remote: Remote,\n) -> (SaltyClient, mpsc::UnboundedReceiver<MessageEvent>) {\n let (tx, rx) = mpsc::unbounded();\n let task = RelayedDataTask::new(remote, tx);\n let salty = SaltyClient::build(keypair)\n .add_task(Box::new(task))\n .initiator()\n .expect(\"Could not create initiator\");\n (salty, rx)\n}\n\nfn setup_responder(\n keypair: KeyPair,\n remote: Remote,\n pubkey: PublicKey,\n auth_token: AuthToken,\n) -> (SaltyClient, mpsc::UnboundedReceiver<MessageEvent>) {\n let (tx, rx) = mpsc::unbounded();\n let task = RelayedDataTask::new(remote, tx);\n let salty = SaltyClient::build(keypair)\n .add_task(Box::new(task))\n .responder(pubkey, auth_token)\n .expect(\"Could not create initiator\");\n (salty, rx)\n}\n\n#[test]\nfn integration_test() {\n \n env::set_var(\"RUST_LOG\", \"saltyrtc_client=debug,saltyrtc_task_relayed_data=debug,integration=trace\");\n env_logger::init();\n\n \n let mut core = Core::new().unwrap();\n\n \n let mut server_cert_bytes: Vec<u8> = vec![];\n File::open(&Path::new(\"saltyrtc.der\"))\n .expect(\"Could not open saltyrtc.der\")\n .read_to_end(&mut server_cert_bytes)\n .expect(\"Could not read saltyrtc.der\");\n\n \n let server_cert = Certificate::from_der(&server_cert_bytes)\n .unwrap_or_else(|e| {\n panic!(\"Problem with CA cert: {}\", e);\n });\n\n \n let tls_connector = TlsConnector::builder()\n .min_protocol_version(Some(Protocol::Tlsv11))\n .add_root_certificate(server_cert)\n .build()\n .unwrap_or_else(|e| panic!(\"Could not initialize TlsConnector: {}\", e));\n\n \n let initiator_keypair = KeyPair::new();\n let responder_keypair = KeyPair::new();\n\n \n let pubkey = initiator_keypair.public_key().clone();\n\n \n let (initiator, rx_initiator) = setup_initiator(initiator_keypair, core.remote());\n let (responder, rx_responder) = setup_responder(responder_keypair, core.remote(), pubkey, initiator.auth_token().cloned().unwrap());\n\n \n let initiator = Arc::new(RwLock::new(initiator));\n let responder = Arc::new(RwLock::new(responder));\n\n \n let timeout = Some(Duration::from_secs(2));\n let (connect_initiator, event_channel_initiator) = saltyrtc_client::connect(\n \"localhost\",\n 8765,\n Some(tls_connector.clone()),\n &core.handle(),\n initiator.clone(),\n )\n .unwrap();\n let handshake_initiator = connect_initiator\n .and_then(|client| saltyrtc_client::do_handshake(\n client,\n initiator.clone(),\n event_channel_initiator.clone_tx(),\n timeout,\n ));\n let (connect_responder, event_channel_responder) = saltyrtc_client::connect(\n \"localhost\",\n 8765,\n Some(tls_connector.clone()),\n &core.handle(),\n responder.clone(),\n )\n .unwrap();\n let handshake_responder = connect_responder\n .and_then(|client| saltyrtc_client::do_handshake(\n client,\n responder.clone(),\n event_channel_responder.clone_tx(),\n timeout,\n ));\n\n \n let (client_initiator, client_responder): (WsClient, WsClient) = core.run(\n handshake_initiator.join(handshake_responder)\n ).unwrap();\n\n \n let (task_initiator, initiator_task_loop) = saltyrtc_client::task_loop(\n client_initiator,\n initiator.clone(),\n event_channel_initiator.clone_tx(),\n ).unwrap();\n let (task_responder, responder_task_loop) = saltyrtc_client::task_loop(\n client_responder,\n responder.clone(),\n event_channel_responder.clone_tx(),\n ).unwrap();\n\n let (tx_initiator, tx_responder) = {\n \n \n let mut t_initiator = task_initiator.lock().expect(\"Could not lock task mutex\");\n let mut t_responder = task_responder.lock().expect(\"Could not lock task mutex\");\n "},"suffix":{"kind":"string","value":"\n let rd_task_responder: &mut RelayedDataTask = (&mut **t_responder as &mut dyn Task)\n .downcast_mut::<RelayedDataTask>()\n .expect(\"Chosen task is not a RelayedDataTask\");\n\n \n let tx_initiator = rd_task_initiator.get_sender().unwrap();\n let tx_responder = rd_task_responder.get_sender().unwrap();\n (tx_initiator, tx_responder)\n };\n\n \n \n \n \n \n\n let rx_loop_responder = rx_responder\n .map_err(|_| Err(RelayedDataError::Channel((\"Could not read from rx_responder\").into())))\n .for_each(move |ev: MessageEvent| match ev {\n MessageEvent::Data(data) => {\n \n assert_eq!(data.as_i64(), Some(1));\n debug!(\"R: Received 1\");\n\n \n let future = tx_responder\n .clone()\n .send(OutgoingMessage::Data(Value::Integer(2.into())))\n .map(|tx| { debug!(\"R: Sent 2\"); tx })\n .and_then(|tx| tx.send(OutgoingMessage::Data(Value::Integer(3.into()))))\n .map(|_tx| { debug!(\"R: Sent 3\"); () })\n .map_err(|e| Err(RelayedDataError::Channel(format!(\"Could not send message to tx_responder: {}\", e))));\n boxed!(future)\n },\n MessageEvent::Application(data) => {\n \n assert_eq!(data.as_i64(), Some(4));\n debug!(\"R: Received 4 (application)\");\n\n \n let future = tx_responder\n .clone()\n .send(OutgoingMessage::Application(Value::Integer(5.into())))\n .map(|_tx| { debug!(\"R: Sent 5 (application)\"); () })\n .map_err(|e| Err(RelayedDataError::Channel(format!(\"Could not send message to tx_responder: {}\", e))));\n boxed!(future)\n },\n MessageEvent::Close(reason) => {\n assert_eq!(reason, CloseCode::WsGoingAway);\n boxed!(future::err(Ok(())))\n },\n })\n .or_else(|e| e)\n .then(|f| { debug!(\"† rx_loop_responder done\"); f });\n\n let tx_initiator_clone = tx_initiator.clone();\n let rx_loop_initiator = rx_initiator\n .map_err(|_| RelayedDataError::Channel((\"Could not read from rx_initiator\").into()))\n .for_each(move |ev: MessageEvent| match ev {\n MessageEvent::Data(data) => {\n \n match data.as_i64() {\n Some(2) => {\n debug!(\"I: Received 2\");\n /* Ok, wait for 3 */\n boxed!(future::ok(()))\n },\n Some(3) => {\n debug!(\"I: Received 3\");\n boxed!(\n tx_initiator_clone\n .clone()\n .send(OutgoingMessage::Application(Value::Integer(4.into())))\n .map(|_| debug!(\"I: Sent 4 (application)\"))\n .map_err(|e| RelayedDataError::Channel(e.to_string()))\n )\n },\n _ => panic!(\"I: Received invalid value: {}\", data),\n }\n },\n MessageEvent::Application(data) => match data.as_i64() {\n Some(5) => {\n debug!(\"I: Received 5 (application)\");\n debug!(\"Done, disconnecting\");\n task_initiator.lock().unwrap().close(CloseCode::WsGoingAway);\n boxed!(future::ok(()))\n },\n _ => panic!(\"I: Received invalid application value: {}\", data),\n },\n MessageEvent::Close(_) => panic!(\"Initiator should disconnect first!\"),\n })\n .then(|f| { debug!(\"† rx_loop_initiator done\"); f });\n\n let start = tx_initiator\n .send(OutgoingMessage::Data(Value::Integer(1.into())))\n .map(|_| debug!(\"I: Sent 1\"))\n .map_err(|e| RelayedDataError::Channel(e.to_string()));\n\n let test_future = start\n .join(initiator_task_loop.from_err().select(rx_loop_initiator).map_err(|(e, _)| e))\n .join(responder_task_loop.from_err().select(rx_loop_responder).map_err(|(e, _)| e));\n\n \n let timer = Timer::default();\n let timeout = timer.sleep(Duration::from_secs(3));\n match core.run(test_future.select2(timeout)) {\n Ok(res) => match res {\n future::Either::A(_) => debug!(\"Success\"),\n future::Either::B(_) => panic!(\"The test timed out\"),\n },\n Err(e) => match e {\n future::Either::A((task_error, _)) => panic!(\"A task error occurred: {}\", task_error),\n future::Either::B(_) => panic!(\"The timeout failed\"),\n },\n };\n}\n"},"middle":{"kind":"string","value":"let rd_task_initiator: &mut RelayedDataTask = (&mut **t_initiator as &mut dyn Task)\n .downcast_mut::<RelayedDataTask>()\n .expect(\"Chosen task is not a RelayedDataTask\");"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[{"content":"fn build_tests() -> (MutexGuard<'static, ()>, PathBuf) {\n\n let guard = match C_TEST_MUTEX.lock() {\n\n Ok(guard) => guard,\n\n Err(poisoned) => poisoned.into_inner(),\n\n };\n\n\n\n let out_dir = env!(\"OUT_DIR\");\n\n let build_dir = Path::new(out_dir).join(\"build\");\n\n\n\n println!(\"Running meson...\");\n\n Command::new(\"meson\")\n\n .arg(build_dir.to_str().unwrap())\n\n .env(\"CC\", \"clang\")\n\n .output()\n\n .expect(\"Could not run meson to build C tests\");\n\n\n\n println!(\"Running ninja...\");\n\n let output = Command::new(\"ninja\")\n\n .current_dir(&build_dir)\n\n .output()\n\n .expect(\"Could not run ninja to build C tests\");\n\n assert_output_success(output);\n\n\n\n println!(\"Copying test certificate...\");\n\n copy(\"../saltyrtc.der\", build_dir.join(\"saltyrtc.der\"))\n\n .expect(\"Could not copy test certificate (saltyrtc.der)\");\n\n\n\n (guard, build_dir)\n\n}\n\n\n","file_path":"ffi/tests/integration.rs","rank":0,"score":113786.40864564222},{"content":"/// Helper function to return error values when creating a client instance.\n\nfn make_client_create_error(reason: salty_relayed_data_success_t) -> salty_relayed_data_client_ret_t {\n\n salty_relayed_data_client_ret_t {\n\n success: reason,\n\n client: ptr::null(),\n\n receiver_rx: ptr::null(),\n\n sender_tx: ptr::null(),\n\n sender_rx: ptr::null(),\n\n disconnect_tx: ptr::null(),\n\n disconnect_rx: ptr::null(),\n\n }\n\n}\n\n\n","file_path":"ffi/src/lib.rs","rank":4,"score":103000.50390243322},{"content":" const salty_keypair_t *keypair;\n","file_path":"ffi/tests/integration.c","rank":5,"score":94362.86782556414},{"content":" const uint8_t *ca_cert;\n","file_path":"ffi/tests/integration.c","rank":6,"score":90280.40058090781},{"content":" const uint8_t *initiator_pubkey;\n","file_path":"ffi/tests/integration.c","rank":7,"score":90134.67763318452},{"content":" long ca_cert_len;\n","file_path":"ffi/tests/integration.c","rank":8,"score":87140.45251682721},{"content":"fn main() {\n\n let crate_dir = env::var(\"CARGO_MANIFEST_DIR\").unwrap();\n\n if env::var(\"SKIP_CBINDGEN\").unwrap_or(\"0\".to_string()) == \"1\" {\n\n return;\n\n }\n\n cbindgen::generate(&crate_dir)\n\n .expect(\"Unable to generate C bindings\")\n\n .write_to_file(\"saltyrtc_task_relayed_data_ffi.h\");\n\n}\n","file_path":"ffi/build.rs","rank":9,"score":82182.4263534448},{"content":"// #[test] Disabled for now due to false errors, see\n\n// https://bugs.kde.org/show_bug.cgi?id=381289 and\n\n// https://bugzilla.redhat.com/show_bug.cgi?id=1462258\n\n// Additionally, the log4rs logger initializes global memory that cannot\n\n// currently be freed.\n\nfn c_tests_no_memory_leaks() {\n\n let (_guard, build_dir) = build_tests();\n\n\n\n let output = Command::new(\"valgrind\")\n\n .arg(\"--error-exitcode=23\")\n\n .arg(\"--leak-check=full\")\n\n .arg(\"--track-fds=yes\")\n\n .arg(\"./integration\")\n\n .current_dir(&build_dir)\n\n .output()\n\n .expect(\"Could not run valgrind\");\n\n if !output.status.success() {\n\n let stdout = String::from_utf8_lossy(&output.stdout);\n\n let stderr = String::from_utf8_lossy(&output.stderr);\n\n println!(\"Stdout:\\n{}\\nStderr:\\n{}\\n\", stdout, stderr);\n\n panic!(\"Running valgrind failed with non-zero return code\");\n\n }\n\n}\n","file_path":"ffi/tests/integration.rs","rank":10,"score":81721.57598514242},{"content":"#[test]\n\nfn c_tests_disconnect_run() {\n\n c_tests_run(\"./disconnect\", None);\n\n}\n\n\n","file_path":"ffi/tests/integration.rs","rank":11,"score":81720.0765061444},{"content":"fn make_log_config(config: LogConfig) -> Result<Config, String> {\n\n // Log format\n\n let format = \"{d(%Y-%m-%dT%H:%M:%S%.3f)} [{l:<5}] {m} (({f}:{L})){n}\";\n\n\n\n // Appender\n\n let (appender, level) = match config {\n\n LogConfig::Console(level) => {\n\n let console = ConsoleAppender::builder()\n\n .encoder(Box::new(PatternEncoder::new(format)))\n\n .build();\n\n (Box::new(console) as Box<dyn Append>, level)\n\n }\n\n LogConfig::Callback(func, level) => {\n\n (Box::new(CallbackAppender::new(func)) as Box<dyn Append>, level)\n\n }\n\n };\n\n\n\n // Create logging config object\n\n let config_res = Config::builder()\n\n .appender(Appender::builder().build(\"appender\", appender))\n","file_path":"ffi/src/saltyrtc_client_ffi.rs","rank":12,"score":78723.15720419362},{"content":"#[test]\n\nfn c_tests_integration_run_console_logger() {\n\n c_tests_run(\"./integration\", Some(\"console\"));\n\n}\n\n\n","file_path":"ffi/tests/integration.rs","rank":13,"score":77447.75853365683},{"content":"#[test]\n\nfn c_tests_integration_run_callback_logger() {\n\n c_tests_run(\"./integration\", Some(\"callback\"));\n\n}\n\n\n","file_path":"ffi/tests/integration.rs","rank":14,"score":77447.75853365683},{"content":" const salty_client_t *client;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":15,"score":75028.00427325869},{"content":"/// Create the QR code payload\n\nfn make_qrcode_payload(version: u16, permanent: bool, host: &str, port: u16, pubkey: &[u8], auth_token: &[u8], server_pubkey: &[u8]) -> Vec<u8> {\n\n let mut data: Vec<u8> = Vec::with_capacity(101 + host.as_bytes().len());\n\n\n\n data.write_u16::<BigEndian>(version).unwrap();\n\n data.push(if permanent { 0x02 } else { 0x00 });\n\n data.write_all(&pubkey).unwrap();\n\n data.write_all(&auth_token).unwrap();\n\n data.write_all(&server_pubkey).unwrap();\n\n data.write_u16::<BigEndian>(port).unwrap();\n\n data.write_all(host.as_bytes()).unwrap();\n\n\n\n data\n\n}\n\n\n","file_path":"examples/testclient.rs","rank":16,"score":70051.73912628788},{"content":"static sem_t initialized;\n","file_path":"ffi/tests/disconnect.c","rank":17,"score":69450.29215047648},{"content":"salty_client_send_success_t salty_client_send_task_bytes(const salty_channel_sender_tx_t *sender_tx,\n\n const uint8_t *msg,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":18,"score":69048.64458025097},{"content":"static uint8_t *auth_token = NULL;\n","file_path":"ffi/tests/integration.c","rank":19,"score":68704.58762942362},{"content":"void salty_keypair_free(const salty_keypair_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":20,"score":67837.07321804513},{"content":"const salty_keypair_t *salty_keypair_new(void);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":21,"score":67836.56183290292},{"content":"const salty_keypair_t *salty_keypair_restore(const uint8_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":22,"score":67834.72565376054},{"content":"salty_client_init_ret_t salty_client_init(const char *host,\n\n uint16_t port,\n\n const salty_client_t *client,\n\n const salty_event_loop_t *event_loop,\n\n uint16_t timeout_s,\n\n const uint8_t *ca_cert,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":23,"score":67364.32065424637},{"content":"salty_client_connect_success_t salty_client_connect(const salty_handshake_future_t *handshake_future,\n\n const salty_client_t *client,\n\n const salty_event_loop_t *event_loop,\n\n const salty_channel_event_tx_t *event_tx,\n\n const salty_channel_sender_rx_t *sender_rx,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":24,"score":67363.39081803856},{"content":"salty_client_disconnect_success_t salty_client_disconnect(const salty_channel_disconnect_tx_t *disconnect_tx,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":25,"score":67359.39267344215},{"content":" uint16_t timeout_seconds;\n","file_path":"ffi/tests/integration.c","rank":26,"score":67109.43770223096},{"content":"static void log_callback(uint8_t level, const char *target, const char *message) {\n\n printf(\"****** [%d] %s: %s\\n\", level, target, message);\n","file_path":"ffi/tests/integration.c","rank":27,"score":67034.98804308508},{"content":"static const salty_channel_disconnect_tx_t *disconnect_tx = NULL;\n","file_path":"ffi/tests/disconnect.c","rank":28,"score":67020.52256748466},{"content":"void *connect_responder(void *threadarg) {\n\n struct thread_data *data = (struct thread_data *) threadarg;\n\n printf(\" THREAD: Started responder thread\\n\");\n\n\n\n printf(\" RESPONDER: Creating event loop\\n\");\n\n const salty_event_loop_t *loop = salty_event_loop_new();\n\n\n\n printf(\" RESPONDER: Getting event loop remote handle\\n\");\n\n const salty_remote_t *remote = salty_event_loop_get_remote(loop);\n\n\n\n printf(\" RESPONDER: Waiting for auth token semaphore...\\n\");\n\n sem_wait(&auth_token_set);\n\n\n\n printf(\" RESPONDER: Creating client instance\\n\");\n\n salty_relayed_data_client_ret_t client_ret = salty_relayed_data_responder_new(\n\n data->keypair,\n\n remote,\n\n data->interval_seconds,\n\n data->initiator_pubkey,\n\n auth_token,\n\n NULL\n\n );\n\n if (client_ret.success != OK) {\n\n printf(\" RESPONDER ERROR: Could not create client: %d\", client_ret.success);\n\n pthread_exit(NULL);\n\n }\n\n\n\n responder_sender = client_ret.sender_tx;\n\n responder_receiver = client_ret.receiver_rx;\n\n responder_disconnect = client_ret.disconnect_tx;\n\n printf(\" RESPONDER: Notifying main thread that the channels are ready\\n\");\n\n sem_post(&responder_channels_ready);\n\n\n\n printf(\" RESPONDER: Initializing\\n\");\n\n salty_client_init_ret_t init_ret = salty_client_init(\n\n // Host, port\n\n \"localhost\",\n\n 8765,\n\n // Client\n\n client_ret.client,\n\n // Event loop\n\n loop,\n\n // Timeout seconds\n\n data->timeout_seconds,\n\n // CA certificate\n\n data->ca_cert,\n\n (uint32_t)data->ca_cert_len\n\n );\n\n if (init_ret.success != INIT_OK) {\n\n printf(\" RESPONDER ERROR: Could not initialize connection: %d\", init_ret.success);\n\n pthread_exit(NULL);\n\n }\n\n\n\n printf(\" RESPONDER: Connecting\\n\");\n\n salty_client_connect_success_t connect_success = salty_client_connect(\n\n // Handshake future\n\n init_ret.handshake_future,\n\n // Client\n\n client_ret.client,\n\n // Event loop\n\n loop,\n\n // Event channel, sending end\n\n init_ret.event_tx,\n\n // Sender channel, receiving end\n\n client_ret.sender_rx,\n\n // Disconnect channel, receiving end\n\n client_ret.disconnect_rx\n\n );\n\n\n\n drain_events(init_ret.event_rx, \"RESPONDER\");\n\n\n\n printf(\" RESPONDER: Connection ended with exit code %d\\n\", connect_success);\n\n salty_client_connect_success_t* connect_success_copy = malloc(sizeof(connect_success));\n\n if (connect_success_copy == NULL) {\n\n printf(\" RESPONDER ERROR: Could not malloc %ld bytes\\n\", sizeof(connect_success));\n\n pthread_exit(NULL);\n\n }\n\n memcpy(connect_success_copy, &connect_success, sizeof(connect_success));\n\n\n\n printf(\" RESPONDER: Freeing client instance\\n\");\n\n salty_relayed_data_client_free(client_ret.client);\n\n\n\n printf(\" RESPONDER: Freeing channel instances\\n\");\n\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\n\n salty_channel_sender_tx_free(client_ret.sender_tx);\n\n salty_channel_event_rx_free(init_ret.event_rx);\n\n\n\n printf(\" RESPONDER: Freeing event loop\\n\");\n\n salty_event_loop_free(loop);\n\n\n\n printf(\" THREAD: Stopping responder thread\\n\");\n\n pthread_exit((void *)connect_success_copy);\n","file_path":"ffi/tests/integration.c","rank":29,"score":67013.63749701824},{"content":"static const salty_channel_disconnect_tx_t *responder_disconnect = NULL;\n","file_path":"ffi/tests/integration.c","rank":30,"score":67006.0404750313},{"content":"static const salty_channel_receiver_rx_t *responder_receiver = NULL;\n","file_path":"ffi/tests/integration.c","rank":31,"score":67006.0404750313},{"content":"static const salty_channel_sender_tx_t *responder_sender = NULL;\n","file_path":"ffi/tests/integration.c","rank":32,"score":67006.0404750313},{"content":"static const salty_channel_event_rx_t *event_rx = NULL;\n","file_path":"ffi/tests/disconnect.c","rank":33,"score":66991.5307617441},{"content":"void *connect_initiator(void *threadarg) {\n\n struct thread_data *data = (struct thread_data *) threadarg;\n\n printf(\" THREAD: Started initiator thread\\n\");\n\n\n\n printf(\" INITIATOR: Creating event loop\\n\");\n\n const salty_event_loop_t *loop = salty_event_loop_new();\n\n\n\n printf(\" INITIATOR: Getting event loop remote handle\\n\");\n\n const salty_remote_t *remote = salty_event_loop_get_remote(loop);\n\n const salty_remote_t *unused_remote = salty_event_loop_get_remote(loop);\n\n\n\n printf(\" INITIATOR: Creating client instance\\n\");\n\n salty_relayed_data_client_ret_t client_ret = salty_relayed_data_initiator_new(\n\n data->keypair,\n\n remote,\n\n data->interval_seconds,\n\n NULL,\n\n NULL\n\n );\n\n if (client_ret.success != OK) {\n\n printf(\" INITIATOR ERROR: Could not create client: %d\", client_ret.success);\n\n pthread_exit(NULL);\n\n }\n\n\n\n initiator_sender = client_ret.sender_tx;\n\n initiator_receiver = client_ret.receiver_rx;\n\n initiator_disconnect = client_ret.disconnect_tx;\n\n printf(\" INITIATOR: Notifying main thread that the channels are ready\\n\");\n\n sem_post(&initiator_channels_ready);\n\n\n\n printf(\" INITIATOR: Copying auth token to static variable\\n\");\n\n auth_token = malloc(32 * sizeof(uint8_t));\n\n if (auth_token == NULL) {\n\n printf(\" INITIATOR ERROR: Could not allocate memory for auth token\");\n\n pthread_exit(NULL);\n\n }\n\n const uint8_t *auth_token_ref = salty_relayed_data_client_auth_token(client_ret.client);\n\n memcpy(auth_token, auth_token_ref, 32 * sizeof(uint8_t));\n\n\n\n printf(\" INITIATOR: Notifying responder that the auth token is ready\\n\");\n\n sem_post(&auth_token_set);\n\n\n\n printf(\" INITIATOR: Initializing\\n\");\n\n salty_client_init_ret_t init_ret = salty_client_init(\n\n // Host, port\n\n \"localhost\",\n\n 8765,\n\n // Client\n\n client_ret.client,\n\n // Event loop\n\n loop,\n\n // Timeout seconds\n\n data->timeout_seconds,\n\n // CA certificate\n\n data->ca_cert,\n\n (uint32_t)data->ca_cert_len\n\n );\n\n if (init_ret.success != INIT_OK) {\n\n printf(\" INITIATOR ERROR: Could not initialize connection: %d\", init_ret.success);\n\n pthread_exit(NULL);\n\n }\n\n\n\n printf(\" INITIATOR: Connecting\\n\");\n\n salty_client_connect_success_t connect_success = salty_client_connect(\n\n // Handshake future\n\n init_ret.handshake_future,\n\n // Client\n\n client_ret.client,\n\n // Event loop\n\n loop,\n\n // Event channel, sending end\n\n init_ret.event_tx,\n\n // Sender channel, receiving end\n\n client_ret.sender_rx,\n\n // Disconnect channel, receiving end\n\n client_ret.disconnect_rx\n\n );\n\n\n\n drain_events(init_ret.event_rx, \"INITIATOR\");\n\n\n\n printf(\" INITIATOR: Connection ended with exit code %d\\n\", connect_success);\n\n salty_client_connect_success_t* connect_success_copy = malloc(sizeof(connect_success));\n\n if (connect_success_copy == NULL) {\n\n printf(\" INITIATOR ERROR: Could not malloc %ld bytes\\n\", sizeof(connect_success));\n\n pthread_exit(NULL);\n\n }\n\n memcpy(connect_success_copy, &connect_success, sizeof(connect_success));\n\n\n\n printf(\" INITIATOR: Freeing unused event loop remote handle\\n\");\n\n salty_event_loop_free_remote(unused_remote);\n\n\n\n printf(\" INITIATOR: Freeing client instance\\n\");\n\n salty_relayed_data_client_free(client_ret.client);\n\n\n\n printf(\" INITIATOR: Freeing channel instances\\n\");\n\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\n\n salty_channel_sender_tx_free(client_ret.sender_tx);\n\n salty_channel_event_rx_free(init_ret.event_rx);\n\n\n\n printf(\" INITIATOR: Freeing event loop\\n\");\n\n salty_event_loop_free(loop);\n\n\n\n printf(\" THREAD: Stopping initiator thread\\n\");\n\n pthread_exit((void *)connect_success_copy);\n","file_path":"ffi/tests/integration.c","rank":34,"score":66955.31248760308},{"content":"void *connect_initiator(void *threadarg) {\n\n if (threadarg == NULL) { /* get rid of unused variable warning */ }\n\n\n\n printf(\" Reading DER formatted test CA certificate\\n\");\n\n\n\n // Open file\n\n const char *const ca_cert_name = \"saltyrtc.der\";\n\n FILE *fd = fopen(ca_cert_name, \"rb\");\n\n if (fd == NULL) {\n\n printf(\" ERROR: Could not open `%s`\\n\", ca_cert_name);\n\n pthread_exit((void *)1);\n\n }\n\n\n\n // Get file size\n\n if (fseek(fd, 0, SEEK_END) != 0) {\n\n printf(\" ERROR: Could not fseek `%s`\\n\", ca_cert_name);\n\n pthread_exit((void *)1);\n\n }\n\n long ca_cert_len = ftell(fd);\n\n if (ca_cert_len < 0) {\n\n printf(\" ERROR: Could not ftell `%s`\\n\", ca_cert_name);\n\n pthread_exit((void *)1);\n\n } else if (ca_cert_len >= (1L << 32)) {\n\n printf(\" ERROR: ca_cert_len is larger than 2**32\\n\");\n\n pthread_exit((void *)1);\n\n }\n\n if (fseek(fd, 0, SEEK_SET) != 0) {\n\n printf(\" ERROR: Could not fseek `%s`\\n\", ca_cert_name);\n\n pthread_exit((void *)1);\n\n }\n\n\n\n // Prepare buffer\n\n uint8_t *ca_cert = malloc((size_t)ca_cert_len);\n\n if (ca_cert == NULL) {\n\n printf(\" ERROR: Could not malloc %ld bytes\\n\", ca_cert_len);\n\n pthread_exit((void *)1);\n\n }\n\n size_t read_bytes = fread(ca_cert, (size_t)ca_cert_len, 1, fd);\n\n if (read_bytes != 1) {\n\n printf(\" ERROR: Could not read file\\n\");\n\n pthread_exit((void *)1);\n\n }\n\n if (fclose(fd) != 0) { printf(\"Warning: Closing ca cert file descriptor failed\"); }\n\n\n\n printf(\" Initializing console logger (level WARN)\\n\");\n\n if (!salty_log_init_console(LEVEL_WARN)) {\n\n pthread_exit((void *)1);\n\n }\n\n\n\n printf(\" Creating key pair\\n\");\n\n const salty_keypair_t *keypair = salty_keypair_new();\n\n\n\n printf(\" Creating event loop\\n\");\n\n const salty_event_loop_t *loop = salty_event_loop_new();\n\n\n\n printf(\" Getting event loop remote handle\\n\");\n\n const salty_remote_t *remote = salty_event_loop_get_remote(loop);\n\n\n\n printf(\" Creating client instance\\n\");\n\n salty_relayed_data_client_ret_t client_ret = salty_relayed_data_initiator_new(\n\n keypair,\n\n remote,\n\n 0, // interval seconds\n\n NULL,\n\n NULL\n\n );\n\n if (client_ret.success != OK) {\n\n printf(\" ERROR: Could not create client: %d\", client_ret.success);\n\n pthread_exit((void *)1);\n\n }\n\n\n\n printf(\" Initializing\\n\");\n\n salty_client_init_ret_t init_ret = salty_client_init(\n\n // Host, port\n\n \"localhost\",\n\n 8765,\n\n // Client\n\n client_ret.client,\n\n // Event loop\n\n loop,\n\n // Timeout seconds\n\n 5,\n\n // CA certificate\n\n ca_cert,\n\n (uint32_t)ca_cert_len\n\n );\n\n if (init_ret.success != INIT_OK) {\n\n printf(\" ERROR: Could not initialize connection: %d\", init_ret.success);\n\n pthread_exit((void *)1);\n\n }\n\n\n\n // Assign event_rx to static\n\n event_rx = init_ret.event_rx;\n\n disconnect_tx = client_ret.disconnect_tx;\n\n sem_post(&initialized);\n\n\n\n printf(\" Connecting...\\n\");\n\n salty_client_connect_success_t connect_success = salty_client_connect(\n\n // Handshake future\n\n init_ret.handshake_future,\n\n // Client\n\n client_ret.client,\n\n // Event loop\n\n loop,\n\n // Event channel, sending end\n\n init_ret.event_tx,\n\n // Sender channel, receiving end\n\n client_ret.sender_rx,\n\n // Disconnect channel, receiving end\n\n client_ret.disconnect_rx\n\n );\n\n\n\n printf(\" Connection ended with exit code %d\\n\", connect_success);\n\n\n\n printf(\" Freeing client instance\\n\");\n\n salty_relayed_data_client_free(client_ret.client);\n\n\n\n printf(\" Freeing channel instances\\n\");\n\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\n\n salty_channel_sender_tx_free(client_ret.sender_tx);\n\n salty_channel_event_rx_free(init_ret.event_rx);\n\n\n\n printf(\" Freeing event loop\\n\");\n\n salty_event_loop_free(loop);\n\n\n\n printf(\" Freeing CA cert bytes\\n\");\n\n free(ca_cert);\n\n\n\n pthread_exit((void *)0);\n","file_path":"ffi/tests/disconnect.c","rank":35,"score":66955.31248760308},{"content":"static const salty_channel_receiver_rx_t *initiator_receiver = NULL;\n","file_path":"ffi/tests/integration.c","rank":36,"score":66947.77691112067},{"content":"static const salty_channel_disconnect_tx_t *initiator_disconnect = NULL;\n","file_path":"ffi/tests/integration.c","rank":37,"score":66947.77691112067},{"content":"static const salty_channel_sender_tx_t *initiator_sender = NULL;\n","file_path":"ffi/tests/integration.c","rank":38,"score":66947.77691112067},{"content":"bool salty_log_init_console(uint8_t level);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":39,"score":65981.12666574852},{"content":"const uint8_t *salty_keypair_private_key(const salty_keypair_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":40,"score":65980.78619451911},{"content":"const uint8_t *salty_keypair_public_key(const salty_keypair_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":41,"score":65980.78619451911},{"content":"bool salty_log_init_callback(LogFunction callback,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":42,"score":65980.49520487343},{"content":"salty_client_recv_event_ret_t salty_client_recv_event(const salty_channel_event_rx_t *event_rx,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":43,"score":65518.43092213048},{"content":"salty_client_recv_msg_ret_t salty_client_recv_msg(const salty_channel_receiver_rx_t *receiver_rx,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":44,"score":65518.35593067606},{"content":"static sem_t responder_channels_ready;\n","file_path":"ffi/tests/integration.c","rank":45,"score":64675.57355510744},{"content":"static sem_t initiator_channels_ready;\n","file_path":"ffi/tests/integration.c","rank":46,"score":64619.33639519514},{"content":"const salty_remote_t *salty_event_loop_get_remote(const salty_event_loop_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":47,"score":64285.49141668977},{"content":"void salty_event_loop_free_remote(const salty_remote_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":48,"score":64273.78710059435},{"content":"bool salty_log_change_level_console(uint8_t level);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":49,"score":64225.91004071958},{"content":"void salty_channel_disconnect_tx_free(const salty_channel_disconnect_tx_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":50,"score":64216.91631927949},{"content":"void salty_channel_event_tx_free(const salty_channel_event_tx_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":51,"score":64216.91631927949},{"content":"void salty_channel_sender_tx_free(const salty_channel_sender_tx_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":52,"score":64216.91631927949},{"content":"salty_relayed_data_client_ret_t salty_relayed_data_responder_new(const salty_keypair_t *keypair,\n\n const salty_remote_t *remote,\n\n uint32_t ping_interval_seconds,\n\n const uint8_t *initiator_pubkey,\n\n const uint8_t *auth_token,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":53,"score":64216.62858990432},{"content":"void salty_channel_event_rx_free(const salty_channel_event_rx_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":54,"score":64193.09207768845},{"content":"void salty_channel_disconnect_rx_free(const salty_channel_disconnect_rx_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":55,"score":64193.09207768845},{"content":"void salty_channel_receiver_rx_free(const salty_channel_receiver_rx_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":56,"score":64193.09207768845},{"content":"void salty_channel_sender_rx_free(const salty_channel_sender_rx_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":57,"score":64193.09207768845},{"content":"salty_relayed_data_client_ret_t salty_relayed_data_initiator_new(const salty_keypair_t *keypair,\n\n const salty_remote_t *remote,\n\n uint32_t ping_interval_seconds,\n\n const uint8_t *trusted_responder_key,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":58,"score":64167.8423515639},{"content":"void salty_relayed_data_client_free(const salty_client_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":59,"score":63779.02258664978},{"content":"salty_client_encrypt_decrypt_ret_t salty_client_decrypt_with_session_keys(const salty_client_t *client,\n\n const uint8_t *data,\n\n size_t data_len,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":60,"score":63778.80477014282},{"content":"salty_client_encrypt_decrypt_ret_t salty_client_encrypt_with_session_keys(const salty_client_t *client,\n\n const uint8_t *data,\n\n size_t data_len,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":61,"score":63778.80477014282},{"content":"void salty_client_encrypt_decrypt_free(const uint8_t *data,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":62,"score":63775.3474073709},{"content":"salty_client_send_success_t salty_client_send_application_bytes(const salty_channel_sender_tx_t *sender_tx,\n\n const uint8_t *msg,\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":63,"score":63774.78667023897},{"content":"fn c_tests_run(bin: &str, logger: Option<&str>) {\n\n let (_guard, build_dir) = build_tests();\n\n\n\n // Event loop\n\n let mut core = Core::new().unwrap();\n\n\n\n // Timer\n\n let timer = Timer::default();\n\n\n\n // Create a command future\n\n let mut cmd = Command::new(bin);\n\n if let Some(l) = logger {\n\n cmd.arg(\"-l\").arg(l);\n\n }\n\n let c_tests = cmd\n\n .current_dir(&build_dir)\n\n .output_async(&core.handle());\n\n\n\n // Run command with timeout\n\n let timeout_seconds = 3;\n","file_path":"ffi/tests/integration.rs","rank":64,"score":63471.24426431905},{"content":"const uint8_t *salty_relayed_data_client_auth_token(const salty_client_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":65,"score":62129.24029792171},{"content":"void salty_client_recv_msg_ret_free(salty_client_recv_msg_ret_t recv_ret);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":66,"score":62128.53621471766},{"content":"void salty_client_recv_event_ret_free(salty_client_recv_event_ret_t recv_ret);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":67,"score":62128.53621471766},{"content":"fn assert_output_success(output: Output) {\n\n if !output.status.success() {\n\n let stdout = String::from_utf8_lossy(&output.stdout);\n\n let stderr = String::from_utf8_lossy(&output.stderr);\n\n println!(\"Stdout:\\n{}\\nStderr:\\n{}\\n\", stdout, stderr);\n\n panic!(\"Running C tests failed with non-zero return code\");\n\n }\n\n}\n\n\n","file_path":"ffi/tests/integration.rs","rank":68,"score":61812.863528911024},{"content":"fn level_to_u8(level: Level) -> u8 {\n\n match level {\n\n Level::Trace => LEVEL_TRACE,\n\n Level::Debug => LEVEL_DEBUG,\n\n Level::Info => LEVEL_INFO,\n\n Level::Warn => LEVEL_WARN,\n\n Level::Error => LEVEL_ERROR,\n\n }\n\n}\n\n\n\npub type LogFunction = unsafe extern \"C\" fn(level: u8, target: *const c_char, message: *const c_char);\n\n\n","file_path":"ffi/src/saltyrtc_client_ffi.rs","rank":69,"score":56577.1834433491},{"content":"pub fn new<'a, T>(inner: &'a mut T) -> NonBlocking<'a, T> {\n\n NonBlocking { inner }\n\n}\n\n\n\nimpl<'a, T> Future for NonBlocking<'a, T> where T: Future {\n\n type Item = Option<T::Item>;\n\n type Error = T::Error;\n\n\n\n fn poll(&mut self) -> Poll<Self::Item, Self::Error> {\n\n match self.inner.poll()? {\n\n Async::Ready(v) => Ok(Async::Ready(Some(v))),\n\n Async::NotReady => Ok(Async::Ready(None)),\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::time::Duration;\n\n\n","file_path":"ffi/src/nonblocking.rs","rank":70,"score":53628.086782400984},{"content":"enum LogConfig {\n\n Console(LevelFilter),\n\n Callback(LogFunction, LevelFilter),\n\n}\n\n\n","file_path":"ffi/src/saltyrtc_client_ffi.rs","rank":71,"score":53402.8784737876},{"content":"fn u8_to_levelfilter(level: u8) -> Option<LevelFilter> {\n\n Some(match level {\n\n LEVEL_TRACE => LevelFilter::Trace,\n\n LEVEL_DEBUG => LevelFilter::Debug,\n\n LEVEL_INFO => LevelFilter::Info,\n\n LEVEL_WARN => LevelFilter::Warn,\n\n LEVEL_ERROR => LevelFilter::Error,\n\n LEVEL_OFF => LevelFilter::Off,\n\n _ => return None\n\n })\n\n}\n\n\n","file_path":"ffi/src/saltyrtc_client_ffi.rs","rank":72,"score":52043.31916016601},{"content":"fn main() {\n\n\n\n // Set up CLI arguments\n\n let arg_srv_host = Arg::with_name(ARG_SRV_HOST)\n\n .short(\"h\")\n\n .takes_value(true)\n\n .value_name(\"SRV_HOST\")\n\n .required(true)\n\n .default_value(\"server.saltyrtc.org\")\n\n .help(\"The SaltyRTC server hostname\");\n\n let arg_srv_port = Arg::with_name(ARG_SRV_PORT)\n\n .short(\"p\")\n\n .takes_value(true)\n\n .value_name(\"SRV_PORT\")\n\n .required(true)\n\n .default_value(\"443\")\n\n .help(\"The SaltyRTC server port\");\n\n let arg_srv_pubkey = Arg::with_name(ARG_SRV_PUBKEY)\n\n .short(\"s\")\n\n .takes_value(true)\n","file_path":"examples/testclient.rs","rank":73,"score":49625.37379428631},{"content":" const salty_channel_event_tx_t *event_tx;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":74,"score":49312.96797912666},{"content":" const salty_channel_disconnect_tx_t *disconnect_tx;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":75,"score":49312.96797912666},{"content":" const salty_channel_sender_tx_t *sender_tx;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":76,"score":49312.96797912666},{"content":" const salty_channel_sender_rx_t *sender_rx;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":77,"score":49286.804440305685},{"content":" const salty_channel_disconnect_rx_t *disconnect_rx;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":78,"score":49286.804440305685},{"content":" const salty_channel_receiver_rx_t *receiver_rx;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":79,"score":49286.804440305685},{"content":" const salty_channel_event_rx_t *event_rx;\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":80,"score":49286.804440305685},{"content":"const salty_event_loop_t *salty_event_loop_new(void);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":81,"score":46386.17514410299},{"content":"void salty_event_loop_free(const salty_event_loop_t *ptr);\n","file_path":"ffi/saltyrtc_task_relayed_data_ffi.h","rank":82,"score":46376.35781714266},{"content":"int main() {\n\n printf(\"START C TEST\\n\");\n\n\n\n printf(\" START THREAD\\n\");\n\n pthread_t thread;\n\n pthread_create(&thread, NULL, connect_initiator, NULL);\n\n\n\n printf(\" WAITING FOR INIT\\n\");\n\n sem_wait(&initialized);\n\n\n\n printf(\" WAITING FOR SERVER HANDSHAKE COMPLETION\\n\");\n\n bool success = wait_for_server_handshake_completion(5000);\n\n if (!success) {\n\n printf(\" Waiting for server handshake completion failed!\");\n\n return EXIT_FAILURE;\n\n }\n\n printf(\" SERVER HANDSHAKE DONE\\n\");\n\n printf(\" DISCONNECT\\n\");\n\n salty_client_disconnect_success_t disconnect_success = salty_client_disconnect(disconnect_tx, 1001);\n\n if (disconnect_success != DISCONNECT_OK) {\n\n printf(\" Disconnect failed with code %d\\n\", disconnect_success);\n\n return EXIT_FAILURE;\n\n }\n\n\n\n printf(\" JOIN THREAD\\n\");\n\n int *result;\n\n pthread_join(thread, (void*)&result);\n\n if (result != 0) {\n\n printf(\" Thread failed\\n\");\n\n return EXIT_FAILURE;\n\n }\n\n\n\n printf(\"END C TEST\\n\");\n\n\n\n // Close stdout / stderr to please valgrind\n\n if (fclose(stdin) != 0) { printf(\"Warning: Closing stdin failed\"); }\n\n if (fclose(stdout) != 0) { printf(\"Warning: Closing stdout failed\"); }\n\n if (fclose(stderr) != 0) { printf(\"Warning: Closing stderr failed\"); }\n\n\n\n return EXIT_SUCCESS;\n","file_path":"ffi/tests/disconnect.c","rank":83,"score":45547.83262529388},{"content":"int main(int argc, char *argv[]) {\n\n // Parse arguments\n\n int opt;\n\n enum { LOGGER_CONSOLE, LOGGER_CALLBACK } logger = LOGGER_CONSOLE;\n\n while ((opt = getopt(argc, argv, \"l:\")) != -1) {\n\n switch (opt) {\n\n case 'l':\n\n if (strcmp(optarg, \"console\") == 0) {\n\n logger = LOGGER_CONSOLE;\n\n break;\n\n }\n\n if (strcmp(optarg, \"callback\") == 0) {\n\n logger = LOGGER_CALLBACK;\n\n break;\n\n }\n\n fprintf(stderr, \"Invalid logger mode: %s\\n\", optarg);\n\n return EXIT_FAILURE;\n\n default:\n\n fprintf(stderr, \"Usage: %s [-l LOGGER_MODE]\\n\\n\", argv[0]);\n\n fprintf(stderr, \"Note: The logger mode may be either 'console' or 'callback'.\\n\");\n\n fprintf(stderr, \" The default value is 'console'.\\n\");\n\n return EXIT_FAILURE;\n\n }\n\n }\n\n printf(\"Logger: %d\\n\", logger);\n\n\n\n printf(\"START C TEST\\n\");\n\n\n\n printf(\" Reading DER formatted test CA certificate\\n\");\n\n\n\n // Open file\n\n const char *const ca_cert_name = \"saltyrtc.der\";\n\n FILE *fd = fopen(ca_cert_name, \"rb\");\n\n if (fd == NULL) {\n\n printf(\" ERROR: Could not open `%s`\\n\", ca_cert_name);\n\n return EXIT_FAILURE;\n\n }\n\n\n\n // Get file size\n\n if (fseek(fd, 0, SEEK_END) != 0) {\n\n printf(\" ERROR: Could not fseek `%s`\\n\", ca_cert_name);\n\n return EXIT_FAILURE;\n\n }\n\n long ca_cert_len = ftell(fd);\n\n if (ca_cert_len < 0) {\n\n printf(\" ERROR: Could not ftell `%s`\\n\", ca_cert_name);\n\n return EXIT_FAILURE;\n\n } else if (ca_cert_len >= (1L << 32)) {\n\n printf(\" ERROR: ca_cert_len is larger than 2**32\\n\");\n\n return EXIT_FAILURE;\n\n }\n\n if (fseek(fd, 0, SEEK_SET) != 0) {\n\n printf(\" ERROR: Could not fseek `%s`\\n\", ca_cert_name);\n\n return EXIT_FAILURE;\n\n }\n\n\n\n // Prepare buffer\n\n uint8_t *ca_cert = malloc((size_t)ca_cert_len);\n\n if (ca_cert == NULL) {\n\n printf(\" ERROR: Could not malloc %ld bytes\\n\", ca_cert_len);\n\n return EXIT_FAILURE;\n\n }\n\n size_t read_bytes = fread(ca_cert, (size_t)ca_cert_len, 1, fd);\n\n if (read_bytes != 1) {\n\n printf(\" ERROR: Could not read file\\n\");\n\n return EXIT_FAILURE;\n\n }\n\n if (fclose(fd) != 0) printf(\"Warning: Closing ca cert file descriptor failed\");\n\n\n\n if (logger == LOGGER_CONSOLE) {\n\n printf(\" Initializing console logger (level DEBUG)\\n\");\n\n if (!salty_log_init_console(LEVEL_DEBUG)) {\n\n return EXIT_FAILURE;\n\n }\n\n printf(\" Updating logger (level WARN)\\n\");\n\n if (!salty_log_change_level_console(LEVEL_WARN)) {\n\n return EXIT_FAILURE;\n\n }\n\n } else if (logger == LOGGER_CALLBACK) {\n\n printf(\" Initializing callback logger (level DEBUG)\\n\");\n\n if (!salty_log_init_callback(log_callback, LEVEL_DEBUG)) {\n\n return EXIT_FAILURE;\n\n }\n\n }\n\n\n\n printf(\" Creating key pairs\\n\");\n\n const salty_keypair_t *i_keypair = salty_keypair_new();\n\n const salty_keypair_t *r_keypair = salty_keypair_new();\n\n const salty_keypair_t *unused_keypair = salty_keypair_new();\n\n\n\n printf(\" Restoring keypair from existing key\\n\");\n\n uint8_t *private_key_ptr = malloc(32);\n\n if (private_key_ptr == NULL) {\n\n printf(\" ERROR: Could not malloc 32 bytes\\n\");\n\n return EXIT_FAILURE;\n\n }\n\n memset(private_key_ptr, 42, 32);\n\n const salty_keypair_t *restored_keypair = salty_keypair_restore(private_key_ptr);\n\n\n\n printf(\" Extracting private key of existing keypair\\n\");\n\n const uint8_t *extracted_private_key = salty_keypair_private_key(restored_keypair);\n\n if (memcmp(private_key_ptr, extracted_private_key, 32) != 0) {\n\n printf(\" ERROR: Extracted private key does not match original private key\\n\");\n\n free(private_key_ptr);\n\n return EXIT_FAILURE;\n\n }\n\n free(private_key_ptr);\n\n\n\n printf(\" Copying public key from initiator\\n\");\n\n uint8_t *i_pubkey = malloc(32 * sizeof(uint8_t));\n\n if (i_pubkey == NULL) {\n\n printf(\" ERROR: Could not allocate memory for public key\");\n\n return EXIT_FAILURE;\n\n }\n\n const uint8_t *i_pubkey_ref = salty_keypair_public_key(i_keypair);\n\n memcpy(i_pubkey, i_pubkey_ref, 32 * sizeof(uint8_t));\n\n\n\n printf(\" Initiating semaphores\\n\");\n\n sem_init(&auth_token_set, 0, 0);\n\n sem_init(&initiator_channels_ready, 0, 0);\n\n sem_init(&responder_channels_ready, 0, 0);\n\n\n\n // Start initiator thread\n\n pthread_t i_thread;\n\n struct thread_data i_data = {\n\n .interval_seconds = 0,\n\n .timeout_seconds = 5,\n\n .keypair = i_keypair,\n\n .initiator_pubkey = NULL,\n\n .ca_cert = ca_cert,\n\n .ca_cert_len = ca_cert_len\n\n };\n\n pthread_create(&i_thread, NULL, connect_initiator, (void*)&i_data);\n\n\n\n // Start responder thread\n\n pthread_t r_thread;\n\n struct thread_data r_data = {\n\n .interval_seconds = 0,\n\n .timeout_seconds = 5,\n\n .keypair = r_keypair,\n\n .initiator_pubkey = i_pubkey,\n\n .ca_cert = ca_cert,\n\n .ca_cert_len = ca_cert_len\n\n };\n\n pthread_create(&r_thread, NULL, connect_responder, (void*)&r_data);\n\n\n\n // Waiting for connection event\n\n printf(\" Waiting for initiator tx channel...\\n\");\n\n sem_wait(&initiator_channels_ready);\n\n printf(\" Waiting for responder tx channel...\\n\");\n\n sem_wait(&responder_channels_ready);\n\n printf(\" Both outgoing channels are ready\\n\");\n\n\n\n // Send message\n\n printf(\" Sending message from initiator to responder\\n\");\n\n const uint8_t msg[] = { 0x93, 0x01, 0x02, 0x03 };\n\n if (SEND_OK != salty_client_send_task_bytes(initiator_sender, msg, 4)) {\n\n printf(\" ERROR: Sending message from initiator to responder failed\\n\");\n\n return EXIT_FAILURE;\n\n }\n\n\n\n // Receive message\n\n printf(\" Waiting for message to arrive...\\n\");\n\n uint32_t timeout_ms = 10000;\n\n const salty_client_recv_msg_ret_t recv_msg_ret = salty_client_recv_msg(responder_receiver, &timeout_ms);\n\n switch (recv_msg_ret.success) {\n\n case RECV_OK:\n\n printf(\" OK: Message (%lu bytes) from initiator arrived!\\n\", recv_msg_ret.msg->msg_bytes_len);\n\n if (recv_msg_ret.msg->msg_bytes_len != 4 ||\n\n recv_msg_ret.msg->msg_bytes[0] != 0x93 ||\n\n recv_msg_ret.msg->msg_bytes[1] != 0x01 ||\n\n recv_msg_ret.msg->msg_bytes[2] != 0x02 ||\n\n recv_msg_ret.msg->msg_bytes[3] != 0x03) {\n\n printf(\" ERROR: Invalid message received\\n\");\n\n return EXIT_FAILURE;\n\n } else {\n\n printf(\" OK: Message is valid!\\n\");\n\n }\n\n break;\n\n case RECV_NO_DATA:\n\n printf(\" ERROR: Waiting for message timed out!\\n\");\n\n return EXIT_FAILURE;\n\n case RECV_STREAM_ENDED:\n\n printf(\" ERROR: The incoming event stream has ended!\\n\");\n\n return EXIT_FAILURE;\n\n default:\n\n printf(\" ERROR: Error while waiting for incoming message\\n\");\n\n return EXIT_FAILURE;\n\n }\n\n printf(\" Freeing received event\\n\");\n\n salty_client_recv_msg_ret_free(recv_msg_ret);\n\n\n\n // Disconnect\n\n printf(\" Disconnecting initiator\\n\");\n\n salty_client_disconnect(initiator_disconnect, 1001);\n\n printf(\" Disconnecting responder\\n\");\n\n salty_client_disconnect(responder_disconnect, 1001);\n\n\n\n // Joining client threads\n\n printf(\" Waiting for client threads to terminate...\\n\");\n\n salty_client_connect_success_t *i_success;\n\n salty_client_connect_success_t *r_success;\n\n pthread_join(i_thread, (void*)&i_success);\n\n pthread_join(r_thread, (void*)&r_success);\n\n\n\n bool success = true;\n\n if (*i_success != CONNECT_OK) {\n\n printf(\"ERROR: Connecting initiator was not successful\\n\");\n\n success = false;\n\n } else {\n\n printf(\"OK: Connection initiator was successful\\n\");\n\n }\n\n free(i_success);\n\n if (*r_success != CONNECT_OK) {\n\n printf(\"ERROR: Connecting responder was not successful\\n\");\n\n success = false;\n\n } else {\n\n printf(\"OK: Connection responder was successful\\n\");\n\n }\n\n free(r_success);\n\n if (!success) {\n\n return EXIT_FAILURE;\n\n }\n\n\n\n printf(\"CLEANUP\\n\");\n\n\n\n printf(\" Freeing CA cert bytes\\n\");\n\n free(ca_cert);\n\n\n\n printf(\" Freeing public key copy\\n\");\n\n free(i_pubkey);\n\n\n\n printf(\" Freeing unused keypairs\\n\");\n\n salty_keypair_free(unused_keypair);\n\n salty_keypair_free(restored_keypair);\n\n\n\n printf(\" Destroying semaphores\\n\");\n\n sem_destroy(&auth_token_set);\n\n sem_destroy(&initiator_channels_ready);\n\n sem_destroy(&responder_channels_ready);\n\n\n\n printf(\"END C TEST\\n\");\n\n\n\n // Close stdout / stderr to please valgrind\n\n if (fclose(stdin) != 0) printf(\"Warning: Closing stdin failed\");\n\n if (fclose(stdout) != 0) printf(\"Warning: Closing stdout failed\");\n\n if (fclose(stderr) != 0) printf(\"Warning: Closing stderr failed\");\n\n\n\n return EXIT_SUCCESS;\n","file_path":"ffi/tests/integration.c","rank":84,"score":45547.83262529388},{"content":"struct thread_data {\n\n uint32_t interval_seconds;\n\n uint16_t timeout_seconds;\n\n const salty_keypair_t *keypair;\n\n const uint8_t *initiator_pubkey;\n\n const uint8_t *ca_cert;\n\n long ca_cert_len;\n","file_path":"ffi/tests/integration.c","rank":85,"score":43913.60530962124},{"content":"void drain_events(const salty_channel_event_rx_t *event_rx, char *role);\n","file_path":"ffi/tests/integration.c","rank":86,"score":43906.59913678013},{"content":" uint32_t interval_seconds;\n","file_path":"ffi/tests/integration.c","rank":87,"score":43906.59913678013},{"content":"static sem_t auth_token_set;\n","file_path":"ffi/tests/integration.c","rank":88,"score":42379.52969454451},{"content":"bool wait_for_server_handshake_completion(uint32_t timeout_ms);\n","file_path":"ffi/tests/disconnect.c","rank":89,"score":40955.11280731241},{"content":"/// Print the QR code payload to the terminal\n\nfn print_qrcode(payload: &[u8]) {\n\n let base64 = BASE64.encode(&payload);\n\n let qr = QrCode::encode_text(&base64, QrCodeEcc::Low).unwrap();\n\n let border = 1;\n\n for y in -border .. qr.size() + border {\n\n for x in -border .. qr.size() + border {\n\n let c: char = if qr.get_module(x, y) { '█' } else { ' ' };\n\n print!(\"{0}{0}\", c);\n\n }\n\n println!();\n\n }\n\n println!();\n\n}\n\n\n","file_path":"examples/testclient.rs","rank":90,"score":39041.966618046165},{"content":"extern crate cbindgen;\n\n\n\nuse std::env;\n\n\n","file_path":"ffi/build.rs","rank":91,"score":34304.71690351369},{"content":"\n\n // Set up client instance\n\n let client = Arc::new(RwLock::new({\n\n let builder = SaltyClient::build(keypair)\n\n .add_task(Box::new(task))\n\n .with_ping_interval(Some(ping_interval));\n\n match role {\n\n Role::Initiator => builder\n\n .initiator()\n\n .expect(\"Could not create SaltyClient instance\"),\n\n Role::Responder => {\n\n let auth_token_hex = args.value_of(ARG_AUTHTOKEN).expect(\"Auth token not supplied\").to_string();\n\n let auth_token = AuthToken::from_hex_str(&auth_token_hex).expect(\"Invalid auth token hex string\");\n\n let initiator_pubkey = public_key_from_hex_str(&path).unwrap();\n\n builder\n\n .responder(initiator_pubkey, auth_token)\n\n .expect(\"Could not create SaltyClient instance\")\n\n }\n\n }\n\n }));\n","file_path":"examples/testclient.rs","rank":95,"score":32.19749947519772},{"content":" Box::from_raw(rx_ptr as *mut salty_channel_receiver_rx_t);\n\n }\n\n }\n\n\n\n #[test]\n\n fn test_free_channels() {\n\n let keypair = salty_keypair_new();\n\n let event_loop = salty_event_loop_new();\n\n let remote = unsafe { salty_event_loop_get_remote(event_loop) };\n\n let client_ret = unsafe { salty_relayed_data_initiator_new(keypair, remote, 0, ptr::null(), ptr::null()) };\n\n unsafe {\n\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\n\n salty_channel_sender_tx_free(client_ret.sender_tx);\n\n salty_channel_sender_rx_free(client_ret.sender_rx);\n\n }\n\n }\n\n\n\n /// Using zero bytes as trusted key should fail.\n\n #[test]\n\n fn test_initiator_trusted_key_validation() {\n","file_path":"ffi/src/lib.rs","rank":96,"score":31.667142297369175},{"content":" // Set up logging\n\n env::set_var(\"RUST_LOG\", \"saltyrtc_client=debug,saltyrtc_task_relayed_data=debug,testclient=trace\");\n\n env_logger::init();\n\n\n\n // Tokio reactor core\n\n let mut core = Core::new().unwrap();\n\n\n\n // Create TLS connector instance\n\n let tls_connector = TlsConnector::builder()\n\n .min_protocol_version(Some(Protocol::Tlsv11))\n\n .build()\n\n .unwrap_or_else(|e| panic!(\"Could not initialize TlsConnector: {}\", e));\n\n\n\n // Create new public permanent keypair\n\n let keypair = KeyPair::new();\n\n let pubkey = keypair.public_key().clone();\n\n\n\n // Determine websocket path\n\n let path: String = match role {\n\n Role::Initiator => keypair.public_key_hex(),\n","file_path":"examples/testclient.rs","rank":97,"score":31.246124564887424},{"content":"#[macro_use] extern crate failure;\n\n#[macro_use] extern crate log;\n\nextern crate saltyrtc_client;\n\nextern crate tokio_core;\n\n\n\nuse std::borrow::Cow;\n\nuse std::collections::HashMap;\n\nuse std::mem;\n\n\n\nuse saltyrtc_client::{CloseCode, BoxedFuture};\n\nuse saltyrtc_client::dep::futures::future;\n\nuse saltyrtc_client::dep::futures::{Stream, Sink, Future};\n\nuse saltyrtc_client::dep::futures::sync::mpsc::{self, UnboundedSender, UnboundedReceiver};\n\nuse saltyrtc_client::dep::futures::sync::oneshot::Sender as OneshotSender;\n\nuse saltyrtc_client::dep::rmpv::Value;\n\nuse saltyrtc_client::errors::Error;\n\nuse saltyrtc_client::tasks::{Task, TaskMessage};\n\nuse tokio_core::reactor::Remote;\n\n\n\nmod errors;\n","file_path":"src/lib.rs","rank":98,"score":29.49416208562604}],"string":"[\n {\n \"content\": \"fn build_tests() -> (MutexGuard<'static, ()>, PathBuf) {\\n\\n let guard = match C_TEST_MUTEX.lock() {\\n\\n Ok(guard) => guard,\\n\\n Err(poisoned) => poisoned.into_inner(),\\n\\n };\\n\\n\\n\\n let out_dir = env!(\\\"OUT_DIR\\\");\\n\\n let build_dir = Path::new(out_dir).join(\\\"build\\\");\\n\\n\\n\\n println!(\\\"Running meson...\\\");\\n\\n Command::new(\\\"meson\\\")\\n\\n .arg(build_dir.to_str().unwrap())\\n\\n .env(\\\"CC\\\", \\\"clang\\\")\\n\\n .output()\\n\\n .expect(\\\"Could not run meson to build C tests\\\");\\n\\n\\n\\n println!(\\\"Running ninja...\\\");\\n\\n let output = Command::new(\\\"ninja\\\")\\n\\n .current_dir(&build_dir)\\n\\n .output()\\n\\n .expect(\\\"Could not run ninja to build C tests\\\");\\n\\n assert_output_success(output);\\n\\n\\n\\n println!(\\\"Copying test certificate...\\\");\\n\\n copy(\\\"../saltyrtc.der\\\", build_dir.join(\\\"saltyrtc.der\\\"))\\n\\n .expect(\\\"Could not copy test certificate (saltyrtc.der)\\\");\\n\\n\\n\\n (guard, build_dir)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/tests/integration.rs\",\n \"rank\": 0,\n \"score\": 113786.40864564222\n },\n {\n \"content\": \"/// Helper function to return error values when creating a client instance.\\n\\nfn make_client_create_error(reason: salty_relayed_data_success_t) -> salty_relayed_data_client_ret_t {\\n\\n salty_relayed_data_client_ret_t {\\n\\n success: reason,\\n\\n client: ptr::null(),\\n\\n receiver_rx: ptr::null(),\\n\\n sender_tx: ptr::null(),\\n\\n sender_rx: ptr::null(),\\n\\n disconnect_tx: ptr::null(),\\n\\n disconnect_rx: ptr::null(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 4,\n \"score\": 103000.50390243322\n },\n {\n \"content\": \" const salty_keypair_t *keypair;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 5,\n \"score\": 94362.86782556414\n },\n {\n \"content\": \" const uint8_t *ca_cert;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 6,\n \"score\": 90280.40058090781\n },\n {\n \"content\": \" const uint8_t *initiator_pubkey;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 7,\n \"score\": 90134.67763318452\n },\n {\n \"content\": \" long ca_cert_len;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 8,\n \"score\": 87140.45251682721\n },\n {\n \"content\": \"fn main() {\\n\\n let crate_dir = env::var(\\\"CARGO_MANIFEST_DIR\\\").unwrap();\\n\\n if env::var(\\\"SKIP_CBINDGEN\\\").unwrap_or(\\\"0\\\".to_string()) == \\\"1\\\" {\\n\\n return;\\n\\n }\\n\\n cbindgen::generate(&crate_dir)\\n\\n .expect(\\\"Unable to generate C bindings\\\")\\n\\n .write_to_file(\\\"saltyrtc_task_relayed_data_ffi.h\\\");\\n\\n}\\n\",\n \"file_path\": \"ffi/build.rs\",\n \"rank\": 9,\n \"score\": 82182.4263534448\n },\n {\n \"content\": \"// #[test] Disabled for now due to false errors, see\\n\\n// https://bugs.kde.org/show_bug.cgi?id=381289 and\\n\\n// https://bugzilla.redhat.com/show_bug.cgi?id=1462258\\n\\n// Additionally, the log4rs logger initializes global memory that cannot\\n\\n// currently be freed.\\n\\nfn c_tests_no_memory_leaks() {\\n\\n let (_guard, build_dir) = build_tests();\\n\\n\\n\\n let output = Command::new(\\\"valgrind\\\")\\n\\n .arg(\\\"--error-exitcode=23\\\")\\n\\n .arg(\\\"--leak-check=full\\\")\\n\\n .arg(\\\"--track-fds=yes\\\")\\n\\n .arg(\\\"./integration\\\")\\n\\n .current_dir(&build_dir)\\n\\n .output()\\n\\n .expect(\\\"Could not run valgrind\\\");\\n\\n if !output.status.success() {\\n\\n let stdout = String::from_utf8_lossy(&output.stdout);\\n\\n let stderr = String::from_utf8_lossy(&output.stderr);\\n\\n println!(\\\"Stdout:\\\\n{}\\\\nStderr:\\\\n{}\\\\n\\\", stdout, stderr);\\n\\n panic!(\\\"Running valgrind failed with non-zero return code\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"ffi/tests/integration.rs\",\n \"rank\": 10,\n \"score\": 81721.57598514242\n },\n {\n \"content\": \"#[test]\\n\\nfn c_tests_disconnect_run() {\\n\\n c_tests_run(\\\"./disconnect\\\", None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/tests/integration.rs\",\n \"rank\": 11,\n \"score\": 81720.0765061444\n },\n {\n \"content\": \"fn make_log_config(config: LogConfig) -> Result<Config, String> {\\n\\n // Log format\\n\\n let format = \\\"{d(%Y-%m-%dT%H:%M:%S%.3f)} [{l:<5}] {m} (({f}:{L})){n}\\\";\\n\\n\\n\\n // Appender\\n\\n let (appender, level) = match config {\\n\\n LogConfig::Console(level) => {\\n\\n let console = ConsoleAppender::builder()\\n\\n .encoder(Box::new(PatternEncoder::new(format)))\\n\\n .build();\\n\\n (Box::new(console) as Box<dyn Append>, level)\\n\\n }\\n\\n LogConfig::Callback(func, level) => {\\n\\n (Box::new(CallbackAppender::new(func)) as Box<dyn Append>, level)\\n\\n }\\n\\n };\\n\\n\\n\\n // Create logging config object\\n\\n let config_res = Config::builder()\\n\\n .appender(Appender::builder().build(\\\"appender\\\", appender))\\n\",\n \"file_path\": \"ffi/src/saltyrtc_client_ffi.rs\",\n \"rank\": 12,\n \"score\": 78723.15720419362\n },\n {\n \"content\": \"#[test]\\n\\nfn c_tests_integration_run_console_logger() {\\n\\n c_tests_run(\\\"./integration\\\", Some(\\\"console\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/tests/integration.rs\",\n \"rank\": 13,\n \"score\": 77447.75853365683\n },\n {\n \"content\": \"#[test]\\n\\nfn c_tests_integration_run_callback_logger() {\\n\\n c_tests_run(\\\"./integration\\\", Some(\\\"callback\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/tests/integration.rs\",\n \"rank\": 14,\n \"score\": 77447.75853365683\n },\n {\n \"content\": \" const salty_client_t *client;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 15,\n \"score\": 75028.00427325869\n },\n {\n \"content\": \"/// Create the QR code payload\\n\\nfn make_qrcode_payload(version: u16, permanent: bool, host: &str, port: u16, pubkey: &[u8], auth_token: &[u8], server_pubkey: &[u8]) -> Vec<u8> {\\n\\n let mut data: Vec<u8> = Vec::with_capacity(101 + host.as_bytes().len());\\n\\n\\n\\n data.write_u16::<BigEndian>(version).unwrap();\\n\\n data.push(if permanent { 0x02 } else { 0x00 });\\n\\n data.write_all(&pubkey).unwrap();\\n\\n data.write_all(&auth_token).unwrap();\\n\\n data.write_all(&server_pubkey).unwrap();\\n\\n data.write_u16::<BigEndian>(port).unwrap();\\n\\n data.write_all(host.as_bytes()).unwrap();\\n\\n\\n\\n data\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/testclient.rs\",\n \"rank\": 16,\n \"score\": 70051.73912628788\n },\n {\n \"content\": \"static sem_t initialized;\\n\",\n \"file_path\": \"ffi/tests/disconnect.c\",\n \"rank\": 17,\n \"score\": 69450.29215047648\n },\n {\n \"content\": \"salty_client_send_success_t salty_client_send_task_bytes(const salty_channel_sender_tx_t *sender_tx,\\n\\n const uint8_t *msg,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 18,\n \"score\": 69048.64458025097\n },\n {\n \"content\": \"static uint8_t *auth_token = NULL;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 19,\n \"score\": 68704.58762942362\n },\n {\n \"content\": \"void salty_keypair_free(const salty_keypair_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 20,\n \"score\": 67837.07321804513\n },\n {\n \"content\": \"const salty_keypair_t *salty_keypair_new(void);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 21,\n \"score\": 67836.56183290292\n },\n {\n \"content\": \"const salty_keypair_t *salty_keypair_restore(const uint8_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 22,\n \"score\": 67834.72565376054\n },\n {\n \"content\": \"salty_client_init_ret_t salty_client_init(const char *host,\\n\\n uint16_t port,\\n\\n const salty_client_t *client,\\n\\n const salty_event_loop_t *event_loop,\\n\\n uint16_t timeout_s,\\n\\n const uint8_t *ca_cert,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 23,\n \"score\": 67364.32065424637\n },\n {\n \"content\": \"salty_client_connect_success_t salty_client_connect(const salty_handshake_future_t *handshake_future,\\n\\n const salty_client_t *client,\\n\\n const salty_event_loop_t *event_loop,\\n\\n const salty_channel_event_tx_t *event_tx,\\n\\n const salty_channel_sender_rx_t *sender_rx,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 24,\n \"score\": 67363.39081803856\n },\n {\n \"content\": \"salty_client_disconnect_success_t salty_client_disconnect(const salty_channel_disconnect_tx_t *disconnect_tx,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 25,\n \"score\": 67359.39267344215\n },\n {\n \"content\": \" uint16_t timeout_seconds;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 26,\n \"score\": 67109.43770223096\n },\n {\n \"content\": \"static void log_callback(uint8_t level, const char *target, const char *message) {\\n\\n printf(\\\"****** [%d] %s: %s\\\\n\\\", level, target, message);\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 27,\n \"score\": 67034.98804308508\n },\n {\n \"content\": \"static const salty_channel_disconnect_tx_t *disconnect_tx = NULL;\\n\",\n \"file_path\": \"ffi/tests/disconnect.c\",\n \"rank\": 28,\n \"score\": 67020.52256748466\n },\n {\n \"content\": \"void *connect_responder(void *threadarg) {\\n\\n struct thread_data *data = (struct thread_data *) threadarg;\\n\\n printf(\\\" THREAD: Started responder thread\\\\n\\\");\\n\\n\\n\\n printf(\\\" RESPONDER: Creating event loop\\\\n\\\");\\n\\n const salty_event_loop_t *loop = salty_event_loop_new();\\n\\n\\n\\n printf(\\\" RESPONDER: Getting event loop remote handle\\\\n\\\");\\n\\n const salty_remote_t *remote = salty_event_loop_get_remote(loop);\\n\\n\\n\\n printf(\\\" RESPONDER: Waiting for auth token semaphore...\\\\n\\\");\\n\\n sem_wait(&auth_token_set);\\n\\n\\n\\n printf(\\\" RESPONDER: Creating client instance\\\\n\\\");\\n\\n salty_relayed_data_client_ret_t client_ret = salty_relayed_data_responder_new(\\n\\n data->keypair,\\n\\n remote,\\n\\n data->interval_seconds,\\n\\n data->initiator_pubkey,\\n\\n auth_token,\\n\\n NULL\\n\\n );\\n\\n if (client_ret.success != OK) {\\n\\n printf(\\\" RESPONDER ERROR: Could not create client: %d\\\", client_ret.success);\\n\\n pthread_exit(NULL);\\n\\n }\\n\\n\\n\\n responder_sender = client_ret.sender_tx;\\n\\n responder_receiver = client_ret.receiver_rx;\\n\\n responder_disconnect = client_ret.disconnect_tx;\\n\\n printf(\\\" RESPONDER: Notifying main thread that the channels are ready\\\\n\\\");\\n\\n sem_post(&responder_channels_ready);\\n\\n\\n\\n printf(\\\" RESPONDER: Initializing\\\\n\\\");\\n\\n salty_client_init_ret_t init_ret = salty_client_init(\\n\\n // Host, port\\n\\n \\\"localhost\\\",\\n\\n 8765,\\n\\n // Client\\n\\n client_ret.client,\\n\\n // Event loop\\n\\n loop,\\n\\n // Timeout seconds\\n\\n data->timeout_seconds,\\n\\n // CA certificate\\n\\n data->ca_cert,\\n\\n (uint32_t)data->ca_cert_len\\n\\n );\\n\\n if (init_ret.success != INIT_OK) {\\n\\n printf(\\\" RESPONDER ERROR: Could not initialize connection: %d\\\", init_ret.success);\\n\\n pthread_exit(NULL);\\n\\n }\\n\\n\\n\\n printf(\\\" RESPONDER: Connecting\\\\n\\\");\\n\\n salty_client_connect_success_t connect_success = salty_client_connect(\\n\\n // Handshake future\\n\\n init_ret.handshake_future,\\n\\n // Client\\n\\n client_ret.client,\\n\\n // Event loop\\n\\n loop,\\n\\n // Event channel, sending end\\n\\n init_ret.event_tx,\\n\\n // Sender channel, receiving end\\n\\n client_ret.sender_rx,\\n\\n // Disconnect channel, receiving end\\n\\n client_ret.disconnect_rx\\n\\n );\\n\\n\\n\\n drain_events(init_ret.event_rx, \\\"RESPONDER\\\");\\n\\n\\n\\n printf(\\\" RESPONDER: Connection ended with exit code %d\\\\n\\\", connect_success);\\n\\n salty_client_connect_success_t* connect_success_copy = malloc(sizeof(connect_success));\\n\\n if (connect_success_copy == NULL) {\\n\\n printf(\\\" RESPONDER ERROR: Could not malloc %ld bytes\\\\n\\\", sizeof(connect_success));\\n\\n pthread_exit(NULL);\\n\\n }\\n\\n memcpy(connect_success_copy, &connect_success, sizeof(connect_success));\\n\\n\\n\\n printf(\\\" RESPONDER: Freeing client instance\\\\n\\\");\\n\\n salty_relayed_data_client_free(client_ret.client);\\n\\n\\n\\n printf(\\\" RESPONDER: Freeing channel instances\\\\n\\\");\\n\\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\\n\\n salty_channel_sender_tx_free(client_ret.sender_tx);\\n\\n salty_channel_event_rx_free(init_ret.event_rx);\\n\\n\\n\\n printf(\\\" RESPONDER: Freeing event loop\\\\n\\\");\\n\\n salty_event_loop_free(loop);\\n\\n\\n\\n printf(\\\" THREAD: Stopping responder thread\\\\n\\\");\\n\\n pthread_exit((void *)connect_success_copy);\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 29,\n \"score\": 67013.63749701824\n },\n {\n \"content\": \"static const salty_channel_disconnect_tx_t *responder_disconnect = NULL;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 30,\n \"score\": 67006.0404750313\n },\n {\n \"content\": \"static const salty_channel_receiver_rx_t *responder_receiver = NULL;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 31,\n \"score\": 67006.0404750313\n },\n {\n \"content\": \"static const salty_channel_sender_tx_t *responder_sender = NULL;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 32,\n \"score\": 67006.0404750313\n },\n {\n \"content\": \"static const salty_channel_event_rx_t *event_rx = NULL;\\n\",\n \"file_path\": \"ffi/tests/disconnect.c\",\n \"rank\": 33,\n \"score\": 66991.5307617441\n },\n {\n \"content\": \"void *connect_initiator(void *threadarg) {\\n\\n struct thread_data *data = (struct thread_data *) threadarg;\\n\\n printf(\\\" THREAD: Started initiator thread\\\\n\\\");\\n\\n\\n\\n printf(\\\" INITIATOR: Creating event loop\\\\n\\\");\\n\\n const salty_event_loop_t *loop = salty_event_loop_new();\\n\\n\\n\\n printf(\\\" INITIATOR: Getting event loop remote handle\\\\n\\\");\\n\\n const salty_remote_t *remote = salty_event_loop_get_remote(loop);\\n\\n const salty_remote_t *unused_remote = salty_event_loop_get_remote(loop);\\n\\n\\n\\n printf(\\\" INITIATOR: Creating client instance\\\\n\\\");\\n\\n salty_relayed_data_client_ret_t client_ret = salty_relayed_data_initiator_new(\\n\\n data->keypair,\\n\\n remote,\\n\\n data->interval_seconds,\\n\\n NULL,\\n\\n NULL\\n\\n );\\n\\n if (client_ret.success != OK) {\\n\\n printf(\\\" INITIATOR ERROR: Could not create client: %d\\\", client_ret.success);\\n\\n pthread_exit(NULL);\\n\\n }\\n\\n\\n\\n initiator_sender = client_ret.sender_tx;\\n\\n initiator_receiver = client_ret.receiver_rx;\\n\\n initiator_disconnect = client_ret.disconnect_tx;\\n\\n printf(\\\" INITIATOR: Notifying main thread that the channels are ready\\\\n\\\");\\n\\n sem_post(&initiator_channels_ready);\\n\\n\\n\\n printf(\\\" INITIATOR: Copying auth token to static variable\\\\n\\\");\\n\\n auth_token = malloc(32 * sizeof(uint8_t));\\n\\n if (auth_token == NULL) {\\n\\n printf(\\\" INITIATOR ERROR: Could not allocate memory for auth token\\\");\\n\\n pthread_exit(NULL);\\n\\n }\\n\\n const uint8_t *auth_token_ref = salty_relayed_data_client_auth_token(client_ret.client);\\n\\n memcpy(auth_token, auth_token_ref, 32 * sizeof(uint8_t));\\n\\n\\n\\n printf(\\\" INITIATOR: Notifying responder that the auth token is ready\\\\n\\\");\\n\\n sem_post(&auth_token_set);\\n\\n\\n\\n printf(\\\" INITIATOR: Initializing\\\\n\\\");\\n\\n salty_client_init_ret_t init_ret = salty_client_init(\\n\\n // Host, port\\n\\n \\\"localhost\\\",\\n\\n 8765,\\n\\n // Client\\n\\n client_ret.client,\\n\\n // Event loop\\n\\n loop,\\n\\n // Timeout seconds\\n\\n data->timeout_seconds,\\n\\n // CA certificate\\n\\n data->ca_cert,\\n\\n (uint32_t)data->ca_cert_len\\n\\n );\\n\\n if (init_ret.success != INIT_OK) {\\n\\n printf(\\\" INITIATOR ERROR: Could not initialize connection: %d\\\", init_ret.success);\\n\\n pthread_exit(NULL);\\n\\n }\\n\\n\\n\\n printf(\\\" INITIATOR: Connecting\\\\n\\\");\\n\\n salty_client_connect_success_t connect_success = salty_client_connect(\\n\\n // Handshake future\\n\\n init_ret.handshake_future,\\n\\n // Client\\n\\n client_ret.client,\\n\\n // Event loop\\n\\n loop,\\n\\n // Event channel, sending end\\n\\n init_ret.event_tx,\\n\\n // Sender channel, receiving end\\n\\n client_ret.sender_rx,\\n\\n // Disconnect channel, receiving end\\n\\n client_ret.disconnect_rx\\n\\n );\\n\\n\\n\\n drain_events(init_ret.event_rx, \\\"INITIATOR\\\");\\n\\n\\n\\n printf(\\\" INITIATOR: Connection ended with exit code %d\\\\n\\\", connect_success);\\n\\n salty_client_connect_success_t* connect_success_copy = malloc(sizeof(connect_success));\\n\\n if (connect_success_copy == NULL) {\\n\\n printf(\\\" INITIATOR ERROR: Could not malloc %ld bytes\\\\n\\\", sizeof(connect_success));\\n\\n pthread_exit(NULL);\\n\\n }\\n\\n memcpy(connect_success_copy, &connect_success, sizeof(connect_success));\\n\\n\\n\\n printf(\\\" INITIATOR: Freeing unused event loop remote handle\\\\n\\\");\\n\\n salty_event_loop_free_remote(unused_remote);\\n\\n\\n\\n printf(\\\" INITIATOR: Freeing client instance\\\\n\\\");\\n\\n salty_relayed_data_client_free(client_ret.client);\\n\\n\\n\\n printf(\\\" INITIATOR: Freeing channel instances\\\\n\\\");\\n\\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\\n\\n salty_channel_sender_tx_free(client_ret.sender_tx);\\n\\n salty_channel_event_rx_free(init_ret.event_rx);\\n\\n\\n\\n printf(\\\" INITIATOR: Freeing event loop\\\\n\\\");\\n\\n salty_event_loop_free(loop);\\n\\n\\n\\n printf(\\\" THREAD: Stopping initiator thread\\\\n\\\");\\n\\n pthread_exit((void *)connect_success_copy);\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 34,\n \"score\": 66955.31248760308\n },\n {\n \"content\": \"void *connect_initiator(void *threadarg) {\\n\\n if (threadarg == NULL) { /* get rid of unused variable warning */ }\\n\\n\\n\\n printf(\\\" Reading DER formatted test CA certificate\\\\n\\\");\\n\\n\\n\\n // Open file\\n\\n const char *const ca_cert_name = \\\"saltyrtc.der\\\";\\n\\n FILE *fd = fopen(ca_cert_name, \\\"rb\\\");\\n\\n if (fd == NULL) {\\n\\n printf(\\\" ERROR: Could not open `%s`\\\\n\\\", ca_cert_name);\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n\\n\\n // Get file size\\n\\n if (fseek(fd, 0, SEEK_END) != 0) {\\n\\n printf(\\\" ERROR: Could not fseek `%s`\\\\n\\\", ca_cert_name);\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n long ca_cert_len = ftell(fd);\\n\\n if (ca_cert_len < 0) {\\n\\n printf(\\\" ERROR: Could not ftell `%s`\\\\n\\\", ca_cert_name);\\n\\n pthread_exit((void *)1);\\n\\n } else if (ca_cert_len >= (1L << 32)) {\\n\\n printf(\\\" ERROR: ca_cert_len is larger than 2**32\\\\n\\\");\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n if (fseek(fd, 0, SEEK_SET) != 0) {\\n\\n printf(\\\" ERROR: Could not fseek `%s`\\\\n\\\", ca_cert_name);\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n\\n\\n // Prepare buffer\\n\\n uint8_t *ca_cert = malloc((size_t)ca_cert_len);\\n\\n if (ca_cert == NULL) {\\n\\n printf(\\\" ERROR: Could not malloc %ld bytes\\\\n\\\", ca_cert_len);\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n size_t read_bytes = fread(ca_cert, (size_t)ca_cert_len, 1, fd);\\n\\n if (read_bytes != 1) {\\n\\n printf(\\\" ERROR: Could not read file\\\\n\\\");\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n if (fclose(fd) != 0) { printf(\\\"Warning: Closing ca cert file descriptor failed\\\"); }\\n\\n\\n\\n printf(\\\" Initializing console logger (level WARN)\\\\n\\\");\\n\\n if (!salty_log_init_console(LEVEL_WARN)) {\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n\\n\\n printf(\\\" Creating key pair\\\\n\\\");\\n\\n const salty_keypair_t *keypair = salty_keypair_new();\\n\\n\\n\\n printf(\\\" Creating event loop\\\\n\\\");\\n\\n const salty_event_loop_t *loop = salty_event_loop_new();\\n\\n\\n\\n printf(\\\" Getting event loop remote handle\\\\n\\\");\\n\\n const salty_remote_t *remote = salty_event_loop_get_remote(loop);\\n\\n\\n\\n printf(\\\" Creating client instance\\\\n\\\");\\n\\n salty_relayed_data_client_ret_t client_ret = salty_relayed_data_initiator_new(\\n\\n keypair,\\n\\n remote,\\n\\n 0, // interval seconds\\n\\n NULL,\\n\\n NULL\\n\\n );\\n\\n if (client_ret.success != OK) {\\n\\n printf(\\\" ERROR: Could not create client: %d\\\", client_ret.success);\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n\\n\\n printf(\\\" Initializing\\\\n\\\");\\n\\n salty_client_init_ret_t init_ret = salty_client_init(\\n\\n // Host, port\\n\\n \\\"localhost\\\",\\n\\n 8765,\\n\\n // Client\\n\\n client_ret.client,\\n\\n // Event loop\\n\\n loop,\\n\\n // Timeout seconds\\n\\n 5,\\n\\n // CA certificate\\n\\n ca_cert,\\n\\n (uint32_t)ca_cert_len\\n\\n );\\n\\n if (init_ret.success != INIT_OK) {\\n\\n printf(\\\" ERROR: Could not initialize connection: %d\\\", init_ret.success);\\n\\n pthread_exit((void *)1);\\n\\n }\\n\\n\\n\\n // Assign event_rx to static\\n\\n event_rx = init_ret.event_rx;\\n\\n disconnect_tx = client_ret.disconnect_tx;\\n\\n sem_post(&initialized);\\n\\n\\n\\n printf(\\\" Connecting...\\\\n\\\");\\n\\n salty_client_connect_success_t connect_success = salty_client_connect(\\n\\n // Handshake future\\n\\n init_ret.handshake_future,\\n\\n // Client\\n\\n client_ret.client,\\n\\n // Event loop\\n\\n loop,\\n\\n // Event channel, sending end\\n\\n init_ret.event_tx,\\n\\n // Sender channel, receiving end\\n\\n client_ret.sender_rx,\\n\\n // Disconnect channel, receiving end\\n\\n client_ret.disconnect_rx\\n\\n );\\n\\n\\n\\n printf(\\\" Connection ended with exit code %d\\\\n\\\", connect_success);\\n\\n\\n\\n printf(\\\" Freeing client instance\\\\n\\\");\\n\\n salty_relayed_data_client_free(client_ret.client);\\n\\n\\n\\n printf(\\\" Freeing channel instances\\\\n\\\");\\n\\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\\n\\n salty_channel_sender_tx_free(client_ret.sender_tx);\\n\\n salty_channel_event_rx_free(init_ret.event_rx);\\n\\n\\n\\n printf(\\\" Freeing event loop\\\\n\\\");\\n\\n salty_event_loop_free(loop);\\n\\n\\n\\n printf(\\\" Freeing CA cert bytes\\\\n\\\");\\n\\n free(ca_cert);\\n\\n\\n\\n pthread_exit((void *)0);\\n\",\n \"file_path\": \"ffi/tests/disconnect.c\",\n \"rank\": 35,\n \"score\": 66955.31248760308\n },\n {\n \"content\": \"static const salty_channel_receiver_rx_t *initiator_receiver = NULL;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 36,\n \"score\": 66947.77691112067\n },\n {\n \"content\": \"static const salty_channel_disconnect_tx_t *initiator_disconnect = NULL;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 37,\n \"score\": 66947.77691112067\n },\n {\n \"content\": \"static const salty_channel_sender_tx_t *initiator_sender = NULL;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 38,\n \"score\": 66947.77691112067\n },\n {\n \"content\": \"bool salty_log_init_console(uint8_t level);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 39,\n \"score\": 65981.12666574852\n },\n {\n \"content\": \"const uint8_t *salty_keypair_private_key(const salty_keypair_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 40,\n \"score\": 65980.78619451911\n },\n {\n \"content\": \"const uint8_t *salty_keypair_public_key(const salty_keypair_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 41,\n \"score\": 65980.78619451911\n },\n {\n \"content\": \"bool salty_log_init_callback(LogFunction callback,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 42,\n \"score\": 65980.49520487343\n },\n {\n \"content\": \"salty_client_recv_event_ret_t salty_client_recv_event(const salty_channel_event_rx_t *event_rx,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 43,\n \"score\": 65518.43092213048\n },\n {\n \"content\": \"salty_client_recv_msg_ret_t salty_client_recv_msg(const salty_channel_receiver_rx_t *receiver_rx,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 44,\n \"score\": 65518.35593067606\n },\n {\n \"content\": \"static sem_t responder_channels_ready;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 45,\n \"score\": 64675.57355510744\n },\n {\n \"content\": \"static sem_t initiator_channels_ready;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 46,\n \"score\": 64619.33639519514\n },\n {\n \"content\": \"const salty_remote_t *salty_event_loop_get_remote(const salty_event_loop_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 47,\n \"score\": 64285.49141668977\n },\n {\n \"content\": \"void salty_event_loop_free_remote(const salty_remote_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 48,\n \"score\": 64273.78710059435\n },\n {\n \"content\": \"bool salty_log_change_level_console(uint8_t level);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 49,\n \"score\": 64225.91004071958\n },\n {\n \"content\": \"void salty_channel_disconnect_tx_free(const salty_channel_disconnect_tx_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 50,\n \"score\": 64216.91631927949\n },\n {\n \"content\": \"void salty_channel_event_tx_free(const salty_channel_event_tx_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 51,\n \"score\": 64216.91631927949\n },\n {\n \"content\": \"void salty_channel_sender_tx_free(const salty_channel_sender_tx_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 52,\n \"score\": 64216.91631927949\n },\n {\n \"content\": \"salty_relayed_data_client_ret_t salty_relayed_data_responder_new(const salty_keypair_t *keypair,\\n\\n const salty_remote_t *remote,\\n\\n uint32_t ping_interval_seconds,\\n\\n const uint8_t *initiator_pubkey,\\n\\n const uint8_t *auth_token,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 53,\n \"score\": 64216.62858990432\n },\n {\n \"content\": \"void salty_channel_event_rx_free(const salty_channel_event_rx_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 54,\n \"score\": 64193.09207768845\n },\n {\n \"content\": \"void salty_channel_disconnect_rx_free(const salty_channel_disconnect_rx_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 55,\n \"score\": 64193.09207768845\n },\n {\n \"content\": \"void salty_channel_receiver_rx_free(const salty_channel_receiver_rx_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 56,\n \"score\": 64193.09207768845\n },\n {\n \"content\": \"void salty_channel_sender_rx_free(const salty_channel_sender_rx_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 57,\n \"score\": 64193.09207768845\n },\n {\n \"content\": \"salty_relayed_data_client_ret_t salty_relayed_data_initiator_new(const salty_keypair_t *keypair,\\n\\n const salty_remote_t *remote,\\n\\n uint32_t ping_interval_seconds,\\n\\n const uint8_t *trusted_responder_key,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 58,\n \"score\": 64167.8423515639\n },\n {\n \"content\": \"void salty_relayed_data_client_free(const salty_client_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 59,\n \"score\": 63779.02258664978\n },\n {\n \"content\": \"salty_client_encrypt_decrypt_ret_t salty_client_decrypt_with_session_keys(const salty_client_t *client,\\n\\n const uint8_t *data,\\n\\n size_t data_len,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 60,\n \"score\": 63778.80477014282\n },\n {\n \"content\": \"salty_client_encrypt_decrypt_ret_t salty_client_encrypt_with_session_keys(const salty_client_t *client,\\n\\n const uint8_t *data,\\n\\n size_t data_len,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 61,\n \"score\": 63778.80477014282\n },\n {\n \"content\": \"void salty_client_encrypt_decrypt_free(const uint8_t *data,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 62,\n \"score\": 63775.3474073709\n },\n {\n \"content\": \"salty_client_send_success_t salty_client_send_application_bytes(const salty_channel_sender_tx_t *sender_tx,\\n\\n const uint8_t *msg,\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 63,\n \"score\": 63774.78667023897\n },\n {\n \"content\": \"fn c_tests_run(bin: &str, logger: Option<&str>) {\\n\\n let (_guard, build_dir) = build_tests();\\n\\n\\n\\n // Event loop\\n\\n let mut core = Core::new().unwrap();\\n\\n\\n\\n // Timer\\n\\n let timer = Timer::default();\\n\\n\\n\\n // Create a command future\\n\\n let mut cmd = Command::new(bin);\\n\\n if let Some(l) = logger {\\n\\n cmd.arg(\\\"-l\\\").arg(l);\\n\\n }\\n\\n let c_tests = cmd\\n\\n .current_dir(&build_dir)\\n\\n .output_async(&core.handle());\\n\\n\\n\\n // Run command with timeout\\n\\n let timeout_seconds = 3;\\n\",\n \"file_path\": \"ffi/tests/integration.rs\",\n \"rank\": 64,\n \"score\": 63471.24426431905\n },\n {\n \"content\": \"const uint8_t *salty_relayed_data_client_auth_token(const salty_client_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 65,\n \"score\": 62129.24029792171\n },\n {\n \"content\": \"void salty_client_recv_msg_ret_free(salty_client_recv_msg_ret_t recv_ret);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 66,\n \"score\": 62128.53621471766\n },\n {\n \"content\": \"void salty_client_recv_event_ret_free(salty_client_recv_event_ret_t recv_ret);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 67,\n \"score\": 62128.53621471766\n },\n {\n \"content\": \"fn assert_output_success(output: Output) {\\n\\n if !output.status.success() {\\n\\n let stdout = String::from_utf8_lossy(&output.stdout);\\n\\n let stderr = String::from_utf8_lossy(&output.stderr);\\n\\n println!(\\\"Stdout:\\\\n{}\\\\nStderr:\\\\n{}\\\\n\\\", stdout, stderr);\\n\\n panic!(\\\"Running C tests failed with non-zero return code\\\");\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/tests/integration.rs\",\n \"rank\": 68,\n \"score\": 61812.863528911024\n },\n {\n \"content\": \"fn level_to_u8(level: Level) -> u8 {\\n\\n match level {\\n\\n Level::Trace => LEVEL_TRACE,\\n\\n Level::Debug => LEVEL_DEBUG,\\n\\n Level::Info => LEVEL_INFO,\\n\\n Level::Warn => LEVEL_WARN,\\n\\n Level::Error => LEVEL_ERROR,\\n\\n }\\n\\n}\\n\\n\\n\\npub type LogFunction = unsafe extern \\\"C\\\" fn(level: u8, target: *const c_char, message: *const c_char);\\n\\n\\n\",\n \"file_path\": \"ffi/src/saltyrtc_client_ffi.rs\",\n \"rank\": 69,\n \"score\": 56577.1834433491\n },\n {\n \"content\": \"pub fn new<'a, T>(inner: &'a mut T) -> NonBlocking<'a, T> {\\n\\n NonBlocking { inner }\\n\\n}\\n\\n\\n\\nimpl<'a, T> Future for NonBlocking<'a, T> where T: Future {\\n\\n type Item = Option<T::Item>;\\n\\n type Error = T::Error;\\n\\n\\n\\n fn poll(&mut self) -> Poll<Self::Item, Self::Error> {\\n\\n match self.inner.poll()? {\\n\\n Async::Ready(v) => Ok(Async::Ready(Some(v))),\\n\\n Async::NotReady => Ok(Async::Ready(None)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use std::time::Duration;\\n\\n\\n\",\n \"file_path\": \"ffi/src/nonblocking.rs\",\n \"rank\": 70,\n \"score\": 53628.086782400984\n },\n {\n \"content\": \"enum LogConfig {\\n\\n Console(LevelFilter),\\n\\n Callback(LogFunction, LevelFilter),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/src/saltyrtc_client_ffi.rs\",\n \"rank\": 71,\n \"score\": 53402.8784737876\n },\n {\n \"content\": \"fn u8_to_levelfilter(level: u8) -> Option<LevelFilter> {\\n\\n Some(match level {\\n\\n LEVEL_TRACE => LevelFilter::Trace,\\n\\n LEVEL_DEBUG => LevelFilter::Debug,\\n\\n LEVEL_INFO => LevelFilter::Info,\\n\\n LEVEL_WARN => LevelFilter::Warn,\\n\\n LEVEL_ERROR => LevelFilter::Error,\\n\\n LEVEL_OFF => LevelFilter::Off,\\n\\n _ => return None\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ffi/src/saltyrtc_client_ffi.rs\",\n \"rank\": 72,\n \"score\": 52043.31916016601\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n // Set up CLI arguments\\n\\n let arg_srv_host = Arg::with_name(ARG_SRV_HOST)\\n\\n .short(\\\"h\\\")\\n\\n .takes_value(true)\\n\\n .value_name(\\\"SRV_HOST\\\")\\n\\n .required(true)\\n\\n .default_value(\\\"server.saltyrtc.org\\\")\\n\\n .help(\\\"The SaltyRTC server hostname\\\");\\n\\n let arg_srv_port = Arg::with_name(ARG_SRV_PORT)\\n\\n .short(\\\"p\\\")\\n\\n .takes_value(true)\\n\\n .value_name(\\\"SRV_PORT\\\")\\n\\n .required(true)\\n\\n .default_value(\\\"443\\\")\\n\\n .help(\\\"The SaltyRTC server port\\\");\\n\\n let arg_srv_pubkey = Arg::with_name(ARG_SRV_PUBKEY)\\n\\n .short(\\\"s\\\")\\n\\n .takes_value(true)\\n\",\n \"file_path\": \"examples/testclient.rs\",\n \"rank\": 73,\n \"score\": 49625.37379428631\n },\n {\n \"content\": \" const salty_channel_event_tx_t *event_tx;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 74,\n \"score\": 49312.96797912666\n },\n {\n \"content\": \" const salty_channel_disconnect_tx_t *disconnect_tx;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 75,\n \"score\": 49312.96797912666\n },\n {\n \"content\": \" const salty_channel_sender_tx_t *sender_tx;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 76,\n \"score\": 49312.96797912666\n },\n {\n \"content\": \" const salty_channel_sender_rx_t *sender_rx;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 77,\n \"score\": 49286.804440305685\n },\n {\n \"content\": \" const salty_channel_disconnect_rx_t *disconnect_rx;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 78,\n \"score\": 49286.804440305685\n },\n {\n \"content\": \" const salty_channel_receiver_rx_t *receiver_rx;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 79,\n \"score\": 49286.804440305685\n },\n {\n \"content\": \" const salty_channel_event_rx_t *event_rx;\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 80,\n \"score\": 49286.804440305685\n },\n {\n \"content\": \"const salty_event_loop_t *salty_event_loop_new(void);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 81,\n \"score\": 46386.17514410299\n },\n {\n \"content\": \"void salty_event_loop_free(const salty_event_loop_t *ptr);\\n\",\n \"file_path\": \"ffi/saltyrtc_task_relayed_data_ffi.h\",\n \"rank\": 82,\n \"score\": 46376.35781714266\n },\n {\n \"content\": \"int main() {\\n\\n printf(\\\"START C TEST\\\\n\\\");\\n\\n\\n\\n printf(\\\" START THREAD\\\\n\\\");\\n\\n pthread_t thread;\\n\\n pthread_create(&thread, NULL, connect_initiator, NULL);\\n\\n\\n\\n printf(\\\" WAITING FOR INIT\\\\n\\\");\\n\\n sem_wait(&initialized);\\n\\n\\n\\n printf(\\\" WAITING FOR SERVER HANDSHAKE COMPLETION\\\\n\\\");\\n\\n bool success = wait_for_server_handshake_completion(5000);\\n\\n if (!success) {\\n\\n printf(\\\" Waiting for server handshake completion failed!\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n printf(\\\" SERVER HANDSHAKE DONE\\\\n\\\");\\n\\n printf(\\\" DISCONNECT\\\\n\\\");\\n\\n salty_client_disconnect_success_t disconnect_success = salty_client_disconnect(disconnect_tx, 1001);\\n\\n if (disconnect_success != DISCONNECT_OK) {\\n\\n printf(\\\" Disconnect failed with code %d\\\\n\\\", disconnect_success);\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n printf(\\\" JOIN THREAD\\\\n\\\");\\n\\n int *result;\\n\\n pthread_join(thread, (void*)&result);\\n\\n if (result != 0) {\\n\\n printf(\\\" Thread failed\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n printf(\\\"END C TEST\\\\n\\\");\\n\\n\\n\\n // Close stdout / stderr to please valgrind\\n\\n if (fclose(stdin) != 0) { printf(\\\"Warning: Closing stdin failed\\\"); }\\n\\n if (fclose(stdout) != 0) { printf(\\\"Warning: Closing stdout failed\\\"); }\\n\\n if (fclose(stderr) != 0) { printf(\\\"Warning: Closing stderr failed\\\"); }\\n\\n\\n\\n return EXIT_SUCCESS;\\n\",\n \"file_path\": \"ffi/tests/disconnect.c\",\n \"rank\": 83,\n \"score\": 45547.83262529388\n },\n {\n \"content\": \"int main(int argc, char *argv[]) {\\n\\n // Parse arguments\\n\\n int opt;\\n\\n enum { LOGGER_CONSOLE, LOGGER_CALLBACK } logger = LOGGER_CONSOLE;\\n\\n while ((opt = getopt(argc, argv, \\\"l:\\\")) != -1) {\\n\\n switch (opt) {\\n\\n case 'l':\\n\\n if (strcmp(optarg, \\\"console\\\") == 0) {\\n\\n logger = LOGGER_CONSOLE;\\n\\n break;\\n\\n }\\n\\n if (strcmp(optarg, \\\"callback\\\") == 0) {\\n\\n logger = LOGGER_CALLBACK;\\n\\n break;\\n\\n }\\n\\n fprintf(stderr, \\\"Invalid logger mode: %s\\\\n\\\", optarg);\\n\\n return EXIT_FAILURE;\\n\\n default:\\n\\n fprintf(stderr, \\\"Usage: %s [-l LOGGER_MODE]\\\\n\\\\n\\\", argv[0]);\\n\\n fprintf(stderr, \\\"Note: The logger mode may be either 'console' or 'callback'.\\\\n\\\");\\n\\n fprintf(stderr, \\\" The default value is 'console'.\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n }\\n\\n printf(\\\"Logger: %d\\\\n\\\", logger);\\n\\n\\n\\n printf(\\\"START C TEST\\\\n\\\");\\n\\n\\n\\n printf(\\\" Reading DER formatted test CA certificate\\\\n\\\");\\n\\n\\n\\n // Open file\\n\\n const char *const ca_cert_name = \\\"saltyrtc.der\\\";\\n\\n FILE *fd = fopen(ca_cert_name, \\\"rb\\\");\\n\\n if (fd == NULL) {\\n\\n printf(\\\" ERROR: Could not open `%s`\\\\n\\\", ca_cert_name);\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n // Get file size\\n\\n if (fseek(fd, 0, SEEK_END) != 0) {\\n\\n printf(\\\" ERROR: Could not fseek `%s`\\\\n\\\", ca_cert_name);\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n long ca_cert_len = ftell(fd);\\n\\n if (ca_cert_len < 0) {\\n\\n printf(\\\" ERROR: Could not ftell `%s`\\\\n\\\", ca_cert_name);\\n\\n return EXIT_FAILURE;\\n\\n } else if (ca_cert_len >= (1L << 32)) {\\n\\n printf(\\\" ERROR: ca_cert_len is larger than 2**32\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n if (fseek(fd, 0, SEEK_SET) != 0) {\\n\\n printf(\\\" ERROR: Could not fseek `%s`\\\\n\\\", ca_cert_name);\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n // Prepare buffer\\n\\n uint8_t *ca_cert = malloc((size_t)ca_cert_len);\\n\\n if (ca_cert == NULL) {\\n\\n printf(\\\" ERROR: Could not malloc %ld bytes\\\\n\\\", ca_cert_len);\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n size_t read_bytes = fread(ca_cert, (size_t)ca_cert_len, 1, fd);\\n\\n if (read_bytes != 1) {\\n\\n printf(\\\" ERROR: Could not read file\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n if (fclose(fd) != 0) printf(\\\"Warning: Closing ca cert file descriptor failed\\\");\\n\\n\\n\\n if (logger == LOGGER_CONSOLE) {\\n\\n printf(\\\" Initializing console logger (level DEBUG)\\\\n\\\");\\n\\n if (!salty_log_init_console(LEVEL_DEBUG)) {\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n printf(\\\" Updating logger (level WARN)\\\\n\\\");\\n\\n if (!salty_log_change_level_console(LEVEL_WARN)) {\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n } else if (logger == LOGGER_CALLBACK) {\\n\\n printf(\\\" Initializing callback logger (level DEBUG)\\\\n\\\");\\n\\n if (!salty_log_init_callback(log_callback, LEVEL_DEBUG)) {\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n }\\n\\n\\n\\n printf(\\\" Creating key pairs\\\\n\\\");\\n\\n const salty_keypair_t *i_keypair = salty_keypair_new();\\n\\n const salty_keypair_t *r_keypair = salty_keypair_new();\\n\\n const salty_keypair_t *unused_keypair = salty_keypair_new();\\n\\n\\n\\n printf(\\\" Restoring keypair from existing key\\\\n\\\");\\n\\n uint8_t *private_key_ptr = malloc(32);\\n\\n if (private_key_ptr == NULL) {\\n\\n printf(\\\" ERROR: Could not malloc 32 bytes\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n memset(private_key_ptr, 42, 32);\\n\\n const salty_keypair_t *restored_keypair = salty_keypair_restore(private_key_ptr);\\n\\n\\n\\n printf(\\\" Extracting private key of existing keypair\\\\n\\\");\\n\\n const uint8_t *extracted_private_key = salty_keypair_private_key(restored_keypair);\\n\\n if (memcmp(private_key_ptr, extracted_private_key, 32) != 0) {\\n\\n printf(\\\" ERROR: Extracted private key does not match original private key\\\\n\\\");\\n\\n free(private_key_ptr);\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n free(private_key_ptr);\\n\\n\\n\\n printf(\\\" Copying public key from initiator\\\\n\\\");\\n\\n uint8_t *i_pubkey = malloc(32 * sizeof(uint8_t));\\n\\n if (i_pubkey == NULL) {\\n\\n printf(\\\" ERROR: Could not allocate memory for public key\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n const uint8_t *i_pubkey_ref = salty_keypair_public_key(i_keypair);\\n\\n memcpy(i_pubkey, i_pubkey_ref, 32 * sizeof(uint8_t));\\n\\n\\n\\n printf(\\\" Initiating semaphores\\\\n\\\");\\n\\n sem_init(&auth_token_set, 0, 0);\\n\\n sem_init(&initiator_channels_ready, 0, 0);\\n\\n sem_init(&responder_channels_ready, 0, 0);\\n\\n\\n\\n // Start initiator thread\\n\\n pthread_t i_thread;\\n\\n struct thread_data i_data = {\\n\\n .interval_seconds = 0,\\n\\n .timeout_seconds = 5,\\n\\n .keypair = i_keypair,\\n\\n .initiator_pubkey = NULL,\\n\\n .ca_cert = ca_cert,\\n\\n .ca_cert_len = ca_cert_len\\n\\n };\\n\\n pthread_create(&i_thread, NULL, connect_initiator, (void*)&i_data);\\n\\n\\n\\n // Start responder thread\\n\\n pthread_t r_thread;\\n\\n struct thread_data r_data = {\\n\\n .interval_seconds = 0,\\n\\n .timeout_seconds = 5,\\n\\n .keypair = r_keypair,\\n\\n .initiator_pubkey = i_pubkey,\\n\\n .ca_cert = ca_cert,\\n\\n .ca_cert_len = ca_cert_len\\n\\n };\\n\\n pthread_create(&r_thread, NULL, connect_responder, (void*)&r_data);\\n\\n\\n\\n // Waiting for connection event\\n\\n printf(\\\" Waiting for initiator tx channel...\\\\n\\\");\\n\\n sem_wait(&initiator_channels_ready);\\n\\n printf(\\\" Waiting for responder tx channel...\\\\n\\\");\\n\\n sem_wait(&responder_channels_ready);\\n\\n printf(\\\" Both outgoing channels are ready\\\\n\\\");\\n\\n\\n\\n // Send message\\n\\n printf(\\\" Sending message from initiator to responder\\\\n\\\");\\n\\n const uint8_t msg[] = { 0x93, 0x01, 0x02, 0x03 };\\n\\n if (SEND_OK != salty_client_send_task_bytes(initiator_sender, msg, 4)) {\\n\\n printf(\\\" ERROR: Sending message from initiator to responder failed\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n // Receive message\\n\\n printf(\\\" Waiting for message to arrive...\\\\n\\\");\\n\\n uint32_t timeout_ms = 10000;\\n\\n const salty_client_recv_msg_ret_t recv_msg_ret = salty_client_recv_msg(responder_receiver, &timeout_ms);\\n\\n switch (recv_msg_ret.success) {\\n\\n case RECV_OK:\\n\\n printf(\\\" OK: Message (%lu bytes) from initiator arrived!\\\\n\\\", recv_msg_ret.msg->msg_bytes_len);\\n\\n if (recv_msg_ret.msg->msg_bytes_len != 4 ||\\n\\n recv_msg_ret.msg->msg_bytes[0] != 0x93 ||\\n\\n recv_msg_ret.msg->msg_bytes[1] != 0x01 ||\\n\\n recv_msg_ret.msg->msg_bytes[2] != 0x02 ||\\n\\n recv_msg_ret.msg->msg_bytes[3] != 0x03) {\\n\\n printf(\\\" ERROR: Invalid message received\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n } else {\\n\\n printf(\\\" OK: Message is valid!\\\\n\\\");\\n\\n }\\n\\n break;\\n\\n case RECV_NO_DATA:\\n\\n printf(\\\" ERROR: Waiting for message timed out!\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n case RECV_STREAM_ENDED:\\n\\n printf(\\\" ERROR: The incoming event stream has ended!\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n default:\\n\\n printf(\\\" ERROR: Error while waiting for incoming message\\\\n\\\");\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n printf(\\\" Freeing received event\\\\n\\\");\\n\\n salty_client_recv_msg_ret_free(recv_msg_ret);\\n\\n\\n\\n // Disconnect\\n\\n printf(\\\" Disconnecting initiator\\\\n\\\");\\n\\n salty_client_disconnect(initiator_disconnect, 1001);\\n\\n printf(\\\" Disconnecting responder\\\\n\\\");\\n\\n salty_client_disconnect(responder_disconnect, 1001);\\n\\n\\n\\n // Joining client threads\\n\\n printf(\\\" Waiting for client threads to terminate...\\\\n\\\");\\n\\n salty_client_connect_success_t *i_success;\\n\\n salty_client_connect_success_t *r_success;\\n\\n pthread_join(i_thread, (void*)&i_success);\\n\\n pthread_join(r_thread, (void*)&r_success);\\n\\n\\n\\n bool success = true;\\n\\n if (*i_success != CONNECT_OK) {\\n\\n printf(\\\"ERROR: Connecting initiator was not successful\\\\n\\\");\\n\\n success = false;\\n\\n } else {\\n\\n printf(\\\"OK: Connection initiator was successful\\\\n\\\");\\n\\n }\\n\\n free(i_success);\\n\\n if (*r_success != CONNECT_OK) {\\n\\n printf(\\\"ERROR: Connecting responder was not successful\\\\n\\\");\\n\\n success = false;\\n\\n } else {\\n\\n printf(\\\"OK: Connection responder was successful\\\\n\\\");\\n\\n }\\n\\n free(r_success);\\n\\n if (!success) {\\n\\n return EXIT_FAILURE;\\n\\n }\\n\\n\\n\\n printf(\\\"CLEANUP\\\\n\\\");\\n\\n\\n\\n printf(\\\" Freeing CA cert bytes\\\\n\\\");\\n\\n free(ca_cert);\\n\\n\\n\\n printf(\\\" Freeing public key copy\\\\n\\\");\\n\\n free(i_pubkey);\\n\\n\\n\\n printf(\\\" Freeing unused keypairs\\\\n\\\");\\n\\n salty_keypair_free(unused_keypair);\\n\\n salty_keypair_free(restored_keypair);\\n\\n\\n\\n printf(\\\" Destroying semaphores\\\\n\\\");\\n\\n sem_destroy(&auth_token_set);\\n\\n sem_destroy(&initiator_channels_ready);\\n\\n sem_destroy(&responder_channels_ready);\\n\\n\\n\\n printf(\\\"END C TEST\\\\n\\\");\\n\\n\\n\\n // Close stdout / stderr to please valgrind\\n\\n if (fclose(stdin) != 0) printf(\\\"Warning: Closing stdin failed\\\");\\n\\n if (fclose(stdout) != 0) printf(\\\"Warning: Closing stdout failed\\\");\\n\\n if (fclose(stderr) != 0) printf(\\\"Warning: Closing stderr failed\\\");\\n\\n\\n\\n return EXIT_SUCCESS;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 84,\n \"score\": 45547.83262529388\n },\n {\n \"content\": \"struct thread_data {\\n\\n uint32_t interval_seconds;\\n\\n uint16_t timeout_seconds;\\n\\n const salty_keypair_t *keypair;\\n\\n const uint8_t *initiator_pubkey;\\n\\n const uint8_t *ca_cert;\\n\\n long ca_cert_len;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 85,\n \"score\": 43913.60530962124\n },\n {\n \"content\": \"void drain_events(const salty_channel_event_rx_t *event_rx, char *role);\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 86,\n \"score\": 43906.59913678013\n },\n {\n \"content\": \" uint32_t interval_seconds;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 87,\n \"score\": 43906.59913678013\n },\n {\n \"content\": \"static sem_t auth_token_set;\\n\",\n \"file_path\": \"ffi/tests/integration.c\",\n \"rank\": 88,\n \"score\": 42379.52969454451\n },\n {\n \"content\": \"bool wait_for_server_handshake_completion(uint32_t timeout_ms);\\n\",\n \"file_path\": \"ffi/tests/disconnect.c\",\n \"rank\": 89,\n \"score\": 40955.11280731241\n },\n {\n \"content\": \"/// Print the QR code payload to the terminal\\n\\nfn print_qrcode(payload: &[u8]) {\\n\\n let base64 = BASE64.encode(&payload);\\n\\n let qr = QrCode::encode_text(&base64, QrCodeEcc::Low).unwrap();\\n\\n let border = 1;\\n\\n for y in -border .. qr.size() + border {\\n\\n for x in -border .. qr.size() + border {\\n\\n let c: char = if qr.get_module(x, y) { '█' } else { ' ' };\\n\\n print!(\\\"{0}{0}\\\", c);\\n\\n }\\n\\n println!();\\n\\n }\\n\\n println!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/testclient.rs\",\n \"rank\": 90,\n \"score\": 39041.966618046165\n },\n {\n \"content\": \"extern crate cbindgen;\\n\\n\\n\\nuse std::env;\\n\\n\\n\",\n \"file_path\": \"ffi/build.rs\",\n \"rank\": 91,\n \"score\": 34304.71690351369\n },\n {\n \"content\": \"\\n\\n // Set up client instance\\n\\n let client = Arc::new(RwLock::new({\\n\\n let builder = SaltyClient::build(keypair)\\n\\n .add_task(Box::new(task))\\n\\n .with_ping_interval(Some(ping_interval));\\n\\n match role {\\n\\n Role::Initiator => builder\\n\\n .initiator()\\n\\n .expect(\\\"Could not create SaltyClient instance\\\"),\\n\\n Role::Responder => {\\n\\n let auth_token_hex = args.value_of(ARG_AUTHTOKEN).expect(\\\"Auth token not supplied\\\").to_string();\\n\\n let auth_token = AuthToken::from_hex_str(&auth_token_hex).expect(\\\"Invalid auth token hex string\\\");\\n\\n let initiator_pubkey = public_key_from_hex_str(&path).unwrap();\\n\\n builder\\n\\n .responder(initiator_pubkey, auth_token)\\n\\n .expect(\\\"Could not create SaltyClient instance\\\")\\n\\n }\\n\\n }\\n\\n }));\\n\",\n \"file_path\": \"examples/testclient.rs\",\n \"rank\": 95,\n \"score\": 32.19749947519772\n },\n {\n \"content\": \" Box::from_raw(rx_ptr as *mut salty_channel_receiver_rx_t);\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_free_channels() {\\n\\n let keypair = salty_keypair_new();\\n\\n let event_loop = salty_event_loop_new();\\n\\n let remote = unsafe { salty_event_loop_get_remote(event_loop) };\\n\\n let client_ret = unsafe { salty_relayed_data_initiator_new(keypair, remote, 0, ptr::null(), ptr::null()) };\\n\\n unsafe {\\n\\n salty_channel_receiver_rx_free(client_ret.receiver_rx);\\n\\n salty_channel_sender_tx_free(client_ret.sender_tx);\\n\\n salty_channel_sender_rx_free(client_ret.sender_rx);\\n\\n }\\n\\n }\\n\\n\\n\\n /// Using zero bytes as trusted key should fail.\\n\\n #[test]\\n\\n fn test_initiator_trusted_key_validation() {\\n\",\n \"file_path\": \"ffi/src/lib.rs\",\n \"rank\": 96,\n \"score\": 31.667142297369175\n },\n {\n \"content\": \" // Set up logging\\n\\n env::set_var(\\\"RUST_LOG\\\", \\\"saltyrtc_client=debug,saltyrtc_task_relayed_data=debug,testclient=trace\\\");\\n\\n env_logger::init();\\n\\n\\n\\n // Tokio reactor core\\n\\n let mut core = Core::new().unwrap();\\n\\n\\n\\n // Create TLS connector instance\\n\\n let tls_connector = TlsConnector::builder()\\n\\n .min_protocol_version(Some(Protocol::Tlsv11))\\n\\n .build()\\n\\n .unwrap_or_else(|e| panic!(\\\"Could not initialize TlsConnector: {}\\\", e));\\n\\n\\n\\n // Create new public permanent keypair\\n\\n let keypair = KeyPair::new();\\n\\n let pubkey = keypair.public_key().clone();\\n\\n\\n\\n // Determine websocket path\\n\\n let path: String = match role {\\n\\n Role::Initiator => keypair.public_key_hex(),\\n\",\n \"file_path\": \"examples/testclient.rs\",\n \"rank\": 97,\n \"score\": 31.246124564887424\n },\n {\n \"content\": \"#[macro_use] extern crate failure;\\n\\n#[macro_use] extern crate log;\\n\\nextern crate saltyrtc_client;\\n\\nextern crate tokio_core;\\n\\n\\n\\nuse std::borrow::Cow;\\n\\nuse std::collections::HashMap;\\n\\nuse std::mem;\\n\\n\\n\\nuse saltyrtc_client::{CloseCode, BoxedFuture};\\n\\nuse saltyrtc_client::dep::futures::future;\\n\\nuse saltyrtc_client::dep::futures::{Stream, Sink, Future};\\n\\nuse saltyrtc_client::dep::futures::sync::mpsc::{self, UnboundedSender, UnboundedReceiver};\\n\\nuse saltyrtc_client::dep::futures::sync::oneshot::Sender as OneshotSender;\\n\\nuse saltyrtc_client::dep::rmpv::Value;\\n\\nuse saltyrtc_client::errors::Error;\\n\\nuse saltyrtc_client::tasks::{Task, TaskMessage};\\n\\nuse tokio_core::reactor::Remote;\\n\\n\\n\\nmod errors;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 98,\n \"score\": 29.49416208562604\n }\n]","isConversational":false}}},{"rowIdx":789,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/test/instruction_tests/instr_vdbpsadbw.rs"},"repo_name":{"kind":"string","value":"ftilde/rust-x86asm"},"commit":{"kind":"string","value":"f6584b8cfe8e75d978bf7b83a67c69444fd3f161"},"file_code":{"kind":"string","value":"use instruction_def::*;\nuse test::run_test;\nuse Operand::*;\nuse Reg::*;\nuse RegScale::*;\nuse RegType::*;\nuse {BroadcastMode, Instruction, MaskReg, MergeMode, Mnemonic, OperandSize, Reg, RoundingMode};\n\n#[test]\nfn vdbpsadbw_1() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM1)),\n operand2: Some(Direct(XMM7)),\n operand3: Some(Direct(XMM2)),\n operand4: Some(Literal8(93)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K6),\n broadcast: None,\n },\n &[98, 243, 69, 142, 66, 202, 93],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_2() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM0)),\n operand2: Some(Direct(XMM3)),\n operand3: Some(IndirectScaledDisplaced(\n EDI,\n Four,\n 1875484248,\n Some(OperandSize::Xmmword),\n None,\n )),\n operand4: Some(Literal8(97)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K4),\n broadcast: None,\n },\n &[98, 243, 101, 140, 66, 4, 189, 88, 158, 201, 111, 97],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_3() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM13)),\n operand2: Some(Direct(XMM21)),\n operand3: Some(Direct(XMM21)),\n operand4: Some(Literal8(109)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K4),\n broadcast: None,\n },\n &[98, 51, 85, 132, 66, 237, 109],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_4() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM22)),\n operand2: Some(Direct(XMM6)),\n operand3: Some(IndirectScaledDisplaced(\n RCX,\n Four,\n 341913354,\n Some(OperandSize::Xmmword),\n None,\n )),\n operand4: Some(Literal8(3)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K3),\n broadcast: None,\n },\n &[98, 227, 77, 139, 66, 52, 141, 10, 47, 97, 20, 3],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_5() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM7)),\n operand2: Some(Direct(YMM0)),\n operand3: Some(Direct(YMM0)),\n operand4: Some(Literal8(89)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K7),\n broadcast: None,\n },\n &[98, 243, 125, 175, 66, 248, 89],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_6() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM6)),\n operand2: Some(Direct(YMM0)),\n operand3: Some(IndirectScaledDisplaced(\n ESI,\n Four,\n 1441455171,\n Some(OperandSize::Ymmword),\n None,\n )),\n operand4: Some(Literal8(82)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K2),\n broadcast: None,\n },\n &[98, 243, 125, 170, 66, 52, 181, 67, 220, 234, 85, 82],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_7() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM13)),\n operand2: Some(Direct(YMM29)),\n operand3: Some(Direct(YMM22)),\n operand4: Some(Literal8(51)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K2),\n broadcast: None,\n },\n &[98, 51, 21, 162, 66, 238, 51],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_8() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM28)),\n operand2: Some(Direct(YMM11)),\n operand3: Some(IndirectScaledIndexed(\n RDX,\n RDX,\n Eight,\n Some(OperandSize::Ymmword),\n None,\n )),\n operand4: Some(Literal8(93)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K5),\n broadcast: None,\n },\n &[98, 99, 37, 173, 66, 36, 210, 93],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_9() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM1)),\n operand2: Some(Direct(ZMM1)),\n operand3: Some(Direct(ZMM4)),\n operand4: Some(Literal8(36)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K3),\n broadcast: None,\n },\n &[98, 243, 117, 203, 66, 204, 36],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_10() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM2)),\n operand2: Some(Direct(ZMM0)),\n operand3: Some(IndirectScaledIndexed(\n ESI,\n EAX,\n Eight,\n Some(OperandSize::Zmmword),\n None,\n )),\n operand4: Some(Literal8(73)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K7),\n broadcast: None,\n },\n &[98, 243, 125, 207, 66, 20, 198, 73],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_11() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM26)),\n operand2: Some(Direct(ZMM7)),\n operand3: Some(Direct(ZMM27)),\n operand4: Some(Literal8(123)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K3),\n broadcast: None,\n },\n &[98, 3, 69, 203, 66, 211, 123],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_12() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM12)),\n operand2: Some(Direct(ZMM25)),\n operand3: Some(IndirectScaledIndexedDisplaced(\n RDX,\n RBX,\n Eight,\n 938432062,\n Some(OperandSize::Zmmword),\n None,\n )),\n operand4: Some(Literal8(83)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K6),\n broadcast: None,\n },\n &[98, 115, 53, 198, 66, 164, 218, 62, 86, 239, 55, 83],\n OperandSize::Qword,\n )\n}\n"},"prefix":{"kind":"string","value":"use instruction_def::*;\nuse test::run_test;\nuse Operand::*;\nuse Reg::*;\nuse RegScale::*;\nuse RegType::*;\nuse {BroadcastMode, Instruction, MaskReg, MergeMode, Mnemonic, OperandSize, Reg, RoundingMode};\n\n#[test]\nfn vdbpsadbw_1() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM1)),\n operand2: Some(Direct(XMM7)),\n operand3: So"},"suffix":{"kind":"string","value":" mask: Some(MaskReg::K7),\n broadcast: None,\n },\n &[98, 243, 125, 207, 66, 20, 198, 73],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_11() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM26)),\n operand2: Some(Direct(ZMM7)),\n operand3: Some(Direct(ZMM27)),\n operand4: Some(Literal8(123)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K3),\n broadcast: None,\n },\n &[98, 3, 69, 203, 66, 211, 123],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_12() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM12)),\n operand2: Some(Direct(ZMM25)),\n operand3: Some(IndirectScaledIndexedDisplaced(\n RDX,\n RBX,\n Eight,\n 938432062,\n Some(OperandSize::Zmmword),\n None,\n )),\n operand4: Some(Literal8(83)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K6),\n broadcast: None,\n },\n &[98, 115, 53, 198, 66, 164, 218, 62, 86, 239, 55, 83],\n OperandSize::Qword,\n )\n}\n"},"middle":{"kind":"string","value":"me(Direct(XMM2)),\n operand4: Some(Literal8(93)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K6),\n broadcast: None,\n },\n &[98, 243, 69, 142, 66, 202, 93],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_2() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM0)),\n operand2: Some(Direct(XMM3)),\n operand3: Some(IndirectScaledDisplaced(\n EDI,\n Four,\n 1875484248,\n Some(OperandSize::Xmmword),\n None,\n )),\n operand4: Some(Literal8(97)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K4),\n broadcast: None,\n },\n &[98, 243, 101, 140, 66, 4, 189, 88, 158, 201, 111, 97],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_3() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM13)),\n operand2: Some(Direct(XMM21)),\n operand3: Some(Direct(XMM21)),\n operand4: Some(Literal8(109)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K4),\n broadcast: None,\n },\n &[98, 51, 85, 132, 66, 237, 109],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_4() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(XMM22)),\n operand2: Some(Direct(XMM6)),\n operand3: Some(IndirectScaledDisplaced(\n RCX,\n Four,\n 341913354,\n Some(OperandSize::Xmmword),\n None,\n )),\n operand4: Some(Literal8(3)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K3),\n broadcast: None,\n },\n &[98, 227, 77, 139, 66, 52, 141, 10, 47, 97, 20, 3],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_5() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM7)),\n operand2: Some(Direct(YMM0)),\n operand3: Some(Direct(YMM0)),\n operand4: Some(Literal8(89)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K7),\n broadcast: None,\n },\n &[98, 243, 125, 175, 66, 248, 89],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_6() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM6)),\n operand2: Some(Direct(YMM0)),\n operand3: Some(IndirectScaledDisplaced(\n ESI,\n Four,\n 1441455171,\n Some(OperandSize::Ymmword),\n None,\n )),\n operand4: Some(Literal8(82)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K2),\n broadcast: None,\n },\n &[98, 243, 125, 170, 66, 52, 181, 67, 220, 234, 85, 82],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_7() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM13)),\n operand2: Some(Direct(YMM29)),\n operand3: Some(Direct(YMM22)),\n operand4: Some(Literal8(51)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K2),\n broadcast: None,\n },\n &[98, 51, 21, 162, 66, 238, 51],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_8() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(YMM28)),\n operand2: Some(Direct(YMM11)),\n operand3: Some(IndirectScaledIndexed(\n RDX,\n RDX,\n Eight,\n Some(OperandSize::Ymmword),\n None,\n )),\n operand4: Some(Literal8(93)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K5),\n broadcast: None,\n },\n &[98, 99, 37, 173, 66, 36, 210, 93],\n OperandSize::Qword,\n )\n}\n\n#[test]\nfn vdbpsadbw_9() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM1)),\n operand2: Some(Direct(ZMM1)),\n operand3: Some(Direct(ZMM4)),\n operand4: Some(Literal8(36)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n mask: Some(MaskReg::K3),\n broadcast: None,\n },\n &[98, 243, 117, 203, 66, 204, 36],\n OperandSize::Dword,\n )\n}\n\n#[test]\nfn vdbpsadbw_10() {\n run_test(\n &Instruction {\n mnemonic: Mnemonic::VDBPSADBW,\n operand1: Some(Direct(ZMM2)),\n operand2: Some(Direct(ZMM0)),\n operand3: Some(IndirectScaledIndexed(\n ESI,\n EAX,\n Eight,\n Some(OperandSize::Zmmword),\n None,\n )),\n operand4: Some(Literal8(73)),\n lock: false,\n rounding_mode: None,\n merge_mode: Some(MergeMode::Zero),\n sae: false,\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"fn encode32_helper2(mnemonic: Mnemonic, operand1: Operand, operand2: Operand, expected: &Vec<u8>) {\n\n let instr = Instruction {\n\n mnemonic: mnemonic,\n\n operand1: Some(operand1),\n\n operand2: Some(operand2),\n\n operand3: None,\n\n operand4: None,\n\n ..Default::default()\n\n };\n\n encode32_helper(&instr, expected);\n\n}\n\n\n","file_path":"src/test/mod.rs","rank":0,"score":606330.1135968915},{"content":"fn encode16_helper2(mnemonic: Mnemonic, operand1: Operand, operand2: Operand, expected: &Vec<u8>) {\n\n let instr = Instruction {\n\n mnemonic: mnemonic,\n\n operand1: Some(operand1),\n\n operand2: Some(operand2),\n\n operand3: None,\n\n operand4: None,\n\n ..Default::default()\n\n };\n\n encode16_helper(&instr, expected);\n\n}\n\n\n","file_path":"src/test/mod.rs","rank":1,"score":606330.1135968915},{"content":"fn encode64_helper2(mnemonic: Mnemonic, operand1: Operand, operand2: Operand, expected: &Vec<u8>) {\n\n let instr = Instruction {\n\n mnemonic: mnemonic,\n\n operand1: Some(operand1),\n\n operand2: Some(operand2),\n\n operand3: None,\n\n operand4: None,\n\n ..Default::default()\n\n };\n\n encode64_helper(&instr, expected);\n\n}\n\n\n","file_path":"src/test/mod.rs","rank":2,"score":606330.1135968915},{"content":"fn random_reg_of_size(size: OperandSize) -> Reg {\n\n match size {\n\n OperandSize::Byte => random_reg_8(),\n\n OperandSize::Word => random_reg_16(),\n\n OperandSize::Dword => random_reg_32(),\n\n OperandSize::Qword => random_reg_64(),\n\n _ => panic!(\"Invalid general register size: {:?}.\", size)\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":3,"score":405074.69505944534},{"content":"fn random_reg_of_size_no_stack(size: OperandSize) -> Reg {\n\n match size {\n\n OperandSize::Byte => random_reg_8(),\n\n OperandSize::Word => random_reg_16_no_stack(),\n\n OperandSize::Dword => random_reg_32_no_stack(),\n\n OperandSize::Qword => random_reg_64_no_stack(),\n\n _ => panic!(\"Invalid general register size: {:?}.\", size)\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":4,"score":400092.43049772026},{"content":"#[allow(dead_code)]\n\nfn encode32_helper1(mnemonic: Mnemonic, op1: Operand, expected: &Vec<u8>) {\n\n let instr = Instruction {\n\n mnemonic: mnemonic,\n\n operand1: Some(op1),\n\n operand2: None,\n\n operand3: None,\n\n operand4: None,\n\n ..Default::default()\n\n };\n\n encode32_helper(&instr, expected);\n\n}\n","file_path":"src/test/mod.rs","rank":5,"score":383637.69327454804},{"content":"#[test]\n\nfn operand_type_mask_reg() {\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0xED, 0x28, 0xC2, 0xDB, 0x05],\n\n Mode::Long,\n\n &Instruction::new4(\n\n Mnemonic::VCMPPD,\n\n Operand::Direct(Reg::K3),\n\n Operand::Direct(Reg::YMM2),\n\n Operand::Direct(Reg::YMM3),\n\n Operand::Literal8(5),\n\n ),\n\n ); // VCMPPD K3, YMM2, YMM3, 5\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":6,"score":379026.03268035897},{"content":"fn random_imm(size: OperandSize) -> Operand {\n\n let mut gen = rand::thread_rng();\n\n match size {\n\n OperandSize::Byte => Operand::Literal8(gen.gen_range::<u8>(0, 128)),\n\n OperandSize::Word => Operand::Literal16(\n\n gen.gen_range::<u16>(u8::max_value() as u16 + 1, i16::max_value() as u16)),\n\n OperandSize::Dword => Operand::Literal32(\n\n gen.gen_range::<u32>(u16::max_value() as u32 + 1, i32::max_value() as u32)),\n\n OperandSize::Qword => Operand::Literal64(\n\n gen.gen_range::<u64>(u32::max_value() as u64 + 1, i64::max_value() as u64)),\n\n OperandSize::Far16 => Operand::MemoryAndSegment16(rand::random(), rand::random()),\n\n OperandSize::Far32 => Operand::MemoryAndSegment32(rand::random(), rand::random()),\n\n _ => panic!(\"Invalid immediate value size: {:?}.\", size)\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":7,"score":364239.84979508806},{"content":"fn random_reg(reg_type: RegType, size: OperandSize, addr_size: OperandSize, \n\n def: &InstructionDefinition) -> Reg {\n\n match reg_type {\n\n RegType::General => {\n\n match size {\n\n OperandSize::Byte => random_reg_8(),\n\n OperandSize::Word => random_reg_16(),\n\n OperandSize::Dword => random_reg_32(),\n\n OperandSize::Qword => random_reg_64(),\n\n OperandSize::Unsized => random_reg_of_size(addr_size),\n\n _ => panic!(\"Invalid general register size: {:?}.\", size)\n\n }\n\n },\n\n RegType::Avx => {\n\n let allow_all = if let Some(CompositePrefix::Evex {..}) = def.composite_prefix {\n\n addr_size == OperandSize::Qword } else { false };\n\n match size {\n\n OperandSize::Xmmword => random_xmm_reg(allow_all),\n\n OperandSize::Ymmword => random_ymm_reg(allow_all),\n\n OperandSize::Zmmword => random_zmm_reg(allow_all),\n","file_path":"gen_defs/src/gen_tests.rs","rank":8,"score":362089.76032153267},{"content":"fn random_fixed(fixed_op: FixedOperand) -> Operand {\n\n match fixed_op {\n\n FixedOperand::Reg(reg) => Operand::Direct(reg),\n\n FixedOperand::Constant(c) => Operand::Literal8(c as u8)\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":9,"score":360428.80400271865},{"content":"fn run_test(instr: &Instruction, expected: &[u8], addr_size: OperandSize) {\n\n let mut buffer = Cursor::new(Vec::new());\n\n instr\n\n .encode(&mut buffer, Mode::from_size(addr_size).unwrap())\n\n .expect(\"Encoding failed\");\n\n if &buffer.get_ref()[..] != expected {\n\n println!(\"Test failed.\");\n\n print!(\"Output: [\");\n\n output_hex_array(buffer.get_ref());\n\n println!(\"]\");\n\n print!(\"Expected: [\");\n\n output_hex_array(expected);\n\n println!(\"]\");\n\n panic!(\n\n \"Failure. Mode: {:?}.\\nInstruction: {:?}.\\n\",\n\n addr_size, instr\n\n );\n\n }\n\n}\n\n\n","file_path":"src/test/mod.rs","rank":10,"score":358425.5942229312},{"content":"fn random_mib(size: OperandSize, addr_size: OperandSize) -> Operand {\n\n Operand::IndirectScaledIndexed(\n\n random_reg_of_size_no_stack(addr_size),\n\n random_reg_of_size_no_stack(addr_size),\n\n RegScale::One,\n\n Some(size), None)\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":11,"score":353851.0840731592},{"content":"fn random_mem(size: OperandSize, addr_size: OperandSize) -> Operand {\n\n if addr_size != OperandSize::Word {\n\n match rand::random::<u32>() % 5 { // Select addressing mode\n\n 0 => { // Indirect - [EAX]\n\n Operand::Indirect(\n\n random_reg_of_size_no_stack(addr_size),\n\n Some(size), None)\n\n },\n\n 1 => { // Indirect Displaced - [EAX+5]\n\n Operand::IndirectDisplaced(\n\n random_reg_of_size_no_stack(addr_size),\n\n (rand::random::<u32>() as u64) & 0x7FFFFFFF,\n\n Some(size), None)\n\n },\n\n 2 => { // Indirect Scaled Indexed - [EAX+EBX*2]\n\n Operand::IndirectScaledIndexed(\n\n random_reg_of_size_no_stack(addr_size),\n\n random_reg_of_size_no_stack(addr_size),\n\n random_reg_scale(),\n\n Some(size), None)\n","file_path":"gen_defs/src/gen_tests.rs","rank":12,"score":353851.0840731592},{"content":"fn write_operand<W: Write>(op: &Operand, instr_def: &InstructionDefinition, f: &mut W)\n\n -> io::Result<()> { \n\n match *op {\n\n Operand::Direct(reg) => write!(f, \"{}\", reg),\n\n Operand::Indirect(reg, size, seg) => \n\n write_indirect(f, Some(reg), None, None, None, size, seg, instr_def),\n\n Operand::IndirectDisplaced(reg, dsp, size, seg) =>\n\n write_indirect(f, Some(reg), None, None, Some(dsp), size, seg, instr_def),\n\n Operand::IndirectScaledIndexed(base, index, scale, size, seg) => \n\n write_indirect(f, Some(base), Some(index), Some(scale), None, size, seg, instr_def),\n\n Operand::IndirectScaledIndexedDisplaced(base, index, scale, dsp, size, seg) =>\n\n write_indirect(f, Some(base), Some(index), Some(scale), Some(dsp), size, seg,\n\n instr_def),\n\n Operand::IndirectScaledDisplaced(reg, scale, dsp, size, seg) =>\n\n write_indirect(f, Some(reg), None, Some(scale), Some(dsp), size, seg, instr_def),\n\n Operand::Memory(addr, size, seg) |\n\n Operand::Offset(addr, size, seg) => size_seg_helper(f, size, seg, |fmt| write!(fmt, \"[{}]\", addr)), // TODO Is this correct?\n\n Operand::Literal8(v) => write!(f, \"0x{:X}\", v),\n\n Operand::Literal16(v) => write!(f, \"0x{:X}\", v),\n\n Operand::Literal32(v) => write!(f, \"0x{:X}\", v),\n\n Operand::Literal64(v) => write!(f, \"0x{:X}\", v),\n\n Operand::MemoryAndSegment16(seg, addr) => write!(f, \"0x{:X}:0x{:X}\", seg, addr),\n\n Operand::MemoryAndSegment32(seg, addr) => write!(f, \"0x{:X}:0x{:X}\", seg, addr),\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":13,"score":348761.8677862118},{"content":"fn random_ymm_reg(use_all: bool) -> Reg { \n\n if use_all { random_of(&[\n\n Reg::YMM0, Reg::YMM1, Reg::YMM2, Reg::YMM3, Reg::YMM4, Reg::YMM5, Reg::YMM6, Reg::YMM7,\n\n Reg::YMM8, Reg::YMM9, Reg::YMM10, Reg::YMM11, Reg::YMM12, Reg::YMM13, Reg::YMM14, Reg::YMM15,\n\n Reg::YMM16, Reg::YMM17, Reg::YMM18, Reg::YMM19, Reg::YMM20, Reg::YMM21, Reg::YMM22, Reg::YMM23,\n\n Reg::YMM24, Reg::YMM25, Reg::YMM26, Reg::YMM27, Reg::YMM28, Reg::YMM29, Reg::YMM30, Reg::YMM31\n\n ]) } else { random_of(&[\n\n Reg::YMM0, Reg::YMM1, Reg::YMM2, Reg::YMM3, Reg::YMM4, Reg::YMM5, Reg::YMM6, Reg::YMM7,\n\n ]) }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":14,"score":348038.44714981},{"content":"fn random_zmm_reg(use_all: bool) -> Reg { \n\n if use_all { random_of(&[\n\n Reg::ZMM0, Reg::ZMM1, Reg::ZMM2, Reg::ZMM3, Reg::ZMM4, Reg::ZMM5, Reg::ZMM6, Reg::ZMM7,\n\n Reg::ZMM8, Reg::ZMM9, Reg::ZMM10, Reg::ZMM11, Reg::ZMM12, Reg::ZMM13, Reg::ZMM14, Reg::ZMM15,\n\n Reg::ZMM16, Reg::ZMM17, Reg::ZMM18, Reg::ZMM19, Reg::ZMM20, Reg::ZMM21, Reg::ZMM22, Reg::ZMM23,\n\n Reg::ZMM24, Reg::ZMM25, Reg::ZMM26, Reg::ZMM27, Reg::ZMM28, Reg::ZMM29, Reg::ZMM30, Reg::ZMM31\n\n ]) } else { random_of(&[\n\n Reg::ZMM0, Reg::ZMM1, Reg::ZMM2, Reg::ZMM3, Reg::ZMM4, Reg::ZMM5, Reg::ZMM6, Reg::ZMM7,\n\n ]) }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":15,"score":348038.44714981},{"content":"fn random_xmm_reg(use_all: bool) -> Reg { \n\n if use_all { random_of(&[\n\n Reg::XMM0, Reg::XMM1, Reg::XMM2, Reg::XMM3, Reg::XMM4, Reg::XMM5, Reg::XMM6, Reg::XMM7,\n\n Reg::XMM8, Reg::XMM9, Reg::XMM10, Reg::XMM11, Reg::XMM12, Reg::XMM13, Reg::XMM14, Reg::XMM15,\n\n Reg::XMM16, Reg::XMM17, Reg::XMM18, Reg::XMM19, Reg::XMM20, Reg::XMM21, Reg::XMM22, Reg::XMM23,\n\n Reg::XMM24, Reg::XMM25, Reg::XMM26, Reg::XMM27, Reg::XMM28, Reg::XMM29, Reg::XMM30, Reg::XMM31\n\n ]) } else { random_of(&[\n\n Reg::XMM0, Reg::XMM1, Reg::XMM2, Reg::XMM3, Reg::XMM4, Reg::XMM5, Reg::XMM6, Reg::XMM7,\n\n ]) }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":16,"score":348038.44714981},{"content":"fn make_operand_combinations(instr: &InstructionDefinition) -> Vec<Vec<OperandDefinition>> {\n\n let set_parts = instr.operands.iter().by_ref().filter_map(\n\n |maybe_op| maybe_op.as_ref().and_then(\n\n |op| if let OperandType::Set(ref items) = op.op_type {\n\n if instr.mnemonic.find(\"CVT\").is_none() {\n\n Some(items.clone())\n\n } else {\n\n Some(items.iter().filter(|i| if let OperandType::Bcst(_) = **i { false }\n\n else { true }).cloned().collect())\n\n }\n\n } else { None }\n\n )\n\n ).next();\n\n if let Some(parts) = set_parts { \n\n parts.iter().map(|part| instr.operands.iter().filter_map(\n\n |maybe_op| maybe_op.as_ref().map(|op| if let OperandType::Set(_) = op.op_type {\n\n OperandDefinition {\n\n encoding: op.encoding,\n\n access: op.access,\n\n size: op.size,\n\n op_type: part.clone()\n\n }\n\n } else { op.clone() }\n\n )).collect()).collect()\n\n } else {\n\n vec![instr.operands.iter().filter_map(|x| x.as_ref()).cloned().collect()]\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":17,"score":328989.55420121795},{"content":"#[test]\n\nfn operand_type_a() {\n\n decode_helper(\n\n &vec![0x66, 0x62, 0x00],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::BOUND,\n\n Operand::Direct(Reg::AX),\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Unsized), None),\n\n ),\n\n ); // BOUND AX, [EAX]\n\n decode_helper(\n\n &vec![0x62, 0x00],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::BOUND,\n\n Operand::Direct(Reg::EAX),\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Unsized), None),\n\n ),\n\n ); // BOUND EAX, [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":18,"score":322405.83004577464},{"content":"#[test]\n\nfn operand_type_q() {\n\n decode_helper(\n\n &vec![0xFF, 0x20],\n\n Mode::Long,\n\n &Instruction::new1(\n\n Mnemonic::JMP,\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\n\n ),\n\n ); // JMP QWORD PTR [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":19,"score":322405.83004577464},{"content":"#[test]\n\nfn operand_type_v() {\n\n decode_helper(\n\n &vec![0x40],\n\n Mode::Real,\n\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::AX)),\n\n ); // INC AX\n\n decode_helper(\n\n &vec![0x66, 0x40],\n\n Mode::Real,\n\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::EAX)),\n\n ); // INC EAX\n\n decode_helper(\n\n &vec![0x66, 0x40],\n\n Mode::Protected,\n\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::AX)),\n\n ); // INC AX\n\n decode_helper(\n\n &vec![0x40],\n\n Mode::Protected,\n\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::EAX)),\n\n ); // INC EAX\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":20,"score":322405.83004577464},{"content":"#[test]\n\nfn operand_type_d() {\n\n decode_helper(\n\n &vec![0x0F, 0x6E, 0xD0],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::MOVD,\n\n Operand::Direct(Reg::MM2),\n\n Operand::Direct(Reg::EAX),\n\n ),\n\n ); // MOVD MM2, EAX\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":21,"score":322405.83004577464},{"content":"#[test]\n\nfn operand_type_b() {\n\n decode_helper(\n\n &vec![0xC4, 0xE3, 0x79, 0x32, 0xCA, 0x05],\n\n Mode::Protected,\n\n &Instruction::new3(\n\n Mnemonic::KSHIFTLB,\n\n Operand::Direct(Reg::K1),\n\n Operand::Direct(Reg::K2),\n\n Operand::Literal8(5),\n\n ),\n\n ); // KSHIFTLB K1, K2, 5\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":22,"score":322405.83004577464},{"content":"#[test]\n\nfn operand_type_w() {\n\n decode_helper(\n\n &vec![0xC8, 0x05, 0x00, 0x06],\n\n Mode::Real,\n\n &Instruction::new2(\n\n Mnemonic::ENTER,\n\n Operand::Literal16(0x5),\n\n Operand::Literal8(0x06),\n\n ),\n\n ); // ENTER 5, 6\n\n decode_helper(\n\n &vec![0xC8, 0x05, 0x00, 0x06],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::ENTER,\n\n Operand::Literal16(0x5),\n\n Operand::Literal8(0x06),\n\n ),\n\n ); // ENTER 5, 6\n\n decode_helper(\n\n &vec![0xC8, 0x05, 0x00, 0x06],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ENTER,\n\n Operand::Literal16(0x5),\n\n Operand::Literal8(0x06),\n\n ),\n\n ); // ENTER 5, 6\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":23,"score":322405.83004577464},{"content":"#[test]\n\nfn operand_type_p() {\n\n decode_helper(\n\n &vec![0x9A, 0xAB, 0x89, 0x67, 0x45, 0x23, 0x01],\n\n Mode::Protected,\n\n &Instruction::new1(\n\n Mnemonic::CALL,\n\n Operand::MemoryAndSegment32(0x0123, 0x456789AB),\n\n ),\n\n ); // CALL 0x0123:0x456789AB\n\n decode_helper(\n\n &vec![0x66, 0x9A, 0x67, 0x45, 0x23, 0x01],\n\n Mode::Protected,\n\n &Instruction::new1(Mnemonic::CALL, Operand::MemoryAndSegment16(0x0123, 0x4567)),\n\n ); // CALL 0x0123:0x4567\n\n decode_helper(\n\n &vec![0x9A, 0x67, 0x45, 0x23, 0x01],\n\n Mode::Real,\n\n &Instruction::new1(Mnemonic::CALL, Operand::MemoryAndSegment16(0x0123, 0x4567)),\n\n ); // CALL 0x0123:0x4567\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":24,"score":322405.83004577464},{"content":"fn build_test_operand(instr: &mut Instruction, instr_def: &InstructionDefinition,\n\n def: &OperandDefinition, addr_size: OperandSize) -> Operand {\n\n match def.op_type {\n\n OperandType::Reg(reg_type) =>\n\n Operand::Direct(random_reg(reg_type, def.size, addr_size, instr_def)),\n\n OperandType::Mem(size) => random_mem(size.unwrap_or(def.size), addr_size),\n\n OperandType::Imm => random_imm(def.size),\n\n OperandType::Offset => Operand::Offset(rand_value_of_size(def.size), Some(def.size), None),\n\n OperandType::Rel(op_size) => random_imm(op_size), // TODO Is this correct?\n\n OperandType::Mib => random_mib(def.size, addr_size),\n\n OperandType::Bcst(bcst_size) => random_mem(bcst_size, addr_size),\n\n OperandType::Fixed(fixed_op) => random_fixed(fixed_op),\n\n OperandType::Constant => unimplemented!(), // TODO What is this?\n\n _ => unreachable!() // Set(_) should be split apart already\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":25,"score":320714.5979397588},{"content":"fn make_rm(size: OperandSize, reg_type: RegType) -> InstructionToken {\n\n let vec = vec![InstructionToken::Reg(reg_type, size), InstructionToken::Mem(size)];\n\n InstructionToken::Set(vec)\n\n}\n\n\n","file_path":"gen_defs/src/main.rs","rank":26,"score":318056.8734751269},{"content":"// Test decoding of the operand size prefix.\n\nfn operand_size_prefix() {\n\n decode_helper(\n\n &vec![0xC5, 0xE9, 0x58, 0x08],\n\n Mode::Protected,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Xmmword), None),\n\n ),\n\n ); // VADDPD XMM1, XMM2, [EAX]\n\n}\n\n\n\n#[test]\n","file_path":"src/test/decode.rs","rank":27,"score":317057.37213678606},{"content":"#[test]\n\nfn operand_type_vs() {\n\n decode_helper(\n\n &vec![0x66, 0x68, 0x34, 0x12],\n\n Mode::Protected,\n\n &Instruction::new1(Mnemonic::PUSH, Operand::Literal16(0x1234)),\n\n ); // PUSH 0x1234\n\n decode_helper(\n\n &vec![0x68, 0x78, 0x56, 0x34, 0x12],\n\n Mode::Protected,\n\n &Instruction::new1(Mnemonic::PUSH, Operand::Literal32(0x12345678)),\n\n ); // PUSH 0x12345678\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":28,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_vqp() {\n\n decode_helper(\n\n &vec![0x66, 0x01, 0xC3],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADD,\n\n Operand::Direct(Reg::BX),\n\n Operand::Direct(Reg::AX),\n\n ),\n\n ); // ADD BX, AX\n\n decode_helper(\n\n &vec![0x01, 0xC3],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADD,\n\n Operand::Direct(Reg::EBX),\n\n Operand::Direct(Reg::EAX),\n\n ),\n\n ); // ADD EBX, EAX\n\n decode_helper(\n\n &vec![0x48, 0x01, 0xC3],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADD,\n\n Operand::Direct(Reg::RBX),\n\n Operand::Direct(Reg::RAX),\n\n ),\n\n ); // ADD RBX, RAX\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":29,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_ptp() {\n\n decode_helper(\n\n &vec![0xFF, 0x10],\n\n Mode::Protected,\n\n &Instruction::new1(\n\n Mnemonic::CALL,\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Dword), None),\n\n ),\n\n ); // CALL DWORD PTR [EAX]\n\n decode_helper(\n\n &vec![0xFF, 0x18],\n\n Mode::Protected,\n\n &Instruction::new1(\n\n Mnemonic::CALL,\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Fword), None),\n\n ),\n\n ); // CALL FWORD PTR [EAX]\n\n\n\n // TODO I'm not 100% sure this is correct. It seems to be from the Intel docs, but GCC won't\n\n // seem to accept this form?\n\n decode_helper(\n\n &vec![0x48, 0xFF, 0x18],\n\n Mode::Long,\n\n &Instruction::new1(\n\n Mnemonic::CALL,\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Tbyte), None),\n\n ),\n\n ); // CALL TBYTE PTR [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":30,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_ps() {\n\n decode_helper(\n\n &vec![0x0F, 0x58, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDPS,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // ADDPS XMM1, XMM2\n\n decode_helper(\n\n &vec![0x0F, 0x58, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDPS,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\n\n ),\n\n ); // ADDPS XMM1, [EAX]1\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":31,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_ds() {\n\n decode_helper(\n\n &vec![0xE8, 0x78, 0x56, 0x34, 0x12],\n\n Mode::Protected,\n\n &Instruction::new1(Mnemonic::CALL, Operand::Offset(0x12345678, None, None)),\n\n ); // CALL 0x12345678\n\n}\n\n\n\n// I've temporarily disabled this test as the decoding logic will need to lookahead in order to\n\n// distiguish between a standalone FWAIT instruction and an instruction prefixed with 0x9B.\n\n// #[test]\n\n// fn operand_type_e() {\n\n// decode_helper(&vec![0x9B, 0xD9, 0x30], Mode::Protected, &Instruction::new1(Mnemonic::FSTENV, Operand::Indirect(Reg::EAX, None, None))); // FSTENV [EAX]\n\n// }\n\n\n","file_path":"src/test/decode.rs","rank":32,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_bs() {\n\n decode_helper(\n\n &vec![0x6B, 0xC3, 0x12],\n\n Mode::Protected,\n\n &Instruction::new3(\n\n Mnemonic::IMUL,\n\n Operand::Direct(Reg::EAX),\n\n Operand::Direct(Reg::EBX),\n\n Operand::Literal8(0x12),\n\n ),\n\n ); // IMUL EAX, EBX, 0x12\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":33,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_qp() {\n\n decode_helper(\n\n &vec![0x48, 0xCF],\n\n Mode::Long,\n\n &Instruction::new0(Mnemonic::IRETQ),\n\n ); // IRETQ\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":34,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_dr() {\n\n decode_helper(\n\n &vec![0xDC, 0x00],\n\n Mode::Protected,\n\n &Instruction::new1(\n\n Mnemonic::FADD,\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Qword), None),\n\n ),\n\n ); // FADD QWORD PTR [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":35,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_bcd() {\n\n decode_helper(\n\n &vec![0xDF, 0x20],\n\n Mode::Protected,\n\n &Instruction::new1(\n\n Mnemonic::FBLD,\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Tbyte), None),\n\n ),\n\n ); // FBLD [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":36,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_ymm() {\n\n decode_helper(\n\n &vec![0xC5, 0xED, 0x58, 0xCB],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::YMM1),\n\n Operand::Direct(Reg::YMM2),\n\n Operand::Direct(Reg::YMM3),\n\n ),\n\n ); // VADDPD YMM1, YMM2, YMM3\n\n decode_helper(\n\n &vec![0xC5, 0xED, 0x58, 0x08],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::YMM1),\n\n Operand::Direct(Reg::YMM2),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Ymmword), None),\n\n ),\n\n ); // VADDPD YMM1, YMM2, [EAX}\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":37,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_sd() {\n\n decode_helper(\n\n &vec![0xF2, 0x0F, 0x58, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDSD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // ADDSD XMM1, XMM2\n\n decode_helper(\n\n &vec![0xF2, 0x0F, 0x58, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDSD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\n\n ),\n\n ); // ADDSD XMM1, [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":38,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_psq() {\n\n decode_helper(\n\n &vec![0x0F, 0x2C, 0xCA],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::CVTTPS2PI,\n\n Operand::Direct(Reg::MM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // CVTTPS2PI MM1, XMM2\n\n decode_helper(\n\n &vec![0x0F, 0x2C, 0x08],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::CVTTPS2PI,\n\n Operand::Direct(Reg::MM1),\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Qword), None),\n\n ),\n\n ); // CVTTPS2PI MM1, [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":39,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_pd() {\n\n decode_helper(\n\n &vec![0x66, 0x0F, 0x58, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDPD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // ADDPD XMM1, XMM2\n\n decode_helper(\n\n &vec![0x66, 0x0F, 0x58, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDPD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\n\n ),\n\n ); // ADDPD XMM1, [EAX]1\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":40,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_pi() {\n\n decode_helper(\n\n &vec![0x0F, 0x2A, 0xCA],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::CVTPI2PS,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::MM2),\n\n ),\n\n ); // CVTPI2PS XMM1, MM2\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":41,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_dq() {\n\n decode_helper(\n\n &vec![0x66, 0x0F, 0x38, 0x00, 0x08],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::PSHUFB,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Xmmword), None),\n\n ),\n\n ); // PSHUFB XMM1, [EAX]\n\n decode_helper(\n\n &vec![0x66, 0x0F, 0x38, 0x00, 0xCA],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::PSHUFB,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // PSHUFB XMM1, [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":42,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_vq() {\n\n decode_helper(\n\n &vec![0x66, 0x50],\n\n Mode::Long,\n\n &Instruction::new1(Mnemonic::PUSH, Operand::Direct(Reg::AX)),\n\n ); // PUSH AX\n\n decode_helper(\n\n &vec![0x50],\n\n Mode::Long,\n\n &Instruction::new1(Mnemonic::PUSH, Operand::Direct(Reg::RAX)),\n\n ); // PUSH RAX\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":43,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_dqp() {\n\n decode_helper(\n\n &vec![0xF2, 0x48, 0x0F, 0x38, 0xF0, 0xC0],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::CRC32,\n\n Operand::Direct(Reg::RAX),\n\n Operand::Direct(Reg::AL),\n\n ),\n\n ); // CRC32 RAX, AL\n\n decode_helper(\n\n &vec![0xF2, 0x0F, 0x38, 0xF0, 0xC0],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::CRC32,\n\n Operand::Direct(Reg::EAX),\n\n Operand::Direct(Reg::AL),\n\n ),\n\n ); // CRC32 EAX, AL\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":44,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_di() {\n\n decode_helper(\n\n &vec![0xDA, 0x00],\n\n Mode::Protected,\n\n &Instruction::new1(\n\n Mnemonic::FIADD,\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Dword), None),\n\n ),\n\n ); // FIADD DWORD PTR [EAX}\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":45,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_bound() {\n\n decode_helper(\n\n &vec![0xF3, 0x0F, 0x1A, 0xC8],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::BNDCL,\n\n Operand::Direct(Reg::BND1),\n\n Operand::Direct(Reg::EAX),\n\n ),\n\n ); // BNDCL BND1, EAX\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":46,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_zmm() {\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0xED, 0x48, 0x58, 0xCB],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::ZMM1),\n\n Operand::Direct(Reg::ZMM2),\n\n Operand::Direct(Reg::ZMM3),\n\n ),\n\n ); // VADDPD ZMM1, ZMM2, ZMM3\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0xED, 0x48, 0x58, 0x08],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::ZMM1),\n\n Operand::Direct(Reg::ZMM2),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Zmmword), None),\n\n ),\n\n ); // VADDPD ZMM1, ZMM2, [EAX}\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":47,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_ss() {\n\n decode_helper(\n\n &vec![0xF3, 0x0F, 0x58, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDSS,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // ADDSS XMM1, XMM2\n\n decode_helper(\n\n &vec![0xF3, 0x0F, 0x58, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::ADDSS,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Dword), None),\n\n ),\n\n ); // ADDSS XMM1, [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":48,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_er() {\n\n decode_helper(\n\n &vec![0xDB, 0x28],\n\n Mode::Protected,\n\n &Instruction::new1(\n\n Mnemonic::FLD,\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Tbyte), None),\n\n ),\n\n ); // FLD TBYTE PTR [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":49,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_vds() {\n\n decode_helper(\n\n &vec![0x05, 0x34, 0x12],\n\n Mode::Real,\n\n &Instruction::new2(\n\n Mnemonic::ADD,\n\n Operand::Direct(Reg::AX),\n\n Operand::Literal16(0x1234),\n\n ),\n\n ); // ADD AX, 0x1234\n\n decode_helper(\n\n &vec![0x66, 0x05, 0x78, 0x56, 0x34, 0x12],\n\n Mode::Real,\n\n &Instruction::new2(\n\n Mnemonic::ADD,\n\n Operand::Direct(Reg::EAX),\n\n Operand::Literal32(0x12345678),\n\n ),\n\n ); // ADD EAX, 0x12345678\n\n decode_helper(\n","file_path":"src/test/decode.rs","rank":50,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_bss() {\n\n decode_helper(\n\n &vec![0x6A, 0x12],\n\n Mode::Protected,\n\n &Instruction::new1(Mnemonic::PUSH, Operand::Literal8(0x12)),\n\n ); // PUSH 0x12\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":51,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_avx() {\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0xED, 0x0A, 0x58, 0xCB],\n\n Mode::Long,\n\n &Instruction {\n\n mnemonic: Mnemonic::VADDPD,\n\n operand1: Some(Operand::Direct(Reg::XMM1)),\n\n operand2: Some(Operand::Direct(Reg::XMM2)),\n\n operand3: Some(Operand::Direct(Reg::XMM3)),\n\n mask: Some(MaskReg::K2),\n\n merge_mode: Some(MergeMode::Merge),\n\n ..Default::default()\n\n },\n\n ); // VADDPD XMM1 {K2}, XMM2, XMM3\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0xED, 0x2A, 0x58, 0xCB],\n\n Mode::Long,\n\n &Instruction {\n\n mnemonic: Mnemonic::VADDPD,\n\n operand1: Some(Operand::Direct(Reg::YMM1)),\n","file_path":"src/test/decode.rs","rank":52,"score":317044.3639582245},{"content":"#[test]\n\nfn operand_type_xmm() {\n\n decode_helper(\n\n &vec![0xC5, 0xE9, 0x58, 0xCB],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n Operand::Direct(Reg::XMM3),\n\n ),\n\n ); // VADDPD XMM1, XMM2, XMM3\n\n decode_helper(\n\n &vec![0xC5, 0xE9, 0x58, 0x08],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\n\n ),\n\n ); // VADDPD XMM1, XMM2, [EAX}\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":53,"score":317044.3639582245},{"content":"fn build_test_instruction(def: &InstructionDefinition, op_defs: Vec<OperandDefinition>,\n\n addr_size: OperandSize) -> Instruction {\n\n\n\n let mut instr = Instruction {\n\n mnemonic: def.mnemonic.clone(),\n\n .. Default::default()\n\n };\n\n\n\n let first_op_not_mem = op_defs.iter().next().map(|o| !o.op_type.is_mem()).unwrap_or(true);\n\n if def.allow_mask && first_op_not_mem { instr.mask = Some(random_mask()); }\n\n if def.allow_merge_mode && first_op_not_mem { instr.merge_mode = Some(MergeMode::Zero) }\n\n\n\n if op_defs.iter().all(|d| !d.op_type.is_mem()) {\n\n if def.allow_rounding & op_defs.iter().all(\n\n |op_def| if let OperandType::Reg(_) = op_def.op_type { true } else { false })\n\n { instr.rounding_mode = Some(random_rounding_mode()); }\n\n else if def.allow_sae { instr.sae = true; }\n\n }\n\n\n\n let broadcast_size = op_defs.iter().filter_map(\n","file_path":"gen_defs/src/gen_tests.rs","rank":54,"score":316645.5576981066},{"content":"fn build_test_instructions(def: &InstructionDefinition, addr_size: OperandSize) -> Vec<Instruction> {\n\n let op_combinations = make_operand_combinations(def);\n\n op_combinations.into_iter().filter(filter_op_combination)\n\n .map(|op_c| build_test_instruction(def, op_c, addr_size)).collect()\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":55,"score":315604.4112455332},{"content":"#[test]\n\nfn operand_type_xmm_or_mem64() {\n\n decode_helper(\n\n &vec![0x0F, 0x5A, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::CVTPS2PD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // CVTPS2PD XMM1, XMM2\n\n decode_helper(\n\n &vec![0x0F, 0x5A, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::CVTPS2PD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\n\n ),\n\n ); // CVTPS2PD XMM1, QWORD PTR [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":56,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_xmm_or_ymm() {\n\n decode_helper(\n\n &vec![0xC5, 0xE9, 0x58, 0xCB],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n Operand::Direct(Reg::XMM3),\n\n ),\n\n ); // VADDPD XMM1, XMM2, XMM3\n\n decode_helper(\n\n &vec![0xC5, 0xED, 0x58, 0xCB],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VADDPD,\n\n Operand::Direct(Reg::YMM1),\n\n Operand::Direct(Reg::YMM2),\n\n Operand::Direct(Reg::YMM3),\n\n ),\n\n ); // VADDPD YMM1, YMM2, YMM3\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":57,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_mask_or_mem_64() {\n\n decode_helper(\n\n &vec![0xC4, 0xE1, 0xF8, 0x90, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVQ,\n\n Operand::Direct(Reg::K1),\n\n Operand::Direct(Reg::K2),\n\n ),\n\n ); // KMOVQ K1, K2\n\n decode_helper(\n\n &vec![0xC4, 0xE1, 0xF8, 0x90, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVQ,\n\n Operand::Direct(Reg::K1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\n\n ),\n\n ); // KMOVQ K1, QWORD PTR [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":58,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_mask_or_mem_32() {\n\n decode_helper(\n\n &vec![0xC4, 0xE1, 0xF9, 0x90, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVD,\n\n Operand::Direct(Reg::K1),\n\n Operand::Direct(Reg::K2),\n\n ),\n\n ); // KMOVD K1, K2\n\n decode_helper(\n\n &vec![0xC4, 0xE1, 0xF9, 0x90, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVD,\n\n Operand::Direct(Reg::K1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Dword), None),\n\n ),\n\n ); // KMOVD K1, DWORD PTR [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":59,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_bound_or_mem() {\n\n decode_helper(\n\n &vec![0x66, 0x0F, 0x1A, 0xCA],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::BNDMOV,\n\n Operand::Direct(Reg::BND1),\n\n Operand::Direct(Reg::BND2),\n\n ),\n\n ); // BNDMOV BND1, BND2\n\n decode_helper(\n\n &vec![0x66, 0x0F, 0x1A, 0x08],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::BNDMOV,\n\n Operand::Direct(Reg::BND1),\n\n Operand::Indirect(Reg::EAX, Some(OperandSize::Qword), None),\n\n ),\n\n ); // BNDMOV BND1, QWORD PTR [EAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":60,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_unsized_memory() {\n\n decode_helper(\n\n &vec![0x8D, 0x03],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::LEA,\n\n Operand::Direct(Reg::EAX),\n\n Operand::Indirect(Reg::EBX, Some(OperandSize::Unsized), None),\n\n ),\n\n ); // LEA EAX, [EBX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":61,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_fpu_register() {\n\n decode_helper(\n\n &vec![0xD8, 0xC2],\n\n Mode::Protected,\n\n &Instruction::new2(\n\n Mnemonic::FADD,\n\n Operand::Direct(Reg::ST),\n\n Operand::Direct(Reg::ST2),\n\n ),\n\n ); // FADD ST(2)\n\n}\n","file_path":"src/test/decode.rs","rank":62,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_mask_or_mem_16() {\n\n decode_helper(\n\n &vec![0xC5, 0xF8, 0x90, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVW,\n\n Operand::Direct(Reg::K1),\n\n Operand::Direct(Reg::K2),\n\n ),\n\n ); // KMOVW K1, K2\n\n decode_helper(\n\n &vec![0xC5, 0xF8, 0x90, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVW,\n\n Operand::Direct(Reg::K1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Word), None),\n\n ),\n\n ); // KMOVW K1, BYTE PTR [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":63,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_mask_or_mem_8() {\n\n decode_helper(\n\n &vec![0xC5, 0xF9, 0x90, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVB,\n\n Operand::Direct(Reg::K1),\n\n Operand::Direct(Reg::K2),\n\n ),\n\n ); // KMOVB K1, K2\n\n decode_helper(\n\n &vec![0xC5, 0xF9, 0x90, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::KMOVB,\n\n Operand::Direct(Reg::K1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Byte), None),\n\n ),\n\n ); // KMOVB K1, BYTE PTR [RAX]\n\n}\n\n\n","file_path":"src/test/decode.rs","rank":64,"score":311894.7044301774},{"content":"#[test]\n\nfn operand_type_xmm_or_mem32() {\n\n decode_helper(\n\n &vec![0xC5, 0xEA, 0x5A, 0xCB],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VCVTSS2SD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n Operand::Direct(Reg::XMM3),\n\n ),\n\n ); // VCVTSS2SD XMM1, XMM2\n\n decode_helper(\n\n &vec![0xC5, 0xEA, 0x5A, 0x08],\n\n Mode::Long,\n\n &Instruction::new3(\n\n Mnemonic::VCVTSS2SD,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Dword), None),\n\n ),\n","file_path":"src/test/decode.rs","rank":65,"score":311894.7044301774},{"content":"fn parse_operand_encoding_opt(operand: &str) -> Option<(OperandEncoding, OperandAccess)> {\n\n if operand.len() != 0 {\n\n Some(parse_operand_encoding(operand.as_bytes()).unwrap().1)\n\n } else {\n\n None\n\n }\n\n}\n\n\n\nnamed!(instruction_sep, eat_separator!(&b\", \"[..]));\n\nnamed!(parse_token_list<Vec<Vec<InstructionToken>>>, separated_list!(instruction_sep, parse_instruction_part));\n\nnamed!(parse_instruction<&[u8], (String, Vec<InstructionToken>), u32>, do_parse!(\n\n mnemonic: alphanumeric >> opt!(instruction_sep) >>\n\n tokens: opt!(complete!(parse_token_list)) >>\n\n (build_result(mnemonic, tokens))\n\n )\n\n);\n\n\n","file_path":"gen_defs/src/main.rs","rank":66,"score":311486.28128727485},{"content":"fn random_reg_64() -> Reg\n\n { random_of(&[Reg::RBX, Reg::RCX, Reg::RDX, Reg::RSI, Reg::RDI, Reg::RSP, Reg::RBP]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":67,"score":311326.47033738723},{"content":"fn random_reg_16() -> Reg\n\n { random_of(&[Reg::BX, Reg::CX, Reg::DX, Reg::SI, Reg::DI, Reg::SP, Reg::BP]) }\n","file_path":"gen_defs/src/gen_tests.rs","rank":68,"score":311326.47033738723},{"content":"fn random_reg_32() -> Reg\n\n { random_of(&[Reg::EBX, Reg::ECX, Reg::EDX, Reg::ESI, Reg::EDI, Reg::ESP, Reg::EBP]) }\n","file_path":"gen_defs/src/gen_tests.rs","rank":69,"score":311326.47033738723},{"content":"fn random_reg_64_no_stack() -> Reg\n\n { random_of(&[Reg::RAX, Reg::RBX, Reg::RCX, Reg::RDX, Reg::RSI, Reg::RDI]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":70,"score":308105.8281911791},{"content":"fn random_reg_16_no_stack() -> Reg\n\n { random_of(&[Reg::AX, Reg::BX, Reg::CX, Reg::DX, Reg::SI, Reg::DI]) }\n","file_path":"gen_defs/src/gen_tests.rs","rank":71,"score":308105.8281911791},{"content":"fn random_mmx_reg() -> Reg\n\n { random_of(&[Reg::MM0, Reg::MM1, Reg::MM2, Reg::MM3, Reg::MM4, Reg::MM5, Reg::MM6, Reg::MM7]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":72,"score":308105.8281911791},{"content":"fn random_fpu_reg() -> Reg\n\n { random_of(&[Reg::ST1, Reg::ST2, Reg::ST3, Reg::ST4, Reg::ST5, Reg::ST6, Reg::ST7]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":73,"score":308105.8281911791},{"content":"fn random_mask_reg() -> Reg\n\n { random_of(&[Reg::K1, Reg::K2, Reg::K3, Reg::K4, Reg::K5, Reg::K6, Reg::K7]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":74,"score":308105.8281911791},{"content":"fn random_reg_32_no_stack() -> Reg\n\n { random_of(&[Reg::EAX, Reg::EBX, Reg::ECX, Reg::EDX, Reg::ESI, Reg::EDI]) }\n","file_path":"gen_defs/src/gen_tests.rs","rank":75,"score":308105.8281911791},{"content":"#[test]\n\nfn infer_operand_size_16_32_instr() {\n\n encode32_helper2(\n\n Mnemonic::ADD,\n\n Operand::Direct(Reg::AX),\n\n Operand::Indirect(Reg::EBX, None, None),\n\n &vec![0x66, 0x03, 0x03],\n\n );\n\n encode32_helper2(\n\n Mnemonic::ADD,\n\n Operand::Direct(Reg::EAX),\n\n Operand::Indirect(Reg::EBX, None, None),\n\n &vec![0x03, 0x03],\n\n );\n\n}\n\n\n","file_path":"src/test/size_inference.rs","rank":76,"score":306944.54334351444},{"content":"#[test]\n\nfn operand_type_ymm_or_mem_or_mem32() {\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0x7C, 0x48, 0x5A, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPS2PD,\n\n Operand::Direct(Reg::ZMM1),\n\n Operand::Direct(Reg::YMM2),\n\n ),\n\n ); // VCVTPS2PD ZMM1, YMM2\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0x7C, 0x48, 0x5A, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPS2PD,\n\n Operand::Direct(Reg::ZMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Ymmword), None),\n\n ),\n\n ); // VCVTPS2PD ZMM1, YMMWORD PTR [RAX]\n\n decode_helper(\n","file_path":"src/test/decode.rs","rank":77,"score":306944.54334351444},{"content":"#[test]\n\nfn operand_type_ymm_or_mem_or_mem64() {\n\n decode_helper(\n\n &vec![0xC5, 0xFF, 0xE6, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPD2DQ,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::YMM2),\n\n ),\n\n ); // VCVTPD2DQ XMM1, YMM2\n\n decode_helper(\n\n &vec![0xC5, 0xFF, 0xE6, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPD2DQ,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Ymmword), None),\n\n ),\n\n ); // VCVTPD2DQ XMM1, YMMWORD PTR [RAX]\n\n decode_helper(\n","file_path":"src/test/decode.rs","rank":78,"score":306944.54334351444},{"content":"#[test]\n\nfn operand_type_zmm_or_mem_or_mem64() {\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0xFD, 0x48, 0x5A, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPD2PS,\n\n Operand::Direct(Reg::YMM1),\n\n Operand::Direct(Reg::ZMM2),\n\n ),\n\n ); // VCVTPD2PS YMM1, ZMM2\n\n decode_helper(\n\n &vec![0x62, 0xF1, 0xFD, 0x48, 0x5A, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPD2PS,\n\n Operand::Direct(Reg::YMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Zmmword), None),\n\n ),\n\n ); // VCVTPD2PS YMM1, ZMMWORD PTR [RAX]\n\n decode_helper(\n","file_path":"src/test/decode.rs","rank":79,"score":306944.54334351444},{"content":"fn encode(instr: &Instruction, def: &InstructionDefinition, addr_size: OperandSize)\n\n -> io::Result<Vec<u8>> {\n\n // Write instruction to file\n\n let mut test_file = File::create(\"test.s\")?;\n\n write!(test_file, \".intel_syntax noprefix\\n\")?;\n\n write!(test_file, \".code{}\\n\", match addr_size {\n\n OperandSize::Word => \"16\",\n\n OperandSize::Dword => \"32\",\n\n OperandSize::Qword => \"64\",\n\n _ => panic!(\"Invalid addressing size.\")\n\n })?;\n\n write_instruction(instr, def, &mut test_file)?;\n\n write!(test_file, \"\\n\")?;\n\n\n\n // Run assembler\n\n let as_result = Command::new(\"as\")\n\n .args(&[\"test.s\", \"-o\", \"test.out\"])\n\n .spawn()?\n\n .wait()?;\n\n if !as_result.success() {\n","file_path":"gen_defs/src/gen_tests.rs","rank":80,"score":303187.427868437},{"content":"#[test]\n\nfn operand_type_xmm_or_ymm_or_mem_or_mem64() {\n\n decode_helper(\n\n &vec![0xC5, 0xF9, 0x5A, 0xCA],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPD2PS,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Direct(Reg::XMM2),\n\n ),\n\n ); // VCVTPD2PS XMM1, XMM2\n\n decode_helper(\n\n &vec![0xC5, 0xF9, 0x5A, 0x08],\n\n Mode::Long,\n\n &Instruction::new2(\n\n Mnemonic::VCVTPD2PS,\n\n Operand::Direct(Reg::XMM1),\n\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\n\n ),\n\n ); // VCVTPD2PS XMM1, XMMWORD PTR [RAX]\n\n decode_helper(\n","file_path":"src/test/decode.rs","rank":81,"score":302182.50809514255},{"content":"fn vdbpsadbw_1() {\n\n run_test(&Instruction { mnemonic: Mnemonic::VDBPSADBW, operand1: Some(Direct(XMM3)), operand2: Some(Direct(XMM5)), operand3: Some(Direct(XMM7)), operand4: Some(Literal8(74)), lock: false, rounding_mode: None, merge_mode: Some(MergeMode::Zero), sae: false, mask: Some(MaskReg::K3), broadcast: None }, &[98, 243, 85, 139, 66, 223, 74], OperandSize::Dword)\n\n}\n\n\n","file_path":"src/test/instruction_tests/vdbpsadbw.rs","rank":82,"score":300752.634987277},{"content":"fn random_reg_8() -> Reg { random_of(&[Reg::BL, Reg::CL, Reg::DL]) }\n","file_path":"gen_defs/src/gen_tests.rs","rank":83,"score":299957.40658541943},{"content":"fn write_test<W: Write>(instr: &Instruction, encoded: &[u8], addr_size: OperandSize,\n\n writer: &mut W, test_count: &mut HashMap<String, u32>) -> io::Result<()> {\n\n let test_num = test_count.entry(instr.mnemonic.clone()).or_insert(0);\n\n *test_num += 1;\n\n\n\n write!(writer, \"#[test]\\nfn {}_{}() {{\\n run_test(&{:?}, &{:?}, {:?})\\n}}\\n\\n\",\n\n instr.mnemonic.to_lowercase(), test_num, instr, encoded, addr_size)\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":85,"score":295845.2649296818},{"content":"fn random_bound_reg() -> Reg { random_of(&[Reg::BND0, Reg::BND1, Reg::BND2, Reg::BND3]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":86,"score":294212.576199507},{"content":"fn random_mask() -> MaskReg {\n\n random_of(&[MaskReg::K1, MaskReg::K2, MaskReg::K3, MaskReg::K4, MaskReg::K5, MaskReg::K6,\n\n MaskReg::K7])\n\n}\n\n\n\nnamed!(parse_as_output<Vec<u8>>, do_parse!(\n\n take_until_and_consume!(\"0:\\t\") >>\n\n bytes: flat_map!(\n\n take_until!(\"\\t\"),\n\n ws!(many1!(parse_u8_hex_str))\n\n ) >>\n\n (bytes)\n\n));\n\n\n\nnamed!(parse_u8_hex_str<u8>, map!(\n\n alphanumeric,\n\n |val| u8::from_str_radix(str::from_utf8(val).unwrap(), 16).unwrap()\n\n));\n\n\n\nimpl Display for Reg {\n","file_path":"gen_defs/src/gen_tests.rs","rank":87,"score":292388.0058182387},{"content":"fn random_control_reg() -> Reg { random_of(&[Reg::CR0, Reg::CR1, Reg::CR2, Reg::CR3, Reg::CR4 ]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":88,"score":290615.58209834783},{"content":"fn instr_token_to_operand_type(token: &InstructionToken) -> (OperandType, Option<OperandSize>) {\n\n match *token {\n\n InstructionToken::Reg(reg_type, op_size)\n\n => (OperandType::Reg(reg_type), Some(op_size)),\n\n InstructionToken::Mem(op_size)\n\n => (OperandType::Mem(Some(op_size)), Some(op_size)),\n\n InstructionToken::Imm(op_size)\n\n => (OperandType::Imm, Some(op_size)),\n\n InstructionToken::Bcst(bcst_size)\n\n => (OperandType::Bcst(bcst_size), None),\n\n InstructionToken::Rel(op_size)\n\n => (OperandType::Rel(op_size), Some(op_size)),\n\n InstructionToken::Offset(op_size)\n\n => (OperandType::Offset, Some(op_size)),\n\n InstructionToken::FixedReg(reg)\n\n => (OperandType::Fixed(FixedOperand::Reg(reg)), Some(reg.size())),\n\n InstructionToken::Constant(val)\n\n => (OperandType::Fixed(FixedOperand::Constant(val)), Some(OperandSize::Unsized)),\n\n InstructionToken::Mib\n\n => (OperandType::Mib, Some(OperandSize::Unsized)),\n\n _ => panic!(\"Unsupported type: {:?}\", *token)\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/main.rs","rank":89,"score":290525.33096318727},{"content":"pub fn emit_tests_helper(instr: &InstructionDefinition, addr_size: OperandSize, output_dir: &str,\n\n test_count: &mut HashMap<String, u32>) -> io::Result<()> {\n\n if should_skip_instr(instr) { return Ok(()); }\n\n\n\n let test_instrs = build_test_instructions(instr, addr_size);\n\n\n\n let enc_result: io::Result<Vec<Vec<u8>>> = \n\n test_instrs.iter().map(|i| encode(i, instr, addr_size)).collect();\n\n let bytes = enc_result?;\n\n let mut writer = OpenOptions::new()\n\n .append(true)\n\n .create(true)\n\n .open(format!(\"{}/{}\", output_dir, instr.mnemonic.to_lowercase()))\n\n .unwrap();\n\n\n\n test_instrs.iter().zip(bytes.iter()).fold(Ok(()),\n\n |res, (i, b)| res.and(write_test(i, b, addr_size, &mut writer, test_count)))\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":90,"score":289957.7210800017},{"content":"fn random_segment_reg() -> Reg { random_of(&[Reg::CS, Reg::DS, Reg::ES, Reg::FS, Reg::GS, Reg::SS]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":91,"score":287095.97362550016},{"content":"fn random_debug_reg() -> Reg { random_of(&[Reg::DR0, Reg::DR1, Reg::DR2, Reg::DR3, Reg::DR4, Reg::DR5]) }\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":92,"score":287095.97362550016},{"content":"fn size_seg_helper<F, W: Write>(f: &mut W, size: Option<OperandSize>, seg: Option<SegmentReg>,\n\n action: F) -> io::Result<()> where F: Fn(&mut W) -> io::Result<()> {\n\n write_size(f, size)?;\n\n write_seg(f, seg)?;\n\n action(f)\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":93,"score":279399.81786843465},{"content":"fn compare_sizes(a: &[Option<OperandSize>; 4], b: &[Option<OperandSize>; 4]) -> bool {\n\n a.iter()\n\n .zip(b.iter())\n\n .all(|(m_s1, m_s2)| match (*m_s1, *m_s2) {\n\n (Some(s1), Some(s2)) => {\n\n s1 == s2 || s1 == OperandSize::Unsized || s2 == OperandSize::Unsized\n\n }\n\n (None, None) => true,\n\n _ => false,\n\n })\n\n}\n\n\n","file_path":"src/instruction_def.rs","rank":94,"score":279224.7992648828},{"content":"fn rand_value_of_size(size: OperandSize) -> u64 {\n\n match size {\n\n OperandSize::Byte => (rand::random::<u8>() as u64) & 0xF,\n\n OperandSize::Word => (rand::random::<u16>() as u64) & 0xFFF,\n\n OperandSize::Dword => (rand::random::<u32>() as u64) & 0xFFFFFF,\n\n OperandSize::Qword => (rand::random::<u64>() & 0xFFFFFFFFFFFFFF),\n\n _ => panic!(\"Invalid size.\")\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":95,"score":276624.8324960207},{"content":"fn generate_implied_encoding(op_type: &OperandType, has_embedded_reg: bool) \n\n -> (OperandEncoding, OperandAccess) {\n\n match *op_type { // TODO Better implied operand access\n\n OperandType::Reg(reg_type) => {\n\n (OperandEncoding::ModRmRm, OperandAccess::Read)\n\n },\n\n OperandType::Mem(_) => (OperandEncoding::ModRmRm, OperandAccess::Read),\n\n OperandType::Imm => (OperandEncoding::Imm, OperandAccess::Read),\n\n OperandType::Constant => (OperandEncoding::Fixed, OperandAccess::Read),\n\n OperandType::Offset => (OperandEncoding::Imm, OperandAccess::Read),\n\n OperandType::Rel(_) => (OperandEncoding::Imm, OperandAccess::Read),\n\n OperandType::Mib => (OperandEncoding::ModRmRm, OperandAccess::Read),\n\n OperandType::Bcst(_) => (OperandEncoding::ModRmRm, OperandAccess::Read),\n\n OperandType::Fixed(_) => (OperandEncoding::Fixed, OperandAccess::Read),\n\n OperandType::Set(_) => (OperandEncoding::ModRmRm, OperandAccess::Read)\n\n }\n\n}\n\n\n","file_path":"gen_defs/src/main.rs","rank":96,"score":271748.73627749074},{"content":"fn filter_op_combination(ops: &Vec<OperandDefinition>) -> bool {\n\n ops.iter().by_ref().any(|o| match o.op_type {\n\n OperandType::Rel(_) => false,\n\n _ => true\n\n })\n\n}\n\n\n","file_path":"gen_defs/src/gen_tests.rs","rank":97,"score":269531.44662573794},{"content":"fn parse_operand_parts_final(parts: Vec<InstructionToken>) -> InstructionToken {\n\n if parts.len() == 1 { parts.into_iter().next().unwrap() }\n\n else { InstructionToken::Set(parts) }\n\n}\n\n\n\nnamed!(type_suffix, complete!(alt_complete!(\n\n tag!(\"fp\") | \n\n tag!(\"int\") |\n\n tag!(\"dec\") |\n\n tag!(\"bcd\")\n\n)));\n\n\n\nnamed!(parse_operand_part<InstructionToken>, alt_complete!(\n\n tag!(\"imm8/r\") => { |_| InstructionToken::Imm(OperandSize::Byte) } |\n\n do_parse!(tag!(\"rel\") >> size: parse_size >> (make_sized(size, |s| InstructionToken::Rel(s))) ) |\n\n do_parse!(tag!(\"r/m\") >> size: parse_size >> (make_rm(size, RegType::General)) ) |\n\n do_parse!(tag!(\"imm\") >> size: parse_size >> (make_sized(size, |s| InstructionToken::Imm(s))) ) |\n\n do_parse!(tag!(\"moffs\") >> size: parse_size >> (make_sized(size,\n\n |s| InstructionToken::Offset(s))) ) |\n\n tag!(\"Sreg\") => { |_| InstructionToken::Reg(RegType::Segment, OperandSize::Word) } |\n","file_path":"gen_defs/src/main.rs","rank":98,"score":259641.78459854837},{"content":"fn get_op_sizes(def: &InstructionDefinition, instr: &Instruction) -> [Option<OperandSize>; 4] {\n\n let ops = instr.operands();\n\n let mut iter = def.operands.iter().zip(ops.iter()).map(|(def, op)| {\n\n def.as_ref()\n\n .map(|d| op.map_or(d.size, |o| d.get_real_size(&o)))\n\n });\n\n [\n\n iter.next().unwrap_or(None),\n\n iter.next().unwrap_or(None),\n\n iter.next().unwrap_or(None),\n\n iter.next().unwrap_or(None),\n\n ]\n\n}\n\n\n","file_path":"src/instruction_def.rs","rank":99,"score":257634.85019219562}],"string":"[\n {\n \"content\": \"fn encode32_helper2(mnemonic: Mnemonic, operand1: Operand, operand2: Operand, expected: &Vec<u8>) {\\n\\n let instr = Instruction {\\n\\n mnemonic: mnemonic,\\n\\n operand1: Some(operand1),\\n\\n operand2: Some(operand2),\\n\\n operand3: None,\\n\\n operand4: None,\\n\\n ..Default::default()\\n\\n };\\n\\n encode32_helper(&instr, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/mod.rs\",\n \"rank\": 0,\n \"score\": 606330.1135968915\n },\n {\n \"content\": \"fn encode16_helper2(mnemonic: Mnemonic, operand1: Operand, operand2: Operand, expected: &Vec<u8>) {\\n\\n let instr = Instruction {\\n\\n mnemonic: mnemonic,\\n\\n operand1: Some(operand1),\\n\\n operand2: Some(operand2),\\n\\n operand3: None,\\n\\n operand4: None,\\n\\n ..Default::default()\\n\\n };\\n\\n encode16_helper(&instr, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/mod.rs\",\n \"rank\": 1,\n \"score\": 606330.1135968915\n },\n {\n \"content\": \"fn encode64_helper2(mnemonic: Mnemonic, operand1: Operand, operand2: Operand, expected: &Vec<u8>) {\\n\\n let instr = Instruction {\\n\\n mnemonic: mnemonic,\\n\\n operand1: Some(operand1),\\n\\n operand2: Some(operand2),\\n\\n operand3: None,\\n\\n operand4: None,\\n\\n ..Default::default()\\n\\n };\\n\\n encode64_helper(&instr, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/mod.rs\",\n \"rank\": 2,\n \"score\": 606330.1135968915\n },\n {\n \"content\": \"fn random_reg_of_size(size: OperandSize) -> Reg {\\n\\n match size {\\n\\n OperandSize::Byte => random_reg_8(),\\n\\n OperandSize::Word => random_reg_16(),\\n\\n OperandSize::Dword => random_reg_32(),\\n\\n OperandSize::Qword => random_reg_64(),\\n\\n _ => panic!(\\\"Invalid general register size: {:?}.\\\", size)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 3,\n \"score\": 405074.69505944534\n },\n {\n \"content\": \"fn random_reg_of_size_no_stack(size: OperandSize) -> Reg {\\n\\n match size {\\n\\n OperandSize::Byte => random_reg_8(),\\n\\n OperandSize::Word => random_reg_16_no_stack(),\\n\\n OperandSize::Dword => random_reg_32_no_stack(),\\n\\n OperandSize::Qword => random_reg_64_no_stack(),\\n\\n _ => panic!(\\\"Invalid general register size: {:?}.\\\", size)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 4,\n \"score\": 400092.43049772026\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn encode32_helper1(mnemonic: Mnemonic, op1: Operand, expected: &Vec<u8>) {\\n\\n let instr = Instruction {\\n\\n mnemonic: mnemonic,\\n\\n operand1: Some(op1),\\n\\n operand2: None,\\n\\n operand3: None,\\n\\n operand4: None,\\n\\n ..Default::default()\\n\\n };\\n\\n encode32_helper(&instr, expected);\\n\\n}\\n\",\n \"file_path\": \"src/test/mod.rs\",\n \"rank\": 5,\n \"score\": 383637.69327454804\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_mask_reg() {\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0xED, 0x28, 0xC2, 0xDB, 0x05],\\n\\n Mode::Long,\\n\\n &Instruction::new4(\\n\\n Mnemonic::VCMPPD,\\n\\n Operand::Direct(Reg::K3),\\n\\n Operand::Direct(Reg::YMM2),\\n\\n Operand::Direct(Reg::YMM3),\\n\\n Operand::Literal8(5),\\n\\n ),\\n\\n ); // VCMPPD K3, YMM2, YMM3, 5\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 6,\n \"score\": 379026.03268035897\n },\n {\n \"content\": \"fn random_imm(size: OperandSize) -> Operand {\\n\\n let mut gen = rand::thread_rng();\\n\\n match size {\\n\\n OperandSize::Byte => Operand::Literal8(gen.gen_range::<u8>(0, 128)),\\n\\n OperandSize::Word => Operand::Literal16(\\n\\n gen.gen_range::<u16>(u8::max_value() as u16 + 1, i16::max_value() as u16)),\\n\\n OperandSize::Dword => Operand::Literal32(\\n\\n gen.gen_range::<u32>(u16::max_value() as u32 + 1, i32::max_value() as u32)),\\n\\n OperandSize::Qword => Operand::Literal64(\\n\\n gen.gen_range::<u64>(u32::max_value() as u64 + 1, i64::max_value() as u64)),\\n\\n OperandSize::Far16 => Operand::MemoryAndSegment16(rand::random(), rand::random()),\\n\\n OperandSize::Far32 => Operand::MemoryAndSegment32(rand::random(), rand::random()),\\n\\n _ => panic!(\\\"Invalid immediate value size: {:?}.\\\", size)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 7,\n \"score\": 364239.84979508806\n },\n {\n \"content\": \"fn random_reg(reg_type: RegType, size: OperandSize, addr_size: OperandSize, \\n\\n def: &InstructionDefinition) -> Reg {\\n\\n match reg_type {\\n\\n RegType::General => {\\n\\n match size {\\n\\n OperandSize::Byte => random_reg_8(),\\n\\n OperandSize::Word => random_reg_16(),\\n\\n OperandSize::Dword => random_reg_32(),\\n\\n OperandSize::Qword => random_reg_64(),\\n\\n OperandSize::Unsized => random_reg_of_size(addr_size),\\n\\n _ => panic!(\\\"Invalid general register size: {:?}.\\\", size)\\n\\n }\\n\\n },\\n\\n RegType::Avx => {\\n\\n let allow_all = if let Some(CompositePrefix::Evex {..}) = def.composite_prefix {\\n\\n addr_size == OperandSize::Qword } else { false };\\n\\n match size {\\n\\n OperandSize::Xmmword => random_xmm_reg(allow_all),\\n\\n OperandSize::Ymmword => random_ymm_reg(allow_all),\\n\\n OperandSize::Zmmword => random_zmm_reg(allow_all),\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 8,\n \"score\": 362089.76032153267\n },\n {\n \"content\": \"fn random_fixed(fixed_op: FixedOperand) -> Operand {\\n\\n match fixed_op {\\n\\n FixedOperand::Reg(reg) => Operand::Direct(reg),\\n\\n FixedOperand::Constant(c) => Operand::Literal8(c as u8)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 9,\n \"score\": 360428.80400271865\n },\n {\n \"content\": \"fn run_test(instr: &Instruction, expected: &[u8], addr_size: OperandSize) {\\n\\n let mut buffer = Cursor::new(Vec::new());\\n\\n instr\\n\\n .encode(&mut buffer, Mode::from_size(addr_size).unwrap())\\n\\n .expect(\\\"Encoding failed\\\");\\n\\n if &buffer.get_ref()[..] != expected {\\n\\n println!(\\\"Test failed.\\\");\\n\\n print!(\\\"Output: [\\\");\\n\\n output_hex_array(buffer.get_ref());\\n\\n println!(\\\"]\\\");\\n\\n print!(\\\"Expected: [\\\");\\n\\n output_hex_array(expected);\\n\\n println!(\\\"]\\\");\\n\\n panic!(\\n\\n \\\"Failure. Mode: {:?}.\\\\nInstruction: {:?}.\\\\n\\\",\\n\\n addr_size, instr\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/mod.rs\",\n \"rank\": 10,\n \"score\": 358425.5942229312\n },\n {\n \"content\": \"fn random_mib(size: OperandSize, addr_size: OperandSize) -> Operand {\\n\\n Operand::IndirectScaledIndexed(\\n\\n random_reg_of_size_no_stack(addr_size),\\n\\n random_reg_of_size_no_stack(addr_size),\\n\\n RegScale::One,\\n\\n Some(size), None)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 11,\n \"score\": 353851.0840731592\n },\n {\n \"content\": \"fn random_mem(size: OperandSize, addr_size: OperandSize) -> Operand {\\n\\n if addr_size != OperandSize::Word {\\n\\n match rand::random::<u32>() % 5 { // Select addressing mode\\n\\n 0 => { // Indirect - [EAX]\\n\\n Operand::Indirect(\\n\\n random_reg_of_size_no_stack(addr_size),\\n\\n Some(size), None)\\n\\n },\\n\\n 1 => { // Indirect Displaced - [EAX+5]\\n\\n Operand::IndirectDisplaced(\\n\\n random_reg_of_size_no_stack(addr_size),\\n\\n (rand::random::<u32>() as u64) & 0x7FFFFFFF,\\n\\n Some(size), None)\\n\\n },\\n\\n 2 => { // Indirect Scaled Indexed - [EAX+EBX*2]\\n\\n Operand::IndirectScaledIndexed(\\n\\n random_reg_of_size_no_stack(addr_size),\\n\\n random_reg_of_size_no_stack(addr_size),\\n\\n random_reg_scale(),\\n\\n Some(size), None)\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 12,\n \"score\": 353851.0840731592\n },\n {\n \"content\": \"fn write_operand<W: Write>(op: &Operand, instr_def: &InstructionDefinition, f: &mut W)\\n\\n -> io::Result<()> { \\n\\n match *op {\\n\\n Operand::Direct(reg) => write!(f, \\\"{}\\\", reg),\\n\\n Operand::Indirect(reg, size, seg) => \\n\\n write_indirect(f, Some(reg), None, None, None, size, seg, instr_def),\\n\\n Operand::IndirectDisplaced(reg, dsp, size, seg) =>\\n\\n write_indirect(f, Some(reg), None, None, Some(dsp), size, seg, instr_def),\\n\\n Operand::IndirectScaledIndexed(base, index, scale, size, seg) => \\n\\n write_indirect(f, Some(base), Some(index), Some(scale), None, size, seg, instr_def),\\n\\n Operand::IndirectScaledIndexedDisplaced(base, index, scale, dsp, size, seg) =>\\n\\n write_indirect(f, Some(base), Some(index), Some(scale), Some(dsp), size, seg,\\n\\n instr_def),\\n\\n Operand::IndirectScaledDisplaced(reg, scale, dsp, size, seg) =>\\n\\n write_indirect(f, Some(reg), None, Some(scale), Some(dsp), size, seg, instr_def),\\n\\n Operand::Memory(addr, size, seg) |\\n\\n Operand::Offset(addr, size, seg) => size_seg_helper(f, size, seg, |fmt| write!(fmt, \\\"[{}]\\\", addr)), // TODO Is this correct?\\n\\n Operand::Literal8(v) => write!(f, \\\"0x{:X}\\\", v),\\n\\n Operand::Literal16(v) => write!(f, \\\"0x{:X}\\\", v),\\n\\n Operand::Literal32(v) => write!(f, \\\"0x{:X}\\\", v),\\n\\n Operand::Literal64(v) => write!(f, \\\"0x{:X}\\\", v),\\n\\n Operand::MemoryAndSegment16(seg, addr) => write!(f, \\\"0x{:X}:0x{:X}\\\", seg, addr),\\n\\n Operand::MemoryAndSegment32(seg, addr) => write!(f, \\\"0x{:X}:0x{:X}\\\", seg, addr),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 13,\n \"score\": 348761.8677862118\n },\n {\n \"content\": \"fn random_ymm_reg(use_all: bool) -> Reg { \\n\\n if use_all { random_of(&[\\n\\n Reg::YMM0, Reg::YMM1, Reg::YMM2, Reg::YMM3, Reg::YMM4, Reg::YMM5, Reg::YMM6, Reg::YMM7,\\n\\n Reg::YMM8, Reg::YMM9, Reg::YMM10, Reg::YMM11, Reg::YMM12, Reg::YMM13, Reg::YMM14, Reg::YMM15,\\n\\n Reg::YMM16, Reg::YMM17, Reg::YMM18, Reg::YMM19, Reg::YMM20, Reg::YMM21, Reg::YMM22, Reg::YMM23,\\n\\n Reg::YMM24, Reg::YMM25, Reg::YMM26, Reg::YMM27, Reg::YMM28, Reg::YMM29, Reg::YMM30, Reg::YMM31\\n\\n ]) } else { random_of(&[\\n\\n Reg::YMM0, Reg::YMM1, Reg::YMM2, Reg::YMM3, Reg::YMM4, Reg::YMM5, Reg::YMM6, Reg::YMM7,\\n\\n ]) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 14,\n \"score\": 348038.44714981\n },\n {\n \"content\": \"fn random_zmm_reg(use_all: bool) -> Reg { \\n\\n if use_all { random_of(&[\\n\\n Reg::ZMM0, Reg::ZMM1, Reg::ZMM2, Reg::ZMM3, Reg::ZMM4, Reg::ZMM5, Reg::ZMM6, Reg::ZMM7,\\n\\n Reg::ZMM8, Reg::ZMM9, Reg::ZMM10, Reg::ZMM11, Reg::ZMM12, Reg::ZMM13, Reg::ZMM14, Reg::ZMM15,\\n\\n Reg::ZMM16, Reg::ZMM17, Reg::ZMM18, Reg::ZMM19, Reg::ZMM20, Reg::ZMM21, Reg::ZMM22, Reg::ZMM23,\\n\\n Reg::ZMM24, Reg::ZMM25, Reg::ZMM26, Reg::ZMM27, Reg::ZMM28, Reg::ZMM29, Reg::ZMM30, Reg::ZMM31\\n\\n ]) } else { random_of(&[\\n\\n Reg::ZMM0, Reg::ZMM1, Reg::ZMM2, Reg::ZMM3, Reg::ZMM4, Reg::ZMM5, Reg::ZMM6, Reg::ZMM7,\\n\\n ]) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 15,\n \"score\": 348038.44714981\n },\n {\n \"content\": \"fn random_xmm_reg(use_all: bool) -> Reg { \\n\\n if use_all { random_of(&[\\n\\n Reg::XMM0, Reg::XMM1, Reg::XMM2, Reg::XMM3, Reg::XMM4, Reg::XMM5, Reg::XMM6, Reg::XMM7,\\n\\n Reg::XMM8, Reg::XMM9, Reg::XMM10, Reg::XMM11, Reg::XMM12, Reg::XMM13, Reg::XMM14, Reg::XMM15,\\n\\n Reg::XMM16, Reg::XMM17, Reg::XMM18, Reg::XMM19, Reg::XMM20, Reg::XMM21, Reg::XMM22, Reg::XMM23,\\n\\n Reg::XMM24, Reg::XMM25, Reg::XMM26, Reg::XMM27, Reg::XMM28, Reg::XMM29, Reg::XMM30, Reg::XMM31\\n\\n ]) } else { random_of(&[\\n\\n Reg::XMM0, Reg::XMM1, Reg::XMM2, Reg::XMM3, Reg::XMM4, Reg::XMM5, Reg::XMM6, Reg::XMM7,\\n\\n ]) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 16,\n \"score\": 348038.44714981\n },\n {\n \"content\": \"fn make_operand_combinations(instr: &InstructionDefinition) -> Vec<Vec<OperandDefinition>> {\\n\\n let set_parts = instr.operands.iter().by_ref().filter_map(\\n\\n |maybe_op| maybe_op.as_ref().and_then(\\n\\n |op| if let OperandType::Set(ref items) = op.op_type {\\n\\n if instr.mnemonic.find(\\\"CVT\\\").is_none() {\\n\\n Some(items.clone())\\n\\n } else {\\n\\n Some(items.iter().filter(|i| if let OperandType::Bcst(_) = **i { false }\\n\\n else { true }).cloned().collect())\\n\\n }\\n\\n } else { None }\\n\\n )\\n\\n ).next();\\n\\n if let Some(parts) = set_parts { \\n\\n parts.iter().map(|part| instr.operands.iter().filter_map(\\n\\n |maybe_op| maybe_op.as_ref().map(|op| if let OperandType::Set(_) = op.op_type {\\n\\n OperandDefinition {\\n\\n encoding: op.encoding,\\n\\n access: op.access,\\n\\n size: op.size,\\n\\n op_type: part.clone()\\n\\n }\\n\\n } else { op.clone() }\\n\\n )).collect()).collect()\\n\\n } else {\\n\\n vec![instr.operands.iter().filter_map(|x| x.as_ref()).cloned().collect()]\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 17,\n \"score\": 328989.55420121795\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_a() {\\n\\n decode_helper(\\n\\n &vec![0x66, 0x62, 0x00],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::BOUND,\\n\\n Operand::Direct(Reg::AX),\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Unsized), None),\\n\\n ),\\n\\n ); // BOUND AX, [EAX]\\n\\n decode_helper(\\n\\n &vec![0x62, 0x00],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::BOUND,\\n\\n Operand::Direct(Reg::EAX),\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Unsized), None),\\n\\n ),\\n\\n ); // BOUND EAX, [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 18,\n \"score\": 322405.83004577464\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_q() {\\n\\n decode_helper(\\n\\n &vec![0xFF, 0x20],\\n\\n Mode::Long,\\n\\n &Instruction::new1(\\n\\n Mnemonic::JMP,\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\\n\\n ),\\n\\n ); // JMP QWORD PTR [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 19,\n \"score\": 322405.83004577464\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_v() {\\n\\n decode_helper(\\n\\n &vec![0x40],\\n\\n Mode::Real,\\n\\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::AX)),\\n\\n ); // INC AX\\n\\n decode_helper(\\n\\n &vec![0x66, 0x40],\\n\\n Mode::Real,\\n\\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::EAX)),\\n\\n ); // INC EAX\\n\\n decode_helper(\\n\\n &vec![0x66, 0x40],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::AX)),\\n\\n ); // INC AX\\n\\n decode_helper(\\n\\n &vec![0x40],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(Mnemonic::INC, Operand::Direct(Reg::EAX)),\\n\\n ); // INC EAX\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 20,\n \"score\": 322405.83004577464\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_d() {\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x6E, 0xD0],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::MOVD,\\n\\n Operand::Direct(Reg::MM2),\\n\\n Operand::Direct(Reg::EAX),\\n\\n ),\\n\\n ); // MOVD MM2, EAX\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 21,\n \"score\": 322405.83004577464\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_b() {\\n\\n decode_helper(\\n\\n &vec![0xC4, 0xE3, 0x79, 0x32, 0xCA, 0x05],\\n\\n Mode::Protected,\\n\\n &Instruction::new3(\\n\\n Mnemonic::KSHIFTLB,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Direct(Reg::K2),\\n\\n Operand::Literal8(5),\\n\\n ),\\n\\n ); // KSHIFTLB K1, K2, 5\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 22,\n \"score\": 322405.83004577464\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_w() {\\n\\n decode_helper(\\n\\n &vec![0xC8, 0x05, 0x00, 0x06],\\n\\n Mode::Real,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ENTER,\\n\\n Operand::Literal16(0x5),\\n\\n Operand::Literal8(0x06),\\n\\n ),\\n\\n ); // ENTER 5, 6\\n\\n decode_helper(\\n\\n &vec![0xC8, 0x05, 0x00, 0x06],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ENTER,\\n\\n Operand::Literal16(0x5),\\n\\n Operand::Literal8(0x06),\\n\\n ),\\n\\n ); // ENTER 5, 6\\n\\n decode_helper(\\n\\n &vec![0xC8, 0x05, 0x00, 0x06],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ENTER,\\n\\n Operand::Literal16(0x5),\\n\\n Operand::Literal8(0x06),\\n\\n ),\\n\\n ); // ENTER 5, 6\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 23,\n \"score\": 322405.83004577464\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_p() {\\n\\n decode_helper(\\n\\n &vec![0x9A, 0xAB, 0x89, 0x67, 0x45, 0x23, 0x01],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(\\n\\n Mnemonic::CALL,\\n\\n Operand::MemoryAndSegment32(0x0123, 0x456789AB),\\n\\n ),\\n\\n ); // CALL 0x0123:0x456789AB\\n\\n decode_helper(\\n\\n &vec![0x66, 0x9A, 0x67, 0x45, 0x23, 0x01],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(Mnemonic::CALL, Operand::MemoryAndSegment16(0x0123, 0x4567)),\\n\\n ); // CALL 0x0123:0x4567\\n\\n decode_helper(\\n\\n &vec![0x9A, 0x67, 0x45, 0x23, 0x01],\\n\\n Mode::Real,\\n\\n &Instruction::new1(Mnemonic::CALL, Operand::MemoryAndSegment16(0x0123, 0x4567)),\\n\\n ); // CALL 0x0123:0x4567\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 24,\n \"score\": 322405.83004577464\n },\n {\n \"content\": \"fn build_test_operand(instr: &mut Instruction, instr_def: &InstructionDefinition,\\n\\n def: &OperandDefinition, addr_size: OperandSize) -> Operand {\\n\\n match def.op_type {\\n\\n OperandType::Reg(reg_type) =>\\n\\n Operand::Direct(random_reg(reg_type, def.size, addr_size, instr_def)),\\n\\n OperandType::Mem(size) => random_mem(size.unwrap_or(def.size), addr_size),\\n\\n OperandType::Imm => random_imm(def.size),\\n\\n OperandType::Offset => Operand::Offset(rand_value_of_size(def.size), Some(def.size), None),\\n\\n OperandType::Rel(op_size) => random_imm(op_size), // TODO Is this correct?\\n\\n OperandType::Mib => random_mib(def.size, addr_size),\\n\\n OperandType::Bcst(bcst_size) => random_mem(bcst_size, addr_size),\\n\\n OperandType::Fixed(fixed_op) => random_fixed(fixed_op),\\n\\n OperandType::Constant => unimplemented!(), // TODO What is this?\\n\\n _ => unreachable!() // Set(_) should be split apart already\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 25,\n \"score\": 320714.5979397588\n },\n {\n \"content\": \"fn make_rm(size: OperandSize, reg_type: RegType) -> InstructionToken {\\n\\n let vec = vec![InstructionToken::Reg(reg_type, size), InstructionToken::Mem(size)];\\n\\n InstructionToken::Set(vec)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/main.rs\",\n \"rank\": 26,\n \"score\": 318056.8734751269\n },\n {\n \"content\": \"// Test decoding of the operand size prefix.\\n\\nfn operand_size_prefix() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xE9, 0x58, 0x08],\\n\\n Mode::Protected,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Xmmword), None),\\n\\n ),\\n\\n ); // VADDPD XMM1, XMM2, [EAX]\\n\\n}\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 27,\n \"score\": 317057.37213678606\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_vs() {\\n\\n decode_helper(\\n\\n &vec![0x66, 0x68, 0x34, 0x12],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(Mnemonic::PUSH, Operand::Literal16(0x1234)),\\n\\n ); // PUSH 0x1234\\n\\n decode_helper(\\n\\n &vec![0x68, 0x78, 0x56, 0x34, 0x12],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(Mnemonic::PUSH, Operand::Literal32(0x12345678)),\\n\\n ); // PUSH 0x12345678\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 28,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_vqp() {\\n\\n decode_helper(\\n\\n &vec![0x66, 0x01, 0xC3],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADD,\\n\\n Operand::Direct(Reg::BX),\\n\\n Operand::Direct(Reg::AX),\\n\\n ),\\n\\n ); // ADD BX, AX\\n\\n decode_helper(\\n\\n &vec![0x01, 0xC3],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADD,\\n\\n Operand::Direct(Reg::EBX),\\n\\n Operand::Direct(Reg::EAX),\\n\\n ),\\n\\n ); // ADD EBX, EAX\\n\\n decode_helper(\\n\\n &vec![0x48, 0x01, 0xC3],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADD,\\n\\n Operand::Direct(Reg::RBX),\\n\\n Operand::Direct(Reg::RAX),\\n\\n ),\\n\\n ); // ADD RBX, RAX\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 29,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_ptp() {\\n\\n decode_helper(\\n\\n &vec![0xFF, 0x10],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(\\n\\n Mnemonic::CALL,\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Dword), None),\\n\\n ),\\n\\n ); // CALL DWORD PTR [EAX]\\n\\n decode_helper(\\n\\n &vec![0xFF, 0x18],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(\\n\\n Mnemonic::CALL,\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Fword), None),\\n\\n ),\\n\\n ); // CALL FWORD PTR [EAX]\\n\\n\\n\\n // TODO I'm not 100% sure this is correct. It seems to be from the Intel docs, but GCC won't\\n\\n // seem to accept this form?\\n\\n decode_helper(\\n\\n &vec![0x48, 0xFF, 0x18],\\n\\n Mode::Long,\\n\\n &Instruction::new1(\\n\\n Mnemonic::CALL,\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Tbyte), None),\\n\\n ),\\n\\n ); // CALL TBYTE PTR [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 30,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_ps() {\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x58, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDPS,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // ADDPS XMM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x58, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDPS,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\\n\\n ),\\n\\n ); // ADDPS XMM1, [EAX]1\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 31,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_ds() {\\n\\n decode_helper(\\n\\n &vec![0xE8, 0x78, 0x56, 0x34, 0x12],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(Mnemonic::CALL, Operand::Offset(0x12345678, None, None)),\\n\\n ); // CALL 0x12345678\\n\\n}\\n\\n\\n\\n// I've temporarily disabled this test as the decoding logic will need to lookahead in order to\\n\\n// distiguish between a standalone FWAIT instruction and an instruction prefixed with 0x9B.\\n\\n// #[test]\\n\\n// fn operand_type_e() {\\n\\n// decode_helper(&vec![0x9B, 0xD9, 0x30], Mode::Protected, &Instruction::new1(Mnemonic::FSTENV, Operand::Indirect(Reg::EAX, None, None))); // FSTENV [EAX]\\n\\n// }\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 32,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_bs() {\\n\\n decode_helper(\\n\\n &vec![0x6B, 0xC3, 0x12],\\n\\n Mode::Protected,\\n\\n &Instruction::new3(\\n\\n Mnemonic::IMUL,\\n\\n Operand::Direct(Reg::EAX),\\n\\n Operand::Direct(Reg::EBX),\\n\\n Operand::Literal8(0x12),\\n\\n ),\\n\\n ); // IMUL EAX, EBX, 0x12\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 33,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_qp() {\\n\\n decode_helper(\\n\\n &vec![0x48, 0xCF],\\n\\n Mode::Long,\\n\\n &Instruction::new0(Mnemonic::IRETQ),\\n\\n ); // IRETQ\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 34,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_dr() {\\n\\n decode_helper(\\n\\n &vec![0xDC, 0x00],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(\\n\\n Mnemonic::FADD,\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Qword), None),\\n\\n ),\\n\\n ); // FADD QWORD PTR [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 35,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_bcd() {\\n\\n decode_helper(\\n\\n &vec![0xDF, 0x20],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(\\n\\n Mnemonic::FBLD,\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Tbyte), None),\\n\\n ),\\n\\n ); // FBLD [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 36,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_ymm() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xED, 0x58, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::YMM1),\\n\\n Operand::Direct(Reg::YMM2),\\n\\n Operand::Direct(Reg::YMM3),\\n\\n ),\\n\\n ); // VADDPD YMM1, YMM2, YMM3\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xED, 0x58, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::YMM1),\\n\\n Operand::Direct(Reg::YMM2),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Ymmword), None),\\n\\n ),\\n\\n ); // VADDPD YMM1, YMM2, [EAX}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 37,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_sd() {\\n\\n decode_helper(\\n\\n &vec![0xF2, 0x0F, 0x58, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDSD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // ADDSD XMM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0xF2, 0x0F, 0x58, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDSD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\\n\\n ),\\n\\n ); // ADDSD XMM1, [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 38,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_psq() {\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x2C, 0xCA],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::CVTTPS2PI,\\n\\n Operand::Direct(Reg::MM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // CVTTPS2PI MM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x2C, 0x08],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::CVTTPS2PI,\\n\\n Operand::Direct(Reg::MM1),\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Qword), None),\\n\\n ),\\n\\n ); // CVTTPS2PI MM1, [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 39,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_pd() {\\n\\n decode_helper(\\n\\n &vec![0x66, 0x0F, 0x58, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDPD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // ADDPD XMM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0x66, 0x0F, 0x58, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDPD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\\n\\n ),\\n\\n ); // ADDPD XMM1, [EAX]1\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 40,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_pi() {\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x2A, 0xCA],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::CVTPI2PS,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::MM2),\\n\\n ),\\n\\n ); // CVTPI2PS XMM1, MM2\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 41,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_dq() {\\n\\n decode_helper(\\n\\n &vec![0x66, 0x0F, 0x38, 0x00, 0x08],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::PSHUFB,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Xmmword), None),\\n\\n ),\\n\\n ); // PSHUFB XMM1, [EAX]\\n\\n decode_helper(\\n\\n &vec![0x66, 0x0F, 0x38, 0x00, 0xCA],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::PSHUFB,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // PSHUFB XMM1, [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 42,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_vq() {\\n\\n decode_helper(\\n\\n &vec![0x66, 0x50],\\n\\n Mode::Long,\\n\\n &Instruction::new1(Mnemonic::PUSH, Operand::Direct(Reg::AX)),\\n\\n ); // PUSH AX\\n\\n decode_helper(\\n\\n &vec![0x50],\\n\\n Mode::Long,\\n\\n &Instruction::new1(Mnemonic::PUSH, Operand::Direct(Reg::RAX)),\\n\\n ); // PUSH RAX\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 43,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_dqp() {\\n\\n decode_helper(\\n\\n &vec![0xF2, 0x48, 0x0F, 0x38, 0xF0, 0xC0],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::CRC32,\\n\\n Operand::Direct(Reg::RAX),\\n\\n Operand::Direct(Reg::AL),\\n\\n ),\\n\\n ); // CRC32 RAX, AL\\n\\n decode_helper(\\n\\n &vec![0xF2, 0x0F, 0x38, 0xF0, 0xC0],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::CRC32,\\n\\n Operand::Direct(Reg::EAX),\\n\\n Operand::Direct(Reg::AL),\\n\\n ),\\n\\n ); // CRC32 EAX, AL\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 44,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_di() {\\n\\n decode_helper(\\n\\n &vec![0xDA, 0x00],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(\\n\\n Mnemonic::FIADD,\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Dword), None),\\n\\n ),\\n\\n ); // FIADD DWORD PTR [EAX}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 45,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_bound() {\\n\\n decode_helper(\\n\\n &vec![0xF3, 0x0F, 0x1A, 0xC8],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::BNDCL,\\n\\n Operand::Direct(Reg::BND1),\\n\\n Operand::Direct(Reg::EAX),\\n\\n ),\\n\\n ); // BNDCL BND1, EAX\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 46,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_zmm() {\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0xED, 0x48, 0x58, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::ZMM1),\\n\\n Operand::Direct(Reg::ZMM2),\\n\\n Operand::Direct(Reg::ZMM3),\\n\\n ),\\n\\n ); // VADDPD ZMM1, ZMM2, ZMM3\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0xED, 0x48, 0x58, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::ZMM1),\\n\\n Operand::Direct(Reg::ZMM2),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Zmmword), None),\\n\\n ),\\n\\n ); // VADDPD ZMM1, ZMM2, [EAX}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 47,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_ss() {\\n\\n decode_helper(\\n\\n &vec![0xF3, 0x0F, 0x58, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDSS,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // ADDSS XMM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0xF3, 0x0F, 0x58, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADDSS,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Dword), None),\\n\\n ),\\n\\n ); // ADDSS XMM1, [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 48,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_er() {\\n\\n decode_helper(\\n\\n &vec![0xDB, 0x28],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(\\n\\n Mnemonic::FLD,\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Tbyte), None),\\n\\n ),\\n\\n ); // FLD TBYTE PTR [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 49,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_vds() {\\n\\n decode_helper(\\n\\n &vec![0x05, 0x34, 0x12],\\n\\n Mode::Real,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADD,\\n\\n Operand::Direct(Reg::AX),\\n\\n Operand::Literal16(0x1234),\\n\\n ),\\n\\n ); // ADD AX, 0x1234\\n\\n decode_helper(\\n\\n &vec![0x66, 0x05, 0x78, 0x56, 0x34, 0x12],\\n\\n Mode::Real,\\n\\n &Instruction::new2(\\n\\n Mnemonic::ADD,\\n\\n Operand::Direct(Reg::EAX),\\n\\n Operand::Literal32(0x12345678),\\n\\n ),\\n\\n ); // ADD EAX, 0x12345678\\n\\n decode_helper(\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 50,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_bss() {\\n\\n decode_helper(\\n\\n &vec![0x6A, 0x12],\\n\\n Mode::Protected,\\n\\n &Instruction::new1(Mnemonic::PUSH, Operand::Literal8(0x12)),\\n\\n ); // PUSH 0x12\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 51,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_avx() {\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0xED, 0x0A, 0x58, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction {\\n\\n mnemonic: Mnemonic::VADDPD,\\n\\n operand1: Some(Operand::Direct(Reg::XMM1)),\\n\\n operand2: Some(Operand::Direct(Reg::XMM2)),\\n\\n operand3: Some(Operand::Direct(Reg::XMM3)),\\n\\n mask: Some(MaskReg::K2),\\n\\n merge_mode: Some(MergeMode::Merge),\\n\\n ..Default::default()\\n\\n },\\n\\n ); // VADDPD XMM1 {K2}, XMM2, XMM3\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0xED, 0x2A, 0x58, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction {\\n\\n mnemonic: Mnemonic::VADDPD,\\n\\n operand1: Some(Operand::Direct(Reg::YMM1)),\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 52,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_xmm() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xE9, 0x58, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n Operand::Direct(Reg::XMM3),\\n\\n ),\\n\\n ); // VADDPD XMM1, XMM2, XMM3\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xE9, 0x58, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\\n\\n ),\\n\\n ); // VADDPD XMM1, XMM2, [EAX}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 53,\n \"score\": 317044.3639582245\n },\n {\n \"content\": \"fn build_test_instruction(def: &InstructionDefinition, op_defs: Vec<OperandDefinition>,\\n\\n addr_size: OperandSize) -> Instruction {\\n\\n\\n\\n let mut instr = Instruction {\\n\\n mnemonic: def.mnemonic.clone(),\\n\\n .. Default::default()\\n\\n };\\n\\n\\n\\n let first_op_not_mem = op_defs.iter().next().map(|o| !o.op_type.is_mem()).unwrap_or(true);\\n\\n if def.allow_mask && first_op_not_mem { instr.mask = Some(random_mask()); }\\n\\n if def.allow_merge_mode && first_op_not_mem { instr.merge_mode = Some(MergeMode::Zero) }\\n\\n\\n\\n if op_defs.iter().all(|d| !d.op_type.is_mem()) {\\n\\n if def.allow_rounding & op_defs.iter().all(\\n\\n |op_def| if let OperandType::Reg(_) = op_def.op_type { true } else { false })\\n\\n { instr.rounding_mode = Some(random_rounding_mode()); }\\n\\n else if def.allow_sae { instr.sae = true; }\\n\\n }\\n\\n\\n\\n let broadcast_size = op_defs.iter().filter_map(\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 54,\n \"score\": 316645.5576981066\n },\n {\n \"content\": \"fn build_test_instructions(def: &InstructionDefinition, addr_size: OperandSize) -> Vec<Instruction> {\\n\\n let op_combinations = make_operand_combinations(def);\\n\\n op_combinations.into_iter().filter(filter_op_combination)\\n\\n .map(|op_c| build_test_instruction(def, op_c, addr_size)).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 55,\n \"score\": 315604.4112455332\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_xmm_or_mem64() {\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x5A, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::CVTPS2PD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // CVTPS2PD XMM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0x0F, 0x5A, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::CVTPS2PD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\\n\\n ),\\n\\n ); // CVTPS2PD XMM1, QWORD PTR [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 56,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_xmm_or_ymm() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xE9, 0x58, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n Operand::Direct(Reg::XMM3),\\n\\n ),\\n\\n ); // VADDPD XMM1, XMM2, XMM3\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xED, 0x58, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VADDPD,\\n\\n Operand::Direct(Reg::YMM1),\\n\\n Operand::Direct(Reg::YMM2),\\n\\n Operand::Direct(Reg::YMM3),\\n\\n ),\\n\\n ); // VADDPD YMM1, YMM2, YMM3\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 57,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_mask_or_mem_64() {\\n\\n decode_helper(\\n\\n &vec![0xC4, 0xE1, 0xF8, 0x90, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVQ,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Direct(Reg::K2),\\n\\n ),\\n\\n ); // KMOVQ K1, K2\\n\\n decode_helper(\\n\\n &vec![0xC4, 0xE1, 0xF8, 0x90, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVQ,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Qword), None),\\n\\n ),\\n\\n ); // KMOVQ K1, QWORD PTR [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 58,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_mask_or_mem_32() {\\n\\n decode_helper(\\n\\n &vec![0xC4, 0xE1, 0xF9, 0x90, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVD,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Direct(Reg::K2),\\n\\n ),\\n\\n ); // KMOVD K1, K2\\n\\n decode_helper(\\n\\n &vec![0xC4, 0xE1, 0xF9, 0x90, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVD,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Dword), None),\\n\\n ),\\n\\n ); // KMOVD K1, DWORD PTR [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 59,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_bound_or_mem() {\\n\\n decode_helper(\\n\\n &vec![0x66, 0x0F, 0x1A, 0xCA],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::BNDMOV,\\n\\n Operand::Direct(Reg::BND1),\\n\\n Operand::Direct(Reg::BND2),\\n\\n ),\\n\\n ); // BNDMOV BND1, BND2\\n\\n decode_helper(\\n\\n &vec![0x66, 0x0F, 0x1A, 0x08],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::BNDMOV,\\n\\n Operand::Direct(Reg::BND1),\\n\\n Operand::Indirect(Reg::EAX, Some(OperandSize::Qword), None),\\n\\n ),\\n\\n ); // BNDMOV BND1, QWORD PTR [EAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 60,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_unsized_memory() {\\n\\n decode_helper(\\n\\n &vec![0x8D, 0x03],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::LEA,\\n\\n Operand::Direct(Reg::EAX),\\n\\n Operand::Indirect(Reg::EBX, Some(OperandSize::Unsized), None),\\n\\n ),\\n\\n ); // LEA EAX, [EBX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 61,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_fpu_register() {\\n\\n decode_helper(\\n\\n &vec![0xD8, 0xC2],\\n\\n Mode::Protected,\\n\\n &Instruction::new2(\\n\\n Mnemonic::FADD,\\n\\n Operand::Direct(Reg::ST),\\n\\n Operand::Direct(Reg::ST2),\\n\\n ),\\n\\n ); // FADD ST(2)\\n\\n}\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 62,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_mask_or_mem_16() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xF8, 0x90, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVW,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Direct(Reg::K2),\\n\\n ),\\n\\n ); // KMOVW K1, K2\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xF8, 0x90, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVW,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Word), None),\\n\\n ),\\n\\n ); // KMOVW K1, BYTE PTR [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 63,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_mask_or_mem_8() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xF9, 0x90, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVB,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Direct(Reg::K2),\\n\\n ),\\n\\n ); // KMOVB K1, K2\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xF9, 0x90, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::KMOVB,\\n\\n Operand::Direct(Reg::K1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Byte), None),\\n\\n ),\\n\\n ); // KMOVB K1, BYTE PTR [RAX]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 64,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_xmm_or_mem32() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xEA, 0x5A, 0xCB],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VCVTSS2SD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n Operand::Direct(Reg::XMM3),\\n\\n ),\\n\\n ); // VCVTSS2SD XMM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xEA, 0x5A, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new3(\\n\\n Mnemonic::VCVTSS2SD,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Dword), None),\\n\\n ),\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 65,\n \"score\": 311894.7044301774\n },\n {\n \"content\": \"fn parse_operand_encoding_opt(operand: &str) -> Option<(OperandEncoding, OperandAccess)> {\\n\\n if operand.len() != 0 {\\n\\n Some(parse_operand_encoding(operand.as_bytes()).unwrap().1)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nnamed!(instruction_sep, eat_separator!(&b\\\", \\\"[..]));\\n\\nnamed!(parse_token_list<Vec<Vec<InstructionToken>>>, separated_list!(instruction_sep, parse_instruction_part));\\n\\nnamed!(parse_instruction<&[u8], (String, Vec<InstructionToken>), u32>, do_parse!(\\n\\n mnemonic: alphanumeric >> opt!(instruction_sep) >>\\n\\n tokens: opt!(complete!(parse_token_list)) >>\\n\\n (build_result(mnemonic, tokens))\\n\\n )\\n\\n);\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/main.rs\",\n \"rank\": 66,\n \"score\": 311486.28128727485\n },\n {\n \"content\": \"fn random_reg_64() -> Reg\\n\\n { random_of(&[Reg::RBX, Reg::RCX, Reg::RDX, Reg::RSI, Reg::RDI, Reg::RSP, Reg::RBP]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 67,\n \"score\": 311326.47033738723\n },\n {\n \"content\": \"fn random_reg_16() -> Reg\\n\\n { random_of(&[Reg::BX, Reg::CX, Reg::DX, Reg::SI, Reg::DI, Reg::SP, Reg::BP]) }\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 68,\n \"score\": 311326.47033738723\n },\n {\n \"content\": \"fn random_reg_32() -> Reg\\n\\n { random_of(&[Reg::EBX, Reg::ECX, Reg::EDX, Reg::ESI, Reg::EDI, Reg::ESP, Reg::EBP]) }\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 69,\n \"score\": 311326.47033738723\n },\n {\n \"content\": \"fn random_reg_64_no_stack() -> Reg\\n\\n { random_of(&[Reg::RAX, Reg::RBX, Reg::RCX, Reg::RDX, Reg::RSI, Reg::RDI]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 70,\n \"score\": 308105.8281911791\n },\n {\n \"content\": \"fn random_reg_16_no_stack() -> Reg\\n\\n { random_of(&[Reg::AX, Reg::BX, Reg::CX, Reg::DX, Reg::SI, Reg::DI]) }\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 71,\n \"score\": 308105.8281911791\n },\n {\n \"content\": \"fn random_mmx_reg() -> Reg\\n\\n { random_of(&[Reg::MM0, Reg::MM1, Reg::MM2, Reg::MM3, Reg::MM4, Reg::MM5, Reg::MM6, Reg::MM7]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 72,\n \"score\": 308105.8281911791\n },\n {\n \"content\": \"fn random_fpu_reg() -> Reg\\n\\n { random_of(&[Reg::ST1, Reg::ST2, Reg::ST3, Reg::ST4, Reg::ST5, Reg::ST6, Reg::ST7]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 73,\n \"score\": 308105.8281911791\n },\n {\n \"content\": \"fn random_mask_reg() -> Reg\\n\\n { random_of(&[Reg::K1, Reg::K2, Reg::K3, Reg::K4, Reg::K5, Reg::K6, Reg::K7]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 74,\n \"score\": 308105.8281911791\n },\n {\n \"content\": \"fn random_reg_32_no_stack() -> Reg\\n\\n { random_of(&[Reg::EAX, Reg::EBX, Reg::ECX, Reg::EDX, Reg::ESI, Reg::EDI]) }\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 75,\n \"score\": 308105.8281911791\n },\n {\n \"content\": \"#[test]\\n\\nfn infer_operand_size_16_32_instr() {\\n\\n encode32_helper2(\\n\\n Mnemonic::ADD,\\n\\n Operand::Direct(Reg::AX),\\n\\n Operand::Indirect(Reg::EBX, None, None),\\n\\n &vec![0x66, 0x03, 0x03],\\n\\n );\\n\\n encode32_helper2(\\n\\n Mnemonic::ADD,\\n\\n Operand::Direct(Reg::EAX),\\n\\n Operand::Indirect(Reg::EBX, None, None),\\n\\n &vec![0x03, 0x03],\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/size_inference.rs\",\n \"rank\": 76,\n \"score\": 306944.54334351444\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_ymm_or_mem_or_mem32() {\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0x7C, 0x48, 0x5A, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPS2PD,\\n\\n Operand::Direct(Reg::ZMM1),\\n\\n Operand::Direct(Reg::YMM2),\\n\\n ),\\n\\n ); // VCVTPS2PD ZMM1, YMM2\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0x7C, 0x48, 0x5A, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPS2PD,\\n\\n Operand::Direct(Reg::ZMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Ymmword), None),\\n\\n ),\\n\\n ); // VCVTPS2PD ZMM1, YMMWORD PTR [RAX]\\n\\n decode_helper(\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 77,\n \"score\": 306944.54334351444\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_ymm_or_mem_or_mem64() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xFF, 0xE6, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPD2DQ,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::YMM2),\\n\\n ),\\n\\n ); // VCVTPD2DQ XMM1, YMM2\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xFF, 0xE6, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPD2DQ,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Ymmword), None),\\n\\n ),\\n\\n ); // VCVTPD2DQ XMM1, YMMWORD PTR [RAX]\\n\\n decode_helper(\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 78,\n \"score\": 306944.54334351444\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_zmm_or_mem_or_mem64() {\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0xFD, 0x48, 0x5A, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPD2PS,\\n\\n Operand::Direct(Reg::YMM1),\\n\\n Operand::Direct(Reg::ZMM2),\\n\\n ),\\n\\n ); // VCVTPD2PS YMM1, ZMM2\\n\\n decode_helper(\\n\\n &vec![0x62, 0xF1, 0xFD, 0x48, 0x5A, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPD2PS,\\n\\n Operand::Direct(Reg::YMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Zmmword), None),\\n\\n ),\\n\\n ); // VCVTPD2PS YMM1, ZMMWORD PTR [RAX]\\n\\n decode_helper(\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 79,\n \"score\": 306944.54334351444\n },\n {\n \"content\": \"fn encode(instr: &Instruction, def: &InstructionDefinition, addr_size: OperandSize)\\n\\n -> io::Result<Vec<u8>> {\\n\\n // Write instruction to file\\n\\n let mut test_file = File::create(\\\"test.s\\\")?;\\n\\n write!(test_file, \\\".intel_syntax noprefix\\\\n\\\")?;\\n\\n write!(test_file, \\\".code{}\\\\n\\\", match addr_size {\\n\\n OperandSize::Word => \\\"16\\\",\\n\\n OperandSize::Dword => \\\"32\\\",\\n\\n OperandSize::Qword => \\\"64\\\",\\n\\n _ => panic!(\\\"Invalid addressing size.\\\")\\n\\n })?;\\n\\n write_instruction(instr, def, &mut test_file)?;\\n\\n write!(test_file, \\\"\\\\n\\\")?;\\n\\n\\n\\n // Run assembler\\n\\n let as_result = Command::new(\\\"as\\\")\\n\\n .args(&[\\\"test.s\\\", \\\"-o\\\", \\\"test.out\\\"])\\n\\n .spawn()?\\n\\n .wait()?;\\n\\n if !as_result.success() {\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 80,\n \"score\": 303187.427868437\n },\n {\n \"content\": \"#[test]\\n\\nfn operand_type_xmm_or_ymm_or_mem_or_mem64() {\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xF9, 0x5A, 0xCA],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPD2PS,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Direct(Reg::XMM2),\\n\\n ),\\n\\n ); // VCVTPD2PS XMM1, XMM2\\n\\n decode_helper(\\n\\n &vec![0xC5, 0xF9, 0x5A, 0x08],\\n\\n Mode::Long,\\n\\n &Instruction::new2(\\n\\n Mnemonic::VCVTPD2PS,\\n\\n Operand::Direct(Reg::XMM1),\\n\\n Operand::Indirect(Reg::RAX, Some(OperandSize::Xmmword), None),\\n\\n ),\\n\\n ); // VCVTPD2PS XMM1, XMMWORD PTR [RAX]\\n\\n decode_helper(\\n\",\n \"file_path\": \"src/test/decode.rs\",\n \"rank\": 81,\n \"score\": 302182.50809514255\n },\n {\n \"content\": \"fn vdbpsadbw_1() {\\n\\n run_test(&Instruction { mnemonic: Mnemonic::VDBPSADBW, operand1: Some(Direct(XMM3)), operand2: Some(Direct(XMM5)), operand3: Some(Direct(XMM7)), operand4: Some(Literal8(74)), lock: false, rounding_mode: None, merge_mode: Some(MergeMode::Zero), sae: false, mask: Some(MaskReg::K3), broadcast: None }, &[98, 243, 85, 139, 66, 223, 74], OperandSize::Dword)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test/instruction_tests/vdbpsadbw.rs\",\n \"rank\": 82,\n \"score\": 300752.634987277\n },\n {\n \"content\": \"fn random_reg_8() -> Reg { random_of(&[Reg::BL, Reg::CL, Reg::DL]) }\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 83,\n \"score\": 299957.40658541943\n },\n {\n \"content\": \"fn write_test<W: Write>(instr: &Instruction, encoded: &[u8], addr_size: OperandSize,\\n\\n writer: &mut W, test_count: &mut HashMap<String, u32>) -> io::Result<()> {\\n\\n let test_num = test_count.entry(instr.mnemonic.clone()).or_insert(0);\\n\\n *test_num += 1;\\n\\n\\n\\n write!(writer, \\\"#[test]\\\\nfn {}_{}() {{\\\\n run_test(&{:?}, &{:?}, {:?})\\\\n}}\\\\n\\\\n\\\",\\n\\n instr.mnemonic.to_lowercase(), test_num, instr, encoded, addr_size)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 85,\n \"score\": 295845.2649296818\n },\n {\n \"content\": \"fn random_bound_reg() -> Reg { random_of(&[Reg::BND0, Reg::BND1, Reg::BND2, Reg::BND3]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 86,\n \"score\": 294212.576199507\n },\n {\n \"content\": \"fn random_mask() -> MaskReg {\\n\\n random_of(&[MaskReg::K1, MaskReg::K2, MaskReg::K3, MaskReg::K4, MaskReg::K5, MaskReg::K6,\\n\\n MaskReg::K7])\\n\\n}\\n\\n\\n\\nnamed!(parse_as_output<Vec<u8>>, do_parse!(\\n\\n take_until_and_consume!(\\\"0:\\\\t\\\") >>\\n\\n bytes: flat_map!(\\n\\n take_until!(\\\"\\\\t\\\"),\\n\\n ws!(many1!(parse_u8_hex_str))\\n\\n ) >>\\n\\n (bytes)\\n\\n));\\n\\n\\n\\nnamed!(parse_u8_hex_str<u8>, map!(\\n\\n alphanumeric,\\n\\n |val| u8::from_str_radix(str::from_utf8(val).unwrap(), 16).unwrap()\\n\\n));\\n\\n\\n\\nimpl Display for Reg {\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 87,\n \"score\": 292388.0058182387\n },\n {\n \"content\": \"fn random_control_reg() -> Reg { random_of(&[Reg::CR0, Reg::CR1, Reg::CR2, Reg::CR3, Reg::CR4 ]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 88,\n \"score\": 290615.58209834783\n },\n {\n \"content\": \"fn instr_token_to_operand_type(token: &InstructionToken) -> (OperandType, Option<OperandSize>) {\\n\\n match *token {\\n\\n InstructionToken::Reg(reg_type, op_size)\\n\\n => (OperandType::Reg(reg_type), Some(op_size)),\\n\\n InstructionToken::Mem(op_size)\\n\\n => (OperandType::Mem(Some(op_size)), Some(op_size)),\\n\\n InstructionToken::Imm(op_size)\\n\\n => (OperandType::Imm, Some(op_size)),\\n\\n InstructionToken::Bcst(bcst_size)\\n\\n => (OperandType::Bcst(bcst_size), None),\\n\\n InstructionToken::Rel(op_size)\\n\\n => (OperandType::Rel(op_size), Some(op_size)),\\n\\n InstructionToken::Offset(op_size)\\n\\n => (OperandType::Offset, Some(op_size)),\\n\\n InstructionToken::FixedReg(reg)\\n\\n => (OperandType::Fixed(FixedOperand::Reg(reg)), Some(reg.size())),\\n\\n InstructionToken::Constant(val)\\n\\n => (OperandType::Fixed(FixedOperand::Constant(val)), Some(OperandSize::Unsized)),\\n\\n InstructionToken::Mib\\n\\n => (OperandType::Mib, Some(OperandSize::Unsized)),\\n\\n _ => panic!(\\\"Unsupported type: {:?}\\\", *token)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/main.rs\",\n \"rank\": 89,\n \"score\": 290525.33096318727\n },\n {\n \"content\": \"pub fn emit_tests_helper(instr: &InstructionDefinition, addr_size: OperandSize, output_dir: &str,\\n\\n test_count: &mut HashMap<String, u32>) -> io::Result<()> {\\n\\n if should_skip_instr(instr) { return Ok(()); }\\n\\n\\n\\n let test_instrs = build_test_instructions(instr, addr_size);\\n\\n\\n\\n let enc_result: io::Result<Vec<Vec<u8>>> = \\n\\n test_instrs.iter().map(|i| encode(i, instr, addr_size)).collect();\\n\\n let bytes = enc_result?;\\n\\n let mut writer = OpenOptions::new()\\n\\n .append(true)\\n\\n .create(true)\\n\\n .open(format!(\\\"{}/{}\\\", output_dir, instr.mnemonic.to_lowercase()))\\n\\n .unwrap();\\n\\n\\n\\n test_instrs.iter().zip(bytes.iter()).fold(Ok(()),\\n\\n |res, (i, b)| res.and(write_test(i, b, addr_size, &mut writer, test_count)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 90,\n \"score\": 289957.7210800017\n },\n {\n \"content\": \"fn random_segment_reg() -> Reg { random_of(&[Reg::CS, Reg::DS, Reg::ES, Reg::FS, Reg::GS, Reg::SS]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 91,\n \"score\": 287095.97362550016\n },\n {\n \"content\": \"fn random_debug_reg() -> Reg { random_of(&[Reg::DR0, Reg::DR1, Reg::DR2, Reg::DR3, Reg::DR4, Reg::DR5]) }\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 92,\n \"score\": 287095.97362550016\n },\n {\n \"content\": \"fn size_seg_helper<F, W: Write>(f: &mut W, size: Option<OperandSize>, seg: Option<SegmentReg>,\\n\\n action: F) -> io::Result<()> where F: Fn(&mut W) -> io::Result<()> {\\n\\n write_size(f, size)?;\\n\\n write_seg(f, seg)?;\\n\\n action(f)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 93,\n \"score\": 279399.81786843465\n },\n {\n \"content\": \"fn compare_sizes(a: &[Option<OperandSize>; 4], b: &[Option<OperandSize>; 4]) -> bool {\\n\\n a.iter()\\n\\n .zip(b.iter())\\n\\n .all(|(m_s1, m_s2)| match (*m_s1, *m_s2) {\\n\\n (Some(s1), Some(s2)) => {\\n\\n s1 == s2 || s1 == OperandSize::Unsized || s2 == OperandSize::Unsized\\n\\n }\\n\\n (None, None) => true,\\n\\n _ => false,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/instruction_def.rs\",\n \"rank\": 94,\n \"score\": 279224.7992648828\n },\n {\n \"content\": \"fn rand_value_of_size(size: OperandSize) -> u64 {\\n\\n match size {\\n\\n OperandSize::Byte => (rand::random::<u8>() as u64) & 0xF,\\n\\n OperandSize::Word => (rand::random::<u16>() as u64) & 0xFFF,\\n\\n OperandSize::Dword => (rand::random::<u32>() as u64) & 0xFFFFFF,\\n\\n OperandSize::Qword => (rand::random::<u64>() & 0xFFFFFFFFFFFFFF),\\n\\n _ => panic!(\\\"Invalid size.\\\")\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 95,\n \"score\": 276624.8324960207\n },\n {\n \"content\": \"fn generate_implied_encoding(op_type: &OperandType, has_embedded_reg: bool) \\n\\n -> (OperandEncoding, OperandAccess) {\\n\\n match *op_type { // TODO Better implied operand access\\n\\n OperandType::Reg(reg_type) => {\\n\\n (OperandEncoding::ModRmRm, OperandAccess::Read)\\n\\n },\\n\\n OperandType::Mem(_) => (OperandEncoding::ModRmRm, OperandAccess::Read),\\n\\n OperandType::Imm => (OperandEncoding::Imm, OperandAccess::Read),\\n\\n OperandType::Constant => (OperandEncoding::Fixed, OperandAccess::Read),\\n\\n OperandType::Offset => (OperandEncoding::Imm, OperandAccess::Read),\\n\\n OperandType::Rel(_) => (OperandEncoding::Imm, OperandAccess::Read),\\n\\n OperandType::Mib => (OperandEncoding::ModRmRm, OperandAccess::Read),\\n\\n OperandType::Bcst(_) => (OperandEncoding::ModRmRm, OperandAccess::Read),\\n\\n OperandType::Fixed(_) => (OperandEncoding::Fixed, OperandAccess::Read),\\n\\n OperandType::Set(_) => (OperandEncoding::ModRmRm, OperandAccess::Read)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/main.rs\",\n \"rank\": 96,\n \"score\": 271748.73627749074\n },\n {\n \"content\": \"fn filter_op_combination(ops: &Vec<OperandDefinition>) -> bool {\\n\\n ops.iter().by_ref().any(|o| match o.op_type {\\n\\n OperandType::Rel(_) => false,\\n\\n _ => true\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gen_defs/src/gen_tests.rs\",\n \"rank\": 97,\n \"score\": 269531.44662573794\n },\n {\n \"content\": \"fn parse_operand_parts_final(parts: Vec<InstructionToken>) -> InstructionToken {\\n\\n if parts.len() == 1 { parts.into_iter().next().unwrap() }\\n\\n else { InstructionToken::Set(parts) }\\n\\n}\\n\\n\\n\\nnamed!(type_suffix, complete!(alt_complete!(\\n\\n tag!(\\\"fp\\\") | \\n\\n tag!(\\\"int\\\") |\\n\\n tag!(\\\"dec\\\") |\\n\\n tag!(\\\"bcd\\\")\\n\\n)));\\n\\n\\n\\nnamed!(parse_operand_part<InstructionToken>, alt_complete!(\\n\\n tag!(\\\"imm8/r\\\") => { |_| InstructionToken::Imm(OperandSize::Byte) } |\\n\\n do_parse!(tag!(\\\"rel\\\") >> size: parse_size >> (make_sized(size, |s| InstructionToken::Rel(s))) ) |\\n\\n do_parse!(tag!(\\\"r/m\\\") >> size: parse_size >> (make_rm(size, RegType::General)) ) |\\n\\n do_parse!(tag!(\\\"imm\\\") >> size: parse_size >> (make_sized(size, |s| InstructionToken::Imm(s))) ) |\\n\\n do_parse!(tag!(\\\"moffs\\\") >> size: parse_size >> (make_sized(size,\\n\\n |s| InstructionToken::Offset(s))) ) |\\n\\n tag!(\\\"Sreg\\\") => { |_| InstructionToken::Reg(RegType::Segment, OperandSize::Word) } |\\n\",\n \"file_path\": \"gen_defs/src/main.rs\",\n \"rank\": 98,\n \"score\": 259641.78459854837\n },\n {\n \"content\": \"fn get_op_sizes(def: &InstructionDefinition, instr: &Instruction) -> [Option<OperandSize>; 4] {\\n\\n let ops = instr.operands();\\n\\n let mut iter = def.operands.iter().zip(ops.iter()).map(|(def, op)| {\\n\\n def.as_ref()\\n\\n .map(|d| op.map_or(d.size, |o| d.get_real_size(&o)))\\n\\n });\\n\\n [\\n\\n iter.next().unwrap_or(None),\\n\\n iter.next().unwrap_or(None),\\n\\n iter.next().unwrap_or(None),\\n\\n iter.next().unwrap_or(None),\\n\\n ]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/instruction_def.rs\",\n \"rank\": 99,\n \"score\": 257634.85019219562\n }\n]","isConversational":false}}},{"rowIdx":790,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/parser.rs"},"repo_name":{"kind":"string","value":"opp11/chemtool2"},"commit":{"kind":"string","value":"d8cace048c5adf2ed61ab503534c287304a57644"},"file_code":{"kind":"string","value":"\n\nuse std::str::CharRange;\nuse elem::{PerElem, Molecule};\nuse error::{CTResult, CTError};\nuse error::CTErrorKind::InputError;\n\npub struct Parser {\n pos: usize,\n input: String,\n paren_level: u32,\n}\n\nimpl Parser {\n \n pub fn new(input: &str) -> Parser {\n Parser { pos: 0, input: String::from_str(input), paren_level: 0 }\n }\n\n \n \n \n pub fn is_done(&self) -> bool {\n self.input.chars().skip(self.pos).all(|ch| ch.is_whitespace())\n }\n\n \n \n \n \n \n pub fn parse_reaction(&mut self) -> CTResult<(Vec<Molecule>, Vec<Molecule>)> {\n let lhs = try!(self.parse_side());\n self.consume_whitespace();\n\n \n \n if self.pos + 2 >= self.input.len() || self.consume_char() != '-' ||\n self.consume_char() != '>' {\n return Err(CTError {\n kind: InputError,\n desc: \"Missing arrow (->) in chemical reaction\".to_string(),\n pos: Some((self.pos - 2, 1))\n });\n }\n self.consume_whitespace();\n\n let rhs = try!(self.parse_side());\n\n Ok((lhs, rhs))\n }\n\n \n \n \n \n \n pub fn parse_side(&mut self) -> CTResult<Vec<Molecule>> {\n let mut out = Vec::new();\n let molecule = try!(self.parse_molecule());\n out.push(molecule);\n self.consume_whitespace();\n\n if !self.eof() && self.peek_char() == '+' {\n self.consume_char();\n self.consume_whitespace();\n let mut rest = try!(self.parse_side());\n out.append(&mut rest);\n }\n\n Ok(out)\n }\n\n \n \n \n \n \n pub fn parse_molecule(&mut self) -> CTResult<Molecule> {\n let mut out = Vec::new();\n let mut per = try!(self.parse_periodic());\n out.append(&mut per);\n\n \n if !self.eof() && (self.peek_char().is_alphabetic() || self.peek_char() == '(') {\n let mut molecule = try!(self.parse_molecule());\n out.append(&mut molecule);\n }\n if !self.eof() && self.peek_char() == ')' && self.paren_level == 0 {\n Err(CTError {\n kind: InputError,\n desc: \"Missing opening parentheses\".to_string(),\n pos: Some((self.pos, 1))\n })\n } else if !self.eof() && !self.on_legal_char() {\n Err(CTError {\n kind: InputError,\n desc: \"Unexpected character\".to_string(),\n pos: Some((self.pos, 1))\n })\n } else {\n Ok(out)\n }\n }\n\n fn parse_periodic(&mut self) -> CTResult<Vec<PerElem>> {\n let mut elem = try!(self.parse_element());\n\n if !self.eof() && self.peek_char().is_numeric() {\n let coef = try!(self.parse_coefficient());\n for e in elem.iter_mut() {\n e.coef *= coef;\n }\n }\n\n Ok(elem)\n }\n\n fn parse_element(&mut self) -> CTResult<Vec<PerElem>> {\n if self.eof() {\n return Err(CTError {\n kind: InputError,\n desc: \"Found no periodic element\".to_string(),\n pos: Some((self.pos, 1))\n });\n }\n \n let start_pos = self.pos;\n let first = self.consume_char();\n if first == '(' {\n self.paren_level += 1;\n let molecule = try!(self.parse_molecule());\n if self.eof() || self.consume_char() != ')' {\n Err(CTError {\n kind: InputError,\n desc: \"Missing closing parentheses\".to_string(),\n pos: Some((self.pos - 1, 1))\n })\n } else {\n self.paren_level -= 1;\n Ok(molecule)\n }\n } else if first.is_uppercase() {\n let mut name = String::new();\n name.push(first);\n name.push_str(self.consume_while(|ch| ch.is_lowercase()).as_slice());\n let len = name.len();\n Ok(vec!(PerElem { name: name, coef: 1, pos: start_pos, len: len }))\n } else {\n Err(CTError {\n kind: InputError,\n desc: \"Missing uppercase letter at the beginning of the element\".to_string(),\n pos: Some((self.pos - 1, 1))\n })\n }\n }\n\n fn parse_coefficient(&mut self) -> CTResult<u32> {\n let start_pos = self.pos;\n let num_str = self.consume_while(|ch| ch.is_numeric());\n if let Ok(num) = num_str.parse::<u32>() {\n Ok(num)\n } else {\n Err(CTError {\n kind: InputError,\n desc: \"Could not parse coefficient\".to_string(),\n pos: Some((start_pos, num_str.len()))\n })\n }\n }\n\n fn peek_char(&self) -> char {\n self.input.char_at(self.pos)\n }\n\n fn consume_char(&mut self) -> char {\n let CharRange { ch, next } = self.input.char_range_at(self.pos);\n self.pos = next;\n ch\n }\n\n fn consume_while<F>(&mut self, pred: F) -> String where F: Fn(char) -> bool {\n let mut out = String::new();\n while !self.eof() && pred(self.peek_char()) {\n out.push(self.consume_char());\n }\n out\n }\n\n fn consume_whitespace(&mut self) {\n self.consume_while(|ch| ch.is_whitespace());\n }\n\n fn eof(&mut self) -> bool {\n self.pos >= self.input.len()\n }\n\n fn on_legal_char(&self) -> bool {\n match self.peek_char() {\n ch if ch.is_alphanumeric() => true,\n '+' | '-' | '>' | '(' | ')' | ' ' => true,\n _ => false,\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n use elem::PerElem;\n\n macro_rules! check_raw_result(\n ($raw:expr, $expected:expr) => (\n if let Ok(result) = $raw {\n assert_eq!(result, $expected);\n } else {\n panic!($raw);\n }\n )\n );\n\n #[test]\n fn elems() {\n let mut parser = Parser::new(\"CHeH\");\n let raw_result = parser.parse_molecule();\n let expected = vec!(PerElem { name: \"C\".to_string(), coef: 1, pos: 0, len: 1 },\n PerElem { name: \"He\".to_string(), coef: 1, pos: 1, len: 2 },\n PerElem { name: \"H\".to_string(), coef: 1, pos: 3, len: 1 });\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn coefs() {\n let mut parser = Parser::new(\"C23\");\n let raw_result = parser.parse_molecule();\n let expected = vec!(PerElem { name: \"C\".to_string(), coef: 23, pos: 0, len: 1 });\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn parens() {\n let mut parser = Parser::new(\"(CH3)2\");\n let raw_result = parser.parse_molecule();\n let expected = vec!(PerElem { name: \"C\".to_string(), coef: 2, pos: 1, len: 1 },\n PerElem { name: \"H\".to_string(), coef: 6, pos: 2, len: 1 });\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn multiple_elems() {\n let mut parser = Parser::new(\"C + H\");\n let raw_result = parser.parse_side();\n let expected = vec!(vec!(PerElem { name: \"C\".to_string(), coef: 1, pos: 0, len: 1 }),\n vec!(PerElem { name: \"H\".to_string(), coef: 1, pos: 4, len: 1 }));\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn reaction() {\n let mut parser = Parser::new(\"C -> H\");\n let raw_result = parser.parse_reaction();\n let expected = (vec!(vec!(PerElem { name: \"C\".to_string(), coef: 1, pos: 0, len: 1 })),\n vec!(vec!(PerElem { name: \"H\".to_string(), coef: 1, pos: 5, len: 1 })));\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn empty() {\n let mut parser = Parser::new(\"\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn no_uppercase() {\n let mut parser = Parser::new(\"c\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn missing_close_paren() {\n let mut parser = Parser::new(\"(C\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn missing_open_paren() {\n let mut parser = Parser::new(\"C)\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn invald_char() {\n let mut parser = Parser::new(\"%\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn is_done() {\n let parser = Parser::new(\" \");\n assert!(parser.is_done());\n }\n\n #[test]\n fn not_done() {\n let parser = Parser::new(\" C\");\n assert!(!parser.is_done());\n }\n\n #[test]\n fn invald_num() {\n let mut parser = Parser::new(\"C999999999999999999999\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn dangling_plus() {\n let mut parser = Parser::new(\"C + -> H\");\n assert!(parser.parse_reaction().is_err());\n }\n}"},"prefix":{"kind":"string","value":"\n\nuse std::str::CharRange;\nuse elem::{PerElem, Molecule};\nuse error::{CTResult, CTError};\nuse error::CTErrorKind::InputError;\n\npub struct Parser {\n pos: usize,\n input: String,\n paren_level: u32,\n}\n\nimpl Parser {\n \n pub fn new(input: &str) -> Parser {\n Parser { pos: 0, input: String::from_str(input), paren_level: 0 }\n }\n\n \n \n \n pub fn is_done(&self) -> bool {\n self.input.chars().skip(self.pos).all(|ch| ch.is_whitespace())\n }\n\n \n \n \n \n \n pub fn parse_reaction(&mut self) -> CTResult<(Vec<Molecule>, Vec<Molecule>)> {\n let lhs = try!(self.parse_side());\n self.consume_whitespace();\n\n \n \n if self.pos + 2 >= self.input.len() || self.consume_char() != '-' ||\n self.consume_char() != '>' {\n return Err(CTError {\n kind: InputError,\n desc: \"Missing arrow (->) in chemical reaction\".to_string(),\n pos: Some((self.pos - 2, 1))\n });\n }\n self.consume_whitespace();\n\n let rhs = try!(self.parse_side());\n\n Ok((lhs, rhs))\n }\n\n \n \n \n \n \n pub fn parse_side(&mut self) -> CTResult<Vec<Molecule>> {\n let mut out = Vec::new();\n let molecule = try!(self.parse_molecule());\n out.push(molecule);\n self.consume_whitespace();\n\n if !self.eof() && self.peek_char() == '+' {\n self.consume_char();\n self.consume_whitespace();\n let mut rest = try!(self.parse_side());\n out.append(&mut rest);\n }\n\n Ok(out)\n }\n\n \n \n \n \n \n pub fn parse_molecule(&mut self) -> CTResult<Molecule> {\n let mut out = Vec::new();\n let mut per = try!(self.parse_periodic());\n out.append(&mut per);\n\n \n if !self.eof() && (self.peek_char().is_alphabetic() || self.peek_char() == '(') {\n let mut molecule = try!(self.parse_molecule());\n out.append(&mut molecule);\n }\n if !self.eof() && self.peek_char() == ')' && self.paren_level == 0 {\n Err(CTError {\n kind: InputError,\n desc: \"Missing opening parentheses\".to_string(),\n pos: Some((self.pos, 1))\n })\n } else if !self.eof() && !self.on_legal_char() {\n Err(CTError {\n kind: InputError,\n desc: \"Unexpected character\".to_string(),\n pos: Some((self.pos, 1))\n })\n } else {\n Ok(out)\n }\n }\n\n "},"suffix":{"kind":"string","value":"\n\n fn parse_element(&mut self) -> CTResult<Vec<PerElem>> {\n if self.eof() {\n return Err(CTError {\n kind: InputError,\n desc: \"Found no periodic element\".to_string(),\n pos: Some((self.pos, 1))\n });\n }\n \n let start_pos = self.pos;\n let first = self.consume_char();\n if first == '(' {\n self.paren_level += 1;\n let molecule = try!(self.parse_molecule());\n if self.eof() || self.consume_char() != ')' {\n Err(CTError {\n kind: InputError,\n desc: \"Missing closing parentheses\".to_string(),\n pos: Some((self.pos - 1, 1))\n })\n } else {\n self.paren_level -= 1;\n Ok(molecule)\n }\n } else if first.is_uppercase() {\n let mut name = String::new();\n name.push(first);\n name.push_str(self.consume_while(|ch| ch.is_lowercase()).as_slice());\n let len = name.len();\n Ok(vec!(PerElem { name: name, coef: 1, pos: start_pos, len: len }))\n } else {\n Err(CTError {\n kind: InputError,\n desc: \"Missing uppercase letter at the beginning of the element\".to_string(),\n pos: Some((self.pos - 1, 1))\n })\n }\n }\n\n fn parse_coefficient(&mut self) -> CTResult<u32> {\n let start_pos = self.pos;\n let num_str = self.consume_while(|ch| ch.is_numeric());\n if let Ok(num) = num_str.parse::<u32>() {\n Ok(num)\n } else {\n Err(CTError {\n kind: InputError,\n desc: \"Could not parse coefficient\".to_string(),\n pos: Some((start_pos, num_str.len()))\n })\n }\n }\n\n fn peek_char(&self) -> char {\n self.input.char_at(self.pos)\n }\n\n fn consume_char(&mut self) -> char {\n let CharRange { ch, next } = self.input.char_range_at(self.pos);\n self.pos = next;\n ch\n }\n\n fn consume_while<F>(&mut self, pred: F) -> String where F: Fn(char) -> bool {\n let mut out = String::new();\n while !self.eof() && pred(self.peek_char()) {\n out.push(self.consume_char());\n }\n out\n }\n\n fn consume_whitespace(&mut self) {\n self.consume_while(|ch| ch.is_whitespace());\n }\n\n fn eof(&mut self) -> bool {\n self.pos >= self.input.len()\n }\n\n fn on_legal_char(&self) -> bool {\n match self.peek_char() {\n ch if ch.is_alphanumeric() => true,\n '+' | '-' | '>' | '(' | ')' | ' ' => true,\n _ => false,\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n use elem::PerElem;\n\n macro_rules! check_raw_result(\n ($raw:expr, $expected:expr) => (\n if let Ok(result) = $raw {\n assert_eq!(result, $expected);\n } else {\n panic!($raw);\n }\n )\n );\n\n #[test]\n fn elems() {\n let mut parser = Parser::new(\"CHeH\");\n let raw_result = parser.parse_molecule();\n let expected = vec!(PerElem { name: \"C\".to_string(), coef: 1, pos: 0, len: 1 },\n PerElem { name: \"He\".to_string(), coef: 1, pos: 1, len: 2 },\n PerElem { name: \"H\".to_string(), coef: 1, pos: 3, len: 1 });\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn coefs() {\n let mut parser = Parser::new(\"C23\");\n let raw_result = parser.parse_molecule();\n let expected = vec!(PerElem { name: \"C\".to_string(), coef: 23, pos: 0, len: 1 });\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn parens() {\n let mut parser = Parser::new(\"(CH3)2\");\n let raw_result = parser.parse_molecule();\n let expected = vec!(PerElem { name: \"C\".to_string(), coef: 2, pos: 1, len: 1 },\n PerElem { name: \"H\".to_string(), coef: 6, pos: 2, len: 1 });\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn multiple_elems() {\n let mut parser = Parser::new(\"C + H\");\n let raw_result = parser.parse_side();\n let expected = vec!(vec!(PerElem { name: \"C\".to_string(), coef: 1, pos: 0, len: 1 }),\n vec!(PerElem { name: \"H\".to_string(), coef: 1, pos: 4, len: 1 }));\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn reaction() {\n let mut parser = Parser::new(\"C -> H\");\n let raw_result = parser.parse_reaction();\n let expected = (vec!(vec!(PerElem { name: \"C\".to_string(), coef: 1, pos: 0, len: 1 })),\n vec!(vec!(PerElem { name: \"H\".to_string(), coef: 1, pos: 5, len: 1 })));\n check_raw_result!(raw_result, expected);\n }\n\n #[test]\n fn empty() {\n let mut parser = Parser::new(\"\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn no_uppercase() {\n let mut parser = Parser::new(\"c\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn missing_close_paren() {\n let mut parser = Parser::new(\"(C\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn missing_open_paren() {\n let mut parser = Parser::new(\"C)\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn invald_char() {\n let mut parser = Parser::new(\"%\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn is_done() {\n let parser = Parser::new(\" \");\n assert!(parser.is_done());\n }\n\n #[test]\n fn not_done() {\n let parser = Parser::new(\" C\");\n assert!(!parser.is_done());\n }\n\n #[test]\n fn invald_num() {\n let mut parser = Parser::new(\"C999999999999999999999\");\n assert!(parser.parse_molecule().is_err());\n assert!(parser.parse_reaction().is_err());\n }\n\n #[test]\n fn dangling_plus() {\n let mut parser = Parser::new(\"C + -> H\");\n assert!(parser.parse_reaction().is_err());\n }\n}"},"middle":{"kind":"string","value":"fn parse_periodic(&mut self) -> CTResult<Vec<PerElem>> {\n let mut elem = try!(self.parse_element());\n\n if !self.eof() && self.peek_char().is_numeric() {\n let coef = try!(self.parse_coefficient());\n for e in elem.iter_mut() {\n e.coef *= coef;\n }\n }\n\n Ok(elem)\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// Sorts the PerElems and groups those with the same name field.\n\n///\n\n/// Grouping of two (or more) PerElems means adding the coef field of the\n\n/// duplicate to the one already found, and then throwing away the duplicate.\n\n/// E.g. CH3CH3 would turn into C2H6.\n\npub fn group_elems(mut molecule: Molecule) -> Molecule {\n\n let mut out = Vec::<PerElem>::new();\n\n molecule.as_mut_slice().sort_by(|a, b| a.name.cmp(&b.name));\n\n // since the elements are now sorted, if the current elem does not match the\n\n // last element in out (i.e. what we previously pushed), then it won't match\n\n // anything in out\n\n for elem in molecule.into_iter() {\n\n if out.last().and_then(|e| Some(e.name == elem.name)).unwrap_or(false) {\n\n out.last_mut().unwrap().coef += elem.coef;\n\n } else {\n\n out.push(elem);\n\n }\n\n }\n\n out\n\n}\n\n\n\nimpl Display for Molecule {\n\n fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error> {\n\n for elem in self.iter() {\n\n try!(fmt.write_str(elem.name.as_slice()));\n","file_path":"src/elem.rs","rank":0,"score":104045.51824357468},{"content":"/// Balances a chemical reaction using Gaussian elimination and returns the coefficients\n\n///\n\n/// The balancer finds the coefficients needed to balance the reaction by treating the reaction as\n\n/// a system of linear equations and then solving the system with Gaussian elimination.\n\n/// The transformation to an equation system (represented as a matrix `R`) is as follows:\n\n/// * Each column corresponds to a molecule\n\n/// * Each row corresponds to a periodic element.\n\n/// * The number at `R[i,j]` is the amount of periocic element `i` in molecule `j`.\n\n/// * Numbers from molecules on the right hand side of the equation will be negative.\n\n/// Thus we can now solve the system to find a linear combination of the columns which will result\n\n/// in a zero-vector, and then read the coefficients from the solution.\n\npub fn balance_reaction(reaction: &(Vec<Molecule>, Vec<Molecule>)) -> CTResult<Vec<u32>> {\n\n let reac_mat = Matrix::from_reaction(reaction);\n\n let reduced_mat = try!(forward_elim(reac_mat));\n\n let coefs = back_substitute(&reduced_mat);\n\n\n\n // if any of the coefs are 0, then an element in that molecule is missing on the other side\n\n // of the reaction\n\n if let Some(pos) = coefs.iter().position(|&c| c == 0.0) {\n\n let &(ref lhs, ref rhs) = reaction;\n\n let molecule = lhs.iter().chain(rhs.iter()).nth(pos).unwrap();\n\n let begin = molecule.first().unwrap().pos;\n\n let len = molecule.last().unwrap().pos + molecule.last().unwrap().len - begin;\n\n return Err(CTError {\n\n kind: InputError,\n\n desc: format!(\"An element in {} is missing on the other side of the reaction\",\n\n molecule),\n\n pos: Some((begin, len)),\n\n })\n\n }\n\n\n","file_path":"src/balance.rs","rank":1,"score":83276.06645612928},{"content":"/// Takes a parsed reaction and pretty prints it to the console\n\n///\n\n/// The reaction is printed as follows:\n\n/// <coef> <molecule> + <coef> <molecule> + ... -> <coef> <molecule> + <coef> <molecule> + ...\n\npub fn pretty_print_balanced(reaction: &(Vec<Molecule>, Vec<Molecule>), coefs: &Vec<u32>) {\n\n let &(ref lhs, ref rhs) = reaction;\n\n print!(\"{} {}\", coefs[0], lhs[0]);\n\n for (coef, molecule) in coefs.iter().zip(lhs.iter()).skip(1) {\n\n print!(\" + {} {}\", coef, molecule);\n\n }\n\n print!(\" -> \");\n\n print!(\"{} {}\", coefs[lhs.len()], rhs[0]);\n\n for (coef, molecule) in coefs.iter().skip(lhs.len()).zip(rhs.iter()).skip(1) {\n\n print!(\" + {} {}\", coef, molecule);\n\n }\n\n println!(\"\");\n\n}\n\n\n","file_path":"src/balance.rs","rank":2,"score":83272.94974426995},{"content":"/// Takes a parsed checmical formula containing a single molecule, and pretty print the mass\n\n///\n\n/// The function will print the molar mass (and some other data) for each element\n\n/// in the given molecule, as well as the total molar mass.\n\npub fn pretty_print_data(elem_data: &Vec<ElemData>, molecule: &Molecule) {\n\n let total = elem_data.iter()\n\n .zip(molecule.iter())\n\n .fold(0f64, |t, (ref data, ref elem)| t + data.mass * elem.coef as f64);\n\n\n\n println!(\"abbrv. amt. M name Z\");\n\n println!(\"------------------------------------------------------\");\n\n for (data, elem) in elem_data.iter().zip(molecule.iter()) {\n\n println!(\"{: <3} {: >10} {: >12} {: ^12} {: >3}\",\n\n data.short_name,\n\n elem.coef,\n\n // extra format, since println! does not right-align the number\n\n // when we specify the precision\n\n format!(\"{:3.8}\", data.mass),\n\n data.long_name,\n\n data.atomic_num);\n\n }\n\n println!(\"Total: {}\", total);\n\n}","file_path":"src/mass.rs","rank":3,"score":63571.748416007904},{"content":"fn balance_cmd(args: &[String]) -> CTResult<()> {\n\n if args.len() < 1 {\n\n Err(CTError {\n\n kind: UsageError,\n\n desc: \"Missing reaction.\".to_string(),\n\n pos: None,\n\n })\n\n } else if args.len() > 1 {\n\n Err(CTError {\n\n kind: UsageError,\n\n desc: \"Too many arguments.\".to_string(),\n\n pos: None,\n\n })\n\n } else {\n\n let input = args[0].as_slice();\n\n let mut parser = Parser::new(input);\n\n let reaction = try!(parser.parse_reaction());\n\n let coefs = try!(balance::balance_reaction(&reaction));\n\n balance::pretty_print_balanced(&reaction, &coefs);\n\n Ok(())\n\n }\n\n}","file_path":"src/main.rs","rank":4,"score":52513.585164017175},{"content":"fn decode_line(line: &String) -> CTResult<ElemData> {\n\n let data: Vec<&str> = line.trim().split(';').collect();\n\n if data.len() < 4 {\n\n Err(CTError {\n\n kind: DatabaseError,\n\n desc: \"Missing field in database\".to_string(),\n\n pos: None\n\n })\n\n } else {\n\n let mass = data[1].parse::<f64>();\n\n let atomic_num = data[3].parse::<u16>();\n\n if let (Ok(m), Ok(an)) = (mass, atomic_num) {\n\n Ok(ElemData {\n\n short_name: data[0].to_string(),\n\n long_name: data[2].to_string(),\n\n mass: m,\n\n atomic_num: an,\n\n })\n\n } else {\n\n Err(CTError {\n","file_path":"src/database.rs","rank":5,"score":48616.94654597474},{"content":"fn forward_elim(mut mat: Matrix) -> CTResult<Matrix> {\n\n for k in 0..min(mat.width(), mat.height()) {\n\n // locate the pivot\n\n let pivot = column_abs_max_index(&mat[k..], k) + k;\n\n if mat[pivot][k] == 0_f64 {\n\n return Err(CTError {\n\n kind: InputError,\n\n desc: \"Could not balance reaction\".to_string(),\n\n pos: None,\n\n })\n\n }\n\n // move the pivot to its new position\n\n mat.switch_rows(k, pivot);\n\n\n\n // zero out the rest of the column\n\n for i in k + 1..mat.height() {\n\n let mult = -(mat[i][k] / mat[k][k]);\n\n mat.add_row_to_row(i, k, mult);\n\n }\n\n }\n\n Ok(mat)\n\n}\n\n\n","file_path":"src/balance.rs","rank":6,"score":48152.16421697447},{"content":"fn mass_cmd(args: &[String], db_path: &Path) -> CTResult<()> {\n\n if args.len() < 1 {\n\n Err(CTError {\n\n kind: UsageError,\n\n desc: \"Missing formula.\".to_string(),\n\n pos: None,\n\n })\n\n } else if args.len() > 1 {\n\n Err(CTError {\n\n kind: UsageError,\n\n desc: \"Too many arguments.\".to_string(),\n\n pos: None,\n\n })\n\n } else {\n\n let input = args[0].as_slice();\n\n let mut parser = Parser::new(input);\n\n let molecule = try!(parser.parse_molecule());\n\n if !parser.is_done() {\n\n // since there should be no whitespace in a molecule, the only way for parser to have\n\n // returned sucess while not being done, is if there was some whitespace,\n","file_path":"src/main.rs","rank":7,"score":46414.74614936941},{"content":"fn column_abs_max_index(columns: &[Vec<f64>], column: usize) -> usize {\n\n let mut max = 0;\n\n for i in 1..columns.len() {\n\n if columns[i][column].abs() > columns[max][column].abs() {\n\n max = i;\n\n }\n\n }\n\n max\n\n}\n\n\n","file_path":"src/balance.rs","rank":8,"score":40596.67718275641},{"content":"#[derive(Debug, PartialEq)]\n\nstruct Matrix {\n\n buf: Vec<Vec<f64>>,\n\n height: usize,\n\n width: usize,\n\n}\n\n\n\nimpl Matrix {\n\n fn from_reaction(reaction: &(Vec<Molecule>, Vec<Molecule>)) -> Matrix {\n\n let &(ref lhs, ref rhs) = reaction;\n\n let lhs: Vec<Molecule> = lhs.clone().into_iter().map(|m| elem::group_elems(m)).collect();\n\n let rhs: Vec<Molecule> = rhs.clone().into_iter().map(|m| elem::group_elems(m)).collect();\n\n let mut names = Vec::<&str>::new();\n\n // gather up all the element names in the reaction so we now how many rows will be needed\n\n for molecule in lhs.iter().chain(rhs.iter()) {\n\n for elem in molecule.iter() {\n\n if names.iter().find(|e| **e == elem.name).is_none() {\n\n names.push(elem.name.as_slice());\n\n }\n\n }\n\n }\n","file_path":"src/balance.rs","rank":9,"score":39347.42583280171},{"content":"#[cfg(not(test))]\n\nfn main() {\n\n let args: Vec<String> = env::args().collect();\n\n let mut opts = Options::new();\n\n opts.optflag(\"h\", \"help\", \"Display this message and then exit.\");\n\n opts.optflag(\"v\", \"version\", \"Display the version number and then exit.\");\n\n opts.optopt(\"\", \"db-path\", \"Explicitly specify the path to the database file.\", \"PATH\");\n\n let given_opts = match opts.parse(args.tail()) {\n\n Ok(go) => go,\n\n Err(msg) => {\n\n println!(\"{}\", msg.to_string());\n\n println!(\"{}\", opts.usage(USAGE));\n\n return;\n\n },\n\n };\n\n if given_opts.opt_present(\"help\") {\n\n println!(\"{}\", opts.usage(USAGE));\n\n } else if given_opts.opt_present(\"version\") {\n\n println!(\"{}\", VERSION);\n\n } else {\n\n let path = if let Some(path) = given_opts.opt_str(\"db-path\") {\n","file_path":"src/main.rs","rank":10,"score":28696.94537207866},{"content":"fn back_substitute(mat: &Matrix) -> Vec<f64> {\n\n let mut vars = Vec::with_capacity(mat.width());\n\n for k in (0..mat.width()).rev() {\n\n if k >= mat.height() {\n\n // if this coef does not have a corresponding row in the matrix, then treat is as a\n\n // free variable and set it to 1\n\n vars.push(1_f64);\n\n } else {\n\n let mut var = 0f64;\n\n for i in k + 1..mat.width() {\n\n var -= mat[k][i] * vars[mat.width() - 1 - i];\n\n }\n\n vars.push(var / mat[k][k]);\n\n }\n\n }\n\n vars\n\n}\n\n\n","file_path":"src/balance.rs","rank":11,"score":22139.044317184558},{"content":"#[derive(Debug, PartialEq)]\n\npub struct CTError {\n\n pub kind: CTErrorKind,\n\n pub desc: String,\n\n pub pos: Option<(usize, usize)>,\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\npub enum CTErrorKind {\n\n InputError,\n\n DatabaseError,\n\n UsageError,\n\n}\n\n\n\npub type CTResult<T> = Result<T, CTError>;\n\n\n\nimpl CTError {\n\n /// Pretty-prints the CTError struct to stdout\n\n pub fn print(&self, extra_desc: Option<&String>) {\n\n println!(\"{}\", self.desc);\n","file_path":"src/error.rs","rank":29,"score":14.450088556232998},{"content":"use std::old_io::File;\n\nuse std::old_io::SeekStyle::SeekSet;\n\nuse std::old_io::IoErrorKind::EndOfFile;\n\nuse elem::{PerElem, Molecule};\n\nuse error::{CTError, CTResult};\n\nuse error::CTErrorKind::{InputError, DatabaseError};\n\n\n\nmacro_rules! read_err (\n\n () => (Err(CTError {\n\n kind: DatabaseError,\n\n desc: \"Error reading the database\".to_string(),\n\n pos: None\n\n }));\n\n);\n\n\n\n#[derive(Debug, PartialEq)]\n\npub struct ElemData {\n\n pub short_name: String,\n\n pub long_name: String,\n\n pub mass: f64,\n","file_path":"src/database.rs","rank":30,"score":13.761954833085055},{"content":"use std::fmt::{Display, Formatter, Error};\n\n\n\n#[derive(Debug, PartialEq, Clone)]\n\npub struct PerElem {\n\n pub name: String,\n\n pub coef: u32,\n\n pub pos: usize,\n\n pub len: usize,\n\n}\n\n\n\npub type Molecule = Vec<PerElem>;\n\n\n\n/// Sorts the PerElems and groups those with the same name field.\n\n///\n\n/// Grouping of two (or more) PerElems means adding the coef field of the\n\n/// duplicate to the one already found, and then throwing away the duplicate.\n\n/// E.g. CH3CH3 would turn into C2H6.\n","file_path":"src/elem.rs","rank":31,"score":12.957087093267798},{"content":" // followed by more (illegal) input\n\n return Err(CTError {\n\n kind: InputError,\n\n desc: \"A molecule must not contain whitespace\".to_string(),\n\n pos: None,\n\n })\n\n }\n\n\n\n let molecule = elem::group_elems(molecule);\n\n let mut database = try!(ElemDatabase::open(db_path));\n\n let data = try!(database.get_data(&molecule));\n\n mass::pretty_print_data(&data, &molecule);\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"src/main.rs","rank":32,"score":12.711802267688453},{"content":" kind: DatabaseError,\n\n desc: \"Field in database corrupted\".to_string(),\n\n pos: None,\n\n })\n\n }\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use std::old_io::File;\n\n use std::old_io::fs;\n\n use elem::PerElem;\n\n\n\n fn make_dummy_db(name: &str, contents: &str) -> ElemDatabase {\n\n if let Err(e) = File::create(&Path::new(name)).and_then(|mut f| f.write_str(contents)) {\n\n // if we can't make the database we can't test, so just abort here\n\n panic!(\"Could not create dummy database: {:?}\", e.desc);\n","file_path":"src/database.rs","rank":33,"score":12.078013280550818},{"content":" pub atomic_num: u16,\n\n}\n\n\n\npub struct ElemDatabase {\n\n db: File,\n\n}\n\n\n\nimpl ElemDatabase {\n\n /// Try to make the database with the file at the given oath\n\n pub fn open(path: &Path) -> CTResult<ElemDatabase> {\n\n match File::open(path) {\n\n Ok(db_file) => Ok(ElemDatabase { db: db_file }),\n\n Err(_) => Err(CTError {\n\n kind: DatabaseError,\n\n desc: format!(\"Could not open database file. Expected at: {:?}\",\n\n path.as_str().unwrap_or(\"same directory as the program\")),\n\n pos: None,\n\n }),\n\n }\n\n }\n","file_path":"src/database.rs","rank":34,"score":10.45418003554244},{"content":"use std::f64;\n\nuse std::cmp::min;\n\nuse std::num::Float;\n\nuse std::ops::{Index, IndexMut, Range, RangeTo, RangeFrom, RangeFull};\n\nuse elem;\n\nuse elem::Molecule;\n\nuse error::{CTResult, CTError};\n\nuse error::CTErrorKind::InputError;\n\n\n\nmacro_rules! impl_matrix_index {\n\n ($idx:ty, $out:ty) => {\n\n impl Index<$idx> for Matrix {\n\n type Output = $out;\n\n\n\n fn index(&self, index: &$idx) -> &$out {\n\n &self.buf[*index]\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/balance.rs","rank":35,"score":10.315971870152207},{"content":" }\n\n }\n\n\n\n fn read_line(&mut self, elem: &PerElem) -> CTResult<String> {\n\n // we know that no line in the database is more than 30 characters long\n\n let mut buf = Vec::with_capacity(30);\n\n loop {\n\n match self.db.read_byte() {\n\n Ok(b) if b == b'\\n' => break,\n\n Ok(b) => buf.push(b),\n\n Err(ref e) if e.kind == EndOfFile => return Err(CTError {\n\n kind: InputError,\n\n desc: format!(\"Could not find element: {:?}\", elem.name),\n\n pos: Some((elem.pos, elem.len)),\n\n }),\n\n Err(_) => return read_err!()\n\n }\n\n }\n\n String::from_utf8(buf).or_else(|_| read_err!())\n\n }\n\n}\n\n\n","file_path":"src/database.rs","rank":36,"score":9.460561122799398},{"content":" }\n\n } else {\n\n Err(CTError {\n\n kind: UsageError,\n\n desc: \"Missing command.\".to_string(),\n\n pos: None,\n\n })\n\n };\n\n\n\n match cmd_result {\n\n Err(ref e) if e.kind == InputError => e.print(Some(&args[2])),\n\n Err(ref e) if e.kind == UsageError => e.print(Some(&opts.usage(USAGE))),\n\n Err(ref e) => e.print(None),\n\n _ => ()\n\n }\n\n }\n\n}\n\n\n","file_path":"src/main.rs","rank":37,"score":9.387167225002568},{"content":"#![allow(unused_features)] // so we can still feature(os) when testing\n\n#![feature(collections, path, io, core, os, plugin, env)]\n\nextern crate getopts;\n\n\n\nuse getopts::Options;\n\nuse std::env;\n\nuse parser::Parser;\n\nuse database::ElemDatabase;\n\nuse error::{CTResult, CTError};\n\nuse error::CTErrorKind::{InputError, UsageError};\n\n\n\nmod elem;\n\nmod parser;\n\nmod error;\n\nmod database;\n\nmod mass;\n\nmod balance;\n\n\n\nconst USAGE: &'static str = \"\\\n\nUsage:\n\n chemtool mass <formula> [options]\n\n chemtool balance <reaction> [options]\n\n chemtool [-h | --help]\n\n chemtool [-v | --version]\";\n\n\n\nconst VERSION: &'static str = \"chemtool 0.4.1\";\n\n\n\n#[cfg(not(test))]\n","file_path":"src/main.rs","rank":38,"score":8.915123087230038},{"content":" }\n\n\n\n fn height(&self) -> usize {\n\n self.height\n\n }\n\n}\n\n\n\nimpl_matrix_index!(usize, Vec<f64>);\n\nimpl_matrix_index!(Range<usize>, [Vec<f64>]);\n\nimpl_matrix_index!(RangeTo<usize>, [Vec<f64>]);\n\nimpl_matrix_index!(RangeFrom<usize>, [Vec<f64>]);\n\nimpl_matrix_index!(RangeFull, [Vec<f64>]);\n\n\n\nimpl_matrix_index_mut!(usize, Vec<f64>);\n\nimpl_matrix_index_mut!(Range<usize>, [Vec<f64>]);\n\nimpl_matrix_index_mut!(RangeTo<usize>, [Vec<f64>]);\n\nimpl_matrix_index_mut!(RangeFrom<usize>, [Vec<f64>]);\n\nimpl_matrix_index_mut!(RangeFull, [Vec<f64>]);\n\n\n\n#[cfg(test)]\n","file_path":"src/balance.rs","rank":39,"score":8.674258985117358},{"content":" }\n\n ElemDatabase::open(&Path::new(name)).unwrap()\n\n }\n\n\n\n fn remove_dummy_db(name: &str) {\n\n if let Err(e) = fs::unlink(&Path::new(name)) {\n\n // if we can't remove the database something is wrong, and we abort the test\n\n panic!(\"Could not remove dummy database: {:?}\", e.desc);\n\n }\n\n }\n\n\n\n #[test]\n\n fn multiple_elems() {\n\n let db_name = \"multiple_elems_db\";\n\n let mut db = make_dummy_db(db_name,\n\n \"A;1;Abba;2\\n\\\n\n B;3;Beta;4\\n\");\n\n let raw_result = db.get_data(&vec!(\n\n PerElem { name: \"B\".to_string(), coef: 1, pos: 0, len: 1 },\n\n PerElem { name: \"A\".to_string(), coef: 1, pos: 1, len: 1 }\n","file_path":"src/database.rs","rank":40,"score":8.475486315377267},{"content":"mod test {\n\n use super::*;\n\n use elem::PerElem;\n\n use error::CTErrorKind::InputError;\n\n\n\n macro_rules! dummy_elem(\n\n ($name:expr) => (\n\n PerElem { name: $name.to_string(), coef: 1, pos: 0, len: 1 }\n\n );\n\n ($name:expr, $coef:expr) => (\n\n PerElem { name: $name.to_string(), coef: $coef, pos: 0, len: 1 }\n\n );\n\n );\n\n\n\n #[test]\n\n fn balance() {\n\n // attempt to balance C3H8 + O2 -> CO2 + H2O\n\n let reaction = (vec!(vec!(dummy_elem!(\"C\", 3), dummy_elem!(\"H\", 8)),\n\n vec!(dummy_elem!(\"O\", 2))),\n\n vec!(vec!(dummy_elem!(\"C\", 1), dummy_elem!(\"O\", 2)),\n","file_path":"src/balance.rs","rank":41,"score":8.294518606279308},{"content":" fn missing_elem() {\n\n let db_name = \"missing_elem_db\";\n\n let mut db = make_dummy_db(db_name, \"A;123.456789;Abba;12\\n\");\n\n let result = db.get_single_data(\n\n &PerElem { name: \"B\".to_string(), coef: 1, pos: 0, len: 2 }\n\n );\n\n remove_dummy_db(db_name);\n\n assert!(result.is_err());\n\n }\n\n\n\n #[test]\n\n fn missing_field() {\n\n let db_name = \"missing_field_db\";\n\n let mut db = make_dummy_db(db_name, \"A;\");\n\n let result = db.get_single_data(\n\n &PerElem { name: \"A\".to_string(), coef: 1, pos: 0, len: 2 }\n\n );\n\n remove_dummy_db(db_name);\n\n assert!(result.is_err());\n\n }\n","file_path":"src/database.rs","rank":42,"score":7.719950513808952},{"content":"\n\nmacro_rules! impl_matrix_index_mut {\n\n ($idx:ty, $out:ty) => {\n\n impl IndexMut<$idx> for Matrix {\n\n fn index_mut(&mut self, index: &$idx) -> &mut $out {\n\n &mut self.buf[*index]\n\n }\n\n }\n\n }\n\n}\n\n\n\n/// Takes a parsed reaction and pretty prints it to the console\n\n///\n\n/// The reaction is printed as follows:\n\n/// <coef> <molecule> + <coef> <molecule> + ... -> <coef> <molecule> + <coef> <molecule> + ...\n","file_path":"src/balance.rs","rank":43,"score":7.717639792674559},{"content":" // TODO: Use a proper conversion function -- if it exists\n\n if elem.coef > 1 {\n\n try!(fmt.write_str(format!(\"{}\", elem.coef).as_slice()));\n\n }\n\n }\n\n Ok(())\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n\n\n macro_rules! dummy_elem(\n\n ($name:expr) => (\n\n PerElem { name: $name.to_string(), coef: 1, pos: 0, len: 1 }\n\n );\n\n ($name:expr, $coef:expr) => (\n\n PerElem { name: $name.to_string(), coef: $coef, pos: 0, len: 1 }\n\n );\n","file_path":"src/elem.rs","rank":44,"score":7.6614465389768265},{"content":" // some errors will have extra stuff to report to make the message clearer for the user\n\n match self.kind {\n\n CTErrorKind::InputError => {\n\n if let (Some((pos, len)), Some(input)) = (self.pos, extra_desc) {\n\n println!(\" {}\", input);\n\n print!(\" \");\n\n for _ in 0..pos {\n\n print!(\" \");\n\n }\n\n print!(\"^\");\n\n for _ in 1..len {\n\n print!(\"~\");\n\n }\n\n println!(\"\");\n\n }\n\n },\n\n CTErrorKind::UsageError => {\n\n if let Some(usage) = extra_desc {\n\n println!(\"{}\", usage);\n\n }\n\n }\n\n _ => (),\n\n }\n\n }\n\n}","file_path":"src/error.rs","rank":45,"score":7.344656327372801},{"content":" /// This function errors if one of the PerElem could not be found, or the\n\n /// database could not be read.\n\n pub fn get_data(&mut self, elems: &Molecule) -> CTResult<Vec<ElemData>> {\n\n let mut out = Vec::new();\n\n for elem in elems.iter() {\n\n match self.get_single_data(elem) {\n\n Ok(data) => out.push(data),\n\n Err(e) => return Err(e),\n\n }\n\n }\n\n Ok(out)\n\n }\n\n\n\n fn do_data_search(&mut self, elem: &PerElem) -> CTResult<ElemData> {\n\n loop {\n\n // TODO: make it so this function returns the 'not found' error\n\n let line = try!(self.read_line(elem));\n\n if line.starts_with(elem.name.as_slice()) {\n\n return decode_line(&line);\n\n }\n","file_path":"src/database.rs","rank":46,"score":6.365691206665867},{"content":" Path::new(path)\n\n } else {\n\n let mut path = Path::new(&args[0]);\n\n path.set_filename(\"elemdb.csv\");\n\n path\n\n };\n\n\n\n let cmd_result = if given_opts.free.len() > 0 {\n\n let cmd = &given_opts.free[0];\n\n let args = given_opts.free.tail();\n\n match cmd.as_slice() {\n\n \"mass\" => mass_cmd(&args, &path),\n\n \"balance\" => balance_cmd(&args),\n\n _ => {\n\n Err(CTError {\n\n kind: UsageError,\n\n desc: \"Invalid command\".to_string(),\n\n pos: None,\n\n })\n\n }\n","file_path":"src/main.rs","rank":47,"score":5.394206656335623},{"content":" Matrix {\n\n buf: buf,\n\n height: height,\n\n width: width,\n\n }\n\n }\n\n\n\n fn add_row_to_row(&mut self, dest: usize, row: usize, mult: f64) {\n\n for i in 0..self.width {\n\n let incr = self.buf[row][i] * mult;\n\n self.buf[dest][i] += incr;\n\n }\n\n }\n\n\n\n fn switch_rows(&mut self, row1: usize, row2: usize) {\n\n self.buf.swap(row1, row2);\n\n }\n\n\n\n fn width(&self) -> usize {\n\n self.width\n","file_path":"src/balance.rs","rank":48,"score":5.186724902788182},{"content":"use elem::Molecule;\n\nuse database::ElemData;\n\n\n\n/// Takes a parsed checmical formula containing a single molecule, and pretty print the mass\n\n///\n\n/// The function will print the molar mass (and some other data) for each element\n\n/// in the given molecule, as well as the total molar mass.\n","file_path":"src/mass.rs","rank":49,"score":5.027739948448879},{"content":"\n\n #[test]\n\n fn field_corrupted() {\n\n let db_name = \"field_corrupted_db\";\n\n let mut db = make_dummy_db(db_name, \"A;not a number;Abba;12\\n\");\n\n let result = db.get_single_data(\n\n &PerElem { name: \"A\".to_string(), coef: 1, pos: 0, len: 2 }\n\n );\n\n remove_dummy_db(db_name);\n\n assert!(result.is_err());\n\n }\n\n}","file_path":"src/database.rs","rank":50,"score":4.696556777466402},{"content":" fn find_elem() {\n\n let db_name = \"find_elem_db\";\n\n let mut db = make_dummy_db(db_name,\n\n \"A;0;Abba;0\\n\\\n\n B;123.456789;Beta;12\\n\\\n\n C;0;Coop;0\\n\");\n\n let raw_result = db.get_single_data(\n\n &PerElem { name: \"B\".to_string(), coef: 1, pos: 0, len: 2 }\n\n );\n\n let expected = ElemData {\n\n short_name: \"B\".to_string(),\n\n long_name: \"Beta\".to_string(),\n\n mass: 123.456789,\n\n atomic_num: 12,\n\n };\n\n remove_dummy_db(db_name);\n\n assert_eq!(Ok(expected), raw_result);\n\n }\n\n\n\n #[test]\n","file_path":"src/database.rs","rank":51,"score":4.686693238506054},{"content":"\n\n /// Try to get the data matching the given PerElem.\n\n ///\n\n /// This function errors if the PerElem could not be found, or the database\n\n /// could not be read.\n\n pub fn get_single_data(&mut self, elem: &PerElem) -> CTResult<ElemData> {\n\n // since the elements should be sorted before we get their data from the database\n\n // we should never have to seek back to the beginning of the file\n\n if let Ok(data) = self.do_data_search(elem) {\n\n Ok(data)\n\n } else {\n\n // but in case they weren't, we return to the beginning of the underlying file, since\n\n // the data might lie on a line we have previously read past\n\n self.db.seek(0, SeekSet).ok().expect(\"Internal error reading database\");\n\n self.do_data_search(elem)\n\n }\n\n }\n\n\n\n /// Try to get the data for all the provided PerElems.\n\n ///\n","file_path":"src/database.rs","rank":52,"score":4.523484499344601},{"content":" let mut buf = Vec::with_capacity(names.len());\n\n for name in names.iter() {\n\n let mut row = Vec::with_capacity(lhs.len() + rhs.len());\n\n for molecule in lhs.iter() {\n\n row.push(molecule.iter()\n\n .find(|e| e.name == *name)\n\n .and_then(|e| Some(e.coef as f64))\n\n .unwrap_or(0_f64));\n\n }\n\n // we loop over rhs seperately, since we need to multiply the coefs with -1\n\n for molecule in rhs.iter() {\n\n row.push(molecule.iter()\n\n .find(|e| e.name == *name)\n\n .and_then(|e| Some(-1.0*(e.coef as f64)))\n\n .unwrap_or(0_f64));\n\n }\n\n buf.push(row);\n\n }\n\n let height = names.len();\n\n let width = lhs.len() + rhs.len();\n","file_path":"src/balance.rs","rank":53,"score":4.060579309389319},{"content":" let reaction = (vec!(vec!(dummy_elem!(\"C\", 1)), vec!(dummy_elem!(\"H\", 1))),\n\n vec!(vec!(dummy_elem!(\"C\", 1)), vec!(dummy_elem!(\"H\", 1))));\n\n let result = balance_reaction(&reaction);\n\n let expected = Ok(vec!(1, 1, 1, 1));\n\n assert_eq!(result, expected);\n\n }\n\n\n\n #[test]\n\n fn missing_elem() {\n\n let reaction = (vec!(vec!(dummy_elem!(\"C\", 1)), vec!(dummy_elem!(\"H\", 1))),\n\n vec!(vec!(dummy_elem!(\"C\", 1))));\n\n let result = balance_reaction(&reaction);\n\n println!(\"{:?}\", result);\n\n assert!(result.is_err());\n\n assert_eq!(result.err().unwrap().kind, InputError);\n\n }\n\n}","file_path":"src/balance.rs","rank":54,"score":3.8215653885972123},{"content":"The MIT License (MIT)\n\n\n\nCopyright (c) 2015 Patrick M. Jensen, patmjen@gmail.com\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in\n\nall copies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n","file_path":"LICENSE.md","rank":55,"score":2.635241153406005},{"content":" ));\n\n let expected = vec!(\n\n ElemData {\n\n short_name: \"B\".to_string(),\n\n long_name: \"Beta\".to_string(),\n\n mass: 3.0,\n\n atomic_num: 4,\n\n },\n\n ElemData {\n\n short_name: \"A\".to_string(),\n\n long_name: \"Abba\".to_string(),\n\n mass: 1.0,\n\n atomic_num: 2,\n\n }\n\n );\n\n remove_dummy_db(db_name);\n\n assert_eq!(Ok(expected), raw_result);\n\n }\n\n\n\n #[test]\n","file_path":"src/database.rs","rank":56,"score":2.6292327787277356},{"content":"CHEMTOOL\n\n========\n\nA commandline utility for making chemistry a little less tedious.\n\n\n\nSo far the program is able to calculate the molar mass for a given molecule,\n\nor balance a given chemical reaction.\n\n\n\nExamples:\n\n---------\n\nTo get the total molar mass of the molecule `CH3CH2CH3` simply call chemtool as:\n\n```\n\nchemtool mass CH3CH2CH3\n\n```\n\nWhich should generate the following output:\n\n```\n\nabbrv. amt. M name Z\n\n------------------------------------------------------\n\nC 3 12.01070000 Carbon 6\n\nH 8 1.00794000 Hydrogen 1\n\nTotal: 44.09562\n\n```\n\nTo balance a reaction - e.g. `C3H8 + O2 -> CO2 + H2O` call:\n\n```\n\nchemtool balance 'C3H8 + O2 -> CO2 + H2O'\n\n```\n\nand the following should be displayed:\n\n```\n\n1 C3H8 + 5 O2 -> 3 CO2 + 4 H2O\n\n```\n\n\n\nUSAGE\n\n=====\n\n```\n\nUsage:\n\n chemtool mass <formula> [options]\n\n chemtool balance <reaction> [options]\n\n chemtool [-h | --help]\n\n chemtool [-v | --version]\n\n\n\nOptions:\n\n -h --help Display this message and then exit.\n\n -v --version Display the version number and then exit.\n\n --db-path PATH Explicitly specify the path to the database file.\n\n```\n\n\n\nInstalling and building\n\n=======================\n\nThe easiest way to compile the project is with the `cargo` program available\n\nfrom the rust website at:\n\nhttp://www.rust-lang.org/\n\n\n\nNavigate to the project directory and call:\n\n```\n\ncargo build --release\n\n```\n\nwhich will place the binary in the target directory. Then copy the element\n\ndatabase `elemdb.csv` to the same directory as the program binary (or use\n\n`--db-path` when invoking chemtool to specify the path yourself).\n\n\n\nTesting\n\n-------\n\nTo do a quick test of the program simply call:\n\n```\n\ncargo test\n","file_path":"README.md","rank":57,"score":2.622180927500654},{"content":" );\n\n\n\n #[test]\n\n fn group() {\n\n let result = group_elems(vec!(dummy_elem!(\"C\"), dummy_elem!(\"H\"), dummy_elem!(\"C\")));\n\n let expected = vec!(dummy_elem!(\"C\", 2), dummy_elem!(\"H\", 1));\n\n assert_eq!(result, expected);\n\n }\n\n\n\n #[test]\n\n fn molecule_display() {\n\n let molecule = vec!(dummy_elem!(\"C\", 2), dummy_elem!(\"H\", 3));\n\n let result = format!(\"{}\", molecule);\n\n let expected = \"C2H3\";\n\n assert_eq!(result, expected);\n\n }\n\n\n\n #[test]\n\n fn molecule_display_coefs() {\n\n let molecule = vec!(dummy_elem!(\"C\", 1), dummy_elem!(\"H\", 3));\n\n let result = format!(\"{}\", molecule);\n\n let expected = \"CH3\";\n\n assert_eq!(result, expected);\n\n }\n\n}","file_path":"src/elem.rs","rank":58,"score":2.568742435482663},{"content":" // we find the minimum element with fold, since f64 does not implement Ord...\n\n let min = coefs.iter().fold(f64::INFINITY, |crnt, &num| {\n\n if num < crnt {\n\n num\n\n } else {\n\n crnt\n\n }\n\n });\n\n // now we divide all elements by the minimum to (hopefully) convert them all to intergers\n\n // after which we do the actual conversion\n\n // we also reverse the Vec so the coefs are in the right order\n\n Ok(coefs.iter().rev().map(|n| (n / min) as u32).collect())\n\n}\n\n\n","file_path":"src/balance.rs","rank":59,"score":1.6482018268730045}],"string":"[\n {\n \"content\": \"/// Sorts the PerElems and groups those with the same name field.\\n\\n///\\n\\n/// Grouping of two (or more) PerElems means adding the coef field of the\\n\\n/// duplicate to the one already found, and then throwing away the duplicate.\\n\\n/// E.g. CH3CH3 would turn into C2H6.\\n\\npub fn group_elems(mut molecule: Molecule) -> Molecule {\\n\\n let mut out = Vec::<PerElem>::new();\\n\\n molecule.as_mut_slice().sort_by(|a, b| a.name.cmp(&b.name));\\n\\n // since the elements are now sorted, if the current elem does not match the\\n\\n // last element in out (i.e. what we previously pushed), then it won't match\\n\\n // anything in out\\n\\n for elem in molecule.into_iter() {\\n\\n if out.last().and_then(|e| Some(e.name == elem.name)).unwrap_or(false) {\\n\\n out.last_mut().unwrap().coef += elem.coef;\\n\\n } else {\\n\\n out.push(elem);\\n\\n }\\n\\n }\\n\\n out\\n\\n}\\n\\n\\n\\nimpl Display for Molecule {\\n\\n fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error> {\\n\\n for elem in self.iter() {\\n\\n try!(fmt.write_str(elem.name.as_slice()));\\n\",\n \"file_path\": \"src/elem.rs\",\n \"rank\": 0,\n \"score\": 104045.51824357468\n },\n {\n \"content\": \"/// Balances a chemical reaction using Gaussian elimination and returns the coefficients\\n\\n///\\n\\n/// The balancer finds the coefficients needed to balance the reaction by treating the reaction as\\n\\n/// a system of linear equations and then solving the system with Gaussian elimination.\\n\\n/// The transformation to an equation system (represented as a matrix `R`) is as follows:\\n\\n/// * Each column corresponds to a molecule\\n\\n/// * Each row corresponds to a periodic element.\\n\\n/// * The number at `R[i,j]` is the amount of periocic element `i` in molecule `j`.\\n\\n/// * Numbers from molecules on the right hand side of the equation will be negative.\\n\\n/// Thus we can now solve the system to find a linear combination of the columns which will result\\n\\n/// in a zero-vector, and then read the coefficients from the solution.\\n\\npub fn balance_reaction(reaction: &(Vec<Molecule>, Vec<Molecule>)) -> CTResult<Vec<u32>> {\\n\\n let reac_mat = Matrix::from_reaction(reaction);\\n\\n let reduced_mat = try!(forward_elim(reac_mat));\\n\\n let coefs = back_substitute(&reduced_mat);\\n\\n\\n\\n // if any of the coefs are 0, then an element in that molecule is missing on the other side\\n\\n // of the reaction\\n\\n if let Some(pos) = coefs.iter().position(|&c| c == 0.0) {\\n\\n let &(ref lhs, ref rhs) = reaction;\\n\\n let molecule = lhs.iter().chain(rhs.iter()).nth(pos).unwrap();\\n\\n let begin = molecule.first().unwrap().pos;\\n\\n let len = molecule.last().unwrap().pos + molecule.last().unwrap().len - begin;\\n\\n return Err(CTError {\\n\\n kind: InputError,\\n\\n desc: format!(\\\"An element in {} is missing on the other side of the reaction\\\",\\n\\n molecule),\\n\\n pos: Some((begin, len)),\\n\\n })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 1,\n \"score\": 83276.06645612928\n },\n {\n \"content\": \"/// Takes a parsed reaction and pretty prints it to the console\\n\\n///\\n\\n/// The reaction is printed as follows:\\n\\n/// <coef> <molecule> + <coef> <molecule> + ... -> <coef> <molecule> + <coef> <molecule> + ...\\n\\npub fn pretty_print_balanced(reaction: &(Vec<Molecule>, Vec<Molecule>), coefs: &Vec<u32>) {\\n\\n let &(ref lhs, ref rhs) = reaction;\\n\\n print!(\\\"{} {}\\\", coefs[0], lhs[0]);\\n\\n for (coef, molecule) in coefs.iter().zip(lhs.iter()).skip(1) {\\n\\n print!(\\\" + {} {}\\\", coef, molecule);\\n\\n }\\n\\n print!(\\\" -> \\\");\\n\\n print!(\\\"{} {}\\\", coefs[lhs.len()], rhs[0]);\\n\\n for (coef, molecule) in coefs.iter().skip(lhs.len()).zip(rhs.iter()).skip(1) {\\n\\n print!(\\\" + {} {}\\\", coef, molecule);\\n\\n }\\n\\n println!(\\\"\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 2,\n \"score\": 83272.94974426995\n },\n {\n \"content\": \"/// Takes a parsed checmical formula containing a single molecule, and pretty print the mass\\n\\n///\\n\\n/// The function will print the molar mass (and some other data) for each element\\n\\n/// in the given molecule, as well as the total molar mass.\\n\\npub fn pretty_print_data(elem_data: &Vec<ElemData>, molecule: &Molecule) {\\n\\n let total = elem_data.iter()\\n\\n .zip(molecule.iter())\\n\\n .fold(0f64, |t, (ref data, ref elem)| t + data.mass * elem.coef as f64);\\n\\n\\n\\n println!(\\\"abbrv. amt. M name Z\\\");\\n\\n println!(\\\"------------------------------------------------------\\\");\\n\\n for (data, elem) in elem_data.iter().zip(molecule.iter()) {\\n\\n println!(\\\"{: <3} {: >10} {: >12} {: ^12} {: >3}\\\",\\n\\n data.short_name,\\n\\n elem.coef,\\n\\n // extra format, since println! does not right-align the number\\n\\n // when we specify the precision\\n\\n format!(\\\"{:3.8}\\\", data.mass),\\n\\n data.long_name,\\n\\n data.atomic_num);\\n\\n }\\n\\n println!(\\\"Total: {}\\\", total);\\n\\n}\",\n \"file_path\": \"src/mass.rs\",\n \"rank\": 3,\n \"score\": 63571.748416007904\n },\n {\n \"content\": \"fn balance_cmd(args: &[String]) -> CTResult<()> {\\n\\n if args.len() < 1 {\\n\\n Err(CTError {\\n\\n kind: UsageError,\\n\\n desc: \\\"Missing reaction.\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n } else if args.len() > 1 {\\n\\n Err(CTError {\\n\\n kind: UsageError,\\n\\n desc: \\\"Too many arguments.\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n } else {\\n\\n let input = args[0].as_slice();\\n\\n let mut parser = Parser::new(input);\\n\\n let reaction = try!(parser.parse_reaction());\\n\\n let coefs = try!(balance::balance_reaction(&reaction));\\n\\n balance::pretty_print_balanced(&reaction, &coefs);\\n\\n Ok(())\\n\\n }\\n\\n}\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 4,\n \"score\": 52513.585164017175\n },\n {\n \"content\": \"fn decode_line(line: &String) -> CTResult<ElemData> {\\n\\n let data: Vec<&str> = line.trim().split(';').collect();\\n\\n if data.len() < 4 {\\n\\n Err(CTError {\\n\\n kind: DatabaseError,\\n\\n desc: \\\"Missing field in database\\\".to_string(),\\n\\n pos: None\\n\\n })\\n\\n } else {\\n\\n let mass = data[1].parse::<f64>();\\n\\n let atomic_num = data[3].parse::<u16>();\\n\\n if let (Ok(m), Ok(an)) = (mass, atomic_num) {\\n\\n Ok(ElemData {\\n\\n short_name: data[0].to_string(),\\n\\n long_name: data[2].to_string(),\\n\\n mass: m,\\n\\n atomic_num: an,\\n\\n })\\n\\n } else {\\n\\n Err(CTError {\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 5,\n \"score\": 48616.94654597474\n },\n {\n \"content\": \"fn forward_elim(mut mat: Matrix) -> CTResult<Matrix> {\\n\\n for k in 0..min(mat.width(), mat.height()) {\\n\\n // locate the pivot\\n\\n let pivot = column_abs_max_index(&mat[k..], k) + k;\\n\\n if mat[pivot][k] == 0_f64 {\\n\\n return Err(CTError {\\n\\n kind: InputError,\\n\\n desc: \\\"Could not balance reaction\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n }\\n\\n // move the pivot to its new position\\n\\n mat.switch_rows(k, pivot);\\n\\n\\n\\n // zero out the rest of the column\\n\\n for i in k + 1..mat.height() {\\n\\n let mult = -(mat[i][k] / mat[k][k]);\\n\\n mat.add_row_to_row(i, k, mult);\\n\\n }\\n\\n }\\n\\n Ok(mat)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 6,\n \"score\": 48152.16421697447\n },\n {\n \"content\": \"fn mass_cmd(args: &[String], db_path: &Path) -> CTResult<()> {\\n\\n if args.len() < 1 {\\n\\n Err(CTError {\\n\\n kind: UsageError,\\n\\n desc: \\\"Missing formula.\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n } else if args.len() > 1 {\\n\\n Err(CTError {\\n\\n kind: UsageError,\\n\\n desc: \\\"Too many arguments.\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n } else {\\n\\n let input = args[0].as_slice();\\n\\n let mut parser = Parser::new(input);\\n\\n let molecule = try!(parser.parse_molecule());\\n\\n if !parser.is_done() {\\n\\n // since there should be no whitespace in a molecule, the only way for parser to have\\n\\n // returned sucess while not being done, is if there was some whitespace,\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 7,\n \"score\": 46414.74614936941\n },\n {\n \"content\": \"fn column_abs_max_index(columns: &[Vec<f64>], column: usize) -> usize {\\n\\n let mut max = 0;\\n\\n for i in 1..columns.len() {\\n\\n if columns[i][column].abs() > columns[max][column].abs() {\\n\\n max = i;\\n\\n }\\n\\n }\\n\\n max\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 8,\n \"score\": 40596.67718275641\n },\n {\n \"content\": \"#[derive(Debug, PartialEq)]\\n\\nstruct Matrix {\\n\\n buf: Vec<Vec<f64>>,\\n\\n height: usize,\\n\\n width: usize,\\n\\n}\\n\\n\\n\\nimpl Matrix {\\n\\n fn from_reaction(reaction: &(Vec<Molecule>, Vec<Molecule>)) -> Matrix {\\n\\n let &(ref lhs, ref rhs) = reaction;\\n\\n let lhs: Vec<Molecule> = lhs.clone().into_iter().map(|m| elem::group_elems(m)).collect();\\n\\n let rhs: Vec<Molecule> = rhs.clone().into_iter().map(|m| elem::group_elems(m)).collect();\\n\\n let mut names = Vec::<&str>::new();\\n\\n // gather up all the element names in the reaction so we now how many rows will be needed\\n\\n for molecule in lhs.iter().chain(rhs.iter()) {\\n\\n for elem in molecule.iter() {\\n\\n if names.iter().find(|e| **e == elem.name).is_none() {\\n\\n names.push(elem.name.as_slice());\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 9,\n \"score\": 39347.42583280171\n },\n {\n \"content\": \"#[cfg(not(test))]\\n\\nfn main() {\\n\\n let args: Vec<String> = env::args().collect();\\n\\n let mut opts = Options::new();\\n\\n opts.optflag(\\\"h\\\", \\\"help\\\", \\\"Display this message and then exit.\\\");\\n\\n opts.optflag(\\\"v\\\", \\\"version\\\", \\\"Display the version number and then exit.\\\");\\n\\n opts.optopt(\\\"\\\", \\\"db-path\\\", \\\"Explicitly specify the path to the database file.\\\", \\\"PATH\\\");\\n\\n let given_opts = match opts.parse(args.tail()) {\\n\\n Ok(go) => go,\\n\\n Err(msg) => {\\n\\n println!(\\\"{}\\\", msg.to_string());\\n\\n println!(\\\"{}\\\", opts.usage(USAGE));\\n\\n return;\\n\\n },\\n\\n };\\n\\n if given_opts.opt_present(\\\"help\\\") {\\n\\n println!(\\\"{}\\\", opts.usage(USAGE));\\n\\n } else if given_opts.opt_present(\\\"version\\\") {\\n\\n println!(\\\"{}\\\", VERSION);\\n\\n } else {\\n\\n let path = if let Some(path) = given_opts.opt_str(\\\"db-path\\\") {\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 10,\n \"score\": 28696.94537207866\n },\n {\n \"content\": \"fn back_substitute(mat: &Matrix) -> Vec<f64> {\\n\\n let mut vars = Vec::with_capacity(mat.width());\\n\\n for k in (0..mat.width()).rev() {\\n\\n if k >= mat.height() {\\n\\n // if this coef does not have a corresponding row in the matrix, then treat is as a\\n\\n // free variable and set it to 1\\n\\n vars.push(1_f64);\\n\\n } else {\\n\\n let mut var = 0f64;\\n\\n for i in k + 1..mat.width() {\\n\\n var -= mat[k][i] * vars[mat.width() - 1 - i];\\n\\n }\\n\\n vars.push(var / mat[k][k]);\\n\\n }\\n\\n }\\n\\n vars\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 11,\n \"score\": 22139.044317184558\n },\n {\n \"content\": \"#[derive(Debug, PartialEq)]\\n\\npub struct CTError {\\n\\n pub kind: CTErrorKind,\\n\\n pub desc: String,\\n\\n pub pos: Option<(usize, usize)>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub enum CTErrorKind {\\n\\n InputError,\\n\\n DatabaseError,\\n\\n UsageError,\\n\\n}\\n\\n\\n\\npub type CTResult<T> = Result<T, CTError>;\\n\\n\\n\\nimpl CTError {\\n\\n /// Pretty-prints the CTError struct to stdout\\n\\n pub fn print(&self, extra_desc: Option<&String>) {\\n\\n println!(\\\"{}\\\", self.desc);\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 29,\n \"score\": 14.450088556232998\n },\n {\n \"content\": \"use std::old_io::File;\\n\\nuse std::old_io::SeekStyle::SeekSet;\\n\\nuse std::old_io::IoErrorKind::EndOfFile;\\n\\nuse elem::{PerElem, Molecule};\\n\\nuse error::{CTError, CTResult};\\n\\nuse error::CTErrorKind::{InputError, DatabaseError};\\n\\n\\n\\nmacro_rules! read_err (\\n\\n () => (Err(CTError {\\n\\n kind: DatabaseError,\\n\\n desc: \\\"Error reading the database\\\".to_string(),\\n\\n pos: None\\n\\n }));\\n\\n);\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct ElemData {\\n\\n pub short_name: String,\\n\\n pub long_name: String,\\n\\n pub mass: f64,\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 30,\n \"score\": 13.761954833085055\n },\n {\n \"content\": \"use std::fmt::{Display, Formatter, Error};\\n\\n\\n\\n#[derive(Debug, PartialEq, Clone)]\\n\\npub struct PerElem {\\n\\n pub name: String,\\n\\n pub coef: u32,\\n\\n pub pos: usize,\\n\\n pub len: usize,\\n\\n}\\n\\n\\n\\npub type Molecule = Vec<PerElem>;\\n\\n\\n\\n/// Sorts the PerElems and groups those with the same name field.\\n\\n///\\n\\n/// Grouping of two (or more) PerElems means adding the coef field of the\\n\\n/// duplicate to the one already found, and then throwing away the duplicate.\\n\\n/// E.g. CH3CH3 would turn into C2H6.\\n\",\n \"file_path\": \"src/elem.rs\",\n \"rank\": 31,\n \"score\": 12.957087093267798\n },\n {\n \"content\": \" // followed by more (illegal) input\\n\\n return Err(CTError {\\n\\n kind: InputError,\\n\\n desc: \\\"A molecule must not contain whitespace\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n }\\n\\n\\n\\n let molecule = elem::group_elems(molecule);\\n\\n let mut database = try!(ElemDatabase::open(db_path));\\n\\n let data = try!(database.get_data(&molecule));\\n\\n mass::pretty_print_data(&data, &molecule);\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 32,\n \"score\": 12.711802267688453\n },\n {\n \"content\": \" kind: DatabaseError,\\n\\n desc: \\\"Field in database corrupted\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use std::old_io::File;\\n\\n use std::old_io::fs;\\n\\n use elem::PerElem;\\n\\n\\n\\n fn make_dummy_db(name: &str, contents: &str) -> ElemDatabase {\\n\\n if let Err(e) = File::create(&Path::new(name)).and_then(|mut f| f.write_str(contents)) {\\n\\n // if we can't make the database we can't test, so just abort here\\n\\n panic!(\\\"Could not create dummy database: {:?}\\\", e.desc);\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 33,\n \"score\": 12.078013280550818\n },\n {\n \"content\": \" pub atomic_num: u16,\\n\\n}\\n\\n\\n\\npub struct ElemDatabase {\\n\\n db: File,\\n\\n}\\n\\n\\n\\nimpl ElemDatabase {\\n\\n /// Try to make the database with the file at the given oath\\n\\n pub fn open(path: &Path) -> CTResult<ElemDatabase> {\\n\\n match File::open(path) {\\n\\n Ok(db_file) => Ok(ElemDatabase { db: db_file }),\\n\\n Err(_) => Err(CTError {\\n\\n kind: DatabaseError,\\n\\n desc: format!(\\\"Could not open database file. Expected at: {:?}\\\",\\n\\n path.as_str().unwrap_or(\\\"same directory as the program\\\")),\\n\\n pos: None,\\n\\n }),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 34,\n \"score\": 10.45418003554244\n },\n {\n \"content\": \"use std::f64;\\n\\nuse std::cmp::min;\\n\\nuse std::num::Float;\\n\\nuse std::ops::{Index, IndexMut, Range, RangeTo, RangeFrom, RangeFull};\\n\\nuse elem;\\n\\nuse elem::Molecule;\\n\\nuse error::{CTResult, CTError};\\n\\nuse error::CTErrorKind::InputError;\\n\\n\\n\\nmacro_rules! impl_matrix_index {\\n\\n ($idx:ty, $out:ty) => {\\n\\n impl Index<$idx> for Matrix {\\n\\n type Output = $out;\\n\\n\\n\\n fn index(&self, index: &$idx) -> &$out {\\n\\n &self.buf[*index]\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 35,\n \"score\": 10.315971870152207\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn read_line(&mut self, elem: &PerElem) -> CTResult<String> {\\n\\n // we know that no line in the database is more than 30 characters long\\n\\n let mut buf = Vec::with_capacity(30);\\n\\n loop {\\n\\n match self.db.read_byte() {\\n\\n Ok(b) if b == b'\\\\n' => break,\\n\\n Ok(b) => buf.push(b),\\n\\n Err(ref e) if e.kind == EndOfFile => return Err(CTError {\\n\\n kind: InputError,\\n\\n desc: format!(\\\"Could not find element: {:?}\\\", elem.name),\\n\\n pos: Some((elem.pos, elem.len)),\\n\\n }),\\n\\n Err(_) => return read_err!()\\n\\n }\\n\\n }\\n\\n String::from_utf8(buf).or_else(|_| read_err!())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 36,\n \"score\": 9.460561122799398\n },\n {\n \"content\": \" }\\n\\n } else {\\n\\n Err(CTError {\\n\\n kind: UsageError,\\n\\n desc: \\\"Missing command.\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n };\\n\\n\\n\\n match cmd_result {\\n\\n Err(ref e) if e.kind == InputError => e.print(Some(&args[2])),\\n\\n Err(ref e) if e.kind == UsageError => e.print(Some(&opts.usage(USAGE))),\\n\\n Err(ref e) => e.print(None),\\n\\n _ => ()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 37,\n \"score\": 9.387167225002568\n },\n {\n \"content\": \"#![allow(unused_features)] // so we can still feature(os) when testing\\n\\n#![feature(collections, path, io, core, os, plugin, env)]\\n\\nextern crate getopts;\\n\\n\\n\\nuse getopts::Options;\\n\\nuse std::env;\\n\\nuse parser::Parser;\\n\\nuse database::ElemDatabase;\\n\\nuse error::{CTResult, CTError};\\n\\nuse error::CTErrorKind::{InputError, UsageError};\\n\\n\\n\\nmod elem;\\n\\nmod parser;\\n\\nmod error;\\n\\nmod database;\\n\\nmod mass;\\n\\nmod balance;\\n\\n\\n\\nconst USAGE: &'static str = \\\"\\\\\\n\\nUsage:\\n\\n chemtool mass <formula> [options]\\n\\n chemtool balance <reaction> [options]\\n\\n chemtool [-h | --help]\\n\\n chemtool [-v | --version]\\\";\\n\\n\\n\\nconst VERSION: &'static str = \\\"chemtool 0.4.1\\\";\\n\\n\\n\\n#[cfg(not(test))]\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 38,\n \"score\": 8.915123087230038\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn height(&self) -> usize {\\n\\n self.height\\n\\n }\\n\\n}\\n\\n\\n\\nimpl_matrix_index!(usize, Vec<f64>);\\n\\nimpl_matrix_index!(Range<usize>, [Vec<f64>]);\\n\\nimpl_matrix_index!(RangeTo<usize>, [Vec<f64>]);\\n\\nimpl_matrix_index!(RangeFrom<usize>, [Vec<f64>]);\\n\\nimpl_matrix_index!(RangeFull, [Vec<f64>]);\\n\\n\\n\\nimpl_matrix_index_mut!(usize, Vec<f64>);\\n\\nimpl_matrix_index_mut!(Range<usize>, [Vec<f64>]);\\n\\nimpl_matrix_index_mut!(RangeTo<usize>, [Vec<f64>]);\\n\\nimpl_matrix_index_mut!(RangeFrom<usize>, [Vec<f64>]);\\n\\nimpl_matrix_index_mut!(RangeFull, [Vec<f64>]);\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 39,\n \"score\": 8.674258985117358\n },\n {\n \"content\": \" }\\n\\n ElemDatabase::open(&Path::new(name)).unwrap()\\n\\n }\\n\\n\\n\\n fn remove_dummy_db(name: &str) {\\n\\n if let Err(e) = fs::unlink(&Path::new(name)) {\\n\\n // if we can't remove the database something is wrong, and we abort the test\\n\\n panic!(\\\"Could not remove dummy database: {:?}\\\", e.desc);\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn multiple_elems() {\\n\\n let db_name = \\\"multiple_elems_db\\\";\\n\\n let mut db = make_dummy_db(db_name,\\n\\n \\\"A;1;Abba;2\\\\n\\\\\\n\\n B;3;Beta;4\\\\n\\\");\\n\\n let raw_result = db.get_data(&vec!(\\n\\n PerElem { name: \\\"B\\\".to_string(), coef: 1, pos: 0, len: 1 },\\n\\n PerElem { name: \\\"A\\\".to_string(), coef: 1, pos: 1, len: 1 }\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 40,\n \"score\": 8.475486315377267\n },\n {\n \"content\": \"mod test {\\n\\n use super::*;\\n\\n use elem::PerElem;\\n\\n use error::CTErrorKind::InputError;\\n\\n\\n\\n macro_rules! dummy_elem(\\n\\n ($name:expr) => (\\n\\n PerElem { name: $name.to_string(), coef: 1, pos: 0, len: 1 }\\n\\n );\\n\\n ($name:expr, $coef:expr) => (\\n\\n PerElem { name: $name.to_string(), coef: $coef, pos: 0, len: 1 }\\n\\n );\\n\\n );\\n\\n\\n\\n #[test]\\n\\n fn balance() {\\n\\n // attempt to balance C3H8 + O2 -> CO2 + H2O\\n\\n let reaction = (vec!(vec!(dummy_elem!(\\\"C\\\", 3), dummy_elem!(\\\"H\\\", 8)),\\n\\n vec!(dummy_elem!(\\\"O\\\", 2))),\\n\\n vec!(vec!(dummy_elem!(\\\"C\\\", 1), dummy_elem!(\\\"O\\\", 2)),\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 41,\n \"score\": 8.294518606279308\n },\n {\n \"content\": \" fn missing_elem() {\\n\\n let db_name = \\\"missing_elem_db\\\";\\n\\n let mut db = make_dummy_db(db_name, \\\"A;123.456789;Abba;12\\\\n\\\");\\n\\n let result = db.get_single_data(\\n\\n &PerElem { name: \\\"B\\\".to_string(), coef: 1, pos: 0, len: 2 }\\n\\n );\\n\\n remove_dummy_db(db_name);\\n\\n assert!(result.is_err());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn missing_field() {\\n\\n let db_name = \\\"missing_field_db\\\";\\n\\n let mut db = make_dummy_db(db_name, \\\"A;\\\");\\n\\n let result = db.get_single_data(\\n\\n &PerElem { name: \\\"A\\\".to_string(), coef: 1, pos: 0, len: 2 }\\n\\n );\\n\\n remove_dummy_db(db_name);\\n\\n assert!(result.is_err());\\n\\n }\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 42,\n \"score\": 7.719950513808952\n },\n {\n \"content\": \"\\n\\nmacro_rules! impl_matrix_index_mut {\\n\\n ($idx:ty, $out:ty) => {\\n\\n impl IndexMut<$idx> for Matrix {\\n\\n fn index_mut(&mut self, index: &$idx) -> &mut $out {\\n\\n &mut self.buf[*index]\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Takes a parsed reaction and pretty prints it to the console\\n\\n///\\n\\n/// The reaction is printed as follows:\\n\\n/// <coef> <molecule> + <coef> <molecule> + ... -> <coef> <molecule> + <coef> <molecule> + ...\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 43,\n \"score\": 7.717639792674559\n },\n {\n \"content\": \" // TODO: Use a proper conversion function -- if it exists\\n\\n if elem.coef > 1 {\\n\\n try!(fmt.write_str(format!(\\\"{}\\\", elem.coef).as_slice()));\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n\\n\\n macro_rules! dummy_elem(\\n\\n ($name:expr) => (\\n\\n PerElem { name: $name.to_string(), coef: 1, pos: 0, len: 1 }\\n\\n );\\n\\n ($name:expr, $coef:expr) => (\\n\\n PerElem { name: $name.to_string(), coef: $coef, pos: 0, len: 1 }\\n\\n );\\n\",\n \"file_path\": \"src/elem.rs\",\n \"rank\": 44,\n \"score\": 7.6614465389768265\n },\n {\n \"content\": \" // some errors will have extra stuff to report to make the message clearer for the user\\n\\n match self.kind {\\n\\n CTErrorKind::InputError => {\\n\\n if let (Some((pos, len)), Some(input)) = (self.pos, extra_desc) {\\n\\n println!(\\\" {}\\\", input);\\n\\n print!(\\\" \\\");\\n\\n for _ in 0..pos {\\n\\n print!(\\\" \\\");\\n\\n }\\n\\n print!(\\\"^\\\");\\n\\n for _ in 1..len {\\n\\n print!(\\\"~\\\");\\n\\n }\\n\\n println!(\\\"\\\");\\n\\n }\\n\\n },\\n\\n CTErrorKind::UsageError => {\\n\\n if let Some(usage) = extra_desc {\\n\\n println!(\\\"{}\\\", usage);\\n\\n }\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n}\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 45,\n \"score\": 7.344656327372801\n },\n {\n \"content\": \" /// This function errors if one of the PerElem could not be found, or the\\n\\n /// database could not be read.\\n\\n pub fn get_data(&mut self, elems: &Molecule) -> CTResult<Vec<ElemData>> {\\n\\n let mut out = Vec::new();\\n\\n for elem in elems.iter() {\\n\\n match self.get_single_data(elem) {\\n\\n Ok(data) => out.push(data),\\n\\n Err(e) => return Err(e),\\n\\n }\\n\\n }\\n\\n Ok(out)\\n\\n }\\n\\n\\n\\n fn do_data_search(&mut self, elem: &PerElem) -> CTResult<ElemData> {\\n\\n loop {\\n\\n // TODO: make it so this function returns the 'not found' error\\n\\n let line = try!(self.read_line(elem));\\n\\n if line.starts_with(elem.name.as_slice()) {\\n\\n return decode_line(&line);\\n\\n }\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 46,\n \"score\": 6.365691206665867\n },\n {\n \"content\": \" Path::new(path)\\n\\n } else {\\n\\n let mut path = Path::new(&args[0]);\\n\\n path.set_filename(\\\"elemdb.csv\\\");\\n\\n path\\n\\n };\\n\\n\\n\\n let cmd_result = if given_opts.free.len() > 0 {\\n\\n let cmd = &given_opts.free[0];\\n\\n let args = given_opts.free.tail();\\n\\n match cmd.as_slice() {\\n\\n \\\"mass\\\" => mass_cmd(&args, &path),\\n\\n \\\"balance\\\" => balance_cmd(&args),\\n\\n _ => {\\n\\n Err(CTError {\\n\\n kind: UsageError,\\n\\n desc: \\\"Invalid command\\\".to_string(),\\n\\n pos: None,\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 47,\n \"score\": 5.394206656335623\n },\n {\n \"content\": \" Matrix {\\n\\n buf: buf,\\n\\n height: height,\\n\\n width: width,\\n\\n }\\n\\n }\\n\\n\\n\\n fn add_row_to_row(&mut self, dest: usize, row: usize, mult: f64) {\\n\\n for i in 0..self.width {\\n\\n let incr = self.buf[row][i] * mult;\\n\\n self.buf[dest][i] += incr;\\n\\n }\\n\\n }\\n\\n\\n\\n fn switch_rows(&mut self, row1: usize, row2: usize) {\\n\\n self.buf.swap(row1, row2);\\n\\n }\\n\\n\\n\\n fn width(&self) -> usize {\\n\\n self.width\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 48,\n \"score\": 5.186724902788182\n },\n {\n \"content\": \"use elem::Molecule;\\n\\nuse database::ElemData;\\n\\n\\n\\n/// Takes a parsed checmical formula containing a single molecule, and pretty print the mass\\n\\n///\\n\\n/// The function will print the molar mass (and some other data) for each element\\n\\n/// in the given molecule, as well as the total molar mass.\\n\",\n \"file_path\": \"src/mass.rs\",\n \"rank\": 49,\n \"score\": 5.027739948448879\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn field_corrupted() {\\n\\n let db_name = \\\"field_corrupted_db\\\";\\n\\n let mut db = make_dummy_db(db_name, \\\"A;not a number;Abba;12\\\\n\\\");\\n\\n let result = db.get_single_data(\\n\\n &PerElem { name: \\\"A\\\".to_string(), coef: 1, pos: 0, len: 2 }\\n\\n );\\n\\n remove_dummy_db(db_name);\\n\\n assert!(result.is_err());\\n\\n }\\n\\n}\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 50,\n \"score\": 4.696556777466402\n },\n {\n \"content\": \" fn find_elem() {\\n\\n let db_name = \\\"find_elem_db\\\";\\n\\n let mut db = make_dummy_db(db_name,\\n\\n \\\"A;0;Abba;0\\\\n\\\\\\n\\n B;123.456789;Beta;12\\\\n\\\\\\n\\n C;0;Coop;0\\\\n\\\");\\n\\n let raw_result = db.get_single_data(\\n\\n &PerElem { name: \\\"B\\\".to_string(), coef: 1, pos: 0, len: 2 }\\n\\n );\\n\\n let expected = ElemData {\\n\\n short_name: \\\"B\\\".to_string(),\\n\\n long_name: \\\"Beta\\\".to_string(),\\n\\n mass: 123.456789,\\n\\n atomic_num: 12,\\n\\n };\\n\\n remove_dummy_db(db_name);\\n\\n assert_eq!(Ok(expected), raw_result);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 51,\n \"score\": 4.686693238506054\n },\n {\n \"content\": \"\\n\\n /// Try to get the data matching the given PerElem.\\n\\n ///\\n\\n /// This function errors if the PerElem could not be found, or the database\\n\\n /// could not be read.\\n\\n pub fn get_single_data(&mut self, elem: &PerElem) -> CTResult<ElemData> {\\n\\n // since the elements should be sorted before we get their data from the database\\n\\n // we should never have to seek back to the beginning of the file\\n\\n if let Ok(data) = self.do_data_search(elem) {\\n\\n Ok(data)\\n\\n } else {\\n\\n // but in case they weren't, we return to the beginning of the underlying file, since\\n\\n // the data might lie on a line we have previously read past\\n\\n self.db.seek(0, SeekSet).ok().expect(\\\"Internal error reading database\\\");\\n\\n self.do_data_search(elem)\\n\\n }\\n\\n }\\n\\n\\n\\n /// Try to get the data for all the provided PerElems.\\n\\n ///\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 52,\n \"score\": 4.523484499344601\n },\n {\n \"content\": \" let mut buf = Vec::with_capacity(names.len());\\n\\n for name in names.iter() {\\n\\n let mut row = Vec::with_capacity(lhs.len() + rhs.len());\\n\\n for molecule in lhs.iter() {\\n\\n row.push(molecule.iter()\\n\\n .find(|e| e.name == *name)\\n\\n .and_then(|e| Some(e.coef as f64))\\n\\n .unwrap_or(0_f64));\\n\\n }\\n\\n // we loop over rhs seperately, since we need to multiply the coefs with -1\\n\\n for molecule in rhs.iter() {\\n\\n row.push(molecule.iter()\\n\\n .find(|e| e.name == *name)\\n\\n .and_then(|e| Some(-1.0*(e.coef as f64)))\\n\\n .unwrap_or(0_f64));\\n\\n }\\n\\n buf.push(row);\\n\\n }\\n\\n let height = names.len();\\n\\n let width = lhs.len() + rhs.len();\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 53,\n \"score\": 4.060579309389319\n },\n {\n \"content\": \" let reaction = (vec!(vec!(dummy_elem!(\\\"C\\\", 1)), vec!(dummy_elem!(\\\"H\\\", 1))),\\n\\n vec!(vec!(dummy_elem!(\\\"C\\\", 1)), vec!(dummy_elem!(\\\"H\\\", 1))));\\n\\n let result = balance_reaction(&reaction);\\n\\n let expected = Ok(vec!(1, 1, 1, 1));\\n\\n assert_eq!(result, expected);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn missing_elem() {\\n\\n let reaction = (vec!(vec!(dummy_elem!(\\\"C\\\", 1)), vec!(dummy_elem!(\\\"H\\\", 1))),\\n\\n vec!(vec!(dummy_elem!(\\\"C\\\", 1))));\\n\\n let result = balance_reaction(&reaction);\\n\\n println!(\\\"{:?}\\\", result);\\n\\n assert!(result.is_err());\\n\\n assert_eq!(result.err().unwrap().kind, InputError);\\n\\n }\\n\\n}\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 54,\n \"score\": 3.8215653885972123\n },\n {\n \"content\": \"The MIT License (MIT)\\n\\n\\n\\nCopyright (c) 2015 Patrick M. Jensen, patmjen@gmail.com\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in\\n\\nall copies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\\n\",\n \"file_path\": \"LICENSE.md\",\n \"rank\": 55,\n \"score\": 2.635241153406005\n },\n {\n \"content\": \" ));\\n\\n let expected = vec!(\\n\\n ElemData {\\n\\n short_name: \\\"B\\\".to_string(),\\n\\n long_name: \\\"Beta\\\".to_string(),\\n\\n mass: 3.0,\\n\\n atomic_num: 4,\\n\\n },\\n\\n ElemData {\\n\\n short_name: \\\"A\\\".to_string(),\\n\\n long_name: \\\"Abba\\\".to_string(),\\n\\n mass: 1.0,\\n\\n atomic_num: 2,\\n\\n }\\n\\n );\\n\\n remove_dummy_db(db_name);\\n\\n assert_eq!(Ok(expected), raw_result);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/database.rs\",\n \"rank\": 56,\n \"score\": 2.6292327787277356\n },\n {\n \"content\": \"CHEMTOOL\\n\\n========\\n\\nA commandline utility for making chemistry a little less tedious.\\n\\n\\n\\nSo far the program is able to calculate the molar mass for a given molecule,\\n\\nor balance a given chemical reaction.\\n\\n\\n\\nExamples:\\n\\n---------\\n\\nTo get the total molar mass of the molecule `CH3CH2CH3` simply call chemtool as:\\n\\n```\\n\\nchemtool mass CH3CH2CH3\\n\\n```\\n\\nWhich should generate the following output:\\n\\n```\\n\\nabbrv. amt. M name Z\\n\\n------------------------------------------------------\\n\\nC 3 12.01070000 Carbon 6\\n\\nH 8 1.00794000 Hydrogen 1\\n\\nTotal: 44.09562\\n\\n```\\n\\nTo balance a reaction - e.g. `C3H8 + O2 -> CO2 + H2O` call:\\n\\n```\\n\\nchemtool balance 'C3H8 + O2 -> CO2 + H2O'\\n\\n```\\n\\nand the following should be displayed:\\n\\n```\\n\\n1 C3H8 + 5 O2 -> 3 CO2 + 4 H2O\\n\\n```\\n\\n\\n\\nUSAGE\\n\\n=====\\n\\n```\\n\\nUsage:\\n\\n chemtool mass <formula> [options]\\n\\n chemtool balance <reaction> [options]\\n\\n chemtool [-h | --help]\\n\\n chemtool [-v | --version]\\n\\n\\n\\nOptions:\\n\\n -h --help Display this message and then exit.\\n\\n -v --version Display the version number and then exit.\\n\\n --db-path PATH Explicitly specify the path to the database file.\\n\\n```\\n\\n\\n\\nInstalling and building\\n\\n=======================\\n\\nThe easiest way to compile the project is with the `cargo` program available\\n\\nfrom the rust website at:\\n\\nhttp://www.rust-lang.org/\\n\\n\\n\\nNavigate to the project directory and call:\\n\\n```\\n\\ncargo build --release\\n\\n```\\n\\nwhich will place the binary in the target directory. Then copy the element\\n\\ndatabase `elemdb.csv` to the same directory as the program binary (or use\\n\\n`--db-path` when invoking chemtool to specify the path yourself).\\n\\n\\n\\nTesting\\n\\n-------\\n\\nTo do a quick test of the program simply call:\\n\\n```\\n\\ncargo test\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 57,\n \"score\": 2.622180927500654\n },\n {\n \"content\": \" );\\n\\n\\n\\n #[test]\\n\\n fn group() {\\n\\n let result = group_elems(vec!(dummy_elem!(\\\"C\\\"), dummy_elem!(\\\"H\\\"), dummy_elem!(\\\"C\\\")));\\n\\n let expected = vec!(dummy_elem!(\\\"C\\\", 2), dummy_elem!(\\\"H\\\", 1));\\n\\n assert_eq!(result, expected);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn molecule_display() {\\n\\n let molecule = vec!(dummy_elem!(\\\"C\\\", 2), dummy_elem!(\\\"H\\\", 3));\\n\\n let result = format!(\\\"{}\\\", molecule);\\n\\n let expected = \\\"C2H3\\\";\\n\\n assert_eq!(result, expected);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn molecule_display_coefs() {\\n\\n let molecule = vec!(dummy_elem!(\\\"C\\\", 1), dummy_elem!(\\\"H\\\", 3));\\n\\n let result = format!(\\\"{}\\\", molecule);\\n\\n let expected = \\\"CH3\\\";\\n\\n assert_eq!(result, expected);\\n\\n }\\n\\n}\",\n \"file_path\": \"src/elem.rs\",\n \"rank\": 58,\n \"score\": 2.568742435482663\n },\n {\n \"content\": \" // we find the minimum element with fold, since f64 does not implement Ord...\\n\\n let min = coefs.iter().fold(f64::INFINITY, |crnt, &num| {\\n\\n if num < crnt {\\n\\n num\\n\\n } else {\\n\\n crnt\\n\\n }\\n\\n });\\n\\n // now we divide all elements by the minimum to (hopefully) convert them all to intergers\\n\\n // after which we do the actual conversion\\n\\n // we also reverse the Vec so the coefs are in the right order\\n\\n Ok(coefs.iter().rev().map(|n| (n / min) as u32).collect())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/balance.rs\",\n \"rank\": 59,\n \"score\": 1.6482018268730045\n }\n]","isConversational":false}}},{"rowIdx":791,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"rsnes/src/smp.rs"},"repo_name":{"kind":"string","value":"nat-rix/rsnes"},"commit":{"kind":"string","value":"05b68de39041e68fa65184c1842c1cd7108543d6"},"file_code":{"kind":"string","value":"use crate::{\n backend::AudioBackend as Backend,\n spc700::Spc700,\n timing::{Cycles, APU_CPU_TIMING_PROPORTION_NTSC, APU_CPU_TIMING_PROPORTION_PAL},\n};\nuse save_state::{InSaveState, SaveStateDeserializer, SaveStateSerializer};\nuse save_state_macro::InSaveState;\nuse std::sync::mpsc::{channel, Receiver, RecvError, Sender};\n\n#[derive(Debug, Clone)]\nenum Action {\n WriteInputPort { addr: u8, data: u8 },\n ReadOutputPort { addr: u8 },\n}\n\n#[derive(Debug, Clone)]\nenum ThreadCommand {\n RunCycles {\n cycles: Cycles,\n action: Option<Action>,\n },\n SaveState(Box<Spc700>),\n GetSaveState,\n KillMe,\n}\n\n#[derive(Debug, Clone)]\nenum MainCommand {\n Data(u8),\n SaveState(Box<Spc700>),\n}\n\ntype ReturnType = Result<(), RecvError>;\n\n#[derive(Debug)]\nstruct Thread {\n join_handle: Option<std::thread::JoinHandle<ReturnType>>,\n send: Sender<ThreadCommand>,\n recv: Receiver<MainCommand>,\n}\n\n#[derive(Debug, InSaveState)]\npub struct Smp<B: Backend> {\n pub spc: Option<Spc700>,\n #[except((|_v, _s| ()), (|_v, _s| ()))]\n pub backend: Option<B>,\n #[except(Self::serialize_save_state, Self::deserialize_save_state)]\n thread: Option<Thread>,\n timing_proportion: (Cycles, Cycles),\n master_cycles: Cycles,\n}\n\nfn threaded_spc<B: Backend>(\n mut spc: Spc700,\n mut backend: B,\n send: Sender<MainCommand>,\n recv: Receiver<ThreadCommand>,\n) -> ReturnType {\n loop {\n match recv.recv()? {\n ThreadCommand::RunCycles { cycles, action } => {\n \n for _ in 0..cycles {\n if let Some(sample) = spc.run_cycle() {\n backend.push_sample(sample)\n }\n }\n \n match action {\n Some(Action::WriteInputPort { addr, data }) => {\n spc.input[usize::from(addr & 3)] = data\n }\n Some(Action::ReadOutputPort { addr }) => {\n let _ = send.send(MainCommand::Data(spc.output[usize::from(addr & 3)]));\n }\n None => (),\n }\n }\n ThreadCommand::SaveState(new_spc) => spc = *new_spc,\n ThreadCommand::GetSaveState => {\n let _ = send.send(MainCommand::SaveState(Box::new(spc.clone())));\n }\n ThreadCommand::KillMe => break Ok(()),\n }\n }\n}\n\nimpl<B: Backend> Smp<B> {\n pub fn new(backend: B, is_pal: bool, is_threaded: bool) -> Self {\n let spc = Spc700::default();\n let timing_proportion = if is_pal {\n APU_CPU_TIMING_PROPORTION_PAL\n } else {\n APU_CPU_TIMING_PROPORTION_NTSC\n };\n if is_threaded {\n let ((m_send, m_recv), (t_send, t_recv)) = (channel(), channel());\n let handle = std::thread::spawn(move || threaded_spc(spc, backend, m_send, t_recv));\n let thread = Some(Thread {\n join_handle: Some(handle),\n send: t_send,\n recv: m_recv,\n });\n Self {\n spc: None,\n backend: None,\n thread,\n timing_proportion,\n master_cycles: 0,\n }\n } else {\n Self {\n spc: Some(spc),\n backend: Some(backend),\n thread: None,\n timing_proportion,\n master_cycles: 0,\n }\n }\n }\n\n \n pub fn tick(&mut self, n: u16) {\n self.master_cycles += Cycles::from(n) * self.timing_proportion.1;\n }\n\n fn refresh_counters(&mut self) -> Cycles {\n let cycles = self.master_cycles / self.timing_proportion.0;\n self.master_cycles %= self.timing_proportion.0;\n cycles\n }\n\n fn refresh_no_thread(spc: &mut Spc700, backend: &mut B, cycles: Cycles) {\n for _ in 0..cycles {\n if let Some(sample) = spc.run_cycle() {\n backend.push_sample(sample)\n }\n }\n }\n\n pub fn refresh(&mut self) {\n let cycles = self.refresh_counters();\n if let (Some(spc), Some(backend)) = (&mut self.spc, &mut self.backend) {\n Self::refresh_no_thread(spc, backend, cycles)\n } else if let Some(thread) = &mut self.thread {\n let _ = thread.send.send(ThreadCommand::RunCycles {\n cycles,\n action: None,\n });\n } else {\n unreachable!()\n }\n }\n\n pub fn read_output_port(&mut self, addr: u8) -> u8 {\n let cycles = self.refresh_counters();\n if let (Some(spc), Some(backend)) = (&mut self.spc, &mut self.backend) {\n Self::refresh_no_thread(spc, backend, cycles);\n spc.output[usize::from(addr & 3)]\n } else if let Some(thread) = &mut self.thread {\n let _ = thread.send.send(ThreadCommand::RunCycles {\n cycles,\n action: Some(Action::ReadOutputPort { addr }),\n });\n \n match thread.recv.recv().unwrap() {\n MainCommand::Data(d) => d,\n _ => panic!(),\n }\n } else {\n unreachable!()\n }\n }\n\n pub fn write_input_port(&mut self, addr: u8, data: u8) {\n let cycles = self.refresh_counters();\n if let (Some(spc), Some(backend)) = (&mut self.spc, &mut self.backend) {\n Self::refresh_no_thread(spc, backend, cycles);\n spc.input[usize::from(addr & 3)] = data\n } else if let Some(thread) = &mut self.thread {\n let _ = thread.send.send(ThreadCommand::RunCycles {\n cycles,\n action: Some(Action::WriteInputPort { addr, data }),\n });\n } else {\n unreachable!()\n }\n }\n\n pub fn is_threaded(&self) -> bool {\n self.thread.is_some()\n }\n\n fn serialize_save_state(thread: &Option<Thread>, ser: &mut SaveStateSerializer) {\n \n if let Some(thread) = thread {\n thread.send.send(ThreadCommand::GetSaveState).unwrap();\n match thread.recv.recv().unwrap() {\n MainCommand::SaveState(new_spc) => {\n new_spc.serialize(ser);\n }\n _ => panic!(),\n }\n }\n }\n\n fn deserialize_save_state(thread: &mut Option<Thread>, deser: &mut SaveStateDeserializer) {\n if let Some(thread) = thread {\n let mut spc = Spc700::default();\n spc.deserialize(deser);\n let _ = thread.send.send(ThreadCommand::SaveState(Box::new(spc)));\n }\n }\n}\n\nimpl<B: Backend> Drop for Smp<B> {\n fn drop(&mut self) {\n if let Some(thread) = &mut self.thread {\n drop(thread.send.send(ThreadCommand::KillMe));\n if let Some(Ok(Err(err))) = thread.join_handle.take().map(|t| t.join()) {\n todo!(\"throw useful error ({})\", err)\n }\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::{\n backend::AudioBackend as Backend,\n spc700::Spc700,\n timing::{Cycles, APU_CPU_TIMING_PROPORTION_NTSC, APU_CPU_TIMING_PROPORTION_PAL},\n};\nuse save_"},"suffix":{"kind":"string","value":"mple)\n }\n }\n \n match action {\n Some(Action::WriteInputPort { addr, data }) => {\n spc.input[usize::from(addr & 3)] = data\n }\n Some(Action::ReadOutputPort { addr }) => {\n let _ = send.send(MainCommand::Data(spc.output[usize::from(addr & 3)]));\n }\n None => (),\n }\n }\n ThreadCommand::SaveState(new_spc) => spc = *new_spc,\n ThreadCommand::GetSaveState => {\n let _ = send.send(MainCommand::SaveState(Box::new(spc.clone())));\n }\n ThreadCommand::KillMe => break Ok(()),\n }\n }\n}\n\nimpl<B: Backend> Smp<B> {\n pub fn new(backend: B, is_pal: bool, is_threaded: bool) -> Self {\n let spc = Spc700::default();\n let timing_proportion = if is_pal {\n APU_CPU_TIMING_PROPORTION_PAL\n } else {\n APU_CPU_TIMING_PROPORTION_NTSC\n };\n if is_threaded {\n let ((m_send, m_recv), (t_send, t_recv)) = (channel(), channel());\n let handle = std::thread::spawn(move || threaded_spc(spc, backend, m_send, t_recv));\n let thread = Some(Thread {\n join_handle: Some(handle),\n send: t_send,\n recv: m_recv,\n });\n Self {\n spc: None,\n backend: None,\n thread,\n timing_proportion,\n master_cycles: 0,\n }\n } else {\n Self {\n spc: Some(spc),\n backend: Some(backend),\n thread: None,\n timing_proportion,\n master_cycles: 0,\n }\n }\n }\n\n \n pub fn tick(&mut self, n: u16) {\n self.master_cycles += Cycles::from(n) * self.timing_proportion.1;\n }\n\n fn refresh_counters(&mut self) -> Cycles {\n let cycles = self.master_cycles / self.timing_proportion.0;\n self.master_cycles %= self.timing_proportion.0;\n cycles\n }\n\n fn refresh_no_thread(spc: &mut Spc700, backend: &mut B, cycles: Cycles) {\n for _ in 0..cycles {\n if let Some(sample) = spc.run_cycle() {\n backend.push_sample(sample)\n }\n }\n }\n\n pub fn refresh(&mut self) {\n let cycles = self.refresh_counters();\n if let (Some(spc), Some(backend)) = (&mut self.spc, &mut self.backend) {\n Self::refresh_no_thread(spc, backend, cycles)\n } else if let Some(thread) = &mut self.thread {\n let _ = thread.send.send(ThreadCommand::RunCycles {\n cycles,\n action: None,\n });\n } else {\n unreachable!()\n }\n }\n\n pub fn read_output_port(&mut self, addr: u8) -> u8 {\n let cycles = self.refresh_counters();\n if let (Some(spc), Some(backend)) = (&mut self.spc, &mut self.backend) {\n Self::refresh_no_thread(spc, backend, cycles);\n spc.output[usize::from(addr & 3)]\n } else if let Some(thread) = &mut self.thread {\n let _ = thread.send.send(ThreadCommand::RunCycles {\n cycles,\n action: Some(Action::ReadOutputPort { addr }),\n });\n \n match thread.recv.recv().unwrap() {\n MainCommand::Data(d) => d,\n _ => panic!(),\n }\n } else {\n unreachable!()\n }\n }\n\n pub fn write_input_port(&mut self, addr: u8, data: u8) {\n let cycles = self.refresh_counters();\n if let (Some(spc), Some(backend)) = (&mut self.spc, &mut self.backend) {\n Self::refresh_no_thread(spc, backend, cycles);\n spc.input[usize::from(addr & 3)] = data\n } else if let Some(thread) = &mut self.thread {\n let _ = thread.send.send(ThreadCommand::RunCycles {\n cycles,\n action: Some(Action::WriteInputPort { addr, data }),\n });\n } else {\n unreachable!()\n }\n }\n\n pub fn is_threaded(&self) -> bool {\n self.thread.is_some()\n }\n\n fn serialize_save_state(thread: &Option<Thread>, ser: &mut SaveStateSerializer) {\n \n if let Some(thread) = thread {\n thread.send.send(ThreadCommand::GetSaveState).unwrap();\n match thread.recv.recv().unwrap() {\n MainCommand::SaveState(new_spc) => {\n new_spc.serialize(ser);\n }\n _ => panic!(),\n }\n }\n }\n\n fn deserialize_save_state(thread: &mut Option<Thread>, deser: &mut SaveStateDeserializer) {\n if let Some(thread) = thread {\n let mut spc = Spc700::default();\n spc.deserialize(deser);\n let _ = thread.send.send(ThreadCommand::SaveState(Box::new(spc)));\n }\n }\n}\n\nimpl<B: Backend> Drop for Smp<B> {\n fn drop(&mut self) {\n if let Some(thread) = &mut self.thread {\n drop(thread.send.send(ThreadCommand::KillMe));\n if let Some(Ok(Err(err))) = thread.join_handle.take().map(|t| t.join()) {\n todo!(\"throw useful error ({})\", err)\n }\n }\n }\n}\n"},"middle":{"kind":"string","value":"state::{InSaveState, SaveStateDeserializer, SaveStateSerializer};\nuse save_state_macro::InSaveState;\nuse std::sync::mpsc::{channel, Receiver, RecvError, Sender};\n\n#[derive(Debug, Clone)]\nenum Action {\n WriteInputPort { addr: u8, data: u8 },\n ReadOutputPort { addr: u8 },\n}\n\n#[derive(Debug, Clone)]\nenum ThreadCommand {\n RunCycles {\n cycles: Cycles,\n action: Option<Action>,\n },\n SaveState(Box<Spc700>),\n GetSaveState,\n KillMe,\n}\n\n#[derive(Debug, Clone)]\nenum MainCommand {\n Data(u8),\n SaveState(Box<Spc700>),\n}\n\ntype ReturnType = Result<(), RecvError>;\n\n#[derive(Debug)]\nstruct Thread {\n join_handle: Option<std::thread::JoinHandle<ReturnType>>,\n send: Sender<ThreadCommand>,\n recv: Receiver<MainCommand>,\n}\n\n#[derive(Debug, InSaveState)]\npub struct Smp<B: Backend> {\n pub spc: Option<Spc700>,\n #[except((|_v, _s| ()), (|_v, _s| ()))]\n pub backend: Option<B>,\n #[except(Self::serialize_save_state, Self::deserialize_save_state)]\n thread: Option<Thread>,\n timing_proportion: (Cycles, Cycles),\n master_cycles: Cycles,\n}\n\nfn threaded_spc<B: Backend>(\n mut spc: Spc700,\n mut backend: B,\n send: Sender<MainCommand>,\n recv: Receiver<ThreadCommand>,\n) -> ReturnType {\n loop {\n match recv.recv()? {\n ThreadCommand::RunCycles { cycles, action } => {\n \n for _ in 0..cycles {\n if let Some(sample) = spc.run_cycle() {\n backend.push_sample(sa"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub trait AccessType<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> {\n\n fn read<D: Data>(device: &mut Device<B, FB>, addr: Addr24) -> D;\n\n fn write<D: Data>(device: &mut Device<B, FB>, addr: Addr24, val: D);\n\n fn cpu(device: &Device<B, FB>) -> &Cpu;\n\n fn cpu_mut(device: &mut Device<B, FB>) -> &mut Cpu;\n\n fn is_main() -> bool {\n\n false\n\n }\n\n}\n\n\n\npub struct AccessTypeMain;\n\n\n\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> AccessType<B, FB>\n\n for AccessTypeMain\n\n{\n\n fn read<D: Data>(device: &mut Device<B, FB>, addr: Addr24) -> D {\n\n device.read::<D>(addr)\n\n }\n\n\n\n fn write<D: Data>(device: &mut Device<B, FB>, addr: Addr24, val: D) {\n","file_path":"rsnes/src/instr.rs","rank":0,"score":97009.81171677442},{"content":" pub trait AudioBackend: Send + 'static {\n\n fn push_sample(&mut self, sample: StereoSample);\n\n }\n\n pub struct Dummy;\n\n\n\n impl AudioBackend for Dummy {\n\n fn push_sample(&mut self, _sample: StereoSample) {}\n\n }\n\n}\n\n\n\npub use audio::{AudioBackend, Dummy as AudioDummy};\n\n\n","file_path":"rsnes/src/backend.rs","rank":2,"score":41380.04673110174},{"content":"mod audio {\n\n use crate::spc700::StereoSample;\n\n\n","file_path":"rsnes/src/backend.rs","rank":3,"score":37793.23385139394},{"content":"struct AudioBackend {\n\n producer: ringbuf::Producer<i16>,\n\n}\n\n\n\nconst SAMPLE_RATE: cpal::SampleRate = cpal::SampleRate(32000);\n\nconst TIME_PER_GPU_FRAME: Duration = Duration::from_micros(8_333);\n\nconst TIME_UNTIL_TIMER_RESET: Duration = Duration::from_millis(500);\n\n\n\nimpl AudioBackend {\n\n fn write_data<T: Sample>(data: &mut [T], consumer: &mut ringbuf::Consumer<i16>, channels: u16) {\n\n for frame in data.chunks_exact_mut(channels.into()) {\n\n let [l, r] = [(), ()].map(|_| T::from(&consumer.pop().unwrap_or(0)));\n\n if channels == 2 {\n\n frame[0] = l;\n\n frame[1] = r;\n\n } else {\n\n // TODO: join channels together\n\n for i in 0..channels {\n\n frame[usize::from(i)] = l;\n\n }\n","file_path":"emulator/src/main.rs","rank":4,"score":34388.205166461754},{"content":"pub trait FrameBuffer {\n\n fn pixels(&self) -> &[[u8; 4]];\n\n fn mut_pixels(&mut self) -> &mut [[u8; 4]];\n\n fn request_redraw(&mut self);\n\n}\n\n\n\npub const FRAME_BUFFER_SIZE: usize = (ppu::MAX_SCREEN_HEIGHT_OVERSCAN * ppu::SCREEN_WIDTH) as usize;\n\nuse crate::ppu;\n\n#[derive(Debug, Clone)]\n\npub struct ArrayFrameBuffer(pub [[u8; 4]; FRAME_BUFFER_SIZE], pub bool);\n\n\n\nimpl FrameBuffer for ArrayFrameBuffer {\n\n fn pixels(&self) -> &[[u8; 4]] {\n\n &self.0\n\n }\n\n fn mut_pixels(&mut self) -> &mut [[u8; 4]] {\n\n &mut self.0\n\n }\n\n fn request_redraw(&mut self) {\n\n self.1 = true\n\n }\n\n}\n\n\n\nimpl ArrayFrameBuffer {\n\n pub fn get_bytes(&self) -> &[u8] {\n\n unsafe { core::slice::from_raw_parts(self.0.as_ptr() as _, self.0.len() << 2) }\n\n }\n\n}\n","file_path":"rsnes/src/backend.rs","rank":5,"score":32909.274132054554},{"content":"//! The SNES/Famicom device\n\n\n\nuse crate::{\n\n backend::{AudioBackend, FrameBuffer},\n\n cartridge::Cartridge,\n\n controller::ControllerPorts,\n\n cpu::Cpu,\n\n dma::Dma,\n\n ppu::Ppu,\n\n registers::MathRegisters,\n\n smp::Smp,\n\n timing::Cycles,\n\n};\n\nuse core::cell::Cell;\n\nuse save_state_macro::*;\n\n\n\nconst RAM_SIZE: usize = 0x20000;\n\n\n\n/// The 24-bit address type used\n\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n","file_path":"rsnes/src/device.rs","rank":7,"score":11.522759925398685},{"content":" FB: crate::backend::FrameBuffer,\n\n>(\n\n device: &'a mut Device<B, FB>,\n\n) -> DeviceAccess<'a, T, B, FB> {\n\n DeviceAccess(device, core::marker::PhantomData)\n\n}\n\n\n\npub struct DeviceAccess<\n\n 'a,\n\n T: AccessType<B, FB>,\n\n B: crate::backend::AudioBackend,\n\n FB: crate::backend::FrameBuffer,\n\n>(pub &'a mut Device<B, FB>, core::marker::PhantomData<T>);\n\n\n\nimpl<\n\n 'a,\n\n T: AccessType<B, FB>,\n\n B: crate::backend::AudioBackend,\n\n FB: crate::backend::FrameBuffer,\n\n > DeviceAccess<'a, T, B, FB>\n","file_path":"rsnes/src/instr.rs","rank":8,"score":10.114769666383541},{"content":"use crate::cpu::{Cpu, Status};\n\nuse crate::device::{Addr24, Data, Device};\n\nuse crate::timing::Cycles;\n\n\n\n// 0x80 BRA: the 2 instead of 3 cycles are on purpose.\n\n// `branch_near` will increment the cycle count\n\n#[rustfmt::skip]\n\nstatic CYCLES: [Cycles; 256] = [\n\n /* ^0 ^1 ^2 ^3 ^4 ^5 ^6 ^7 | ^8 ^9 ^a ^b ^c ^d ^e ^f */\n\n 7, 6, 7, 4, 5, 3, 5, 6, 3, 2, 2, 4, 6, 4, 6, 5, // 0^\n\n 2, 5, 5, 7, 5, 4, 6, 6, 2, 4, 2, 2, 6, 4, 7, 5, // 1^\n\n 6, 6, 8, 4, 3, 3, 5, 6, 4, 2, 2, 5, 4, 4, 6, 5, // 2^\n\n 2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 2, 2, 4, 4, 7, 5, // 3^\n\n 6, 6, 2, 4, 1, 3, 5, 6, 3, 2, 2, 3, 3, 4, 6, 5, // 4^\n\n 2, 5, 5, 7, 1, 4, 6, 6, 2, 4, 3, 2, 4, 4, 7, 5, // 5^\n\n 6, 6, 6, 4, 3, 3, 5, 6, 4, 2, 2, 6, 5, 4, 6, 5, // 6^\n\n 2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 4, 2, 6, 4, 7, 5, // 7^\n\n 2, 6, 4, 4, 3, 3, 3, 6, 2, 2, 2, 3, 4, 4, 4, 5, // 8^\n\n 2, 6, 5, 7, 4, 4, 4, 6, 2, 5, 2, 2, 4, 5, 5, 5, // 9^\n\n 2, 6, 2, 4, 3, 3, 3, 6, 2, 2, 2, 4, 4, 4, 4, 5, // a^\n","file_path":"rsnes/src/instr.rs","rank":9,"score":9.977426417540729},{"content":"mod config;\n\n\n\nuse clap::{ErrorKind, Parser};\n\nuse cpal::{\n\n traits::{DeviceTrait, HostTrait, StreamTrait},\n\n Sample,\n\n};\n\nuse pollster::FutureExt;\n\nuse rsnes::{backend::ArrayFrameBuffer, device::Device, spc700::StereoSample};\n\nuse save_state::InSaveState;\n\nuse std::{\n\n path::PathBuf,\n\n time::{Duration, Instant},\n\n};\n\nuse winit::{\n\n event::{DeviceEvent, ElementState, Event, KeyboardInput, WindowEvent},\n\n event_loop::{ControlFlow, EventLoop},\n\n window::WindowBuilder,\n\n};\n\n\n\nconst MASTER_CYCLES_PER_TICK: u16 = 2;\n\n\n\n#[derive(Parser, Clone)]\n\n#[clap(\n\n version = clap::crate_version!(),\n\n)]\n","file_path":"emulator/src/main.rs","rank":10,"score":9.824422935346433},{"content":" }\n\n }\n\n\n\n pub fn enable_hdma(&mut self, value: u8) {\n\n self.hdma_enabled = value;\n\n }\n\n\n\n pub fn get_first_dma_channel_id(&mut self) -> Option<usize> {\n\n if let id @ 0..=7 = self.dma_enabled.trailing_zeros() {\n\n Some(id as usize)\n\n } else {\n\n None\n\n }\n\n }\n\n}\n\n\n\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> Device<B, FB> {\n\n fn transfer_direct_byte(\n\n &mut self,\n\n channel_id: usize,\n","file_path":"rsnes/src/dma.rs","rank":11,"score":8.710751052017837},{"content":" pub(crate) memory_cycles: Cycles,\n\n pub(crate) cpu_ahead_cycles: i32,\n\n pub(crate) new_scanline: bool,\n\n pub(crate) scanline_drawn: bool,\n\n pub new_frame: bool,\n\n pub(crate) do_hdma: bool,\n\n // multiplied by 4\n\n pub(crate) irq_time_h: u16,\n\n pub(crate) irq_time_v: u16,\n\n pub(crate) shall_irq: bool,\n\n pub(crate) shall_nmi: bool,\n\n pub(crate) nmi_vblank_bit: Cell<bool>,\n\n pub(crate) math_registers: MathRegisters,\n\n pub(crate) is_pal: bool,\n\n}\n\n\n\nimpl<B: AudioBackend, FB: FrameBuffer> Device<B, FB> {\n\n pub fn new(audio_backend: B, frame_buffer: FB, is_pal: bool, is_threaded: bool) -> Self {\n\n Self {\n\n cpu: Cpu::new(),\n","file_path":"rsnes/src/device.rs","rank":12,"score":8.703975498543358},{"content":" device.write::<D>(addr, val)\n\n }\n\n\n\n fn cpu(device: &Device<B, FB>) -> &Cpu {\n\n &device.cpu\n\n }\n\n\n\n fn cpu_mut(device: &mut Device<B, FB>) -> &mut Cpu {\n\n &mut device.cpu\n\n }\n\n\n\n fn is_main() -> bool {\n\n true\n\n }\n\n}\n\n\n\npub(crate) fn create_device_access<\n\n 'a,\n\n T: AccessType<B, FB>,\n\n B: crate::backend::AudioBackend,\n","file_path":"rsnes/src/instr.rs","rank":13,"score":8.334674630429923},{"content":" }\n\n}\n\n\n\nimpl<'a, B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer>\n\n DeviceAccess<'a, AccessTypeSa1, B, FB>\n\n{\n\n pub fn sa1(&self) -> &Sa1 {\n\n self.0.cartridge.as_ref().unwrap().sa1_ref()\n\n }\n\n\n\n pub fn sa1_mut(&mut self) -> &mut Sa1 {\n\n self.0.cartridge.as_mut().unwrap().sa1_mut()\n\n }\n\n\n\n pub fn run_dma_normal(&mut self) {\n\n todo!(\"SA-1 normal dma\")\n\n }\n\n\n\n pub fn run_dma_character_conversion_type1(&mut self) {\n\n todo!(\"SA-1 character conversion type 1 dma\")\n","file_path":"rsnes/src/enhancement/sa1.rs","rank":14,"score":8.250777710584028},{"content":" if self.math_timer == 0 {\n\n &self.result_after\n\n } else {\n\n &self.result_before\n\n }\n\n }\n\n}\n\n\n\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> Device<B, FB> {\n\n pub fn read_internal_register(&mut self, id: u16) -> Option<u8> {\n\n assert!(id >= 0x4000 && id <= 0x43ff);\n\n match id {\n\n 0x4016 => {\n\n // JOYSER0 - NES-style Joypad access\n\n Some(self.controllers.port1.read_port_data() | (self.open_bus & 0xfc))\n\n }\n\n 0x4017 => {\n\n // JOYSER1 - NES-style Joypad access\n\n Some(self.controllers.port2.read_port_data() | 0b11100 | (self.open_bus & 0xfc))\n\n }\n","file_path":"rsnes/src/registers.rs","rank":15,"score":8.057634356911395},{"content":" for d in arr.as_mut() {\n\n self.cpu_mut().regs.sp = self.cpu().regs.sp.wrapping_add(1);\n\n if self.cpu().regs.is_emulation {\n\n self.cpu_mut().regs.sp = (self.cpu().regs.sp & 0xff) | 256\n\n }\n\n *d = self.read(Addr24::new(0, self.cpu().regs.sp));\n\n }\n\n D::from_bytes(&arr)\n\n }\n\n}\n\n\n\nimpl<\n\n 'a,\n\n T: AccessType<B, FB>,\n\n B: crate::backend::AudioBackend,\n\n FB: crate::backend::FrameBuffer,\n\n > DeviceAccess<'a, T, B, FB>\n\n{\n\n fn load_indexed_v<const BC: bool>(&mut self, cycles: &mut Cycles, val: u16) -> Addr24 {\n\n let loaded_addr = self.load::<u16>();\n","file_path":"rsnes/src/instr.rs","rank":16,"score":7.9096101168024955},{"content":"pub(crate) const NECDSP_CPU_TIMING_PROPORTION_NTSC: (Cycles, Cycles) = (118125, 45056);\n\npub(crate) const NECDSP_CPU_TIMING_PROPORTION_PAL: (Cycles, Cycles) = (40591, 15625);\n\n\n\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> Device<B, FB> {\n\n pub fn run_cycle<const N: u16>(&mut self) {\n\n self.smp.tick(N);\n\n self.cartridge.as_mut().unwrap().tick(N.into());\n\n let vend = self.ppu.vend();\n\n if self.is_auto_joypad() && self.new_scanline && self.ppu.get_pos().y == vend + 2 {\n\n self.controllers.auto_joypad_timer = 4224;\n\n self.controllers.auto_joypad()\n\n }\n\n self.controllers.auto_joypad_timer -= self.controllers.auto_joypad_timer.min(N);\n\n // > The CPU is paused for 40 cycles beginning about 536 cycles\n\n // > after the start of each scanline\n\n // source: <https://wiki.superfamicom.org/timing>\n\n if self.ppu.is_cpu_active() && self.cpu.active {\n\n if self.dma.hdma_ahead_cycles > 0 {\n\n self.dma.hdma_ahead_cycles -= i32::from(N);\n\n } else if self.dma.is_dma_running() {\n","file_path":"rsnes/src/timing.rs","rank":17,"score":7.826401892685209},{"content":"//! Utilities to read a cartridge into memory\n\n//!\n\n//! # Literature\n\n//!\n\n//! - the [super famicom wiki page](https://wiki.superfamicom.org/memory-mapping)\n\n//! - <http://patrickjohnston.org/ASM/ROM data/snestek.htm>\n\n\n\nuse std::convert::TryInto;\n\n\n\nuse crate::{\n\n device::{Addr24, Data},\n\n enhancement::{sa1::Sa1, Dsp, DspVersion},\n\n timing::Cycles,\n\n};\n\nuse save_state::{SaveStateDeserializer, SaveStateSerializer};\n\nuse save_state_macro::*;\n\n\n\nconst MINIMUM_SIZE: usize = 0x8000;\n\n\n","file_path":"rsnes/src/cartridge.rs","rank":18,"score":7.552583165391597},{"content":"//! Timing control implementation\n\n//!\n\n//! # Literature\n\n//!\n\n//! - <https://wiki.superfamicom.org/timing>\n\n\n\nuse crate::{\n\n cpu::Status,\n\n device::{Addr24, Device},\n\n};\n\n\n\npub type Cycles = u32;\n\n\n\n// The SNES master clock runs at ca. (945/44) MHz which is ca. 21_477kHz;\n\n// The APU runs at 1024kHz\n\n\n\n/// This is a fractional proportion between the cpu and apu clock speed\n\npub(crate) const APU_CPU_TIMING_PROPORTION_NTSC: (Cycles, Cycles) = (118125, 5632);\n\npub(crate) const APU_CPU_TIMING_PROPORTION_PAL: (Cycles, Cycles) = (665, 32);\n\n\n","file_path":"rsnes/src/timing.rs","rank":19,"score":7.260285793113628},{"content":"use crate::device::Device;\n\nuse save_state_macro::*;\n\n\n\nconst CHIP_5A22_VERSION: u8 = 2;\n\n\n\n#[derive(Debug, Clone, InSaveState)]\n\npub struct MathRegisters {\n\n multiplicands: [u8; 2],\n\n dividend: u16,\n\n divisor: u8,\n\n math_timer: u16,\n\n result_after: [u8; 4],\n\n result_before: [u8; 4],\n\n}\n\n\n\nimpl MathRegisters {\n\n pub const fn new() -> Self {\n\n Self {\n\n multiplicands: [0xff, 0xff],\n\n dividend: 0xffff,\n","file_path":"rsnes/src/registers.rs","rank":20,"score":7.138668942032641},{"content":" fn write_bwram_small<const INTERNAL: bool>(&mut self, addr: Addr24, val: u8) {\n\n let addr = self.get_bwram_small::<INTERNAL>(addr);\n\n if INTERNAL && self.bwram_map_bits {\n\n return self.write_bwram_bits(addr, val);\n\n }\n\n self.bwram[(addr & 0x3_ffff) as usize] = val\n\n }\n\n}\n\n\n\npub struct AccessTypeSa1;\n\n\n\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> AccessType<B, FB>\n\n for AccessTypeSa1\n\n{\n\n fn read<D: Data>(device: &mut Device<B, FB>, mut addr: Addr24) -> D {\n\n let mut arr: D::Arr = Default::default();\n\n let mut open_bus = device.open_bus;\n\n let cartridge = device.cartridge.as_mut().unwrap();\n\n for v in arr.as_mut() {\n\n *v = cartridge.sa1_read::<true>(addr).unwrap_or(open_bus);\n","file_path":"rsnes/src/enhancement/sa1.rs","rank":21,"score":7.096368666745546},{"content":"//! DSP-n cartridge coprocessor handling types\n\n//!\n\n//! # Literature\n\n//!\n\n//! - https://www.caitsith2.com/snes/dsp/\n\n//! - https://datasheet.datasheetarchive.com/originals/scans/Scans-003/Scans-0079458.pdf\n\n//! - SNES book 2 - Section 3\n\n\n\nuse crate::timing::Cycles;\n\nuse save_state::{InSaveState, SaveStateDeserializer, SaveStateSerializer};\n\nuse save_state_macro::InSaveState;\n\n\n\npub const ROM_SIZE: usize = 0x2000;\n\n\n\n#[derive(Debug, Clone, Copy, InSaveState)]\n\npub struct Stack {\n\n stack: [u16; 4],\n\n size: u8,\n\n}\n\n\n","file_path":"rsnes/src/enhancement/dsp.rs","rank":22,"score":7.021960370732151},{"content":"//! SA-1 Coprocessor handling types\n\n//!\n\n//! # Literature\n\n//!\n\n//! - <https://wiki.superfamicom.org/sa-1>\n\n//! - <https://wiki.superfamicom.org/sa-1-registers>\n\n//! - <https://wiki.superfamicom.org/uploads/assembly-programming-manual-for-w65c816.pdf>\n\n//! - <https://problemkaputt.de/fullsnes.htm>\n\n\n\nuse crate::{\n\n cartridge::Cartridge,\n\n cpu::{Cpu, Status},\n\n device::{Addr24, Data, Device},\n\n instr::{AccessType, DeviceAccess},\n\n};\n\nuse core::mem::replace;\n\nuse save_state_macro::*;\n\n\n\nconst IRAM_SIZE: usize = 0x800;\n\nconst BWRAM_SIZE: usize = 0x40000;\n","file_path":"rsnes/src/enhancement/sa1.rs","rank":23,"score":6.983826775752403},{"content":" fn to_open_bus(self) -> u8 {\n\n self.bank\n\n }\n\n fn from_open_bus(open_bus: u8) -> Self {\n\n Self::new(open_bus, open_bus as u16 | ((open_bus as u16) << 8))\n\n }\n\n}\n\n\n\n#[derive(Debug, InSaveState)]\n\npub struct Device<B: AudioBackend, FB: FrameBuffer> {\n\n pub(crate) cpu: Cpu,\n\n pub smp: Smp<B>,\n\n pub ppu: Ppu<FB>,\n\n pub(crate) dma: Dma,\n\n pub controllers: ControllerPorts,\n\n pub(crate) cartridge: Option<Cartridge>,\n\n /// <https://wiki.superfamicom.org/open-bus>\n\n pub(crate) open_bus: u8,\n\n ram: [u8; RAM_SIZE],\n\n wram_addr: Cell<u32>,\n","file_path":"rsnes/src/device.rs","rank":24,"score":6.9056384970808775},{"content":"use crate::oam::{CgRam, Oam, Object};\n\nuse core::mem::{replace, take};\n\nuse save_state::{SaveStateDeserializer, SaveStateSerializer};\n\nuse save_state_macro::*;\n\n\n\npub const VRAM_SIZE: usize = 0x8000;\n\npub const SCREEN_WIDTH: u32 = 256;\n\npub const MAX_SCREEN_HEIGHT: u32 = 224;\n\npub const MAX_SCREEN_HEIGHT_OVERSCAN: u32 = 239;\n\npub const CHIP_5C77_VERSION: u8 = 1;\n\npub const CHIP_5C78_VERSION: u8 = 3;\n\n\n\n// TODO: Check the exact value of this.\n\n// wiki.superfamicom.org/timing states that\n\n// when we disable Force Blank mid-scanline,\n\n// there is garbage for about 16-24 pixels.\n\npub const RAY_AHEAD_CYCLES: u16 = 20 * 4;\n\n\n\nstatic OBJ_SIZES: [[[u8; 2]; 2]; 8] = [\n\n [[8, 8], [16, 16]],\n","file_path":"rsnes/src/ppu.rs","rank":26,"score":6.781066332331774},{"content":"use crate::device::{Addr24, Device};\n\nuse save_state_macro::*;\n\n\n\npub mod flags {\n\n pub const MODE: u8 = 0b111;\n\n pub const FIXED: u8 = 0x08;\n\n pub const DECREMENT: u8 = 0x10;\n\n pub const INDIRECT: u8 = 0x40;\n\n pub const PPU_TO_CPU: u8 = 0x80;\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, InSaveState)]\n\npub struct Channel {\n\n a_bus: Addr24,\n\n b_bus: u8,\n\n size: u16,\n\n indirect_bank: u8,\n\n control: u8,\n\n unknown_register: u8,\n\n table: u16,\n","file_path":"rsnes/src/dma.rs","rank":27,"score":6.582801313466065},{"content":"//! 65816/65C816 CPU handling types\n\n//!\n\n//! # Literature\n\n//!\n\n//! - the [super famicom wiki page](https://wiki.superfamicom.org/65816-reference)\n\n//! - <https://apprize.best/programming/65816/>\n\n//! - <https://www.westerndesigncenter.com/wdc/documentation/w65c816s.pdf>\n\n//! - <https://wiki.superfamicom.org/uploads/assembly-programming-manual-for-w65c816.pdf>\n\n\n\nuse crate::device::Addr24;\n\nuse core::ops::{BitAnd, BitAndAssign, BitOr, BitOrAssign, Not};\n\nuse save_state_macro::*;\n\n\n\npub const RESET_VECTOR_ADDR: Addr24 = Addr24::new(0, 0xfffc);\n\n\n\n/// Structure containing the processor registers\n\n#[derive(Debug, Clone, InSaveState)]\n\npub struct Regs {\n\n /// The accumulator register\n\n pub a: u16,\n","file_path":"rsnes/src/cpu.rs","rank":28,"score":6.526092476636515},{"content":"//! SPC700 Sound Coprocessor handling types\n\n//!\n\n//! # Literature\n\n//!\n\n//! - <https://wiki.superfamicom.org/spc700-reference>\n\n//! - <https://emudev.de/q00-snes/spc700-the-audio-processor/>\n\n//! - The first of the two official SNES documentation books\n\n\n\nuse crate::timing::Cycles;\n\nuse core::{cell::Cell, mem::take};\n\nuse save_state::{SaveStateDeserializer, SaveStateSerializer};\n\nuse save_state_macro::*;\n\n\n\npub const MEMORY_SIZE: usize = 64 * 1024;\n\n\n\nstatic ROM: [u8; 64] = [\n\n 0xCD, 0xEF, 0xBD, 0xE8, 0x00, 0xC6, 0x1D, 0xD0, 0xFC, 0x8F, 0xAA, 0xF4, 0x8F, 0xBB, 0xF5, 0x78,\n\n 0xCC, 0xF4, 0xD0, 0xFB, 0x2F, 0x19, 0xEB, 0xF4, 0xD0, 0xFC, 0x7E, 0xF4, 0xD0, 0x0B, 0xE4, 0xF5,\n\n 0xCB, 0xF4, 0xD7, 0x00, 0xFC, 0xD0, 0xF3, 0xAB, 0x01, 0x10, 0xEF, 0x7E, 0xF4, 0x10, 0xEB, 0xBA,\n\n 0xF6, 0xDA, 0x00, 0xBA, 0xF4, 0xC4, 0xF4, 0xDD, 0x5D, 0xD0, 0xDB, 0x1F, 0x00, 0x00, 0xC0, 0xFF,\n","file_path":"rsnes/src/spc700.rs","rank":29,"score":5.627857657768466},{"content":" }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, InSaveState)]\n\npub struct Ppu<FB: crate::backend::FrameBuffer> {\n\n #[except((|_v, _s| ()), (|_v, _s| ()))]\n\n pub frame_buffer: FB,\n\n oam: Oam,\n\n cgram: CgRam,\n\n vram: Vram,\n\n bgs: [Bg; 4],\n\n bg_mode: BgMode,\n\n bg3_prio: bool,\n\n pos: RayPos,\n\n latched: LatchedState,\n\n brightness: u8,\n\n draw_layers: Layers,\n\n /// Object sizes in (x, y) = `[u8; 2]` for small sprites (=`obj_size[0]`) and large sprites\n\n /// (=`obj_size[1]`) in pixels\n","file_path":"rsnes/src/ppu.rs","rank":30,"score":5.5268974273080715},{"content":" is_pal,\n\n }\n\n }\n\n\n\n pub fn with_main_cpu<'a>(\n\n &'a mut self,\n\n ) -> crate::instr::DeviceAccess<'a, crate::instr::AccessTypeMain, B, FB> {\n\n crate::instr::create_device_access(self)\n\n }\n\n\n\n pub fn with_sa1_cpu<'a>(\n\n &'a mut self,\n\n ) -> crate::instr::DeviceAccess<'a, crate::enhancement::sa1::AccessTypeSa1, B, FB> {\n\n crate::instr::create_device_access(self)\n\n }\n\n\n\n pub fn get_irq_pin(&self) -> bool {\n\n match &self.cartridge {\n\n Some(cart) if cart.has_sa1() => cart.sa1_ref().irq_pin(),\n\n _ => false,\n","file_path":"rsnes/src/device.rs","rank":31,"score":5.241057015466465},{"content":" pub regs: Regs,\n\n pub(crate) nmitimen: u8,\n\n pub(crate) access_speed: bool,\n\n pub(crate) in_nmi: bool,\n\n pub(crate) irq_bit: u8,\n\n pub wait_mode: bool,\n\n pub active: bool,\n\n}\n\n\n\nimpl Cpu {\n\n pub const fn new() -> Self {\n\n Self {\n\n regs: Regs {\n\n a: 0,\n\n x: 0,\n\n y: 0,\n\n sp: 0x100,\n\n dp: 0,\n\n pc: Addr24::new(0, 0),\n\n db: 0,\n","file_path":"rsnes/src/cpu.rs","rank":33,"score":5.055984588410108},{"content":"}\n\n\n\nimpl<FB: crate::backend::FrameBuffer> Ppu<FB> {\n\n pub fn new(frame_buffer: FB, is_pal: bool) -> Self {\n\n let bg_mode = BgMode::new(0, false, false);\n\n Self {\n\n frame_buffer,\n\n oam: Oam::new(),\n\n cgram: CgRam::new(),\n\n vram: Vram::new(),\n\n bgs: [Bg::new(); 4],\n\n bg_mode,\n\n bg3_prio: false,\n\n pos: Default::default(),\n\n latched: Default::default(),\n\n brightness: 15,\n\n draw_layers: Layers::from_bgmode(bg_mode),\n\n obj_size: OBJ_SIZES[0],\n\n obj_tile_addr: [0; 2],\n\n obj_layer: Layer::new(),\n","file_path":"rsnes/src/ppu.rs","rank":34,"score":5.048335567831096},{"content":"## Structure\n\n\n\nThis repository is a workspace consisting of two crates\n\n\n\n- `rsnes` - the SNES backend library (located in `/rsnes/`)\n\n- `rsnes-emulator` - a sample frontend implementation using `winit` and `wgpu`\n\n (located in `/emulator/`)\n\n\n\n⚠️ Please note that the `rsnes` API is neither tested nor documented (well) ⚠️\n\n\n\n⚠️ Also note, that `rsnes-emulator` is only tested on Linux/X11 ⚠️\n\n\n\n## Features\n\n\n\nThis is a set of features to be implemented in the future (sorted by priority)\n\n\n\n- [x] Mode 7 support\n\n- [x] Sprite support\n\n- [x] Color math\n\n- [x] S-DSP echo effect support\n\n- [x] S-DSP noise effect support\n\n- [x] PPU Mosaic effect\n\n- [ ] Save game to files\n\n- [ ] SA-1 support\n\n- [ ] Real gamepad input support for `rsnes-emulator`\n\n (see [winit#944](https://github.com/rust-windowing/winit/issues/944),\n\n maybe use unstable fork or branch?)\n\n- [ ] Improved documentation\n\n- [ ] Tests\n\n - [ ] 65816 processor instruction tests\n\n - [ ] SPC-700 processor instruction tests\n\n - [ ] Audio tests\n\n - [ ] Video output tests\n\n- [ ] configurable UI\n\n - [x] configurable key bindings\n\n- [ ] emulator running also on [WASM](https://webassembly.org/)\n\n- [x] [DSP](https://en.wikipedia.org/wiki/NEC_%C2%B5PD7720#%C2%B5PD77C25)\n\n coprocessor support\n\n - [x] DSP-1, DSP-1A, DSP-1B\n\n - [x] DSP-2, DSP-3, DSP-4 (low priority)\n\n - [ ] ST010, ST011 (very low priority)\n\n- [ ] [GSU](https://en.wikipedia.org/wiki/Super_FX) coprocessor support\n\n (also known as Super FX)\n\n - [ ] GSU1\n\n - [ ] GSU2\n\n- [x] Complete the 65816 instruction set\n\n- [x] Complete the SPC700 instruction set\n\n- [x] Complete the NEC μPD77C25 instruction set\n\n- [ ] Complete the GSU instruction set\n\n- [ ] Multitap (MP5) controller support\n\n- [x] [SNES Mouse](https://en.wikipedia.org/wiki/Super_NES_Mouse) support\n\n- [ ] [SNES Super Scope](https://en.wikipedia.org/wiki/Super_Scope) support\n\n- [x] Save States\n\n- [ ] Capcom CX4 coprocessor support\n\n (this processor is only used in Mega Man X2 and Mega Man X3)\n\n- [ ] SPC7110 data decompression chip\n\n\n\n## Contributing\n\n\n\nContributions of any kind (bug reports, feature requests, pull requests, …) are\n\nvery welcome.\n","file_path":"README.md","rank":35,"score":4.904464592991095},{"content":" pub(crate) addr: u16,\n\n pub(crate) addr_inc: u16,\n\n stashed_write: u8,\n\n pub(crate) priority: bool,\n\n}\n\n\n\nimpl Oam {\n\n pub const fn new() -> Self {\n\n Self {\n\n objs: [Object::new(); 128],\n\n addr: 0,\n\n addr_inc: 0,\n\n stashed_write: 0,\n\n priority: false,\n\n }\n\n }\n\n\n\n /// Reset the OAM address.\n\n /// This occurs usually at the beginning of a V-Blank\n\n /// if it is not fblanked.\n","file_path":"rsnes/src/oam.rs","rank":36,"score":4.761550563484011},{"content":"use super::*;\n\n\n\n#[test]\n","file_path":"save-state/src/tests.rs","rank":37,"score":4.750245969755288},{"content":"use proc_macro::TokenStream;\n\n\n","file_path":"save-state-macro/src/lib.rs","rank":38,"score":4.624557574132381},{"content":" let firstsprite = self.oam.get_first_sprite();\n\n for obj_id in 0..128 {\n\n let obj = &mut self.oam.objs[usize::from(obj_id + firstsprite) & 0x7f];\n\n obj.used = false;\n\n let size = self.obj_size[usize::from(obj.is_large)];\n\n if (-i16::from(size[0]) >= obj.x && obj.x != -256)\n\n || obj.x >= 256\n\n || y.wrapping_sub(obj.y) >= size[1]\n\n {\n\n continue;\n\n }\n\n if objs_in_line >= 32 {\n\n self.overflow_flags |= 0x40;\n\n break;\n\n }\n\n obj.used = true;\n\n }\n\n 'obj_loop: for obj in 0..128 {\n\n let obj = self.oam.objs[!usize::from(obj + firstsprite) & 0x7f];\n\n if !obj.used {\n","file_path":"rsnes/src/ppu.rs","rank":40,"score":4.458969120907609},{"content":"impl rsnes::backend::AudioBackend for AudioBackend {\n\n fn push_sample(&mut self, sample: StereoSample) {\n\n let _ = self\n\n .producer\n\n .push(sample.l)\n\n .and_then(|()| self.producer.push(sample.r));\n\n }\n\n}\n\n\n\nmod shaders {\n\n macro_rules! include_shader {\n\n ($t:expr) => {\n\n include_bytes!(concat!(env!(\"OUT_DIR\"), \"/\", $t))\n\n };\n\n }\n\n\n\n static VERTEX_SHADER: &[u8] = include_shader!(\"main.vertex.spirv\");\n\n static FRAGMENT_SHADER: &[u8] = include_shader!(\"main.fragment.spirv\");\n\n\n\n fn create_shader(device: &wgpu::Device, source: &[u8]) -> wgpu::ShaderModule {\n","file_path":"emulator/src/main.rs","rank":42,"score":4.410427340000471},{"content":"use std::collections::HashMap;\n\nuse std::path::{Path, PathBuf};\n\nuse toml::value::{Table, Value};\n\n\n\nstatic CONFIG_FILE_PATHS: &'static [(bool, &'static str)] = &[\n\n (true, \".config/rsnes/config.toml\"),\n\n (true, \".config/rsnes.toml\"),\n\n (false, \"/etc/rsnes.toml\"),\n\n];\n\n\n\n#[derive(Debug)]\n\npub enum ConfigLoadError {\n\n Io(std::io::Error),\n\n De(toml::de::Error),\n\n WrongType {\n\n expected: &'static str,\n\n got: &'static str,\n\n },\n\n UnknownField(String),\n\n RequiredAttr {\n","file_path":"emulator/src/config.rs","rank":43,"score":4.312282893611155},{"content":"use save_state_macro::*;\n\n\n\n#[derive(Debug, Clone, Copy, InSaveState)]\n\npub struct Object {\n\n pub x: i16,\n\n pub y: u8,\n\n pub tile_nr: u8,\n\n pub attrs: u8,\n\n pub is_large: bool,\n\n\n\n pub used: bool,\n\n}\n\n\n\nimpl Object {\n\n pub const fn new() -> Object {\n\n Self {\n\n x: 0,\n\n y: 0,\n\n tile_nr: 0,\n\n attrs: 0,\n","file_path":"rsnes/src/oam.rs","rank":45,"score":4.292078969250371},{"content":"mod dsp;\n\npub mod sa1;\n\n\n\n#[doc(inline)]\n\npub use dsp::{Dsp, DspVersion};\n","file_path":"rsnes/src/enhancement/mod.rs","rank":46,"score":4.232587365549692},{"content":" }\n\n\n\n pub fn set_region(&mut self, pal: bool) {\n\n if let Some(dsp) = &mut self.dsp {\n\n dsp.set_timing_proportion(if pal {\n\n crate::timing::NECDSP_CPU_TIMING_PROPORTION_PAL\n\n } else {\n\n crate::timing::NECDSP_CPU_TIMING_PROPORTION_NTSC\n\n })\n\n }\n\n if let Some(sa1) = &mut self.sa1 {\n\n sa1.set_region(pal)\n\n }\n\n }\n\n\n\n pub fn tick(&mut self, n: Cycles) {\n\n if let Some(dsp) = &mut self.dsp {\n\n dsp.tick(n)\n\n }\n\n }\n","file_path":"rsnes/src/cartridge.rs","rank":48,"score":4.138564499286767},{"content":"}\n\n\n\n#[derive(Debug, Clone, InSaveState)]\n\npub struct Dma {\n\n channels: [Channel; 8],\n\n running: bool,\n\n dma_enabled: u8,\n\n hdma_enabled: u8,\n\n cancelled: u8,\n\n do_transfer: u8,\n\n pub(crate) hdma_ahead_cycles: i32,\n\n pub(crate) ahead_cycles: i32,\n\n}\n\n\n\nimpl Dma {\n\n pub fn new() -> Self {\n\n Self {\n\n channels: [Channel::new(); 8],\n\n running: false,\n\n dma_enabled: 0,\n","file_path":"rsnes/src/dma.rs","rank":49,"score":4.114203646523293},{"content":"use shaderc::{CompileOptions, Compiler, OptimizationLevel, ShaderKind, SourceLanguage::GLSL};\n\n\n\nconst SHADERS_PATH: &str = \"shaders/\";\n\n\n\n#[allow(clippy::enum_variant_names)]\n","file_path":"emulator/build.rs","rank":50,"score":3.8587980629602967},{"content":" left,\n\n down,\n\n right,\n\n l,\n\n r,\n\n start,\n\n select,\n\n },\n\n } => {\n\n use rsnes::controller::buttons::*;\n\n let mut key = 0;\n\n for (code, button) in [\n\n (a, A),\n\n (b, B),\n\n (x, X),\n\n (y, Y),\n\n (up, UP),\n\n (left, LEFT),\n\n (down, DOWN),\n\n (right, RIGHT),\n","file_path":"emulator/src/config.rs","rank":51,"score":3.816665771476231},{"content":"use core::{cell::Cell, mem::replace};\n\nuse save_state_macro::*;\n\n\n\npub mod buttons {\n\n pub const B: u16 = 1;\n\n pub const Y: u16 = 2;\n\n pub const SELECT: u16 = 4;\n\n pub const START: u16 = 8;\n\n pub const UP: u16 = 0x10;\n\n pub const DOWN: u16 = 0x20;\n\n pub const LEFT: u16 = 0x40;\n\n pub const RIGHT: u16 = 0x80;\n\n pub const A: u16 = 0x100;\n\n pub const X: u16 = 0x200;\n\n pub const L: u16 = 0x400;\n\n pub const R: u16 = 0x800;\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub enum Controller {\n","file_path":"rsnes/src/controller.rs","rank":52,"score":3.8019180792270153},{"content":" cartridge.header()\n\n );\n\n }\n\n let is_pal = match profile.region {\n\n rsnes::cartridge::CountryFrameRate::Any => matches!(\n\n cartridge.get_country_frame_rate(),\n\n rsnes::cartridge::CountryFrameRate::Pal\n\n ),\n\n rsnes::cartridge::CountryFrameRate::Pal => true,\n\n rsnes::cartridge::CountryFrameRate::Ntsc => false,\n\n };\n\n if options.verbose {\n\n println!(\n\n \"[info] Selected {} region\",\n\n if is_pal { \"PAL\" } else { \"NTSC\" }\n\n );\n\n }\n\n let (audio_backend, _audio_stream) =\n\n AudioBackend::new().unwrap_or_else(|| error!(\"Failed finding an audio output device\"));\n\n let mut snes = Device::new(\n","file_path":"emulator/src/main.rs","rank":53,"score":3.688157691851025},{"content":" obj_size: [[u8; 2]; 2],\n\n /// Tile base address without and with gap\n\n obj_tile_addr: [u16; 2],\n\n obj_layer: Layer,\n\n obj_cache: [ObjCacheEntry; 256],\n\n overflow_flags: u8,\n\n color_math: ColorMath,\n\n direct_color_mode: bool,\n\n object_interlace: bool,\n\n interlace_active: bool,\n\n window_positions: [[u8; 2]; 2],\n\n overscan: bool,\n\n pseudo512: bool,\n\n mosaic_size: u8,\n\n mode7_settings: Mode7Settings,\n\n field: bool,\n\n force_blank: bool,\n\n is_pal: bool,\n\n pub(crate) open_bus1: u8,\n\n pub(crate) open_bus2: u8,\n","file_path":"rsnes/src/ppu.rs","rank":54,"score":3.6425040709105185},{"content":" audio_backend,\n\n ArrayFrameBuffer([[0; 4]; rsnes::backend::FRAME_BUFFER_SIZE], true),\n\n is_pal,\n\n profile.threaded,\n\n );\n\n snes.controllers.port1 = config::controller_profile_to_port(port1_profile.as_ref());\n\n snes.controllers.port2 = config::controller_profile_to_port(port2_profile.as_ref());\n\n snes.load_cartridge(cartridge);\n\n\n\n let size = winit::dpi::PhysicalSize::new(\n\n rsnes::ppu::SCREEN_WIDTH * 4,\n\n rsnes::ppu::MAX_SCREEN_HEIGHT * 4,\n\n );\n\n let event_loop = EventLoop::new();\n\n let window = WindowBuilder::new()\n\n .with_decorations(true)\n\n .with_visible(true)\n\n .with_fullscreen(None)\n\n .with_resizable(true)\n\n .with_maximized(false)\n","file_path":"emulator/src/main.rs","rank":56,"score":3.5570304314817576},{"content":" self.with_main_cpu().dispatch_instruction() * 6\n\n }) + self.memory_cycles;\n\n self.cpu_ahead_cycles += cycles as i32;\n\n }\n\n }\n\n\n\n pub fn get_memory_cycle(&self, addr: Addr24) -> Cycles {\n\n #[repr(u8)]\n\n enum Speed {\n\n Fast = 6,\n\n Slow = 8,\n\n XSlow = 12,\n\n }\n\n use Speed::*;\n\n macro_rules! romaccess {\n\n () => {\n\n if self.cpu.access_speed {\n\n Fast\n\n } else {\n\n Slow\n","file_path":"rsnes/src/timing.rs","rank":57,"score":3.310609288229365},{"content":" let data = port.read_port_data();\n\n port.data1 |= u16::from(data & 1);\n\n port.data2 |= u16::from(data >> 1);\n\n }\n\n }\n\n }\n\n\n\n pub(crate) fn access(&self, id: u16) -> u8 {\n\n let port = if id & 2 > 0 { &self.port2 } else { &self.port1 };\n\n let data = if id & 4 > 0 { port.data2 } else { port.data1 };\n\n if id & 1 > 0 {\n\n (data >> 8) as u8\n\n } else {\n\n (data & 0xff) as u8\n\n }\n\n }\n\n}\n","file_path":"rsnes/src/controller.rs","rank":58,"score":3.3097855653128936},{"content":"pub mod backend;\n\npub mod cartridge;\n\npub mod controller;\n\npub mod cpu;\n\npub mod device;\n\npub mod dma;\n\npub mod enhancement;\n\nmod instr;\n\npub mod oam;\n\npub mod ppu;\n\nmod registers;\n\npub mod smp;\n\npub mod spc700;\n\nmod timing;\n","file_path":"rsnes/src/lib.rs","rank":59,"score":3.195291310052478},{"content":" } else {\n\n None\n\n }\n\n }\n\n }\n\n\n\n pub fn write_byte(&mut self, addr: Addr24, val: u8) {\n\n if self.has_sa1() {\n\n self.sa1_write::<false>(addr, val)\n\n } else {\n\n if let Some((index, MappingEntry { write, .. })) = self.mapping.find(addr) {\n\n write.get()(self, index, val)\n\n }\n\n }\n\n }\n\n\n\n pub const fn get_country_frame_rate(&self) -> CountryFrameRate {\n\n use CountryFrameRate::*;\n\n match self.header.country {\n\n 0 | 1 | 13 | 15 => Ntsc,\n","file_path":"rsnes/src/cartridge.rs","rank":60,"score":3.104776209819407},{"content":"\n\nimpl<T: InSaveState + Default> InSaveState for Option<T> {\n\n fn serialize(&self, state: &mut SaveStateSerializer) {\n\n self.is_some().serialize(state);\n\n match self {\n\n Some(v) => v.serialize(state),\n\n // TODO: use extend_from_slice when const generics get stabilized enough\n\n None => (),\n\n }\n\n }\n\n\n\n fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\n\n let mut i = false;\n\n i.deserialize(state);\n\n *self = if i {\n\n let mut i = T::default();\n\n i.deserialize(state);\n\n Some(i)\n\n } else {\n\n None\n","file_path":"save-state/src/lib.rs","rank":61,"score":2.9982546049737335},{"content":" is_large: false,\n\n used: false,\n\n }\n\n }\n\n\n\n pub fn write_low_low(&mut self, val1: u8, val2: u8) {\n\n self.x = (((self.x as u16) & 0xff00) | u16::from(val1)) as i16;\n\n self.y = val2;\n\n }\n\n\n\n pub fn write_low_high(&mut self, val1: u8, val2: u8) {\n\n self.tile_nr = val1;\n\n self.attrs = val2;\n\n }\n\n\n\n pub fn write_high(&mut self, val: u8) {\n\n self.x = ((self.x as u16 & 0xff) | (0u16.wrapping_sub((val & 1).into()) & 0xff00)) as i16;\n\n self.is_large = val & 2 > 0;\n\n }\n\n\n","file_path":"rsnes/src/oam.rs","rank":62,"score":2.923039790333628},{"content":" fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\n\n self.get_mut().deserialize(state)\n\n }\n\n}\n\n\n\n// This uses 0 and 255 for false and true. That will make the memory\n\n// representation more robust against memory corruption by random\n\n// bit flips.\n\nimpl InSaveState for bool {\n\n fn serialize(&self, state: &mut SaveStateSerializer) {\n\n let i: u8 = if *self { 0xff } else { 0 };\n\n i.serialize(state)\n\n }\n\n\n\n fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\n\n let mut i: u8 = 0;\n\n i.deserialize(state);\n\n *self = i.count_ones() >= 4\n\n }\n\n}\n","file_path":"save-state/src/lib.rs","rank":63,"score":2.8987998328877493},{"content":" }\n\n\n\n pub const fn is_xflip(&self) -> bool {\n\n self.attrs & 0x40 > 0\n\n }\n\n\n\n pub const fn is_yflip(&self) -> bool {\n\n self.attrs & 0x80 > 0\n\n }\n\n\n\n pub fn get_tile_addr(&self, base: u16, tilex: u8, tiley: u8) -> u16 {\n\n let tile_nr = self.tile_nr.wrapping_add(tilex).wrapping_add(tiley << 4);\n\n base.wrapping_add(u16::from(tile_nr) << 4)\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, InSaveState)]\n\npub struct Oam {\n\n pub(crate) objs: [Object; 128],\n\n // 10-bit value\n","file_path":"rsnes/src/oam.rs","rank":64,"score":2.8980785735530694},{"content":"\n\n pub const fn to_byte(self) -> u8 {\n\n self as u8\n\n }\n\n}\n\n\n\nimpl save_state::InSaveState for MaskLogic {\n\n fn serialize(&self, state: &mut SaveStateSerializer) {\n\n self.to_byte().serialize(state)\n\n }\n\n\n\n fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\n\n let mut n: u8 = 0;\n\n n.deserialize(state);\n\n *self = Self::from_byte(n)\n\n }\n\n}\n\n\n\nconst fn sign_extend<const B: u16>(n: u16) -> u16 {\n\n if n & ((1 << B) >> 1) > 0 {\n\n n | !((1 << B) - 1)\n\n } else {\n\n n & (((1 << B) >> 1) - 1)\n\n }\n\n}\n\n\n\n/// Settings used to draw Mode 7's BG1.\n\n#[derive(Debug, Clone, InSaveState)]\n","file_path":"rsnes/src/ppu.rs","rank":65,"score":2.8515063322121477},{"content":" (1, 32) => DspVersion::Dsp2,\n\n (1, 8) => DspVersion::Dsp3,\n\n (2, 8) => DspVersion::Dsp1,\n\n _ => DspVersion::Dsp1B,\n\n },\n\n RomType::HiRom => match (rom_size >> 20, ram_size >> 10) {\n\n (4, 0) => DspVersion::Dsp1,\n\n (4, 2) => DspVersion::Dsp1B, // TODO: Some games may use DSP1 (?)\n\n (2, 2 | 8) => DspVersion::Dsp1B,\n\n _ => DspVersion::Dsp1B, // TODO: is this appropriate?\n\n },\n\n _ => return None,\n\n };\n\n Some(ver)\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\n\npub enum CountryFrameRate {\n\n Any,\n","file_path":"rsnes/src/cartridge.rs","rank":66,"score":2.7397593853614755},{"content":" header = Some((new, score));\n\n }\n\n }\n\n }\n\n }\n\n let (header, _score) = header.ok_or(ReadRomError::NoSuitableHeader)?;\n\n\n\n let rom = create_rom(bytes, header.rom_size);\n\n\n\n use core::num::Wrapping;\n\n let Wrapping(checksum): Wrapping<u16> =\n\n rom.iter().copied().map(Into::into).map(Wrapping).sum();\n\n if checksum != header.checksum {\n\n eprintln!(\"warning: checksum did not match! Checksum in ROM is {:04x}; Calculated checksum is {:04x}\", header.checksum, checksum);\n\n }\n\n\n\n let ram_size = header.ram_size;\n\n\n\n let dsp = if let Some(Coprocessor::Dsp) = header.coprocessor {\n\n let ver = header\n","file_path":"rsnes/src/cartridge.rs","rank":67,"score":2.676818690633497},{"content":" pub port1: ControllerPort,\n\n pub port2: ControllerPort,\n\n pio: u8,\n\n pub(crate) auto_joypad_timer: u16,\n\n}\n\n\n\nimpl ControllerPorts {\n\n pub fn new() -> Self {\n\n Self {\n\n port1: ControllerPort::new(Controller::Standard(StandardController::new())),\n\n port2: ControllerPort::new(Controller::None),\n\n pio: 0,\n\n auto_joypad_timer: 0,\n\n }\n\n }\n\n\n\n /// Write to the programmable I/O-port.\n\n /// Returns if EXTLATCH shall be triggered.\n\n pub fn set_pio(&mut self, val: u8) -> bool {\n\n (replace(&mut self.pio, val) & !val) & 0x80 > 0\n","file_path":"rsnes/src/controller.rs","rank":68,"score":2.616053864453213},{"content":" }\n\n }\n\n\n\n pub fn load_cartridge(&mut self, mut cartridge: Cartridge) {\n\n cartridge.set_region(self.is_pal);\n\n self.cartridge = Some(cartridge);\n\n self.cpu = Cpu::new();\n\n self.reset_program_counter();\n\n }\n\n\n\n pub fn reset_program_counter(&mut self) {\n\n let addr = crate::cpu::RESET_VECTOR_ADDR;\n\n self.cpu.regs.pc = Addr24::new(0, self.read::<u16>(addr));\n\n if self.cartridge.as_ref().unwrap().has_sa1() {\n\n let vector = self.with_sa1_cpu().read::<u16>(addr);\n\n self.cartridge.as_mut().unwrap().sa1_mut().cpu_mut().regs.pc = Addr24::new(0, vector);\n\n }\n\n }\n\n\n\n /// Read a value from the mapped memory at the specified address.\n","file_path":"rsnes/src/device.rs","rank":69,"score":2.5585950757866573},{"content":" state.data.as_slice()[..core::mem::size_of::<[T; N]>()].try_into();\n\n state.consume(N);\n\n // TODO: use normal transmute instead as soon as possible!!\n\n // see https://github.com/rust-lang/rust/issues/43408\n\n // see https://github.com/rust-lang/rust/issues/60471\n\n *self = unsafe { core::mem::transmute_copy(res.unwrap()) }\n\n } else {\n\n panic!(\"not enough data to deserialize\")\n\n }\n\n } else {\n\n self.iter_mut().for_each(|i| i.deserialize(state))\n\n }\n\n }\n\n}\n\n\n\nimpl<T: InSaveState + Copy> InSaveState for core::cell::Cell<T> {\n\n fn serialize(&self, state: &mut SaveStateSerializer) {\n\n self.get().serialize(state)\n\n }\n\n\n","file_path":"save-state/src/lib.rs","rank":70,"score":2.5042291658399822},{"content":" smp: Smp::new(audio_backend, is_pal, is_threaded),\n\n ppu: Ppu::new(frame_buffer, is_pal),\n\n dma: Dma::new(),\n\n controllers: ControllerPorts::new(),\n\n cartridge: None,\n\n open_bus: 0,\n\n ram: [0; RAM_SIZE],\n\n wram_addr: Cell::new(0),\n\n memory_cycles: 0,\n\n cpu_ahead_cycles: 186,\n\n new_scanline: true,\n\n new_frame: true,\n\n scanline_drawn: false,\n\n do_hdma: true,\n\n irq_time_h: 0x7fc,\n\n irq_time_v: 0x1ff,\n\n shall_irq: false,\n\n shall_nmi: false,\n\n nmi_vblank_bit: Cell::new(false),\n\n math_registers: MathRegisters::new(),\n","file_path":"rsnes/src/device.rs","rank":71,"score":2.4907200173152133},{"content":" while !snes.new_frame {\n\n snes.run_cycle::<MASTER_CYCLES_PER_TICK>();\n\n cycle_count += u64::from(MASTER_CYCLES_PER_TICK)\n\n }\n\n // a more precise calculation is not possible by using floats\n\n next_device_update += Duration::from_nanos((8800 * cycle_count) / 189);\n\n // reset the next update timer if it fell to far behind\n\n if now > next_device_update + TIME_UNTIL_TIMER_RESET {\n\n next_device_update = now;\n\n }\n\n }\n\n let now = Instant::now();\n\n if now >= next_graphics_update {\n\n window.request_redraw();\n\n next_graphics_update = now + TIME_PER_GPU_FRAME;\n\n }\n\n }\n\n Event::RedrawRequested(_) => {\n\n match surf.get_current_texture() {\n\n Ok(surface_texture) => {\n","file_path":"emulator/src/main.rs","rank":72,"score":2.384644720965176},{"content":" if vblanked {\n\n self.ppu.vblank();\n\n }\n\n if self.ppu.get_pos().x + crate::ppu::RAY_AHEAD_CYCLES >= self.ppu.get_scanline_cycles()\n\n && self.ppu.get_pos().y + 1 < vend\n\n && !self.scanline_drawn\n\n {\n\n self.scanline_drawn = true;\n\n self.ppu.draw_scanline();\n\n }\n\n let h_irq_enabled = self.cpu.nmitimen & 0x10 > 0;\n\n let v_irq_enabled = self.cpu.nmitimen & 0x20 > 0;\n\n self.shall_irq = self.shall_irq\n\n || ((h_irq_enabled || v_irq_enabled)\n\n && (!h_irq_enabled\n\n || ((self.ppu.get_pos().x as i16 - N as i16) >> 2 < self.irq_time_h as i16\n\n && self.ppu.get_pos().x >> 2 >= self.irq_time_h))\n\n && (!v_irq_enabled || self.ppu.get_pos().y == self.irq_time_v)\n\n && (h_irq_enabled || !v_irq_enabled || self.new_scanline));\n\n self.nmi_vblank_bit\n","file_path":"rsnes/src/timing.rs","rank":73,"score":2.3678979301584704},{"content":" .with_inner_size(size)\n\n .with_title(format!(\"{} - {}\", env!(\"CARGO_PKG_NAME\"), title))\n\n .build(&event_loop)\n\n .unwrap_or_else(|err| error!(\"Failure while creating window ({})\", err));\n\n\n\n let inst = wgpu::Instance::new(wgpu::Backends::VULKAN);\n\n let surf = unsafe { inst.create_surface(&window) };\n\n let adapter = inst\n\n .request_adapter(&wgpu::RequestAdapterOptions {\n\n power_preference: wgpu::PowerPreference::LowPower,\n\n compatible_surface: Some(&surf),\n\n force_fallback_adapter: false,\n\n })\n\n .block_on()\n\n .unwrap_or_else(|| error!(\"Failure finding a graphics adapter\"));\n\n let (device, queue) = adapter\n\n .request_device(\n\n &wgpu::DeviceDescriptor {\n\n label: None,\n\n features: wgpu::Features::empty(),\n","file_path":"emulator/src/main.rs","rank":74,"score":2.3566189762312746},{"content":" /// This method also updates open bus.\n\n pub fn read<D: Data>(&mut self, addr: Addr24) -> D {\n\n let value = self.read_data::<D>(addr);\n\n self.open_bus = value.to_open_bus();\n\n self.memory_cycles +=\n\n (self.get_memory_cycle(addr) - 6) * core::mem::size_of::<D::Arr>() as u32;\n\n value\n\n }\n\n\n\n /// Write a value to the mapped memory at the specified address.\n\n /// This method also updates open bus.\n\n pub fn write<D: Data>(&mut self, addr: Addr24, value: D) {\n\n self.open_bus = value.to_open_bus();\n\n self.write_data(addr, value);\n\n self.memory_cycles +=\n\n (self.get_memory_cycle(addr) - 6) * core::mem::size_of::<D::Arr>() as u32;\n\n }\n\n}\n\n\n\nimpl<B: AudioBackend, FB: FrameBuffer> Device<B, FB> {\n","file_path":"rsnes/src/device.rs","rank":75,"score":2.222029944673146},{"content":" limits: wgpu::Limits::downlevel_defaults().using_resolution(adapter.limits()),\n\n },\n\n None,\n\n )\n\n .block_on()\n\n .unwrap_or_else(|err| error!(\"Failure requesting a GPU command queue ({})\", err));\n\n let (vs_entry, vs_shader) = shaders::create_vs(&device);\n\n let (fs_entry, fs_shader) = shaders::create_fs(&device);\n\n\n\n let bind_group_layout = device.create_bind_group_layout(&wgpu::BindGroupLayoutDescriptor {\n\n label: None,\n\n entries: &[\n\n wgpu::BindGroupLayoutEntry {\n\n binding: 0,\n\n visibility: wgpu::ShaderStages::FRAGMENT,\n\n ty: wgpu::BindingType::Texture {\n\n sample_type: wgpu::TextureSampleType::Float { filterable: true },\n\n view_dimension: wgpu::TextureViewDimension::D2,\n\n multisampled: false,\n\n },\n","file_path":"emulator/src/main.rs","rank":76,"score":2.2181907509503382},{"content":"# rsnes\n\n\n\n<div align='center'>\n\n <img src='https://user-images.githubusercontent.com/26610181/131219139-4b2c12ca-cc3d-4a72-827c-1c83476a4401.png'\n\n alt='rsnes logo' width='384cm' align='center'>\n\n</div>\n\n\n\nA [SNES](https://en.wikipedia.org/wiki/Super_Nintendo_Entertainment_System)\n\nemulator written in [Rust](https://www.rust-lang.org/)\n\n\n\n## Implementation Status\n\n\n\nMany games are already playable, but some graphics and sounds are faulty.\n\nComparatively functioning games are e.g. Donkey Kong Country, Wolfenstein 3D,\n\nF-Zero, Super Mario World, Super Mario Kart, The Legend of Zelda,\n\nSuper Street Fighter II.\n\n\n\n## Usage\n\n\n\nIn the default configuration, controller port 1 is connected to a\n\nstandard controller and port 2 is left unconnected.\n\nThese keyboard keys will drive controller 1:\n\n\n\n| Keyboard key on QWERTY | Controller key |\n\n|------------------------|----------------------|\n\n| **W** | **↑** |\n\n| **A** | **←** |\n\n| **S** | **↓** |\n\n| **D** | **→** |\n\n| **Q** | **L** |\n\n| **E** | **R** |\n\n| **Left Alt** | **Start** |\n\n| **Right Alt** | **Select** |\n\n| **J** | **A** |\n\n| **K** | **B** |\n\n| **L** | **X** |\n\n| **;** *\\** | **Y** |\n\n| 0-9 | Store Save State 0-9 |\n\n| Shift + 0-9 | Load Save State 0-9 |\n\n\n\n*\\** the button right of *L*\n\n\n\n## Configuration\n\n\n\nYou can configure rsnes with a [TOML](https://toml.io/) configuration file.\n\nYou can provide this file by using the option `--config <PATH>` or by placing\n\nit into one of these paths:\n\n\n\n- `$HOME/.config/rsnes/config.toml`\n\n- `$HOME/.config/rsnes.toml`\n\n- `/etc/rsnes.toml`\n\n\n\nSee `emulator/example.toml` for\n\n[documentation](https://github.com/nat-rix/rsnes/blob/main/emulator/example.toml).\n\n\n","file_path":"README.md","rank":77,"score":1.446926102342868}],"string":"[\n {\n \"content\": \"pub trait AccessType<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> {\\n\\n fn read<D: Data>(device: &mut Device<B, FB>, addr: Addr24) -> D;\\n\\n fn write<D: Data>(device: &mut Device<B, FB>, addr: Addr24, val: D);\\n\\n fn cpu(device: &Device<B, FB>) -> &Cpu;\\n\\n fn cpu_mut(device: &mut Device<B, FB>) -> &mut Cpu;\\n\\n fn is_main() -> bool {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\\npub struct AccessTypeMain;\\n\\n\\n\\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> AccessType<B, FB>\\n\\n for AccessTypeMain\\n\\n{\\n\\n fn read<D: Data>(device: &mut Device<B, FB>, addr: Addr24) -> D {\\n\\n device.read::<D>(addr)\\n\\n }\\n\\n\\n\\n fn write<D: Data>(device: &mut Device<B, FB>, addr: Addr24, val: D) {\\n\",\n \"file_path\": \"rsnes/src/instr.rs\",\n \"rank\": 0,\n \"score\": 97009.81171677442\n },\n {\n \"content\": \" pub trait AudioBackend: Send + 'static {\\n\\n fn push_sample(&mut self, sample: StereoSample);\\n\\n }\\n\\n pub struct Dummy;\\n\\n\\n\\n impl AudioBackend for Dummy {\\n\\n fn push_sample(&mut self, _sample: StereoSample) {}\\n\\n }\\n\\n}\\n\\n\\n\\npub use audio::{AudioBackend, Dummy as AudioDummy};\\n\\n\\n\",\n \"file_path\": \"rsnes/src/backend.rs\",\n \"rank\": 2,\n \"score\": 41380.04673110174\n },\n {\n \"content\": \"mod audio {\\n\\n use crate::spc700::StereoSample;\\n\\n\\n\",\n \"file_path\": \"rsnes/src/backend.rs\",\n \"rank\": 3,\n \"score\": 37793.23385139394\n },\n {\n \"content\": \"struct AudioBackend {\\n\\n producer: ringbuf::Producer<i16>,\\n\\n}\\n\\n\\n\\nconst SAMPLE_RATE: cpal::SampleRate = cpal::SampleRate(32000);\\n\\nconst TIME_PER_GPU_FRAME: Duration = Duration::from_micros(8_333);\\n\\nconst TIME_UNTIL_TIMER_RESET: Duration = Duration::from_millis(500);\\n\\n\\n\\nimpl AudioBackend {\\n\\n fn write_data<T: Sample>(data: &mut [T], consumer: &mut ringbuf::Consumer<i16>, channels: u16) {\\n\\n for frame in data.chunks_exact_mut(channels.into()) {\\n\\n let [l, r] = [(), ()].map(|_| T::from(&consumer.pop().unwrap_or(0)));\\n\\n if channels == 2 {\\n\\n frame[0] = l;\\n\\n frame[1] = r;\\n\\n } else {\\n\\n // TODO: join channels together\\n\\n for i in 0..channels {\\n\\n frame[usize::from(i)] = l;\\n\\n }\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 4,\n \"score\": 34388.205166461754\n },\n {\n \"content\": \"pub trait FrameBuffer {\\n\\n fn pixels(&self) -> &[[u8; 4]];\\n\\n fn mut_pixels(&mut self) -> &mut [[u8; 4]];\\n\\n fn request_redraw(&mut self);\\n\\n}\\n\\n\\n\\npub const FRAME_BUFFER_SIZE: usize = (ppu::MAX_SCREEN_HEIGHT_OVERSCAN * ppu::SCREEN_WIDTH) as usize;\\n\\nuse crate::ppu;\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ArrayFrameBuffer(pub [[u8; 4]; FRAME_BUFFER_SIZE], pub bool);\\n\\n\\n\\nimpl FrameBuffer for ArrayFrameBuffer {\\n\\n fn pixels(&self) -> &[[u8; 4]] {\\n\\n &self.0\\n\\n }\\n\\n fn mut_pixels(&mut self) -> &mut [[u8; 4]] {\\n\\n &mut self.0\\n\\n }\\n\\n fn request_redraw(&mut self) {\\n\\n self.1 = true\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ArrayFrameBuffer {\\n\\n pub fn get_bytes(&self) -> &[u8] {\\n\\n unsafe { core::slice::from_raw_parts(self.0.as_ptr() as _, self.0.len() << 2) }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rsnes/src/backend.rs\",\n \"rank\": 5,\n \"score\": 32909.274132054554\n },\n {\n \"content\": \"//! The SNES/Famicom device\\n\\n\\n\\nuse crate::{\\n\\n backend::{AudioBackend, FrameBuffer},\\n\\n cartridge::Cartridge,\\n\\n controller::ControllerPorts,\\n\\n cpu::Cpu,\\n\\n dma::Dma,\\n\\n ppu::Ppu,\\n\\n registers::MathRegisters,\\n\\n smp::Smp,\\n\\n timing::Cycles,\\n\\n};\\n\\nuse core::cell::Cell;\\n\\nuse save_state_macro::*;\\n\\n\\n\\nconst RAM_SIZE: usize = 0x20000;\\n\\n\\n\\n/// The 24-bit address type used\\n\\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\",\n \"file_path\": \"rsnes/src/device.rs\",\n \"rank\": 7,\n \"score\": 11.522759925398685\n },\n {\n \"content\": \" FB: crate::backend::FrameBuffer,\\n\\n>(\\n\\n device: &'a mut Device<B, FB>,\\n\\n) -> DeviceAccess<'a, T, B, FB> {\\n\\n DeviceAccess(device, core::marker::PhantomData)\\n\\n}\\n\\n\\n\\npub struct DeviceAccess<\\n\\n 'a,\\n\\n T: AccessType<B, FB>,\\n\\n B: crate::backend::AudioBackend,\\n\\n FB: crate::backend::FrameBuffer,\\n\\n>(pub &'a mut Device<B, FB>, core::marker::PhantomData<T>);\\n\\n\\n\\nimpl<\\n\\n 'a,\\n\\n T: AccessType<B, FB>,\\n\\n B: crate::backend::AudioBackend,\\n\\n FB: crate::backend::FrameBuffer,\\n\\n > DeviceAccess<'a, T, B, FB>\\n\",\n \"file_path\": \"rsnes/src/instr.rs\",\n \"rank\": 8,\n \"score\": 10.114769666383541\n },\n {\n \"content\": \"use crate::cpu::{Cpu, Status};\\n\\nuse crate::device::{Addr24, Data, Device};\\n\\nuse crate::timing::Cycles;\\n\\n\\n\\n// 0x80 BRA: the 2 instead of 3 cycles are on purpose.\\n\\n// `branch_near` will increment the cycle count\\n\\n#[rustfmt::skip]\\n\\nstatic CYCLES: [Cycles; 256] = [\\n\\n /* ^0 ^1 ^2 ^3 ^4 ^5 ^6 ^7 | ^8 ^9 ^a ^b ^c ^d ^e ^f */\\n\\n 7, 6, 7, 4, 5, 3, 5, 6, 3, 2, 2, 4, 6, 4, 6, 5, // 0^\\n\\n 2, 5, 5, 7, 5, 4, 6, 6, 2, 4, 2, 2, 6, 4, 7, 5, // 1^\\n\\n 6, 6, 8, 4, 3, 3, 5, 6, 4, 2, 2, 5, 4, 4, 6, 5, // 2^\\n\\n 2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 2, 2, 4, 4, 7, 5, // 3^\\n\\n 6, 6, 2, 4, 1, 3, 5, 6, 3, 2, 2, 3, 3, 4, 6, 5, // 4^\\n\\n 2, 5, 5, 7, 1, 4, 6, 6, 2, 4, 3, 2, 4, 4, 7, 5, // 5^\\n\\n 6, 6, 6, 4, 3, 3, 5, 6, 4, 2, 2, 6, 5, 4, 6, 5, // 6^\\n\\n 2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 4, 2, 6, 4, 7, 5, // 7^\\n\\n 2, 6, 4, 4, 3, 3, 3, 6, 2, 2, 2, 3, 4, 4, 4, 5, // 8^\\n\\n 2, 6, 5, 7, 4, 4, 4, 6, 2, 5, 2, 2, 4, 5, 5, 5, // 9^\\n\\n 2, 6, 2, 4, 3, 3, 3, 6, 2, 2, 2, 4, 4, 4, 4, 5, // a^\\n\",\n \"file_path\": \"rsnes/src/instr.rs\",\n \"rank\": 9,\n \"score\": 9.977426417540729\n },\n {\n \"content\": \"mod config;\\n\\n\\n\\nuse clap::{ErrorKind, Parser};\\n\\nuse cpal::{\\n\\n traits::{DeviceTrait, HostTrait, StreamTrait},\\n\\n Sample,\\n\\n};\\n\\nuse pollster::FutureExt;\\n\\nuse rsnes::{backend::ArrayFrameBuffer, device::Device, spc700::StereoSample};\\n\\nuse save_state::InSaveState;\\n\\nuse std::{\\n\\n path::PathBuf,\\n\\n time::{Duration, Instant},\\n\\n};\\n\\nuse winit::{\\n\\n event::{DeviceEvent, ElementState, Event, KeyboardInput, WindowEvent},\\n\\n event_loop::{ControlFlow, EventLoop},\\n\\n window::WindowBuilder,\\n\\n};\\n\\n\\n\\nconst MASTER_CYCLES_PER_TICK: u16 = 2;\\n\\n\\n\\n#[derive(Parser, Clone)]\\n\\n#[clap(\\n\\n version = clap::crate_version!(),\\n\\n)]\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 10,\n \"score\": 9.824422935346433\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn enable_hdma(&mut self, value: u8) {\\n\\n self.hdma_enabled = value;\\n\\n }\\n\\n\\n\\n pub fn get_first_dma_channel_id(&mut self) -> Option<usize> {\\n\\n if let id @ 0..=7 = self.dma_enabled.trailing_zeros() {\\n\\n Some(id as usize)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> Device<B, FB> {\\n\\n fn transfer_direct_byte(\\n\\n &mut self,\\n\\n channel_id: usize,\\n\",\n \"file_path\": \"rsnes/src/dma.rs\",\n \"rank\": 11,\n \"score\": 8.710751052017837\n },\n {\n \"content\": \" pub(crate) memory_cycles: Cycles,\\n\\n pub(crate) cpu_ahead_cycles: i32,\\n\\n pub(crate) new_scanline: bool,\\n\\n pub(crate) scanline_drawn: bool,\\n\\n pub new_frame: bool,\\n\\n pub(crate) do_hdma: bool,\\n\\n // multiplied by 4\\n\\n pub(crate) irq_time_h: u16,\\n\\n pub(crate) irq_time_v: u16,\\n\\n pub(crate) shall_irq: bool,\\n\\n pub(crate) shall_nmi: bool,\\n\\n pub(crate) nmi_vblank_bit: Cell<bool>,\\n\\n pub(crate) math_registers: MathRegisters,\\n\\n pub(crate) is_pal: bool,\\n\\n}\\n\\n\\n\\nimpl<B: AudioBackend, FB: FrameBuffer> Device<B, FB> {\\n\\n pub fn new(audio_backend: B, frame_buffer: FB, is_pal: bool, is_threaded: bool) -> Self {\\n\\n Self {\\n\\n cpu: Cpu::new(),\\n\",\n \"file_path\": \"rsnes/src/device.rs\",\n \"rank\": 12,\n \"score\": 8.703975498543358\n },\n {\n \"content\": \" device.write::<D>(addr, val)\\n\\n }\\n\\n\\n\\n fn cpu(device: &Device<B, FB>) -> &Cpu {\\n\\n &device.cpu\\n\\n }\\n\\n\\n\\n fn cpu_mut(device: &mut Device<B, FB>) -> &mut Cpu {\\n\\n &mut device.cpu\\n\\n }\\n\\n\\n\\n fn is_main() -> bool {\\n\\n true\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) fn create_device_access<\\n\\n 'a,\\n\\n T: AccessType<B, FB>,\\n\\n B: crate::backend::AudioBackend,\\n\",\n \"file_path\": \"rsnes/src/instr.rs\",\n \"rank\": 13,\n \"score\": 8.334674630429923\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<'a, B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer>\\n\\n DeviceAccess<'a, AccessTypeSa1, B, FB>\\n\\n{\\n\\n pub fn sa1(&self) -> &Sa1 {\\n\\n self.0.cartridge.as_ref().unwrap().sa1_ref()\\n\\n }\\n\\n\\n\\n pub fn sa1_mut(&mut self) -> &mut Sa1 {\\n\\n self.0.cartridge.as_mut().unwrap().sa1_mut()\\n\\n }\\n\\n\\n\\n pub fn run_dma_normal(&mut self) {\\n\\n todo!(\\\"SA-1 normal dma\\\")\\n\\n }\\n\\n\\n\\n pub fn run_dma_character_conversion_type1(&mut self) {\\n\\n todo!(\\\"SA-1 character conversion type 1 dma\\\")\\n\",\n \"file_path\": \"rsnes/src/enhancement/sa1.rs\",\n \"rank\": 14,\n \"score\": 8.250777710584028\n },\n {\n \"content\": \" if self.math_timer == 0 {\\n\\n &self.result_after\\n\\n } else {\\n\\n &self.result_before\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> Device<B, FB> {\\n\\n pub fn read_internal_register(&mut self, id: u16) -> Option<u8> {\\n\\n assert!(id >= 0x4000 && id <= 0x43ff);\\n\\n match id {\\n\\n 0x4016 => {\\n\\n // JOYSER0 - NES-style Joypad access\\n\\n Some(self.controllers.port1.read_port_data() | (self.open_bus & 0xfc))\\n\\n }\\n\\n 0x4017 => {\\n\\n // JOYSER1 - NES-style Joypad access\\n\\n Some(self.controllers.port2.read_port_data() | 0b11100 | (self.open_bus & 0xfc))\\n\\n }\\n\",\n \"file_path\": \"rsnes/src/registers.rs\",\n \"rank\": 15,\n \"score\": 8.057634356911395\n },\n {\n \"content\": \" for d in arr.as_mut() {\\n\\n self.cpu_mut().regs.sp = self.cpu().regs.sp.wrapping_add(1);\\n\\n if self.cpu().regs.is_emulation {\\n\\n self.cpu_mut().regs.sp = (self.cpu().regs.sp & 0xff) | 256\\n\\n }\\n\\n *d = self.read(Addr24::new(0, self.cpu().regs.sp));\\n\\n }\\n\\n D::from_bytes(&arr)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<\\n\\n 'a,\\n\\n T: AccessType<B, FB>,\\n\\n B: crate::backend::AudioBackend,\\n\\n FB: crate::backend::FrameBuffer,\\n\\n > DeviceAccess<'a, T, B, FB>\\n\\n{\\n\\n fn load_indexed_v<const BC: bool>(&mut self, cycles: &mut Cycles, val: u16) -> Addr24 {\\n\\n let loaded_addr = self.load::<u16>();\\n\",\n \"file_path\": \"rsnes/src/instr.rs\",\n \"rank\": 16,\n \"score\": 7.9096101168024955\n },\n {\n \"content\": \"pub(crate) const NECDSP_CPU_TIMING_PROPORTION_NTSC: (Cycles, Cycles) = (118125, 45056);\\n\\npub(crate) const NECDSP_CPU_TIMING_PROPORTION_PAL: (Cycles, Cycles) = (40591, 15625);\\n\\n\\n\\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> Device<B, FB> {\\n\\n pub fn run_cycle<const N: u16>(&mut self) {\\n\\n self.smp.tick(N);\\n\\n self.cartridge.as_mut().unwrap().tick(N.into());\\n\\n let vend = self.ppu.vend();\\n\\n if self.is_auto_joypad() && self.new_scanline && self.ppu.get_pos().y == vend + 2 {\\n\\n self.controllers.auto_joypad_timer = 4224;\\n\\n self.controllers.auto_joypad()\\n\\n }\\n\\n self.controllers.auto_joypad_timer -= self.controllers.auto_joypad_timer.min(N);\\n\\n // > The CPU is paused for 40 cycles beginning about 536 cycles\\n\\n // > after the start of each scanline\\n\\n // source: <https://wiki.superfamicom.org/timing>\\n\\n if self.ppu.is_cpu_active() && self.cpu.active {\\n\\n if self.dma.hdma_ahead_cycles > 0 {\\n\\n self.dma.hdma_ahead_cycles -= i32::from(N);\\n\\n } else if self.dma.is_dma_running() {\\n\",\n \"file_path\": \"rsnes/src/timing.rs\",\n \"rank\": 17,\n \"score\": 7.826401892685209\n },\n {\n \"content\": \"//! Utilities to read a cartridge into memory\\n\\n//!\\n\\n//! # Literature\\n\\n//!\\n\\n//! - the [super famicom wiki page](https://wiki.superfamicom.org/memory-mapping)\\n\\n//! - <http://patrickjohnston.org/ASM/ROM data/snestek.htm>\\n\\n\\n\\nuse std::convert::TryInto;\\n\\n\\n\\nuse crate::{\\n\\n device::{Addr24, Data},\\n\\n enhancement::{sa1::Sa1, Dsp, DspVersion},\\n\\n timing::Cycles,\\n\\n};\\n\\nuse save_state::{SaveStateDeserializer, SaveStateSerializer};\\n\\nuse save_state_macro::*;\\n\\n\\n\\nconst MINIMUM_SIZE: usize = 0x8000;\\n\\n\\n\",\n \"file_path\": \"rsnes/src/cartridge.rs\",\n \"rank\": 18,\n \"score\": 7.552583165391597\n },\n {\n \"content\": \"//! Timing control implementation\\n\\n//!\\n\\n//! # Literature\\n\\n//!\\n\\n//! - <https://wiki.superfamicom.org/timing>\\n\\n\\n\\nuse crate::{\\n\\n cpu::Status,\\n\\n device::{Addr24, Device},\\n\\n};\\n\\n\\n\\npub type Cycles = u32;\\n\\n\\n\\n// The SNES master clock runs at ca. (945/44) MHz which is ca. 21_477kHz;\\n\\n// The APU runs at 1024kHz\\n\\n\\n\\n/// This is a fractional proportion between the cpu and apu clock speed\\n\\npub(crate) const APU_CPU_TIMING_PROPORTION_NTSC: (Cycles, Cycles) = (118125, 5632);\\n\\npub(crate) const APU_CPU_TIMING_PROPORTION_PAL: (Cycles, Cycles) = (665, 32);\\n\\n\\n\",\n \"file_path\": \"rsnes/src/timing.rs\",\n \"rank\": 19,\n \"score\": 7.260285793113628\n },\n {\n \"content\": \"use crate::device::Device;\\n\\nuse save_state_macro::*;\\n\\n\\n\\nconst CHIP_5A22_VERSION: u8 = 2;\\n\\n\\n\\n#[derive(Debug, Clone, InSaveState)]\\n\\npub struct MathRegisters {\\n\\n multiplicands: [u8; 2],\\n\\n dividend: u16,\\n\\n divisor: u8,\\n\\n math_timer: u16,\\n\\n result_after: [u8; 4],\\n\\n result_before: [u8; 4],\\n\\n}\\n\\n\\n\\nimpl MathRegisters {\\n\\n pub const fn new() -> Self {\\n\\n Self {\\n\\n multiplicands: [0xff, 0xff],\\n\\n dividend: 0xffff,\\n\",\n \"file_path\": \"rsnes/src/registers.rs\",\n \"rank\": 20,\n \"score\": 7.138668942032641\n },\n {\n \"content\": \" fn write_bwram_small<const INTERNAL: bool>(&mut self, addr: Addr24, val: u8) {\\n\\n let addr = self.get_bwram_small::<INTERNAL>(addr);\\n\\n if INTERNAL && self.bwram_map_bits {\\n\\n return self.write_bwram_bits(addr, val);\\n\\n }\\n\\n self.bwram[(addr & 0x3_ffff) as usize] = val\\n\\n }\\n\\n}\\n\\n\\n\\npub struct AccessTypeSa1;\\n\\n\\n\\nimpl<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> AccessType<B, FB>\\n\\n for AccessTypeSa1\\n\\n{\\n\\n fn read<D: Data>(device: &mut Device<B, FB>, mut addr: Addr24) -> D {\\n\\n let mut arr: D::Arr = Default::default();\\n\\n let mut open_bus = device.open_bus;\\n\\n let cartridge = device.cartridge.as_mut().unwrap();\\n\\n for v in arr.as_mut() {\\n\\n *v = cartridge.sa1_read::<true>(addr).unwrap_or(open_bus);\\n\",\n \"file_path\": \"rsnes/src/enhancement/sa1.rs\",\n \"rank\": 21,\n \"score\": 7.096368666745546\n },\n {\n \"content\": \"//! DSP-n cartridge coprocessor handling types\\n\\n//!\\n\\n//! # Literature\\n\\n//!\\n\\n//! - https://www.caitsith2.com/snes/dsp/\\n\\n//! - https://datasheet.datasheetarchive.com/originals/scans/Scans-003/Scans-0079458.pdf\\n\\n//! - SNES book 2 - Section 3\\n\\n\\n\\nuse crate::timing::Cycles;\\n\\nuse save_state::{InSaveState, SaveStateDeserializer, SaveStateSerializer};\\n\\nuse save_state_macro::InSaveState;\\n\\n\\n\\npub const ROM_SIZE: usize = 0x2000;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, InSaveState)]\\n\\npub struct Stack {\\n\\n stack: [u16; 4],\\n\\n size: u8,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rsnes/src/enhancement/dsp.rs\",\n \"rank\": 22,\n \"score\": 7.021960370732151\n },\n {\n \"content\": \"//! SA-1 Coprocessor handling types\\n\\n//!\\n\\n//! # Literature\\n\\n//!\\n\\n//! - <https://wiki.superfamicom.org/sa-1>\\n\\n//! - <https://wiki.superfamicom.org/sa-1-registers>\\n\\n//! - <https://wiki.superfamicom.org/uploads/assembly-programming-manual-for-w65c816.pdf>\\n\\n//! - <https://problemkaputt.de/fullsnes.htm>\\n\\n\\n\\nuse crate::{\\n\\n cartridge::Cartridge,\\n\\n cpu::{Cpu, Status},\\n\\n device::{Addr24, Data, Device},\\n\\n instr::{AccessType, DeviceAccess},\\n\\n};\\n\\nuse core::mem::replace;\\n\\nuse save_state_macro::*;\\n\\n\\n\\nconst IRAM_SIZE: usize = 0x800;\\n\\nconst BWRAM_SIZE: usize = 0x40000;\\n\",\n \"file_path\": \"rsnes/src/enhancement/sa1.rs\",\n \"rank\": 23,\n \"score\": 6.983826775752403\n },\n {\n \"content\": \" fn to_open_bus(self) -> u8 {\\n\\n self.bank\\n\\n }\\n\\n fn from_open_bus(open_bus: u8) -> Self {\\n\\n Self::new(open_bus, open_bus as u16 | ((open_bus as u16) << 8))\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, InSaveState)]\\n\\npub struct Device<B: AudioBackend, FB: FrameBuffer> {\\n\\n pub(crate) cpu: Cpu,\\n\\n pub smp: Smp<B>,\\n\\n pub ppu: Ppu<FB>,\\n\\n pub(crate) dma: Dma,\\n\\n pub controllers: ControllerPorts,\\n\\n pub(crate) cartridge: Option<Cartridge>,\\n\\n /// <https://wiki.superfamicom.org/open-bus>\\n\\n pub(crate) open_bus: u8,\\n\\n ram: [u8; RAM_SIZE],\\n\\n wram_addr: Cell<u32>,\\n\",\n \"file_path\": \"rsnes/src/device.rs\",\n \"rank\": 24,\n \"score\": 6.9056384970808775\n },\n {\n \"content\": \"use crate::oam::{CgRam, Oam, Object};\\n\\nuse core::mem::{replace, take};\\n\\nuse save_state::{SaveStateDeserializer, SaveStateSerializer};\\n\\nuse save_state_macro::*;\\n\\n\\n\\npub const VRAM_SIZE: usize = 0x8000;\\n\\npub const SCREEN_WIDTH: u32 = 256;\\n\\npub const MAX_SCREEN_HEIGHT: u32 = 224;\\n\\npub const MAX_SCREEN_HEIGHT_OVERSCAN: u32 = 239;\\n\\npub const CHIP_5C77_VERSION: u8 = 1;\\n\\npub const CHIP_5C78_VERSION: u8 = 3;\\n\\n\\n\\n// TODO: Check the exact value of this.\\n\\n// wiki.superfamicom.org/timing states that\\n\\n// when we disable Force Blank mid-scanline,\\n\\n// there is garbage for about 16-24 pixels.\\n\\npub const RAY_AHEAD_CYCLES: u16 = 20 * 4;\\n\\n\\n\\nstatic OBJ_SIZES: [[[u8; 2]; 2]; 8] = [\\n\\n [[8, 8], [16, 16]],\\n\",\n \"file_path\": \"rsnes/src/ppu.rs\",\n \"rank\": 26,\n \"score\": 6.781066332331774\n },\n {\n \"content\": \"use crate::device::{Addr24, Device};\\n\\nuse save_state_macro::*;\\n\\n\\n\\npub mod flags {\\n\\n pub const MODE: u8 = 0b111;\\n\\n pub const FIXED: u8 = 0x08;\\n\\n pub const DECREMENT: u8 = 0x10;\\n\\n pub const INDIRECT: u8 = 0x40;\\n\\n pub const PPU_TO_CPU: u8 = 0x80;\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, InSaveState)]\\n\\npub struct Channel {\\n\\n a_bus: Addr24,\\n\\n b_bus: u8,\\n\\n size: u16,\\n\\n indirect_bank: u8,\\n\\n control: u8,\\n\\n unknown_register: u8,\\n\\n table: u16,\\n\",\n \"file_path\": \"rsnes/src/dma.rs\",\n \"rank\": 27,\n \"score\": 6.582801313466065\n },\n {\n \"content\": \"//! 65816/65C816 CPU handling types\\n\\n//!\\n\\n//! # Literature\\n\\n//!\\n\\n//! - the [super famicom wiki page](https://wiki.superfamicom.org/65816-reference)\\n\\n//! - <https://apprize.best/programming/65816/>\\n\\n//! - <https://www.westerndesigncenter.com/wdc/documentation/w65c816s.pdf>\\n\\n//! - <https://wiki.superfamicom.org/uploads/assembly-programming-manual-for-w65c816.pdf>\\n\\n\\n\\nuse crate::device::Addr24;\\n\\nuse core::ops::{BitAnd, BitAndAssign, BitOr, BitOrAssign, Not};\\n\\nuse save_state_macro::*;\\n\\n\\n\\npub const RESET_VECTOR_ADDR: Addr24 = Addr24::new(0, 0xfffc);\\n\\n\\n\\n/// Structure containing the processor registers\\n\\n#[derive(Debug, Clone, InSaveState)]\\n\\npub struct Regs {\\n\\n /// The accumulator register\\n\\n pub a: u16,\\n\",\n \"file_path\": \"rsnes/src/cpu.rs\",\n \"rank\": 28,\n \"score\": 6.526092476636515\n },\n {\n \"content\": \"//! SPC700 Sound Coprocessor handling types\\n\\n//!\\n\\n//! # Literature\\n\\n//!\\n\\n//! - <https://wiki.superfamicom.org/spc700-reference>\\n\\n//! - <https://emudev.de/q00-snes/spc700-the-audio-processor/>\\n\\n//! - The first of the two official SNES documentation books\\n\\n\\n\\nuse crate::timing::Cycles;\\n\\nuse core::{cell::Cell, mem::take};\\n\\nuse save_state::{SaveStateDeserializer, SaveStateSerializer};\\n\\nuse save_state_macro::*;\\n\\n\\n\\npub const MEMORY_SIZE: usize = 64 * 1024;\\n\\n\\n\\nstatic ROM: [u8; 64] = [\\n\\n 0xCD, 0xEF, 0xBD, 0xE8, 0x00, 0xC6, 0x1D, 0xD0, 0xFC, 0x8F, 0xAA, 0xF4, 0x8F, 0xBB, 0xF5, 0x78,\\n\\n 0xCC, 0xF4, 0xD0, 0xFB, 0x2F, 0x19, 0xEB, 0xF4, 0xD0, 0xFC, 0x7E, 0xF4, 0xD0, 0x0B, 0xE4, 0xF5,\\n\\n 0xCB, 0xF4, 0xD7, 0x00, 0xFC, 0xD0, 0xF3, 0xAB, 0x01, 0x10, 0xEF, 0x7E, 0xF4, 0x10, 0xEB, 0xBA,\\n\\n 0xF6, 0xDA, 0x00, 0xBA, 0xF4, 0xC4, 0xF4, 0xDD, 0x5D, 0xD0, 0xDB, 0x1F, 0x00, 0x00, 0xC0, 0xFF,\\n\",\n \"file_path\": \"rsnes/src/spc700.rs\",\n \"rank\": 29,\n \"score\": 5.627857657768466\n },\n {\n \"content\": \" }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, InSaveState)]\\n\\npub struct Ppu<FB: crate::backend::FrameBuffer> {\\n\\n #[except((|_v, _s| ()), (|_v, _s| ()))]\\n\\n pub frame_buffer: FB,\\n\\n oam: Oam,\\n\\n cgram: CgRam,\\n\\n vram: Vram,\\n\\n bgs: [Bg; 4],\\n\\n bg_mode: BgMode,\\n\\n bg3_prio: bool,\\n\\n pos: RayPos,\\n\\n latched: LatchedState,\\n\\n brightness: u8,\\n\\n draw_layers: Layers,\\n\\n /// Object sizes in (x, y) = `[u8; 2]` for small sprites (=`obj_size[0]`) and large sprites\\n\\n /// (=`obj_size[1]`) in pixels\\n\",\n \"file_path\": \"rsnes/src/ppu.rs\",\n \"rank\": 30,\n \"score\": 5.5268974273080715\n },\n {\n \"content\": \" is_pal,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn with_main_cpu<'a>(\\n\\n &'a mut self,\\n\\n ) -> crate::instr::DeviceAccess<'a, crate::instr::AccessTypeMain, B, FB> {\\n\\n crate::instr::create_device_access(self)\\n\\n }\\n\\n\\n\\n pub fn with_sa1_cpu<'a>(\\n\\n &'a mut self,\\n\\n ) -> crate::instr::DeviceAccess<'a, crate::enhancement::sa1::AccessTypeSa1, B, FB> {\\n\\n crate::instr::create_device_access(self)\\n\\n }\\n\\n\\n\\n pub fn get_irq_pin(&self) -> bool {\\n\\n match &self.cartridge {\\n\\n Some(cart) if cart.has_sa1() => cart.sa1_ref().irq_pin(),\\n\\n _ => false,\\n\",\n \"file_path\": \"rsnes/src/device.rs\",\n \"rank\": 31,\n \"score\": 5.241057015466465\n },\n {\n \"content\": \" pub regs: Regs,\\n\\n pub(crate) nmitimen: u8,\\n\\n pub(crate) access_speed: bool,\\n\\n pub(crate) in_nmi: bool,\\n\\n pub(crate) irq_bit: u8,\\n\\n pub wait_mode: bool,\\n\\n pub active: bool,\\n\\n}\\n\\n\\n\\nimpl Cpu {\\n\\n pub const fn new() -> Self {\\n\\n Self {\\n\\n regs: Regs {\\n\\n a: 0,\\n\\n x: 0,\\n\\n y: 0,\\n\\n sp: 0x100,\\n\\n dp: 0,\\n\\n pc: Addr24::new(0, 0),\\n\\n db: 0,\\n\",\n \"file_path\": \"rsnes/src/cpu.rs\",\n \"rank\": 33,\n \"score\": 5.055984588410108\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<FB: crate::backend::FrameBuffer> Ppu<FB> {\\n\\n pub fn new(frame_buffer: FB, is_pal: bool) -> Self {\\n\\n let bg_mode = BgMode::new(0, false, false);\\n\\n Self {\\n\\n frame_buffer,\\n\\n oam: Oam::new(),\\n\\n cgram: CgRam::new(),\\n\\n vram: Vram::new(),\\n\\n bgs: [Bg::new(); 4],\\n\\n bg_mode,\\n\\n bg3_prio: false,\\n\\n pos: Default::default(),\\n\\n latched: Default::default(),\\n\\n brightness: 15,\\n\\n draw_layers: Layers::from_bgmode(bg_mode),\\n\\n obj_size: OBJ_SIZES[0],\\n\\n obj_tile_addr: [0; 2],\\n\\n obj_layer: Layer::new(),\\n\",\n \"file_path\": \"rsnes/src/ppu.rs\",\n \"rank\": 34,\n \"score\": 5.048335567831096\n },\n {\n \"content\": \"## Structure\\n\\n\\n\\nThis repository is a workspace consisting of two crates\\n\\n\\n\\n- `rsnes` - the SNES backend library (located in `/rsnes/`)\\n\\n- `rsnes-emulator` - a sample frontend implementation using `winit` and `wgpu`\\n\\n (located in `/emulator/`)\\n\\n\\n\\n⚠️ Please note that the `rsnes` API is neither tested nor documented (well) ⚠️\\n\\n\\n\\n⚠️ Also note, that `rsnes-emulator` is only tested on Linux/X11 ⚠️\\n\\n\\n\\n## Features\\n\\n\\n\\nThis is a set of features to be implemented in the future (sorted by priority)\\n\\n\\n\\n- [x] Mode 7 support\\n\\n- [x] Sprite support\\n\\n- [x] Color math\\n\\n- [x] S-DSP echo effect support\\n\\n- [x] S-DSP noise effect support\\n\\n- [x] PPU Mosaic effect\\n\\n- [ ] Save game to files\\n\\n- [ ] SA-1 support\\n\\n- [ ] Real gamepad input support for `rsnes-emulator`\\n\\n (see [winit#944](https://github.com/rust-windowing/winit/issues/944),\\n\\n maybe use unstable fork or branch?)\\n\\n- [ ] Improved documentation\\n\\n- [ ] Tests\\n\\n - [ ] 65816 processor instruction tests\\n\\n - [ ] SPC-700 processor instruction tests\\n\\n - [ ] Audio tests\\n\\n - [ ] Video output tests\\n\\n- [ ] configurable UI\\n\\n - [x] configurable key bindings\\n\\n- [ ] emulator running also on [WASM](https://webassembly.org/)\\n\\n- [x] [DSP](https://en.wikipedia.org/wiki/NEC_%C2%B5PD7720#%C2%B5PD77C25)\\n\\n coprocessor support\\n\\n - [x] DSP-1, DSP-1A, DSP-1B\\n\\n - [x] DSP-2, DSP-3, DSP-4 (low priority)\\n\\n - [ ] ST010, ST011 (very low priority)\\n\\n- [ ] [GSU](https://en.wikipedia.org/wiki/Super_FX) coprocessor support\\n\\n (also known as Super FX)\\n\\n - [ ] GSU1\\n\\n - [ ] GSU2\\n\\n- [x] Complete the 65816 instruction set\\n\\n- [x] Complete the SPC700 instruction set\\n\\n- [x] Complete the NEC μPD77C25 instruction set\\n\\n- [ ] Complete the GSU instruction set\\n\\n- [ ] Multitap (MP5) controller support\\n\\n- [x] [SNES Mouse](https://en.wikipedia.org/wiki/Super_NES_Mouse) support\\n\\n- [ ] [SNES Super Scope](https://en.wikipedia.org/wiki/Super_Scope) support\\n\\n- [x] Save States\\n\\n- [ ] Capcom CX4 coprocessor support\\n\\n (this processor is only used in Mega Man X2 and Mega Man X3)\\n\\n- [ ] SPC7110 data decompression chip\\n\\n\\n\\n## Contributing\\n\\n\\n\\nContributions of any kind (bug reports, feature requests, pull requests, …) are\\n\\nvery welcome.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 35,\n \"score\": 4.904464592991095\n },\n {\n \"content\": \" pub(crate) addr: u16,\\n\\n pub(crate) addr_inc: u16,\\n\\n stashed_write: u8,\\n\\n pub(crate) priority: bool,\\n\\n}\\n\\n\\n\\nimpl Oam {\\n\\n pub const fn new() -> Self {\\n\\n Self {\\n\\n objs: [Object::new(); 128],\\n\\n addr: 0,\\n\\n addr_inc: 0,\\n\\n stashed_write: 0,\\n\\n priority: false,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Reset the OAM address.\\n\\n /// This occurs usually at the beginning of a V-Blank\\n\\n /// if it is not fblanked.\\n\",\n \"file_path\": \"rsnes/src/oam.rs\",\n \"rank\": 36,\n \"score\": 4.761550563484011\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"save-state/src/tests.rs\",\n \"rank\": 37,\n \"score\": 4.750245969755288\n },\n {\n \"content\": \"use proc_macro::TokenStream;\\n\\n\\n\",\n \"file_path\": \"save-state-macro/src/lib.rs\",\n \"rank\": 38,\n \"score\": 4.624557574132381\n },\n {\n \"content\": \" let firstsprite = self.oam.get_first_sprite();\\n\\n for obj_id in 0..128 {\\n\\n let obj = &mut self.oam.objs[usize::from(obj_id + firstsprite) & 0x7f];\\n\\n obj.used = false;\\n\\n let size = self.obj_size[usize::from(obj.is_large)];\\n\\n if (-i16::from(size[0]) >= obj.x && obj.x != -256)\\n\\n || obj.x >= 256\\n\\n || y.wrapping_sub(obj.y) >= size[1]\\n\\n {\\n\\n continue;\\n\\n }\\n\\n if objs_in_line >= 32 {\\n\\n self.overflow_flags |= 0x40;\\n\\n break;\\n\\n }\\n\\n obj.used = true;\\n\\n }\\n\\n 'obj_loop: for obj in 0..128 {\\n\\n let obj = self.oam.objs[!usize::from(obj + firstsprite) & 0x7f];\\n\\n if !obj.used {\\n\",\n \"file_path\": \"rsnes/src/ppu.rs\",\n \"rank\": 40,\n \"score\": 4.458969120907609\n },\n {\n \"content\": \"impl rsnes::backend::AudioBackend for AudioBackend {\\n\\n fn push_sample(&mut self, sample: StereoSample) {\\n\\n let _ = self\\n\\n .producer\\n\\n .push(sample.l)\\n\\n .and_then(|()| self.producer.push(sample.r));\\n\\n }\\n\\n}\\n\\n\\n\\nmod shaders {\\n\\n macro_rules! include_shader {\\n\\n ($t:expr) => {\\n\\n include_bytes!(concat!(env!(\\\"OUT_DIR\\\"), \\\"/\\\", $t))\\n\\n };\\n\\n }\\n\\n\\n\\n static VERTEX_SHADER: &[u8] = include_shader!(\\\"main.vertex.spirv\\\");\\n\\n static FRAGMENT_SHADER: &[u8] = include_shader!(\\\"main.fragment.spirv\\\");\\n\\n\\n\\n fn create_shader(device: &wgpu::Device, source: &[u8]) -> wgpu::ShaderModule {\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 42,\n \"score\": 4.410427340000471\n },\n {\n \"content\": \"use std::collections::HashMap;\\n\\nuse std::path::{Path, PathBuf};\\n\\nuse toml::value::{Table, Value};\\n\\n\\n\\nstatic CONFIG_FILE_PATHS: &'static [(bool, &'static str)] = &[\\n\\n (true, \\\".config/rsnes/config.toml\\\"),\\n\\n (true, \\\".config/rsnes.toml\\\"),\\n\\n (false, \\\"/etc/rsnes.toml\\\"),\\n\\n];\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum ConfigLoadError {\\n\\n Io(std::io::Error),\\n\\n De(toml::de::Error),\\n\\n WrongType {\\n\\n expected: &'static str,\\n\\n got: &'static str,\\n\\n },\\n\\n UnknownField(String),\\n\\n RequiredAttr {\\n\",\n \"file_path\": \"emulator/src/config.rs\",\n \"rank\": 43,\n \"score\": 4.312282893611155\n },\n {\n \"content\": \"use save_state_macro::*;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, InSaveState)]\\n\\npub struct Object {\\n\\n pub x: i16,\\n\\n pub y: u8,\\n\\n pub tile_nr: u8,\\n\\n pub attrs: u8,\\n\\n pub is_large: bool,\\n\\n\\n\\n pub used: bool,\\n\\n}\\n\\n\\n\\nimpl Object {\\n\\n pub const fn new() -> Object {\\n\\n Self {\\n\\n x: 0,\\n\\n y: 0,\\n\\n tile_nr: 0,\\n\\n attrs: 0,\\n\",\n \"file_path\": \"rsnes/src/oam.rs\",\n \"rank\": 45,\n \"score\": 4.292078969250371\n },\n {\n \"content\": \"mod dsp;\\n\\npub mod sa1;\\n\\n\\n\\n#[doc(inline)]\\n\\npub use dsp::{Dsp, DspVersion};\\n\",\n \"file_path\": \"rsnes/src/enhancement/mod.rs\",\n \"rank\": 46,\n \"score\": 4.232587365549692\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn set_region(&mut self, pal: bool) {\\n\\n if let Some(dsp) = &mut self.dsp {\\n\\n dsp.set_timing_proportion(if pal {\\n\\n crate::timing::NECDSP_CPU_TIMING_PROPORTION_PAL\\n\\n } else {\\n\\n crate::timing::NECDSP_CPU_TIMING_PROPORTION_NTSC\\n\\n })\\n\\n }\\n\\n if let Some(sa1) = &mut self.sa1 {\\n\\n sa1.set_region(pal)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn tick(&mut self, n: Cycles) {\\n\\n if let Some(dsp) = &mut self.dsp {\\n\\n dsp.tick(n)\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"rsnes/src/cartridge.rs\",\n \"rank\": 48,\n \"score\": 4.138564499286767\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug, Clone, InSaveState)]\\n\\npub struct Dma {\\n\\n channels: [Channel; 8],\\n\\n running: bool,\\n\\n dma_enabled: u8,\\n\\n hdma_enabled: u8,\\n\\n cancelled: u8,\\n\\n do_transfer: u8,\\n\\n pub(crate) hdma_ahead_cycles: i32,\\n\\n pub(crate) ahead_cycles: i32,\\n\\n}\\n\\n\\n\\nimpl Dma {\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\\n channels: [Channel::new(); 8],\\n\\n running: false,\\n\\n dma_enabled: 0,\\n\",\n \"file_path\": \"rsnes/src/dma.rs\",\n \"rank\": 49,\n \"score\": 4.114203646523293\n },\n {\n \"content\": \"use shaderc::{CompileOptions, Compiler, OptimizationLevel, ShaderKind, SourceLanguage::GLSL};\\n\\n\\n\\nconst SHADERS_PATH: &str = \\\"shaders/\\\";\\n\\n\\n\\n#[allow(clippy::enum_variant_names)]\\n\",\n \"file_path\": \"emulator/build.rs\",\n \"rank\": 50,\n \"score\": 3.8587980629602967\n },\n {\n \"content\": \" left,\\n\\n down,\\n\\n right,\\n\\n l,\\n\\n r,\\n\\n start,\\n\\n select,\\n\\n },\\n\\n } => {\\n\\n use rsnes::controller::buttons::*;\\n\\n let mut key = 0;\\n\\n for (code, button) in [\\n\\n (a, A),\\n\\n (b, B),\\n\\n (x, X),\\n\\n (y, Y),\\n\\n (up, UP),\\n\\n (left, LEFT),\\n\\n (down, DOWN),\\n\\n (right, RIGHT),\\n\",\n \"file_path\": \"emulator/src/config.rs\",\n \"rank\": 51,\n \"score\": 3.816665771476231\n },\n {\n \"content\": \"use core::{cell::Cell, mem::replace};\\n\\nuse save_state_macro::*;\\n\\n\\n\\npub mod buttons {\\n\\n pub const B: u16 = 1;\\n\\n pub const Y: u16 = 2;\\n\\n pub const SELECT: u16 = 4;\\n\\n pub const START: u16 = 8;\\n\\n pub const UP: u16 = 0x10;\\n\\n pub const DOWN: u16 = 0x20;\\n\\n pub const LEFT: u16 = 0x40;\\n\\n pub const RIGHT: u16 = 0x80;\\n\\n pub const A: u16 = 0x100;\\n\\n pub const X: u16 = 0x200;\\n\\n pub const L: u16 = 0x400;\\n\\n pub const R: u16 = 0x800;\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub enum Controller {\\n\",\n \"file_path\": \"rsnes/src/controller.rs\",\n \"rank\": 52,\n \"score\": 3.8019180792270153\n },\n {\n \"content\": \" cartridge.header()\\n\\n );\\n\\n }\\n\\n let is_pal = match profile.region {\\n\\n rsnes::cartridge::CountryFrameRate::Any => matches!(\\n\\n cartridge.get_country_frame_rate(),\\n\\n rsnes::cartridge::CountryFrameRate::Pal\\n\\n ),\\n\\n rsnes::cartridge::CountryFrameRate::Pal => true,\\n\\n rsnes::cartridge::CountryFrameRate::Ntsc => false,\\n\\n };\\n\\n if options.verbose {\\n\\n println!(\\n\\n \\\"[info] Selected {} region\\\",\\n\\n if is_pal { \\\"PAL\\\" } else { \\\"NTSC\\\" }\\n\\n );\\n\\n }\\n\\n let (audio_backend, _audio_stream) =\\n\\n AudioBackend::new().unwrap_or_else(|| error!(\\\"Failed finding an audio output device\\\"));\\n\\n let mut snes = Device::new(\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 53,\n \"score\": 3.688157691851025\n },\n {\n \"content\": \" obj_size: [[u8; 2]; 2],\\n\\n /// Tile base address without and with gap\\n\\n obj_tile_addr: [u16; 2],\\n\\n obj_layer: Layer,\\n\\n obj_cache: [ObjCacheEntry; 256],\\n\\n overflow_flags: u8,\\n\\n color_math: ColorMath,\\n\\n direct_color_mode: bool,\\n\\n object_interlace: bool,\\n\\n interlace_active: bool,\\n\\n window_positions: [[u8; 2]; 2],\\n\\n overscan: bool,\\n\\n pseudo512: bool,\\n\\n mosaic_size: u8,\\n\\n mode7_settings: Mode7Settings,\\n\\n field: bool,\\n\\n force_blank: bool,\\n\\n is_pal: bool,\\n\\n pub(crate) open_bus1: u8,\\n\\n pub(crate) open_bus2: u8,\\n\",\n \"file_path\": \"rsnes/src/ppu.rs\",\n \"rank\": 54,\n \"score\": 3.6425040709105185\n },\n {\n \"content\": \" audio_backend,\\n\\n ArrayFrameBuffer([[0; 4]; rsnes::backend::FRAME_BUFFER_SIZE], true),\\n\\n is_pal,\\n\\n profile.threaded,\\n\\n );\\n\\n snes.controllers.port1 = config::controller_profile_to_port(port1_profile.as_ref());\\n\\n snes.controllers.port2 = config::controller_profile_to_port(port2_profile.as_ref());\\n\\n snes.load_cartridge(cartridge);\\n\\n\\n\\n let size = winit::dpi::PhysicalSize::new(\\n\\n rsnes::ppu::SCREEN_WIDTH * 4,\\n\\n rsnes::ppu::MAX_SCREEN_HEIGHT * 4,\\n\\n );\\n\\n let event_loop = EventLoop::new();\\n\\n let window = WindowBuilder::new()\\n\\n .with_decorations(true)\\n\\n .with_visible(true)\\n\\n .with_fullscreen(None)\\n\\n .with_resizable(true)\\n\\n .with_maximized(false)\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 56,\n \"score\": 3.5570304314817576\n },\n {\n \"content\": \" self.with_main_cpu().dispatch_instruction() * 6\\n\\n }) + self.memory_cycles;\\n\\n self.cpu_ahead_cycles += cycles as i32;\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_memory_cycle(&self, addr: Addr24) -> Cycles {\\n\\n #[repr(u8)]\\n\\n enum Speed {\\n\\n Fast = 6,\\n\\n Slow = 8,\\n\\n XSlow = 12,\\n\\n }\\n\\n use Speed::*;\\n\\n macro_rules! romaccess {\\n\\n () => {\\n\\n if self.cpu.access_speed {\\n\\n Fast\\n\\n } else {\\n\\n Slow\\n\",\n \"file_path\": \"rsnes/src/timing.rs\",\n \"rank\": 57,\n \"score\": 3.310609288229365\n },\n {\n \"content\": \" let data = port.read_port_data();\\n\\n port.data1 |= u16::from(data & 1);\\n\\n port.data2 |= u16::from(data >> 1);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub(crate) fn access(&self, id: u16) -> u8 {\\n\\n let port = if id & 2 > 0 { &self.port2 } else { &self.port1 };\\n\\n let data = if id & 4 > 0 { port.data2 } else { port.data1 };\\n\\n if id & 1 > 0 {\\n\\n (data >> 8) as u8\\n\\n } else {\\n\\n (data & 0xff) as u8\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rsnes/src/controller.rs\",\n \"rank\": 58,\n \"score\": 3.3097855653128936\n },\n {\n \"content\": \"pub mod backend;\\n\\npub mod cartridge;\\n\\npub mod controller;\\n\\npub mod cpu;\\n\\npub mod device;\\n\\npub mod dma;\\n\\npub mod enhancement;\\n\\nmod instr;\\n\\npub mod oam;\\n\\npub mod ppu;\\n\\nmod registers;\\n\\npub mod smp;\\n\\npub mod spc700;\\n\\nmod timing;\\n\",\n \"file_path\": \"rsnes/src/lib.rs\",\n \"rank\": 59,\n \"score\": 3.195291310052478\n },\n {\n \"content\": \" } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn write_byte(&mut self, addr: Addr24, val: u8) {\\n\\n if self.has_sa1() {\\n\\n self.sa1_write::<false>(addr, val)\\n\\n } else {\\n\\n if let Some((index, MappingEntry { write, .. })) = self.mapping.find(addr) {\\n\\n write.get()(self, index, val)\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub const fn get_country_frame_rate(&self) -> CountryFrameRate {\\n\\n use CountryFrameRate::*;\\n\\n match self.header.country {\\n\\n 0 | 1 | 13 | 15 => Ntsc,\\n\",\n \"file_path\": \"rsnes/src/cartridge.rs\",\n \"rank\": 60,\n \"score\": 3.104776209819407\n },\n {\n \"content\": \"\\n\\nimpl<T: InSaveState + Default> InSaveState for Option<T> {\\n\\n fn serialize(&self, state: &mut SaveStateSerializer) {\\n\\n self.is_some().serialize(state);\\n\\n match self {\\n\\n Some(v) => v.serialize(state),\\n\\n // TODO: use extend_from_slice when const generics get stabilized enough\\n\\n None => (),\\n\\n }\\n\\n }\\n\\n\\n\\n fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\\n\\n let mut i = false;\\n\\n i.deserialize(state);\\n\\n *self = if i {\\n\\n let mut i = T::default();\\n\\n i.deserialize(state);\\n\\n Some(i)\\n\\n } else {\\n\\n None\\n\",\n \"file_path\": \"save-state/src/lib.rs\",\n \"rank\": 61,\n \"score\": 2.9982546049737335\n },\n {\n \"content\": \" is_large: false,\\n\\n used: false,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn write_low_low(&mut self, val1: u8, val2: u8) {\\n\\n self.x = (((self.x as u16) & 0xff00) | u16::from(val1)) as i16;\\n\\n self.y = val2;\\n\\n }\\n\\n\\n\\n pub fn write_low_high(&mut self, val1: u8, val2: u8) {\\n\\n self.tile_nr = val1;\\n\\n self.attrs = val2;\\n\\n }\\n\\n\\n\\n pub fn write_high(&mut self, val: u8) {\\n\\n self.x = ((self.x as u16 & 0xff) | (0u16.wrapping_sub((val & 1).into()) & 0xff00)) as i16;\\n\\n self.is_large = val & 2 > 0;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"rsnes/src/oam.rs\",\n \"rank\": 62,\n \"score\": 2.923039790333628\n },\n {\n \"content\": \" fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\\n\\n self.get_mut().deserialize(state)\\n\\n }\\n\\n}\\n\\n\\n\\n// This uses 0 and 255 for false and true. That will make the memory\\n\\n// representation more robust against memory corruption by random\\n\\n// bit flips.\\n\\nimpl InSaveState for bool {\\n\\n fn serialize(&self, state: &mut SaveStateSerializer) {\\n\\n let i: u8 = if *self { 0xff } else { 0 };\\n\\n i.serialize(state)\\n\\n }\\n\\n\\n\\n fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\\n\\n let mut i: u8 = 0;\\n\\n i.deserialize(state);\\n\\n *self = i.count_ones() >= 4\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"save-state/src/lib.rs\",\n \"rank\": 63,\n \"score\": 2.8987998328877493\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub const fn is_xflip(&self) -> bool {\\n\\n self.attrs & 0x40 > 0\\n\\n }\\n\\n\\n\\n pub const fn is_yflip(&self) -> bool {\\n\\n self.attrs & 0x80 > 0\\n\\n }\\n\\n\\n\\n pub fn get_tile_addr(&self, base: u16, tilex: u8, tiley: u8) -> u16 {\\n\\n let tile_nr = self.tile_nr.wrapping_add(tilex).wrapping_add(tiley << 4);\\n\\n base.wrapping_add(u16::from(tile_nr) << 4)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, InSaveState)]\\n\\npub struct Oam {\\n\\n pub(crate) objs: [Object; 128],\\n\\n // 10-bit value\\n\",\n \"file_path\": \"rsnes/src/oam.rs\",\n \"rank\": 64,\n \"score\": 2.8980785735530694\n },\n {\n \"content\": \"\\n\\n pub const fn to_byte(self) -> u8 {\\n\\n self as u8\\n\\n }\\n\\n}\\n\\n\\n\\nimpl save_state::InSaveState for MaskLogic {\\n\\n fn serialize(&self, state: &mut SaveStateSerializer) {\\n\\n self.to_byte().serialize(state)\\n\\n }\\n\\n\\n\\n fn deserialize(&mut self, state: &mut SaveStateDeserializer) {\\n\\n let mut n: u8 = 0;\\n\\n n.deserialize(state);\\n\\n *self = Self::from_byte(n)\\n\\n }\\n\\n}\\n\\n\\n\\nconst fn sign_extend<const B: u16>(n: u16) -> u16 {\\n\\n if n & ((1 << B) >> 1) > 0 {\\n\\n n | !((1 << B) - 1)\\n\\n } else {\\n\\n n & (((1 << B) >> 1) - 1)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Settings used to draw Mode 7's BG1.\\n\\n#[derive(Debug, Clone, InSaveState)]\\n\",\n \"file_path\": \"rsnes/src/ppu.rs\",\n \"rank\": 65,\n \"score\": 2.8515063322121477\n },\n {\n \"content\": \" (1, 32) => DspVersion::Dsp2,\\n\\n (1, 8) => DspVersion::Dsp3,\\n\\n (2, 8) => DspVersion::Dsp1,\\n\\n _ => DspVersion::Dsp1B,\\n\\n },\\n\\n RomType::HiRom => match (rom_size >> 20, ram_size >> 10) {\\n\\n (4, 0) => DspVersion::Dsp1,\\n\\n (4, 2) => DspVersion::Dsp1B, // TODO: Some games may use DSP1 (?)\\n\\n (2, 2 | 8) => DspVersion::Dsp1B,\\n\\n _ => DspVersion::Dsp1B, // TODO: is this appropriate?\\n\\n },\\n\\n _ => return None,\\n\\n };\\n\\n Some(ver)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\\n\\npub enum CountryFrameRate {\\n\\n Any,\\n\",\n \"file_path\": \"rsnes/src/cartridge.rs\",\n \"rank\": 66,\n \"score\": 2.7397593853614755\n },\n {\n \"content\": \" header = Some((new, score));\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n let (header, _score) = header.ok_or(ReadRomError::NoSuitableHeader)?;\\n\\n\\n\\n let rom = create_rom(bytes, header.rom_size);\\n\\n\\n\\n use core::num::Wrapping;\\n\\n let Wrapping(checksum): Wrapping<u16> =\\n\\n rom.iter().copied().map(Into::into).map(Wrapping).sum();\\n\\n if checksum != header.checksum {\\n\\n eprintln!(\\\"warning: checksum did not match! Checksum in ROM is {:04x}; Calculated checksum is {:04x}\\\", header.checksum, checksum);\\n\\n }\\n\\n\\n\\n let ram_size = header.ram_size;\\n\\n\\n\\n let dsp = if let Some(Coprocessor::Dsp) = header.coprocessor {\\n\\n let ver = header\\n\",\n \"file_path\": \"rsnes/src/cartridge.rs\",\n \"rank\": 67,\n \"score\": 2.676818690633497\n },\n {\n \"content\": \" pub port1: ControllerPort,\\n\\n pub port2: ControllerPort,\\n\\n pio: u8,\\n\\n pub(crate) auto_joypad_timer: u16,\\n\\n}\\n\\n\\n\\nimpl ControllerPorts {\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\\n port1: ControllerPort::new(Controller::Standard(StandardController::new())),\\n\\n port2: ControllerPort::new(Controller::None),\\n\\n pio: 0,\\n\\n auto_joypad_timer: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Write to the programmable I/O-port.\\n\\n /// Returns if EXTLATCH shall be triggered.\\n\\n pub fn set_pio(&mut self, val: u8) -> bool {\\n\\n (replace(&mut self.pio, val) & !val) & 0x80 > 0\\n\",\n \"file_path\": \"rsnes/src/controller.rs\",\n \"rank\": 68,\n \"score\": 2.616053864453213\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn load_cartridge(&mut self, mut cartridge: Cartridge) {\\n\\n cartridge.set_region(self.is_pal);\\n\\n self.cartridge = Some(cartridge);\\n\\n self.cpu = Cpu::new();\\n\\n self.reset_program_counter();\\n\\n }\\n\\n\\n\\n pub fn reset_program_counter(&mut self) {\\n\\n let addr = crate::cpu::RESET_VECTOR_ADDR;\\n\\n self.cpu.regs.pc = Addr24::new(0, self.read::<u16>(addr));\\n\\n if self.cartridge.as_ref().unwrap().has_sa1() {\\n\\n let vector = self.with_sa1_cpu().read::<u16>(addr);\\n\\n self.cartridge.as_mut().unwrap().sa1_mut().cpu_mut().regs.pc = Addr24::new(0, vector);\\n\\n }\\n\\n }\\n\\n\\n\\n /// Read a value from the mapped memory at the specified address.\\n\",\n \"file_path\": \"rsnes/src/device.rs\",\n \"rank\": 69,\n \"score\": 2.5585950757866573\n },\n {\n \"content\": \" state.data.as_slice()[..core::mem::size_of::<[T; N]>()].try_into();\\n\\n state.consume(N);\\n\\n // TODO: use normal transmute instead as soon as possible!!\\n\\n // see https://github.com/rust-lang/rust/issues/43408\\n\\n // see https://github.com/rust-lang/rust/issues/60471\\n\\n *self = unsafe { core::mem::transmute_copy(res.unwrap()) }\\n\\n } else {\\n\\n panic!(\\\"not enough data to deserialize\\\")\\n\\n }\\n\\n } else {\\n\\n self.iter_mut().for_each(|i| i.deserialize(state))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: InSaveState + Copy> InSaveState for core::cell::Cell<T> {\\n\\n fn serialize(&self, state: &mut SaveStateSerializer) {\\n\\n self.get().serialize(state)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"save-state/src/lib.rs\",\n \"rank\": 70,\n \"score\": 2.5042291658399822\n },\n {\n \"content\": \" smp: Smp::new(audio_backend, is_pal, is_threaded),\\n\\n ppu: Ppu::new(frame_buffer, is_pal),\\n\\n dma: Dma::new(),\\n\\n controllers: ControllerPorts::new(),\\n\\n cartridge: None,\\n\\n open_bus: 0,\\n\\n ram: [0; RAM_SIZE],\\n\\n wram_addr: Cell::new(0),\\n\\n memory_cycles: 0,\\n\\n cpu_ahead_cycles: 186,\\n\\n new_scanline: true,\\n\\n new_frame: true,\\n\\n scanline_drawn: false,\\n\\n do_hdma: true,\\n\\n irq_time_h: 0x7fc,\\n\\n irq_time_v: 0x1ff,\\n\\n shall_irq: false,\\n\\n shall_nmi: false,\\n\\n nmi_vblank_bit: Cell::new(false),\\n\\n math_registers: MathRegisters::new(),\\n\",\n \"file_path\": \"rsnes/src/device.rs\",\n \"rank\": 71,\n \"score\": 2.4907200173152133\n },\n {\n \"content\": \" while !snes.new_frame {\\n\\n snes.run_cycle::<MASTER_CYCLES_PER_TICK>();\\n\\n cycle_count += u64::from(MASTER_CYCLES_PER_TICK)\\n\\n }\\n\\n // a more precise calculation is not possible by using floats\\n\\n next_device_update += Duration::from_nanos((8800 * cycle_count) / 189);\\n\\n // reset the next update timer if it fell to far behind\\n\\n if now > next_device_update + TIME_UNTIL_TIMER_RESET {\\n\\n next_device_update = now;\\n\\n }\\n\\n }\\n\\n let now = Instant::now();\\n\\n if now >= next_graphics_update {\\n\\n window.request_redraw();\\n\\n next_graphics_update = now + TIME_PER_GPU_FRAME;\\n\\n }\\n\\n }\\n\\n Event::RedrawRequested(_) => {\\n\\n match surf.get_current_texture() {\\n\\n Ok(surface_texture) => {\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 72,\n \"score\": 2.384644720965176\n },\n {\n \"content\": \" if vblanked {\\n\\n self.ppu.vblank();\\n\\n }\\n\\n if self.ppu.get_pos().x + crate::ppu::RAY_AHEAD_CYCLES >= self.ppu.get_scanline_cycles()\\n\\n && self.ppu.get_pos().y + 1 < vend\\n\\n && !self.scanline_drawn\\n\\n {\\n\\n self.scanline_drawn = true;\\n\\n self.ppu.draw_scanline();\\n\\n }\\n\\n let h_irq_enabled = self.cpu.nmitimen & 0x10 > 0;\\n\\n let v_irq_enabled = self.cpu.nmitimen & 0x20 > 0;\\n\\n self.shall_irq = self.shall_irq\\n\\n || ((h_irq_enabled || v_irq_enabled)\\n\\n && (!h_irq_enabled\\n\\n || ((self.ppu.get_pos().x as i16 - N as i16) >> 2 < self.irq_time_h as i16\\n\\n && self.ppu.get_pos().x >> 2 >= self.irq_time_h))\\n\\n && (!v_irq_enabled || self.ppu.get_pos().y == self.irq_time_v)\\n\\n && (h_irq_enabled || !v_irq_enabled || self.new_scanline));\\n\\n self.nmi_vblank_bit\\n\",\n \"file_path\": \"rsnes/src/timing.rs\",\n \"rank\": 73,\n \"score\": 2.3678979301584704\n },\n {\n \"content\": \" .with_inner_size(size)\\n\\n .with_title(format!(\\\"{} - {}\\\", env!(\\\"CARGO_PKG_NAME\\\"), title))\\n\\n .build(&event_loop)\\n\\n .unwrap_or_else(|err| error!(\\\"Failure while creating window ({})\\\", err));\\n\\n\\n\\n let inst = wgpu::Instance::new(wgpu::Backends::VULKAN);\\n\\n let surf = unsafe { inst.create_surface(&window) };\\n\\n let adapter = inst\\n\\n .request_adapter(&wgpu::RequestAdapterOptions {\\n\\n power_preference: wgpu::PowerPreference::LowPower,\\n\\n compatible_surface: Some(&surf),\\n\\n force_fallback_adapter: false,\\n\\n })\\n\\n .block_on()\\n\\n .unwrap_or_else(|| error!(\\\"Failure finding a graphics adapter\\\"));\\n\\n let (device, queue) = adapter\\n\\n .request_device(\\n\\n &wgpu::DeviceDescriptor {\\n\\n label: None,\\n\\n features: wgpu::Features::empty(),\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 74,\n \"score\": 2.3566189762312746\n },\n {\n \"content\": \" /// This method also updates open bus.\\n\\n pub fn read<D: Data>(&mut self, addr: Addr24) -> D {\\n\\n let value = self.read_data::<D>(addr);\\n\\n self.open_bus = value.to_open_bus();\\n\\n self.memory_cycles +=\\n\\n (self.get_memory_cycle(addr) - 6) * core::mem::size_of::<D::Arr>() as u32;\\n\\n value\\n\\n }\\n\\n\\n\\n /// Write a value to the mapped memory at the specified address.\\n\\n /// This method also updates open bus.\\n\\n pub fn write<D: Data>(&mut self, addr: Addr24, value: D) {\\n\\n self.open_bus = value.to_open_bus();\\n\\n self.write_data(addr, value);\\n\\n self.memory_cycles +=\\n\\n (self.get_memory_cycle(addr) - 6) * core::mem::size_of::<D::Arr>() as u32;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<B: AudioBackend, FB: FrameBuffer> Device<B, FB> {\\n\",\n \"file_path\": \"rsnes/src/device.rs\",\n \"rank\": 75,\n \"score\": 2.222029944673146\n },\n {\n \"content\": \" limits: wgpu::Limits::downlevel_defaults().using_resolution(adapter.limits()),\\n\\n },\\n\\n None,\\n\\n )\\n\\n .block_on()\\n\\n .unwrap_or_else(|err| error!(\\\"Failure requesting a GPU command queue ({})\\\", err));\\n\\n let (vs_entry, vs_shader) = shaders::create_vs(&device);\\n\\n let (fs_entry, fs_shader) = shaders::create_fs(&device);\\n\\n\\n\\n let bind_group_layout = device.create_bind_group_layout(&wgpu::BindGroupLayoutDescriptor {\\n\\n label: None,\\n\\n entries: &[\\n\\n wgpu::BindGroupLayoutEntry {\\n\\n binding: 0,\\n\\n visibility: wgpu::ShaderStages::FRAGMENT,\\n\\n ty: wgpu::BindingType::Texture {\\n\\n sample_type: wgpu::TextureSampleType::Float { filterable: true },\\n\\n view_dimension: wgpu::TextureViewDimension::D2,\\n\\n multisampled: false,\\n\\n },\\n\",\n \"file_path\": \"emulator/src/main.rs\",\n \"rank\": 76,\n \"score\": 2.2181907509503382\n },\n {\n \"content\": \"# rsnes\\n\\n\\n\\n<div align='center'>\\n\\n <img src='https://user-images.githubusercontent.com/26610181/131219139-4b2c12ca-cc3d-4a72-827c-1c83476a4401.png'\\n\\n alt='rsnes logo' width='384cm' align='center'>\\n\\n</div>\\n\\n\\n\\nA [SNES](https://en.wikipedia.org/wiki/Super_Nintendo_Entertainment_System)\\n\\nemulator written in [Rust](https://www.rust-lang.org/)\\n\\n\\n\\n## Implementation Status\\n\\n\\n\\nMany games are already playable, but some graphics and sounds are faulty.\\n\\nComparatively functioning games are e.g. Donkey Kong Country, Wolfenstein 3D,\\n\\nF-Zero, Super Mario World, Super Mario Kart, The Legend of Zelda,\\n\\nSuper Street Fighter II.\\n\\n\\n\\n## Usage\\n\\n\\n\\nIn the default configuration, controller port 1 is connected to a\\n\\nstandard controller and port 2 is left unconnected.\\n\\nThese keyboard keys will drive controller 1:\\n\\n\\n\\n| Keyboard key on QWERTY | Controller key |\\n\\n|------------------------|----------------------|\\n\\n| **W** | **↑** |\\n\\n| **A** | **←** |\\n\\n| **S** | **↓** |\\n\\n| **D** | **→** |\\n\\n| **Q** | **L** |\\n\\n| **E** | **R** |\\n\\n| **Left Alt** | **Start** |\\n\\n| **Right Alt** | **Select** |\\n\\n| **J** | **A** |\\n\\n| **K** | **B** |\\n\\n| **L** | **X** |\\n\\n| **;** *\\\\** | **Y** |\\n\\n| 0-9 | Store Save State 0-9 |\\n\\n| Shift + 0-9 | Load Save State 0-9 |\\n\\n\\n\\n*\\\\** the button right of *L*\\n\\n\\n\\n## Configuration\\n\\n\\n\\nYou can configure rsnes with a [TOML](https://toml.io/) configuration file.\\n\\nYou can provide this file by using the option `--config <PATH>` or by placing\\n\\nit into one of these paths:\\n\\n\\n\\n- `$HOME/.config/rsnes/config.toml`\\n\\n- `$HOME/.config/rsnes.toml`\\n\\n- `/etc/rsnes.toml`\\n\\n\\n\\nSee `emulator/example.toml` for\\n\\n[documentation](https://github.com/nat-rix/rsnes/blob/main/emulator/example.toml).\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 77,\n \"score\": 1.446926102342868\n }\n]","isConversational":false}}},{"rowIdx":792,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/serialization/database.rs"},"repo_name":{"kind":"string","value":"MDeiml/attomath"},"commit":{"kind":"string","value":"4aac4dad3cd776dd2cb1602aa930c04c315d5186"},"file_code":{"kind":"string","value":"use crate::{error::ProofError, expression::SingleSubstitution, Identifier, Theorem};\nuse std::collections::HashMap;\n\n#[derive(Debug, PartialEq, Eq)]\npub struct Database {\n names: HashMap<String, (usize, usize)>,\n theorems: Vec<(Theorem, Proof<usize>, Option<String>)>,\n last_name: usize,\n}\n\n#[derive(Debug, PartialEq, Eq, Clone)]\npub enum Proof<K> {\n Simplify(K, Identifier, Identifier),\n Combine(K, K, usize),\n Axiom(Theorem),\n}\n\nimpl<K> Proof<K> {\n pub fn map_id_result<K1, F, E>(self, f: F) -> Result<Proof<K1>, E>\n where\n F: Fn(K) -> Result<K1, E>,\n {\n Ok(match self {\n Proof::Simplify(id, a, b) => Proof::Simplify(f(id)?, a, b),\n Proof::Combine(id_a, id_b, index) => Proof::Combine(f(id_a)?, f(id_b)?, index),\n Proof::Axiom(theorem) => Proof::Axiom(theorem),\n })\n }\n\n pub fn map_id<K1, F>(self, f: F) -> Proof<K1>\n where\n F: Fn(K) -> K1,\n {\n self.map_id_result::<_, _, ()>(|id| Ok(f(id))).unwrap()\n }\n}\n\n#[derive(Debug)]\npub enum DatabaseError {\n \n \n TheoremNotFound(Option<String>, Option<usize>),\n \n \n NameCollision(String),\n TheoremMismatch(Theorem, Theorem),\n ProofError(ProofError),\n}\n\nimpl From<ProofError> for DatabaseError {\n fn from(e: ProofError) -> Self {\n Self::ProofError(e)\n }\n}\n\nimpl Database {\n pub fn new() -> Self {\n Self {\n names: HashMap::new(),\n theorems: Vec::new(),\n last_name: 0,\n }\n }\n\n fn get_index(&self, name: Option<&str>, index: Option<usize>) -> Result<usize, DatabaseError> {\n let (start, end) = match name {\n Some(name) => *self\n .names\n .get(name)\n .ok_or(DatabaseError::TheoremNotFound(Some(name.to_owned()), index))?,\n None => (self.last_name, self.theorems.len()),\n };\n match index {\n Some(i) => {\n if start + i < end {\n Ok(start + i)\n } else {\n Err(DatabaseError::TheoremNotFound(\n name.map(|s| s.to_owned()),\n index,\n ))\n }\n }\n None => {\n if start == end {\n Err(DatabaseError::TheoremNotFound(\n name.map(|s| s.to_owned()),\n index,\n ))\n } else {\n Ok(end - 1)\n }\n }\n }\n }\n\n pub fn get(&self, name: Option<&str>, index: Option<usize>) -> Result<&Theorem, DatabaseError> {\n Ok(&self.theorems[self.get_index(name, index)?].0)\n }\n\n pub fn add_name(&mut self, name: String) -> Result<(), DatabaseError> {\n if self.theorems.is_empty() {\n return Err(DatabaseError::TheoremNotFound(None, Some(0)));\n }\n let index = self.theorems.len() - 1;\n if self.theorems[index].2.is_some() {\n return Err(DatabaseError::TheoremNotFound(None, None));\n }\n match self.names.entry(name.clone()) {\n std::collections::hash_map::Entry::Occupied(_) => {\n Err(DatabaseError::NameCollision(name))\n }\n std::collections::hash_map::Entry::Vacant(entry) => {\n &entry.insert((self.last_name, index + 1));\n self.last_name = index + 1;\n self.theorems[index].2 = Some(name.to_owned());\n Ok(())\n }\n }\n }\n\n pub fn add_proof<'a>(\n &'a mut self,\n proof: Proof<(Option<String>, Option<usize>)>,\n ) -> Result<&'a Theorem, DatabaseError> {\n let proof = proof.map_id_result(|id| self.get_index(id.0.as_deref(), id.1))?;\n let new_theorem = match proof {\n Proof::Simplify(id, a, b) => {\n let theorem = &self.theorems[id].0;\n let mut new_theorem =\n theorem.substitute(&SingleSubstitution::new(a, b).unwrap())?;\n new_theorem.standardize();\n new_theorem\n }\n Proof::Combine(id_a, id_b, index) => {\n let theorem_a = &self.theorems[id_a].0;\n let theorem_b = &self.theorems[id_b].0;\n let mut new_theorem = theorem_a.combine(&theorem_b, index)?;\n new_theorem.standardize();\n new_theorem\n }\n Proof::Axiom(ref theorem) => theorem.clone(),\n };\n self.theorems.push((new_theorem, proof, None));\n Ok(&self.theorems.last().unwrap().0)\n }\n\n pub fn substitute(&mut self, theorem: Theorem) -> Result<(), DatabaseError> {\n let last = &mut self\n .theorems\n .last_mut()\n .ok_or(DatabaseError::TheoremNotFound(None, None))?\n .0;\n let mut theorem_standardized = theorem.clone();\n theorem_standardized.standardize();\n if last == &theorem_standardized {\n *last = theorem;\n Ok(())\n } else {\n Err(DatabaseError::TheoremMismatch(theorem, last.clone()))\n }\n }\n\n fn reverse_id(&self, id: usize, current_id: usize) -> (Option<&str>, Option<usize>) {\n if let Some(name) = &self.theorems[id].2 {\n (Some(name), None)\n } else if id == current_id - 1 {\n (None, None)\n } else if id >= self.last_name {\n (None, Some(id - self.last_name))\n } else {\n let name = self.theorems[id..]\n .iter()\n .filter_map(|x| x.2.as_ref())\n .next()\n .unwrap();\n let (start, end) = self.names[name];\n if end >= current_id {\n (None, Some(id - start))\n } else {\n (Some(name), Some(id - start))\n }\n }\n }\n\n pub fn proofs<'a>(\n &'a self,\n ) -> impl 'a + Iterator<Item = (&Theorem, Proof<(Option<&str>, Option<usize>)>, Option<&str>)>\n {\n self.theorems\n .iter()\n .enumerate()\n .map(move |(current_id, (theorem, proof, name))| {\n let proof = proof.clone().map_id(|id| self.reverse_id(id, current_id));\n (theorem, proof, name.as_deref())\n })\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::{error::ProofError, expression::SingleSubstitution, Identifier, Theorem};\nuse std::collections::HashMap;\n\n#[derive(Debug, PartialEq, Eq)]\npub struct Database {\n names: HashMap<String, (usize, usize)>,\n theorems: Vec<(Theorem, Proof<usize>, Option<String>)>,\n last_name: usize,\n}\n\n#[derive(Debug, PartialEq, Eq, Clone)]\npub enum Proof<K> {\n Simplify(K, Identifier, Identifier),\n Combine(K, K, usize),\n Axiom(Theorem),\n}\n\nimpl<K> Proof<K> {\n pub fn map_id_result<K1, F, E>(self, f: F) -> Result<Proof<K1>, E>\n where\n F: Fn(K) -> Result<K1, E>,\n {\n Ok(match self {\n Proof::Simplify(id, a, b) => Proof::Simplify(f(id)?, a, b),\n Proof::Combine(id_a, id_b, index) => Proof::Combine(f(id_a)?, f(id_b)?, index),\n Proof::Axiom(theorem) => Proof::Axiom(theorem),\n })\n }\n\n pub fn map_id<K1, F>(self, f: F) -> Proof<K1>\n where\n F: Fn(K) -> K1,\n {\n self.map_id_result::<_, _, ()>(|id| Ok(f(id))).unwrap()\n }\n}\n\n#[derive(Debug)]\npub enum DatabaseError {\n \n \n TheoremNotFound(Option<String>, Option<usize>),\n \n \n NameCollision(String),\n TheoremMismatch(Theorem, Theorem),\n ProofError(ProofError),\n}\n\nimpl From<ProofError> for DatabaseError {\n fn from(e: ProofError) -> Self {\n Self::ProofError(e)\n }\n}\n\nimpl Database {\n pub fn new() -> Self {\n Self {\n names: HashMap::new(),\n theorems: Vec::new(),\n last_name: 0,\n }\n }\n\n fn get_index(&self, name: Option<&str>, index: Option<usize>) -> Result<usize, DatabaseError> {\n let (start, end) = match name {\n Some(name) => *self\n .names\n .get(name)\n .ok_or(DatabaseError::TheoremNotFound(Some(name.to_owned()), index))?,\n None => (self.last_name, self.theorems.len()),\n };\n match index {\n Some(i) => {\n if start + i < end {\n Ok(start + i)\n } else {\n Err(DatabaseError::TheoremNotFound(\n name.map(|s| s.to_owned()),\n index,\n ))\n }\n }\n None => {\n if start == end {\n Err(DatabaseError::TheoremNotFound(\n name.map(|s| s.to_owned()),\n index,\n ))\n } else {\n Ok(end - 1)\n }\n }\n }\n }\n\n pub fn get(&self, name: Option<&str>, index: Option<usize>) -> Result<&Theorem, DatabaseError> {\n Ok(&self.theorems[self.get_index(name, index)?].0)\n }\n\n pub fn add_name(&mut self, name: String) -> Result<(), DatabaseError> {\n if self.theorems.is_empty() {\n return Err(DatabaseError::TheoremNotFound(None, Some(0)));\n }\n let index = self.theorems.len() - 1;\n if self.theorems[index].2.is_some() {\n return Err(DatabaseError::TheoremNotFound(None, None));\n }\n match self.names.entry(name.clone()) {\n std::collections::hash_map::Entry::Occupied(_) => {\n Err(DatabaseError::NameCollision(name))\n }\n std::collections::hash_map::Entry::Vacant(entry) => {\n &entry.insert((self.last_name, index + 1));\n self.last_name = index + 1;\n self.theorems[index].2 = Some(name.to_owned());\n Ok(())\n }\n }\n }\n\n pub fn add_proof<'a>(\n &'a mut self,\n proof: Proof<(Option<String>, Option<usize>)>,\n ) -> Result<&'a Theorem, DatabaseError> {\n let proof = proof.map_id_result(|id| self.get_index(id.0.as_deref(), id.1))?;\n let new_theorem = match proof {\n Proof::Simplify(id, a, b) => {\n let theorem = &self.theorems[id].0;\n let mut new_theorem =\n theorem.substitute(&SingleSubstitution::new(a, b).unwrap())?;\n new_theorem.standardize();\n new_theorem\n }\n Proof::Combine(id_a, id_b, index) => {\n let theorem_a = &self.theorems[id_a].0;\n let theorem_b = &self.theorems[id_b].0;\n let mut new_theorem = theorem_a.combine(&theorem_b, index)?;\n new_theorem.standardize();\n new_theorem\n }\n Proof::Axiom(ref theorem) => theorem.clone(),\n };\n self.theorems.push((new_theorem, proof, None));\n Ok(&self.theorems.last().unwrap().0)\n }\n\n "},"suffix":{"kind":"string","value":"\n\n fn reverse_id(&self, id: usize, current_id: usize) -> (Option<&str>, Option<usize>) {\n if let Some(name) = &self.theorems[id].2 {\n (Some(name), None)\n } else if id == current_id - 1 {\n (None, None)\n } else if id >= self.last_name {\n (None, Some(id - self.last_name))\n } else {\n let name = self.theorems[id..]\n .iter()\n .filter_map(|x| x.2.as_ref())\n .next()\n .unwrap();\n let (start, end) = self.names[name];\n if end >= current_id {\n (None, Some(id - start))\n } else {\n (Some(name), Some(id - start))\n }\n }\n }\n\n pub fn proofs<'a>(\n &'a self,\n ) -> impl 'a + Iterator<Item = (&Theorem, Proof<(Option<&str>, Option<usize>)>, Option<&str>)>\n {\n self.theorems\n .iter()\n .enumerate()\n .map(move |(current_id, (theorem, proof, name))| {\n let proof = proof.clone().map_id(|id| self.reverse_id(id, current_id));\n (theorem, proof, name.as_deref())\n })\n }\n}\n"},"middle":{"kind":"string","value":"pub fn substitute(&mut self, theorem: Theorem) -> Result<(), DatabaseError> {\n let last = &mut self\n .theorems\n .last_mut()\n .ok_or(DatabaseError::TheoremNotFound(None, None))?\n .0;\n let mut theorem_standardized = theorem.clone();\n theorem_standardized.standardize();\n if last == &theorem_standardized {\n *last = theorem;\n Ok(())\n } else {\n Err(DatabaseError::TheoremMismatch(theorem, last.clone()))\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn or_fail<I, O, E: ParseError<I>, F>(mut f: F) -> impl FnMut(I) -> IResult<I, O, E>\n\nwhere\n\n F: Parser<I, O, E>,\n\n{\n\n move |input| {\n\n f.parse(input).map_err(|error| match error {\n\n nom::Err::Error(e) => nom::Err::Failure(e),\n\n e => e,\n\n })\n\n }\n\n}\n","file_path":"src/serialization/error.rs","rank":0,"score":132622.50170997303},{"content":"/// Tests whether the given identifier is an operator.\n\n///\n\n/// Operators occupy the range `(Identifier::MIN ..= -1)`.\n\n/// The special value `Identifier::MIN` is also an operator.\n\n///\n\n/// # Example\n\n/// ```\n\n/// use attomath::{expression::is_operator, Identifier};\n\n///\n\n/// assert!(is_operator(-2));\n\n/// assert!(is_operator(Identifier::MIN));\n\n/// assert!(!is_operator(0));\n\n/// ```\n\npub fn is_operator(x: Identifier) -> bool {\n\n x < 0\n\n}\n\n\n\n/// A substion to combine two other substitutions.\n\n///\n\n/// Tries to use `first` first and uses `then` if the variable did not get substituted by `first`.\n\npub struct ChainSubstitution<S: Substitution, T: Substitution> {\n\n pub first: S,\n\n pub then: T,\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum Either<S, T> {\n\n Left(S),\n\n Right(T),\n\n}\n\n\n\nimpl<S: Borrow<[Identifier]>, T: Borrow<[Identifier]>> Borrow<[Identifier]> for Either<S, T> {\n\n fn borrow(&self) -> &[Identifier] {\n","file_path":"src/expression.rs","rank":1,"score":72440.53308190452},{"content":"struct Permutations<'a, T> {\n\n sequence: &'a mut [T],\n\n counters: Vec<usize>,\n\n depth: usize,\n\n}\n\n\n\nimpl<'a, T> Permutations<'a, T> {\n\n fn new(sequence: &'a mut [T]) -> Self {\n\n let length = sequence.len();\n\n Permutations {\n\n sequence,\n\n counters: vec![0; length],\n\n depth: 0,\n\n }\n\n }\n\n\n\n fn next(&mut self) -> Option<&mut [T]> {\n\n if self.depth >= self.sequence.len() {\n\n return None;\n\n }\n","file_path":"src/theorem.rs","rank":2,"score":53321.55939320048},{"content":"fn main() {\n\n let filename = std::env::args().nth(1).unwrap();\n\n let mut fmt = Formatter::new();\n\n let mut database = Database::new();\n\n\n\n let file = File::open(filename).unwrap();\n\n for (line_number, line) in BufReader::new(file).lines().enumerate() {\n\n let line = line.unwrap();\n\n let command = match Command::parse(&fmt, &line) {\n\n Ok(command) => command,\n\n Err(err) => {\n\n eprintln!(\n\n \"Syntax error in line {}: {:?}\\n\\t{}\",\n\n line_number, err, line\n\n );\n\n return;\n\n }\n\n };\n\n match command.clone().apply(&mut fmt, &mut database) {\n\n Ok(_) => (),\n","file_path":"src/main.rs","rank":3,"score":36194.49992289758},{"content":"#[derive(Debug)]\n\nenum GreedyErrorKind {\n\n Context(&'static str),\n\n Nom(ErrorKind),\n\n Char(char),\n\n}\n\n\n","file_path":"src/serialization/error.rs","rank":4,"score":32354.361956467183},{"content":"/// A `Substitution` maps variable ids to expressions (represented by a sequence of identifiers).\n\n///\n\n/// This is intented to be used together with [`Expression`]s.\n\npub trait Substitution {\n\n type T: Borrow<[Identifier]> + std::fmt::Debug;\n\n\n\n /// Get the stored substitution for the variable with identifier `id`. Or `None` if the\n\n /// variable should not be replaced.\n\n ///\n\n /// # Panics\n\n /// This may panic if `id` is not in the range of the particular substitution.\n\n ///\n\n /// # Example\n\n /// ```\n\n /// use attomath::expression::{Substitution, WholeSubstitution, Expression};\n\n ///\n\n /// let expr = Expression::from_raw([-2, 0, 1]).unwrap();\n\n /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// sub.insert(0, expr.to_slice());\n\n /// assert_eq!(sub.substitution_opt(0), Some(expr.to_slice()));\n\n /// assert_eq!(sub.substitution_opt(1), None);\n\n /// ```\n\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<Self::T>>;\n","file_path":"src/expression.rs","rank":5,"score":32021.073007318766},{"content":"pub trait Length {\n\n fn length(&self) -> usize;\n\n}\n\n\n\nimpl Length for &str {\n\n fn length(&self) -> usize {\n\n self.len()\n\n }\n\n}\n\n\n\nimpl Display for GreedyError<&str> {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n for (input, error) in self.0.iter() {\n\n writeln!(f, \"{:?} {}\", error, &input[0..20])?;\n\n }\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl<I> ParseError<I> for GreedyError<I>\n","file_path":"src/serialization/error.rs","rank":6,"score":30627.413785086275},{"content":"/// When using this struct it is guaranteed that only valid theorems can be constructed (using\n\n/// [`Theorem::substitute`], [`Theorem::combine`] and [`Theorem::standardize`]) provided that only valid theorems (or axioms)\n\n/// are constructed using [`Theorem::new`].\n\n#[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Debug)]\n\npub struct Theorem {\n\n conclusion: OwnedStatement,\n\n assumptions: Vec<OwnedStatement>,\n\n dvrs: Vec<DVR>,\n\n}\n\n\n\nimpl Theorem {\n\n /// Returns this theorems' conclusion\n\n pub fn conclusion(&self) -> &OwnedStatement {\n\n &self.conclusion\n\n }\n\n\n\n /// Returns this theorems' assumptions\n\n pub fn assumptions(&self) -> &[OwnedStatement] {\n\n &self.assumptions\n\n }\n","file_path":"src/theorem.rs","rank":7,"score":25807.964127875308},{"content":" pub fn combine(&self, other: &Theorem, index: usize) -> Result<Self, ProofError> {\n\n let max_var = self.max_var();\n\n let mut substitution =\n\n WholeSubstitution::with_capacity((Wrapping(max_var as usize) + Wrapping(1)).0);\n\n other\n\n .conclusion\n\n .unify(&self.assumptions[index], &mut substitution)?;\n\n let shift = other.max_var() + 1;\n\n let shift_sub = ShiftSubstitution::new(shift);\n\n let substitution = ChainSubstitution {\n\n first: substitution,\n\n then: shift_sub,\n\n };\n\n let mut t = self.substitute_skip_assumption(&substitution, Some(index))?;\n\n t.assumptions.extend_from_slice(&other.assumptions);\n\n t.assumptions.shrink_to_fit();\n\n t.dvrs.extend_from_slice(&other.dvrs);\n\n t.dvrs.shrink_to_fit();\n\n Ok(t)\n\n }\n\n}\n\n\n","file_path":"src/theorem.rs","rank":8,"score":25807.182303713776},{"content":" .max()\n\n .unwrap_or(-1)\n\n }\n\n\n\n /// Uses the given substitution on this theorem's assumptions, dvrs and conclusion to create a\n\n /// new theorem. (see [`Statement::substitute`][crate::Statement::substitute], [`DVR::substitute`])\n\n ///\n\n /// # Errors\n\n /// This method can return a `DVRError` if the substitution violates one of this theorem's\n\n /// `DVR`s.\n\n ///\n\n pub fn substitute<S: Substitution>(&self, substitution: &S) -> Result<Self, ProofError> {\n\n self.substitute_skip_assumption(substitution, None)\n\n }\n\n\n\n fn substitute_skip_assumption<S: Substitution>(\n\n &self,\n\n substitution: &S,\n\n skip_assumption: Option<usize>,\n\n ) -> Result<Self, ProofError> {\n","file_path":"src/theorem.rs","rank":9,"score":25806.736866691776},{"content":" // part of the conclusion. But these are now numbered 0 .. next_var and do not have to be\n\n // changed any longer.\n\n for (i, v) in var_map.iter_mut().enumerate() {\n\n *v = if i < next_var as usize {\n\n Some(i as Identifier)\n\n } else {\n\n None\n\n };\n\n }\n\n // var_maps holds the current candidates for the variable substitution that results in the\n\n // lowest lexicographic ordering\n\n let mut var_maps = vec![var_map];\n\n\n\n for assumptions in indexed_assumptions\n\n .group_by_mut(|(_, i), (_, j)| normalized_assumptions[*i] == normalized_assumptions[*j])\n\n {\n\n let mut next_var1 = 0;\n\n let mut assumptions_min: Option<Vec<(OwnedStatement, usize)>> = None;\n\n\n\n // for each new group and each candidate in var_maps try all permutation of \"new\"\n","file_path":"src/theorem.rs","rank":10,"score":25804.19555461024},{"content":"\n\n /// Returns this theorems' `DVR`s\n\n pub fn dvrs(&self) -> &[DVR] {\n\n &self.dvrs\n\n }\n\n\n\n /// Create a new `Theorem` containig the given assumptions, `DVR`s and conclusion\n\n ///\n\n /// This should only be used for axioms and theorems that are already proven.\n\n pub fn new(\n\n conclusion: OwnedStatement,\n\n assumptions: Vec<OwnedStatement>,\n\n dvrs: Vec<DVR>,\n\n ) -> Self {\n\n Theorem {\n\n conclusion,\n\n assumptions,\n\n dvrs,\n\n }\n\n }\n","file_path":"src/theorem.rs","rank":11,"score":25803.959981350872},{"content":" .unwrap();\n\n }\n\n\n\n self.dvrs.sort_unstable();\n\n self.dvrs.dedup();\n\n }\n\n\n\n /// Returns the variable with the biggest identifier occuring in this theorem. This can be used\n\n /// together with [`WholeSubstitution::with_capacity`].\n\n pub fn max_var(&self) -> Identifier {\n\n self.conclusion\n\n .expression\n\n .variables()\n\n .chain(\n\n self.assumptions\n\n .iter()\n\n .map(|st| st.expression.variables())\n\n .flatten(),\n\n )\n\n .filter(|symb| !is_operator(*symb))\n","file_path":"src/theorem.rs","rank":12,"score":25799.602605229215},{"content":" }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn permutations() {\n\n let mut arr = [0, 1, 2, 3];\n\n let mut perm = Permutations::new(&mut arr);\n\n let mut counter = 0;\n\n while let Some(_) = perm.next() {\n\n counter += 1;\n\n }\n\n assert_eq!(counter, 24);\n\n }\n\n}\n","file_path":"src/theorem.rs","rank":13,"score":25799.5389285385},{"content":" Ok(Theorem {\n\n conclusion,\n\n assumptions,\n\n dvrs,\n\n })\n\n }\n\n\n\n /// Creates a new `Theorem` by applying `other` to this theorem's assumption with index `index`\n\n ///\n\n /// # Panics\n\n /// This may panic if `index > self.assumptions().len`\n\n ///\n\n /// # Errors\n\n /// This can product the following errors:\n\n /// * `OperatorMismatch`, `VariableMismatch` or `JudgementMismatch` - if the conclusion of\n\n /// `other` cannot be unified with the specified assumption (see\n\n /// [`Statement::unify`][crate::Statement::unify])\n\n /// * `DVRError`- if the substitution needed to transform the conclusion of `other` into the\n\n /// specified assumption violates one of this theorems' `DVR`s\n\n ///\n","file_path":"src/theorem.rs","rank":14,"score":25798.56998350813},{"content":"\n\n /// Turns this theorem into its standard representation, numbering variables in the order of\n\n /// their apperance and sorting the assumptions and dvrs (see\n\n /// [`Expression::standardize`][crate::Expression::standardize]).\n\n ///\n\n /// It holds, that applying standardize twice is the same as applying it once. Two theorems are\n\n /// logically \"equal\", that is they can be constructed from each other by reordering\n\n /// assumptions and substituting variables by mutally distinct variables, if and only if they\n\n /// are the same after calling standardize on them.\n\n pub fn standardize(&mut self) {\n\n let max_var = self.max_var();\n\n let mut var_map = vec![None; (Wrapping(max_var as usize) + Wrapping(1)).0];\n\n let mut next_var = 0;\n\n\n\n // first number the variables of the conclusion in order\n\n self.conclusion\n\n .expression\n\n .standardize_range(&mut var_map, &mut next_var, ..);\n\n\n\n // remove duplicate assumptions\n","file_path":"src/theorem.rs","rank":15,"score":25798.30366091356},{"content":" // variables, i.e. variables that have are not yet determined in the candidates.\n\n // Save the best permutations in var_maps1 as the new candidates for the next iteration\n\n let mut var_maps1 = Vec::new();\n\n for var_map in var_maps.iter_mut() {\n\n let mut perm = assumptions.iter().cloned().collect::<Vec<_>>();\n\n for (assumption, _) in perm.iter_mut() {\n\n assumption.expression.substitute_variables(&var_map);\n\n }\n\n let mut perm = Permutations::new(&mut perm);\n\n while let Some(permutation) = perm.next() {\n\n let mut var_map1 = var_map.clone();\n\n next_var1 = next_var;\n\n\n\n for (assumption, _) in permutation.iter_mut() {\n\n assumption.expression.standardize_range(\n\n &mut var_map1,\n\n &mut next_var1,\n\n next_var..,\n\n );\n\n }\n","file_path":"src/theorem.rs","rank":16,"score":25797.466201369527},{"content":" })\n\n .collect::<Vec<_>>();\n\n // sort the assumptions by their normalized version. Assumptions with the same\n\n // normalization are now grouped together\n\n indexed_assumptions.sort_unstable_by_key(|(_, index)| &normalized_assumptions[*index]);\n\n\n\n // The rest of this function is to find for each group of the same normalization the\n\n // variable substitution (some variables could be fixed by previous groups) that results\n\n // in the smallest lexicographic ordering of the group after its elements are sorted\n\n\n\n // first standardize all assumptions in their new order, so for each group the \"free\"\n\n // variables are going to be substituted by some permutation of themselves\n\n let mut temp_next_var = next_var;\n\n for (assumption, _) in indexed_assumptions.iter_mut() {\n\n assumption\n\n .expression\n\n .standardize_range(&mut var_map, &mut temp_next_var, ..);\n\n }\n\n\n\n // we have to forget the variable map we just computed, but not the variables that are also\n","file_path":"src/theorem.rs","rank":17,"score":25797.416062888577},{"content":" // TODO: maybe move this into combine / simplify\n\n self.assumptions.sort_unstable();\n\n self.assumptions.dedup();\n\n\n\n // calculate a \"normalized\" version for each assumption. That is, number each single\n\n // theorems variables in order\n\n let mut indexed_assumptions = self\n\n .assumptions\n\n .iter()\n\n .cloned()\n\n .enumerate()\n\n .map(|(a, b)| (b, a))\n\n .collect::<Vec<_>>();\n\n let normalized_assumptions = self\n\n .assumptions\n\n .drain(..)\n\n .map(|assumption| {\n\n let mut normalized = assumption;\n\n normalized.expression.standardize();\n\n normalized\n","file_path":"src/theorem.rs","rank":18,"score":25797.294509949694},{"content":" }\n\n }\n\n var_maps = var_maps1;\n\n next_var = next_var1;\n\n // save the minimal substitution in indexed_assumptions. This way we do not have to\n\n // substitute again with some candidate (*)\n\n assumptions.swap_with_slice(assumptions_min.unwrap().as_mut_slice());\n\n }\n\n\n\n // just use the saved assumptions (*) this is equivalent to every substitution candidate\n\n self.assumptions\n\n .extend(indexed_assumptions.into_iter().map(|(a, _)| a));\n\n\n\n // every variable in a DVR has to appear in some assumption or the conclusion. Just order\n\n // the DVRs accordingly.\n\n for dvr in self.dvrs.iter_mut() {\n\n *dvr = dvr\n\n .substitute(&VariableSubstitution::new(var_maps[0].as_slice()).unwrap())\n\n .next()\n\n .unwrap()\n","file_path":"src/theorem.rs","rank":19,"score":25796.673782635182},{"content":"use std::{cmp::Ordering, num::Wrapping};\n\n\n\nuse crate::{\n\n dvr::DVR,\n\n error::ProofError,\n\n expression::{\n\n is_operator, ChainSubstitution, ShiftSubstitution, Substitution, VariableSubstitution,\n\n WholeSubstitution,\n\n },\n\n statement::OwnedStatement,\n\n types::*,\n\n};\n\n\n\n/// A theorem consisting of zero or more [`DVR`] or __assumptions__\n\n/// and a __conclusion__\n\n///\n\n/// A theorem could represent something like _if x0 is provable and (x0 -> x1) is provable then b\n\n/// is provable_. In this example the assumptions would be _x0_ and _x0 -> x1_ and the conclusion\n\n/// would be _x1_.\n\n///\n","file_path":"src/theorem.rs","rank":20,"score":25795.672388991847},{"content":" match assumptions_min\n\n .as_deref_mut()\n\n .map(|a_min| {\n\n permutation\n\n .iter()\n\n .map(|(a, _)| a)\n\n .cmp(a_min.iter().map(|(a, _)| a))\n\n })\n\n .unwrap_or(Ordering::Less)\n\n {\n\n Ordering::Equal => {\n\n var_maps1.push(var_map1);\n\n }\n\n Ordering::Less => {\n\n var_maps1.clear();\n\n var_maps1.push(var_map1);\n\n assumptions_min = Some(permutation.iter().cloned().collect());\n\n }\n\n Ordering::Greater => {}\n\n }\n","file_path":"src/theorem.rs","rank":21,"score":25795.061189617245},{"content":" if self.depth != 0 {\n\n while self.counters[self.depth] >= self.depth {\n\n self.counters[self.depth] = 0;\n\n self.depth += 1;\n\n if self.depth >= self.sequence.len() {\n\n return None;\n\n }\n\n }\n\n if self.depth % 2 == 0 {\n\n self.sequence.swap(0, self.depth);\n\n } else {\n\n self.sequence.swap(self.counters[self.depth], self.depth);\n\n }\n\n self.counters[self.depth] += 1;\n\n self.depth = 1;\n\n Some(&mut self.sequence)\n\n } else {\n\n self.depth = 1;\n\n Some(&mut self.sequence)\n\n }\n","file_path":"src/theorem.rs","rank":22,"score":25794.029647855117},{"content":" let conclusion = self.conclusion.substitute(substitution);\n\n let assumptions: Vec<OwnedStatement> = self\n\n .assumptions\n\n .iter()\n\n .enumerate()\n\n .filter_map(|(i, a)| {\n\n if Some(i) == skip_assumption {\n\n None\n\n } else {\n\n Some(a)\n\n }\n\n })\n\n .map(|a| a.substitute(substitution))\n\n .collect();\n\n let dvrs = self\n\n .dvrs\n\n .iter()\n\n .map(|dvr| dvr.substitute(substitution))\n\n .flatten()\n\n .collect::<Result<Vec<_>, _>>()?;\n","file_path":"src/theorem.rs","rank":23,"score":25793.219868834978},{"content":"pub enum Command {\n\n Proof(\n\n Proof<(Option<String>, Option<usize>)>,\n\n Option<Theorem>,\n\n Option<String>,\n\n ),\n\n Judgement(String),\n\n Operator(String, u8),\n\n}\n\n\n\nimpl Command {\n\n pub fn apply(self, fmt: &mut Formatter, database: &mut Database) -> Result<(), DatabaseError> {\n\n match self {\n\n Command::Proof(proof, theorem, name) => {\n\n let _theorem = database.add_proof(proof)?;\n\n if let Some(name) = name {\n\n database.add_name(name)?;\n\n }\n\n if let Some(theorem) = theorem {\n\n database.substitute(theorem)?;\n","file_path":"src/serialization/command.rs","rank":28,"score":25.61028773529167},{"content":" }\n\n DatabaseError::ProofError(err) => {\n\n let (id_a, id_b, index) = match command {\n\n Command::Proof(Proof::Combine(id_a, id_b, index), _, _) => {\n\n (id_a, id_b, index)\n\n }\n\n _ => unreachable!(),\n\n };\n\n let theorem_a = database.get(id_a.0.as_deref(), id_a.1).unwrap();\n\n let theorem_b = database.get(id_b.0.as_deref(), id_b.1).unwrap();\n\n let mut sa = String::new();\n\n fmt.format_theorem(&mut sa, &theorem_a);\n\n let mut sb = String::new();\n\n fmt.format_theorem(&mut sb, &theorem_b);\n\n let mut ss = String::new();\n\n fmt.format_statement(&mut ss, &theorem_a.assumptions()[index]);\n\n eprintln!(\n\n \"proof error combining\\n{}\\ninto the argument {} of\\n{}\",\n\n sb, ss, sa\n\n );\n","file_path":"src/main.rs","rank":33,"score":22.771394460964608},{"content":" /// assert_eq!(sub.substitution_opt(1), None);\n\n /// ```\n\n pub fn insert(&mut self, id: Identifier, expr: Expression<&'a [Identifier]>) {\n\n self.substitution[id as usize] = Some(expr)\n\n }\n\n}\n\n\n\nimpl<'a> Substitution for WholeSubstitution<'a> {\n\n type T = &'a [Identifier];\n\n\n\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<&'a [Identifier]>> {\n\n self.substitution[id as usize]\n\n }\n\n}\n\n\n\n/// A single variable substitution\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct SingleSubstitution(Identifier, Identifier);\n\n\n\nimpl SingleSubstitution {\n","file_path":"src/expression.rs","rank":35,"score":22.609949546359754},{"content":" Err(err) => {\n\n eprint!(\"Error in line {}: \", line_number);\n\n match err {\n\n DatabaseError::TheoremNotFound(name, id) => match (name, id) {\n\n (Some(name), Some(id)) => eprint!(\"theorem {}.{} not found\", name, id),\n\n (Some(name), None) => eprintln!(\"theorem {} not found\", name),\n\n (None, Some(id)) => eprint!(\"theorem {} not found\", id),\n\n (None, None) => eprintln!(\"theorem $ not found\"),\n\n },\n\n DatabaseError::NameCollision(name) => {\n\n eprintln!(\"{} already defined\", name)\n\n }\n\n DatabaseError::TheoremMismatch(theorem_a, theorem_b) => {\n\n eprintln!(\"theorem mismatch\");\n\n let mut sa = String::new();\n\n fmt.format_theorem(&mut sa, &theorem_a);\n\n let mut sb = String::new();\n\n fmt.format_theorem(&mut sb, &theorem_b);\n\n eprintln!(\"expected: {}\", sb);\n\n eprintln!(\" found: {}\", sa);\n","file_path":"src/main.rs","rank":36,"score":22.20097798340933},{"content":" Ok((input, Command::Judgement(judgement.to_owned())))\n\n }\n\n\n\n fn parse_operator<'a>(input: &'a str) -> IResult<&'a str, Command, GreedyError<&'a str>> {\n\n let (input, _) = tag(\"opr \")(input)?;\n\n let (input, operator) = take_until(\" \")(input)?;\n\n let (input, _) = char(' ')(input)?;\n\n let (input, arity) = map_opt(digit1, |s: &str| s.parse::<u8>().ok())(input)?;\n\n Ok((input, Command::Operator(operator.to_owned(), arity)))\n\n }\n\n\n\n fn serialize_id(&self, s: &mut String, id: &(Option<String>, Option<usize>)) {\n\n match id {\n\n (Some(name), Some(index)) => write!(s, \"{}.{}\", name, index + 1).unwrap(),\n\n (Some(name), None) => s.push_str(&name),\n\n (None, Some(index)) => write!(s, \"{}\", index + 1).unwrap(),\n\n (None, None) => s.push_str(\"$\"),\n\n }\n\n }\n\n\n","file_path":"src/serialization/command.rs","rank":37,"score":22.054169248486808},{"content":" pub fn serialize(&self, s: &mut String, fmt: &Formatter) {\n\n match self {\n\n Command::Proof(Proof::Simplify(id, a, b), theorem, name) => {\n\n s.push_str(\"smp \");\n\n self.serialize_id(s, id);\n\n s.push_str(\" (\");\n\n fmt.format_variable(s, *a);\n\n s.push_str(\" ~ \");\n\n fmt.format_variable(s, *b);\n\n s.push_str(\" )\");\n\n if let Some(theorem) = theorem {\n\n s.push_str(\" { \");\n\n fmt.format_theorem(s, theorem);\n\n s.push_str(\" }\");\n\n }\n\n if let Some(name) = name {\n\n write!(s, \": {}\", name).unwrap();\n\n }\n\n }\n\n Command::Proof(Proof::Combine(id_a, id_b, index), theorem, name) => {\n","file_path":"src/serialization/command.rs","rank":38,"score":21.749770377036135},{"content":"\n\n /// Creates a new `DVR` restricting `a` and `b` from being the same variable.\n\n ///\n\n /// # Errors\n\n /// This function fails with a `DVRError` if `a == b`\n\n ///\n\n /// # Example\n\n /// ```\n\n /// use attomath::DVR;\n\n /// use attomath::error::ProofError;\n\n ///\n\n /// let dvr = DVR::new(0, 1);\n\n /// assert_eq!(dvr.map(|d| d.variables()), Ok((0, 1)));\n\n ///\n\n /// let dvr = DVR::new(1, 1);\n\n /// assert_eq!(dvr, Err(ProofError::DVRError(1)));\n\n /// ```\n\n pub fn new(a: Identifier, b: Identifier) -> Result<Self, ProofError> {\n\n if is_operator(a) {\n\n Err(ProofError::DVRError(a))\n","file_path":"src/dvr.rs","rank":39,"score":20.580164595757843},{"content":" database.proofs().map(|(theorem, proof, name)| {\n\n let mut should_serialize_theorem = name.is_some();\n\n if !should_serialize_theorem {\n\n let mut theorem1 = theorem.clone();\n\n theorem1.standardize();\n\n should_serialize_theorem |= &theorem1 != theorem;\n\n }\n\n Command::Proof(\n\n proof.map_id(|(s, n)| (s.map(|s| s.to_owned()), n)),\n\n if should_serialize_theorem {\n\n Some(theorem.clone())\n\n } else {\n\n None\n\n },\n\n name.map(|n| n.to_owned()),\n\n )\n\n })\n\n }\n\n}\n\n\n","file_path":"src/serialization/command.rs","rank":40,"score":20.136460027333644},{"content":" /// Create a new substitution to rename one variable.\n\n ///\n\n /// Returns `None` if one of the identifiers is not a variable (see [is_operator]).\n\n pub fn new(a: Identifier, b: Identifier) -> Option<Self> {\n\n if is_operator(a) || is_operator(b) {\n\n return None;\n\n }\n\n Some(SingleSubstitution(a, b))\n\n }\n\n}\n\n\n\nimpl Substitution for SingleSubstitution {\n\n type T = [Identifier; 1];\n\n\n\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<[Identifier; 1]>> {\n\n if id == self.0 {\n\n Some(Expression { data: [self.1] })\n\n } else {\n\n None\n\n }\n","file_path":"src/expression.rs","rank":41,"score":20.014899819746457},{"content":" }\n\n}\n\n\n\n/// A complete variable substitution.\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct VariableSubstitution<T: Borrow<[Option<Identifier>]>>(T);\n\n\n\nimpl<T: Borrow<[Option<Identifier>]>> VariableSubstitution<T> {\n\n /// Creates a substitution with the capacity to store replacements for variables `0` to\n\n /// `n - 1`.\n\n ///\n\n /// Returns none if a identifier in `variables` is not a variable (see [is_operator]).\n\n pub fn new(variables: T) -> Option<Self> {\n\n for var in variables.borrow() {\n\n if let Some(var) = var {\n\n if is_operator(*var) {\n\n return None;\n\n }\n\n }\n\n }\n","file_path":"src/expression.rs","rank":43,"score":19.807117219825752},{"content":" )),\n\n )),\n\n |(_, theorem, _, name)| (Some(theorem), name),\n\n ),\n\n map(tuple((tag(\": \"), rest)), |(_, name): (&str, &str)| {\n\n (None, Some(name.to_owned()))\n\n }),\n\n ))(input)?;\n\n Ok((\n\n input,\n\n Command::Proof(Proof::Combine(id_a, id_b, index - 1), theorem, name),\n\n ))\n\n })(input)\n\n }\n\n\n\n fn parse_axiom<'a>(\n\n fmt: &Formatter,\n\n input: &'a str,\n\n ) -> IResult<&'a str, Command, GreedyError<&'a str>> {\n\n let (input, _) = tag(\"axm { \")(input)?;\n","file_path":"src/serialization/command.rs","rank":44,"score":19.64054980572643},{"content":"\n\n impl Iterator for Iter {\n\n type Item = Result<DVR, ProofError>;\n\n\n\n fn next(&mut self) -> Option<Result<DVR, ProofError>> {\n\n if self.index >= self.a.len() * self.b.len() {\n\n return None;\n\n }\n\n let res = DVR::new(\n\n self.a[self.index % self.a.len()],\n\n self.b[self.index / self.a.len()],\n\n );\n\n self.index += 1;\n\n Some(res)\n\n }\n\n\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n\n let rem = self.a.len() * self.b.len() - self.index;\n\n (rem, Some(rem))\n\n }\n\n }\n\n Iter {\n\n a: vars_a,\n\n b: vars_b,\n\n index: 0,\n\n }\n\n }\n\n}\n","file_path":"src/dvr.rs","rank":45,"score":19.576997020248037},{"content":" .copied()\n\n .filter(|s| !is_operator(*s))\n\n }\n\n\n\n /// Returns the subexpression beginning at the given index.\n\n ///\n\n /// # Panics\n\n /// This method panics if start_index is not in the range `0..self.data().borrow().len()`\n\n ///\n\n /// # Example\n\n /// ```\n\n /// use attomath::expression::Expression;\n\n ///\n\n /// let st = Expression::from_raw([-2, 0, -2, 1, 0]).unwrap();\n\n /// assert_eq!(*st.subexpression(2).data(), &[-2, 1, 0]);\n\n /// assert_eq!(*st.subexpression(3).data(), &[1]);\n\n /// ```\n\n pub fn subexpression<'a>(&'a self, start_index: usize) -> Expression<&'a [Identifier]> {\n\n Self::subexpression_check(&self.data, start_index).expect(\n\n format!(\n","file_path":"src/expression.rs","rank":46,"score":19.528877225453886},{"content":" .add_proof(Proof::Combine(\n\n (None, None),\n\n (Some(\"b\".to_owned()), None),\n\n 0,\n\n ))\n\n .unwrap();\n\n database.add_name(\"c\".to_owned()).unwrap();\n\n\n\n let theorem = database.get(Some(\"c\"), None).unwrap();\n\n assert_eq!(theorem, &Theorem::new(c, vec![], vec![]));\n\n\n\n let mut fmt = Formatter::new();\n\n fmt.add_operator(\"A\".to_owned(), 0);\n\n fmt.add_operator(\"B\".to_owned(), 0);\n\n fmt.add_operator(\"C\".to_owned(), 0);\n\n fmt.add_judgement(\"|-\".to_owned());\n\n let s = serialize_database(&fmt, &database);\n\n assert_eq!(\n\n s,\n\n r#\"jdg |-\n","file_path":"src/serialization/command.rs","rank":47,"score":18.449943604755084},{"content":" /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// let result = a.unify(&b, &mut sub);\n\n /// assert_eq!(result, Err(ProofError::OperatorMismatch(-3, -2)));\n\n /// ```\n\n pub fn unify<'a, S: Borrow<[Identifier]>>(\n\n &'a self,\n\n other: &Expression<S>,\n\n substitution: &mut WholeSubstitution<'a>,\n\n ) -> Result<(), ProofError> {\n\n let expr = self.data.borrow();\n\n let mut expr_index = 0;\n\n for &symb in other.data.borrow().iter() {\n\n if is_operator(symb) {\n\n let symb_self = expr[expr_index];\n\n expr_index += 1;\n\n if symb_self != symb {\n\n return Err(ProofError::OperatorMismatch(symb_self, symb));\n\n }\n\n } else {\n\n if let Some(old) = substitution.substitution_opt(symb) {\n","file_path":"src/expression.rs","rank":48,"score":18.358273995100113},{"content":" or_fail(|input| {\n\n let (input, id_a) = map_parser(is_not(\"(\"), Self::parse_id)(input)?;\n\n let (input, _) = tag(\"(\")(input)?;\n\n let (input, index) = map_opt(digit1, |s: &str| {\n\n s.parse::<usize>().ok().filter(|i| *i != 0)\n\n })(input)?;\n\n let (input, _) = tag(\") <- \")(input)?;\n\n let (input, id_b) = map_parser(is_not(\" \"), Self::parse_id)(input)?;\n\n let (input, (theorem, name)) = alt((\n\n map(eof, |_| (None, None)),\n\n map(\n\n tuple((\n\n tag(\" { \"),\n\n map_parser(take_until(\" }\"), |input| fmt.parse_theorem(input)),\n\n tag(\" }\"),\n\n alt((\n\n map(eof, |_| None),\n\n map(tuple((tag(\": \"), rest)), |(_, name): (&str, &str)| {\n\n Some(name.to_owned())\n\n }),\n","file_path":"src/serialization/command.rs","rank":49,"score":17.57817572492599},{"content":" |input| self.parse_arity(0, input),\n\n ))(input)\n\n }\n\n\n\n pub fn format_variable(&self, s: &mut String, mut id: Identifier) {\n\n assert!(id >= 0);\n\n id += 1;\n\n s.extend(\n\n std::iter::from_fn(move || {\n\n if id == 0 {\n\n None\n\n } else if id <= 26 {\n\n let c = ('a' as u8 + (id % 26) as u8 - 1) as char;\n\n id = 0;\n\n Some(c)\n\n } else {\n\n let c = ('a' as u8 + (id % 26) as u8) as char;\n\n id /= 26;\n\n Some(c)\n\n }\n","file_path":"src/serialization/formatter.rs","rank":50,"score":17.263122661446328},{"content":" )),\n\n )),\n\n |(_, theorem, _, name)| (Some(theorem), name),\n\n ),\n\n map(tuple((tag(\": \"), rest)), |(_, name): (&str, &str)| {\n\n (None, Some(name.to_owned()))\n\n }),\n\n ))(input)?;\n\n Ok((\n\n input,\n\n Command::Proof(Proof::Simplify(id, a, b), theorem, name),\n\n ))\n\n })(input)\n\n }\n\n\n\n fn parse_combine<'a>(\n\n fmt: &Formatter,\n\n input: &'a str,\n\n ) -> IResult<&'a str, Command, GreedyError<&'a str>> {\n\n let (input, _) = tag(\"cmb \")(input)?;\n","file_path":"src/serialization/command.rs","rank":51,"score":17.175179049825008},{"content":" fn subexpression_check<'a>(\n\n expr: &'a T,\n\n start_index: usize,\n\n ) -> Option<Expression<&'a [Identifier]>> {\n\n let mut depth = 1;\n\n for (i, &s) in expr.borrow()[start_index..].iter().enumerate() {\n\n if is_operator(s) && s != Identifier::MIN {\n\n depth += 1;\n\n } else {\n\n depth -= 1;\n\n }\n\n if depth == 0 {\n\n return Some(Expression {\n\n data: &expr.borrow()[start_index..=start_index + i],\n\n });\n\n }\n\n }\n\n None\n\n }\n\n}\n","file_path":"src/expression.rs","rank":52,"score":16.434657741046287},{"content":"#[derive(Debug, PartialEq, Eq)]\n\npub struct Formatter {\n\n operators: Vec<(String, u8)>,\n\n judgements: Vec<String>,\n\n}\n\n\n\nimpl Formatter {\n\n pub fn new() -> Self {\n\n Formatter {\n\n operators: Vec::new(),\n\n judgements: Vec::new(),\n\n }\n\n }\n\n\n\n pub fn operators(&self) -> impl Iterator<Item = (&str, u8)> {\n\n self.operators\n\n .iter()\n\n .map(|(operator, arity)| (operator.as_str(), *arity))\n\n }\n\n\n","file_path":"src/serialization/formatter.rs","rank":53,"score":16.38167685816282},{"content":" .unwrap();\n\n\n\n database\n\n .add_proof(Proof::Axiom(Theorem::new(b.clone(), vec![], vec![])))\n\n .unwrap();\n\n database.add_name(\"b\".to_owned()).unwrap();\n\n\n\n database\n\n .add_proof(Proof::Axiom(Theorem::new(c.clone(), vec![a, b], vec![])))\n\n .unwrap();\n\n database.add_name(\"abc\".to_owned()).unwrap();\n\n\n\n database\n\n .add_proof(Proof::Combine(\n\n (Some(\"abc\".to_owned()), None),\n\n (Some(\"b\".to_owned()), Some(0)),\n\n 0,\n\n ))\n\n .unwrap();\n\n database\n","file_path":"src/serialization/command.rs","rank":54,"score":16.070733218876587},{"content":"use crate::{\n\n error::ProofError,\n\n expression::{is_operator, Substitution},\n\n types::*,\n\n};\n\n\n\n/// A _distince variable relation_ for expressing that two variables must be different.\n\n///\n\n/// In the default case it is always assumed that all statements are correct if you replace\n\n/// a variable with a different subexpression. This leads to logical errors in statements like\n\n/// `forall x0. exists x1. x0 != x1`.\n\n#[derive(PartialEq, Eq, Clone, PartialOrd, Ord, Debug)]\n\npub struct DVR(Identifier, Identifier);\n\n\n\nimpl DVR {\n\n /// Returns this `DVR`s variables\n\n pub fn variables(&self) -> (Identifier, Identifier) {\n\n let DVR(a, b) = self;\n\n (*a, *b)\n\n }\n","file_path":"src/dvr.rs","rank":55,"score":16.00144652672507},{"content":"cmb $(5) <- 1\n\ncmb ax-1(2) <- wi\n\nsmp $ (a ~ b)\n\nsmp $ (a ~ b)\n\nsmp $ (a ~ b)\n\ncmb 3(3) <- $ { wff a => |- (a -> a) }: id\n\n\"#;\n\n let mut fmt = Formatter::new();\n\n match parse_database(&mut fmt, s) {\n\n Err((line, e)) => {\n\n eprintln!(\"In line:\\n\\t{}\", line);\n\n match e {\n\n Error::DatabaseError(DatabaseError::TheoremMismatch(t1, t2)) => {\n\n let mut s1 = String::new();\n\n fmt.format_theorem(&mut s1, &t1);\n\n let mut s2 = String::new();\n\n fmt.format_theorem(&mut s2, &t2);\n\n panic!(\"TheoremMismatch:\\n{}\\n{}\", s1, s2);\n\n }\n\n e => {\n\n panic!(\"{:?}\", e);\n\n }\n\n }\n\n }\n\n _ => (),\n\n }\n\n }\n\n}\n","file_path":"src/serialization/command.rs","rank":56,"score":15.61110368397199},{"content":" or_fail(|input| {\n\n let (input, theorem) =\n\n map_parser(take_until(\" }\"), |input| fmt.parse_theorem(input))(input)?;\n\n let (input, _) = tag(\" }\")(input)?;\n\n let (input, name) = alt((\n\n map(eof, |_| None),\n\n map(tuple((tag(\": \"), rest)), |(_, name): (&str, &str)| {\n\n Some(name.to_owned())\n\n }),\n\n ))(input)?;\n\n Ok((\n\n input,\n\n Command::Proof(Proof::Axiom(theorem.clone()), None, name),\n\n ))\n\n })(input)\n\n }\n\n\n\n fn parse_judgement<'a>(input: &'a str) -> IResult<&'a str, Command, GreedyError<&'a str>> {\n\n let (input, _) = tag(\"jdg \")(input)?;\n\n let (input, judgement) = rest(input)?;\n","file_path":"src/serialization/command.rs","rank":57,"score":15.427269009779783},{"content":" /// expected.dedup();\n\n /// assert_eq!(new_dvrs, Ok(expected));\n\n ///\n\n /// let dvr = DVR::new(0, 1).unwrap();\n\n /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// let expr0 = Expression::from_raw(vec![-2, 0, 1]).unwrap();\n\n /// sub.insert(0, expr0.to_slice());\n\n /// let expr1 = Expression::from_raw(vec![-2, 1, 2]).unwrap();\n\n /// sub.insert(1, expr1.to_slice());\n\n ///\n\n /// let new_dvrs = dvr.substitute(&sub).collect::<Result<Vec<_>, _>>();\n\n ///\n\n /// assert_eq!(new_dvrs, Err(ProofError::DVRError(1)));\n\n /// ```\n\n pub fn substitute<S: Substitution>(\n\n &self,\n\n substitution: &S,\n\n ) -> impl Iterator<Item = Result<DVR, ProofError>> {\n\n let DVR(a, b) = self;\n\n let vars_a = if let Some(sub) = substitution.substitution_opt(*a) {\n","file_path":"src/dvr.rs","rank":58,"score":15.40211748672587},{"content":" type T = [Identifier; 1];\n\n\n\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<[Identifier; 1]>> {\n\n if id < 0 {\n\n panic!(\"id is not a variable\");\n\n }\n\n Some(Expression {\n\n data: [id + self.shift as Identifier],\n\n })\n\n }\n\n}\n\n\n\n/// A general substitution\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct WholeSubstitution<'a> {\n\n substitution: Vec<Option<Expression<&'a [Identifier]>>>,\n\n}\n\n\n\nimpl<'a> WholeSubstitution<'a> {\n\n /// Creates a substitution with the capacity to store replacements for variables `0` to\n","file_path":"src/expression.rs","rank":59,"score":15.28263873059454},{"content":" s.push_str(\"cmb \");\n\n self.serialize_id(s, id_a);\n\n write!(s, \"({}) <- \", index + 1).unwrap();\n\n self.serialize_id(s, id_b);\n\n if let Some(theorem) = theorem {\n\n s.push_str(\" { \");\n\n fmt.format_theorem(s, theorem);\n\n s.push_str(\" }\");\n\n }\n\n if let Some(name) = name {\n\n write!(s, \": {}\", name).unwrap();\n\n }\n\n }\n\n Command::Proof(Proof::Axiom(theorem), _, name) => {\n\n s.push_str(\"axm { \");\n\n fmt.format_theorem(s, theorem);\n\n s.push_str(\" }\");\n\n if let Some(name) = name {\n\n write!(s, \": {}\", name).unwrap();\n\n }\n","file_path":"src/serialization/command.rs","rank":60,"score":15.256815886607434},{"content":" /// assert_eq!(res, Err(ProofError::JudgementMismatch(0, 1)));\n\n /// ```\n\n pub fn unify<'a, S: Borrow<[Identifier]>>(\n\n &'a self,\n\n other: &Statement<S>,\n\n substitution: &mut WholeSubstitution<'a>,\n\n ) -> Result<(), ProofError> {\n\n if self.judgement != other.judgement {\n\n return Err(ProofError::JudgementMismatch(\n\n self.judgement,\n\n other.judgement,\n\n ));\n\n }\n\n self.expression.unify(&other.expression, substitution)?;\n\n return Ok(());\n\n }\n\n\n\n /// Convenience function for using a `Substitution` on this statements expression (see\n\n /// [`Expression::substitute`])\n\n pub fn substitute<S: Substitution>(&self, substitution: &S) -> Statement<Box<[Identifier]>> {\n\n Statement {\n\n judgement: self.judgement,\n\n expression: self.expression.substitute(substitution),\n\n }\n\n }\n\n}\n","file_path":"src/statement.rs","rank":61,"score":15.183137746569603},{"content":" /// `n - 1`.\n\n pub fn with_capacity(n: usize) -> Self {\n\n WholeSubstitution {\n\n substitution: vec![None; n],\n\n }\n\n }\n\n\n\n /// Marks the `id` to be substituted by `expr`.\n\n ///\n\n /// # Panics\n\n /// This method panics if `id` is not in the range of this substitutions capacity\n\n ///\n\n /// # Example\n\n /// ```\n\n /// use attomath::expression::{Expression, Substitution, WholeSubstitution};\n\n ///\n\n /// let expr = Expression::from_raw([-2, 0, 1]).unwrap();\n\n /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// sub.insert(0, expr.to_slice());\n\n /// assert_eq!(sub.substitution_opt(0), Some(expr.to_slice()));\n","file_path":"src/expression.rs","rank":62,"score":15.07166310948092},{"content":" context(\"smp\", |input| Self::parse_simplify(&fmt, input)),\n\n context(\"cmb\", |input| Self::parse_combine(&fmt, input)),\n\n context(\"axm\", |input| Self::parse_axiom(&fmt, input)),\n\n )),\n\n ),\n\n context(\"jdg\", |input| Self::parse_judgement(input)),\n\n context(\"opr\", |input| Self::parse_operator(input)),\n\n ))))(input)?;\n\n Ok(command)\n\n }\n\n\n\n fn parse_id(input: &str) -> IResult<&str, (Option<String>, Option<usize>), GreedyError<&str>> {\n\n alt((\n\n terminated(map(char('$'), |_| (None, None)), eof),\n\n terminated(\n\n map_opt(digit1, |s: &str| {\n\n Some((\n\n None,\n\n Some(s.parse::<usize>().ok().and_then(|i| {\n\n if i == 0 {\n","file_path":"src/serialization/command.rs","rank":63,"score":14.891085043152133},{"content":"\n\nimpl<T: BorrowMut<[Identifier]> + std::fmt::Debug> Expression<T> {\n\n /// Turns this expression into its standard representation, numbering variables in the order of\n\n /// their apperance.\n\n ///\n\n /// # Example\n\n /// ```\n\n /// use attomath::expression::Expression;\n\n ///\n\n /// let mut s = Expression::from_raw([-2, -2, 2, 0, 2]).unwrap();\n\n /// s.standardize();\n\n /// assert_eq!(s.data(), &[-2, -2, 0, 1, 0]);\n\n /// ```\n\n pub fn standardize(&mut self) {\n\n let max_var = self.variables().max().unwrap_or(-1);\n\n let mut var_map = vec![None; (Wrapping(max_var as usize) + Wrapping(1)).0];\n\n let mut next_var = 0;\n\n self.standardize_range(&mut var_map, &mut next_var, ..);\n\n }\n\n\n","file_path":"src/expression.rs","rank":64,"score":14.78127860920461},{"content":" match err {\n\n attomath::error::ProofError::OperatorMismatch(op_a, op_b) => eprintln!(\n\n \"operator mismatch: expected {} found {}\",\n\n fmt.operators().nth((-op_b) as usize - 1).unwrap().0,\n\n fmt.operators().nth((-op_a) as usize - 1).unwrap().0,\n\n ),\n\n attomath::error::ProofError::VariableMismatch(var, sub_a, sub_b) => {\n\n let mut sv = String::new();\n\n fmt.format_variable(&mut sv, var);\n\n let mut sa = String::new();\n\n fmt.format_expression(\n\n &mut sa,\n\n &Expression::from_raw(sub_b).unwrap(),\n\n );\n\n let mut sb = String::new();\n\n fmt.format_expression(\n\n &mut sb,\n\n &Expression::from_raw(sub_a).unwrap(),\n\n );\n\n eprintln!(\n","file_path":"src/main.rs","rank":65,"score":14.467628067111729},{"content":" pub fn judgements(&self) -> impl Iterator<Item = &str> {\n\n self.judgements.iter().map(|judgement| judgement.as_str())\n\n }\n\n\n\n pub fn add_operator(&mut self, operator: String, arity: u8) {\n\n // TODO: verify\n\n self.operators.push((operator, arity));\n\n }\n\n\n\n pub fn add_judgement(&mut self, judgement: String) {\n\n // TODO: verify\n\n self.judgements.push(judgement);\n\n }\n\n\n\n pub fn format_operator<T: Borrow<[Identifier]> + std::fmt::Debug>(\n\n &self,\n\n s: &mut String,\n\n id: Identifier,\n\n left: &Expression<T>,\n\n right: &Expression<T>,\n","file_path":"src/serialization/formatter.rs","rank":66,"score":14.431474630252621},{"content":" })\n\n .collect::<Vec<_>>()\n\n .into_iter(),\n\n );\n\n }\n\n\n\n pub fn parse_variable<'a>(\n\n &self,\n\n input: &'a str,\n\n ) -> IResult<&'a str, Identifier, GreedyError<&'a str>> {\n\n let (input, var) = take_while1(|c| c >= 'a' && c <= 'z')(input)?;\n\n let mut id = 0i16;\n\n for c in var.chars() {\n\n id *= 26;\n\n if id == 0 {\n\n id += 1;\n\n }\n\n id += (c as u8 - 'a' as u8) as i16;\n\n }\n\n Ok((input, id - 1))\n","file_path":"src/serialization/formatter.rs","rank":67,"score":14.310278048468493},{"content":" None\n\n } else {\n\n Some(i - 1)\n\n }\n\n })?),\n\n ))\n\n }),\n\n eof,\n\n ),\n\n terminated(\n\n map_opt(\n\n tuple((take_till1(|c| c == '.' || c == ' '), char('.'), digit1)),\n\n |(name, _, s): (&str, char, &str)| -> Option<(Option<String>, Option<usize>)> {\n\n Some((\n\n Some(name.to_owned()),\n\n Some(s.parse::<usize>().ok().and_then(|i| {\n\n if i == 0 {\n\n None\n\n } else {\n\n Some(i - 1)\n","file_path":"src/serialization/command.rs","rank":68,"score":14.150449607104637},{"content":" }\n\n }\n\n }\n\n return Ok(());\n\n }\n\n\n\n /// Use the given substitution on this expression to create a new expression\n\n ///\n\n /// # Example\n\n /// ```\n\n /// use attomath::expression::{Expression, WholeSubstitution};\n\n ///\n\n /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// let expr = Expression::from_raw([-2, 0, 1]).unwrap();\n\n /// sub.insert(0, expr.to_slice());\n\n /// assert_eq!(*expr.substitute(&sub).to_slice().data(), &[-2, -2, 0, 1, 1]);\n\n /// ```\n\n pub fn substitute<S: Substitution>(&self, substitution: &S) -> Expression<Box<[Identifier]>> {\n\n let mut new_expr = Vec::with_capacity(self.data.borrow().len());\n\n for symb in self.data.borrow().iter() {\n","file_path":"src/expression.rs","rank":69,"score":13.68894952617311},{"content":"/// Statement {\n\n/// judgement: 0,\n\n/// expression: Expression::from_raw(vec![0].into_boxed_slice()).unwrap(),\n\n/// },\n\n/// Statement {\n\n/// judgement: 0,\n\n/// expression: Expression::from_raw(vec![-1, 0, 1].into_boxed_slice()).unwrap(),\n\n/// }\n\n/// ];\n\n/// let dvrs = vec![DVR::new(0, 1).unwrap()];\n\n/// let theorem = Theorem::new(conclusion, assumptions, dvrs);\n\n///\n\n/// let mut s = String::new();\n\n/// fmt.format_theorem(&mut s, &theorem);\n\n/// assert_eq!(s, \"a <> b, |- a, |- (a -> b) => |- b\");\n\n///\n\n/// let (remaining, theorem1) = fmt.parse_theorem(&s).unwrap();\n\n/// assert_eq!(remaining, \"\");\n\n/// assert_eq!(theorem1, theorem);\n\n/// ```\n","file_path":"src/serialization/formatter.rs","rank":70,"score":13.508671628076506},{"content":"use crate::{error::ProofError, types::*};\n\nuse std::{\n\n borrow::{Borrow, BorrowMut},\n\n cmp::Ordering,\n\n num::Wrapping,\n\n ops::RangeBounds,\n\n};\n\n\n\n/// A `Expression` is a binary tree with nodes called \"operators\" and leafs which called\n\n/// \"variables\".\n\n///\n\n/// The exception to this is the special leaf `Identifier::MIN` which is an operator\n\n/// and used as a \"terminator\" two allow for operators with arity 1 or less.\n\n///\n\n/// The expression is encoded by prefix orderinto a sequence of [`Identifier`]s which can be both\n\n/// variables and operators (see [`is_operator`]).\n\n#[derive(Clone, Eq, Ord, Debug, Copy)]\n\npub struct Expression<T: Borrow<[Identifier]>> {\n\n data: T,\n\n}\n","file_path":"src/expression.rs","rank":71,"score":13.062986177469384},{"content":" })\n\n })\n\n }\n\n}\n\n\n\n/// Substitutes variables by shifting them to the right by the given ammount\n\npub struct ShiftSubstitution {\n\n shift: Identifier,\n\n}\n\n\n\nimpl ShiftSubstitution {\n\n pub fn new(shift: Identifier) -> Self {\n\n if shift < 0 {\n\n panic!(\"shift must be nonnegative\");\n\n }\n\n ShiftSubstitution { shift }\n\n }\n\n}\n\n\n\nimpl Substitution for ShiftSubstitution {\n","file_path":"src/expression.rs","rank":72,"score":13.028188999243211},{"content":" self.format_variable(s, a);\n\n s.push_str(\" <> \");\n\n self.format_variable(s, b);\n\n }\n\n\n\n pub fn parse_dvr<'a>(&self, input: &'a str) -> IResult<&'a str, DVR, GreedyError<&'a str>> {\n\n let (input, a) = self.parse_variable(input)?;\n\n let (input, _) = tag(\" <> \")(input)?;\n\n let (input, b) = verify(|input| self.parse_variable(input), |b| *b != a)(input)?;\n\n Ok((input, DVR::new(a, b).unwrap()))\n\n }\n\n\n\n pub fn format_theorem(&self, s: &mut String, theorem: &Theorem) {\n\n let dvrs = theorem.dvrs();\n\n let assumptions = theorem.assumptions();\n\n if !dvrs.is_empty() || !assumptions.is_empty() {\n\n for (i, dvr) in dvrs.iter().enumerate() {\n\n self.format_dvr(s, dvr);\n\n if i != dvrs.len() - 1 || !assumptions.is_empty() {\n\n s.push_str(\", \");\n","file_path":"src/serialization/formatter.rs","rank":73,"score":12.872626375384922},{"content":"opr A 0\n\nopr B 0\n\nopr C 0\n\naxm { |- A }\n\naxm { |- B }: b\n\naxm { |- A, |- B => |- C }: abc\n\ncmb abc(1) <- b.1\n\ncmb $(1) <- b { |- C }: c\n\n\"#\n\n );\n\n\n\n let mut fmt1 = Formatter::new();\n\n let database1 = parse_database(&mut fmt1, &s).unwrap();\n\n assert_eq!(database1, database);\n\n assert_eq!(fmt1, fmt);\n\n }\n\n\n\n #[test]\n\n fn id() {\n\n let s = r#\"jdg wff\n","file_path":"src/serialization/command.rs","rank":74,"score":12.85327903180555},{"content":" fn from(e: DatabaseError) -> Self {\n\n Self::DatabaseError(e)\n\n }\n\n }\n\n\n\n fn serialize_database(fmt: &Formatter, database: &Database) -> String {\n\n let mut s = String::new();\n\n for command in Command::from_formatter(fmt).chain(Command::from_database(database)) {\n\n command.serialize(&mut s, fmt);\n\n s.push('\\n');\n\n }\n\n s\n\n }\n\n\n\n fn parse_database<'a>(\n\n fmt: &mut Formatter,\n\n input: &'a str,\n\n ) -> Result<Database, (&'a str, Error<'a>)> {\n\n let mut database = Database::new();\n\n for line in input.lines() {\n","file_path":"src/serialization/command.rs","rank":75,"score":12.784642114759794},{"content":"use std::fmt::Write;\n\n\n\nuse nom::{\n\n branch::alt,\n\n bytes::complete::{is_not, tag, take_till1, take_until},\n\n character::complete::{char, digit1},\n\n combinator::{all_consuming, eof, map, map_opt, map_parser, rest},\n\n error::context,\n\n sequence::{terminated, tuple},\n\n IResult,\n\n};\n\n\n\nuse crate::Theorem;\n\n\n\nuse super::{\n\n error::{or_fail, GreedyError},\n\n Database, DatabaseError, Formatter, Proof,\n\n};\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone)]\n","file_path":"src/serialization/command.rs","rank":76,"score":12.53793819634839},{"content":" input: &'a str,\n\n ) -> IResult<&'a str, Judgement, GreedyError<&'a str>> {\n\n let (input, judgement) = map_opt(is_not(\" \"), |s| {\n\n self.judgements\n\n .iter()\n\n .enumerate()\n\n .filter_map(|(i, j)| if s == j { Some(i) } else { None })\n\n .next()\n\n })(input)?;\n\n Ok((input, judgement as u8))\n\n }\n\n\n\n pub fn format_statement<T: Borrow<[Identifier]> + std::fmt::Debug>(\n\n &self,\n\n s: &mut String,\n\n statement: &Statement<T>,\n\n ) {\n\n self.format_judgement(s, statement.judgement);\n\n s.push(' ');\n\n self.format_expression(s, &statement.expression);\n","file_path":"src/serialization/formatter.rs","rank":77,"score":12.520164968063918},{"content":"\n\n pub(crate) fn substitute_variables(&mut self, var_map: &[Option<Identifier>]) {\n\n for symb in self.data.borrow_mut().iter_mut() {\n\n if !is_operator(*symb) {\n\n if let Some(sub) = var_map[*symb as usize] {\n\n *symb = sub;\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl<T: Borrow<[Identifier]> + std::fmt::Debug> Expression<T> {\n\n /// The internal encoding in prefix order\n\n pub fn data<'a>(&'a self) -> &'a T {\n\n &self.data\n\n }\n\n\n\n /// Borrow this expressions contents\n\n pub fn to_slice<'a>(&'a self) -> Expression<&'a [Identifier]> {\n","file_path":"src/expression.rs","rank":78,"score":12.457915085715614},{"content":"use crate::{\n\n error::ProofError,\n\n expression::{Expression, Substitution, WholeSubstitution},\n\n types::*,\n\n};\n\nuse std::borrow::Borrow;\n\n\n\n/// Type alias for a statement that owns its expression\n\npub type OwnedStatement = Statement<Box<[Identifier]>>;\n\n\n\n/// A a combination of a [`Judgement`] and an [`Expression`], for example _x0 -> x0 is provable_\n\n///\n\n/// The __judgement__ is given in form of an integer, but often represents some meaning, like _this\n\n/// expression is provable_ or _this expression is syntactically correct_.\n\n#[derive(Eq, Clone, PartialOrd, Ord, Debug)]\n\npub struct Statement<T: Borrow<[Identifier]>> {\n\n pub judgement: Judgement,\n\n pub expression: Expression<T>,\n\n}\n\n\n","file_path":"src/statement.rs","rank":79,"score":12.242983860111282},{"content":" )\n\n .unwrap(),\n\n };\n\n let b = Statement {\n\n judgement: 0,\n\n expression: Expression::from_raw(\n\n vec![-2, Identifier::MIN, Identifier::MIN].into_boxed_slice(),\n\n )\n\n .unwrap(),\n\n };\n\n let c = Statement {\n\n judgement: 0,\n\n expression: Expression::from_raw(\n\n vec![-3, Identifier::MIN, Identifier::MIN].into_boxed_slice(),\n\n )\n\n .unwrap(),\n\n };\n\n\n\n database\n\n .add_proof(Proof::Axiom(Theorem::new(a.clone(), vec![], vec![])))\n","file_path":"src/serialization/command.rs","rank":80,"score":12.205921183874596},{"content":" }\n\n\n\n pub fn format_expression<T: Borrow<[Identifier]> + std::fmt::Debug>(\n\n &self,\n\n s: &mut String,\n\n expression: &Expression<T>,\n\n ) {\n\n let id = expression.to_slice().data()[0];\n\n if id == Identifier::MIN {\n\n return;\n\n }\n\n if is_operator(id) {\n\n let left = expression.subexpression(1);\n\n let right = expression.subexpression(1 + left.data().len());\n\n self.format_operator(s, id, &left, &right);\n\n } else {\n\n self.format_variable(s, id)\n\n }\n\n }\n\n\n","file_path":"src/serialization/formatter.rs","rank":81,"score":12.000604520451981},{"content":" (|| {\n\n let command = Command::parse(&fmt, line)?;\n\n\n\n command.apply(fmt, &mut database)?;\n\n Ok(())\n\n })()\n\n .map_err(|e| (line, e))?;\n\n }\n\n Ok(database)\n\n }\n\n\n\n #[test]\n\n fn a_b_c() {\n\n use crate::{expression::Expression, statement::Statement};\n\n let mut database = Database::new();\n\n\n\n let a = Statement {\n\n judgement: 0,\n\n expression: Expression::from_raw(\n\n vec![-1, Identifier::MIN, Identifier::MIN].into_boxed_slice(),\n","file_path":"src/serialization/command.rs","rank":82,"score":11.96670789029956},{"content":" pub fn parse_expression<'a>(\n\n &self,\n\n input: &'a str,\n\n ) -> IResult<&'a str, Expression<Box<[Identifier]>>, GreedyError<&'a str>> {\n\n // TODO: remove unwrap\n\n alt((\n\n map(\n\n |input| self.parse_variable(input),\n\n |v| Expression::from_raw(vec![v].into_boxed_slice()).unwrap(),\n\n ),\n\n |input| self.parse_operator(input),\n\n ))(input)\n\n }\n\n\n\n pub fn format_judgement(&self, s: &mut String, judgement: Judgement) {\n\n s.push_str(&self.judgements[judgement as usize]);\n\n }\n\n\n\n pub fn parse_judgement<'a>(\n\n &self,\n","file_path":"src/serialization/formatter.rs","rank":83,"score":11.75633870122122},{"content":" let (input, _) = tag(\"smp \")(input)?;\n\n or_fail(|input| {\n\n let (input, id) = map_parser(is_not(\" \"), Self::parse_id)(input)?;\n\n let (input, _) = tag(\" (\")(input)?;\n\n let (input, a) = fmt.parse_variable(input)?;\n\n let (input, _) = tag(\" ~ \")(input)?;\n\n let (input, b) = fmt.parse_variable(input)?;\n\n let (input, _) = tag(\")\")(input)?;\n\n let (input, (theorem, name)) = alt((\n\n map(eof, |_| (None, None)),\n\n map(\n\n tuple((\n\n tag(\" { \"),\n\n map_parser(take_until(\" }\"), |input| fmt.parse_theorem(input)),\n\n tag(\" }\"),\n\n alt((\n\n map(eof, |_| None),\n\n map(tuple((tag(\": \"), rest)), |(_, name): (&str, &str)| {\n\n Some(name.to_owned())\n\n }),\n","file_path":"src/serialization/command.rs","rank":84,"score":11.617463249211891},{"content":" ///\n\n /// let a = Expression::from_raw([-2, 0, -2, 1, 0]).unwrap();\n\n /// let b = Expression::from_raw([-2, 0, 1]).unwrap();\n\n /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// let result = a.unify(&b, &mut sub); // (x0 ~> x0, x1 ~> (x1 -> x0))\n\n /// assert_eq!(result, Ok(()));\n\n /// assert_eq!(b.substitute(&sub), a);\n\n ///\n\n /// let a = Expression::from_raw([-2, 0, -2, 1, 0]).unwrap();\n\n /// let b = Expression::from_raw([-2, 0, 0]).unwrap();\n\n /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// let result = a.unify(&b, &mut sub); // (x0 ~> x0, x0 ~> (x1 -> x0))\n\n /// assert_eq!(result, Err(ProofError::VariableMismatch(\n\n /// 0,\n\n /// vec![0].into_boxed_slice(),\n\n /// vec![-2, 1, 0].into_boxed_slice(),\n\n /// )));\n\n ///\n\n /// let a = Expression::from_raw([-3, 0, -2, 1, 0]).unwrap();\n\n /// let b = Expression::from_raw([-2, 0, 1]).unwrap();\n","file_path":"src/expression.rs","rank":85,"score":11.564432344534593},{"content":" /// use attomath::DVR;\n\n /// use attomath::expression::{Expression, WholeSubstitution};\n\n /// use attomath::error::ProofError;\n\n ///\n\n /// let dvr = DVR::new(0, 1).unwrap();\n\n /// let mut sub = WholeSubstitution::with_capacity(2);\n\n /// let expr0 = Expression::from_raw(vec![-2, 0, 1]).unwrap();\n\n /// sub.insert(0, expr0.to_slice());\n\n /// let expr1 = Expression::from_raw(vec![2]).unwrap();\n\n /// sub.insert(1, expr1.to_slice());\n\n ///\n\n /// let mut new_dvrs = dvr.substitute(&sub).collect::<Result<Vec<_>, _>>();\n\n /// new_dvrs = new_dvrs.map(|mut ds| {\n\n /// ds.sort();\n\n /// ds.dedup();\n\n /// ds\n\n /// });\n\n ///\n\n /// let mut expected = vec![DVR::new(0, 2).unwrap(), DVR::new(1, 2).unwrap()];\n\n /// expected.sort();\n","file_path":"src/dvr.rs","rank":86,"score":11.524420990360426},{"content":"impl<T: Borrow<[Identifier]>, S: Borrow<[Identifier]>> PartialEq<Statement<S>> for Statement<T> {\n\n fn eq(&self, other: &Statement<S>) -> bool {\n\n self.judgement == other.judgement && self.expression == other.expression\n\n }\n\n}\n\n\n\nimpl<T: Borrow<[Identifier]> + std::fmt::Debug> Statement<T> {\n\n /// Convenience function for unifying the expressions of two judgements (see\n\n /// [`Expression::unify`])\n\n ///\n\n /// # Errors\n\n /// * `JudgementMismatch` - if `self.judgement != other.judgement`\n\n /// * `VariableMismatch` or `OperatorMismatch` - if `self.expression.unify(other.expression)`\n\n /// fails\n\n ///\n\n /// # Example\n\n /// ```\n\n /// use attomath::Statement;\n\n /// use attomath::expression::{Expression, WholeSubstitution};\n\n /// use attomath::error::ProofError;\n","file_path":"src/statement.rs","rank":87,"score":11.453703735291695},{"content":" use Either::*;\n\n match self {\n\n Left(expr) => expr.borrow(),\n\n Right(expr) => expr.borrow(),\n\n }\n\n }\n\n}\n\n\n\nimpl<S: Substitution, T: Substitution> Substitution for ChainSubstitution<S, T> {\n\n type T = Either<S::T, T::T>;\n\n\n\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<Self::T>> {\n\n self.first\n\n .substitution_opt(id)\n\n .map(|s| Expression {\n\n data: Either::Left(s.data),\n\n })\n\n .or_else(|| {\n\n self.then.substitution_opt(id).map(|s| Expression {\n\n data: Either::Right(s.data),\n","file_path":"src/expression.rs","rank":88,"score":11.414166383867926},{"content":"}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::num::Wrapping;\n\n\n\n use quickcheck::Arbitrary;\n\n\n\n use super::*;\n\n\n\n impl Arbitrary for Expression<Box<[Identifier]>> {\n\n fn arbitrary(g: &mut quickcheck::Gen) -> Self {\n\n loop {\n\n let data = Vec::<Identifier>::arbitrary(g).into_boxed_slice();\n\n if let Some(subexpression) = Expression::subexpression_check(&data, 0) {\n\n return Expression {\n\n data: subexpression.data.to_owned().into_boxed_slice(),\n\n };\n\n }\n\n }\n","file_path":"src/expression.rs","rank":89,"score":11.413760661154265},{"content":" Expression {\n\n data: self.data.borrow(),\n\n }\n\n }\n\n\n\n /// Create a expression from its prefix order encoding. This checks if the given sequence\n\n /// encodes a binary tree and returns `None` if it does not.\n\n pub fn from_raw(expr: T) -> Option<Self> {\n\n if Self::check(&expr) {\n\n Some(Expression { data: expr })\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n /// Convencience function to iterate over this expressions variables. May contain duplicates.\n\n pub fn variables<'a>(&'a self) -> impl Iterator<Item = Identifier> + 'a {\n\n self.data\n\n .borrow()\n\n .iter()\n","file_path":"src/expression.rs","rank":90,"score":11.338666595262207},{"content":" }\n\n }\n\n\n\n quickcheck! {\n\n fn unify_substitute(a: Expression<Box<[Identifier]>>, b: Expression<Box<[Identifier]>>) -> bool {\n\n let max_var = b.variables().max().unwrap_or(-1);\n\n let mut substitution =\n\n WholeSubstitution::with_capacity((Wrapping(max_var as usize) + Wrapping(1)).0);\n\n match a.unify(&b, &mut substitution) {\n\n Ok(()) => b.substitute(&substitution) == a,\n\n Err(_) => true\n\n }\n\n }\n\n\n\n fn from_raw_single_variable(a: Identifier) -> bool {\n\n if is_operator(a) {\n\n return true;\n\n }\n\n Expression::from_raw([a]).is_some()\n\n }\n\n }\n\n}\n","file_path":"src/expression.rs","rank":91,"score":11.3356105151545},{"content":" Some(VariableSubstitution(variables))\n\n }\n\n}\n\n\n\nimpl<S: Borrow<[Option<Identifier>]>> Substitution for VariableSubstitution<S> {\n\n type T = [Identifier; 1];\n\n\n\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<[Identifier; 1]>> {\n\n self.0.borrow()[id as usize].map(|v| Expression { data: [v] })\n\n }\n\n}\n\n\n","file_path":"src/expression.rs","rank":92,"score":11.256168080772435},{"content":" }\n\n\n\n pub fn parse_arity<'a>(\n\n &self,\n\n arity: u8,\n\n input: &'a str,\n\n ) -> IResult<&'a str, Expression<Box<[Identifier]>>, GreedyError<&'a str>> {\n\n if arity == 0 {\n\n let (input, o) = map_opt(is_not(\" ),\"), |s| {\n\n self.operators\n\n .iter()\n\n .enumerate()\n\n .filter_map(|(i, (o, a))| if s == o && *a == 0 { Some(i) } else { None })\n\n .next()\n\n })(input)?;\n\n // TODO: remove unwrap\n\n Ok((\n\n input,\n\n Expression::from_raw(\n\n vec![-(o as Identifier) - 1, Identifier::MIN, Identifier::MIN]\n","file_path":"src/serialization/formatter.rs","rank":93,"score":11.055249210985252},{"content":" pub(crate) fn standardize_range<R: RangeBounds<Identifier>>(\n\n &mut self,\n\n var_map: &mut [Option<Identifier>],\n\n next_var: &mut Identifier,\n\n range: R,\n\n ) {\n\n for symb in self.data.borrow_mut().iter_mut() {\n\n if !is_operator(*symb) && range.contains(symb) {\n\n let var = var_map[*symb as usize].unwrap_or_else(|| {\n\n let var = *next_var;\n\n var_map[*symb as usize] = Some(var);\n\n *next_var += 1;\n\n var\n\n });\n\n if range.contains(&var) {\n\n *symb = var;\n\n }\n\n }\n\n }\n\n }\n","file_path":"src/expression.rs","rank":94,"score":10.718975466138811},{"content":" }\n\n\n\n pub fn parse_statement<'a>(\n\n &self,\n\n input: &'a str,\n\n ) -> IResult<&'a str, OwnedStatement, GreedyError<&'a str>> {\n\n let (input, judgement) = self.parse_judgement(input)?;\n\n let (input, _) = char(' ')(input)?;\n\n let (input, expression) = self.parse_expression(input)?;\n\n Ok((\n\n input,\n\n Statement {\n\n judgement,\n\n expression,\n\n },\n\n ))\n\n }\n\n\n\n pub fn format_dvr(&self, s: &mut String, dvr: &DVR) {\n\n let (a, b) = dvr.variables();\n","file_path":"src/serialization/formatter.rs","rank":95,"score":10.46962375979684},{"content":" } else if is_operator(b) {\n\n Err(ProofError::DVRError(b))\n\n } else if a < b {\n\n Ok(DVR(a, b))\n\n } else if a > b {\n\n Ok(DVR(b, a))\n\n } else {\n\n Err(ProofError::DVRError(a))\n\n }\n\n }\n\n\n\n /// Uses the given `Substitution` to create new `DVR`s for each pair of variables in the new\n\n /// expressions for `self.variables()`.\n\n ///\n\n /// # Errors\n\n /// The `Iterator` will produce a `DVRError` if the substitutions for this `DVR`s' variables\n\n /// contains common variables\n\n ///\n\n /// # Example\n\n /// ```\n","file_path":"src/dvr.rs","rank":96,"score":10.187781094881979},{"content":"use crate::types::*;\n\n\n\n/// An error which is produced when trying to proof something incorrect\n\n#[derive(Debug, PartialEq, Eq)]\n\npub enum ProofError {\n\n /// Error produced when trying to unify expressions with different operators (see\n\n /// [`Expression::unify`](../expression/struct.Expression.html#method.unify)). Contains the\n\n /// identifiers of the mismatched operators.\n\n OperatorMismatch(Identifier, Identifier),\n\n /// Error produced when trying to unify expressions where one variable would have to be\n\n /// substituted by different subexpressions (see\n\n /// [`Expression::unify`](../expression/struct.Expression.html#method.unify)). Contains the\n\n /// identifier for the variable and the mismatched subexpressions.\n\n VariableMismatch(Identifier, Box<[Identifier]>, Box<[Identifier]>),\n\n /// Error produced when trying to unify statements with different judgements (see\n\n /// [`Statement::unify`](../statement/struct.Statement.html#method.unify)). Contains the\n\n /// mismatched judgements.\n\n JudgementMismatch(Judgement, Judgement),\n\n /// Error produced when trying to create a theorem with conflicting dvrs (see\n\n /// [`DVR`](../dvr/struct.DVR.html)).\n\n DVRError(Identifier),\n\n}\n","file_path":"src/error.rs","rank":97,"score":10.16792745249586},{"content":" }\n\n }\n\n Command::Judgement(judgement) => {\n\n fmt.add_judgement(judgement);\n\n }\n\n Command::Operator(operator, arity) => {\n\n fmt.add_operator(operator, arity);\n\n }\n\n }\n\n Ok(())\n\n }\n\n\n\n pub fn parse<'a>(\n\n fmt: &Formatter,\n\n input: &'a str,\n\n ) -> Result<Self, nom::Err<GreedyError<&'a str>>> {\n\n let (_, command) = or_fail(all_consuming(alt((\n\n context(\n\n \"proof\",\n\n alt((\n","file_path":"src/serialization/command.rs","rank":98,"score":10.04767937919993},{"content":" context(\"conclusion\", |input| self.parse_statement(input))(input)?;\n\n let (input, _) = eof(input)?;\n\n let mut dvrs = Vec::new();\n\n let mut assumptions = Vec::new();\n\n for (dvr, assumption) in dvrs_and_assumptions {\n\n if let Some(dvr) = dvr {\n\n dvrs.push(dvr);\n\n }\n\n if let Some(assumption) = assumption {\n\n assumptions.push(assumption);\n\n }\n\n }\n\n Ok((input, Theorem::new(conclusion, assumptions, dvrs)))\n\n },\n\n |input| {\n\n let (input, conclusion) =\n\n context(\"conclusion\", |input| self.parse_statement(input))(input)?;\n\n let (input, _) = eof(input)?;\n\n Ok((input, Theorem::new(conclusion, vec![], vec![])))\n\n },\n\n ))(input)\n\n }\n\n}\n","file_path":"src/serialization/formatter.rs","rank":99,"score":10.005722080770713}],"string":"[\n {\n \"content\": \"pub fn or_fail<I, O, E: ParseError<I>, F>(mut f: F) -> impl FnMut(I) -> IResult<I, O, E>\\n\\nwhere\\n\\n F: Parser<I, O, E>,\\n\\n{\\n\\n move |input| {\\n\\n f.parse(input).map_err(|error| match error {\\n\\n nom::Err::Error(e) => nom::Err::Failure(e),\\n\\n e => e,\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/serialization/error.rs\",\n \"rank\": 0,\n \"score\": 132622.50170997303\n },\n {\n \"content\": \"/// Tests whether the given identifier is an operator.\\n\\n///\\n\\n/// Operators occupy the range `(Identifier::MIN ..= -1)`.\\n\\n/// The special value `Identifier::MIN` is also an operator.\\n\\n///\\n\\n/// # Example\\n\\n/// ```\\n\\n/// use attomath::{expression::is_operator, Identifier};\\n\\n///\\n\\n/// assert!(is_operator(-2));\\n\\n/// assert!(is_operator(Identifier::MIN));\\n\\n/// assert!(!is_operator(0));\\n\\n/// ```\\n\\npub fn is_operator(x: Identifier) -> bool {\\n\\n x < 0\\n\\n}\\n\\n\\n\\n/// A substion to combine two other substitutions.\\n\\n///\\n\\n/// Tries to use `first` first and uses `then` if the variable did not get substituted by `first`.\\n\\npub struct ChainSubstitution<S: Substitution, T: Substitution> {\\n\\n pub first: S,\\n\\n pub then: T,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum Either<S, T> {\\n\\n Left(S),\\n\\n Right(T),\\n\\n}\\n\\n\\n\\nimpl<S: Borrow<[Identifier]>, T: Borrow<[Identifier]>> Borrow<[Identifier]> for Either<S, T> {\\n\\n fn borrow(&self) -> &[Identifier] {\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 1,\n \"score\": 72440.53308190452\n },\n {\n \"content\": \"struct Permutations<'a, T> {\\n\\n sequence: &'a mut [T],\\n\\n counters: Vec<usize>,\\n\\n depth: usize,\\n\\n}\\n\\n\\n\\nimpl<'a, T> Permutations<'a, T> {\\n\\n fn new(sequence: &'a mut [T]) -> Self {\\n\\n let length = sequence.len();\\n\\n Permutations {\\n\\n sequence,\\n\\n counters: vec![0; length],\\n\\n depth: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n fn next(&mut self) -> Option<&mut [T]> {\\n\\n if self.depth >= self.sequence.len() {\\n\\n return None;\\n\\n }\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 2,\n \"score\": 53321.55939320048\n },\n {\n \"content\": \"fn main() {\\n\\n let filename = std::env::args().nth(1).unwrap();\\n\\n let mut fmt = Formatter::new();\\n\\n let mut database = Database::new();\\n\\n\\n\\n let file = File::open(filename).unwrap();\\n\\n for (line_number, line) in BufReader::new(file).lines().enumerate() {\\n\\n let line = line.unwrap();\\n\\n let command = match Command::parse(&fmt, &line) {\\n\\n Ok(command) => command,\\n\\n Err(err) => {\\n\\n eprintln!(\\n\\n \\\"Syntax error in line {}: {:?}\\\\n\\\\t{}\\\",\\n\\n line_number, err, line\\n\\n );\\n\\n return;\\n\\n }\\n\\n };\\n\\n match command.clone().apply(&mut fmt, &mut database) {\\n\\n Ok(_) => (),\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 3,\n \"score\": 36194.49992289758\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum GreedyErrorKind {\\n\\n Context(&'static str),\\n\\n Nom(ErrorKind),\\n\\n Char(char),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/serialization/error.rs\",\n \"rank\": 4,\n \"score\": 32354.361956467183\n },\n {\n \"content\": \"/// A `Substitution` maps variable ids to expressions (represented by a sequence of identifiers).\\n\\n///\\n\\n/// This is intented to be used together with [`Expression`]s.\\n\\npub trait Substitution {\\n\\n type T: Borrow<[Identifier]> + std::fmt::Debug;\\n\\n\\n\\n /// Get the stored substitution for the variable with identifier `id`. Or `None` if the\\n\\n /// variable should not be replaced.\\n\\n ///\\n\\n /// # Panics\\n\\n /// This may panic if `id` is not in the range of the particular substitution.\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\\n /// use attomath::expression::{Substitution, WholeSubstitution, Expression};\\n\\n ///\\n\\n /// let expr = Expression::from_raw([-2, 0, 1]).unwrap();\\n\\n /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// sub.insert(0, expr.to_slice());\\n\\n /// assert_eq!(sub.substitution_opt(0), Some(expr.to_slice()));\\n\\n /// assert_eq!(sub.substitution_opt(1), None);\\n\\n /// ```\\n\\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<Self::T>>;\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 5,\n \"score\": 32021.073007318766\n },\n {\n \"content\": \"pub trait Length {\\n\\n fn length(&self) -> usize;\\n\\n}\\n\\n\\n\\nimpl Length for &str {\\n\\n fn length(&self) -> usize {\\n\\n self.len()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for GreedyError<&str> {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n for (input, error) in self.0.iter() {\\n\\n writeln!(f, \\\"{:?} {}\\\", error, &input[0..20])?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I> ParseError<I> for GreedyError<I>\\n\",\n \"file_path\": \"src/serialization/error.rs\",\n \"rank\": 6,\n \"score\": 30627.413785086275\n },\n {\n \"content\": \"/// When using this struct it is guaranteed that only valid theorems can be constructed (using\\n\\n/// [`Theorem::substitute`], [`Theorem::combine`] and [`Theorem::standardize`]) provided that only valid theorems (or axioms)\\n\\n/// are constructed using [`Theorem::new`].\\n\\n#[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Debug)]\\n\\npub struct Theorem {\\n\\n conclusion: OwnedStatement,\\n\\n assumptions: Vec<OwnedStatement>,\\n\\n dvrs: Vec<DVR>,\\n\\n}\\n\\n\\n\\nimpl Theorem {\\n\\n /// Returns this theorems' conclusion\\n\\n pub fn conclusion(&self) -> &OwnedStatement {\\n\\n &self.conclusion\\n\\n }\\n\\n\\n\\n /// Returns this theorems' assumptions\\n\\n pub fn assumptions(&self) -> &[OwnedStatement] {\\n\\n &self.assumptions\\n\\n }\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 7,\n \"score\": 25807.964127875308\n },\n {\n \"content\": \" pub fn combine(&self, other: &Theorem, index: usize) -> Result<Self, ProofError> {\\n\\n let max_var = self.max_var();\\n\\n let mut substitution =\\n\\n WholeSubstitution::with_capacity((Wrapping(max_var as usize) + Wrapping(1)).0);\\n\\n other\\n\\n .conclusion\\n\\n .unify(&self.assumptions[index], &mut substitution)?;\\n\\n let shift = other.max_var() + 1;\\n\\n let shift_sub = ShiftSubstitution::new(shift);\\n\\n let substitution = ChainSubstitution {\\n\\n first: substitution,\\n\\n then: shift_sub,\\n\\n };\\n\\n let mut t = self.substitute_skip_assumption(&substitution, Some(index))?;\\n\\n t.assumptions.extend_from_slice(&other.assumptions);\\n\\n t.assumptions.shrink_to_fit();\\n\\n t.dvrs.extend_from_slice(&other.dvrs);\\n\\n t.dvrs.shrink_to_fit();\\n\\n Ok(t)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 8,\n \"score\": 25807.182303713776\n },\n {\n \"content\": \" .max()\\n\\n .unwrap_or(-1)\\n\\n }\\n\\n\\n\\n /// Uses the given substitution on this theorem's assumptions, dvrs and conclusion to create a\\n\\n /// new theorem. (see [`Statement::substitute`][crate::Statement::substitute], [`DVR::substitute`])\\n\\n ///\\n\\n /// # Errors\\n\\n /// This method can return a `DVRError` if the substitution violates one of this theorem's\\n\\n /// `DVR`s.\\n\\n ///\\n\\n pub fn substitute<S: Substitution>(&self, substitution: &S) -> Result<Self, ProofError> {\\n\\n self.substitute_skip_assumption(substitution, None)\\n\\n }\\n\\n\\n\\n fn substitute_skip_assumption<S: Substitution>(\\n\\n &self,\\n\\n substitution: &S,\\n\\n skip_assumption: Option<usize>,\\n\\n ) -> Result<Self, ProofError> {\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 9,\n \"score\": 25806.736866691776\n },\n {\n \"content\": \" // part of the conclusion. But these are now numbered 0 .. next_var and do not have to be\\n\\n // changed any longer.\\n\\n for (i, v) in var_map.iter_mut().enumerate() {\\n\\n *v = if i < next_var as usize {\\n\\n Some(i as Identifier)\\n\\n } else {\\n\\n None\\n\\n };\\n\\n }\\n\\n // var_maps holds the current candidates for the variable substitution that results in the\\n\\n // lowest lexicographic ordering\\n\\n let mut var_maps = vec![var_map];\\n\\n\\n\\n for assumptions in indexed_assumptions\\n\\n .group_by_mut(|(_, i), (_, j)| normalized_assumptions[*i] == normalized_assumptions[*j])\\n\\n {\\n\\n let mut next_var1 = 0;\\n\\n let mut assumptions_min: Option<Vec<(OwnedStatement, usize)>> = None;\\n\\n\\n\\n // for each new group and each candidate in var_maps try all permutation of \\\"new\\\"\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 10,\n \"score\": 25804.19555461024\n },\n {\n \"content\": \"\\n\\n /// Returns this theorems' `DVR`s\\n\\n pub fn dvrs(&self) -> &[DVR] {\\n\\n &self.dvrs\\n\\n }\\n\\n\\n\\n /// Create a new `Theorem` containig the given assumptions, `DVR`s and conclusion\\n\\n ///\\n\\n /// This should only be used for axioms and theorems that are already proven.\\n\\n pub fn new(\\n\\n conclusion: OwnedStatement,\\n\\n assumptions: Vec<OwnedStatement>,\\n\\n dvrs: Vec<DVR>,\\n\\n ) -> Self {\\n\\n Theorem {\\n\\n conclusion,\\n\\n assumptions,\\n\\n dvrs,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 11,\n \"score\": 25803.959981350872\n },\n {\n \"content\": \" .unwrap();\\n\\n }\\n\\n\\n\\n self.dvrs.sort_unstable();\\n\\n self.dvrs.dedup();\\n\\n }\\n\\n\\n\\n /// Returns the variable with the biggest identifier occuring in this theorem. This can be used\\n\\n /// together with [`WholeSubstitution::with_capacity`].\\n\\n pub fn max_var(&self) -> Identifier {\\n\\n self.conclusion\\n\\n .expression\\n\\n .variables()\\n\\n .chain(\\n\\n self.assumptions\\n\\n .iter()\\n\\n .map(|st| st.expression.variables())\\n\\n .flatten(),\\n\\n )\\n\\n .filter(|symb| !is_operator(*symb))\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 12,\n \"score\": 25799.602605229215\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn permutations() {\\n\\n let mut arr = [0, 1, 2, 3];\\n\\n let mut perm = Permutations::new(&mut arr);\\n\\n let mut counter = 0;\\n\\n while let Some(_) = perm.next() {\\n\\n counter += 1;\\n\\n }\\n\\n assert_eq!(counter, 24);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 13,\n \"score\": 25799.5389285385\n },\n {\n \"content\": \" Ok(Theorem {\\n\\n conclusion,\\n\\n assumptions,\\n\\n dvrs,\\n\\n })\\n\\n }\\n\\n\\n\\n /// Creates a new `Theorem` by applying `other` to this theorem's assumption with index `index`\\n\\n ///\\n\\n /// # Panics\\n\\n /// This may panic if `index > self.assumptions().len`\\n\\n ///\\n\\n /// # Errors\\n\\n /// This can product the following errors:\\n\\n /// * `OperatorMismatch`, `VariableMismatch` or `JudgementMismatch` - if the conclusion of\\n\\n /// `other` cannot be unified with the specified assumption (see\\n\\n /// [`Statement::unify`][crate::Statement::unify])\\n\\n /// * `DVRError`- if the substitution needed to transform the conclusion of `other` into the\\n\\n /// specified assumption violates one of this theorems' `DVR`s\\n\\n ///\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 14,\n \"score\": 25798.56998350813\n },\n {\n \"content\": \"\\n\\n /// Turns this theorem into its standard representation, numbering variables in the order of\\n\\n /// their apperance and sorting the assumptions and dvrs (see\\n\\n /// [`Expression::standardize`][crate::Expression::standardize]).\\n\\n ///\\n\\n /// It holds, that applying standardize twice is the same as applying it once. Two theorems are\\n\\n /// logically \\\"equal\\\", that is they can be constructed from each other by reordering\\n\\n /// assumptions and substituting variables by mutally distinct variables, if and only if they\\n\\n /// are the same after calling standardize on them.\\n\\n pub fn standardize(&mut self) {\\n\\n let max_var = self.max_var();\\n\\n let mut var_map = vec![None; (Wrapping(max_var as usize) + Wrapping(1)).0];\\n\\n let mut next_var = 0;\\n\\n\\n\\n // first number the variables of the conclusion in order\\n\\n self.conclusion\\n\\n .expression\\n\\n .standardize_range(&mut var_map, &mut next_var, ..);\\n\\n\\n\\n // remove duplicate assumptions\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 15,\n \"score\": 25798.30366091356\n },\n {\n \"content\": \" // variables, i.e. variables that have are not yet determined in the candidates.\\n\\n // Save the best permutations in var_maps1 as the new candidates for the next iteration\\n\\n let mut var_maps1 = Vec::new();\\n\\n for var_map in var_maps.iter_mut() {\\n\\n let mut perm = assumptions.iter().cloned().collect::<Vec<_>>();\\n\\n for (assumption, _) in perm.iter_mut() {\\n\\n assumption.expression.substitute_variables(&var_map);\\n\\n }\\n\\n let mut perm = Permutations::new(&mut perm);\\n\\n while let Some(permutation) = perm.next() {\\n\\n let mut var_map1 = var_map.clone();\\n\\n next_var1 = next_var;\\n\\n\\n\\n for (assumption, _) in permutation.iter_mut() {\\n\\n assumption.expression.standardize_range(\\n\\n &mut var_map1,\\n\\n &mut next_var1,\\n\\n next_var..,\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 16,\n \"score\": 25797.466201369527\n },\n {\n \"content\": \" })\\n\\n .collect::<Vec<_>>();\\n\\n // sort the assumptions by their normalized version. Assumptions with the same\\n\\n // normalization are now grouped together\\n\\n indexed_assumptions.sort_unstable_by_key(|(_, index)| &normalized_assumptions[*index]);\\n\\n\\n\\n // The rest of this function is to find for each group of the same normalization the\\n\\n // variable substitution (some variables could be fixed by previous groups) that results\\n\\n // in the smallest lexicographic ordering of the group after its elements are sorted\\n\\n\\n\\n // first standardize all assumptions in their new order, so for each group the \\\"free\\\"\\n\\n // variables are going to be substituted by some permutation of themselves\\n\\n let mut temp_next_var = next_var;\\n\\n for (assumption, _) in indexed_assumptions.iter_mut() {\\n\\n assumption\\n\\n .expression\\n\\n .standardize_range(&mut var_map, &mut temp_next_var, ..);\\n\\n }\\n\\n\\n\\n // we have to forget the variable map we just computed, but not the variables that are also\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 17,\n \"score\": 25797.416062888577\n },\n {\n \"content\": \" // TODO: maybe move this into combine / simplify\\n\\n self.assumptions.sort_unstable();\\n\\n self.assumptions.dedup();\\n\\n\\n\\n // calculate a \\\"normalized\\\" version for each assumption. That is, number each single\\n\\n // theorems variables in order\\n\\n let mut indexed_assumptions = self\\n\\n .assumptions\\n\\n .iter()\\n\\n .cloned()\\n\\n .enumerate()\\n\\n .map(|(a, b)| (b, a))\\n\\n .collect::<Vec<_>>();\\n\\n let normalized_assumptions = self\\n\\n .assumptions\\n\\n .drain(..)\\n\\n .map(|assumption| {\\n\\n let mut normalized = assumption;\\n\\n normalized.expression.standardize();\\n\\n normalized\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 18,\n \"score\": 25797.294509949694\n },\n {\n \"content\": \" }\\n\\n }\\n\\n var_maps = var_maps1;\\n\\n next_var = next_var1;\\n\\n // save the minimal substitution in indexed_assumptions. This way we do not have to\\n\\n // substitute again with some candidate (*)\\n\\n assumptions.swap_with_slice(assumptions_min.unwrap().as_mut_slice());\\n\\n }\\n\\n\\n\\n // just use the saved assumptions (*) this is equivalent to every substitution candidate\\n\\n self.assumptions\\n\\n .extend(indexed_assumptions.into_iter().map(|(a, _)| a));\\n\\n\\n\\n // every variable in a DVR has to appear in some assumption or the conclusion. Just order\\n\\n // the DVRs accordingly.\\n\\n for dvr in self.dvrs.iter_mut() {\\n\\n *dvr = dvr\\n\\n .substitute(&VariableSubstitution::new(var_maps[0].as_slice()).unwrap())\\n\\n .next()\\n\\n .unwrap()\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 19,\n \"score\": 25796.673782635182\n },\n {\n \"content\": \"use std::{cmp::Ordering, num::Wrapping};\\n\\n\\n\\nuse crate::{\\n\\n dvr::DVR,\\n\\n error::ProofError,\\n\\n expression::{\\n\\n is_operator, ChainSubstitution, ShiftSubstitution, Substitution, VariableSubstitution,\\n\\n WholeSubstitution,\\n\\n },\\n\\n statement::OwnedStatement,\\n\\n types::*,\\n\\n};\\n\\n\\n\\n/// A theorem consisting of zero or more [`DVR`] or __assumptions__\\n\\n/// and a __conclusion__\\n\\n///\\n\\n/// A theorem could represent something like _if x0 is provable and (x0 -> x1) is provable then b\\n\\n/// is provable_. In this example the assumptions would be _x0_ and _x0 -> x1_ and the conclusion\\n\\n/// would be _x1_.\\n\\n///\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 20,\n \"score\": 25795.672388991847\n },\n {\n \"content\": \" match assumptions_min\\n\\n .as_deref_mut()\\n\\n .map(|a_min| {\\n\\n permutation\\n\\n .iter()\\n\\n .map(|(a, _)| a)\\n\\n .cmp(a_min.iter().map(|(a, _)| a))\\n\\n })\\n\\n .unwrap_or(Ordering::Less)\\n\\n {\\n\\n Ordering::Equal => {\\n\\n var_maps1.push(var_map1);\\n\\n }\\n\\n Ordering::Less => {\\n\\n var_maps1.clear();\\n\\n var_maps1.push(var_map1);\\n\\n assumptions_min = Some(permutation.iter().cloned().collect());\\n\\n }\\n\\n Ordering::Greater => {}\\n\\n }\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 21,\n \"score\": 25795.061189617245\n },\n {\n \"content\": \" if self.depth != 0 {\\n\\n while self.counters[self.depth] >= self.depth {\\n\\n self.counters[self.depth] = 0;\\n\\n self.depth += 1;\\n\\n if self.depth >= self.sequence.len() {\\n\\n return None;\\n\\n }\\n\\n }\\n\\n if self.depth % 2 == 0 {\\n\\n self.sequence.swap(0, self.depth);\\n\\n } else {\\n\\n self.sequence.swap(self.counters[self.depth], self.depth);\\n\\n }\\n\\n self.counters[self.depth] += 1;\\n\\n self.depth = 1;\\n\\n Some(&mut self.sequence)\\n\\n } else {\\n\\n self.depth = 1;\\n\\n Some(&mut self.sequence)\\n\\n }\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 22,\n \"score\": 25794.029647855117\n },\n {\n \"content\": \" let conclusion = self.conclusion.substitute(substitution);\\n\\n let assumptions: Vec<OwnedStatement> = self\\n\\n .assumptions\\n\\n .iter()\\n\\n .enumerate()\\n\\n .filter_map(|(i, a)| {\\n\\n if Some(i) == skip_assumption {\\n\\n None\\n\\n } else {\\n\\n Some(a)\\n\\n }\\n\\n })\\n\\n .map(|a| a.substitute(substitution))\\n\\n .collect();\\n\\n let dvrs = self\\n\\n .dvrs\\n\\n .iter()\\n\\n .map(|dvr| dvr.substitute(substitution))\\n\\n .flatten()\\n\\n .collect::<Result<Vec<_>, _>>()?;\\n\",\n \"file_path\": \"src/theorem.rs\",\n \"rank\": 23,\n \"score\": 25793.219868834978\n },\n {\n \"content\": \"pub enum Command {\\n\\n Proof(\\n\\n Proof<(Option<String>, Option<usize>)>,\\n\\n Option<Theorem>,\\n\\n Option<String>,\\n\\n ),\\n\\n Judgement(String),\\n\\n Operator(String, u8),\\n\\n}\\n\\n\\n\\nimpl Command {\\n\\n pub fn apply(self, fmt: &mut Formatter, database: &mut Database) -> Result<(), DatabaseError> {\\n\\n match self {\\n\\n Command::Proof(proof, theorem, name) => {\\n\\n let _theorem = database.add_proof(proof)?;\\n\\n if let Some(name) = name {\\n\\n database.add_name(name)?;\\n\\n }\\n\\n if let Some(theorem) = theorem {\\n\\n database.substitute(theorem)?;\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 28,\n \"score\": 25.61028773529167\n },\n {\n \"content\": \" }\\n\\n DatabaseError::ProofError(err) => {\\n\\n let (id_a, id_b, index) = match command {\\n\\n Command::Proof(Proof::Combine(id_a, id_b, index), _, _) => {\\n\\n (id_a, id_b, index)\\n\\n }\\n\\n _ => unreachable!(),\\n\\n };\\n\\n let theorem_a = database.get(id_a.0.as_deref(), id_a.1).unwrap();\\n\\n let theorem_b = database.get(id_b.0.as_deref(), id_b.1).unwrap();\\n\\n let mut sa = String::new();\\n\\n fmt.format_theorem(&mut sa, &theorem_a);\\n\\n let mut sb = String::new();\\n\\n fmt.format_theorem(&mut sb, &theorem_b);\\n\\n let mut ss = String::new();\\n\\n fmt.format_statement(&mut ss, &theorem_a.assumptions()[index]);\\n\\n eprintln!(\\n\\n \\\"proof error combining\\\\n{}\\\\ninto the argument {} of\\\\n{}\\\",\\n\\n sb, ss, sa\\n\\n );\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 33,\n \"score\": 22.771394460964608\n },\n {\n \"content\": \" /// assert_eq!(sub.substitution_opt(1), None);\\n\\n /// ```\\n\\n pub fn insert(&mut self, id: Identifier, expr: Expression<&'a [Identifier]>) {\\n\\n self.substitution[id as usize] = Some(expr)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Substitution for WholeSubstitution<'a> {\\n\\n type T = &'a [Identifier];\\n\\n\\n\\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<&'a [Identifier]>> {\\n\\n self.substitution[id as usize]\\n\\n }\\n\\n}\\n\\n\\n\\n/// A single variable substitution\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct SingleSubstitution(Identifier, Identifier);\\n\\n\\n\\nimpl SingleSubstitution {\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 35,\n \"score\": 22.609949546359754\n },\n {\n \"content\": \" Err(err) => {\\n\\n eprint!(\\\"Error in line {}: \\\", line_number);\\n\\n match err {\\n\\n DatabaseError::TheoremNotFound(name, id) => match (name, id) {\\n\\n (Some(name), Some(id)) => eprint!(\\\"theorem {}.{} not found\\\", name, id),\\n\\n (Some(name), None) => eprintln!(\\\"theorem {} not found\\\", name),\\n\\n (None, Some(id)) => eprint!(\\\"theorem {} not found\\\", id),\\n\\n (None, None) => eprintln!(\\\"theorem $ not found\\\"),\\n\\n },\\n\\n DatabaseError::NameCollision(name) => {\\n\\n eprintln!(\\\"{} already defined\\\", name)\\n\\n }\\n\\n DatabaseError::TheoremMismatch(theorem_a, theorem_b) => {\\n\\n eprintln!(\\\"theorem mismatch\\\");\\n\\n let mut sa = String::new();\\n\\n fmt.format_theorem(&mut sa, &theorem_a);\\n\\n let mut sb = String::new();\\n\\n fmt.format_theorem(&mut sb, &theorem_b);\\n\\n eprintln!(\\\"expected: {}\\\", sb);\\n\\n eprintln!(\\\" found: {}\\\", sa);\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 36,\n \"score\": 22.20097798340933\n },\n {\n \"content\": \" Ok((input, Command::Judgement(judgement.to_owned())))\\n\\n }\\n\\n\\n\\n fn parse_operator<'a>(input: &'a str) -> IResult<&'a str, Command, GreedyError<&'a str>> {\\n\\n let (input, _) = tag(\\\"opr \\\")(input)?;\\n\\n let (input, operator) = take_until(\\\" \\\")(input)?;\\n\\n let (input, _) = char(' ')(input)?;\\n\\n let (input, arity) = map_opt(digit1, |s: &str| s.parse::<u8>().ok())(input)?;\\n\\n Ok((input, Command::Operator(operator.to_owned(), arity)))\\n\\n }\\n\\n\\n\\n fn serialize_id(&self, s: &mut String, id: &(Option<String>, Option<usize>)) {\\n\\n match id {\\n\\n (Some(name), Some(index)) => write!(s, \\\"{}.{}\\\", name, index + 1).unwrap(),\\n\\n (Some(name), None) => s.push_str(&name),\\n\\n (None, Some(index)) => write!(s, \\\"{}\\\", index + 1).unwrap(),\\n\\n (None, None) => s.push_str(\\\"$\\\"),\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 37,\n \"score\": 22.054169248486808\n },\n {\n \"content\": \" pub fn serialize(&self, s: &mut String, fmt: &Formatter) {\\n\\n match self {\\n\\n Command::Proof(Proof::Simplify(id, a, b), theorem, name) => {\\n\\n s.push_str(\\\"smp \\\");\\n\\n self.serialize_id(s, id);\\n\\n s.push_str(\\\" (\\\");\\n\\n fmt.format_variable(s, *a);\\n\\n s.push_str(\\\" ~ \\\");\\n\\n fmt.format_variable(s, *b);\\n\\n s.push_str(\\\" )\\\");\\n\\n if let Some(theorem) = theorem {\\n\\n s.push_str(\\\" { \\\");\\n\\n fmt.format_theorem(s, theorem);\\n\\n s.push_str(\\\" }\\\");\\n\\n }\\n\\n if let Some(name) = name {\\n\\n write!(s, \\\": {}\\\", name).unwrap();\\n\\n }\\n\\n }\\n\\n Command::Proof(Proof::Combine(id_a, id_b, index), theorem, name) => {\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 38,\n \"score\": 21.749770377036135\n },\n {\n \"content\": \"\\n\\n /// Creates a new `DVR` restricting `a` and `b` from being the same variable.\\n\\n ///\\n\\n /// # Errors\\n\\n /// This function fails with a `DVRError` if `a == b`\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\\n /// use attomath::DVR;\\n\\n /// use attomath::error::ProofError;\\n\\n ///\\n\\n /// let dvr = DVR::new(0, 1);\\n\\n /// assert_eq!(dvr.map(|d| d.variables()), Ok((0, 1)));\\n\\n ///\\n\\n /// let dvr = DVR::new(1, 1);\\n\\n /// assert_eq!(dvr, Err(ProofError::DVRError(1)));\\n\\n /// ```\\n\\n pub fn new(a: Identifier, b: Identifier) -> Result<Self, ProofError> {\\n\\n if is_operator(a) {\\n\\n Err(ProofError::DVRError(a))\\n\",\n \"file_path\": \"src/dvr.rs\",\n \"rank\": 39,\n \"score\": 20.580164595757843\n },\n {\n \"content\": \" database.proofs().map(|(theorem, proof, name)| {\\n\\n let mut should_serialize_theorem = name.is_some();\\n\\n if !should_serialize_theorem {\\n\\n let mut theorem1 = theorem.clone();\\n\\n theorem1.standardize();\\n\\n should_serialize_theorem |= &theorem1 != theorem;\\n\\n }\\n\\n Command::Proof(\\n\\n proof.map_id(|(s, n)| (s.map(|s| s.to_owned()), n)),\\n\\n if should_serialize_theorem {\\n\\n Some(theorem.clone())\\n\\n } else {\\n\\n None\\n\\n },\\n\\n name.map(|n| n.to_owned()),\\n\\n )\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 40,\n \"score\": 20.136460027333644\n },\n {\n \"content\": \" /// Create a new substitution to rename one variable.\\n\\n ///\\n\\n /// Returns `None` if one of the identifiers is not a variable (see [is_operator]).\\n\\n pub fn new(a: Identifier, b: Identifier) -> Option<Self> {\\n\\n if is_operator(a) || is_operator(b) {\\n\\n return None;\\n\\n }\\n\\n Some(SingleSubstitution(a, b))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Substitution for SingleSubstitution {\\n\\n type T = [Identifier; 1];\\n\\n\\n\\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<[Identifier; 1]>> {\\n\\n if id == self.0 {\\n\\n Some(Expression { data: [self.1] })\\n\\n } else {\\n\\n None\\n\\n }\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 41,\n \"score\": 20.014899819746457\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n/// A complete variable substitution.\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct VariableSubstitution<T: Borrow<[Option<Identifier>]>>(T);\\n\\n\\n\\nimpl<T: Borrow<[Option<Identifier>]>> VariableSubstitution<T> {\\n\\n /// Creates a substitution with the capacity to store replacements for variables `0` to\\n\\n /// `n - 1`.\\n\\n ///\\n\\n /// Returns none if a identifier in `variables` is not a variable (see [is_operator]).\\n\\n pub fn new(variables: T) -> Option<Self> {\\n\\n for var in variables.borrow() {\\n\\n if let Some(var) = var {\\n\\n if is_operator(*var) {\\n\\n return None;\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 43,\n \"score\": 19.807117219825752\n },\n {\n \"content\": \" )),\\n\\n )),\\n\\n |(_, theorem, _, name)| (Some(theorem), name),\\n\\n ),\\n\\n map(tuple((tag(\\\": \\\"), rest)), |(_, name): (&str, &str)| {\\n\\n (None, Some(name.to_owned()))\\n\\n }),\\n\\n ))(input)?;\\n\\n Ok((\\n\\n input,\\n\\n Command::Proof(Proof::Combine(id_a, id_b, index - 1), theorem, name),\\n\\n ))\\n\\n })(input)\\n\\n }\\n\\n\\n\\n fn parse_axiom<'a>(\\n\\n fmt: &Formatter,\\n\\n input: &'a str,\\n\\n ) -> IResult<&'a str, Command, GreedyError<&'a str>> {\\n\\n let (input, _) = tag(\\\"axm { \\\")(input)?;\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 44,\n \"score\": 19.64054980572643\n },\n {\n \"content\": \"\\n\\n impl Iterator for Iter {\\n\\n type Item = Result<DVR, ProofError>;\\n\\n\\n\\n fn next(&mut self) -> Option<Result<DVR, ProofError>> {\\n\\n if self.index >= self.a.len() * self.b.len() {\\n\\n return None;\\n\\n }\\n\\n let res = DVR::new(\\n\\n self.a[self.index % self.a.len()],\\n\\n self.b[self.index / self.a.len()],\\n\\n );\\n\\n self.index += 1;\\n\\n Some(res)\\n\\n }\\n\\n\\n\\n fn size_hint(&self) -> (usize, Option<usize>) {\\n\\n let rem = self.a.len() * self.b.len() - self.index;\\n\\n (rem, Some(rem))\\n\\n }\\n\\n }\\n\\n Iter {\\n\\n a: vars_a,\\n\\n b: vars_b,\\n\\n index: 0,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/dvr.rs\",\n \"rank\": 45,\n \"score\": 19.576997020248037\n },\n {\n \"content\": \" .copied()\\n\\n .filter(|s| !is_operator(*s))\\n\\n }\\n\\n\\n\\n /// Returns the subexpression beginning at the given index.\\n\\n ///\\n\\n /// # Panics\\n\\n /// This method panics if start_index is not in the range `0..self.data().borrow().len()`\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\\n /// use attomath::expression::Expression;\\n\\n ///\\n\\n /// let st = Expression::from_raw([-2, 0, -2, 1, 0]).unwrap();\\n\\n /// assert_eq!(*st.subexpression(2).data(), &[-2, 1, 0]);\\n\\n /// assert_eq!(*st.subexpression(3).data(), &[1]);\\n\\n /// ```\\n\\n pub fn subexpression<'a>(&'a self, start_index: usize) -> Expression<&'a [Identifier]> {\\n\\n Self::subexpression_check(&self.data, start_index).expect(\\n\\n format!(\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 46,\n \"score\": 19.528877225453886\n },\n {\n \"content\": \" .add_proof(Proof::Combine(\\n\\n (None, None),\\n\\n (Some(\\\"b\\\".to_owned()), None),\\n\\n 0,\\n\\n ))\\n\\n .unwrap();\\n\\n database.add_name(\\\"c\\\".to_owned()).unwrap();\\n\\n\\n\\n let theorem = database.get(Some(\\\"c\\\"), None).unwrap();\\n\\n assert_eq!(theorem, &Theorem::new(c, vec![], vec![]));\\n\\n\\n\\n let mut fmt = Formatter::new();\\n\\n fmt.add_operator(\\\"A\\\".to_owned(), 0);\\n\\n fmt.add_operator(\\\"B\\\".to_owned(), 0);\\n\\n fmt.add_operator(\\\"C\\\".to_owned(), 0);\\n\\n fmt.add_judgement(\\\"|-\\\".to_owned());\\n\\n let s = serialize_database(&fmt, &database);\\n\\n assert_eq!(\\n\\n s,\\n\\n r#\\\"jdg |-\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 47,\n \"score\": 18.449943604755084\n },\n {\n \"content\": \" /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// let result = a.unify(&b, &mut sub);\\n\\n /// assert_eq!(result, Err(ProofError::OperatorMismatch(-3, -2)));\\n\\n /// ```\\n\\n pub fn unify<'a, S: Borrow<[Identifier]>>(\\n\\n &'a self,\\n\\n other: &Expression<S>,\\n\\n substitution: &mut WholeSubstitution<'a>,\\n\\n ) -> Result<(), ProofError> {\\n\\n let expr = self.data.borrow();\\n\\n let mut expr_index = 0;\\n\\n for &symb in other.data.borrow().iter() {\\n\\n if is_operator(symb) {\\n\\n let symb_self = expr[expr_index];\\n\\n expr_index += 1;\\n\\n if symb_self != symb {\\n\\n return Err(ProofError::OperatorMismatch(symb_self, symb));\\n\\n }\\n\\n } else {\\n\\n if let Some(old) = substitution.substitution_opt(symb) {\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 48,\n \"score\": 18.358273995100113\n },\n {\n \"content\": \" or_fail(|input| {\\n\\n let (input, id_a) = map_parser(is_not(\\\"(\\\"), Self::parse_id)(input)?;\\n\\n let (input, _) = tag(\\\"(\\\")(input)?;\\n\\n let (input, index) = map_opt(digit1, |s: &str| {\\n\\n s.parse::<usize>().ok().filter(|i| *i != 0)\\n\\n })(input)?;\\n\\n let (input, _) = tag(\\\") <- \\\")(input)?;\\n\\n let (input, id_b) = map_parser(is_not(\\\" \\\"), Self::parse_id)(input)?;\\n\\n let (input, (theorem, name)) = alt((\\n\\n map(eof, |_| (None, None)),\\n\\n map(\\n\\n tuple((\\n\\n tag(\\\" { \\\"),\\n\\n map_parser(take_until(\\\" }\\\"), |input| fmt.parse_theorem(input)),\\n\\n tag(\\\" }\\\"),\\n\\n alt((\\n\\n map(eof, |_| None),\\n\\n map(tuple((tag(\\\": \\\"), rest)), |(_, name): (&str, &str)| {\\n\\n Some(name.to_owned())\\n\\n }),\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 49,\n \"score\": 17.57817572492599\n },\n {\n \"content\": \" |input| self.parse_arity(0, input),\\n\\n ))(input)\\n\\n }\\n\\n\\n\\n pub fn format_variable(&self, s: &mut String, mut id: Identifier) {\\n\\n assert!(id >= 0);\\n\\n id += 1;\\n\\n s.extend(\\n\\n std::iter::from_fn(move || {\\n\\n if id == 0 {\\n\\n None\\n\\n } else if id <= 26 {\\n\\n let c = ('a' as u8 + (id % 26) as u8 - 1) as char;\\n\\n id = 0;\\n\\n Some(c)\\n\\n } else {\\n\\n let c = ('a' as u8 + (id % 26) as u8) as char;\\n\\n id /= 26;\\n\\n Some(c)\\n\\n }\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 50,\n \"score\": 17.263122661446328\n },\n {\n \"content\": \" )),\\n\\n )),\\n\\n |(_, theorem, _, name)| (Some(theorem), name),\\n\\n ),\\n\\n map(tuple((tag(\\\": \\\"), rest)), |(_, name): (&str, &str)| {\\n\\n (None, Some(name.to_owned()))\\n\\n }),\\n\\n ))(input)?;\\n\\n Ok((\\n\\n input,\\n\\n Command::Proof(Proof::Simplify(id, a, b), theorem, name),\\n\\n ))\\n\\n })(input)\\n\\n }\\n\\n\\n\\n fn parse_combine<'a>(\\n\\n fmt: &Formatter,\\n\\n input: &'a str,\\n\\n ) -> IResult<&'a str, Command, GreedyError<&'a str>> {\\n\\n let (input, _) = tag(\\\"cmb \\\")(input)?;\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 51,\n \"score\": 17.175179049825008\n },\n {\n \"content\": \" fn subexpression_check<'a>(\\n\\n expr: &'a T,\\n\\n start_index: usize,\\n\\n ) -> Option<Expression<&'a [Identifier]>> {\\n\\n let mut depth = 1;\\n\\n for (i, &s) in expr.borrow()[start_index..].iter().enumerate() {\\n\\n if is_operator(s) && s != Identifier::MIN {\\n\\n depth += 1;\\n\\n } else {\\n\\n depth -= 1;\\n\\n }\\n\\n if depth == 0 {\\n\\n return Some(Expression {\\n\\n data: &expr.borrow()[start_index..=start_index + i],\\n\\n });\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 52,\n \"score\": 16.434657741046287\n },\n {\n \"content\": \"#[derive(Debug, PartialEq, Eq)]\\n\\npub struct Formatter {\\n\\n operators: Vec<(String, u8)>,\\n\\n judgements: Vec<String>,\\n\\n}\\n\\n\\n\\nimpl Formatter {\\n\\n pub fn new() -> Self {\\n\\n Formatter {\\n\\n operators: Vec::new(),\\n\\n judgements: Vec::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn operators(&self) -> impl Iterator<Item = (&str, u8)> {\\n\\n self.operators\\n\\n .iter()\\n\\n .map(|(operator, arity)| (operator.as_str(), *arity))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 53,\n \"score\": 16.38167685816282\n },\n {\n \"content\": \" .unwrap();\\n\\n\\n\\n database\\n\\n .add_proof(Proof::Axiom(Theorem::new(b.clone(), vec![], vec![])))\\n\\n .unwrap();\\n\\n database.add_name(\\\"b\\\".to_owned()).unwrap();\\n\\n\\n\\n database\\n\\n .add_proof(Proof::Axiom(Theorem::new(c.clone(), vec![a, b], vec![])))\\n\\n .unwrap();\\n\\n database.add_name(\\\"abc\\\".to_owned()).unwrap();\\n\\n\\n\\n database\\n\\n .add_proof(Proof::Combine(\\n\\n (Some(\\\"abc\\\".to_owned()), None),\\n\\n (Some(\\\"b\\\".to_owned()), Some(0)),\\n\\n 0,\\n\\n ))\\n\\n .unwrap();\\n\\n database\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 54,\n \"score\": 16.070733218876587\n },\n {\n \"content\": \"use crate::{\\n\\n error::ProofError,\\n\\n expression::{is_operator, Substitution},\\n\\n types::*,\\n\\n};\\n\\n\\n\\n/// A _distince variable relation_ for expressing that two variables must be different.\\n\\n///\\n\\n/// In the default case it is always assumed that all statements are correct if you replace\\n\\n/// a variable with a different subexpression. This leads to logical errors in statements like\\n\\n/// `forall x0. exists x1. x0 != x1`.\\n\\n#[derive(PartialEq, Eq, Clone, PartialOrd, Ord, Debug)]\\n\\npub struct DVR(Identifier, Identifier);\\n\\n\\n\\nimpl DVR {\\n\\n /// Returns this `DVR`s variables\\n\\n pub fn variables(&self) -> (Identifier, Identifier) {\\n\\n let DVR(a, b) = self;\\n\\n (*a, *b)\\n\\n }\\n\",\n \"file_path\": \"src/dvr.rs\",\n \"rank\": 55,\n \"score\": 16.00144652672507\n },\n {\n \"content\": \"cmb $(5) <- 1\\n\\ncmb ax-1(2) <- wi\\n\\nsmp $ (a ~ b)\\n\\nsmp $ (a ~ b)\\n\\nsmp $ (a ~ b)\\n\\ncmb 3(3) <- $ { wff a => |- (a -> a) }: id\\n\\n\\\"#;\\n\\n let mut fmt = Formatter::new();\\n\\n match parse_database(&mut fmt, s) {\\n\\n Err((line, e)) => {\\n\\n eprintln!(\\\"In line:\\\\n\\\\t{}\\\", line);\\n\\n match e {\\n\\n Error::DatabaseError(DatabaseError::TheoremMismatch(t1, t2)) => {\\n\\n let mut s1 = String::new();\\n\\n fmt.format_theorem(&mut s1, &t1);\\n\\n let mut s2 = String::new();\\n\\n fmt.format_theorem(&mut s2, &t2);\\n\\n panic!(\\\"TheoremMismatch:\\\\n{}\\\\n{}\\\", s1, s2);\\n\\n }\\n\\n e => {\\n\\n panic!(\\\"{:?}\\\", e);\\n\\n }\\n\\n }\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 56,\n \"score\": 15.61110368397199\n },\n {\n \"content\": \" or_fail(|input| {\\n\\n let (input, theorem) =\\n\\n map_parser(take_until(\\\" }\\\"), |input| fmt.parse_theorem(input))(input)?;\\n\\n let (input, _) = tag(\\\" }\\\")(input)?;\\n\\n let (input, name) = alt((\\n\\n map(eof, |_| None),\\n\\n map(tuple((tag(\\\": \\\"), rest)), |(_, name): (&str, &str)| {\\n\\n Some(name.to_owned())\\n\\n }),\\n\\n ))(input)?;\\n\\n Ok((\\n\\n input,\\n\\n Command::Proof(Proof::Axiom(theorem.clone()), None, name),\\n\\n ))\\n\\n })(input)\\n\\n }\\n\\n\\n\\n fn parse_judgement<'a>(input: &'a str) -> IResult<&'a str, Command, GreedyError<&'a str>> {\\n\\n let (input, _) = tag(\\\"jdg \\\")(input)?;\\n\\n let (input, judgement) = rest(input)?;\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 57,\n \"score\": 15.427269009779783\n },\n {\n \"content\": \" /// expected.dedup();\\n\\n /// assert_eq!(new_dvrs, Ok(expected));\\n\\n ///\\n\\n /// let dvr = DVR::new(0, 1).unwrap();\\n\\n /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// let expr0 = Expression::from_raw(vec![-2, 0, 1]).unwrap();\\n\\n /// sub.insert(0, expr0.to_slice());\\n\\n /// let expr1 = Expression::from_raw(vec![-2, 1, 2]).unwrap();\\n\\n /// sub.insert(1, expr1.to_slice());\\n\\n ///\\n\\n /// let new_dvrs = dvr.substitute(&sub).collect::<Result<Vec<_>, _>>();\\n\\n ///\\n\\n /// assert_eq!(new_dvrs, Err(ProofError::DVRError(1)));\\n\\n /// ```\\n\\n pub fn substitute<S: Substitution>(\\n\\n &self,\\n\\n substitution: &S,\\n\\n ) -> impl Iterator<Item = Result<DVR, ProofError>> {\\n\\n let DVR(a, b) = self;\\n\\n let vars_a = if let Some(sub) = substitution.substitution_opt(*a) {\\n\",\n \"file_path\": \"src/dvr.rs\",\n \"rank\": 58,\n \"score\": 15.40211748672587\n },\n {\n \"content\": \" type T = [Identifier; 1];\\n\\n\\n\\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<[Identifier; 1]>> {\\n\\n if id < 0 {\\n\\n panic!(\\\"id is not a variable\\\");\\n\\n }\\n\\n Some(Expression {\\n\\n data: [id + self.shift as Identifier],\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n/// A general substitution\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct WholeSubstitution<'a> {\\n\\n substitution: Vec<Option<Expression<&'a [Identifier]>>>,\\n\\n}\\n\\n\\n\\nimpl<'a> WholeSubstitution<'a> {\\n\\n /// Creates a substitution with the capacity to store replacements for variables `0` to\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 59,\n \"score\": 15.28263873059454\n },\n {\n \"content\": \" s.push_str(\\\"cmb \\\");\\n\\n self.serialize_id(s, id_a);\\n\\n write!(s, \\\"({}) <- \\\", index + 1).unwrap();\\n\\n self.serialize_id(s, id_b);\\n\\n if let Some(theorem) = theorem {\\n\\n s.push_str(\\\" { \\\");\\n\\n fmt.format_theorem(s, theorem);\\n\\n s.push_str(\\\" }\\\");\\n\\n }\\n\\n if let Some(name) = name {\\n\\n write!(s, \\\": {}\\\", name).unwrap();\\n\\n }\\n\\n }\\n\\n Command::Proof(Proof::Axiom(theorem), _, name) => {\\n\\n s.push_str(\\\"axm { \\\");\\n\\n fmt.format_theorem(s, theorem);\\n\\n s.push_str(\\\" }\\\");\\n\\n if let Some(name) = name {\\n\\n write!(s, \\\": {}\\\", name).unwrap();\\n\\n }\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 60,\n \"score\": 15.256815886607434\n },\n {\n \"content\": \" /// assert_eq!(res, Err(ProofError::JudgementMismatch(0, 1)));\\n\\n /// ```\\n\\n pub fn unify<'a, S: Borrow<[Identifier]>>(\\n\\n &'a self,\\n\\n other: &Statement<S>,\\n\\n substitution: &mut WholeSubstitution<'a>,\\n\\n ) -> Result<(), ProofError> {\\n\\n if self.judgement != other.judgement {\\n\\n return Err(ProofError::JudgementMismatch(\\n\\n self.judgement,\\n\\n other.judgement,\\n\\n ));\\n\\n }\\n\\n self.expression.unify(&other.expression, substitution)?;\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n /// Convenience function for using a `Substitution` on this statements expression (see\\n\\n /// [`Expression::substitute`])\\n\\n pub fn substitute<S: Substitution>(&self, substitution: &S) -> Statement<Box<[Identifier]>> {\\n\\n Statement {\\n\\n judgement: self.judgement,\\n\\n expression: self.expression.substitute(substitution),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/statement.rs\",\n \"rank\": 61,\n \"score\": 15.183137746569603\n },\n {\n \"content\": \" /// `n - 1`.\\n\\n pub fn with_capacity(n: usize) -> Self {\\n\\n WholeSubstitution {\\n\\n substitution: vec![None; n],\\n\\n }\\n\\n }\\n\\n\\n\\n /// Marks the `id` to be substituted by `expr`.\\n\\n ///\\n\\n /// # Panics\\n\\n /// This method panics if `id` is not in the range of this substitutions capacity\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\\n /// use attomath::expression::{Expression, Substitution, WholeSubstitution};\\n\\n ///\\n\\n /// let expr = Expression::from_raw([-2, 0, 1]).unwrap();\\n\\n /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// sub.insert(0, expr.to_slice());\\n\\n /// assert_eq!(sub.substitution_opt(0), Some(expr.to_slice()));\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 62,\n \"score\": 15.07166310948092\n },\n {\n \"content\": \" context(\\\"smp\\\", |input| Self::parse_simplify(&fmt, input)),\\n\\n context(\\\"cmb\\\", |input| Self::parse_combine(&fmt, input)),\\n\\n context(\\\"axm\\\", |input| Self::parse_axiom(&fmt, input)),\\n\\n )),\\n\\n ),\\n\\n context(\\\"jdg\\\", |input| Self::parse_judgement(input)),\\n\\n context(\\\"opr\\\", |input| Self::parse_operator(input)),\\n\\n ))))(input)?;\\n\\n Ok(command)\\n\\n }\\n\\n\\n\\n fn parse_id(input: &str) -> IResult<&str, (Option<String>, Option<usize>), GreedyError<&str>> {\\n\\n alt((\\n\\n terminated(map(char('$'), |_| (None, None)), eof),\\n\\n terminated(\\n\\n map_opt(digit1, |s: &str| {\\n\\n Some((\\n\\n None,\\n\\n Some(s.parse::<usize>().ok().and_then(|i| {\\n\\n if i == 0 {\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 63,\n \"score\": 14.891085043152133\n },\n {\n \"content\": \"\\n\\nimpl<T: BorrowMut<[Identifier]> + std::fmt::Debug> Expression<T> {\\n\\n /// Turns this expression into its standard representation, numbering variables in the order of\\n\\n /// their apperance.\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\\n /// use attomath::expression::Expression;\\n\\n ///\\n\\n /// let mut s = Expression::from_raw([-2, -2, 2, 0, 2]).unwrap();\\n\\n /// s.standardize();\\n\\n /// assert_eq!(s.data(), &[-2, -2, 0, 1, 0]);\\n\\n /// ```\\n\\n pub fn standardize(&mut self) {\\n\\n let max_var = self.variables().max().unwrap_or(-1);\\n\\n let mut var_map = vec![None; (Wrapping(max_var as usize) + Wrapping(1)).0];\\n\\n let mut next_var = 0;\\n\\n self.standardize_range(&mut var_map, &mut next_var, ..);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 64,\n \"score\": 14.78127860920461\n },\n {\n \"content\": \" match err {\\n\\n attomath::error::ProofError::OperatorMismatch(op_a, op_b) => eprintln!(\\n\\n \\\"operator mismatch: expected {} found {}\\\",\\n\\n fmt.operators().nth((-op_b) as usize - 1).unwrap().0,\\n\\n fmt.operators().nth((-op_a) as usize - 1).unwrap().0,\\n\\n ),\\n\\n attomath::error::ProofError::VariableMismatch(var, sub_a, sub_b) => {\\n\\n let mut sv = String::new();\\n\\n fmt.format_variable(&mut sv, var);\\n\\n let mut sa = String::new();\\n\\n fmt.format_expression(\\n\\n &mut sa,\\n\\n &Expression::from_raw(sub_b).unwrap(),\\n\\n );\\n\\n let mut sb = String::new();\\n\\n fmt.format_expression(\\n\\n &mut sb,\\n\\n &Expression::from_raw(sub_a).unwrap(),\\n\\n );\\n\\n eprintln!(\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 65,\n \"score\": 14.467628067111729\n },\n {\n \"content\": \" pub fn judgements(&self) -> impl Iterator<Item = &str> {\\n\\n self.judgements.iter().map(|judgement| judgement.as_str())\\n\\n }\\n\\n\\n\\n pub fn add_operator(&mut self, operator: String, arity: u8) {\\n\\n // TODO: verify\\n\\n self.operators.push((operator, arity));\\n\\n }\\n\\n\\n\\n pub fn add_judgement(&mut self, judgement: String) {\\n\\n // TODO: verify\\n\\n self.judgements.push(judgement);\\n\\n }\\n\\n\\n\\n pub fn format_operator<T: Borrow<[Identifier]> + std::fmt::Debug>(\\n\\n &self,\\n\\n s: &mut String,\\n\\n id: Identifier,\\n\\n left: &Expression<T>,\\n\\n right: &Expression<T>,\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 66,\n \"score\": 14.431474630252621\n },\n {\n \"content\": \" })\\n\\n .collect::<Vec<_>>()\\n\\n .into_iter(),\\n\\n );\\n\\n }\\n\\n\\n\\n pub fn parse_variable<'a>(\\n\\n &self,\\n\\n input: &'a str,\\n\\n ) -> IResult<&'a str, Identifier, GreedyError<&'a str>> {\\n\\n let (input, var) = take_while1(|c| c >= 'a' && c <= 'z')(input)?;\\n\\n let mut id = 0i16;\\n\\n for c in var.chars() {\\n\\n id *= 26;\\n\\n if id == 0 {\\n\\n id += 1;\\n\\n }\\n\\n id += (c as u8 - 'a' as u8) as i16;\\n\\n }\\n\\n Ok((input, id - 1))\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 67,\n \"score\": 14.310278048468493\n },\n {\n \"content\": \" None\\n\\n } else {\\n\\n Some(i - 1)\\n\\n }\\n\\n })?),\\n\\n ))\\n\\n }),\\n\\n eof,\\n\\n ),\\n\\n terminated(\\n\\n map_opt(\\n\\n tuple((take_till1(|c| c == '.' || c == ' '), char('.'), digit1)),\\n\\n |(name, _, s): (&str, char, &str)| -> Option<(Option<String>, Option<usize>)> {\\n\\n Some((\\n\\n Some(name.to_owned()),\\n\\n Some(s.parse::<usize>().ok().and_then(|i| {\\n\\n if i == 0 {\\n\\n None\\n\\n } else {\\n\\n Some(i - 1)\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 68,\n \"score\": 14.150449607104637\n },\n {\n \"content\": \" }\\n\\n }\\n\\n }\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n /// Use the given substitution on this expression to create a new expression\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\\n /// use attomath::expression::{Expression, WholeSubstitution};\\n\\n ///\\n\\n /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// let expr = Expression::from_raw([-2, 0, 1]).unwrap();\\n\\n /// sub.insert(0, expr.to_slice());\\n\\n /// assert_eq!(*expr.substitute(&sub).to_slice().data(), &[-2, -2, 0, 1, 1]);\\n\\n /// ```\\n\\n pub fn substitute<S: Substitution>(&self, substitution: &S) -> Expression<Box<[Identifier]>> {\\n\\n let mut new_expr = Vec::with_capacity(self.data.borrow().len());\\n\\n for symb in self.data.borrow().iter() {\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 69,\n \"score\": 13.68894952617311\n },\n {\n \"content\": \"/// Statement {\\n\\n/// judgement: 0,\\n\\n/// expression: Expression::from_raw(vec![0].into_boxed_slice()).unwrap(),\\n\\n/// },\\n\\n/// Statement {\\n\\n/// judgement: 0,\\n\\n/// expression: Expression::from_raw(vec![-1, 0, 1].into_boxed_slice()).unwrap(),\\n\\n/// }\\n\\n/// ];\\n\\n/// let dvrs = vec![DVR::new(0, 1).unwrap()];\\n\\n/// let theorem = Theorem::new(conclusion, assumptions, dvrs);\\n\\n///\\n\\n/// let mut s = String::new();\\n\\n/// fmt.format_theorem(&mut s, &theorem);\\n\\n/// assert_eq!(s, \\\"a <> b, |- a, |- (a -> b) => |- b\\\");\\n\\n///\\n\\n/// let (remaining, theorem1) = fmt.parse_theorem(&s).unwrap();\\n\\n/// assert_eq!(remaining, \\\"\\\");\\n\\n/// assert_eq!(theorem1, theorem);\\n\\n/// ```\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 70,\n \"score\": 13.508671628076506\n },\n {\n \"content\": \"use crate::{error::ProofError, types::*};\\n\\nuse std::{\\n\\n borrow::{Borrow, BorrowMut},\\n\\n cmp::Ordering,\\n\\n num::Wrapping,\\n\\n ops::RangeBounds,\\n\\n};\\n\\n\\n\\n/// A `Expression` is a binary tree with nodes called \\\"operators\\\" and leafs which called\\n\\n/// \\\"variables\\\".\\n\\n///\\n\\n/// The exception to this is the special leaf `Identifier::MIN` which is an operator\\n\\n/// and used as a \\\"terminator\\\" two allow for operators with arity 1 or less.\\n\\n///\\n\\n/// The expression is encoded by prefix orderinto a sequence of [`Identifier`]s which can be both\\n\\n/// variables and operators (see [`is_operator`]).\\n\\n#[derive(Clone, Eq, Ord, Debug, Copy)]\\n\\npub struct Expression<T: Borrow<[Identifier]>> {\\n\\n data: T,\\n\\n}\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 71,\n \"score\": 13.062986177469384\n },\n {\n \"content\": \" })\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n/// Substitutes variables by shifting them to the right by the given ammount\\n\\npub struct ShiftSubstitution {\\n\\n shift: Identifier,\\n\\n}\\n\\n\\n\\nimpl ShiftSubstitution {\\n\\n pub fn new(shift: Identifier) -> Self {\\n\\n if shift < 0 {\\n\\n panic!(\\\"shift must be nonnegative\\\");\\n\\n }\\n\\n ShiftSubstitution { shift }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Substitution for ShiftSubstitution {\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 72,\n \"score\": 13.028188999243211\n },\n {\n \"content\": \" self.format_variable(s, a);\\n\\n s.push_str(\\\" <> \\\");\\n\\n self.format_variable(s, b);\\n\\n }\\n\\n\\n\\n pub fn parse_dvr<'a>(&self, input: &'a str) -> IResult<&'a str, DVR, GreedyError<&'a str>> {\\n\\n let (input, a) = self.parse_variable(input)?;\\n\\n let (input, _) = tag(\\\" <> \\\")(input)?;\\n\\n let (input, b) = verify(|input| self.parse_variable(input), |b| *b != a)(input)?;\\n\\n Ok((input, DVR::new(a, b).unwrap()))\\n\\n }\\n\\n\\n\\n pub fn format_theorem(&self, s: &mut String, theorem: &Theorem) {\\n\\n let dvrs = theorem.dvrs();\\n\\n let assumptions = theorem.assumptions();\\n\\n if !dvrs.is_empty() || !assumptions.is_empty() {\\n\\n for (i, dvr) in dvrs.iter().enumerate() {\\n\\n self.format_dvr(s, dvr);\\n\\n if i != dvrs.len() - 1 || !assumptions.is_empty() {\\n\\n s.push_str(\\\", \\\");\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 73,\n \"score\": 12.872626375384922\n },\n {\n \"content\": \"opr A 0\\n\\nopr B 0\\n\\nopr C 0\\n\\naxm { |- A }\\n\\naxm { |- B }: b\\n\\naxm { |- A, |- B => |- C }: abc\\n\\ncmb abc(1) <- b.1\\n\\ncmb $(1) <- b { |- C }: c\\n\\n\\\"#\\n\\n );\\n\\n\\n\\n let mut fmt1 = Formatter::new();\\n\\n let database1 = parse_database(&mut fmt1, &s).unwrap();\\n\\n assert_eq!(database1, database);\\n\\n assert_eq!(fmt1, fmt);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn id() {\\n\\n let s = r#\\\"jdg wff\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 74,\n \"score\": 12.85327903180555\n },\n {\n \"content\": \" fn from(e: DatabaseError) -> Self {\\n\\n Self::DatabaseError(e)\\n\\n }\\n\\n }\\n\\n\\n\\n fn serialize_database(fmt: &Formatter, database: &Database) -> String {\\n\\n let mut s = String::new();\\n\\n for command in Command::from_formatter(fmt).chain(Command::from_database(database)) {\\n\\n command.serialize(&mut s, fmt);\\n\\n s.push('\\\\n');\\n\\n }\\n\\n s\\n\\n }\\n\\n\\n\\n fn parse_database<'a>(\\n\\n fmt: &mut Formatter,\\n\\n input: &'a str,\\n\\n ) -> Result<Database, (&'a str, Error<'a>)> {\\n\\n let mut database = Database::new();\\n\\n for line in input.lines() {\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 75,\n \"score\": 12.784642114759794\n },\n {\n \"content\": \"use std::fmt::Write;\\n\\n\\n\\nuse nom::{\\n\\n branch::alt,\\n\\n bytes::complete::{is_not, tag, take_till1, take_until},\\n\\n character::complete::{char, digit1},\\n\\n combinator::{all_consuming, eof, map, map_opt, map_parser, rest},\\n\\n error::context,\\n\\n sequence::{terminated, tuple},\\n\\n IResult,\\n\\n};\\n\\n\\n\\nuse crate::Theorem;\\n\\n\\n\\nuse super::{\\n\\n error::{or_fail, GreedyError},\\n\\n Database, DatabaseError, Formatter, Proof,\\n\\n};\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Clone)]\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 76,\n \"score\": 12.53793819634839\n },\n {\n \"content\": \" input: &'a str,\\n\\n ) -> IResult<&'a str, Judgement, GreedyError<&'a str>> {\\n\\n let (input, judgement) = map_opt(is_not(\\\" \\\"), |s| {\\n\\n self.judgements\\n\\n .iter()\\n\\n .enumerate()\\n\\n .filter_map(|(i, j)| if s == j { Some(i) } else { None })\\n\\n .next()\\n\\n })(input)?;\\n\\n Ok((input, judgement as u8))\\n\\n }\\n\\n\\n\\n pub fn format_statement<T: Borrow<[Identifier]> + std::fmt::Debug>(\\n\\n &self,\\n\\n s: &mut String,\\n\\n statement: &Statement<T>,\\n\\n ) {\\n\\n self.format_judgement(s, statement.judgement);\\n\\n s.push(' ');\\n\\n self.format_expression(s, &statement.expression);\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 77,\n \"score\": 12.520164968063918\n },\n {\n \"content\": \"\\n\\n pub(crate) fn substitute_variables(&mut self, var_map: &[Option<Identifier>]) {\\n\\n for symb in self.data.borrow_mut().iter_mut() {\\n\\n if !is_operator(*symb) {\\n\\n if let Some(sub) = var_map[*symb as usize] {\\n\\n *symb = sub;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Borrow<[Identifier]> + std::fmt::Debug> Expression<T> {\\n\\n /// The internal encoding in prefix order\\n\\n pub fn data<'a>(&'a self) -> &'a T {\\n\\n &self.data\\n\\n }\\n\\n\\n\\n /// Borrow this expressions contents\\n\\n pub fn to_slice<'a>(&'a self) -> Expression<&'a [Identifier]> {\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 78,\n \"score\": 12.457915085715614\n },\n {\n \"content\": \"use crate::{\\n\\n error::ProofError,\\n\\n expression::{Expression, Substitution, WholeSubstitution},\\n\\n types::*,\\n\\n};\\n\\nuse std::borrow::Borrow;\\n\\n\\n\\n/// Type alias for a statement that owns its expression\\n\\npub type OwnedStatement = Statement<Box<[Identifier]>>;\\n\\n\\n\\n/// A a combination of a [`Judgement`] and an [`Expression`], for example _x0 -> x0 is provable_\\n\\n///\\n\\n/// The __judgement__ is given in form of an integer, but often represents some meaning, like _this\\n\\n/// expression is provable_ or _this expression is syntactically correct_.\\n\\n#[derive(Eq, Clone, PartialOrd, Ord, Debug)]\\n\\npub struct Statement<T: Borrow<[Identifier]>> {\\n\\n pub judgement: Judgement,\\n\\n pub expression: Expression<T>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/statement.rs\",\n \"rank\": 79,\n \"score\": 12.242983860111282\n },\n {\n \"content\": \" )\\n\\n .unwrap(),\\n\\n };\\n\\n let b = Statement {\\n\\n judgement: 0,\\n\\n expression: Expression::from_raw(\\n\\n vec![-2, Identifier::MIN, Identifier::MIN].into_boxed_slice(),\\n\\n )\\n\\n .unwrap(),\\n\\n };\\n\\n let c = Statement {\\n\\n judgement: 0,\\n\\n expression: Expression::from_raw(\\n\\n vec![-3, Identifier::MIN, Identifier::MIN].into_boxed_slice(),\\n\\n )\\n\\n .unwrap(),\\n\\n };\\n\\n\\n\\n database\\n\\n .add_proof(Proof::Axiom(Theorem::new(a.clone(), vec![], vec![])))\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 80,\n \"score\": 12.205921183874596\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn format_expression<T: Borrow<[Identifier]> + std::fmt::Debug>(\\n\\n &self,\\n\\n s: &mut String,\\n\\n expression: &Expression<T>,\\n\\n ) {\\n\\n let id = expression.to_slice().data()[0];\\n\\n if id == Identifier::MIN {\\n\\n return;\\n\\n }\\n\\n if is_operator(id) {\\n\\n let left = expression.subexpression(1);\\n\\n let right = expression.subexpression(1 + left.data().len());\\n\\n self.format_operator(s, id, &left, &right);\\n\\n } else {\\n\\n self.format_variable(s, id)\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 81,\n \"score\": 12.000604520451981\n },\n {\n \"content\": \" (|| {\\n\\n let command = Command::parse(&fmt, line)?;\\n\\n\\n\\n command.apply(fmt, &mut database)?;\\n\\n Ok(())\\n\\n })()\\n\\n .map_err(|e| (line, e))?;\\n\\n }\\n\\n Ok(database)\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn a_b_c() {\\n\\n use crate::{expression::Expression, statement::Statement};\\n\\n let mut database = Database::new();\\n\\n\\n\\n let a = Statement {\\n\\n judgement: 0,\\n\\n expression: Expression::from_raw(\\n\\n vec![-1, Identifier::MIN, Identifier::MIN].into_boxed_slice(),\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 82,\n \"score\": 11.96670789029956\n },\n {\n \"content\": \" pub fn parse_expression<'a>(\\n\\n &self,\\n\\n input: &'a str,\\n\\n ) -> IResult<&'a str, Expression<Box<[Identifier]>>, GreedyError<&'a str>> {\\n\\n // TODO: remove unwrap\\n\\n alt((\\n\\n map(\\n\\n |input| self.parse_variable(input),\\n\\n |v| Expression::from_raw(vec![v].into_boxed_slice()).unwrap(),\\n\\n ),\\n\\n |input| self.parse_operator(input),\\n\\n ))(input)\\n\\n }\\n\\n\\n\\n pub fn format_judgement(&self, s: &mut String, judgement: Judgement) {\\n\\n s.push_str(&self.judgements[judgement as usize]);\\n\\n }\\n\\n\\n\\n pub fn parse_judgement<'a>(\\n\\n &self,\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 83,\n \"score\": 11.75633870122122\n },\n {\n \"content\": \" let (input, _) = tag(\\\"smp \\\")(input)?;\\n\\n or_fail(|input| {\\n\\n let (input, id) = map_parser(is_not(\\\" \\\"), Self::parse_id)(input)?;\\n\\n let (input, _) = tag(\\\" (\\\")(input)?;\\n\\n let (input, a) = fmt.parse_variable(input)?;\\n\\n let (input, _) = tag(\\\" ~ \\\")(input)?;\\n\\n let (input, b) = fmt.parse_variable(input)?;\\n\\n let (input, _) = tag(\\\")\\\")(input)?;\\n\\n let (input, (theorem, name)) = alt((\\n\\n map(eof, |_| (None, None)),\\n\\n map(\\n\\n tuple((\\n\\n tag(\\\" { \\\"),\\n\\n map_parser(take_until(\\\" }\\\"), |input| fmt.parse_theorem(input)),\\n\\n tag(\\\" }\\\"),\\n\\n alt((\\n\\n map(eof, |_| None),\\n\\n map(tuple((tag(\\\": \\\"), rest)), |(_, name): (&str, &str)| {\\n\\n Some(name.to_owned())\\n\\n }),\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 84,\n \"score\": 11.617463249211891\n },\n {\n \"content\": \" ///\\n\\n /// let a = Expression::from_raw([-2, 0, -2, 1, 0]).unwrap();\\n\\n /// let b = Expression::from_raw([-2, 0, 1]).unwrap();\\n\\n /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// let result = a.unify(&b, &mut sub); // (x0 ~> x0, x1 ~> (x1 -> x0))\\n\\n /// assert_eq!(result, Ok(()));\\n\\n /// assert_eq!(b.substitute(&sub), a);\\n\\n ///\\n\\n /// let a = Expression::from_raw([-2, 0, -2, 1, 0]).unwrap();\\n\\n /// let b = Expression::from_raw([-2, 0, 0]).unwrap();\\n\\n /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// let result = a.unify(&b, &mut sub); // (x0 ~> x0, x0 ~> (x1 -> x0))\\n\\n /// assert_eq!(result, Err(ProofError::VariableMismatch(\\n\\n /// 0,\\n\\n /// vec![0].into_boxed_slice(),\\n\\n /// vec![-2, 1, 0].into_boxed_slice(),\\n\\n /// )));\\n\\n ///\\n\\n /// let a = Expression::from_raw([-3, 0, -2, 1, 0]).unwrap();\\n\\n /// let b = Expression::from_raw([-2, 0, 1]).unwrap();\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 85,\n \"score\": 11.564432344534593\n },\n {\n \"content\": \" /// use attomath::DVR;\\n\\n /// use attomath::expression::{Expression, WholeSubstitution};\\n\\n /// use attomath::error::ProofError;\\n\\n ///\\n\\n /// let dvr = DVR::new(0, 1).unwrap();\\n\\n /// let mut sub = WholeSubstitution::with_capacity(2);\\n\\n /// let expr0 = Expression::from_raw(vec![-2, 0, 1]).unwrap();\\n\\n /// sub.insert(0, expr0.to_slice());\\n\\n /// let expr1 = Expression::from_raw(vec![2]).unwrap();\\n\\n /// sub.insert(1, expr1.to_slice());\\n\\n ///\\n\\n /// let mut new_dvrs = dvr.substitute(&sub).collect::<Result<Vec<_>, _>>();\\n\\n /// new_dvrs = new_dvrs.map(|mut ds| {\\n\\n /// ds.sort();\\n\\n /// ds.dedup();\\n\\n /// ds\\n\\n /// });\\n\\n ///\\n\\n /// let mut expected = vec![DVR::new(0, 2).unwrap(), DVR::new(1, 2).unwrap()];\\n\\n /// expected.sort();\\n\",\n \"file_path\": \"src/dvr.rs\",\n \"rank\": 86,\n \"score\": 11.524420990360426\n },\n {\n \"content\": \"impl<T: Borrow<[Identifier]>, S: Borrow<[Identifier]>> PartialEq<Statement<S>> for Statement<T> {\\n\\n fn eq(&self, other: &Statement<S>) -> bool {\\n\\n self.judgement == other.judgement && self.expression == other.expression\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Borrow<[Identifier]> + std::fmt::Debug> Statement<T> {\\n\\n /// Convenience function for unifying the expressions of two judgements (see\\n\\n /// [`Expression::unify`])\\n\\n ///\\n\\n /// # Errors\\n\\n /// * `JudgementMismatch` - if `self.judgement != other.judgement`\\n\\n /// * `VariableMismatch` or `OperatorMismatch` - if `self.expression.unify(other.expression)`\\n\\n /// fails\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\\n /// use attomath::Statement;\\n\\n /// use attomath::expression::{Expression, WholeSubstitution};\\n\\n /// use attomath::error::ProofError;\\n\",\n \"file_path\": \"src/statement.rs\",\n \"rank\": 87,\n \"score\": 11.453703735291695\n },\n {\n \"content\": \" use Either::*;\\n\\n match self {\\n\\n Left(expr) => expr.borrow(),\\n\\n Right(expr) => expr.borrow(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S: Substitution, T: Substitution> Substitution for ChainSubstitution<S, T> {\\n\\n type T = Either<S::T, T::T>;\\n\\n\\n\\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<Self::T>> {\\n\\n self.first\\n\\n .substitution_opt(id)\\n\\n .map(|s| Expression {\\n\\n data: Either::Left(s.data),\\n\\n })\\n\\n .or_else(|| {\\n\\n self.then.substitution_opt(id).map(|s| Expression {\\n\\n data: Either::Right(s.data),\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 88,\n \"score\": 11.414166383867926\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use std::num::Wrapping;\\n\\n\\n\\n use quickcheck::Arbitrary;\\n\\n\\n\\n use super::*;\\n\\n\\n\\n impl Arbitrary for Expression<Box<[Identifier]>> {\\n\\n fn arbitrary(g: &mut quickcheck::Gen) -> Self {\\n\\n loop {\\n\\n let data = Vec::<Identifier>::arbitrary(g).into_boxed_slice();\\n\\n if let Some(subexpression) = Expression::subexpression_check(&data, 0) {\\n\\n return Expression {\\n\\n data: subexpression.data.to_owned().into_boxed_slice(),\\n\\n };\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 89,\n \"score\": 11.413760661154265\n },\n {\n \"content\": \" Expression {\\n\\n data: self.data.borrow(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Create a expression from its prefix order encoding. This checks if the given sequence\\n\\n /// encodes a binary tree and returns `None` if it does not.\\n\\n pub fn from_raw(expr: T) -> Option<Self> {\\n\\n if Self::check(&expr) {\\n\\n Some(Expression { data: expr })\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n /// Convencience function to iterate over this expressions variables. May contain duplicates.\\n\\n pub fn variables<'a>(&'a self) -> impl Iterator<Item = Identifier> + 'a {\\n\\n self.data\\n\\n .borrow()\\n\\n .iter()\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 90,\n \"score\": 11.338666595262207\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n quickcheck! {\\n\\n fn unify_substitute(a: Expression<Box<[Identifier]>>, b: Expression<Box<[Identifier]>>) -> bool {\\n\\n let max_var = b.variables().max().unwrap_or(-1);\\n\\n let mut substitution =\\n\\n WholeSubstitution::with_capacity((Wrapping(max_var as usize) + Wrapping(1)).0);\\n\\n match a.unify(&b, &mut substitution) {\\n\\n Ok(()) => b.substitute(&substitution) == a,\\n\\n Err(_) => true\\n\\n }\\n\\n }\\n\\n\\n\\n fn from_raw_single_variable(a: Identifier) -> bool {\\n\\n if is_operator(a) {\\n\\n return true;\\n\\n }\\n\\n Expression::from_raw([a]).is_some()\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 91,\n \"score\": 11.3356105151545\n },\n {\n \"content\": \" Some(VariableSubstitution(variables))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S: Borrow<[Option<Identifier>]>> Substitution for VariableSubstitution<S> {\\n\\n type T = [Identifier; 1];\\n\\n\\n\\n fn substitution_opt(&self, id: Identifier) -> Option<Expression<[Identifier; 1]>> {\\n\\n self.0.borrow()[id as usize].map(|v| Expression { data: [v] })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 92,\n \"score\": 11.256168080772435\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn parse_arity<'a>(\\n\\n &self,\\n\\n arity: u8,\\n\\n input: &'a str,\\n\\n ) -> IResult<&'a str, Expression<Box<[Identifier]>>, GreedyError<&'a str>> {\\n\\n if arity == 0 {\\n\\n let (input, o) = map_opt(is_not(\\\" ),\\\"), |s| {\\n\\n self.operators\\n\\n .iter()\\n\\n .enumerate()\\n\\n .filter_map(|(i, (o, a))| if s == o && *a == 0 { Some(i) } else { None })\\n\\n .next()\\n\\n })(input)?;\\n\\n // TODO: remove unwrap\\n\\n Ok((\\n\\n input,\\n\\n Expression::from_raw(\\n\\n vec![-(o as Identifier) - 1, Identifier::MIN, Identifier::MIN]\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 93,\n \"score\": 11.055249210985252\n },\n {\n \"content\": \" pub(crate) fn standardize_range<R: RangeBounds<Identifier>>(\\n\\n &mut self,\\n\\n var_map: &mut [Option<Identifier>],\\n\\n next_var: &mut Identifier,\\n\\n range: R,\\n\\n ) {\\n\\n for symb in self.data.borrow_mut().iter_mut() {\\n\\n if !is_operator(*symb) && range.contains(symb) {\\n\\n let var = var_map[*symb as usize].unwrap_or_else(|| {\\n\\n let var = *next_var;\\n\\n var_map[*symb as usize] = Some(var);\\n\\n *next_var += 1;\\n\\n var\\n\\n });\\n\\n if range.contains(&var) {\\n\\n *symb = var;\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/expression.rs\",\n \"rank\": 94,\n \"score\": 10.718975466138811\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn parse_statement<'a>(\\n\\n &self,\\n\\n input: &'a str,\\n\\n ) -> IResult<&'a str, OwnedStatement, GreedyError<&'a str>> {\\n\\n let (input, judgement) = self.parse_judgement(input)?;\\n\\n let (input, _) = char(' ')(input)?;\\n\\n let (input, expression) = self.parse_expression(input)?;\\n\\n Ok((\\n\\n input,\\n\\n Statement {\\n\\n judgement,\\n\\n expression,\\n\\n },\\n\\n ))\\n\\n }\\n\\n\\n\\n pub fn format_dvr(&self, s: &mut String, dvr: &DVR) {\\n\\n let (a, b) = dvr.variables();\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 95,\n \"score\": 10.46962375979684\n },\n {\n \"content\": \" } else if is_operator(b) {\\n\\n Err(ProofError::DVRError(b))\\n\\n } else if a < b {\\n\\n Ok(DVR(a, b))\\n\\n } else if a > b {\\n\\n Ok(DVR(b, a))\\n\\n } else {\\n\\n Err(ProofError::DVRError(a))\\n\\n }\\n\\n }\\n\\n\\n\\n /// Uses the given `Substitution` to create new `DVR`s for each pair of variables in the new\\n\\n /// expressions for `self.variables()`.\\n\\n ///\\n\\n /// # Errors\\n\\n /// The `Iterator` will produce a `DVRError` if the substitutions for this `DVR`s' variables\\n\\n /// contains common variables\\n\\n ///\\n\\n /// # Example\\n\\n /// ```\\n\",\n \"file_path\": \"src/dvr.rs\",\n \"rank\": 96,\n \"score\": 10.187781094881979\n },\n {\n \"content\": \"use crate::types::*;\\n\\n\\n\\n/// An error which is produced when trying to proof something incorrect\\n\\n#[derive(Debug, PartialEq, Eq)]\\n\\npub enum ProofError {\\n\\n /// Error produced when trying to unify expressions with different operators (see\\n\\n /// [`Expression::unify`](../expression/struct.Expression.html#method.unify)). Contains the\\n\\n /// identifiers of the mismatched operators.\\n\\n OperatorMismatch(Identifier, Identifier),\\n\\n /// Error produced when trying to unify expressions where one variable would have to be\\n\\n /// substituted by different subexpressions (see\\n\\n /// [`Expression::unify`](../expression/struct.Expression.html#method.unify)). Contains the\\n\\n /// identifier for the variable and the mismatched subexpressions.\\n\\n VariableMismatch(Identifier, Box<[Identifier]>, Box<[Identifier]>),\\n\\n /// Error produced when trying to unify statements with different judgements (see\\n\\n /// [`Statement::unify`](../statement/struct.Statement.html#method.unify)). Contains the\\n\\n /// mismatched judgements.\\n\\n JudgementMismatch(Judgement, Judgement),\\n\\n /// Error produced when trying to create a theorem with conflicting dvrs (see\\n\\n /// [`DVR`](../dvr/struct.DVR.html)).\\n\\n DVRError(Identifier),\\n\\n}\\n\",\n \"file_path\": \"src/error.rs\",\n \"rank\": 97,\n \"score\": 10.16792745249586\n },\n {\n \"content\": \" }\\n\\n }\\n\\n Command::Judgement(judgement) => {\\n\\n fmt.add_judgement(judgement);\\n\\n }\\n\\n Command::Operator(operator, arity) => {\\n\\n fmt.add_operator(operator, arity);\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn parse<'a>(\\n\\n fmt: &Formatter,\\n\\n input: &'a str,\\n\\n ) -> Result<Self, nom::Err<GreedyError<&'a str>>> {\\n\\n let (_, command) = or_fail(all_consuming(alt((\\n\\n context(\\n\\n \\\"proof\\\",\\n\\n alt((\\n\",\n \"file_path\": \"src/serialization/command.rs\",\n \"rank\": 98,\n \"score\": 10.04767937919993\n },\n {\n \"content\": \" context(\\\"conclusion\\\", |input| self.parse_statement(input))(input)?;\\n\\n let (input, _) = eof(input)?;\\n\\n let mut dvrs = Vec::new();\\n\\n let mut assumptions = Vec::new();\\n\\n for (dvr, assumption) in dvrs_and_assumptions {\\n\\n if let Some(dvr) = dvr {\\n\\n dvrs.push(dvr);\\n\\n }\\n\\n if let Some(assumption) = assumption {\\n\\n assumptions.push(assumption);\\n\\n }\\n\\n }\\n\\n Ok((input, Theorem::new(conclusion, assumptions, dvrs)))\\n\\n },\\n\\n |input| {\\n\\n let (input, conclusion) =\\n\\n context(\\\"conclusion\\\", |input| self.parse_statement(input))(input)?;\\n\\n let (input, _) = eof(input)?;\\n\\n Ok((input, Theorem::new(conclusion, vec![], vec![])))\\n\\n },\\n\\n ))(input)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/serialization/formatter.rs\",\n \"rank\": 99,\n \"score\": 10.005722080770713\n }\n]","isConversational":false}}},{"rowIdx":793,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"socrates-core/src/service/registry.rs"},"repo_name":{"kind":"string","value":"ckaran/socrates-rs"},"commit":{"kind":"string","value":"450f364e38cf663367c36991a99cd8b689d76768"},"file_code":{"kind":"string","value":"use hashbrown::HashMap;\n\nuse super::*;\n\npub struct RegisteredService {\n core_props: ServiceCoreProps,\n type_id: TypeId,\n name: Arc<str>,\n owner_id: DynamodId,\n used_by_count: HashMap<DynamodId, u32>,\n service_object: Arc<dyn Service>, \n}\n\nimpl RegisteredService {\n pub fn make_service_ref(&self) -> ServiceRef {\n ServiceRef {\n core: self.core_props.clone(),\n name: (*(self.name)).into(),\n type_id: self.type_id,\n owner_id: self.owner_id,\n }\n }\n}\n\nimpl From<&RegisteredService> for ServiceRef {\n fn from(rs: &RegisteredService) -> ServiceRef {\n rs.make_service_ref()\n }\n}\n\nuse im::OrdSet;\n\n#[derive(Default)]\npub struct ServiceRegistry {\n curr_id: ServiceId,\n by_service_id: HashMap<ServiceId, RegisteredService>,\n by_name: HashMap<Arc<str>, OrdSet<ServiceCoreProps>>,\n by_type_id: HashMap<TypeId, OrdSet<ServiceCoreProps>>,\n zombies: HashMap<ServiceId, RegisteredService>,\n}\n\nimpl ServiceRegistry {\n pub fn new() -> ServiceRegistry {\n Default::default()\n }\n\n pub fn register_service(\n &mut self,\n svc_type_id: TypeId,\n svc_name: &str,\n service_object: Arc<dyn Service>,\n svc_ranking: ServiceRanking,\n owner_id: DynamodId,\n ) -> ServiceRef {\n let new_id = self.curr_id + 1;\n\n let service = RegisteredService {\n core_props: ServiceCoreProps {\n id: new_id,\n ranking: svc_ranking,\n },\n type_id: svc_type_id,\n name: svc_name.into(),\n owner_id,\n used_by_count: HashMap::new(),\n service_object,\n };\n\n let service_ref = service.make_service_ref();\n\n let svc_name = Arc::clone(&service.name);\n let svcs_using_name = self.by_name.entry(svc_name).or_insert(OrdSet::new());\n svcs_using_name.insert(service.core_props.clone());\n\n let svcs_using_type_id = self.by_type_id.entry(svc_type_id).or_insert(OrdSet::new());\n svcs_using_type_id.insert(service.core_props.clone());\n\n self.by_service_id.insert(new_id, service);\n\n self.curr_id = new_id;\n\n service_ref\n }\n\n pub fn unregister_service(&mut self, svc_id: ServiceId) -> Option<ServiceRef> {\n if let Some(rs) = self.by_service_id.remove(&svc_id) {\n self.by_name.remove(&rs.name).expect(\"unsynced registry!\");\n self.by_type_id\n .remove(&rs.type_id)\n .expect(\"unsynced registry!\");\n\n let svc_ref = rs.make_service_ref();\n\n \n if !rs.used_by_count.is_empty() {\n \n self.zombies.insert(svc_id, rs);\n } else {\n \n println!(\"Dropping service (no users): {:?}\", rs.make_service_ref());\n }\n\n Some(svc_ref)\n } else {\n None\n }\n }\n\n #[inline(always)]\n fn get_services_id(\n core_props: Option<&OrdSet<ServiceCoreProps>>,\n ) -> impl Iterator<Item = ServiceId> {\n core_props\n .cloned() \n .into_iter() \n .flat_map(OrdSet::into_iter) \n .map(|cp| cp.id) \n }\n\n pub fn get_services_id_by_name(&self, svc_name: &str) -> impl Iterator<Item = ServiceId> {\n ServiceRegistry::get_services_id(self.by_name.get(svc_name))\n }\n\n pub fn get_services_id_by_type_id(\n &self,\n svc_type_id: TypeId,\n ) -> impl Iterator<Item = ServiceId> {\n ServiceRegistry::get_services_id(self.by_type_id.get(&svc_type_id))\n }\n\n pub fn get_service_ref(&self, svc_id: ServiceId) -> Option<ServiceRef> {\n self.by_service_id\n .get(&svc_id)\n .map(|rs| rs.make_service_ref())\n }\n\n pub fn get_service_object(\n &mut self,\n svc_id: ServiceId,\n requestor: DynamodId,\n ) -> Option<Weak<dyn Service>> {\n self.by_service_id.get_mut(&svc_id).map(|rs| {\n let cr = rs.used_by_count.entry(requestor).or_insert(0);\n *cr = *cr + 1;\n Arc::downgrade(&rs.service_object)\n })\n }\n\n pub fn remove_use(&mut self, svc_id: ServiceId, user_id: DynamodId) {\n if let Some(rs) = self.by_service_id.get_mut(&svc_id) {\n if ServiceRegistry::decrement_use(rs, user_id) == Some(0) {\n rs.used_by_count.remove(&user_id);\n }\n\n self.by_name\n .get_mut(&rs.name)\n .map(|v| v.remove(&rs.core_props));\n } else if let Some(rs) = self.zombies.get_mut(&svc_id) {\n if ServiceRegistry::decrement_use(rs, user_id) == Some(0) {\n rs.used_by_count.remove(&user_id);\n\n \n if rs.used_by_count.is_empty() {\n \n println!(\"Dropping zombie service: {:?}\", rs.make_service_ref());\n self.zombies.remove(&svc_id);\n }\n }\n }\n }\n\n fn decrement_use(rs: &mut RegisteredService, owner_id: DynamodId) -> Option<u32> {\n rs.used_by_count.get_mut(&owner_id).map(|cr| {\n *cr = (*cr) - 1;\n *cr\n })\n }\n}\n"},"prefix":{"kind":"string","value":"use hashbrown::HashMap;\n\nuse super::*;\n\npub struct RegisteredService {\n core_props: ServiceCoreProps,\n type_id: TypeId,\n name: Arc<str>,\n owner_id: Dyn"},"suffix":{"kind":"string","value":" .expect(\"unsynced registry!\");\n\n let svc_ref = rs.make_service_ref();\n\n \n if !rs.used_by_count.is_empty() {\n \n self.zombies.insert(svc_id, rs);\n } else {\n \n println!(\"Dropping service (no users): {:?}\", rs.make_service_ref());\n }\n\n Some(svc_ref)\n } else {\n None\n }\n }\n\n #[inline(always)]\n fn get_services_id(\n core_props: Option<&OrdSet<ServiceCoreProps>>,\n ) -> impl Iterator<Item = ServiceId> {\n core_props\n .cloned() \n .into_iter() \n .flat_map(OrdSet::into_iter) \n .map(|cp| cp.id) \n }\n\n pub fn get_services_id_by_name(&self, svc_name: &str) -> impl Iterator<Item = ServiceId> {\n ServiceRegistry::get_services_id(self.by_name.get(svc_name))\n }\n\n pub fn get_services_id_by_type_id(\n &self,\n svc_type_id: TypeId,\n ) -> impl Iterator<Item = ServiceId> {\n ServiceRegistry::get_services_id(self.by_type_id.get(&svc_type_id))\n }\n\n pub fn get_service_ref(&self, svc_id: ServiceId) -> Option<ServiceRef> {\n self.by_service_id\n .get(&svc_id)\n .map(|rs| rs.make_service_ref())\n }\n\n pub fn get_service_object(\n &mut self,\n svc_id: ServiceId,\n requestor: DynamodId,\n ) -> Option<Weak<dyn Service>> {\n self.by_service_id.get_mut(&svc_id).map(|rs| {\n let cr = rs.used_by_count.entry(requestor).or_insert(0);\n *cr = *cr + 1;\n Arc::downgrade(&rs.service_object)\n })\n }\n\n pub fn remove_use(&mut self, svc_id: ServiceId, user_id: DynamodId) {\n if let Some(rs) = self.by_service_id.get_mut(&svc_id) {\n if ServiceRegistry::decrement_use(rs, user_id) == Some(0) {\n rs.used_by_count.remove(&user_id);\n }\n\n self.by_name\n .get_mut(&rs.name)\n .map(|v| v.remove(&rs.core_props));\n } else if let Some(rs) = self.zombies.get_mut(&svc_id) {\n if ServiceRegistry::decrement_use(rs, user_id) == Some(0) {\n rs.used_by_count.remove(&user_id);\n\n \n if rs.used_by_count.is_empty() {\n \n println!(\"Dropping zombie service: {:?}\", rs.make_service_ref());\n self.zombies.remove(&svc_id);\n }\n }\n }\n }\n\n fn decrement_use(rs: &mut RegisteredService, owner_id: DynamodId) -> Option<u32> {\n rs.used_by_count.get_mut(&owner_id).map(|cr| {\n *cr = (*cr) - 1;\n *cr\n })\n }\n}\n"},"middle":{"kind":"string","value":"amodId,\n used_by_count: HashMap<DynamodId, u32>,\n service_object: Arc<dyn Service>, \n}\n\nimpl RegisteredService {\n pub fn make_service_ref(&self) -> ServiceRef {\n ServiceRef {\n core: self.core_props.clone(),\n name: (*(self.name)).into(),\n type_id: self.type_id,\n owner_id: self.owner_id,\n }\n }\n}\n\nimpl From<&RegisteredService> for ServiceRef {\n fn from(rs: &RegisteredService) -> ServiceRef {\n rs.make_service_ref()\n }\n}\n\nuse im::OrdSet;\n\n#[derive(Default)]\npub struct ServiceRegistry {\n curr_id: ServiceId,\n by_service_id: HashMap<ServiceId, RegisteredService>,\n by_name: HashMap<Arc<str>, OrdSet<ServiceCoreProps>>,\n by_type_id: HashMap<TypeId, OrdSet<ServiceCoreProps>>,\n zombies: HashMap<ServiceId, RegisteredService>,\n}\n\nimpl ServiceRegistry {\n pub fn new() -> ServiceRegistry {\n Default::default()\n }\n\n pub fn register_service(\n &mut self,\n svc_type_id: TypeId,\n svc_name: &str,\n service_object: Arc<dyn Service>,\n svc_ranking: ServiceRanking,\n owner_id: DynamodId,\n ) -> ServiceRef {\n let new_id = self.curr_id + 1;\n\n let service = RegisteredService {\n core_props: ServiceCoreProps {\n id: new_id,\n ranking: svc_ranking,\n },\n type_id: svc_type_id,\n name: svc_name.into(),\n owner_id,\n used_by_count: HashMap::new(),\n service_object,\n };\n\n let service_ref = service.make_service_ref();\n\n let svc_name = Arc::clone(&service.name);\n let svcs_using_name = self.by_name.entry(svc_name).or_insert(OrdSet::new());\n svcs_using_name.insert(service.core_props.clone());\n\n let svcs_using_type_id = self.by_type_id.entry(svc_type_id).or_insert(OrdSet::new());\n svcs_using_type_id.insert(service.core_props.clone());\n\n self.by_service_id.insert(new_id, service);\n\n self.curr_id = new_id;\n\n service_ref\n }\n\n pub fn unregister_service(&mut self, svc_id: ServiceId) -> Option<ServiceRef> {\n if let Some(rs) = self.by_service_id.remove(&svc_id) {\n self.by_name.remove(&rs.name).expect(\"unsynced registry!\");\n self.by_type_id\n .remove(&rs.type_id)\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub trait Named {\n\n fn type_name() -> &'static str;\n\n}\n\n\n","file_path":"socrates-core/src/service/service.rs","rank":0,"score":67362.85685948143},{"content":"#[inline(always)]\n\npub fn service_name<T: Named + ?Sized>() -> &'static str {\n\n <T>::type_name()\n\n}\n\n\n","file_path":"socrates-core/src/service/service.rs","rank":1,"score":62405.19411250492},{"content":"#[inline(always)]\n\npub fn any_service_type_id() -> std::any::TypeId {\n\n service_type_id::<dyn Service>()\n\n}\n","file_path":"socrates-core/src/service/service.rs","rank":2,"score":48919.24868286117},{"content":"#[derive(Clone)]\n\nstruct MyListener;\n\n\n\nimpl EventListener<ServiceEvent> for MyListener {\n\n fn on_event(&self, event: &ServiceEvent) {\n\n println!(\"Received: {:?}\", event);\n\n }\n\n}\n\n\n","file_path":"socrates-launcher/src/main.rs","rank":3,"score":48743.35862885308},{"content":"struct ReferenceInfo {\n\n pub name: String,\n\n pub unqualified_svc_name: String,\n\n pub cardinality: Cardinality,\n\n pub policy: Policy,\n\n pub policy_option: PolicyOption,\n\n}\n\n\n","file_path":"socrates-macro/src/lib.rs","rank":4,"score":47757.52750554074},{"content":"struct ComponentRunner {}\n","file_path":"socrates-core/src/component/mod.rs","rank":5,"score":46837.819201474995},{"content":"//#[derive(Component)]\n\n//#[provide(Greeter)]\n\nstruct SimpleGreeter;\n\n\n\nimpl SimpleGreeter {\n\n fn new() -> SimpleGreeter {\n\n SimpleGreeter\n\n }\n\n}\n\n\n\nimpl Greeter for SimpleGreeter {\n\n fn greet(&self, req: &GreetRequest) -> String {\n\n let gr = match req.idiom {\n\n Idiom::Regular => \"Hello\",\n\n Idiom::Formal => \"Greetings to you, \",\n\n Idiom::Slang => \"Yo\",\n\n };\n\n format!(\"{} {}\", gr, req.who).into()\n\n }\n\n}\n\n\n\nuse socrates::service::Service;\n","file_path":"examples/example-provider/src/lib.rs","rank":6,"score":46837.819201474995},{"content":"struct DynamodLib {\n\n id: DynamodId,\n\n lib: libloading::Library, // must be last to be dropped last\n\n}\n\nimpl DynamodLib {\n\n pub fn new(id: DynamodId, lib: libloading::Library) -> DynamodLib {\n\n DynamodLib { id, lib }\n\n }\n\n}\n\nimpl Drop for DynamodLib {\n\n fn drop(&mut self) {\n\n println!(\"Dropping dynamod #{}\", self.id);\n\n }\n\n}\n","file_path":"socrates-core/src/module/dynamod.rs","rank":7,"score":46837.819201474995},{"content":" #[service_trait]\n\n pub trait Greeter {\n\n fn greet(&self, who: &str) -> String;\n\n }\n\n\n\n struct FormalGreeter;\n\n impl Greeter for FormalGreeter {\n\n fn greet(&self, who: &str) -> String {\n\n format!(\"{} {}\", \"Hello\", who)\n\n }\n\n }\n\n impl FormalGreeter {\n\n fn new() -> FormalGreeter {\n\n FormalGreeter\n\n }\n\n }\n\n\n\n impl Service for FormalGreeter {}\n\n\n\n query_interface::interfaces!(FormalGreeter: Greeter);\n\n\n","file_path":"socrates-test/src/lib.rs","rank":8,"score":41681.212557280815},{"content":"pub trait Lifecycle {\n\n fn on_start(&self) {}\n\n}\n\n\n\nuse hashbrown::HashMap;\n\n\n\npub struct ComponentManagerHandler {\n\n manager: Listener<ComponentManager, ServiceEvent>,\n\n}\n\n\n\nimpl Activator for ComponentManagerHandler {}\n\n\n\nimpl ComponentManagerHandler {\n\n pub fn start(\n\n context: &ModuleContext,\n\n mut manager: ComponentManager,\n\n ) -> Result<ComponentManagerHandler> {\n\n manager.set_context(context);\n\n\n\n let active_manager = context.register_listener(Listener::new(manager))?;\n","file_path":"socrates-core/src/component/mod.rs","rank":9,"score":40779.88515097778},{"content":" #[service_trait]\n\n pub trait Greeter {\n\n fn greet(&self, req: &GreetRequest) -> String;\n\n }\n\n\n\n}\n","file_path":"examples/example-api/src/lib.rs","rank":10,"score":40779.88515097778},{"content":"#[inline(always)]\n\npub fn service_type_id<T: ?Sized + std::any::Any>() -> std::any::TypeId {\n\n std::any::TypeId::of::<T>()\n\n}\n\n\n","file_path":"socrates-core/src/service/service.rs","rank":11,"score":40157.44471431991},{"content":"pub trait Activator: Send {}\n","file_path":"socrates-core/src/module/activator.rs","rank":12,"score":38709.51165400771},{"content":"pub trait Factory<Source>: Sized {\n\n fn build(from: Source) -> Option<Self>;\n\n}\n\n\n\nimpl<T: Service + ?Sized> Factory<&ModuleContext> for Svc<T> {\n\n fn build(ctx: &ModuleContext) -> Option<Self> {\n\n ctx.get_first_service_typed::<T>()\n\n }\n\n}\n\n\n\nimpl<T: Service + ?Sized> Factory<&ModuleContext> for Option<Svc<T>> {\n\n fn build(ctx: &ModuleContext) -> Option<Self> {\n\n Some(ctx.get_first_service_typed::<T>())\n\n }\n\n}\n\n\n\nimpl<T: Service + ?Sized> Factory<&ModuleContext> for Vec<Svc<T>> {\n\n fn build(ctx: &ModuleContext) -> Option<Self> {\n\n Some(ctx.get_all_services_typed::<T>())\n\n }\n","file_path":"socrates-core/src/component/factory.rs","rank":13,"score":36880.08747402231},{"content":"pub trait Update<Source>: Sized {\n\n fn update(&self, ctx: Source) -> Option<()>;\n\n}\n\n\n\nimpl<U, T: Factory<U>> Update<U> for parking_lot::Mutex<T> {\n\n fn update(&self, ctx: U) -> Option<()> {\n\n let new_value = T::build(ctx)?;\n\n let mut this = self.lock();\n\n *this = new_value;\n\n Some(())\n\n }\n\n}\n","file_path":"socrates-core/src/component/factory.rs","rank":14,"score":36880.08747402231},{"content":"#[no_mangle]\n\nfn activate(ctx: Context) -> Result<Box<dyn Activator>> {\n\n println!(\"I'm started (consumer)\");\n\n // panic!(\"shoudln't segfault!\");\n\n println!(\n\n \"My Component def: {:?}\",\n\n <MyConsumer as Component>::get_definition()\n\n );\n\n\n\n let cm = ComponentManager::new().add_component::<MyConsumer>();\n\n let cmh = ComponentManagerHandler::start(&ctx, cm)?;\n\n\n\n Ok(cmh.boxed())\n\n\n\n // srv: Svc<dyn Greeter>, our only way to use the service\n\n // it cannot be cloned, you must move it or request another\n\n // instance from the framework!\n\n // if let Some(srv) = ctx.get_service_typed::<Greeter>() {\n\n // let c = MyConsumer::new(ctx.clone(), srv);\n\n\n\n // // let cm: MyConsumer = Component::instantiate();\n","file_path":"examples/example-consumer/src/lib.rs","rank":15,"score":36135.446860171214},{"content":"pub trait ComponentControllerT: Send + Sync {\n\n fn set_context(&mut self, context: &ModuleContext);\n\n fn query_registry(&self);\n\n fn on_service_event(&self, event: &ServiceEvent);\n\n fn print_status(&self);\n\n}\n\n\n\nimpl<T: Component> ComponentController<T> {\n\n pub fn new(\n\n definition: ComponentDefinition,\n\n instantiate: fn(&ModuleContext, &ComponentReferences) -> Option<T>,\n\n ) -> ComponentController<T> {\n\n ComponentController {\n\n context: None,\n\n definition,\n\n instantiate,\n\n references: RwLock::new(ComponentReferences::new()),\n\n instances: RwLock::new(Vec::new()),\n\n }\n\n }\n","file_path":"socrates-core/src/component/mod.rs","rank":16,"score":35440.5111545482},{"content":"pub trait Service: Object + Send + Sync {}\n\nmopo!(Service);\n\n\n","file_path":"socrates-core/src/service/service.rs","rank":17,"score":35246.664745168324},{"content":"pub trait EventListener<E>: Send + Sync {\n\n fn on_event(&self, event: &E);\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct Listener<T: EventListener<E>, E> {\n\n event_listener: Arc<T>,\n\n _phantom: std::marker::PhantomData<E>,\n\n}\n\n\n\nimpl<T: EventListener<E>, E> Listener<T, E> {\n\n pub fn new(sel: T) -> Listener<T, E> {\n\n Listener {\n\n event_listener: Arc::new(sel),\n\n _phantom: std::marker::PhantomData,\n\n }\n\n }\n\n}\n\n\n\nimpl<T: EventListener<E>, E> Deref for Listener<T, E> {\n","file_path":"socrates-core/src/common/listener.rs","rank":18,"score":34548.80918863656},{"content":"#[proc_macro_derive(Component, attributes(provide, custom_lifecycle))]\n\npub fn component(input: TokenStream) -> TokenStream {\n\n let input = parse_macro_input!(input as DeriveInput);\n\n\n\n let mut references = Vec::new();\n\n if let syn::Data::Struct(ref struct_def) = input.data {\n\n for f in struct_def.fields.iter() {\n\n if let syn::Type::Path(ref path) = &f.ty {\n\n let p = &path.path;\n\n println!(\"base path {:?}\", f.ident);\n\n\n\n for seg in p.segments.iter() {\n\n println!(\"segment {:?}\", seg.ident.to_string());\n\n if let syn::PathArguments::AngleBracketed(ref type_params) = seg.arguments {\n\n for arg in type_params.args.iter() {\n\n if let syn::GenericArgument::Type(tpe) = arg {\n\n if let syn::Type::TraitObject(trait_obj) = tpe {\n\n for bound in trait_obj.bounds.iter() {\n\n if let syn::TypeParamBound::Trait(ref trt) = bound {\n\n for trt_seg in trt.path.segments.iter() {\n\n println!(\"trait {:?}\", trt_seg.ident.to_string());\n","file_path":"socrates-macro/src/lib.rs","rank":19,"score":34548.80918863656},{"content":"pub trait ServiceEventListener: EventListener<ServiceEvent> {}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub enum ServiceEvent {\n\n ServiceRegistered(ServiceRef),\n\n ServiceModified(ServiceRef),\n\n ServiceUnregistered(ServiceRef),\n\n}\n\n\n\nimpl ServiceEvent {\n\n pub fn get_service_ref(&self) -> &ServiceRef {\n\n match self {\n\n ServiceEvent::ServiceRegistered(ref rfe)\n\n | ServiceEvent::ServiceModified(ref rfe)\n\n | ServiceEvent::ServiceUnregistered(ref rfe) => rfe,\n\n }\n\n }\n\n}\n","file_path":"socrates-core/src/service/event.rs","rank":20,"score":34161.699703238715},{"content":"// Not a trait object\n\npub trait Component: Lifecycle + Sized + Send + Sync {\n\n fn get_definition() -> ComponentDefinition;\n\n fn instantiate(context: &ModuleContext, references: &ComponentReferences) -> Option<Self>;\n\n fn update(\n\n &self,\n\n field_id: usize,\n\n context: &ModuleContext,\n\n references: &ComponentReferences,\n\n ) -> Option<()>;\n\n}\n\n\n","file_path":"socrates-core/src/component/mod.rs","rank":21,"score":33775.51981124911},{"content":"#[proc_macro_attribute]\n\npub fn service_trait(_attr: TokenStream, item: TokenStream) -> TokenStream {\n\n let mut input: syn::ItemTrait = parse_macro_input!(item);\n\n\n\n let svc_trait_path: syn::Path = syn::parse_str(\"socrates::service::Service\").unwrap();\n\n\n\n let svc_trait_bound = syn::TraitBound {\n\n paren_token: None,\n\n modifier: syn::TraitBoundModifier::None,\n\n lifetimes: None,\n\n path: svc_trait_path,\n\n };\n\n\n\n input\n\n .supertraits\n\n .push(syn::TypeParamBound::Trait(svc_trait_bound));\n\n\n\n let trait_name = &input.ident;\n\n let trait_name_as_string = trait_name.to_string();\n\n\n\n let expanded = quote! {\n","file_path":"socrates-macro/src/lib.rs","rank":22,"score":30676.160894148994},{"content":"pub fn build<Source, Provided: Into<Source>, T: Factory<Source>>(from: Provided) -> Option<T> {\n\n T::build(from.into())\n\n}\n\n\n","file_path":"socrates-core/src/component/factory.rs","rank":23,"score":27375.47904488824},{"content":"type ComponentName = String;\n\npub struct ComponentManager {\n\n // config: String // TODO JSon\n\n components: HashMap<ComponentName, Box<dyn ComponentControllerT>>,\n\n}\n\nimpl ComponentManager {\n\n pub fn new() -> ComponentManager {\n\n ComponentManager {\n\n components: HashMap::new(),\n\n }\n\n }\n\n\n\n pub fn add_component<T: Component + 'static>(mut self) -> ComponentManager {\n\n let def = <T as Component>::get_definition();\n\n let component_name = def.name.clone();\n\n let f = <T as Component>::instantiate;\n\n let cc = ComponentController::new(def, f);\n\n self.components.insert(component_name, Box::new(cc));\n\n ComponentManager {\n\n components: self.components,\n","file_path":"socrates-core/src/component/mod.rs","rank":24,"score":25720.397405277858},{"content":"use super::*;\n\n\n\npub type ActivateFn = fn(Context) -> Result<Box<dyn Activator>>;\n\n\n","file_path":"socrates-core/src/module/activator.rs","rank":25,"score":11.246774828859433},{"content":"// WIP experimenting\n\n// Playground for service components\n\n\n\npub use self::definition::*;\n\nuse super::common::*;\n\nuse super::module::Context as ModuleContext;\n\nuse super::module::*;\n\nuse super::service::*;\n\nuse std::ops::Deref;\n\n\n\npub mod definition;\n\npub mod factory;\n\n\n\npub struct Context {\n\n pub module_context: ModuleContext,\n\n}\n\n\n\n// Not a trait object\n","file_path":"socrates-core/src/component/mod.rs","rank":27,"score":10.26781213223404},{"content":"use super::common::*;\n\nuse super::service::*;\n\nuse parking_lot::Mutex;\n\nuse std::any::TypeId;\n\nuse std::sync::{Arc, Weak};\n\n\n\nmod activator;\n\nmod container;\n\nmod context;\n\nmod dynamod;\n\n\n\npub use super::Result;\n\npub type DynamodId = u32;\n\npub use self::activator::ActivateFn;\n\npub use self::activator::Activator;\n\npub use self::container::Container;\n\npub use self::context::Context;\n\npub use self::dynamod::Dynamod;\n","file_path":"socrates-core/src/module/mod.rs","rank":28,"score":9.844808895491244},{"content":"pub use self::reference::ServiceCoreProps;\n\npub use self::reference::ServiceRanking;\n\npub use self::reference::ServiceRef;\n\npub use self::registration::ServiceRegistration;\n\npub use self::registry::ServiceRegistry;\n\npub use self::service::any_service_type_id;\n\npub use self::service::service_name;\n\npub use self::service::service_type_id;\n\npub use self::service::Named;\n\npub use self::service::Service;\n\npub use self::service::ServiceId;\n\npub use self::svc::Svc;\n","file_path":"socrates-core/src/service/mod.rs","rank":29,"score":9.48209495181265},{"content":"use super::super::service::query::ServiceQuery;\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\n\npub struct ComponentDefinition {\n\n pub name: String,\n\n pub provides: Vec<Provide>,\n\n pub references: Vec<Reference>,\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\n\npub struct Provide {\n\n pub name: String,\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub struct Reference {\n\n pub name: String,\n\n pub svc_name: String, // This is just for human-readability\n\n pub svc_query: ServiceQuery,\n\n pub options: ReferenceOptions,\n","file_path":"socrates-core/src/component/definition.rs","rank":30,"score":9.31691824967627},{"content":"use parking_lot::RwLock;\n\nuse std::any::TypeId;\n\nuse std::sync::{Arc, Weak};\n\n\n\nmod event;\n\nmod manager;\n\npub mod query;\n\nmod reference;\n\nmod registration;\n\nmod registry;\n\nmod service;\n\nmod svc;\n\n\n\nuse super::common::*;\n\nuse super::module::*;\n\n\n\npub use self::event::ServiceEvent;\n\npub use self::event::ServiceEventListener;\n\npub use self::manager::ServiceManager;\n\npub use self::query::ServiceQuery;\n","file_path":"socrates-core/src/service/mod.rs","rank":31,"score":8.96718071730502},{"content":" pub fn register_service(\n\n &self,\n\n type_id: std::any::TypeId,\n\n svc_name: &str,\n\n svc_ranking: ServiceRanking,\n\n svc: Box<dyn Service>,\n\n ) -> Result<ServiceRegistration> {\n\n let svc_manager = self.use_manager_or_fail()?;\n\n\n\n let service_ref =\n\n svc_manager.register_service(type_id, svc_name, svc_ranking, self.dynamod_id, svc)?;\n\n\n\n let srv_reg = ServiceRegistration::new(service_ref, self.shared_service_manager());\n\n\n\n Ok(srv_reg)\n\n }\n\n\n\n pub fn register_service_typed<T: Service + Named + ?Sized>(\n\n &self,\n\n svc: Box<dyn Service>,\n","file_path":"socrates-core/src/module/context.rs","rank":32,"score":8.184611245911682},{"content":"use super::*;\n\n\n\npub struct Dynamod {\n\n pub id: DynamodId,\n\n pub path: String,\n\n activator: Option<Box<dyn Activator>>,\n\n svc_manager: Weak<ServiceManager>,\n\n lib: DynamodLib, // must be last to be dropped last\n\n}\n\n\n\nimpl Dynamod {\n\n pub fn new(\n\n id: DynamodId,\n\n svc_manager: Weak<ServiceManager>,\n\n path: &str,\n\n lib: libloading::Library,\n\n ) -> Dynamod {\n\n Dynamod {\n\n id,\n\n path: path.to_owned(),\n","file_path":"socrates-core/src/module/dynamod.rs","rank":33,"score":7.799207322330391},{"content":"use super::*;\n\n\n\npub type ServiceRanking = i32;\n\n\n\n/// Total ordering between two services\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub struct ServiceCoreProps {\n\n pub ranking: ServiceRanking,\n\n pub id: ServiceId,\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub struct ServiceRef {\n\n pub core: ServiceCoreProps,\n\n pub name: String,\n\n pub type_id: TypeId,\n\n pub owner_id: DynamodId,\n\n}\n","file_path":"socrates-core/src/service/reference.rs","rank":34,"score":7.70866785642843},{"content":"use super::*;\n\n\n\nuse super::super::module::Context as ModuleContext;\n\nuse super::Context as ComponentContext;\n\n\n","file_path":"socrates-core/src/component/factory.rs","rank":35,"score":7.687994008662652},{"content":"\n\n // By Name\n\n pub fn get_services_id_by_name(&self, svc_name: &str) -> impl Iterator<Item = ServiceId> {\n\n self.registry.read().get_services_id_by_name(svc_name)\n\n }\n\n pub fn get_services_ref_by_name(\n\n &self,\n\n svc_name: &str,\n\n ) -> impl Iterator<Item = ServiceRef> + '_ {\n\n self.registry\n\n .read()\n\n .get_services_id_by_name(svc_name)\n\n .flat_map(move |svc_id| self.registry.read().get_service_ref(svc_id))\n\n }\n\n\n\n pub fn get_services_by_name(\n\n &self,\n\n svc_name: &str,\n\n user_id: DynamodId,\n\n ) -> impl Iterator<Item = (ServiceId, Weak<dyn Service>)> + '_ {\n","file_path":"socrates-core/src/service/manager.rs","rank":36,"score":7.261717928234164},{"content":"extern crate socrates_core;\n\n\n\npub use socrates_core::*;\n\npub mod common {\n\n pub use socrates_core::common::*;\n\n}\n\n\n\npub mod module {\n\n pub use socrates_core::module::*;\n\n}\n\npub mod service {\n\n pub use socrates_core::service::*;\n\n}\n\n\n\npub mod component {\n\n pub use socrates_core::component::*;\n\n}\n\n\n\nextern crate socrates_macro;\n\npub use socrates_macro::*;\n","file_path":"socrates/src/lib.rs","rank":38,"score":6.960550987016237},{"content":"pub mod listener;\n\n\n\npub use self::listener::EventListener;\n\npub use self::listener::Listener;\n\npub use self::listener::WeakListener;\n","file_path":"socrates-core/src/common/mod.rs","rank":39,"score":6.879480825937172},{"content":" self.registry\n\n .read()\n\n .get_services_id_by_name(svc_name)\n\n .flat_map(move |svc_id| {\n\n self.get_service_object(svc_id, user_id)\n\n .map(|svc_obj| (svc_id, svc_obj))\n\n })\n\n }\n\n\n\n pub fn remove_use(&self, svc_id: ServiceId, user_id: DynamodId) {\n\n self.registry.write().remove_use(svc_id, user_id);\n\n }\n\n}\n\n\n\nuse im::vector::Vector;\n\n\n\n#[derive(Default, Clone)]\n\npub struct ServiceListeners {\n\n listeners: Vector<WeakListener<ServiceEvent>>,\n\n}\n","file_path":"socrates-core/src/service/manager.rs","rank":40,"score":6.808631867671075},{"content":"use super::*;\n\n\n","file_path":"socrates-core/src/service/event.rs","rank":41,"score":6.765785078755799},{"content":"use super::*;\n\n\n\n#[derive(Clone)]\n\npub struct Context {\n\n dynamod_id: DynamodId,\n\n svc_manager: Weak<ServiceManager>,\n\n}\n\n\n\nimpl Context {\n\n pub fn new(dynamod_id: DynamodId, svc_manager: Weak<ServiceManager>) -> Context {\n\n Context {\n\n dynamod_id,\n\n svc_manager,\n\n }\n\n }\n\n\n\n pub fn use_manager_or_fail(&self) -> Result<Arc<ServiceManager>> {\n\n self.svc_manager\n\n .upgrade()\n\n .ok_or(\"Socrates container is down.\".into())\n","file_path":"socrates-core/src/module/context.rs","rank":42,"score":6.716761351363151},{"content":"// WIP experimenting\n\n// Playground for better service queries (filters), service tracking and multi-service tracking\n\nuse super::*;\n\n\n\n#[derive(Debug, PartialEq, Eq, Ord, PartialOrd, Hash)]\n\npub enum ServiceQuery<T: Service + ?Sized = dyn Service> {\n\n ServiceId(ServiceId),\n\n Name(String),\n\n TypeId(TypeQuery<T>), // TODO add combinators And, Or, Not and property matchers.\n\n}\n\n\n\n// Must be implemented manually to ignore the fact that !(T: Clone)\n\nimpl<T: Service + ?Sized> Clone for ServiceQuery<T> {\n\n fn clone(&self) -> ServiceQuery<T> {\n\n match self {\n\n ServiceQuery::ServiceId(id) => ServiceQuery::ServiceId(*id),\n\n ServiceQuery::Name(s) => ServiceQuery::Name(s.clone()),\n\n ServiceQuery::TypeId(tq) => ServiceQuery::TypeId(tq.clone()),\n\n }\n\n }\n","file_path":"socrates-core/src/service/query.rs","rank":43,"score":6.68173262896318},{"content":" }\n\n\n\n #[inline(always)]\n\n pub fn by_name(s: String) -> ServiceQuery {\n\n ServiceQuery::Name(s)\n\n }\n\n\n\n #[inline(always)]\n\n pub fn by_type_id(s: TypeId) -> ServiceQuery {\n\n let tq: TypeQuery = <TypeQuery<dyn Service>>::raw(s);\n\n ServiceQuery::TypeId(tq)\n\n }\n\n\n\n #[inline(always)]\n\n pub fn by_type<T: Service + ?Sized>() -> ServiceQuery<T> {\n\n ServiceQuery::TypeId(<TypeQuery<T>>::by_type::<T>())\n\n }\n\n\n\n pub fn matches(&self, e: &ServiceRef) -> bool {\n\n match self {\n\n ServiceQuery::ServiceId(id) => e.core.id == *id,\n\n ServiceQuery::Name(s) => e.name == *s,\n\n ServiceQuery::TypeId(tq) => e.type_id == tq.type_id,\n\n }\n\n }\n\n}\n","file_path":"socrates-core/src/service/query.rs","rank":44,"score":6.555472093423423},{"content":"use super::*;\n\n\n\npub struct Svc<T: Service + ?Sized = dyn Service> {\n\n // Options are implementation details -- must be built with values\n\n service: Option<Weak<T>>,\n\n svc_manager: Weak<ServiceManager>,\n\n service_id: ServiceId,\n\n user_id: DynamodId,\n\n}\n\n\n\nimpl<T: Service + ?Sized> Svc<T> {\n\n pub fn new(\n\n service: Weak<T>,\n\n service_id: ServiceId,\n\n user_id: DynamodId,\n\n svc_manager: Weak<ServiceManager>,\n\n ) -> Svc<T> {\n\n Svc {\n\n service: Some(service),\n\n svc_manager,\n","file_path":"socrates-core/src/service/svc.rs","rank":45,"score":6.4150872648259964},{"content":" // #[derive(Component)]\n\n struct GreetPrinter {\n\n greeter: Svc<dyn Greeter>,\n\n }\n\n impl GreetPrinter {\n\n pub fn print_greet(&self) {\n\n println!(\"{}\", self.greeter.greet(\"world\"));\n\n }\n\n }\n\n\n\n #[test]\n\n fn test_foo() {\n\n let formal_greeter_def = ComponentDefinition {\n\n name: \"FormalGreeter\".into(),\n\n provides: vec![Provide {\n\n name: \"Greeter\".into(),\n\n }],\n\n ..Default::default()\n\n };\n\n\n","file_path":"socrates-test/src/lib.rs","rank":46,"score":6.412715761496447},{"content":"#[macro_use]\n\nextern crate socrates;\n\n\n\npub mod greet {\n\n use socrates::service::Service;\n\n use socrates::service_trait;\n\n\n\n #[derive(Clone, Debug)]\n\n pub enum Idiom {\n\n Formal,\n\n Regular,\n\n Slang,\n\n }\n\n\n\n #[derive(Clone, Debug)]\n\n pub struct GreetRequest {\n\n pub who: String,\n\n pub idiom: Idiom,\n\n }\n\n\n\n #[service_trait]\n","file_path":"examples/example-api/src/lib.rs","rank":48,"score":6.218950723452656},{"content":"use super::*;\n\n\n\n#[derive(Default)]\n\npub struct Container {\n\n svc_manager: Arc<ServiceManager>, // the \"master\" strong ref\n\n modules: Mutex<Vec<Dynamod>>,\n\n zombie_modules: Mutex<Vec<Dynamod>>,\n\n}\n\n\n\nimpl Container {\n\n pub fn new() -> Container {\n\n Default::default()\n\n }\n\n\n\n fn shared_service_manager(&self) -> Weak<ServiceManager> {\n\n Arc::downgrade(&self.svc_manager)\n\n }\n\n\n\n pub fn install(&self, path: &str) -> Result<()> {\n\n let mut mods = self.modules.lock();\n","file_path":"socrates-core/src/module/container.rs","rank":49,"score":6.063754660443962},{"content":" // Get by name\n\n\n\n pub fn get_first_service_id_by_name(&self, svc_name: &str) -> Option<ServiceId> {\n\n let svc_manager = self.try_manager()?;\n\n\n\n svc_manager.get_services_id_by_name(svc_name).next()\n\n }\n\n\n\n pub fn get_all_services_id_by_name(&self, svc_name: &str) -> Vec<ServiceId> {\n\n self.try_manager()\n\n .into_iter()\n\n .flat_map(|svc_manager| svc_manager.get_services_id_by_name(svc_name))\n\n .collect()\n\n }\n\n\n\n pub fn get_first_service_ref_by_name(&self, svc_name: &str) -> Option<ServiceRef> {\n\n let svc_manager = self.try_manager()?;\n\n\n\n let s = svc_manager.get_services_ref_by_name(&svc_name).next();\n\n\n","file_path":"socrates-core/src/module/context.rs","rank":50,"score":5.969030794002364},{"content":" }\n\n }\n\n\n\n // Register\n\n\n\n pub fn register_service(\n\n &self,\n\n svc_type_id: TypeId,\n\n svc_name: &str,\n\n svc_ranking: ServiceRanking,\n\n owner_id: DynamodId,\n\n svc: Box<dyn Service>,\n\n ) -> Result<ServiceRef> {\n\n let service_ref = self.registry.write().register_service(\n\n svc_type_id,\n\n svc_name,\n\n svc.into(),\n\n svc_ranking,\n\n owner_id,\n\n );\n","file_path":"socrates-core/src/service/manager.rs","rank":51,"score":5.965953589591819},{"content":" s\n\n }\n\n\n\n pub fn get_all_services_ref_by_name(&self, svc_name: &str) -> Vec<ServiceRef> {\n\n let mut s: Vec<ServiceRef> = Vec::new();\n\n\n\n for svc_manager in self.try_manager() {\n\n for x in svc_manager.get_services_ref_by_name(svc_name) {\n\n s.push(x);\n\n }\n\n }\n\n\n\n s\n\n }\n\n\n\n pub fn get_first_service_by_name(&self, svc_name: &str) -> Option<Svc> {\n\n let svc_manager = self.try_manager()?;\n\n\n\n let s = svc_manager\n\n .get_services_by_name(svc_name, self.dynamod_id)\n","file_path":"socrates-core/src/module/context.rs","rank":52,"score":5.813647349179233},{"content":" _ctx: socrates::module::Context,\n\n greeter: Svc<dyn Greeter>,\n\n maybe_greeter: Option<Svc<dyn Greeter>>,\n\n greeters: Vec<Svc<dyn Greeter>>,\n\n dyn_greeter: Mutex<Svc<dyn Greeter>>,\n\n dyn_maybe_greeter: Mutex<Option<Svc<dyn Greeter>>>,\n\n dyn_greeters: Mutex<Vec<Svc<dyn Greeter>>>,\n\n\n\n}\n\n\n\nimpl MyConsumer {\n\n // pub fn new(_ctx: Context, greeter: Svc<dyn Greeter>) -> MyConsumer {\n\n // MyConsumer { _ctx, greeter }\n\n // }\n\n pub fn do_it(&self, req: &GreetRequest) -> String {\n\n self.greeter.greet(req)\n\n }\n\n}\n\n\n\nimpl Lifecycle for MyConsumer {\n","file_path":"examples/example-consumer/src/lib.rs","rank":53,"score":5.7707807752846},{"content":"use super::*;\n\n\n\n#[derive(Default)]\n\npub struct ServiceManager {\n\n pub registry: RwLock<ServiceRegistry>,\n\n pub listeners: RwLock<ServiceListeners>,\n\n}\n\n\n\nimpl ServiceManager {\n\n pub fn register_listener(&self, listener: WeakListener<ServiceEvent>) {\n\n let mut listeners = self.listeners.write();\n\n\n\n listeners.insert_listener(listener);\n\n }\n\n\n\n pub fn unregister_service(&self, svc_id: ServiceId) {\n\n let mb_ref = self.registry.write().unregister_service(svc_id);\n\n\n\n if let Some(service_ref) = mb_ref {\n\n self.fire_event(&ServiceEvent::ServiceUnregistered(service_ref.clone()));\n","file_path":"socrates-core/src/service/manager.rs","rank":54,"score":5.670772839329551},{"content":"use super::*;\n\n\n\npub struct ServiceRegistration {\n\n pub svc_ref: ServiceRef,\n\n svc_manager: Weak<ServiceManager>,\n\n}\n\n\n\nimpl ServiceRegistration {\n\n pub fn new(svc_ref: ServiceRef, svc_manager: Weak<ServiceManager>) -> ServiceRegistration {\n\n ServiceRegistration {\n\n svc_ref,\n\n svc_manager,\n\n }\n\n }\n\n}\n\n\n\nimpl Drop for ServiceRegistration {\n\n fn drop(&mut self) {\n\n if let Some(svc_manager) = self.svc_manager.upgrade() {\n\n svc_manager.unregister_service(self.svc_ref.core.id);\n\n }\n\n }\n\n}\n","file_path":"socrates-core/src/service/registration.rs","rank":55,"score":5.619798102985365},{"content":"use query_interface::{mopo, Object};\n\n\n\npub type ServiceId = u32;\n\n\n","file_path":"socrates-core/src/service/service.rs","rank":56,"score":5.434270918704012},{"content":" options: socrates::component::definition::ReferenceOptions {\n\n cardinality: #card,\n\n policy: #pol,\n\n policy_option: #pol_opt\n\n }\n\n }\n\n });\n\n }\n\n\n\n let service_trait = if provided.is_empty() {\n\n None\n\n } else {\n\n Some(quote! {\n\n use socrates::service::Service;\n\n impl Service for #struct_name {}\n\n\n\n #[macro_use]\n\n extern crate query_interface;\n\n interfaces!(#struct_name: #(#provided),*);\n\n\n","file_path":"socrates-macro/src/lib.rs","rank":57,"score":5.420155161837776},{"content":"\n\n self.get_all_services_by_type_id_typed(svc_type_id)\n\n }\n\n\n\n pub fn get_first_service_by_name_typed<T: Service + ?Sized>(\n\n &self,\n\n svc_name: &str,\n\n ) -> Option<Svc<T>> {\n\n self.get_first_service_by_name(svc_name)\n\n .and_then(|svc| Svc::cast::<T>(svc).ok())\n\n }\n\n\n\n pub fn get_all_services_by_name_typed<T: Service + ?Sized>(\n\n &self,\n\n svc_name: &str,\n\n ) -> Vec<Svc<T>> {\n\n let mut s: Vec<Svc<T>> = Vec::new();\n\n\n\n for svc_manager in self.try_manager() {\n\n for x in svc_manager.get_services_by_name(svc_name, self.dynamod_id) {\n","file_path":"socrates-core/src/module/context.rs","rank":58,"score":5.417527122682838},{"content":" .map(|x| Svc::new(x.1, x.0, self.dynamod_id, self.shared_service_manager()))\n\n .next();\n\n\n\n s\n\n }\n\n\n\n pub fn get_all_services_by_name(&self, svc_name: &str) -> Vec<Svc> {\n\n let mut s: Vec<Svc> = Vec::new();\n\n\n\n for svc_manager in self.try_manager() {\n\n for x in svc_manager.get_services_by_name(svc_name, self.dynamod_id) {\n\n s.push(Svc::new(\n\n x.1,\n\n x.0,\n\n self.dynamod_id,\n\n self.shared_service_manager(),\n\n ));\n\n }\n\n }\n\n\n","file_path":"socrates-core/src/module/context.rs","rank":61,"score":4.832561850647864},{"content":" let id = (*mods).len() as u32;\n\n let lib = libloading::Library::new(path)?;\n\n\n\n let dyn_mod = Dynamod::new(id, self.shared_service_manager(), path, lib);\n\n mods.push(dyn_mod);\n\n\n\n Ok(())\n\n }\n\n\n\n pub fn uninstall(&self, idx: DynamodId) -> Result<()> {\n\n let mut mods = self.modules.lock();\n\n let dyn_mod = mods.remove(idx as usize);\n\n\n\n {\n\n let mut zombie_mods = self.zombie_modules.lock();\n\n let zm = dyn_mod.zombify();\n\n\n\n zombie_mods.push(zm);\n\n }\n\n Ok(())\n","file_path":"socrates-core/src/module/container.rs","rank":62,"score":4.589320780709458},{"content":" _consumer: MyConsumer,\n\n}\n\n\n\nimpl MyActivator {\n\n pub fn new(_consumer: MyConsumer) -> MyActivator {\n\n MyActivator { _consumer }\n\n }\n\n}\n\nimpl Activator for MyActivator {}\n\nimpl Drop for MyActivator {\n\n fn drop(&mut self) {\n\n println!(\"I'm stopped (consumer)\");\n\n }\n\n}\n\n\n\nuse parking_lot::Mutex;\n\n\n\n#[derive(Component)]\n\n#[custom_lifecycle]\n\npub struct MyConsumer {\n","file_path":"examples/example-consumer/src/lib.rs","rank":63,"score":4.505228752445168},{"content":"}\n\n\n\nimpl EventListener<ServiceEvent> for ComponentManager {\n\n fn on_event(&self, event: &ServiceEvent) {\n\n for (_, cc) in self.components.iter() {\n\n cc.on_service_event(&event);\n\n }\n\n }\n\n}\n\n\n\nuse parking_lot::RwLock;\n\nuse std::sync::Arc;\n\n\n\n#[derive(Clone, Debug)]\n\npub struct ComponentReferences {\n\n inner: HashMap<Arc<str>, im::OrdSet<ServiceCoreProps>>,\n\n}\n\nimpl ComponentReferences {\n\n pub fn new() -> ComponentReferences {\n\n ComponentReferences {\n","file_path":"socrates-core/src/component/mod.rs","rank":64,"score":4.436970263211515},{"content":" ServiceQuery::Name(s) => self.get_all_services_by_name_typed(&s),\n\n ServiceQuery::TypeId(tid) => self.get_all_services_by_type_id_typed(tid.type_id),\n\n }\n\n }\n\n\n\n pub fn get_first_service_ref_by_query<T: Service + ?Sized>(\n\n &self,\n\n query: &ServiceQuery<T>,\n\n ) -> Option<ServiceRef> {\n\n match query {\n\n ServiceQuery::ServiceId(id) => self.get_service_ref(*id),\n\n ServiceQuery::Name(s) => self.get_first_service_ref_by_name(&s),\n\n ServiceQuery::TypeId(tid) => self.get_first_service_ref_by_type_id(tid.type_id),\n\n }\n\n }\n\n\n\n pub fn get_all_services_ref_by_query<T: Service + ?Sized>(\n\n &self,\n\n query: &ServiceQuery<T>,\n\n ) -> Vec<ServiceRef> {\n","file_path":"socrates-core/src/module/context.rs","rank":65,"score":4.429206720412933},{"content":" ) -> Result<ServiceRegistration> {\n\n let svc_type_id = service_type_id::<T>();\n\n let svc_name = service_name::<T>();\n\n self.register_service(svc_type_id, &svc_name, Default::default(), svc)\n\n }\n\n\n\n // Get by service_id\n\n pub fn get_service_ref(&self, svc_id: ServiceId) -> Option<ServiceRef> {\n\n let svc_manager = self.try_manager()?;\n\n\n\n svc_manager.get_service_ref(svc_id)\n\n }\n\n\n\n pub fn get_service(&self, svc_id: ServiceId) -> Option<Svc> {\n\n let svc_manager = self.try_manager()?;\n\n\n\n svc_manager\n\n .get_service_object(svc_id, self.dynamod_id)\n\n .map(|x| Svc::new(x, svc_id, self.dynamod_id, self.shared_service_manager()))\n\n }\n","file_path":"socrates-core/src/module/context.rs","rank":68,"score":4.158650840814619},{"content":" type Target = T;\n\n\n\n #[inline(always)]\n\n fn deref(&self) -> &T {\n\n &self.event_listener.deref()\n\n }\n\n}\n\n\n\nimpl<T: EventListener<E> + 'static, E> Listener<T, E> {\n\n pub fn weaken(&self) -> WeakListener<E> {\n\n let w = Arc::downgrade(&self.event_listener);\n\n WeakListener { event_listener: w }\n\n }\n\n}\n\n\n\n#[derive(Clone)]\n\npub struct WeakListener<E> {\n\n event_listener: Weak<dyn EventListener<E>>,\n\n}\n\n\n","file_path":"socrates-core/src/common/listener.rs","rank":69,"score":4.031480161881584},{"content":" pub fn raw(type_id: TypeId) -> TypeQuery<dyn Service> {\n\n TypeQuery {\n\n type_id,\n\n _phantom: std::marker::PhantomData,\n\n }\n\n }\n\n\n\n #[inline(always)]\n\n pub fn by_type<U: Service + ?Sized>() -> TypeQuery<U> {\n\n TypeQuery {\n\n type_id: service_type_id::<U>(),\n\n _phantom: std::marker::PhantomData,\n\n }\n\n }\n\n}\n\n\n\nimpl ServiceQuery {\n\n #[inline(always)]\n\n pub fn by_service_id(id: ServiceId) -> ServiceQuery {\n\n ServiceQuery::ServiceId(id)\n","file_path":"socrates-core/src/service/query.rs","rank":70,"score":4.025274506319727},{"content":"impl Service for SimpleGreeter {}\n\n#[macro_use]\n\nextern crate query_interface;\n\ninterfaces!(SimpleGreeter: Greeter);\n\nimpl socrates::component::Component for SimpleGreeter {\n\n fn get_definition() -> socrates::component::ComponentDefinition {\n\n socrates::component::ComponentDefinition {\n\n name: \"SimpleGreeter\".to_string(),\n\n provides: vec![socrates::component::definition::Provide {\n\n name: socrates::service::Service::get_name::<Greeter>().to_string(),\n\n }],\n\n references: vec![],\n\n }\n\n }\n\n fn instantiate(\n\n ctx: &socrates::module::Context,\n\n references: &socrates::component::ComponentReferences,\n\n ) -> Option<SimpleGreeter> {\n\n println!(\"Instanciating me, {}\", \"SimpleGreeter\");\n\n Some(SimpleGreeter)\n","file_path":"examples/example-provider/src/lib.rs","rank":71,"score":3.9684214353222322},{"content":" }\n\n\n\n #[inline(always)]\n\n pub fn try_manager(&self) -> Option<Arc<ServiceManager>> {\n\n self.svc_manager.upgrade()\n\n }\n\n\n\n pub fn register_listener<T: EventListener<ServiceEvent> + 'static>(\n\n &self,\n\n listener: Listener<T, ServiceEvent>,\n\n ) -> Result<Listener<T, ServiceEvent>> {\n\n let svc_manager = self.use_manager_or_fail()?;\n\n\n\n svc_manager.register_listener(listener.weaken());\n\n\n\n Ok(listener)\n\n }\n\n\n\n // Register service\n\n\n","file_path":"socrates-core/src/module/context.rs","rank":72,"score":3.9579614139099877},{"content":" s\n\n }\n\n\n\n pub fn get_first_service_by_query<T: Service + ?Sized>(\n\n &self,\n\n query: &ServiceQuery<T>,\n\n ) -> Option<Svc<T>> {\n\n match query {\n\n ServiceQuery::ServiceId(id) => self.get_service_by_id_typed(*id),\n\n ServiceQuery::Name(s) => self.get_first_service_by_name_typed(&s),\n\n ServiceQuery::TypeId(tid) => self.get_first_service_by_type_id_typed(tid.type_id),\n\n }\n\n }\n\n\n\n pub fn get_all_services_by_query<T: Service + ?Sized>(\n\n &self,\n\n query: &ServiceQuery<T>,\n\n ) -> Vec<Svc<T>> {\n\n match query {\n\n ServiceQuery::ServiceId(id) => self.get_service_by_id_typed(*id).into_iter().collect(),\n","file_path":"socrates-core/src/module/context.rs","rank":73,"score":3.800230795727746},{"content":" #[inline(always)]\n\n pub fn get_service_object(\n\n &self,\n\n svc_id: ServiceId,\n\n user_id: DynamodId,\n\n ) -> Option<Weak<dyn Service>> {\n\n self.registry.write().get_service_object(svc_id, user_id)\n\n }\n\n\n\n // By TypeId\n\n pub fn get_services_id_by_type_id(\n\n &self,\n\n svc_type_id: TypeId,\n\n ) -> impl Iterator<Item = ServiceId> {\n\n self.registry.read().get_services_id_by_type_id(svc_type_id)\n\n }\n\n\n\n pub fn get_services_ref_by_type_id(\n\n &self,\n\n svc_type_id: TypeId,\n","file_path":"socrates-core/src/service/manager.rs","rank":74,"score":3.7763022420962953},{"content":"#[macro_use]\n\nextern crate socrates_macro;\n\n\n\nuse socrates::component::*;\n\nuse socrates::module::{Activator, Context};\n\nuse socrates::service::ServiceRegistration;\n\nuse socrates::Result;\n\n\n\n#[no_mangle]\n","file_path":"examples/example-provider/src/lib.rs","rank":75,"score":3.7567911554193283},{"content":"#[macro_use]\n\nextern crate socrates_macro;\n\n\n\nuse socrates::component::*;\n\nuse socrates::module::{Activator, Context};\n\nuse socrates::service::Svc;\n\n\n\nuse socrates::Result;\n\n\n\nuse example_api::greet::{GreetRequest, Greeter, Idiom};\n\n\n\n#[no_mangle]\n","file_path":"examples/example-consumer/src/lib.rs","rank":76,"score":3.7492625158293094},{"content":"#[cfg(test)]\n\nmod tests {\n\n use socrates::component::definition::*;\n\n use socrates::component::*;\n\n use socrates::service::*;\n\n use socrates::service_trait;\n\n\n\n use query_interface::*;\n\n\n\n #[service_trait]\n","file_path":"socrates-test/src/lib.rs","rank":77,"score":3.738772972419715},{"content":" }\n\n\n\n let struct_name = &input.ident;\n\n let struct_name_as_string = struct_name.to_string();\n\n\n\n let mut quoted_provides = Vec::new();\n\n for prov in provided.iter() {\n\n let prov_name = syn::parse_str::<syn::Expr>(&prov.to_string()).ok();;\n\n quoted_provides.push(quote! {\n\n socrates::component::definition::Provide {\n\n name: socrates::service::Service::get_name::<#prov_name>().to_string(),\n\n }\n\n });\n\n }\n\n\n\n let mut quoted_references = Vec::new();\n\n for rfe in references.iter() {\n\n let rfe_name = rfe.name.to_string();\n\n let rfe_svc_name = syn::parse_str::<syn::Expr>(&rfe.unqualified_svc_name.to_string()).ok();\n\n\n","file_path":"socrates-macro/src/lib.rs","rank":78,"score":3.7205132488881034},{"content":" #input\n\n\n\n impl socrates::service::Named for #trait_name {\n\n fn type_name() -> &'static str {\n\n concat!(module_path!(), \"::\", #trait_name_as_string)\n\n }\n\n }\n\n };\n\n\n\n let r: TokenStream = expanded.into();\n\n println!(\"{}\", r.to_string());\n\n r\n\n}\n","file_path":"socrates-macro/src/lib.rs","rank":79,"score":3.685797716040574},{"content":"use socrates::common::{EventListener, Listener};\n\nuse socrates::module::Container;\n\nuse socrates::service::ServiceEvent;\n\nuse socrates::Result;\n\n#[derive(Clone)]\n","file_path":"socrates-launcher/src/main.rs","rank":80,"score":3.6792172967528525},{"content":"\n\n #[inline(always)]\n\n fn deref(&self) -> &T {\n\n self.as_ref()\n\n }\n\n}\n\n\n\nuse std::convert::AsRef;\n\nimpl<T: Service + ?Sized> AsRef<T> for Svc<T> {\n\n #[inline(always)]\n\n fn as_ref(&self) -> &T {\n\n // This works as long as the framework holds a strong ref on our service\n\n // which is guaranteed by Svc's ref counting mechanism.\n\n // We use only Weak refs to allow dynamic cycles between services.\n\n let rc = self.service.as_ref().unwrap().upgrade().unwrap();\n\n unsafe { std::mem::transmute(rc.as_ref()) }\n\n }\n\n}\n\n\n\nimpl<T: Service + ?Sized> Drop for Svc<T> {\n\n fn drop(&mut self) {\n\n // Could be none if panic during Svc<dyn Service>::cast\n\n if let Some(ref svc_manager) = self.svc_manager.upgrade() {\n\n svc_manager.remove_use(self.service_id, self.user_id);\n\n }\n\n }\n\n}\n","file_path":"socrates-core/src/service/svc.rs","rank":81,"score":3.66531849074252},{"content":"\n\n fn is_satisfied(&self) -> bool {\n\n let references = self.references.read().clone();\n\n let mut satisfied = true;\n\n for ref rfe in self.definition.references.iter() {\n\n if rfe.options.cardinality == Cardinality::Mandatory\n\n && references\n\n .get(&rfe.name as &str)\n\n .and_then(|s| s.iter().next())\n\n .is_none()\n\n {\n\n satisfied = false;\n\n break;\n\n }\n\n }\n\n satisfied\n\n }\n\n\n\n pub fn query_registry(&self) {\n\n let context = self.context.as_ref().unwrap();\n","file_path":"socrates-core/src/component/mod.rs","rank":82,"score":3.561294128930492},{"content":"use std::ops::Deref;\n\nuse std::sync::{Arc, Weak};\n\n\n","file_path":"socrates-core/src/common/listener.rs","rank":84,"score":3.4839515742994887},{"content":" let greet_printer_def = ComponentDefinition {\n\n name: \"GreetPrinter\".into(),\n\n references: vec![Reference {\n\n name: \"Greeter\".into(),\n\n svc_name: <Greeter as Named>::type_name().into(),\n\n svc_query: ServiceQuery::by_type_id(Service::type_id::<Greeter>()),\n\n options: Default::default(),\n\n }],\n\n ..Default::default()\n\n };\n\n\n\n println!(\"{:?}\", formal_greeter_def);\n\n println!(\"{:?}\", greet_printer_def);\n\n }\n\n\n\n}\n","file_path":"socrates-test/src/lib.rs","rank":85,"score":3.483528329184689},{"content":"\n\n// println!(\"Instanciating me, {}\", \"MyConsumer\");\n\n// let _ctx = socrates::component::factory::build(ctx)?;\n\n// let greeter = socrates::component::factory::build(ctx)?;\n\n// let maybe_greeter = socrates::component::factory::build(ctx)?;\n\n// let greeters = socrates::component::factory::build(ctx)?;\n\n\n\n// let dyn_greeter = socrates::component::factory::build(ctx)?;\n\n// let dyn_maybe_greeter = socrates::component::factory::build(ctx)?;\n\n// let dyn_greeters = socrates::component::factory::build(ctx)?;\n\n\n\n// Some(MyConsumer {\n\n// _ctx,\n\n// greeter,\n\n// maybe_greeter,\n\n// greeters,\n\n\n\n// dyn_greeter,\n\n// dyn_maybe_greeter,\n\n// dyn_greeters\n","file_path":"examples/example-consumer/src/lib.rs","rank":86,"score":3.4404291987583395},{"content":"}\n\n\n\n#[derive(Debug, PartialEq, Eq, Ord, PartialOrd, Hash)]\n\npub struct TypeQuery<T: Service + ?Sized = dyn Service> {\n\n pub type_id: TypeId,\n\n _phantom: std::marker::PhantomData<T>,\n\n}\n\n\n\n// Must be implemented manually to ignore the fact that !(T: Clone)\n\nimpl<T: Service + ?Sized> Clone for TypeQuery<T> {\n\n fn clone(&self) -> TypeQuery<T> {\n\n TypeQuery {\n\n type_id: self.type_id,\n\n _phantom: std::marker::PhantomData,\n\n }\n\n }\n\n}\n\n\n\nimpl<T: Service + ?Sized> TypeQuery<T> {\n\n #[inline(always)]\n","file_path":"socrates-core/src/service/query.rs","rank":87,"score":3.425896544048006},{"content":" service_id,\n\n user_id,\n\n }\n\n }\n\n}\n\n\n\nimpl Svc<dyn Service> {\n\n pub fn cast<U: Service + ?Sized>(mut self_: Self) -> std::result::Result<Svc<U>, Self> {\n\n let weak_srv = std::mem::replace(&mut self_.service, None);\n\n // the Arc reference is strongly held by the framework and cannot be none.\n\n match weak_srv\n\n .as_ref()\n\n .and_then(|x| x.upgrade())\n\n .and_then(|srv| Service::query_arc::<U>(srv).ok())\n\n {\n\n Some(srv) => {\n\n // note, transmute Svc<dyn Service> -> Svc<U> is not allowed\n\n // because rustc doesn't know they have the same size.\n\n\n\n let mgr = std::mem::replace(&mut self_.svc_manager, Weak::new());\n","file_path":"socrates-core/src/service/svc.rs","rank":88,"score":3.3997057668049346},{"content":"// WIP experimenting\n\n\n\n//#![feature(extern_crate_item_prelude)]\n\n//#![feature(custom_attribute)]\n\n// The `quote!` macro requires deep recursion.\n\n#![recursion_limit = \"512\"]\n\n\n\nextern crate proc_macro;\n\n\n\n#[macro_use]\n\nextern crate syn;\n\n#[macro_use]\n\nextern crate quote;\n\n\n\nuse syn::DeriveInput;\n\n\n\nuse proc_macro::TokenStream;\n\n\n\nuse socrates_core::component::*;\n\n\n","file_path":"socrates-macro/src/lib.rs","rank":89,"score":3.396663027230983},{"content":" })\n\n };\n\n\n\n let lifecycle_trait = if implement_lifecycle {\n\n Some(quote! {\n\n impl socrates::component::Lifecycle for #struct_name {\n\n\n\n }\n\n })\n\n } else {\n\n None\n\n };\n\n\n\n let expanded = quote! {\n\n #service_trait\n\n impl socrates::component::Component for #struct_name {\n\n fn get_definition() -> socrates::component::ComponentDefinition {\n\n socrates::component::ComponentDefinition {\n\n name: #struct_name_as_string.to_string(),\n\n provides: vec![ #(#quoted_provides),*],\n","file_path":"socrates-macro/src/lib.rs","rank":90,"score":3.3338382524398824},{"content":" if ident == \"provide\" {\n\n for nested in l.nested.iter() {\n\n if let syn::NestedMeta::Meta(syn::Meta::Word(svc_name)) = nested {\n\n provides.push(Provide {\n\n name: svc_name.to_string(),\n\n });\n\n provided.push(svc_name.clone());\n\n }\n\n }\n\n }\n\n }\n\n syn::Meta::Word(ident) => {\n\n let ident = ident.to_string();\n\n if ident == \"custom_lifecycle\" {\n\n implement_lifecycle = false;\n\n }\n\n }\n\n _ => (),\n\n }\n\n }\n","file_path":"socrates-macro/src/lib.rs","rank":91,"score":3.2988373259050805},{"content":" self.query_registry()\n\n }\n\n fn on_service_event(&self, event: &ServiceEvent) {\n\n self.on_service_event(event)\n\n }\n\n\n\n fn print_status(&self) {\n\n self.print_status();\n\n }\n\n}\n\n\n\npub struct ComponentInstance<T: Component> {\n\n registration: Option<ServiceRegistration>,\n\n component: T, //object: Svc<dyn Service>\n\n}\n\n\n\nimpl<T: Component> ComponentInstance<T> {\n\n fn new(registration: Option<ServiceRegistration>, component: T) -> ComponentInstance<T> {\n\n ComponentInstance {\n\n registration,\n","file_path":"socrates-core/src/component/mod.rs","rank":92,"score":3.273742829846466},{"content":" let card = syn::parse_str::<syn::Path>(&format!(\n\n \"socrates::component::definition::Cardinality::{:?}\",\n\n rfe.cardinality\n\n ))\n\n .ok();\n\n let pol = syn::parse_str::<syn::Path>(&format!(\n\n \"socrates::component::definition::Policy::{:?}\",\n\n rfe.policy\n\n ))\n\n .ok();\n\n let pol_opt = syn::parse_str::<syn::Path>(&format!(\n\n \"socrates::component::definition::PolicyOption::{:?}\",\n\n rfe.policy_option\n\n ))\n\n .ok();\n\n quoted_references.push(quote! {\n\n socrates::component::definition::Reference {\n\n name: #rfe_name.to_string(),\n\n svc_name: socrates::service::Service::get_name::<#rfe_svc_name>().into(),\n\n svc_query: socrates::service::query::ServiceQuery::by_type_id(socrates::service::Service::type_id::<#rfe_svc_name>()),\n","file_path":"socrates-macro/src/lib.rs","rank":93,"score":3.1059069715893797},{"content":"pub mod common;\n\npub mod component;\n\npub mod module;\n\npub mod service;\n\n\n\n#[derive(Debug)]\n\npub enum Error {\n\n StrError(String),\n\n IoError(std::io::Error),\n\n}\n\n\n\nimpl From<&str> for Error {\n\n fn from(error: &str) -> Self {\n\n Error::StrError(error.into())\n\n }\n\n}\n\n\n\nimpl From<String> for Error {\n\n fn from(error: String) -> Self {\n\n Error::StrError(error)\n","file_path":"socrates-core/src/lib.rs","rank":94,"score":3.069167004802332},{"content":"}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\n\npub struct ReferenceOptions {\n\n pub cardinality: Cardinality,\n\n pub policy: Policy,\n\n pub policy_option: PolicyOption,\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\n\npub enum Cardinality {\n\n Optional,\n\n Mandatory,\n\n Multiple,\n\n}\n\n\n\nimpl Default for Cardinality {\n\n fn default() -> Cardinality {\n\n Cardinality::Mandatory\n\n }\n","file_path":"socrates-core/src/component/definition.rs","rank":95,"score":3.003446083928621},{"content":" self.track_change(|references| {\n\n let mut changed = false;\n\n for ref rfe in self.definition.references.iter() {\n\n for service_ref in context.get_all_services_ref_by_query(&rfe.svc_query) {\n\n changed = true;\n\n let entry = references\n\n .inner\n\n .entry(rfe.name.clone().into())\n\n .or_insert(im::OrdSet::new());\n\n entry.insert(service_ref.core.into());\n\n }\n\n }\n\n changed\n\n });\n\n }\n\n\n\n pub fn on_service_event(&self, event: &ServiceEvent) {\n\n self.track_change(|references| {\n\n let mut changed = false;\n\n for ref rfe in self.definition.references.iter() {\n","file_path":"socrates-core/src/component/mod.rs","rank":97,"score":2.8731213503931987},{"content":"## Roadmap\n\n\n\n- [x] Basic container\n\n- [x] Dynamic services\n\n- [x] Small demo\n\n- [ ] More tests! \n\n- [ ] More documentation!\n\n- [ ] More refactoring \n\n- [ ] Lifecycle state, etc\n\n- [ ] Configuration management (using JSON + serde on custom structs?)\n\n- [ ] More service properties\n\n - [x] service ranking/ordering supported\n\n- [ ] Lazy/Factories and Prototype services \n\n- [ ] Manifests for shared objects\n\n- [ ] Stop requiring `#[no_mangle]`, define a real interface for instantiation (activators, service components)\n\n- [ ] Compatibility resolution and inspection at install\n\n- [ ] Lazy loading of shared objects (by get_service)\n\n- [ ] programmable, extensible Service Component Framework\n\n * dependency injection\n\n * (a better replacement than ServiceTrackers)\n\n * plugin any kind of events (not only service events & configuration)\n\n * should work also for any Rust application without dynamic loading.\n\n- [ ] Declarative bindings for the component framework (using macros or derive)\n\n- [ ] APIs for everything\n\n * Use it to build hot reload + watcher?\n\n- [ ] More non-blocking stuff (integrate with futures-rs)\n\n - [ ] e.g event dispatch, activate / deactivate methods \n\n - [ ] reusable base services, e.g a tokio core event loop running on futures provided by services\n\n- [ ] A blog post/series?\n\n\n\n\n\n## License\n\n\n\nApache Software License 2.0\n\n\n\n## Credits\n\n\n\nBuilt on top of the libloading and query_interface crates. Thanks!\n\nThanks to everyone helping on IRC, and especially mbrubeck & talchas :-)\n\n\n","file_path":"README.md","rank":98,"score":2.7587342858706556},{"content":"\n\n active_manager.query_registry();\n\n\n\n Ok(ComponentManagerHandler {\n\n manager: active_manager,\n\n })\n\n }\n\n\n\n pub fn get_manager(&self) -> &ComponentManager {\n\n self.manager.deref()\n\n }\n\n\n\n pub fn boxed(self) -> Box<Self> {\n\n Box::new(self)\n\n }\n\n}\n","file_path":"socrates-core/src/component/mod.rs","rank":99,"score":2.684419753482614}],"string":"[\n {\n \"content\": \"pub trait Named {\\n\\n fn type_name() -> &'static str;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/service/service.rs\",\n \"rank\": 0,\n \"score\": 67362.85685948143\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn service_name<T: Named + ?Sized>() -> &'static str {\\n\\n <T>::type_name()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/service/service.rs\",\n \"rank\": 1,\n \"score\": 62405.19411250492\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn any_service_type_id() -> std::any::TypeId {\\n\\n service_type_id::<dyn Service>()\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/service/service.rs\",\n \"rank\": 2,\n \"score\": 48919.24868286117\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct MyListener;\\n\\n\\n\\nimpl EventListener<ServiceEvent> for MyListener {\\n\\n fn on_event(&self, event: &ServiceEvent) {\\n\\n println!(\\\"Received: {:?}\\\", event);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-launcher/src/main.rs\",\n \"rank\": 3,\n \"score\": 48743.35862885308\n },\n {\n \"content\": \"struct ReferenceInfo {\\n\\n pub name: String,\\n\\n pub unqualified_svc_name: String,\\n\\n pub cardinality: Cardinality,\\n\\n pub policy: Policy,\\n\\n pub policy_option: PolicyOption,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 4,\n \"score\": 47757.52750554074\n },\n {\n \"content\": \"struct ComponentRunner {}\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 5,\n \"score\": 46837.819201474995\n },\n {\n \"content\": \"//#[derive(Component)]\\n\\n//#[provide(Greeter)]\\n\\nstruct SimpleGreeter;\\n\\n\\n\\nimpl SimpleGreeter {\\n\\n fn new() -> SimpleGreeter {\\n\\n SimpleGreeter\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Greeter for SimpleGreeter {\\n\\n fn greet(&self, req: &GreetRequest) -> String {\\n\\n let gr = match req.idiom {\\n\\n Idiom::Regular => \\\"Hello\\\",\\n\\n Idiom::Formal => \\\"Greetings to you, \\\",\\n\\n Idiom::Slang => \\\"Yo\\\",\\n\\n };\\n\\n format!(\\\"{} {}\\\", gr, req.who).into()\\n\\n }\\n\\n}\\n\\n\\n\\nuse socrates::service::Service;\\n\",\n \"file_path\": \"examples/example-provider/src/lib.rs\",\n \"rank\": 6,\n \"score\": 46837.819201474995\n },\n {\n \"content\": \"struct DynamodLib {\\n\\n id: DynamodId,\\n\\n lib: libloading::Library, // must be last to be dropped last\\n\\n}\\n\\nimpl DynamodLib {\\n\\n pub fn new(id: DynamodId, lib: libloading::Library) -> DynamodLib {\\n\\n DynamodLib { id, lib }\\n\\n }\\n\\n}\\n\\nimpl Drop for DynamodLib {\\n\\n fn drop(&mut self) {\\n\\n println!(\\\"Dropping dynamod #{}\\\", self.id);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/module/dynamod.rs\",\n \"rank\": 7,\n \"score\": 46837.819201474995\n },\n {\n \"content\": \" #[service_trait]\\n\\n pub trait Greeter {\\n\\n fn greet(&self, who: &str) -> String;\\n\\n }\\n\\n\\n\\n struct FormalGreeter;\\n\\n impl Greeter for FormalGreeter {\\n\\n fn greet(&self, who: &str) -> String {\\n\\n format!(\\\"{} {}\\\", \\\"Hello\\\", who)\\n\\n }\\n\\n }\\n\\n impl FormalGreeter {\\n\\n fn new() -> FormalGreeter {\\n\\n FormalGreeter\\n\\n }\\n\\n }\\n\\n\\n\\n impl Service for FormalGreeter {}\\n\\n\\n\\n query_interface::interfaces!(FormalGreeter: Greeter);\\n\\n\\n\",\n \"file_path\": \"socrates-test/src/lib.rs\",\n \"rank\": 8,\n \"score\": 41681.212557280815\n },\n {\n \"content\": \"pub trait Lifecycle {\\n\\n fn on_start(&self) {}\\n\\n}\\n\\n\\n\\nuse hashbrown::HashMap;\\n\\n\\n\\npub struct ComponentManagerHandler {\\n\\n manager: Listener<ComponentManager, ServiceEvent>,\\n\\n}\\n\\n\\n\\nimpl Activator for ComponentManagerHandler {}\\n\\n\\n\\nimpl ComponentManagerHandler {\\n\\n pub fn start(\\n\\n context: &ModuleContext,\\n\\n mut manager: ComponentManager,\\n\\n ) -> Result<ComponentManagerHandler> {\\n\\n manager.set_context(context);\\n\\n\\n\\n let active_manager = context.register_listener(Listener::new(manager))?;\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 9,\n \"score\": 40779.88515097778\n },\n {\n \"content\": \" #[service_trait]\\n\\n pub trait Greeter {\\n\\n fn greet(&self, req: &GreetRequest) -> String;\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"examples/example-api/src/lib.rs\",\n \"rank\": 10,\n \"score\": 40779.88515097778\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn service_type_id<T: ?Sized + std::any::Any>() -> std::any::TypeId {\\n\\n std::any::TypeId::of::<T>()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/service/service.rs\",\n \"rank\": 11,\n \"score\": 40157.44471431991\n },\n {\n \"content\": \"pub trait Activator: Send {}\\n\",\n \"file_path\": \"socrates-core/src/module/activator.rs\",\n \"rank\": 12,\n \"score\": 38709.51165400771\n },\n {\n \"content\": \"pub trait Factory<Source>: Sized {\\n\\n fn build(from: Source) -> Option<Self>;\\n\\n}\\n\\n\\n\\nimpl<T: Service + ?Sized> Factory<&ModuleContext> for Svc<T> {\\n\\n fn build(ctx: &ModuleContext) -> Option<Self> {\\n\\n ctx.get_first_service_typed::<T>()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Service + ?Sized> Factory<&ModuleContext> for Option<Svc<T>> {\\n\\n fn build(ctx: &ModuleContext) -> Option<Self> {\\n\\n Some(ctx.get_first_service_typed::<T>())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Service + ?Sized> Factory<&ModuleContext> for Vec<Svc<T>> {\\n\\n fn build(ctx: &ModuleContext) -> Option<Self> {\\n\\n Some(ctx.get_all_services_typed::<T>())\\n\\n }\\n\",\n \"file_path\": \"socrates-core/src/component/factory.rs\",\n \"rank\": 13,\n \"score\": 36880.08747402231\n },\n {\n \"content\": \"pub trait Update<Source>: Sized {\\n\\n fn update(&self, ctx: Source) -> Option<()>;\\n\\n}\\n\\n\\n\\nimpl<U, T: Factory<U>> Update<U> for parking_lot::Mutex<T> {\\n\\n fn update(&self, ctx: U) -> Option<()> {\\n\\n let new_value = T::build(ctx)?;\\n\\n let mut this = self.lock();\\n\\n *this = new_value;\\n\\n Some(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/component/factory.rs\",\n \"rank\": 14,\n \"score\": 36880.08747402231\n },\n {\n \"content\": \"#[no_mangle]\\n\\nfn activate(ctx: Context) -> Result<Box<dyn Activator>> {\\n\\n println!(\\\"I'm started (consumer)\\\");\\n\\n // panic!(\\\"shoudln't segfault!\\\");\\n\\n println!(\\n\\n \\\"My Component def: {:?}\\\",\\n\\n <MyConsumer as Component>::get_definition()\\n\\n );\\n\\n\\n\\n let cm = ComponentManager::new().add_component::<MyConsumer>();\\n\\n let cmh = ComponentManagerHandler::start(&ctx, cm)?;\\n\\n\\n\\n Ok(cmh.boxed())\\n\\n\\n\\n // srv: Svc<dyn Greeter>, our only way to use the service\\n\\n // it cannot be cloned, you must move it or request another\\n\\n // instance from the framework!\\n\\n // if let Some(srv) = ctx.get_service_typed::<Greeter>() {\\n\\n // let c = MyConsumer::new(ctx.clone(), srv);\\n\\n\\n\\n // // let cm: MyConsumer = Component::instantiate();\\n\",\n \"file_path\": \"examples/example-consumer/src/lib.rs\",\n \"rank\": 15,\n \"score\": 36135.446860171214\n },\n {\n \"content\": \"pub trait ComponentControllerT: Send + Sync {\\n\\n fn set_context(&mut self, context: &ModuleContext);\\n\\n fn query_registry(&self);\\n\\n fn on_service_event(&self, event: &ServiceEvent);\\n\\n fn print_status(&self);\\n\\n}\\n\\n\\n\\nimpl<T: Component> ComponentController<T> {\\n\\n pub fn new(\\n\\n definition: ComponentDefinition,\\n\\n instantiate: fn(&ModuleContext, &ComponentReferences) -> Option<T>,\\n\\n ) -> ComponentController<T> {\\n\\n ComponentController {\\n\\n context: None,\\n\\n definition,\\n\\n instantiate,\\n\\n references: RwLock::new(ComponentReferences::new()),\\n\\n instances: RwLock::new(Vec::new()),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 16,\n \"score\": 35440.5111545482\n },\n {\n \"content\": \"pub trait Service: Object + Send + Sync {}\\n\\nmopo!(Service);\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/service/service.rs\",\n \"rank\": 17,\n \"score\": 35246.664745168324\n },\n {\n \"content\": \"pub trait EventListener<E>: Send + Sync {\\n\\n fn on_event(&self, event: &E);\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Listener<T: EventListener<E>, E> {\\n\\n event_listener: Arc<T>,\\n\\n _phantom: std::marker::PhantomData<E>,\\n\\n}\\n\\n\\n\\nimpl<T: EventListener<E>, E> Listener<T, E> {\\n\\n pub fn new(sel: T) -> Listener<T, E> {\\n\\n Listener {\\n\\n event_listener: Arc::new(sel),\\n\\n _phantom: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: EventListener<E>, E> Deref for Listener<T, E> {\\n\",\n \"file_path\": \"socrates-core/src/common/listener.rs\",\n \"rank\": 18,\n \"score\": 34548.80918863656\n },\n {\n \"content\": \"#[proc_macro_derive(Component, attributes(provide, custom_lifecycle))]\\n\\npub fn component(input: TokenStream) -> TokenStream {\\n\\n let input = parse_macro_input!(input as DeriveInput);\\n\\n\\n\\n let mut references = Vec::new();\\n\\n if let syn::Data::Struct(ref struct_def) = input.data {\\n\\n for f in struct_def.fields.iter() {\\n\\n if let syn::Type::Path(ref path) = &f.ty {\\n\\n let p = &path.path;\\n\\n println!(\\\"base path {:?}\\\", f.ident);\\n\\n\\n\\n for seg in p.segments.iter() {\\n\\n println!(\\\"segment {:?}\\\", seg.ident.to_string());\\n\\n if let syn::PathArguments::AngleBracketed(ref type_params) = seg.arguments {\\n\\n for arg in type_params.args.iter() {\\n\\n if let syn::GenericArgument::Type(tpe) = arg {\\n\\n if let syn::Type::TraitObject(trait_obj) = tpe {\\n\\n for bound in trait_obj.bounds.iter() {\\n\\n if let syn::TypeParamBound::Trait(ref trt) = bound {\\n\\n for trt_seg in trt.path.segments.iter() {\\n\\n println!(\\\"trait {:?}\\\", trt_seg.ident.to_string());\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 19,\n \"score\": 34548.80918863656\n },\n {\n \"content\": \"pub trait ServiceEventListener: EventListener<ServiceEvent> {}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub enum ServiceEvent {\\n\\n ServiceRegistered(ServiceRef),\\n\\n ServiceModified(ServiceRef),\\n\\n ServiceUnregistered(ServiceRef),\\n\\n}\\n\\n\\n\\nimpl ServiceEvent {\\n\\n pub fn get_service_ref(&self) -> &ServiceRef {\\n\\n match self {\\n\\n ServiceEvent::ServiceRegistered(ref rfe)\\n\\n | ServiceEvent::ServiceModified(ref rfe)\\n\\n | ServiceEvent::ServiceUnregistered(ref rfe) => rfe,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/service/event.rs\",\n \"rank\": 20,\n \"score\": 34161.699703238715\n },\n {\n \"content\": \"// Not a trait object\\n\\npub trait Component: Lifecycle + Sized + Send + Sync {\\n\\n fn get_definition() -> ComponentDefinition;\\n\\n fn instantiate(context: &ModuleContext, references: &ComponentReferences) -> Option<Self>;\\n\\n fn update(\\n\\n &self,\\n\\n field_id: usize,\\n\\n context: &ModuleContext,\\n\\n references: &ComponentReferences,\\n\\n ) -> Option<()>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 21,\n \"score\": 33775.51981124911\n },\n {\n \"content\": \"#[proc_macro_attribute]\\n\\npub fn service_trait(_attr: TokenStream, item: TokenStream) -> TokenStream {\\n\\n let mut input: syn::ItemTrait = parse_macro_input!(item);\\n\\n\\n\\n let svc_trait_path: syn::Path = syn::parse_str(\\\"socrates::service::Service\\\").unwrap();\\n\\n\\n\\n let svc_trait_bound = syn::TraitBound {\\n\\n paren_token: None,\\n\\n modifier: syn::TraitBoundModifier::None,\\n\\n lifetimes: None,\\n\\n path: svc_trait_path,\\n\\n };\\n\\n\\n\\n input\\n\\n .supertraits\\n\\n .push(syn::TypeParamBound::Trait(svc_trait_bound));\\n\\n\\n\\n let trait_name = &input.ident;\\n\\n let trait_name_as_string = trait_name.to_string();\\n\\n\\n\\n let expanded = quote! {\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 22,\n \"score\": 30676.160894148994\n },\n {\n \"content\": \"pub fn build<Source, Provided: Into<Source>, T: Factory<Source>>(from: Provided) -> Option<T> {\\n\\n T::build(from.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/component/factory.rs\",\n \"rank\": 23,\n \"score\": 27375.47904488824\n },\n {\n \"content\": \"type ComponentName = String;\\n\\npub struct ComponentManager {\\n\\n // config: String // TODO JSon\\n\\n components: HashMap<ComponentName, Box<dyn ComponentControllerT>>,\\n\\n}\\n\\nimpl ComponentManager {\\n\\n pub fn new() -> ComponentManager {\\n\\n ComponentManager {\\n\\n components: HashMap::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn add_component<T: Component + 'static>(mut self) -> ComponentManager {\\n\\n let def = <T as Component>::get_definition();\\n\\n let component_name = def.name.clone();\\n\\n let f = <T as Component>::instantiate;\\n\\n let cc = ComponentController::new(def, f);\\n\\n self.components.insert(component_name, Box::new(cc));\\n\\n ComponentManager {\\n\\n components: self.components,\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 24,\n \"score\": 25720.397405277858\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\npub type ActivateFn = fn(Context) -> Result<Box<dyn Activator>>;\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/module/activator.rs\",\n \"rank\": 25,\n \"score\": 11.246774828859433\n },\n {\n \"content\": \"// WIP experimenting\\n\\n// Playground for service components\\n\\n\\n\\npub use self::definition::*;\\n\\nuse super::common::*;\\n\\nuse super::module::Context as ModuleContext;\\n\\nuse super::module::*;\\n\\nuse super::service::*;\\n\\nuse std::ops::Deref;\\n\\n\\n\\npub mod definition;\\n\\npub mod factory;\\n\\n\\n\\npub struct Context {\\n\\n pub module_context: ModuleContext,\\n\\n}\\n\\n\\n\\n// Not a trait object\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 27,\n \"score\": 10.26781213223404\n },\n {\n \"content\": \"use super::common::*;\\n\\nuse super::service::*;\\n\\nuse parking_lot::Mutex;\\n\\nuse std::any::TypeId;\\n\\nuse std::sync::{Arc, Weak};\\n\\n\\n\\nmod activator;\\n\\nmod container;\\n\\nmod context;\\n\\nmod dynamod;\\n\\n\\n\\npub use super::Result;\\n\\npub type DynamodId = u32;\\n\\npub use self::activator::ActivateFn;\\n\\npub use self::activator::Activator;\\n\\npub use self::container::Container;\\n\\npub use self::context::Context;\\n\\npub use self::dynamod::Dynamod;\\n\",\n \"file_path\": \"socrates-core/src/module/mod.rs\",\n \"rank\": 28,\n \"score\": 9.844808895491244\n },\n {\n \"content\": \"pub use self::reference::ServiceCoreProps;\\n\\npub use self::reference::ServiceRanking;\\n\\npub use self::reference::ServiceRef;\\n\\npub use self::registration::ServiceRegistration;\\n\\npub use self::registry::ServiceRegistry;\\n\\npub use self::service::any_service_type_id;\\n\\npub use self::service::service_name;\\n\\npub use self::service::service_type_id;\\n\\npub use self::service::Named;\\n\\npub use self::service::Service;\\n\\npub use self::service::ServiceId;\\n\\npub use self::svc::Svc;\\n\",\n \"file_path\": \"socrates-core/src/service/mod.rs\",\n \"rank\": 29,\n \"score\": 9.48209495181265\n },\n {\n \"content\": \"use super::super::service::query::ServiceQuery;\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\\n\\npub struct ComponentDefinition {\\n\\n pub name: String,\\n\\n pub provides: Vec<Provide>,\\n\\n pub references: Vec<Reference>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\\n\\npub struct Provide {\\n\\n pub name: String,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub struct Reference {\\n\\n pub name: String,\\n\\n pub svc_name: String, // This is just for human-readability\\n\\n pub svc_query: ServiceQuery,\\n\\n pub options: ReferenceOptions,\\n\",\n \"file_path\": \"socrates-core/src/component/definition.rs\",\n \"rank\": 30,\n \"score\": 9.31691824967627\n },\n {\n \"content\": \"use parking_lot::RwLock;\\n\\nuse std::any::TypeId;\\n\\nuse std::sync::{Arc, Weak};\\n\\n\\n\\nmod event;\\n\\nmod manager;\\n\\npub mod query;\\n\\nmod reference;\\n\\nmod registration;\\n\\nmod registry;\\n\\nmod service;\\n\\nmod svc;\\n\\n\\n\\nuse super::common::*;\\n\\nuse super::module::*;\\n\\n\\n\\npub use self::event::ServiceEvent;\\n\\npub use self::event::ServiceEventListener;\\n\\npub use self::manager::ServiceManager;\\n\\npub use self::query::ServiceQuery;\\n\",\n \"file_path\": \"socrates-core/src/service/mod.rs\",\n \"rank\": 31,\n \"score\": 8.96718071730502\n },\n {\n \"content\": \" pub fn register_service(\\n\\n &self,\\n\\n type_id: std::any::TypeId,\\n\\n svc_name: &str,\\n\\n svc_ranking: ServiceRanking,\\n\\n svc: Box<dyn Service>,\\n\\n ) -> Result<ServiceRegistration> {\\n\\n let svc_manager = self.use_manager_or_fail()?;\\n\\n\\n\\n let service_ref =\\n\\n svc_manager.register_service(type_id, svc_name, svc_ranking, self.dynamod_id, svc)?;\\n\\n\\n\\n let srv_reg = ServiceRegistration::new(service_ref, self.shared_service_manager());\\n\\n\\n\\n Ok(srv_reg)\\n\\n }\\n\\n\\n\\n pub fn register_service_typed<T: Service + Named + ?Sized>(\\n\\n &self,\\n\\n svc: Box<dyn Service>,\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 32,\n \"score\": 8.184611245911682\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\npub struct Dynamod {\\n\\n pub id: DynamodId,\\n\\n pub path: String,\\n\\n activator: Option<Box<dyn Activator>>,\\n\\n svc_manager: Weak<ServiceManager>,\\n\\n lib: DynamodLib, // must be last to be dropped last\\n\\n}\\n\\n\\n\\nimpl Dynamod {\\n\\n pub fn new(\\n\\n id: DynamodId,\\n\\n svc_manager: Weak<ServiceManager>,\\n\\n path: &str,\\n\\n lib: libloading::Library,\\n\\n ) -> Dynamod {\\n\\n Dynamod {\\n\\n id,\\n\\n path: path.to_owned(),\\n\",\n \"file_path\": \"socrates-core/src/module/dynamod.rs\",\n \"rank\": 33,\n \"score\": 7.799207322330391\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\npub type ServiceRanking = i32;\\n\\n\\n\\n/// Total ordering between two services\\n\\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub struct ServiceCoreProps {\\n\\n pub ranking: ServiceRanking,\\n\\n pub id: ServiceId,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub struct ServiceRef {\\n\\n pub core: ServiceCoreProps,\\n\\n pub name: String,\\n\\n pub type_id: TypeId,\\n\\n pub owner_id: DynamodId,\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/service/reference.rs\",\n \"rank\": 34,\n \"score\": 7.70866785642843\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\nuse super::super::module::Context as ModuleContext;\\n\\nuse super::Context as ComponentContext;\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/component/factory.rs\",\n \"rank\": 35,\n \"score\": 7.687994008662652\n },\n {\n \"content\": \"\\n\\n // By Name\\n\\n pub fn get_services_id_by_name(&self, svc_name: &str) -> impl Iterator<Item = ServiceId> {\\n\\n self.registry.read().get_services_id_by_name(svc_name)\\n\\n }\\n\\n pub fn get_services_ref_by_name(\\n\\n &self,\\n\\n svc_name: &str,\\n\\n ) -> impl Iterator<Item = ServiceRef> + '_ {\\n\\n self.registry\\n\\n .read()\\n\\n .get_services_id_by_name(svc_name)\\n\\n .flat_map(move |svc_id| self.registry.read().get_service_ref(svc_id))\\n\\n }\\n\\n\\n\\n pub fn get_services_by_name(\\n\\n &self,\\n\\n svc_name: &str,\\n\\n user_id: DynamodId,\\n\\n ) -> impl Iterator<Item = (ServiceId, Weak<dyn Service>)> + '_ {\\n\",\n \"file_path\": \"socrates-core/src/service/manager.rs\",\n \"rank\": 36,\n \"score\": 7.261717928234164\n },\n {\n \"content\": \"extern crate socrates_core;\\n\\n\\n\\npub use socrates_core::*;\\n\\npub mod common {\\n\\n pub use socrates_core::common::*;\\n\\n}\\n\\n\\n\\npub mod module {\\n\\n pub use socrates_core::module::*;\\n\\n}\\n\\npub mod service {\\n\\n pub use socrates_core::service::*;\\n\\n}\\n\\n\\n\\npub mod component {\\n\\n pub use socrates_core::component::*;\\n\\n}\\n\\n\\n\\nextern crate socrates_macro;\\n\\npub use socrates_macro::*;\\n\",\n \"file_path\": \"socrates/src/lib.rs\",\n \"rank\": 38,\n \"score\": 6.960550987016237\n },\n {\n \"content\": \"pub mod listener;\\n\\n\\n\\npub use self::listener::EventListener;\\n\\npub use self::listener::Listener;\\n\\npub use self::listener::WeakListener;\\n\",\n \"file_path\": \"socrates-core/src/common/mod.rs\",\n \"rank\": 39,\n \"score\": 6.879480825937172\n },\n {\n \"content\": \" self.registry\\n\\n .read()\\n\\n .get_services_id_by_name(svc_name)\\n\\n .flat_map(move |svc_id| {\\n\\n self.get_service_object(svc_id, user_id)\\n\\n .map(|svc_obj| (svc_id, svc_obj))\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn remove_use(&self, svc_id: ServiceId, user_id: DynamodId) {\\n\\n self.registry.write().remove_use(svc_id, user_id);\\n\\n }\\n\\n}\\n\\n\\n\\nuse im::vector::Vector;\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct ServiceListeners {\\n\\n listeners: Vector<WeakListener<ServiceEvent>>,\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/service/manager.rs\",\n \"rank\": 40,\n \"score\": 6.808631867671075\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/service/event.rs\",\n \"rank\": 41,\n \"score\": 6.765785078755799\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Context {\\n\\n dynamod_id: DynamodId,\\n\\n svc_manager: Weak<ServiceManager>,\\n\\n}\\n\\n\\n\\nimpl Context {\\n\\n pub fn new(dynamod_id: DynamodId, svc_manager: Weak<ServiceManager>) -> Context {\\n\\n Context {\\n\\n dynamod_id,\\n\\n svc_manager,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn use_manager_or_fail(&self) -> Result<Arc<ServiceManager>> {\\n\\n self.svc_manager\\n\\n .upgrade()\\n\\n .ok_or(\\\"Socrates container is down.\\\".into())\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 42,\n \"score\": 6.716761351363151\n },\n {\n \"content\": \"// WIP experimenting\\n\\n// Playground for better service queries (filters), service tracking and multi-service tracking\\n\\nuse super::*;\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Ord, PartialOrd, Hash)]\\n\\npub enum ServiceQuery<T: Service + ?Sized = dyn Service> {\\n\\n ServiceId(ServiceId),\\n\\n Name(String),\\n\\n TypeId(TypeQuery<T>), // TODO add combinators And, Or, Not and property matchers.\\n\\n}\\n\\n\\n\\n// Must be implemented manually to ignore the fact that !(T: Clone)\\n\\nimpl<T: Service + ?Sized> Clone for ServiceQuery<T> {\\n\\n fn clone(&self) -> ServiceQuery<T> {\\n\\n match self {\\n\\n ServiceQuery::ServiceId(id) => ServiceQuery::ServiceId(*id),\\n\\n ServiceQuery::Name(s) => ServiceQuery::Name(s.clone()),\\n\\n ServiceQuery::TypeId(tq) => ServiceQuery::TypeId(tq.clone()),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"socrates-core/src/service/query.rs\",\n \"rank\": 43,\n \"score\": 6.68173262896318\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[inline(always)]\\n\\n pub fn by_name(s: String) -> ServiceQuery {\\n\\n ServiceQuery::Name(s)\\n\\n }\\n\\n\\n\\n #[inline(always)]\\n\\n pub fn by_type_id(s: TypeId) -> ServiceQuery {\\n\\n let tq: TypeQuery = <TypeQuery<dyn Service>>::raw(s);\\n\\n ServiceQuery::TypeId(tq)\\n\\n }\\n\\n\\n\\n #[inline(always)]\\n\\n pub fn by_type<T: Service + ?Sized>() -> ServiceQuery<T> {\\n\\n ServiceQuery::TypeId(<TypeQuery<T>>::by_type::<T>())\\n\\n }\\n\\n\\n\\n pub fn matches(&self, e: &ServiceRef) -> bool {\\n\\n match self {\\n\\n ServiceQuery::ServiceId(id) => e.core.id == *id,\\n\\n ServiceQuery::Name(s) => e.name == *s,\\n\\n ServiceQuery::TypeId(tq) => e.type_id == tq.type_id,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/service/query.rs\",\n \"rank\": 44,\n \"score\": 6.555472093423423\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\npub struct Svc<T: Service + ?Sized = dyn Service> {\\n\\n // Options are implementation details -- must be built with values\\n\\n service: Option<Weak<T>>,\\n\\n svc_manager: Weak<ServiceManager>,\\n\\n service_id: ServiceId,\\n\\n user_id: DynamodId,\\n\\n}\\n\\n\\n\\nimpl<T: Service + ?Sized> Svc<T> {\\n\\n pub fn new(\\n\\n service: Weak<T>,\\n\\n service_id: ServiceId,\\n\\n user_id: DynamodId,\\n\\n svc_manager: Weak<ServiceManager>,\\n\\n ) -> Svc<T> {\\n\\n Svc {\\n\\n service: Some(service),\\n\\n svc_manager,\\n\",\n \"file_path\": \"socrates-core/src/service/svc.rs\",\n \"rank\": 45,\n \"score\": 6.4150872648259964\n },\n {\n \"content\": \" // #[derive(Component)]\\n\\n struct GreetPrinter {\\n\\n greeter: Svc<dyn Greeter>,\\n\\n }\\n\\n impl GreetPrinter {\\n\\n pub fn print_greet(&self) {\\n\\n println!(\\\"{}\\\", self.greeter.greet(\\\"world\\\"));\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_foo() {\\n\\n let formal_greeter_def = ComponentDefinition {\\n\\n name: \\\"FormalGreeter\\\".into(),\\n\\n provides: vec![Provide {\\n\\n name: \\\"Greeter\\\".into(),\\n\\n }],\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\",\n \"file_path\": \"socrates-test/src/lib.rs\",\n \"rank\": 46,\n \"score\": 6.412715761496447\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate socrates;\\n\\n\\n\\npub mod greet {\\n\\n use socrates::service::Service;\\n\\n use socrates::service_trait;\\n\\n\\n\\n #[derive(Clone, Debug)]\\n\\n pub enum Idiom {\\n\\n Formal,\\n\\n Regular,\\n\\n Slang,\\n\\n }\\n\\n\\n\\n #[derive(Clone, Debug)]\\n\\n pub struct GreetRequest {\\n\\n pub who: String,\\n\\n pub idiom: Idiom,\\n\\n }\\n\\n\\n\\n #[service_trait]\\n\",\n \"file_path\": \"examples/example-api/src/lib.rs\",\n \"rank\": 48,\n \"score\": 6.218950723452656\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct Container {\\n\\n svc_manager: Arc<ServiceManager>, // the \\\"master\\\" strong ref\\n\\n modules: Mutex<Vec<Dynamod>>,\\n\\n zombie_modules: Mutex<Vec<Dynamod>>,\\n\\n}\\n\\n\\n\\nimpl Container {\\n\\n pub fn new() -> Container {\\n\\n Default::default()\\n\\n }\\n\\n\\n\\n fn shared_service_manager(&self) -> Weak<ServiceManager> {\\n\\n Arc::downgrade(&self.svc_manager)\\n\\n }\\n\\n\\n\\n pub fn install(&self, path: &str) -> Result<()> {\\n\\n let mut mods = self.modules.lock();\\n\",\n \"file_path\": \"socrates-core/src/module/container.rs\",\n \"rank\": 49,\n \"score\": 6.063754660443962\n },\n {\n \"content\": \" // Get by name\\n\\n\\n\\n pub fn get_first_service_id_by_name(&self, svc_name: &str) -> Option<ServiceId> {\\n\\n let svc_manager = self.try_manager()?;\\n\\n\\n\\n svc_manager.get_services_id_by_name(svc_name).next()\\n\\n }\\n\\n\\n\\n pub fn get_all_services_id_by_name(&self, svc_name: &str) -> Vec<ServiceId> {\\n\\n self.try_manager()\\n\\n .into_iter()\\n\\n .flat_map(|svc_manager| svc_manager.get_services_id_by_name(svc_name))\\n\\n .collect()\\n\\n }\\n\\n\\n\\n pub fn get_first_service_ref_by_name(&self, svc_name: &str) -> Option<ServiceRef> {\\n\\n let svc_manager = self.try_manager()?;\\n\\n\\n\\n let s = svc_manager.get_services_ref_by_name(&svc_name).next();\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 50,\n \"score\": 5.969030794002364\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n // Register\\n\\n\\n\\n pub fn register_service(\\n\\n &self,\\n\\n svc_type_id: TypeId,\\n\\n svc_name: &str,\\n\\n svc_ranking: ServiceRanking,\\n\\n owner_id: DynamodId,\\n\\n svc: Box<dyn Service>,\\n\\n ) -> Result<ServiceRef> {\\n\\n let service_ref = self.registry.write().register_service(\\n\\n svc_type_id,\\n\\n svc_name,\\n\\n svc.into(),\\n\\n svc_ranking,\\n\\n owner_id,\\n\\n );\\n\",\n \"file_path\": \"socrates-core/src/service/manager.rs\",\n \"rank\": 51,\n \"score\": 5.965953589591819\n },\n {\n \"content\": \" s\\n\\n }\\n\\n\\n\\n pub fn get_all_services_ref_by_name(&self, svc_name: &str) -> Vec<ServiceRef> {\\n\\n let mut s: Vec<ServiceRef> = Vec::new();\\n\\n\\n\\n for svc_manager in self.try_manager() {\\n\\n for x in svc_manager.get_services_ref_by_name(svc_name) {\\n\\n s.push(x);\\n\\n }\\n\\n }\\n\\n\\n\\n s\\n\\n }\\n\\n\\n\\n pub fn get_first_service_by_name(&self, svc_name: &str) -> Option<Svc> {\\n\\n let svc_manager = self.try_manager()?;\\n\\n\\n\\n let s = svc_manager\\n\\n .get_services_by_name(svc_name, self.dynamod_id)\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 52,\n \"score\": 5.813647349179233\n },\n {\n \"content\": \" _ctx: socrates::module::Context,\\n\\n greeter: Svc<dyn Greeter>,\\n\\n maybe_greeter: Option<Svc<dyn Greeter>>,\\n\\n greeters: Vec<Svc<dyn Greeter>>,\\n\\n dyn_greeter: Mutex<Svc<dyn Greeter>>,\\n\\n dyn_maybe_greeter: Mutex<Option<Svc<dyn Greeter>>>,\\n\\n dyn_greeters: Mutex<Vec<Svc<dyn Greeter>>>,\\n\\n\\n\\n}\\n\\n\\n\\nimpl MyConsumer {\\n\\n // pub fn new(_ctx: Context, greeter: Svc<dyn Greeter>) -> MyConsumer {\\n\\n // MyConsumer { _ctx, greeter }\\n\\n // }\\n\\n pub fn do_it(&self, req: &GreetRequest) -> String {\\n\\n self.greeter.greet(req)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Lifecycle for MyConsumer {\\n\",\n \"file_path\": \"examples/example-consumer/src/lib.rs\",\n \"rank\": 53,\n \"score\": 5.7707807752846\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct ServiceManager {\\n\\n pub registry: RwLock<ServiceRegistry>,\\n\\n pub listeners: RwLock<ServiceListeners>,\\n\\n}\\n\\n\\n\\nimpl ServiceManager {\\n\\n pub fn register_listener(&self, listener: WeakListener<ServiceEvent>) {\\n\\n let mut listeners = self.listeners.write();\\n\\n\\n\\n listeners.insert_listener(listener);\\n\\n }\\n\\n\\n\\n pub fn unregister_service(&self, svc_id: ServiceId) {\\n\\n let mb_ref = self.registry.write().unregister_service(svc_id);\\n\\n\\n\\n if let Some(service_ref) = mb_ref {\\n\\n self.fire_event(&ServiceEvent::ServiceUnregistered(service_ref.clone()));\\n\",\n \"file_path\": \"socrates-core/src/service/manager.rs\",\n \"rank\": 54,\n \"score\": 5.670772839329551\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\\npub struct ServiceRegistration {\\n\\n pub svc_ref: ServiceRef,\\n\\n svc_manager: Weak<ServiceManager>,\\n\\n}\\n\\n\\n\\nimpl ServiceRegistration {\\n\\n pub fn new(svc_ref: ServiceRef, svc_manager: Weak<ServiceManager>) -> ServiceRegistration {\\n\\n ServiceRegistration {\\n\\n svc_ref,\\n\\n svc_manager,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for ServiceRegistration {\\n\\n fn drop(&mut self) {\\n\\n if let Some(svc_manager) = self.svc_manager.upgrade() {\\n\\n svc_manager.unregister_service(self.svc_ref.core.id);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/service/registration.rs\",\n \"rank\": 55,\n \"score\": 5.619798102985365\n },\n {\n \"content\": \"use query_interface::{mopo, Object};\\n\\n\\n\\npub type ServiceId = u32;\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/service/service.rs\",\n \"rank\": 56,\n \"score\": 5.434270918704012\n },\n {\n \"content\": \" options: socrates::component::definition::ReferenceOptions {\\n\\n cardinality: #card,\\n\\n policy: #pol,\\n\\n policy_option: #pol_opt\\n\\n }\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n let service_trait = if provided.is_empty() {\\n\\n None\\n\\n } else {\\n\\n Some(quote! {\\n\\n use socrates::service::Service;\\n\\n impl Service for #struct_name {}\\n\\n\\n\\n #[macro_use]\\n\\n extern crate query_interface;\\n\\n interfaces!(#struct_name: #(#provided),*);\\n\\n\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 57,\n \"score\": 5.420155161837776\n },\n {\n \"content\": \"\\n\\n self.get_all_services_by_type_id_typed(svc_type_id)\\n\\n }\\n\\n\\n\\n pub fn get_first_service_by_name_typed<T: Service + ?Sized>(\\n\\n &self,\\n\\n svc_name: &str,\\n\\n ) -> Option<Svc<T>> {\\n\\n self.get_first_service_by_name(svc_name)\\n\\n .and_then(|svc| Svc::cast::<T>(svc).ok())\\n\\n }\\n\\n\\n\\n pub fn get_all_services_by_name_typed<T: Service + ?Sized>(\\n\\n &self,\\n\\n svc_name: &str,\\n\\n ) -> Vec<Svc<T>> {\\n\\n let mut s: Vec<Svc<T>> = Vec::new();\\n\\n\\n\\n for svc_manager in self.try_manager() {\\n\\n for x in svc_manager.get_services_by_name(svc_name, self.dynamod_id) {\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 58,\n \"score\": 5.417527122682838\n },\n {\n \"content\": \" .map(|x| Svc::new(x.1, x.0, self.dynamod_id, self.shared_service_manager()))\\n\\n .next();\\n\\n\\n\\n s\\n\\n }\\n\\n\\n\\n pub fn get_all_services_by_name(&self, svc_name: &str) -> Vec<Svc> {\\n\\n let mut s: Vec<Svc> = Vec::new();\\n\\n\\n\\n for svc_manager in self.try_manager() {\\n\\n for x in svc_manager.get_services_by_name(svc_name, self.dynamod_id) {\\n\\n s.push(Svc::new(\\n\\n x.1,\\n\\n x.0,\\n\\n self.dynamod_id,\\n\\n self.shared_service_manager(),\\n\\n ));\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 61,\n \"score\": 4.832561850647864\n },\n {\n \"content\": \" let id = (*mods).len() as u32;\\n\\n let lib = libloading::Library::new(path)?;\\n\\n\\n\\n let dyn_mod = Dynamod::new(id, self.shared_service_manager(), path, lib);\\n\\n mods.push(dyn_mod);\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn uninstall(&self, idx: DynamodId) -> Result<()> {\\n\\n let mut mods = self.modules.lock();\\n\\n let dyn_mod = mods.remove(idx as usize);\\n\\n\\n\\n {\\n\\n let mut zombie_mods = self.zombie_modules.lock();\\n\\n let zm = dyn_mod.zombify();\\n\\n\\n\\n zombie_mods.push(zm);\\n\\n }\\n\\n Ok(())\\n\",\n \"file_path\": \"socrates-core/src/module/container.rs\",\n \"rank\": 62,\n \"score\": 4.589320780709458\n },\n {\n \"content\": \" _consumer: MyConsumer,\\n\\n}\\n\\n\\n\\nimpl MyActivator {\\n\\n pub fn new(_consumer: MyConsumer) -> MyActivator {\\n\\n MyActivator { _consumer }\\n\\n }\\n\\n}\\n\\nimpl Activator for MyActivator {}\\n\\nimpl Drop for MyActivator {\\n\\n fn drop(&mut self) {\\n\\n println!(\\\"I'm stopped (consumer)\\\");\\n\\n }\\n\\n}\\n\\n\\n\\nuse parking_lot::Mutex;\\n\\n\\n\\n#[derive(Component)]\\n\\n#[custom_lifecycle]\\n\\npub struct MyConsumer {\\n\",\n \"file_path\": \"examples/example-consumer/src/lib.rs\",\n \"rank\": 63,\n \"score\": 4.505228752445168\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl EventListener<ServiceEvent> for ComponentManager {\\n\\n fn on_event(&self, event: &ServiceEvent) {\\n\\n for (_, cc) in self.components.iter() {\\n\\n cc.on_service_event(&event);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nuse parking_lot::RwLock;\\n\\nuse std::sync::Arc;\\n\\n\\n\\n#[derive(Clone, Debug)]\\n\\npub struct ComponentReferences {\\n\\n inner: HashMap<Arc<str>, im::OrdSet<ServiceCoreProps>>,\\n\\n}\\n\\nimpl ComponentReferences {\\n\\n pub fn new() -> ComponentReferences {\\n\\n ComponentReferences {\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 64,\n \"score\": 4.436970263211515\n },\n {\n \"content\": \" ServiceQuery::Name(s) => self.get_all_services_by_name_typed(&s),\\n\\n ServiceQuery::TypeId(tid) => self.get_all_services_by_type_id_typed(tid.type_id),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_first_service_ref_by_query<T: Service + ?Sized>(\\n\\n &self,\\n\\n query: &ServiceQuery<T>,\\n\\n ) -> Option<ServiceRef> {\\n\\n match query {\\n\\n ServiceQuery::ServiceId(id) => self.get_service_ref(*id),\\n\\n ServiceQuery::Name(s) => self.get_first_service_ref_by_name(&s),\\n\\n ServiceQuery::TypeId(tid) => self.get_first_service_ref_by_type_id(tid.type_id),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_all_services_ref_by_query<T: Service + ?Sized>(\\n\\n &self,\\n\\n query: &ServiceQuery<T>,\\n\\n ) -> Vec<ServiceRef> {\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 65,\n \"score\": 4.429206720412933\n },\n {\n \"content\": \" ) -> Result<ServiceRegistration> {\\n\\n let svc_type_id = service_type_id::<T>();\\n\\n let svc_name = service_name::<T>();\\n\\n self.register_service(svc_type_id, &svc_name, Default::default(), svc)\\n\\n }\\n\\n\\n\\n // Get by service_id\\n\\n pub fn get_service_ref(&self, svc_id: ServiceId) -> Option<ServiceRef> {\\n\\n let svc_manager = self.try_manager()?;\\n\\n\\n\\n svc_manager.get_service_ref(svc_id)\\n\\n }\\n\\n\\n\\n pub fn get_service(&self, svc_id: ServiceId) -> Option<Svc> {\\n\\n let svc_manager = self.try_manager()?;\\n\\n\\n\\n svc_manager\\n\\n .get_service_object(svc_id, self.dynamod_id)\\n\\n .map(|x| Svc::new(x, svc_id, self.dynamod_id, self.shared_service_manager()))\\n\\n }\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 68,\n \"score\": 4.158650840814619\n },\n {\n \"content\": \" type Target = T;\\n\\n\\n\\n #[inline(always)]\\n\\n fn deref(&self) -> &T {\\n\\n &self.event_listener.deref()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: EventListener<E> + 'static, E> Listener<T, E> {\\n\\n pub fn weaken(&self) -> WeakListener<E> {\\n\\n let w = Arc::downgrade(&self.event_listener);\\n\\n WeakListener { event_listener: w }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct WeakListener<E> {\\n\\n event_listener: Weak<dyn EventListener<E>>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/common/listener.rs\",\n \"rank\": 69,\n \"score\": 4.031480161881584\n },\n {\n \"content\": \" pub fn raw(type_id: TypeId) -> TypeQuery<dyn Service> {\\n\\n TypeQuery {\\n\\n type_id,\\n\\n _phantom: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n\\n\\n #[inline(always)]\\n\\n pub fn by_type<U: Service + ?Sized>() -> TypeQuery<U> {\\n\\n TypeQuery {\\n\\n type_id: service_type_id::<U>(),\\n\\n _phantom: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ServiceQuery {\\n\\n #[inline(always)]\\n\\n pub fn by_service_id(id: ServiceId) -> ServiceQuery {\\n\\n ServiceQuery::ServiceId(id)\\n\",\n \"file_path\": \"socrates-core/src/service/query.rs\",\n \"rank\": 70,\n \"score\": 4.025274506319727\n },\n {\n \"content\": \"impl Service for SimpleGreeter {}\\n\\n#[macro_use]\\n\\nextern crate query_interface;\\n\\ninterfaces!(SimpleGreeter: Greeter);\\n\\nimpl socrates::component::Component for SimpleGreeter {\\n\\n fn get_definition() -> socrates::component::ComponentDefinition {\\n\\n socrates::component::ComponentDefinition {\\n\\n name: \\\"SimpleGreeter\\\".to_string(),\\n\\n provides: vec![socrates::component::definition::Provide {\\n\\n name: socrates::service::Service::get_name::<Greeter>().to_string(),\\n\\n }],\\n\\n references: vec![],\\n\\n }\\n\\n }\\n\\n fn instantiate(\\n\\n ctx: &socrates::module::Context,\\n\\n references: &socrates::component::ComponentReferences,\\n\\n ) -> Option<SimpleGreeter> {\\n\\n println!(\\\"Instanciating me, {}\\\", \\\"SimpleGreeter\\\");\\n\\n Some(SimpleGreeter)\\n\",\n \"file_path\": \"examples/example-provider/src/lib.rs\",\n \"rank\": 71,\n \"score\": 3.9684214353222322\n },\n {\n \"content\": \" }\\n\\n\\n\\n #[inline(always)]\\n\\n pub fn try_manager(&self) -> Option<Arc<ServiceManager>> {\\n\\n self.svc_manager.upgrade()\\n\\n }\\n\\n\\n\\n pub fn register_listener<T: EventListener<ServiceEvent> + 'static>(\\n\\n &self,\\n\\n listener: Listener<T, ServiceEvent>,\\n\\n ) -> Result<Listener<T, ServiceEvent>> {\\n\\n let svc_manager = self.use_manager_or_fail()?;\\n\\n\\n\\n svc_manager.register_listener(listener.weaken());\\n\\n\\n\\n Ok(listener)\\n\\n }\\n\\n\\n\\n // Register service\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 72,\n \"score\": 3.9579614139099877\n },\n {\n \"content\": \" s\\n\\n }\\n\\n\\n\\n pub fn get_first_service_by_query<T: Service + ?Sized>(\\n\\n &self,\\n\\n query: &ServiceQuery<T>,\\n\\n ) -> Option<Svc<T>> {\\n\\n match query {\\n\\n ServiceQuery::ServiceId(id) => self.get_service_by_id_typed(*id),\\n\\n ServiceQuery::Name(s) => self.get_first_service_by_name_typed(&s),\\n\\n ServiceQuery::TypeId(tid) => self.get_first_service_by_type_id_typed(tid.type_id),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_all_services_by_query<T: Service + ?Sized>(\\n\\n &self,\\n\\n query: &ServiceQuery<T>,\\n\\n ) -> Vec<Svc<T>> {\\n\\n match query {\\n\\n ServiceQuery::ServiceId(id) => self.get_service_by_id_typed(*id).into_iter().collect(),\\n\",\n \"file_path\": \"socrates-core/src/module/context.rs\",\n \"rank\": 73,\n \"score\": 3.800230795727746\n },\n {\n \"content\": \" #[inline(always)]\\n\\n pub fn get_service_object(\\n\\n &self,\\n\\n svc_id: ServiceId,\\n\\n user_id: DynamodId,\\n\\n ) -> Option<Weak<dyn Service>> {\\n\\n self.registry.write().get_service_object(svc_id, user_id)\\n\\n }\\n\\n\\n\\n // By TypeId\\n\\n pub fn get_services_id_by_type_id(\\n\\n &self,\\n\\n svc_type_id: TypeId,\\n\\n ) -> impl Iterator<Item = ServiceId> {\\n\\n self.registry.read().get_services_id_by_type_id(svc_type_id)\\n\\n }\\n\\n\\n\\n pub fn get_services_ref_by_type_id(\\n\\n &self,\\n\\n svc_type_id: TypeId,\\n\",\n \"file_path\": \"socrates-core/src/service/manager.rs\",\n \"rank\": 74,\n \"score\": 3.7763022420962953\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate socrates_macro;\\n\\n\\n\\nuse socrates::component::*;\\n\\nuse socrates::module::{Activator, Context};\\n\\nuse socrates::service::ServiceRegistration;\\n\\nuse socrates::Result;\\n\\n\\n\\n#[no_mangle]\\n\",\n \"file_path\": \"examples/example-provider/src/lib.rs\",\n \"rank\": 75,\n \"score\": 3.7567911554193283\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate socrates_macro;\\n\\n\\n\\nuse socrates::component::*;\\n\\nuse socrates::module::{Activator, Context};\\n\\nuse socrates::service::Svc;\\n\\n\\n\\nuse socrates::Result;\\n\\n\\n\\nuse example_api::greet::{GreetRequest, Greeter, Idiom};\\n\\n\\n\\n#[no_mangle]\\n\",\n \"file_path\": \"examples/example-consumer/src/lib.rs\",\n \"rank\": 76,\n \"score\": 3.7492625158293094\n },\n {\n \"content\": \"#[cfg(test)]\\n\\nmod tests {\\n\\n use socrates::component::definition::*;\\n\\n use socrates::component::*;\\n\\n use socrates::service::*;\\n\\n use socrates::service_trait;\\n\\n\\n\\n use query_interface::*;\\n\\n\\n\\n #[service_trait]\\n\",\n \"file_path\": \"socrates-test/src/lib.rs\",\n \"rank\": 77,\n \"score\": 3.738772972419715\n },\n {\n \"content\": \" }\\n\\n\\n\\n let struct_name = &input.ident;\\n\\n let struct_name_as_string = struct_name.to_string();\\n\\n\\n\\n let mut quoted_provides = Vec::new();\\n\\n for prov in provided.iter() {\\n\\n let prov_name = syn::parse_str::<syn::Expr>(&prov.to_string()).ok();;\\n\\n quoted_provides.push(quote! {\\n\\n socrates::component::definition::Provide {\\n\\n name: socrates::service::Service::get_name::<#prov_name>().to_string(),\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n let mut quoted_references = Vec::new();\\n\\n for rfe in references.iter() {\\n\\n let rfe_name = rfe.name.to_string();\\n\\n let rfe_svc_name = syn::parse_str::<syn::Expr>(&rfe.unqualified_svc_name.to_string()).ok();\\n\\n\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 78,\n \"score\": 3.7205132488881034\n },\n {\n \"content\": \" #input\\n\\n\\n\\n impl socrates::service::Named for #trait_name {\\n\\n fn type_name() -> &'static str {\\n\\n concat!(module_path!(), \\\"::\\\", #trait_name_as_string)\\n\\n }\\n\\n }\\n\\n };\\n\\n\\n\\n let r: TokenStream = expanded.into();\\n\\n println!(\\\"{}\\\", r.to_string());\\n\\n r\\n\\n}\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 79,\n \"score\": 3.685797716040574\n },\n {\n \"content\": \"use socrates::common::{EventListener, Listener};\\n\\nuse socrates::module::Container;\\n\\nuse socrates::service::ServiceEvent;\\n\\nuse socrates::Result;\\n\\n#[derive(Clone)]\\n\",\n \"file_path\": \"socrates-launcher/src/main.rs\",\n \"rank\": 80,\n \"score\": 3.6792172967528525\n },\n {\n \"content\": \"\\n\\n #[inline(always)]\\n\\n fn deref(&self) -> &T {\\n\\n self.as_ref()\\n\\n }\\n\\n}\\n\\n\\n\\nuse std::convert::AsRef;\\n\\nimpl<T: Service + ?Sized> AsRef<T> for Svc<T> {\\n\\n #[inline(always)]\\n\\n fn as_ref(&self) -> &T {\\n\\n // This works as long as the framework holds a strong ref on our service\\n\\n // which is guaranteed by Svc's ref counting mechanism.\\n\\n // We use only Weak refs to allow dynamic cycles between services.\\n\\n let rc = self.service.as_ref().unwrap().upgrade().unwrap();\\n\\n unsafe { std::mem::transmute(rc.as_ref()) }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Service + ?Sized> Drop for Svc<T> {\\n\\n fn drop(&mut self) {\\n\\n // Could be none if panic during Svc<dyn Service>::cast\\n\\n if let Some(ref svc_manager) = self.svc_manager.upgrade() {\\n\\n svc_manager.remove_use(self.service_id, self.user_id);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/service/svc.rs\",\n \"rank\": 81,\n \"score\": 3.66531849074252\n },\n {\n \"content\": \"\\n\\n fn is_satisfied(&self) -> bool {\\n\\n let references = self.references.read().clone();\\n\\n let mut satisfied = true;\\n\\n for ref rfe in self.definition.references.iter() {\\n\\n if rfe.options.cardinality == Cardinality::Mandatory\\n\\n && references\\n\\n .get(&rfe.name as &str)\\n\\n .and_then(|s| s.iter().next())\\n\\n .is_none()\\n\\n {\\n\\n satisfied = false;\\n\\n break;\\n\\n }\\n\\n }\\n\\n satisfied\\n\\n }\\n\\n\\n\\n pub fn query_registry(&self) {\\n\\n let context = self.context.as_ref().unwrap();\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 82,\n \"score\": 3.561294128930492\n },\n {\n \"content\": \"use std::ops::Deref;\\n\\nuse std::sync::{Arc, Weak};\\n\\n\\n\",\n \"file_path\": \"socrates-core/src/common/listener.rs\",\n \"rank\": 84,\n \"score\": 3.4839515742994887\n },\n {\n \"content\": \" let greet_printer_def = ComponentDefinition {\\n\\n name: \\\"GreetPrinter\\\".into(),\\n\\n references: vec![Reference {\\n\\n name: \\\"Greeter\\\".into(),\\n\\n svc_name: <Greeter as Named>::type_name().into(),\\n\\n svc_query: ServiceQuery::by_type_id(Service::type_id::<Greeter>()),\\n\\n options: Default::default(),\\n\\n }],\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n println!(\\\"{:?}\\\", formal_greeter_def);\\n\\n println!(\\\"{:?}\\\", greet_printer_def);\\n\\n }\\n\\n\\n\\n}\\n\",\n \"file_path\": \"socrates-test/src/lib.rs\",\n \"rank\": 85,\n \"score\": 3.483528329184689\n },\n {\n \"content\": \"\\n\\n// println!(\\\"Instanciating me, {}\\\", \\\"MyConsumer\\\");\\n\\n// let _ctx = socrates::component::factory::build(ctx)?;\\n\\n// let greeter = socrates::component::factory::build(ctx)?;\\n\\n// let maybe_greeter = socrates::component::factory::build(ctx)?;\\n\\n// let greeters = socrates::component::factory::build(ctx)?;\\n\\n\\n\\n// let dyn_greeter = socrates::component::factory::build(ctx)?;\\n\\n// let dyn_maybe_greeter = socrates::component::factory::build(ctx)?;\\n\\n// let dyn_greeters = socrates::component::factory::build(ctx)?;\\n\\n\\n\\n// Some(MyConsumer {\\n\\n// _ctx,\\n\\n// greeter,\\n\\n// maybe_greeter,\\n\\n// greeters,\\n\\n\\n\\n// dyn_greeter,\\n\\n// dyn_maybe_greeter,\\n\\n// dyn_greeters\\n\",\n \"file_path\": \"examples/example-consumer/src/lib.rs\",\n \"rank\": 86,\n \"score\": 3.4404291987583395\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug, PartialEq, Eq, Ord, PartialOrd, Hash)]\\n\\npub struct TypeQuery<T: Service + ?Sized = dyn Service> {\\n\\n pub type_id: TypeId,\\n\\n _phantom: std::marker::PhantomData<T>,\\n\\n}\\n\\n\\n\\n// Must be implemented manually to ignore the fact that !(T: Clone)\\n\\nimpl<T: Service + ?Sized> Clone for TypeQuery<T> {\\n\\n fn clone(&self) -> TypeQuery<T> {\\n\\n TypeQuery {\\n\\n type_id: self.type_id,\\n\\n _phantom: std::marker::PhantomData,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Service + ?Sized> TypeQuery<T> {\\n\\n #[inline(always)]\\n\",\n \"file_path\": \"socrates-core/src/service/query.rs\",\n \"rank\": 87,\n \"score\": 3.425896544048006\n },\n {\n \"content\": \" service_id,\\n\\n user_id,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Svc<dyn Service> {\\n\\n pub fn cast<U: Service + ?Sized>(mut self_: Self) -> std::result::Result<Svc<U>, Self> {\\n\\n let weak_srv = std::mem::replace(&mut self_.service, None);\\n\\n // the Arc reference is strongly held by the framework and cannot be none.\\n\\n match weak_srv\\n\\n .as_ref()\\n\\n .and_then(|x| x.upgrade())\\n\\n .and_then(|srv| Service::query_arc::<U>(srv).ok())\\n\\n {\\n\\n Some(srv) => {\\n\\n // note, transmute Svc<dyn Service> -> Svc<U> is not allowed\\n\\n // because rustc doesn't know they have the same size.\\n\\n\\n\\n let mgr = std::mem::replace(&mut self_.svc_manager, Weak::new());\\n\",\n \"file_path\": \"socrates-core/src/service/svc.rs\",\n \"rank\": 88,\n \"score\": 3.3997057668049346\n },\n {\n \"content\": \"// WIP experimenting\\n\\n\\n\\n//#![feature(extern_crate_item_prelude)]\\n\\n//#![feature(custom_attribute)]\\n\\n// The `quote!` macro requires deep recursion.\\n\\n#![recursion_limit = \\\"512\\\"]\\n\\n\\n\\nextern crate proc_macro;\\n\\n\\n\\n#[macro_use]\\n\\nextern crate syn;\\n\\n#[macro_use]\\n\\nextern crate quote;\\n\\n\\n\\nuse syn::DeriveInput;\\n\\n\\n\\nuse proc_macro::TokenStream;\\n\\n\\n\\nuse socrates_core::component::*;\\n\\n\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 89,\n \"score\": 3.396663027230983\n },\n {\n \"content\": \" })\\n\\n };\\n\\n\\n\\n let lifecycle_trait = if implement_lifecycle {\\n\\n Some(quote! {\\n\\n impl socrates::component::Lifecycle for #struct_name {\\n\\n\\n\\n }\\n\\n })\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\\n let expanded = quote! {\\n\\n #service_trait\\n\\n impl socrates::component::Component for #struct_name {\\n\\n fn get_definition() -> socrates::component::ComponentDefinition {\\n\\n socrates::component::ComponentDefinition {\\n\\n name: #struct_name_as_string.to_string(),\\n\\n provides: vec![ #(#quoted_provides),*],\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 90,\n \"score\": 3.3338382524398824\n },\n {\n \"content\": \" if ident == \\\"provide\\\" {\\n\\n for nested in l.nested.iter() {\\n\\n if let syn::NestedMeta::Meta(syn::Meta::Word(svc_name)) = nested {\\n\\n provides.push(Provide {\\n\\n name: svc_name.to_string(),\\n\\n });\\n\\n provided.push(svc_name.clone());\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n syn::Meta::Word(ident) => {\\n\\n let ident = ident.to_string();\\n\\n if ident == \\\"custom_lifecycle\\\" {\\n\\n implement_lifecycle = false;\\n\\n }\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 91,\n \"score\": 3.2988373259050805\n },\n {\n \"content\": \" self.query_registry()\\n\\n }\\n\\n fn on_service_event(&self, event: &ServiceEvent) {\\n\\n self.on_service_event(event)\\n\\n }\\n\\n\\n\\n fn print_status(&self) {\\n\\n self.print_status();\\n\\n }\\n\\n}\\n\\n\\n\\npub struct ComponentInstance<T: Component> {\\n\\n registration: Option<ServiceRegistration>,\\n\\n component: T, //object: Svc<dyn Service>\\n\\n}\\n\\n\\n\\nimpl<T: Component> ComponentInstance<T> {\\n\\n fn new(registration: Option<ServiceRegistration>, component: T) -> ComponentInstance<T> {\\n\\n ComponentInstance {\\n\\n registration,\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 92,\n \"score\": 3.273742829846466\n },\n {\n \"content\": \" let card = syn::parse_str::<syn::Path>(&format!(\\n\\n \\\"socrates::component::definition::Cardinality::{:?}\\\",\\n\\n rfe.cardinality\\n\\n ))\\n\\n .ok();\\n\\n let pol = syn::parse_str::<syn::Path>(&format!(\\n\\n \\\"socrates::component::definition::Policy::{:?}\\\",\\n\\n rfe.policy\\n\\n ))\\n\\n .ok();\\n\\n let pol_opt = syn::parse_str::<syn::Path>(&format!(\\n\\n \\\"socrates::component::definition::PolicyOption::{:?}\\\",\\n\\n rfe.policy_option\\n\\n ))\\n\\n .ok();\\n\\n quoted_references.push(quote! {\\n\\n socrates::component::definition::Reference {\\n\\n name: #rfe_name.to_string(),\\n\\n svc_name: socrates::service::Service::get_name::<#rfe_svc_name>().into(),\\n\\n svc_query: socrates::service::query::ServiceQuery::by_type_id(socrates::service::Service::type_id::<#rfe_svc_name>()),\\n\",\n \"file_path\": \"socrates-macro/src/lib.rs\",\n \"rank\": 93,\n \"score\": 3.1059069715893797\n },\n {\n \"content\": \"pub mod common;\\n\\npub mod component;\\n\\npub mod module;\\n\\npub mod service;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum Error {\\n\\n StrError(String),\\n\\n IoError(std::io::Error),\\n\\n}\\n\\n\\n\\nimpl From<&str> for Error {\\n\\n fn from(error: &str) -> Self {\\n\\n Error::StrError(error.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<String> for Error {\\n\\n fn from(error: String) -> Self {\\n\\n Error::StrError(error)\\n\",\n \"file_path\": \"socrates-core/src/lib.rs\",\n \"rank\": 94,\n \"score\": 3.069167004802332\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\\n\\npub struct ReferenceOptions {\\n\\n pub cardinality: Cardinality,\\n\\n pub policy: Policy,\\n\\n pub policy_option: PolicyOption,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]\\n\\npub enum Cardinality {\\n\\n Optional,\\n\\n Mandatory,\\n\\n Multiple,\\n\\n}\\n\\n\\n\\nimpl Default for Cardinality {\\n\\n fn default() -> Cardinality {\\n\\n Cardinality::Mandatory\\n\\n }\\n\",\n \"file_path\": \"socrates-core/src/component/definition.rs\",\n \"rank\": 95,\n \"score\": 3.003446083928621\n },\n {\n \"content\": \" self.track_change(|references| {\\n\\n let mut changed = false;\\n\\n for ref rfe in self.definition.references.iter() {\\n\\n for service_ref in context.get_all_services_ref_by_query(&rfe.svc_query) {\\n\\n changed = true;\\n\\n let entry = references\\n\\n .inner\\n\\n .entry(rfe.name.clone().into())\\n\\n .or_insert(im::OrdSet::new());\\n\\n entry.insert(service_ref.core.into());\\n\\n }\\n\\n }\\n\\n changed\\n\\n });\\n\\n }\\n\\n\\n\\n pub fn on_service_event(&self, event: &ServiceEvent) {\\n\\n self.track_change(|references| {\\n\\n let mut changed = false;\\n\\n for ref rfe in self.definition.references.iter() {\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 97,\n \"score\": 2.8731213503931987\n },\n {\n \"content\": \"## Roadmap\\n\\n\\n\\n- [x] Basic container\\n\\n- [x] Dynamic services\\n\\n- [x] Small demo\\n\\n- [ ] More tests! \\n\\n- [ ] More documentation!\\n\\n- [ ] More refactoring \\n\\n- [ ] Lifecycle state, etc\\n\\n- [ ] Configuration management (using JSON + serde on custom structs?)\\n\\n- [ ] More service properties\\n\\n - [x] service ranking/ordering supported\\n\\n- [ ] Lazy/Factories and Prototype services \\n\\n- [ ] Manifests for shared objects\\n\\n- [ ] Stop requiring `#[no_mangle]`, define a real interface for instantiation (activators, service components)\\n\\n- [ ] Compatibility resolution and inspection at install\\n\\n- [ ] Lazy loading of shared objects (by get_service)\\n\\n- [ ] programmable, extensible Service Component Framework\\n\\n * dependency injection\\n\\n * (a better replacement than ServiceTrackers)\\n\\n * plugin any kind of events (not only service events & configuration)\\n\\n * should work also for any Rust application without dynamic loading.\\n\\n- [ ] Declarative bindings for the component framework (using macros or derive)\\n\\n- [ ] APIs for everything\\n\\n * Use it to build hot reload + watcher?\\n\\n- [ ] More non-blocking stuff (integrate with futures-rs)\\n\\n - [ ] e.g event dispatch, activate / deactivate methods \\n\\n - [ ] reusable base services, e.g a tokio core event loop running on futures provided by services\\n\\n- [ ] A blog post/series?\\n\\n\\n\\n\\n\\n## License\\n\\n\\n\\nApache Software License 2.0\\n\\n\\n\\n## Credits\\n\\n\\n\\nBuilt on top of the libloading and query_interface crates. Thanks!\\n\\nThanks to everyone helping on IRC, and especially mbrubeck & talchas :-)\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 98,\n \"score\": 2.7587342858706556\n },\n {\n \"content\": \"\\n\\n active_manager.query_registry();\\n\\n\\n\\n Ok(ComponentManagerHandler {\\n\\n manager: active_manager,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_manager(&self) -> &ComponentManager {\\n\\n self.manager.deref()\\n\\n }\\n\\n\\n\\n pub fn boxed(self) -> Box<Self> {\\n\\n Box::new(self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"socrates-core/src/component/mod.rs\",\n \"rank\": 99,\n \"score\": 2.684419753482614\n }\n]","isConversational":false}}},{"rowIdx":794,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/gf/gf_num.rs"},"repo_name":{"kind":"string","value":"irreducible-polynoms/irrpoly-rust"},"commit":{"kind":"string","value":"b4d5e023fb02ddf32e4fd56b417a5cc89b2295f2"},"file_code":{"kind":"string","value":"use crate::Gf;\n\nuse std::vec::Vec;\nuse std::fmt;\nuse std::ops;\nuse std::cmp;\n\n#[derive(Debug, Clone)]\npub struct GfNum {\n field: Gf,\n num: usize,\n}\n\nimpl fmt::Display for GfNum {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{}\", self.num)\n }\n}\n\nimpl GfNum {\n pub fn new(field: &Gf, value: usize) -> GfNum {\n let field = Gf::clone(field);\n let value = value % field.base();\n GfNum {field, num: value }\n }\n\n pub fn from_vec(field: &Gf, value: Vec<usize>) -> Vec<GfNum> {\n value.iter().map(|x| GfNum::new(field, *x) ).collect()\n }\n\n pub fn into_num(self) -> usize { self.num }\n\n pub fn field(&self) -> &Gf { &self.field }\n\n pub fn num(&self) -> usize { self.num }\n\n pub fn mul_inv(&self) -> Self {\n let field = Gf::clone(self.field());\n let value = field.mul_inv(self.num)\n .expect(\"Multiplicative inverse for zero do not exist\");\n GfNum {field, num: value }\n }\n\n pub fn is_zero(&self) -> bool { self.num == 0 }\n}\n\nimpl ops::Add<GfNum> for GfNum {\n type Output = GfNum;\n\n fn add(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num + rhs.num) % base\n }\n }\n}\n\nimpl ops::Add<usize> for GfNum {\n type Output = GfNum;\n\n fn add(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num + (rhs % base)) % base\n }\n }\n}\n\nimpl ops::Add<GfNum> for usize {\n type Output = GfNum;\n\n fn add(self, rhs: GfNum) -> GfNum {\n let base = rhs.field().base();\n GfNum {\n field: rhs.field,\n num: (rhs.num + (self % base)) % base\n }\n }\n}\n\nimpl ops::AddAssign<GfNum> for GfNum {\n fn add_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n self.num = (self.num + other.num) % base;\n }\n}\n\nimpl ops::AddAssign<usize> for GfNum {\n fn add_assign(&mut self, other: usize) {\n let base = self.field().base();\n self.num = (self.num + (other % base)) % base;\n }\n}\n\nimpl ops::Sub<GfNum> for GfNum {\n type Output = GfNum;\n\n fn sub(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (base + self.num - rhs.num) % base\n }\n }\n}\n\nimpl ops::Sub<usize> for GfNum {\n type Output = GfNum;\n\n fn sub(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (base + self.num - (rhs % base)) % base\n }\n }\n}\n\nimpl ops::Sub<GfNum> for usize {\n type Output = GfNum;\n\n fn sub(self, rhs: GfNum) -> GfNum {\n let base = rhs.field().base();\n GfNum {\n field: rhs.field,\n num: (base + rhs.num - (self % base)) % base\n }\n }\n}\n\nimpl ops::SubAssign<GfNum> for GfNum {\n fn sub_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n self.num = (base + self.num - other.num) % base;\n }\n}\n\nimpl ops::SubAssign<usize> for GfNum {\n fn sub_assign(&mut self, other: usize) {\n let base = self.field().base();\n self.num = (base + self.num - (other % base)) % base;\n }\n}\n\nimpl ops::Neg for GfNum {\n type Output = GfNum;\n\n fn neg(self) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: base - self.num\n }\n }\n}\n\nimpl ops::Mul<GfNum> for GfNum {\n type Output = GfNum;\n\n fn mul(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num * rhs.num) % base\n }\n }\n}\n\nimpl ops::Mul<usize> for GfNum {\n type Output = GfNum;\n\n fn mul(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num * (rhs % base)) % base\n }\n }\n}\n\nimpl ops::Mul<GfNum> for usize {\n type Output = GfNum;\n\n fn mul(self, rhs: GfNum) -> GfNum {\n let base = rhs.field().base();\n GfNum {\n field: rhs.field,\n num: (rhs.num * (self % base)) % base\n }\n }\n}\n\nimpl ops::MulAssign<GfNum> for GfNum {\n fn mul_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n self.num = (self.num * other.num) % base;\n }\n}\n\nimpl ops::MulAssign<usize> for GfNum {\n fn mul_assign(&mut self, other: usize) {\n let base = self.field().base();\n self.num = (self.num * (other % base)) % base;\n }\n}\n\nimpl ops::Div<GfNum> for GfNum {\n type Output = GfNum;\n\n fn div(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n let inv = self.field().mul_inv(rhs.num).unwrap();\n GfNum {\n field: self.field,\n num: (self.num * inv) % base\n }\n }\n}\n\nimpl ops::Div<usize> for GfNum {\n type Output = GfNum;\n\n fn div(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n let inv = self.field().mul_inv(rhs).unwrap();\n GfNum {\n field: self.field,\n num: (self.num * inv) % base\n }\n }\n}\n\nimpl ops::Div<GfNum> for usize {\n type Output = GfNum;\n\n fn div(self, rhs: GfNum) -> GfNum {\n let base = rhs.field().base();\n let inv = rhs.field().mul_inv(rhs.num).unwrap();\n GfNum {\n field: rhs.field,\n num: (self * inv) % base\n }\n }\n}\n\nimpl ops::DivAssign<GfNum> for GfNum {\n fn div_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n let inv = self.field().mul_inv(other.num).unwrap();\n self.num = (self.num * inv) % base;\n }\n}\n\nimpl ops::DivAssign<usize> for GfNum {\n fn div_assign(&mut self, other: usize) {\n let base = self.field().base();\n let inv = self.field().mul_inv(other).unwrap();\n self.num = (self.num * inv) % base;\n }\n}\n\nimpl cmp::PartialEq<GfNum> for GfNum {\n fn eq (&self, other: &GfNum) -> bool {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n self.num() == other.num()\n }\n}\n\nimpl cmp::PartialEq<usize> for GfNum {\n fn eq (&self, other: &usize) -> bool {\n let base = self.field().base();\n self.num() == other % base\n }\n}\n\nimpl cmp::PartialEq<GfNum> for usize {\n fn eq (&self, other: &GfNum) -> bool {\n let base = other.field().base();\n self % base == other.num()\n }\n}\n\nimpl cmp::Eq for GfNum {}\n\nimpl cmp::PartialOrd<GfNum> for GfNum {\n fn partial_cmp(&self, other: &GfNum) -> Option<cmp::Ordering> {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n self.num.partial_cmp(&other.num)\n }\n}\n\nimpl cmp::PartialOrd<usize> for GfNum {\n fn partial_cmp(&self, other: &usize) -> Option<cmp::Ordering> {\n let base = self.field().base();\n self.num.partial_cmp(&(other % base))\n }\n}\n\nimpl cmp::PartialOrd<GfNum> for usize {\n fn partial_cmp(&self, other: &GfNum) -> Option<cmp::Ordering> {\n let base = other.field().base();\n (self % base).partial_cmp(&other.num)\n }\n}\n\nimpl cmp::Ord for GfNum {\n fn cmp(&self, other: &GfNum) -> cmp::Ordering {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n self.num.cmp(&other.num)\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::Gf;\n\nuse std::vec::Vec;\nuse std::fmt;\nuse std::ops;\nuse std::cmp;\n\n#[derive(Debug, Clone)]\npub struct GfNum {\n field: Gf,\n num: usize,\n}\n\nimpl fmt::Display for GfNum {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{}\", self.num)\n }\n}\n\nimpl GfNum {\n pub fn new(field: &Gf, value: usize) -> GfNum {\n let field = Gf::clone(field);\n let value = value % field.base();\n GfNum {field, num: value }\n }\n\n pub fn from_vec(field: &Gf, value: Vec<usize>) -> Vec<GfNum> {\n value.iter().map(|x| GfNum::new(field, *x) ).collect()\n }\n\n pub fn into_num(self) -> usize { self.num }\n\n pub fn field(&self) -> &Gf { &self.field }\n\n pub fn num(&self) -> usize { self.num }\n\n pub fn mul_inv(&self) -> Self {\n let field = Gf::clone(self.field());\n let value = field.mul_inv(self.num)\n .expect(\"Multiplicative inverse for zero do not exist\");\n GfNum {field, num: value }\n }\n\n pub fn is_zero(&self) -> bool { self.num == 0 }\n}\n\nimpl ops::Add<GfNum> for GfNum {\n type Output = GfNum;\n\n fn add(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num + rhs.num) % base\n }\n }\n}\n\nimpl ops::Add<usize> for GfNum {\n type Output = GfNum;\n\n fn add(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num + (rhs % base)) % base\n }\n }\n}\n\nimpl ops::Add<GfNum> for usize {\n type Output = GfNum;\n\n fn add(self, rhs: GfNum) -> GfNum {\n let base = rhs.field().base();\n GfNum {\n field: rhs.field,\n num: (rhs.num + (self % base)) % base\n }\n }\n}\n\nimpl ops::AddAssign<GfNum> for GfNum {\n fn add_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n self.num = (self.num + other.num) % base;\n }\n}\n\nimpl ops::AddAssign<usize> for GfNum {\n fn add_assign(&mut self, other: usize) {\n let base = self.field().base();\n self.num = (self.num + (other % base)) % base;\n }\n}\n\nimpl ops::Sub<GfNum> for GfNum {\n type Output = GfNum;\n\n fn sub(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (base + self.num - rhs.num) % base\n }\n }\n}\n\nimpl ops::Sub<usize> for GfNum {\n type Output = GfNum;\n\n fn sub(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (base + self.num - (rhs % base)) % base\n }\n }\n}\n\nimpl ops::Sub<GfNum> for usize {\n type Output = GfNum;\n\n fn sub(self, rhs: GfNum) -> GfNum {\n let base = rh"},"suffix":{"kind":"string","value":"\n}\n\nimpl ops::SubAssign<GfNum> for GfNum {\n fn sub_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n self.num = (base + self.num - other.num) % base;\n }\n}\n\nimpl ops::SubAssign<usize> for GfNum {\n fn sub_assign(&mut self, other: usize) {\n let base = self.field().base();\n self.num = (base + self.num - (other % base)) % base;\n }\n}\n\nimpl ops::Neg for GfNum {\n type Output = GfNum;\n\n fn neg(self) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: base - self.num\n }\n }\n}\n\nimpl ops::Mul<GfNum> for GfNum {\n type Output = GfNum;\n\n fn mul(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num * rhs.num) % base\n }\n }\n}\n\nimpl ops::Mul<usize> for GfNum {\n type Output = GfNum;\n\n fn mul(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n GfNum {\n field: self.field,\n num: (self.num * (rhs % base)) % base\n }\n }\n}\n\nimpl ops::Mul<GfNum> for usize {\n type Output = GfNum;\n\n fn mul(self, rhs: GfNum) -> GfNum {\n let base = rhs.field().base();\n GfNum {\n field: rhs.field,\n num: (rhs.num * (self % base)) % base\n }\n }\n}\n\nimpl ops::MulAssign<GfNum> for GfNum {\n fn mul_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n self.num = (self.num * other.num) % base;\n }\n}\n\nimpl ops::MulAssign<usize> for GfNum {\n fn mul_assign(&mut self, other: usize) {\n let base = self.field().base();\n self.num = (self.num * (other % base)) % base;\n }\n}\n\nimpl ops::Div<GfNum> for GfNum {\n type Output = GfNum;\n\n fn div(self, rhs: GfNum) -> GfNum {\n debug_assert_eq!(self.field(), rhs.field(), \"Numbers from different fields\");\n let base = self.field().base();\n let inv = self.field().mul_inv(rhs.num).unwrap();\n GfNum {\n field: self.field,\n num: (self.num * inv) % base\n }\n }\n}\n\nimpl ops::Div<usize> for GfNum {\n type Output = GfNum;\n\n fn div(self, rhs: usize) -> GfNum {\n let base = self.field().base();\n let inv = self.field().mul_inv(rhs).unwrap();\n GfNum {\n field: self.field,\n num: (self.num * inv) % base\n }\n }\n}\n\nimpl ops::Div<GfNum> for usize {\n type Output = GfNum;\n\n fn div(self, rhs: GfNum) -> GfNum {\n let base = rhs.field().base();\n let inv = rhs.field().mul_inv(rhs.num).unwrap();\n GfNum {\n field: rhs.field,\n num: (self * inv) % base\n }\n }\n}\n\nimpl ops::DivAssign<GfNum> for GfNum {\n fn div_assign(&mut self, other: GfNum) {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n let base = self.field().base();\n let inv = self.field().mul_inv(other.num).unwrap();\n self.num = (self.num * inv) % base;\n }\n}\n\nimpl ops::DivAssign<usize> for GfNum {\n fn div_assign(&mut self, other: usize) {\n let base = self.field().base();\n let inv = self.field().mul_inv(other).unwrap();\n self.num = (self.num * inv) % base;\n }\n}\n\nimpl cmp::PartialEq<GfNum> for GfNum {\n fn eq (&self, other: &GfNum) -> bool {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n self.num() == other.num()\n }\n}\n\nimpl cmp::PartialEq<usize> for GfNum {\n fn eq (&self, other: &usize) -> bool {\n let base = self.field().base();\n self.num() == other % base\n }\n}\n\nimpl cmp::PartialEq<GfNum> for usize {\n fn eq (&self, other: &GfNum) -> bool {\n let base = other.field().base();\n self % base == other.num()\n }\n}\n\nimpl cmp::Eq for GfNum {}\n\nimpl cmp::PartialOrd<GfNum> for GfNum {\n fn partial_cmp(&self, other: &GfNum) -> Option<cmp::Ordering> {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n self.num.partial_cmp(&other.num)\n }\n}\n\nimpl cmp::PartialOrd<usize> for GfNum {\n fn partial_cmp(&self, other: &usize) -> Option<cmp::Ordering> {\n let base = self.field().base();\n self.num.partial_cmp(&(other % base))\n }\n}\n\nimpl cmp::PartialOrd<GfNum> for usize {\n fn partial_cmp(&self, other: &GfNum) -> Option<cmp::Ordering> {\n let base = other.field().base();\n (self % base).partial_cmp(&other.num)\n }\n}\n\nimpl cmp::Ord for GfNum {\n fn cmp(&self, other: &GfNum) -> cmp::Ordering {\n debug_assert_eq!(self.field(), other.field(), \"Numbers from different fields\");\n self.num.cmp(&other.num)\n }\n}\n"},"middle":{"kind":"string","value":"s.field().base();\n GfNum {\n field: rhs.field,\n num: (base + rhs.num - (self % base)) % base\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"#[test]\n\nfn not_a_field() {\n\n assert!(Gf::new(0).is_err());\n\n assert!(Gf::new(1).is_err());\n\n assert!(Gf::new(4).is_err());\n\n assert!(Gf::new(isize::max_value() as usize).is_err());\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":0,"score":54802.981125424296},{"content":"#[test]\n\n#[should_panic]\n\nfn gfn_division_by_zero() {\n\n let gf2 = Gf::new(2).unwrap();\n\n let mut num = GfNum::new(&gf2, 0);\n\n num /= 0;\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":1,"score":50194.56280996447},{"content":"#[test]\n\n#[should_panic]\n\nfn mul_inv_for_zero() {\n\n let gf2 = Gf::new(2).unwrap();\n\n let num = GfNum::new(&gf2, 0);\n\n num.mul_inv();\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":2,"score":50194.56280996447},{"content":"#[test]\n\n#[should_panic]\n\nfn gf_poly_degree_for_zero() {\n\n let gf5 = Gf::new(5).unwrap();\n\n let poly = GfPoly::new(&gf5, 5);\n\n poly.deg();\n\n}\n","file_path":"src/gf_poly/tests.rs","rank":3,"score":49286.28424458546},{"content":"#[test]\n\nfn gf_works() {\n\n let gf2 = Gf::new(2);\n\n assert!(gf2.is_ok());\n\n let gf2 = gf2.unwrap();\n\n assert_eq!(gf2.base(), 2);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":4,"score":34862.578204158606},{"content":"type Result<T> = std::result::Result<T, GfError>;\n\n\n\n#[derive(Debug)]\n\npub struct GfBase {\n\n base: usize,\n\n inv: Box<[usize]>,\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Gf(Arc<GfBase>);\n\n\n\nimpl ops::Deref for Gf {\n\n type Target = Arc<GfBase>;\n\n\n\n fn deref(&self) -> &Self::Target { &self.0 }\n\n}\n\n\n\nimpl Gf {\n\n pub fn new(base: usize) -> Result<Gf> {\n\n let field = GfBase::new(base)?;\n","file_path":"src/gf/gf.rs","rank":5,"score":32704.07879118123},{"content":"#[test]\n\nfn gf_poly_works() {\n\n let gf5 = Gf::new(5).unwrap();\n\n\n\n let mut output = String::new();\n\n let poly = GfPoly::new(&gf5, 3);\n\n write!(&mut output, \"{}\", poly).unwrap();\n\n assert_eq!(output, \"[ 3 ]\");\n\n\n\n let mut output = String::new();\n\n let num = GfNum::new(&gf5, 5);\n\n let poly = GfPoly::from_gf_num(num);\n\n write!(&mut output, \"{}\", poly).unwrap();\n\n assert_eq!(output, \"[ ]\");\n\n\n\n let mut output = String::new();\n\n let poly = GfPoly::from_vec(&gf5, vec![1, 2, 3, 0, 0]);\n\n write!(&mut output, \"{}\", poly).unwrap();\n\n assert_eq!(output, \"[ 1, 2, 3 ]\");\n\n assert_eq!(poly.field(), &gf5);\n\n assert_eq!(poly.poly(), &GfNum::from_vec(&gf5, vec![1, 2, 3])[..]);\n","file_path":"src/gf_poly/tests.rs","rank":6,"score":32652.8048974268},{"content":"#[test]\n\nfn gfn_works() {\n\n let gf5 = Gf::new(5).unwrap();\n\n let num = GfNum::new(&gf5, 7);\n\n assert_eq!(num.field(), &gf5);\n\n assert_eq!(num.num(), 2);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":7,"score":32217.252159617918},{"content":"#[test]\n\nfn gfn_comparison() {\n\n let gf5 = Gf::new(5).unwrap();\n\n\n\n let gfn3 = GfNum::new(&gf5, 3);\n\n let gfn4 = GfNum::new(&gf5, 4);\n\n\n\n assert_eq!(gfn3, gfn3);\n\n assert_eq!(gfn3, 8);\n\n assert_eq!(8, gfn3);\n\n\n\n assert!(gfn3 < gfn4);\n\n assert!(gfn3 < 9);\n\n assert!(8 < gfn4);\n\n\n\n assert!(!gfn3.is_zero())\n\n}","file_path":"src/gf/tests.rs","rank":8,"score":32217.252159617918},{"content":"#[test]\n\nfn inverse_correct() {\n\n let gf5 = Gf::new(5).unwrap();\n\n assert!(gf5.mul_inv(0).is_none());\n\n assert_eq!(gf5.mul_inv(1).unwrap(), 1);\n\n assert_eq!(gf5.mul_inv(2).unwrap(), 3);\n\n assert_eq!(gf5.mul_inv(3).unwrap(), 2);\n\n assert_eq!(gf5.mul_inv(4).unwrap(), 4);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":9,"score":32217.252159617918},{"content":"#[test]\n\nfn gfn_sum_works() {\n\n let gf5 = Gf::new(5).unwrap();\n\n\n\n let gfn3 = GfNum::new(&gf5, 3);\n\n let gfn4 = GfNum::new(&gf5, 4);\n\n\n\n let gfn2 = gfn3 + gfn4;\n\n assert_eq!(gfn2.num(), 2);\n\n let gfn3 = gfn2 + 1;\n\n assert_eq!(gfn3.num(), 3);\n\n let gfn0 = 2 + gfn3;\n\n assert_eq!(gfn0.num(), 0);\n\n\n\n let mut num = gfn0;\n\n let gfn1 = GfNum::new(&gf5, 1);\n\n\n\n num += gfn1;\n\n assert_eq!(num.num(), 1);\n\n num += 1;\n\n assert_eq!(num.num(), 2);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":10,"score":31023.157211942747},{"content":"#[test]\n\nfn gfn_sub_works() {\n\n let gf5 = Gf::new(5).unwrap();\n\n\n\n let gfn3 = GfNum::new(&gf5, 3);\n\n let gfn4 = GfNum::new(&gf5, 4);\n\n\n\n let gfn4 = gfn3 - gfn4;\n\n assert_eq!(gfn4.num(), 4);\n\n let gfn3 = gfn4 - 1;\n\n assert_eq!(gfn3.num(), 3);\n\n let gfn1 = 2 - gfn3;\n\n assert_eq!(gfn1.num(), 1);\n\n\n\n let mut num = gfn1;\n\n let gfn1 = GfNum::new(&gf5, 1);\n\n\n\n num -= gfn1;\n\n assert_eq!(num.num(), 0);\n\n num -= 2;\n\n assert_eq!(num.num(), 3);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":11,"score":31023.157211942747},{"content":"#[test]\n\nfn gfn_div_works() {\n\n let gf5 = Gf::new(5).unwrap();\n\n\n\n let gfn3 = GfNum::new(&gf5, 3);\n\n let gfn4 = GfNum::new(&gf5, 4);\n\n\n\n let gfn2 = gfn3 / gfn4;\n\n assert_eq!(gfn2.num(), 2);\n\n let gfn1 = gfn2 / 2;\n\n assert_eq!(gfn1.num(), 1);\n\n let gfn3 = 3 / gfn1;\n\n assert_eq!(gfn3.num(), 3);\n\n\n\n let mut num = gfn3;\n\n let gfn2 = GfNum::new(&gf5, 2);\n\n\n\n num /= gfn2;\n\n assert_eq!(num.num(), 4);\n\n num /= 2;\n\n assert_eq!(num.num(), 2);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":12,"score":31023.157211942747},{"content":"#[test]\n\nfn gfn_neg_works() {\n\n let gf5 = Gf::new(5).unwrap();\n\n\n\n let gfn4 = GfNum::new(&gf5, 4);\n\n\n\n let gfn1 = -gfn4;\n\n assert_eq!(gfn1.num(), 1);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":13,"score":31023.157211942747},{"content":"#[test]\n\nfn gfn_mul_works() {\n\n let gf5 = Gf::new(5).unwrap();\n\n\n\n let gfn3 = GfNum::new(&gf5, 3);\n\n let gfn4 = GfNum::new(&gf5, 4);\n\n\n\n let gfn2 = gfn3 * gfn4;\n\n assert_eq!(gfn2.num(), 2);\n\n let gfn4 = gfn2 * 2;\n\n assert_eq!(gfn4.num(), 4);\n\n let gfn3 = 2 * gfn4;\n\n assert_eq!(gfn3.num(), 3);\n\n\n\n let mut num = gfn3;\n\n let gfn2 = GfNum::new(&gf5, 2);\n\n\n\n num *= gfn2;\n\n assert_eq!(num.num(), 1);\n\n num *= 0;\n\n assert_eq!(num.num(), 0);\n\n}\n\n\n","file_path":"src/gf/tests.rs","rank":14,"score":31023.157211942747},{"content":" Ok(Gf(Arc::new(field)))\n\n }\n\n pub fn clone(field: &Gf) -> Self { Gf(Arc::clone(&field.0)) }\n\n}\n\n\n\nimpl cmp::PartialEq for Gf {\n\n fn eq (&self, other: &Gf) -> bool { self.base == other.base }\n\n}\n\n\n\nimpl cmp::Eq for Gf {}\n\n\n\nimpl GfBase {\n\n fn new(base: usize) -> Result<GfBase> {\n\n if base == 0 { return Err(GfError::EmptyField) }\n\n if base == 1 { return Err(GfError::ZeroField) }\n\n // guarantees that base could be safely converted to isize\n\n if usize::max_value() / (base - 1) < (base - 1) {\n\n return Err(GfError::TooLargeField(base))\n\n }\n\n\n","file_path":"src/gf/gf.rs","rank":31,"score":11761.879141269344},{"content":"use std::boxed::Box;\n\nuse std::sync::Arc;\n\nuse std::ops;\n\nuse std::fmt;\n\nuse std::vec;\n\nuse std::cmp;\n\n\n\n#[derive(Debug)]\n\npub enum GfError {\n\n EmptyField,\n\n ZeroField,\n\n TooLargeField(usize),\n\n NotAField(usize),\n\n}\n\n\n\nimpl fmt::Display for GfError {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match *self {\n\n GfError::EmptyField =>\n\n write!(f, \"GF[0] is empty\"),\n","file_path":"src/gf/gf.rs","rank":32,"score":11758.843323798412},{"content":" GfError::ZeroField =>\n\n write!(f, \"GF[1] can contain only zero\"),\n\n GfError::TooLargeField(base) =>\n\n write!(f, \"GF[{}] is too large\", base),\n\n GfError::NotAField(base) =>\n\n write!(f, \"field GF[{}] do not exist\", base),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/gf/gf.rs","rank":33,"score":11758.260691374599},{"content":" inv[i] = tmp;\n\n inv[tmp] = i;\n\n }\n\n\n\n let inv = inv.into_boxed_slice();\n\n Ok(GfBase {base, inv})\n\n }\n\n\n\n pub fn base(&self) -> usize { self.base }\n\n\n\n pub fn mul_inv(&self, val: usize) -> Option<usize> {\n\n match val % self.base {\n\n 0 => None,\n\n i => Some(self.inv[i]),\n\n }\n\n }\n\n}\n","file_path":"src/gf/gf.rs","rank":34,"score":11755.252285111323},{"content":" let i_base = base as isize;\n\n fn inv_calc(base: isize, val: isize) -> Result<usize> {\n\n let (mut u0, mut u1, mut u2) = (base, 1isize, 0isize);\n\n let (mut v0, mut v1, mut v2) = (val, 0isize, 1isize);\n\n let (mut w0, mut w1, mut w2); let mut q;\n\n\n\n while v0 > 0 {\n\n q = u0 / v0;\n\n w0 = u0 - q * v0; w1 = u1 - q * v1; w2 = u2 - q * v2;\n\n u0 = v0; u1 = v1; u2 = v2; v0 = w0; v1 = w1; v2 = w2;\n\n }\n\n if u0 > 1 { return Err(GfError::NotAField(base as usize)) }\n\n Ok(if u2 < 0 { base + u2 } else { u2 } as usize)\n\n }\n\n\n\n let mut inv = vec![0; base];\n\n inv[1] = 1;\n\n for i in 2..base {\n\n if inv[i] != 0 { continue; }\n\n let tmp = inv_calc(i_base, i as isize)?;\n","file_path":"src/gf/gf.rs","rank":35,"score":11754.889078997085},{"content":" write!(f, \" ]\")\n\n }\n\n}\n\n\n\nimpl GfPoly {\n\n pub fn new(field: &Gf, value: usize) -> GfPoly {\n\n let mut poly = GfPoly {\n\n field: Gf::clone(field),\n\n poly: vec![GfNum::new(field, value)]\n\n };\n\n poly.normalize();\n\n poly\n\n }\n\n\n\n pub fn from_gf_num(value: GfNum) -> GfPoly {\n\n let mut poly = GfPoly {\n\n field: Gf::clone(value.field()),\n\n poly: vec![value]\n\n };\n\n poly.normalize();\n","file_path":"src/gf_poly/gf_poly.rs","rank":36,"score":11046.088548658334},{"content":" poly\n\n }\n\n\n\n pub fn from_vec(field: &Gf, value: Vec<usize>) -> GfPoly {\n\n let mut poly = GfPoly {\n\n field: Gf::clone(field),\n\n poly: GfNum::from_vec(field, value)\n\n };\n\n poly.normalize();\n\n poly\n\n }\n\n\n\n pub fn into_vec(self) -> Vec<usize> {\n\n self.poly.into_iter().map(|x| x.into_num() ).collect()\n\n }\n\n\n\n pub fn into_gf_num_vec(self) -> Vec<GfNum> { self.poly }\n\n\n\n pub fn field(&self) -> &Gf { &self.field }\n\n\n","file_path":"src/gf_poly/gf_poly.rs","rank":37,"score":11045.847927471043},{"content":" pub fn poly(&self) -> &[GfNum] { &self.poly }\n\n\n\n pub fn len(&self) -> usize { self.poly.len() }\n\n\n\n pub fn deg(&self) -> usize {\n\n assert!(self.poly.len() > 0, \"Degree is undefined for zero polynomial\");\n\n self.poly.len() - 1\n\n }\n\n\n\n pub fn is_zero(&self) -> bool { self.poly.is_empty() }\n\n\n\n pub fn set_zero(&mut self) { self.poly.clear(); }\n\n\n\n pub fn normalize(&mut self) {\n\n if let Some(i) = self.poly.iter().rposition(|x| !x.is_zero()) {\n\n self.poly.truncate(i + 1);\n\n } else { self.poly.clear(); }\n\n }\n\n}\n","file_path":"src/gf_poly/gf_poly.rs","rank":38,"score":11044.412890654716},{"content":"use crate::{Gf, GfNum};\n\n\n\nuse std::vec::Vec;\n\nuse std::fmt;\n\nuse std::ops;\n\nuse std::cmp;\n\n\n\n#[derive(Debug, Clone)]\n\npub struct GfPoly {\n\n field: Gf,\n\n poly: Vec<GfNum>,\n\n}\n\n\n\nimpl fmt::Display for GfPoly {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"[ \")?;\n\n for i in 0..self.poly.len() {\n\n if i > 0 { write!(f, \", \")?; }\n\n write!(f, \"{}\", self.poly[i])?;\n\n }\n","file_path":"src/gf_poly/gf_poly.rs","rank":39,"score":11043.462311455904},{"content":"mod gf;\n\nmod gf_num;\n\n\n\npub use gf::*;\n\npub use gf_num::*;\n\n\n\n#[cfg(test)]\n\nmod tests;\n","file_path":"src/gf/mod.rs","rank":40,"score":9251.524598405866},{"content":"use crate::{Gf, GfNum};\n\n\n\n#[test]\n","file_path":"src/gf/tests.rs","rank":41,"score":9249.153544166593},{"content":"use crate::{Gf, GfNum, GfPoly};\n\n\n\nuse std::fmt::Write;\n\nuse std::vec;\n\n\n\n#[test]\n","file_path":"src/gf_poly/tests.rs","rank":42,"score":8801.440056793263},{"content":" assert_eq!(poly.len(), 3);\n\n assert_eq!(poly.deg(), 2);\n\n assert_eq!(poly.into_vec(), vec![1, 2, 3]);\n\n\n\n let mut poly = GfPoly::from_vec(&gf5, vec![1, 2, 3, 0, 0]);\n\n assert_eq!(poly.into_gf_num_vec(), GfNum::from_vec(&gf5, vec![1, 2, 3]));\n\n\n\n let mut poly = GfPoly::from_vec(&gf5, vec![1, 2, 3, 0, 0]);\n\n poly.set_zero();\n\n assert!(poly.is_zero());\n\n}\n\n\n","file_path":"src/gf_poly/tests.rs","rank":43,"score":8801.283784768946},{"content":"mod gf_poly;\n\n\n\npub use gf_poly::*;\n\n\n\n#[cfg(test)]\n\nmod tests;","file_path":"src/gf_poly/mod.rs","rank":44,"score":8800.967237698107},{"content":"mod gf;\n\nmod gf_poly;\n\n\n\npub use gf::*;\n\npub use gf_poly::*;\n","file_path":"src/lib.rs","rank":45,"score":7.171115839365112},{"content":"# Разработка приостановлена\n\nВ данный момент реализация приостановлена, поскольку на сегодняшний день в Rust\n\nотсутствует возможность контроля значения после присваивания. В C++ для этой\n\nцели можно перегрузить `operator=`, в Rust на данный момент сущесвует\n\n[Pre-RFC на введение trait IndexAssing](https://internals.rust-lang.org/t/pre-rfc-split-indexmut-into-indexmut-and-indexassign/10399), который бы позволил контролировать\n\nприсваиваемое значение. В данном проекте это является необходимостью, поскольку\n\nмногочлен над некоторым конечным полем должен состоять из чисел только этого поля.\n\nВ данный момент при реализации IndexMut была бы возможность присвоить\n\nмногочлену над полем `Gf::new(5)` например число из поля `Gf::new(3)`, если\n\nреализовывать многочлен как `Vec<GfNum>`. Если же реализовывать многочлен как\n\n`Vec<usize>` с операциями над заданным полем, то при присвоении нового значения\n\nпо индексу будет возможность присвоить ненормированное значение, что может при\n\nпоследующем выполнении операций приводить к переполнению, к тому же такая реализация\n\nбыла бы очень трудоёмкой. Единственным выходом во втором случае было бы нормирование\n\nчисел в векторе перед выполнением любых операций, но это значительно повысило бы\n\nвремя выполнения программы, по сравнению с возможностью проверки значений в момент\n\nприсвоения, а значит не дало бы выигрыша в производительности по сравнению с\n","file_path":"README.md","rank":46,"score":4.872207067151128},{"content":"MIT License\n\n\n\nCopyright (c) 2020 Vadim Piven\n\n\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\n\nof this software and associated documentation files (the \"Software\"), to deal\n\nin the Software without restriction, including without limitation the rights\n\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n\ncopies of the Software, and to permit persons to whom the Software is\n\nfurnished to do so, subject to the following conditions:\n\n\n\nThe above copyright notice and this permission notice shall be included in all\n\ncopies or substantial portions of the Software.\n\n\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\nSOFTWARE.\n","file_path":"LICENSE.md","rank":47,"score":1.0188892796498012}],"string":"[\n {\n \"content\": \"#[test]\\n\\nfn not_a_field() {\\n\\n assert!(Gf::new(0).is_err());\\n\\n assert!(Gf::new(1).is_err());\\n\\n assert!(Gf::new(4).is_err());\\n\\n assert!(Gf::new(isize::max_value() as usize).is_err());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 0,\n \"score\": 54802.981125424296\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn gfn_division_by_zero() {\\n\\n let gf2 = Gf::new(2).unwrap();\\n\\n let mut num = GfNum::new(&gf2, 0);\\n\\n num /= 0;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 1,\n \"score\": 50194.56280996447\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn mul_inv_for_zero() {\\n\\n let gf2 = Gf::new(2).unwrap();\\n\\n let num = GfNum::new(&gf2, 0);\\n\\n num.mul_inv();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 2,\n \"score\": 50194.56280996447\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic]\\n\\nfn gf_poly_degree_for_zero() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n let poly = GfPoly::new(&gf5, 5);\\n\\n poly.deg();\\n\\n}\\n\",\n \"file_path\": \"src/gf_poly/tests.rs\",\n \"rank\": 3,\n \"score\": 49286.28424458546\n },\n {\n \"content\": \"#[test]\\n\\nfn gf_works() {\\n\\n let gf2 = Gf::new(2);\\n\\n assert!(gf2.is_ok());\\n\\n let gf2 = gf2.unwrap();\\n\\n assert_eq!(gf2.base(), 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 4,\n \"score\": 34862.578204158606\n },\n {\n \"content\": \"type Result<T> = std::result::Result<T, GfError>;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct GfBase {\\n\\n base: usize,\\n\\n inv: Box<[usize]>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Gf(Arc<GfBase>);\\n\\n\\n\\nimpl ops::Deref for Gf {\\n\\n type Target = Arc<GfBase>;\\n\\n\\n\\n fn deref(&self) -> &Self::Target { &self.0 }\\n\\n}\\n\\n\\n\\nimpl Gf {\\n\\n pub fn new(base: usize) -> Result<Gf> {\\n\\n let field = GfBase::new(base)?;\\n\",\n \"file_path\": \"src/gf/gf.rs\",\n \"rank\": 5,\n \"score\": 32704.07879118123\n },\n {\n \"content\": \"#[test]\\n\\nfn gf_poly_works() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n\\n\\n let mut output = String::new();\\n\\n let poly = GfPoly::new(&gf5, 3);\\n\\n write!(&mut output, \\\"{}\\\", poly).unwrap();\\n\\n assert_eq!(output, \\\"[ 3 ]\\\");\\n\\n\\n\\n let mut output = String::new();\\n\\n let num = GfNum::new(&gf5, 5);\\n\\n let poly = GfPoly::from_gf_num(num);\\n\\n write!(&mut output, \\\"{}\\\", poly).unwrap();\\n\\n assert_eq!(output, \\\"[ ]\\\");\\n\\n\\n\\n let mut output = String::new();\\n\\n let poly = GfPoly::from_vec(&gf5, vec![1, 2, 3, 0, 0]);\\n\\n write!(&mut output, \\\"{}\\\", poly).unwrap();\\n\\n assert_eq!(output, \\\"[ 1, 2, 3 ]\\\");\\n\\n assert_eq!(poly.field(), &gf5);\\n\\n assert_eq!(poly.poly(), &GfNum::from_vec(&gf5, vec![1, 2, 3])[..]);\\n\",\n \"file_path\": \"src/gf_poly/tests.rs\",\n \"rank\": 6,\n \"score\": 32652.8048974268\n },\n {\n \"content\": \"#[test]\\n\\nfn gfn_works() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n let num = GfNum::new(&gf5, 7);\\n\\n assert_eq!(num.field(), &gf5);\\n\\n assert_eq!(num.num(), 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 7,\n \"score\": 32217.252159617918\n },\n {\n \"content\": \"#[test]\\n\\nfn gfn_comparison() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n\\n\\n let gfn3 = GfNum::new(&gf5, 3);\\n\\n let gfn4 = GfNum::new(&gf5, 4);\\n\\n\\n\\n assert_eq!(gfn3, gfn3);\\n\\n assert_eq!(gfn3, 8);\\n\\n assert_eq!(8, gfn3);\\n\\n\\n\\n assert!(gfn3 < gfn4);\\n\\n assert!(gfn3 < 9);\\n\\n assert!(8 < gfn4);\\n\\n\\n\\n assert!(!gfn3.is_zero())\\n\\n}\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 8,\n \"score\": 32217.252159617918\n },\n {\n \"content\": \"#[test]\\n\\nfn inverse_correct() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n assert!(gf5.mul_inv(0).is_none());\\n\\n assert_eq!(gf5.mul_inv(1).unwrap(), 1);\\n\\n assert_eq!(gf5.mul_inv(2).unwrap(), 3);\\n\\n assert_eq!(gf5.mul_inv(3).unwrap(), 2);\\n\\n assert_eq!(gf5.mul_inv(4).unwrap(), 4);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 9,\n \"score\": 32217.252159617918\n },\n {\n \"content\": \"#[test]\\n\\nfn gfn_sum_works() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n\\n\\n let gfn3 = GfNum::new(&gf5, 3);\\n\\n let gfn4 = GfNum::new(&gf5, 4);\\n\\n\\n\\n let gfn2 = gfn3 + gfn4;\\n\\n assert_eq!(gfn2.num(), 2);\\n\\n let gfn3 = gfn2 + 1;\\n\\n assert_eq!(gfn3.num(), 3);\\n\\n let gfn0 = 2 + gfn3;\\n\\n assert_eq!(gfn0.num(), 0);\\n\\n\\n\\n let mut num = gfn0;\\n\\n let gfn1 = GfNum::new(&gf5, 1);\\n\\n\\n\\n num += gfn1;\\n\\n assert_eq!(num.num(), 1);\\n\\n num += 1;\\n\\n assert_eq!(num.num(), 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 10,\n \"score\": 31023.157211942747\n },\n {\n \"content\": \"#[test]\\n\\nfn gfn_sub_works() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n\\n\\n let gfn3 = GfNum::new(&gf5, 3);\\n\\n let gfn4 = GfNum::new(&gf5, 4);\\n\\n\\n\\n let gfn4 = gfn3 - gfn4;\\n\\n assert_eq!(gfn4.num(), 4);\\n\\n let gfn3 = gfn4 - 1;\\n\\n assert_eq!(gfn3.num(), 3);\\n\\n let gfn1 = 2 - gfn3;\\n\\n assert_eq!(gfn1.num(), 1);\\n\\n\\n\\n let mut num = gfn1;\\n\\n let gfn1 = GfNum::new(&gf5, 1);\\n\\n\\n\\n num -= gfn1;\\n\\n assert_eq!(num.num(), 0);\\n\\n num -= 2;\\n\\n assert_eq!(num.num(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 11,\n \"score\": 31023.157211942747\n },\n {\n \"content\": \"#[test]\\n\\nfn gfn_div_works() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n\\n\\n let gfn3 = GfNum::new(&gf5, 3);\\n\\n let gfn4 = GfNum::new(&gf5, 4);\\n\\n\\n\\n let gfn2 = gfn3 / gfn4;\\n\\n assert_eq!(gfn2.num(), 2);\\n\\n let gfn1 = gfn2 / 2;\\n\\n assert_eq!(gfn1.num(), 1);\\n\\n let gfn3 = 3 / gfn1;\\n\\n assert_eq!(gfn3.num(), 3);\\n\\n\\n\\n let mut num = gfn3;\\n\\n let gfn2 = GfNum::new(&gf5, 2);\\n\\n\\n\\n num /= gfn2;\\n\\n assert_eq!(num.num(), 4);\\n\\n num /= 2;\\n\\n assert_eq!(num.num(), 2);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 12,\n \"score\": 31023.157211942747\n },\n {\n \"content\": \"#[test]\\n\\nfn gfn_neg_works() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n\\n\\n let gfn4 = GfNum::new(&gf5, 4);\\n\\n\\n\\n let gfn1 = -gfn4;\\n\\n assert_eq!(gfn1.num(), 1);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 13,\n \"score\": 31023.157211942747\n },\n {\n \"content\": \"#[test]\\n\\nfn gfn_mul_works() {\\n\\n let gf5 = Gf::new(5).unwrap();\\n\\n\\n\\n let gfn3 = GfNum::new(&gf5, 3);\\n\\n let gfn4 = GfNum::new(&gf5, 4);\\n\\n\\n\\n let gfn2 = gfn3 * gfn4;\\n\\n assert_eq!(gfn2.num(), 2);\\n\\n let gfn4 = gfn2 * 2;\\n\\n assert_eq!(gfn4.num(), 4);\\n\\n let gfn3 = 2 * gfn4;\\n\\n assert_eq!(gfn3.num(), 3);\\n\\n\\n\\n let mut num = gfn3;\\n\\n let gfn2 = GfNum::new(&gf5, 2);\\n\\n\\n\\n num *= gfn2;\\n\\n assert_eq!(num.num(), 1);\\n\\n num *= 0;\\n\\n assert_eq!(num.num(), 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 14,\n \"score\": 31023.157211942747\n },\n {\n \"content\": \" Ok(Gf(Arc::new(field)))\\n\\n }\\n\\n pub fn clone(field: &Gf) -> Self { Gf(Arc::clone(&field.0)) }\\n\\n}\\n\\n\\n\\nimpl cmp::PartialEq for Gf {\\n\\n fn eq (&self, other: &Gf) -> bool { self.base == other.base }\\n\\n}\\n\\n\\n\\nimpl cmp::Eq for Gf {}\\n\\n\\n\\nimpl GfBase {\\n\\n fn new(base: usize) -> Result<GfBase> {\\n\\n if base == 0 { return Err(GfError::EmptyField) }\\n\\n if base == 1 { return Err(GfError::ZeroField) }\\n\\n // guarantees that base could be safely converted to isize\\n\\n if usize::max_value() / (base - 1) < (base - 1) {\\n\\n return Err(GfError::TooLargeField(base))\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/gf/gf.rs\",\n \"rank\": 31,\n \"score\": 11761.879141269344\n },\n {\n \"content\": \"use std::boxed::Box;\\n\\nuse std::sync::Arc;\\n\\nuse std::ops;\\n\\nuse std::fmt;\\n\\nuse std::vec;\\n\\nuse std::cmp;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum GfError {\\n\\n EmptyField,\\n\\n ZeroField,\\n\\n TooLargeField(usize),\\n\\n NotAField(usize),\\n\\n}\\n\\n\\n\\nimpl fmt::Display for GfError {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match *self {\\n\\n GfError::EmptyField =>\\n\\n write!(f, \\\"GF[0] is empty\\\"),\\n\",\n \"file_path\": \"src/gf/gf.rs\",\n \"rank\": 32,\n \"score\": 11758.843323798412\n },\n {\n \"content\": \" GfError::ZeroField =>\\n\\n write!(f, \\\"GF[1] can contain only zero\\\"),\\n\\n GfError::TooLargeField(base) =>\\n\\n write!(f, \\\"GF[{}] is too large\\\", base),\\n\\n GfError::NotAField(base) =>\\n\\n write!(f, \\\"field GF[{}] do not exist\\\", base),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf/gf.rs\",\n \"rank\": 33,\n \"score\": 11758.260691374599\n },\n {\n \"content\": \" inv[i] = tmp;\\n\\n inv[tmp] = i;\\n\\n }\\n\\n\\n\\n let inv = inv.into_boxed_slice();\\n\\n Ok(GfBase {base, inv})\\n\\n }\\n\\n\\n\\n pub fn base(&self) -> usize { self.base }\\n\\n\\n\\n pub fn mul_inv(&self, val: usize) -> Option<usize> {\\n\\n match val % self.base {\\n\\n 0 => None,\\n\\n i => Some(self.inv[i]),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/gf/gf.rs\",\n \"rank\": 34,\n \"score\": 11755.252285111323\n },\n {\n \"content\": \" let i_base = base as isize;\\n\\n fn inv_calc(base: isize, val: isize) -> Result<usize> {\\n\\n let (mut u0, mut u1, mut u2) = (base, 1isize, 0isize);\\n\\n let (mut v0, mut v1, mut v2) = (val, 0isize, 1isize);\\n\\n let (mut w0, mut w1, mut w2); let mut q;\\n\\n\\n\\n while v0 > 0 {\\n\\n q = u0 / v0;\\n\\n w0 = u0 - q * v0; w1 = u1 - q * v1; w2 = u2 - q * v2;\\n\\n u0 = v0; u1 = v1; u2 = v2; v0 = w0; v1 = w1; v2 = w2;\\n\\n }\\n\\n if u0 > 1 { return Err(GfError::NotAField(base as usize)) }\\n\\n Ok(if u2 < 0 { base + u2 } else { u2 } as usize)\\n\\n }\\n\\n\\n\\n let mut inv = vec![0; base];\\n\\n inv[1] = 1;\\n\\n for i in 2..base {\\n\\n if inv[i] != 0 { continue; }\\n\\n let tmp = inv_calc(i_base, i as isize)?;\\n\",\n \"file_path\": \"src/gf/gf.rs\",\n \"rank\": 35,\n \"score\": 11754.889078997085\n },\n {\n \"content\": \" write!(f, \\\" ]\\\")\\n\\n }\\n\\n}\\n\\n\\n\\nimpl GfPoly {\\n\\n pub fn new(field: &Gf, value: usize) -> GfPoly {\\n\\n let mut poly = GfPoly {\\n\\n field: Gf::clone(field),\\n\\n poly: vec![GfNum::new(field, value)]\\n\\n };\\n\\n poly.normalize();\\n\\n poly\\n\\n }\\n\\n\\n\\n pub fn from_gf_num(value: GfNum) -> GfPoly {\\n\\n let mut poly = GfPoly {\\n\\n field: Gf::clone(value.field()),\\n\\n poly: vec![value]\\n\\n };\\n\\n poly.normalize();\\n\",\n \"file_path\": \"src/gf_poly/gf_poly.rs\",\n \"rank\": 36,\n \"score\": 11046.088548658334\n },\n {\n \"content\": \" poly\\n\\n }\\n\\n\\n\\n pub fn from_vec(field: &Gf, value: Vec<usize>) -> GfPoly {\\n\\n let mut poly = GfPoly {\\n\\n field: Gf::clone(field),\\n\\n poly: GfNum::from_vec(field, value)\\n\\n };\\n\\n poly.normalize();\\n\\n poly\\n\\n }\\n\\n\\n\\n pub fn into_vec(self) -> Vec<usize> {\\n\\n self.poly.into_iter().map(|x| x.into_num() ).collect()\\n\\n }\\n\\n\\n\\n pub fn into_gf_num_vec(self) -> Vec<GfNum> { self.poly }\\n\\n\\n\\n pub fn field(&self) -> &Gf { &self.field }\\n\\n\\n\",\n \"file_path\": \"src/gf_poly/gf_poly.rs\",\n \"rank\": 37,\n \"score\": 11045.847927471043\n },\n {\n \"content\": \" pub fn poly(&self) -> &[GfNum] { &self.poly }\\n\\n\\n\\n pub fn len(&self) -> usize { self.poly.len() }\\n\\n\\n\\n pub fn deg(&self) -> usize {\\n\\n assert!(self.poly.len() > 0, \\\"Degree is undefined for zero polynomial\\\");\\n\\n self.poly.len() - 1\\n\\n }\\n\\n\\n\\n pub fn is_zero(&self) -> bool { self.poly.is_empty() }\\n\\n\\n\\n pub fn set_zero(&mut self) { self.poly.clear(); }\\n\\n\\n\\n pub fn normalize(&mut self) {\\n\\n if let Some(i) = self.poly.iter().rposition(|x| !x.is_zero()) {\\n\\n self.poly.truncate(i + 1);\\n\\n } else { self.poly.clear(); }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/gf_poly/gf_poly.rs\",\n \"rank\": 38,\n \"score\": 11044.412890654716\n },\n {\n \"content\": \"use crate::{Gf, GfNum};\\n\\n\\n\\nuse std::vec::Vec;\\n\\nuse std::fmt;\\n\\nuse std::ops;\\n\\nuse std::cmp;\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct GfPoly {\\n\\n field: Gf,\\n\\n poly: Vec<GfNum>,\\n\\n}\\n\\n\\n\\nimpl fmt::Display for GfPoly {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"[ \\\")?;\\n\\n for i in 0..self.poly.len() {\\n\\n if i > 0 { write!(f, \\\", \\\")?; }\\n\\n write!(f, \\\"{}\\\", self.poly[i])?;\\n\\n }\\n\",\n \"file_path\": \"src/gf_poly/gf_poly.rs\",\n \"rank\": 39,\n \"score\": 11043.462311455904\n },\n {\n \"content\": \"mod gf;\\n\\nmod gf_num;\\n\\n\\n\\npub use gf::*;\\n\\npub use gf_num::*;\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\",\n \"file_path\": \"src/gf/mod.rs\",\n \"rank\": 40,\n \"score\": 9251.524598405866\n },\n {\n \"content\": \"use crate::{Gf, GfNum};\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/gf/tests.rs\",\n \"rank\": 41,\n \"score\": 9249.153544166593\n },\n {\n \"content\": \"use crate::{Gf, GfNum, GfPoly};\\n\\n\\n\\nuse std::fmt::Write;\\n\\nuse std::vec;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/gf_poly/tests.rs\",\n \"rank\": 42,\n \"score\": 8801.440056793263\n },\n {\n \"content\": \" assert_eq!(poly.len(), 3);\\n\\n assert_eq!(poly.deg(), 2);\\n\\n assert_eq!(poly.into_vec(), vec![1, 2, 3]);\\n\\n\\n\\n let mut poly = GfPoly::from_vec(&gf5, vec![1, 2, 3, 0, 0]);\\n\\n assert_eq!(poly.into_gf_num_vec(), GfNum::from_vec(&gf5, vec![1, 2, 3]));\\n\\n\\n\\n let mut poly = GfPoly::from_vec(&gf5, vec![1, 2, 3, 0, 0]);\\n\\n poly.set_zero();\\n\\n assert!(poly.is_zero());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/gf_poly/tests.rs\",\n \"rank\": 43,\n \"score\": 8801.283784768946\n },\n {\n \"content\": \"mod gf_poly;\\n\\n\\n\\npub use gf_poly::*;\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\",\n \"file_path\": \"src/gf_poly/mod.rs\",\n \"rank\": 44,\n \"score\": 8800.967237698107\n },\n {\n \"content\": \"mod gf;\\n\\nmod gf_poly;\\n\\n\\n\\npub use gf::*;\\n\\npub use gf_poly::*;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 45,\n \"score\": 7.171115839365112\n },\n {\n \"content\": \"# Разработка приостановлена\\n\\nВ данный момент реализация приостановлена, поскольку на сегодняшний день в Rust\\n\\nотсутствует возможность контроля значения после присваивания. В C++ для этой\\n\\nцели можно перегрузить `operator=`, в Rust на данный момент сущесвует\\n\\n[Pre-RFC на введение trait IndexAssing](https://internals.rust-lang.org/t/pre-rfc-split-indexmut-into-indexmut-and-indexassign/10399), который бы позволил контролировать\\n\\nприсваиваемое значение. В данном проекте это является необходимостью, поскольку\\n\\nмногочлен над некоторым конечным полем должен состоять из чисел только этого поля.\\n\\nВ данный момент при реализации IndexMut была бы возможность присвоить\\n\\nмногочлену над полем `Gf::new(5)` например число из поля `Gf::new(3)`, если\\n\\nреализовывать многочлен как `Vec<GfNum>`. Если же реализовывать многочлен как\\n\\n`Vec<usize>` с операциями над заданным полем, то при присвоении нового значения\\n\\nпо индексу будет возможность присвоить ненормированное значение, что может при\\n\\nпоследующем выполнении операций приводить к переполнению, к тому же такая реализация\\n\\nбыла бы очень трудоёмкой. Единственным выходом во втором случае было бы нормирование\\n\\nчисел в векторе перед выполнением любых операций, но это значительно повысило бы\\n\\nвремя выполнения программы, по сравнению с возможностью проверки значений в момент\\n\\nприсвоения, а значит не дало бы выигрыша в производительности по сравнению с\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 46,\n \"score\": 4.872207067151128\n },\n {\n \"content\": \"MIT License\\n\\n\\n\\nCopyright (c) 2020 Vadim Piven\\n\\n\\n\\nPermission is hereby granted, free of charge, to any person obtaining a copy\\n\\nof this software and associated documentation files (the \\\"Software\\\"), to deal\\n\\nin the Software without restriction, including without limitation the rights\\n\\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n\\ncopies of the Software, and to permit persons to whom the Software is\\n\\nfurnished to do so, subject to the following conditions:\\n\\n\\n\\nThe above copyright notice and this permission notice shall be included in all\\n\\ncopies or substantial portions of the Software.\\n\\n\\n\\nTHE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n\\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n\\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n\\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n\\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n\\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\nSOFTWARE.\\n\",\n \"file_path\": \"LICENSE.md\",\n \"rank\": 47,\n \"score\": 1.0188892796498012\n }\n]","isConversational":false}}},{"rowIdx":795,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/equalizer.rs"},"repo_name":{"kind":"string","value":"joaocarvalhoopen/Audio_filters_in_Rust"},"commit":{"kind":"string","value":"00639f0c30078a5fd3f39a690243f5742743ae02"},"file_code":{"kind":"string","value":"\n\nuse crate::iir_filter::ProcessingBlock; \nuse crate::iir_filter::IIRFilter;\nuse crate::butterworth_filter::make_peak_eq_constant_q;\n\npub struct Equalizer {\n sample_rate: u32,\n bands_vec: Vec<f64>,\n bands_gain_vec: Vec<f64>,\n gain_max_db: f64,\n gain_min_db: f64,\n q_factor: f64,\n iir_filters_vec: Vec<IIRFilter>,\n}\n\nimpl Equalizer {\n pub fn new(sample_rate: u32, bands_vec: & Vec<f64>,\n gain_max_db:f64, gain_min_db:f64,\n q_factor:f64\n ) -> Self {\n let mut equalizer = Equalizer{\n sample_rate,\n bands_vec: bands_vec.clone(),\n bands_gain_vec: vec![0.0; bands_vec.len()],\n gain_max_db,\n gain_min_db,\n q_factor,\n iir_filters_vec: Vec::with_capacity(bands_vec.len())\n };\n equalizer.gen_chain_filters();\n\n equalizer\n }\n\n fn gen_chain_filters(& mut self) {\n for band in & self.bands_vec {\n let frequency_center = *band;\n let gain_db = 0.0; \n let iir_filter = make_peak_eq_constant_q(frequency_center, self.sample_rate, gain_db, Some(self.q_factor));\n self.iir_filters_vec.push(iir_filter); \n }\n }\n\n fn change_filter(& mut self, index: usize) {\n assert!(index < self.bands_vec.len());\n let frequency_center = self.bands_vec[index];\n let gain_db = self.bands_gain_vec[index]; \n let q_factor = Some(self.q_factor);\n \n \n let iir_filter_tmp = make_peak_eq_constant_q(frequency_center, self.sample_rate, gain_db, q_factor);\n \n \n \n \n \n let _ = self.iir_filters_vec[index].set_coefficients(& iir_filter_tmp.a_coeffs, & iir_filter_tmp.b_coeffs);\n }\n\n pub fn get_bands_freq(& self, index: usize) -> f64 {\n assert!(index < self.bands_vec.len());\n self.bands_vec[index]\n }\n\n pub fn get_band_gain(& self, index: usize) -> f64 {\n assert!(index < self.bands_vec.len());\n self.bands_gain_vec[index]\n }\n\n pub fn set_band_gain(& mut self, index: usize, gain_db: f64) -> Result<(), String> {\n assert!(index < self.bands_vec.len());\n if gain_db < self.gain_min_db || gain_db > self.gain_max_db {\n return Err(format!(\"Error: invalid gain value {}, must be in the interval [{}, {}]\",\n gain_db, self.gain_min_db, self.gain_max_db));\n }\n self.bands_gain_vec[index] = gain_db;\n self.change_filter(index);\n \n Ok(())\n }\n\n pub fn make_equalizer_10_band(sample_rate: u32) -> Equalizer {\n \n \n \n \n \n let bands_vec = vec![\n 29.0, \n 59.0, \n 119.0, \n 237.0, \n 474.0, \n 947.0, \n 1889.0, \n 3770.0, \n 7523.0, \n 15011.0 \n ];\n\n let gain_max_db = 12.0; \n let gain_min_db = -24.0; \n \n\n \n \n let q_factor = 2.0 * f64::sqrt(2.0); \n\n let equalizer_10_band = Equalizer::new(sample_rate, & bands_vec, gain_max_db, gain_min_db, q_factor);\n\n equalizer_10_band\n }\n\n}\n\nimpl ProcessingBlock for Equalizer {\n fn process(& mut self, sample: f64) -> f64 {\n let mut sample_t = sample;\n for iir_filter in & mut self.iir_filters_vec {\n sample_t = iir_filter.process(sample_t);\n }\n\n sample_t\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::iir_filter::ProcessingBlock; \nuse crate::iir_filter::IIRFilter;\nuse crate::butterworth_filter::make_peak_eq_constant_q;\n\npub struct Equalizer {\n sample_rate: u32,\n bands_vec: Vec<f64>,\n bands_gain_vec: Vec<f64>,\n gain_max_db: f64,\n gain_min_db: f64,\n q_factor: f64,\n iir_filters_vec: Vec<IIRFilter>,\n}\n\nimpl Equalizer {\n pub fn new(sample_rate: u32, bands_vec: & Vec<f64>,\n gain_max_db:f64, gain_min_db:f64,\n q_factor:f64\n ) -> Self {\n let mut equalizer = Equalizer{\n sample_rate,\n bands_vec: bands_vec.clone(),\n bands_gain_vec: vec![0.0; bands_vec.len()],\n gain_max_db,\n gain_min_db,\n q_factor,\n iir_filters_vec: Vec::with_capacity(bands_vec.len())\n };\n equalizer.gen_chain_filters();\n\n equalizer\n }\n\n fn gen_chain_filters(& mut self) {\n f"},"suffix":{"kind":"string","value":" self.iir_filters_vec.push(iir_filter); \n }\n }\n\n fn change_filter(& mut self, index: usize) {\n assert!(index < self.bands_vec.len());\n let frequency_center = self.bands_vec[index];\n let gain_db = self.bands_gain_vec[index]; \n let q_factor = Some(self.q_factor);\n \n \n let iir_filter_tmp = make_peak_eq_constant_q(frequency_center, self.sample_rate, gain_db, q_factor);\n \n \n \n \n \n let _ = self.iir_filters_vec[index].set_coefficients(& iir_filter_tmp.a_coeffs, & iir_filter_tmp.b_coeffs);\n }\n\n pub fn get_bands_freq(& self, index: usize) -> f64 {\n assert!(index < self.bands_vec.len());\n self.bands_vec[index]\n }\n\n pub fn get_band_gain(& self, index: usize) -> f64 {\n assert!(index < self.bands_vec.len());\n self.bands_gain_vec[index]\n }\n\n pub fn set_band_gain(& mut self, index: usize, gain_db: f64) -> Result<(), String> {\n assert!(index < self.bands_vec.len());\n if gain_db < self.gain_min_db || gain_db > self.gain_max_db {\n return Err(format!(\"Error: invalid gain value {}, must be in the interval [{}, {}]\",\n gain_db, self.gain_min_db, self.gain_max_db));\n }\n self.bands_gain_vec[index] = gain_db;\n self.change_filter(index);\n \n Ok(())\n }\n\n pub fn make_equalizer_10_band(sample_rate: u32) -> Equalizer {\n \n \n \n \n \n let bands_vec = vec![\n 29.0, \n 59.0, \n 119.0, \n 237.0, \n 474.0, \n 947.0, \n 1889.0, \n 3770.0, \n 7523.0, \n 15011.0 \n ];\n\n let gain_max_db = 12.0; \n let gain_min_db = -24.0; \n \n\n \n \n let q_factor = 2.0 * f64::sqrt(2.0); \n\n let equalizer_10_band = Equalizer::new(sample_rate, & bands_vec, gain_max_db, gain_min_db, q_factor);\n\n equalizer_10_band\n }\n\n}\n\nimpl ProcessingBlock for Equalizer {\n fn process(& mut self, sample: f64) -> f64 {\n let mut sample_t = sample;\n for iir_filter in & mut self.iir_filters_vec {\n sample_t = iir_filter.process(sample_t);\n }\n\n sample_t\n }\n}\n"},"middle":{"kind":"string","value":"or band in & self.bands_vec {\n let frequency_center = *band;\n let gain_db = 0.0; \n let iir_filter = make_peak_eq_constant_q(frequency_center, self.sample_rate, gain_db, Some(self.q_factor));\n "},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"/// Creates a low-pass filter\n\n///\n\n/// In Python: \n\n/// >>> filter = make_lowpass(1000, 48000)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\n\n/// 0.008555138626189618, 0.004277569313094809]\n\n/// \n\n/// In Rust:\n\n/// >>> let filter = make_lowpass(1000, 48000);\n\n/// >>> let res_coeffs: Vec<f64> = filter.a_coeffs.iter.extends(filter.b_coeffs).collect();\n\n/// >>> println!(\"{}\", res_coeffs);\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\n\n/// 0.008555138626189618, 0.004277569313094809]\n\n///\n\npub fn make_lowpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64;\n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n let alpha = _sin / (2.0 * q_factor);\n\n \n\n let b0 = (1.0 - _cos) / 2.0;\n\n let b1 = 1.0 - _cos;\n\n \n\n let a0 = 1.0 + alpha;\n\n let a1 = -2.0 * _cos;\n\n let a2 = 1.0 - alpha;\n\n \n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b0]);\n\n \n\n filter\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":0,"score":115298.8387382214},{"content":"/// Creates a notch filter\n\n///\n\n/// In Python: \n\n/// >>> filter = make_notch(1000, 48000, 10)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [, , , ,\n\n/// , ]\n\n/// \n\npub fn make_notch(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64;\n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n use std::f64::consts::E;\n\n let alpha = _sin * f64::sinh((f64::log(2.0,E) / 2.0) * q_factor * (w0 /_sin ));\n\n \n\n let b0 = 1.0;\n\n let b1 = -2.0 * _cos;\n\n\n\n let a0 = 1.0 + alpha;\n\n let a1 = -2.0 * _cos;\n\n let a2 = 1.0 - alpha;\n\n \n","file_path":"src/butterworth_filter.rs","rank":1,"score":115293.30429982745},{"content":"/// Creates a high-pass filter\n\n/// \n\n/// In Python:\n\n/// >>> filter = make_highpass(1000, 48000)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.9957224306869052,\n\n/// -1.9914448613738105, 0.9957224306869052]\n\n/// \n\npub fn make_highpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64; \n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n let alpha = _sin / (2.0 * q_factor);\n\n\n\n let b0 = (1.0 + _cos) / 2.0;\n\n let b1 = -1.0 - _cos;\n\n\n\n let a0 = 1.0 + alpha;\n\n let a1 = -2.0 * _cos;\n\n let a2 = 1.0 - alpha;\n\n\n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b0]);\n\n \n\n filter\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":2,"score":115293.30429982746},{"content":"/// Creates an all-pass filter\n\n/// \n\n/// In Python:\n\n/// >>> filter = make_allpass(1000, 48000)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.9077040443587427,\n\n/// -1.9828897227476208, 1.0922959556412573]\n\n///\n\npub fn make_allpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64;\n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n let alpha = _sin / (2.0 * q_factor);\n\n\n\n let b0 = 1.0 - alpha;\n\n let b1 = -2.0 * _cos;\n\n let b2 = 1.0 + alpha;\n\n\n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [b2, b1, b0], & [b0, b1, b2]);\n\n \n\n filter\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":3,"score":115293.30429982746},{"content":"/// Creates a band-pass filter\n\n/// \n\n/// In Python:\n\n/// >>> filter = make_bandpass(1000, 48000)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.06526309611002579,\n\n/// 0, -0.06526309611002579]\n\n/// \n\npub fn make_bandpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64;\n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n let alpha = _sin / (2.0 * q_factor);\n\n\n\n let b0 = _sin / 2.0;\n\n let b1 = 0.0;\n\n let b2 = -b0;\n\n\n\n let a0 = 1.0 + alpha;\n\n let a1 = -2.0 * _cos;\n\n let a2 = 1.0 - alpha;\n\n\n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\n\n \n\n filter\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":4,"score":115293.30429982745},{"content":"/// Creates a peak filter\n\n///\n\n/// In Python: \n\n/// >>> filter = make_peak(1000, 48000, 6)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [1.0653405327119334, -1.9828897227476208, 0.9346594672880666, 1.1303715025601122,\n\n/// -1.9828897227476208, 0.8696284974398878]\n\n///\n\npub fn make_peak(frequency: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64;\n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n let alpha = _sin / (2.0 * q_factor);\n\n let big_a = 10.0_f64.powf(gain_db / 40.0);\n\n\n\n let b0 = 1.0 + alpha * big_a;\n\n let b1 = -2.0 * _cos;\n\n let b2 = 1.0 - alpha * big_a;\n\n let a0 = 1.0 + alpha / big_a;\n\n let a1 = -2.0 * _cos;\n\n let a2 = 1.0 - alpha / big_a;\n\n\n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\n\n \n\n filter\n\n\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":5,"score":112936.55210617889},{"content":"/// Creates a low-shelf filter\n\n/// \n\n/// In Python:\n\n/// >>> filter = make_lowshelf(1000, 48000, 6)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [3.0409336710888786, -5.608870992220748, 2.602157875636628, 3.139954022810743,\n\n/// -5.591841778072785, 2.5201667380627257]\n\n/// \n\npub fn make_lowshelf(frequency: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64;\n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n let alpha = _sin / (2.0 * q_factor);\n\n let big_a = 10.0_f64.powf(gain_db / 40.0);\n\n let pmc = (big_a + 1.0) - (big_a - 1.0) * _cos;\n\n let ppmc = (big_a + 1.0) + (big_a - 1.0) * _cos;\n\n let mpc = (big_a - 1.0) - (big_a + 1.0) * _cos;\n\n let pmpc = (big_a - 1.0) + (big_a + 1.0) * _cos;\n\n let aa2 = 2.0 * f64::sqrt(big_a) * alpha;\n\n\n\n let b0 = big_a * (pmc + aa2);\n\n let b1 = 2.0 * big_a * mpc;\n","file_path":"src/butterworth_filter.rs","rank":6,"score":112936.55210617889},{"content":"/// Creates a high-shelf filter\n\n///\n\n/// In Python: \n\n/// >>> filter = make_highshelf(1000, 48000, 6)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [2.2229172136088806, -3.9587208137297303, 1.7841414181566304, 4.295432981120543,\n\n/// -7.922740859457287, 3.6756456963725253]\n\n///\n\npub fn make_highshelf(frequency: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let w0 = TAU * frequency / sample_rate as f64;\n\n let _sin = f64::sin(w0);\n\n let _cos = f64::cos(w0);\n\n let alpha = _sin / (2.0 * q_factor);\n\n let big_a = 10.0_f64.powf(gain_db / 40.0);\n\n let pmc = (big_a + 1.0) - (big_a - 1.0) * _cos;\n\n let ppmc = (big_a + 1.0) + (big_a - 1.0) * _cos;\n\n let mpc = (big_a - 1.0) - (big_a + 1.0) * _cos;\n\n let pmpc = (big_a - 1.0) + (big_a + 1.0) * _cos;\n\n let aa2 = 2.0 * f64::sqrt(big_a) * alpha;\n\n\n\n let b0 = big_a * (ppmc + aa2);\n\n let b1 = -2.0 * big_a * pmpc;\n","file_path":"src/butterworth_filter.rs","rank":7,"score":112936.55210617889},{"content":"// This is a peak_eq filter similar to the above peak filter but with constant Q and the gain\n\n// is taken at -3dB like a analog peak_eq filter would be.\n\n// This filter is ideal to make equalizers, like a 10 band parametric equalizer.\n\n//\n\n// See:\n\n// 1. Peak / notch filter design\n\n// https://www.dsprelated.com/showcode/169.php#commax_container\n\n//\n\n// and\n\n//\n\n// 2. Making an EQ from cascading filters\n\n// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters \n\n//\n\n// and\n\n//\n\n// 3. The Equivalence of Various Methods of Computing\n\n// Biquad Coefficients for Audio Parametric Equalizers\n\n// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\n\n//\n\npub fn make_peak_eq_constant_q(frequency_center: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\n\n // This specific filter is a port to Rust with modifications from the following example code:\n\n // PEAK/NOTCH FILTER DESIGN\n\n // https://www.dsprelated.com/showcode/169.php#commax_container\n\n //\n\n // Derive coefficients for a peaking filter with a given amplitude and\n\n // bandwidth. All coefficients are calculated as described in Zolzer's\n\n // DAFX book (p. 50 - 55). This algorithm assumes a constant Q-term\n\n // is used through the equation.\n\n //\n\n // Original Author: sparafucile17 08/22/05\n\n //\n\n \n\n let q_factor: f64 = if q_factor.is_none() {\n\n 1.0 / f64::sqrt(2.0)\n\n } else {\n\n q_factor.unwrap()\n\n };\n\n\n\n let q = q_factor;\n","file_path":"src/butterworth_filter.rs","rank":8,"score":108489.38163178213},{"content":"/// Show phase response of a filter\n\n/// \n\n/// In Python:\n\n/// >>> from audio_filters.iir_filter import IIRFilter\n\n/// >>> filt = IIRFilter(4)\n\n/// >>> show_phase_response(filt, 48000)\n\n/// \n\npub fn show_phase_response(processing_block: & mut dyn ProcessingBlock, sample_rate: usize, path: & str, line_name: & str) {\n\n\n\n let size = 512_usize;\n\n // Excites the filter with an input of only a peak value (1.0) in the first sample, and the rest with (0.0) zero, as samples.\n\n // It's a Dirac Impulse. \n\n let inputs = { let mut inputs = vec![0.0; size - 1 + 1];\n\n inputs[0] = 1.0; \n\n inputs\n\n };\n\n let mut outputs: Vec<f64> = Vec::with_capacity(size);\n\n for i in 0..size {\n\n outputs.push(processing_block.process(inputs[i]));\n\n }\n\n // zero-padding.\n\n let filler = vec![0.0; sample_rate - size];\n\n outputs.extend(filler);\n\n\n\n // Perform a forward FFT of size 1234\n\n use rustfft::{FftPlanner, num_complex::Complex};\n\n\n","file_path":"src/show_response.rs","rank":9,"score":61630.94304320555},{"content":"/// Show frequency response of a filter\n\n///\n\n/// In Python:\n\n/// >>> from audio_filters.iir_filter import IIRFilter\n\n/// >>> filt = IIRFilter(4)\n\n/// >>> show_frequency_response(filt, 48000)\n\n///\n\npub fn show_frequency_response(processing_block: & mut dyn ProcessingBlock, sample_rate: usize, path: & str, line_name: & str) {\n\n\n\n let size = 512_usize;\n\n // Excites the filter with an input of only a peak value (1.0) in the first sample, and the rest with (0.0) zero, as samples.\n\n // It's a Dirac Impulse. \n\n let inputs = { let mut inputs = vec![0.0; size - 1 + 1];\n\n inputs[0] = 1.0; \n\n inputs\n\n };\n\n let mut outputs: Vec<f64> = Vec::with_capacity(size);\n\n for i in 0..size {\n\n outputs.push(processing_block.process(inputs[i]));\n\n }\n\n // zero-padding.\n\n let filler = vec![0.0; sample_rate - size];\n\n outputs.extend(filler);\n\n\n\n // Perform a forward FFT of size 1234\n\n use rustfft::{FftPlanner, num_complex::Complex};\n\n\n","file_path":"src/show_response.rs","rank":10,"score":61630.94304320555},{"content":"fn generate_plot_equalizer_10_bands_02() {\n\n println!(\"\\n10 Band Equalizer\\n\");\n\n let sample_rate = 48_000;\n\n let mut eq: Equalizer = Equalizer::make_equalizer_10_band(sample_rate);\n\n // Set the gains for each_frequency band.\n\n let _= eq.set_band_gain(0, -10.0);\n\n let _= eq.set_band_gain(2, -5.0);\n\n let _= eq.set_band_gain(1, 0.0);\n\n let _= eq.set_band_gain(3, 5.0);\n\n let _= eq.set_band_gain(4, 0.0);\n\n let _= eq.set_band_gain(5, -5.0);\n\n let _= eq.set_band_gain(6, 0.0);\n\n let _= eq.set_band_gain(7, 5.0);\n\n let _= eq.set_band_gain(8, 10.0);\n\n let _= eq.set_band_gain(9, 12.0);\n\n for i in 0..10 {\n\n println!(\"{} Hz : {} dB\", eq.get_bands_freq(i), eq.get_band_gain(i));\n\n }\n\n println!(\"\\n\");\n\n show_frequency_response(& mut eq, sample_rate as usize, \"plots/equalizer_10_band_gain.svg\", \"equ_10_bands\");\n\n show_phase_response(& mut eq, sample_rate as usize, \"plots/equalizer_10_band_phase.svg\", \"equ_10_bands\");\n\n}\n","file_path":"src/main.rs","rank":11,"score":60905.56034251199},{"content":"#[allow(dead_code)]\n\nfn generate_plot_equalizer_10_bands_01() {\n\n println!(\"\\n10 Band Equalizer\\n\");\n\n let sample_rate = 48_000;\n\n let mut eq: Equalizer = Equalizer::make_equalizer_10_band(sample_rate);\n\n // Set the gains for each_frequency band.\n\n let _= eq.set_band_gain(0, -15.0);\n\n let _= eq.set_band_gain(2, -10.0);\n\n let _= eq.set_band_gain(1, -5.0);\n\n let _= eq.set_band_gain(3, 0.0);\n\n let _= eq.set_band_gain(4, -5.0);\n\n let _= eq.set_band_gain(5, 10.0);\n\n let _= eq.set_band_gain(6, -15.0);\n\n let _= eq.set_band_gain(7, 0.0);\n\n let _= eq.set_band_gain(8, 5.0);\n\n let _= eq.set_band_gain(9, -10.0);\n\n for i in 0..10 {\n\n println!(\"{} Hz : {} dB\", eq.get_bands_freq(i), eq.get_band_gain(i));\n\n }\n\n println!(\"\\n\");\n\n show_frequency_response(& mut eq, sample_rate as usize, \"plots/equalizer_10_band_gain.svg\", \"equ_10_bands\");\n\n show_phase_response(& mut eq, sample_rate as usize, \"plots/equalizer_10_band_phase.svg\", \"equ_10_bands\");\n\n}\n\n\n","file_path":"src/main.rs","rank":12,"score":60905.56034251199},{"content":"/// Get bounds for printing fft results\n\n/// \n\n/// In Python:\n\n/// >>> import numpy\n\n/// >>> array = numpy.linspace(-20.0, 20.0, 1000)\n\n/// >>> get_bounds(array, 1000)\n\n/// (-20, 20)\n\n///\n\npub fn get_bounds(fft_results: & [f32], _sample_rate: usize, x_bound_max: usize) -> (f32, f32) {\n\n // let slice_upper_bound = (sample_rate / 2) - 1;\n\n // let slice_upper_bound = (sample_rate / 2) - 1 - 100;\n\n let slice_upper_bound = x_bound_max;\n\n // This will remove the bounds checks from the array at each access.\n\n assert!(slice_upper_bound <= fft_results.len());\n\n let mut min_t = -20.0; // f64::MAX;\n\n let mut max_t = 20.0; // f64::MIN;\n\n for i in 1..slice_upper_bound{\n\n min_t = f32::min(fft_results[i], min_t);\n\n max_t = f32::max(fft_results[i], max_t);\n\n }\n\n let lowest = min_t;\n\n let highest = max_t;\n\n \n\n (lowest, highest)\n\n} \n\n\n","file_path":"src/show_response.rs","rank":13,"score":45133.41971788301},{"content":"fn test_a() {\n\n let mut filter = IIRFilter::new(2);\n\n let res = filter.process(0.0);\n\n println!(\"filter res: {} should be 0.0 .\", res);\n\n}\n\n\n","file_path":"src/main.rs","rank":14,"score":42902.902070198346},{"content":"fn main() {\n\n println!(\"***************************\");\n\n println!(\"** Audio filters in Rust **\");\n\n println!(\"***************************\");\n\n\n\n test_a();\n\n test_b();\n\n\n\n generate_plots();\n\n // generate_plot_equalizer_10_bands_01();\n\n generate_plot_equalizer_10_bands_02();\n\n}\n\n\n","file_path":"src/main.rs","rank":15,"score":42902.902070198346},{"content":"fn test_b() {\n\n let frequency = 200.0; // Hz\n\n let sample_rate = 44100; // Hz\n\n let mut filter = make_lowpass(frequency, sample_rate, None);\n\n let sample = 0.0;\n\n let res = filter.process(sample);\n\n\n\n println!(\"filter res: {} should be ?? .\", res);\n\n}\n\n\n","file_path":"src/main.rs","rank":16,"score":42902.902070198346},{"content":"fn generate_plots() {\n\n print!(\"\\nStarting generating the SVG plots...\");\n\n\n\n // low-pass\n\n let frequency = 5_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let mut filter = make_lowpass(frequency, sample_rate, None);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/lowpass_gain.svg\", \"lowpass\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/lowpass_phase.svg\", \"lowpass\");\n\n\n\n // high-pass\n\n let frequency = 5_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let mut filter = make_highpass(frequency, sample_rate, None);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/highpass_gain.svg\", \"highpass\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/highpass_phase.svg\", \"highpass\");\n\n\n\n // band-pass\n\n let frequency = 10_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n","file_path":"src/main.rs","rank":17,"score":41679.391626412325},{"content":"pub trait ProcessingBlock {\n\n fn process(& mut self, sample: f64) -> f64;\n\n}\n\n\n\n\n\n/// N-Order IIR filter\n\n/// Assumes working with float samples normalized on [-1, 1]\n\n///\n\n/// Implementation details:\n\n/// Based on the 2nd-order function from\n\n/// https://en.wikipedia.org/wiki/Digital_biquad_filter,\n\n/// this generalized N-order function was made.\n\n///\n\n/// Using the following transfer function\n\n/// H(z)=\\frac{b_{0}+b_{1}z^{-1}+b_{2}z^{-2}+...+b_{k}z^{-k}}{a_{0}+a_{1}z^{-1}+a_{2}z^{-2}+...+a_{k}z^{-k}}\n\n/// we can rewrite this to\n\n/// y[n]={\\frac{1}{a_{0}}}\\left(\\left(b_{0}x[n]+b_{1}x[n-1]+b_{2}x[n-2]+...+b_{k}x[n-k]\\right)-\\left(a_{1}y[n-1]+a_{2}y[n-2]+...+a_{k}y[n-k]\\right)\\right)\n\n///\n\npub struct IIRFilter {\n\n pub order: usize,\n","file_path":"src/iir_filter.rs","rank":18,"score":38438.041250418675},{"content":" // a_{0} ... a_{k}\n\n pub a_coeffs: Vec<f64>,\n\n // b_{0} ... b_{k}\n\n pub b_coeffs: Vec<f64>,\n\n // x[n-1] ... x[n-k]\n\n input_history: Vec<f64>,\n\n // y[n-1] ... y[n-k]\n\n output_history: Vec<f64>,\n\n}\n\n\n\nimpl IIRFilter {\n\n pub fn new(order: usize) -> Self {\n\n IIRFilter {\n\n order: order,\n\n // a_{0} ... a_{k}\n\n a_coeffs: { let mut a_coeffs = vec![0.0; 1 + order];\n\n a_coeffs[0] = 1.0;\n\n a_coeffs },\n\n // b_{0} ... b_{k}\n\n b_coeffs: { let mut b_coeffs = vec![0.0; 1 + order];\n","file_path":"src/iir_filter.rs","rank":30,"score":14.515874929748593},{"content":" ///\n\n /// In Rust\n\n /// >>> let a_coeffs = [0.1, 0.2, 0.3]\n\n /// >>> let b_coeffs = [0.15, 0.25, 0.35]\n\n /// >>> let filter_order: u32 = 2;\n\n /// >>> let iir_filter = IIR_Filter::new(filter_order);\n\n /// >>> iir_filter.set_coefficients(& a_coeffs[], & b_coeffs[]);\n\n /// \n\n pub fn set_coefficients(& mut self, a_coeffs: &[f64], b_coeffs: &[f64]) -> Result<(), String> {\n\n if a_coeffs.len() != self.order + 1 && a_coeffs.len() != self.order {\n\n return Err(\n\n r\"Expected a_coeffs to have {self.order + 1} elements for {self.order} /\n\n -order filter, got {len(a_coeffs)}\".to_string());\n\n }\n\n if b_coeffs.len() != self.order + 1 {\n\n return Err(\n\n r\"Expected b_coeffs to have {self.order + 1} elements for {self.order} /\n\n -order filter, got {len(a_coeffs)}\".to_string());\n\n }\n\n self.a_coeffs.clear();\n","file_path":"src/iir_filter.rs","rank":31,"score":8.526992075927435},{"content":" let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b0]);\n\n \n\n filter\n\n}\n\n\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n fn print_values(target_vec: & Vec<f64>, res_coeffs: & Vec<&f64>) {\n\n println!(\"\\n >>>> target_coefficents\");\n\n for str_t in target_vec {\n\n print!(\"{}, \", str_t); \n\n }\n\n println!(\"\\n >>>> res_coefficents\");\n\n for str_t in res_coeffs {\n","file_path":"src/butterworth_filter.rs","rank":32,"score":7.0731280528574105},{"content":"\n\n// Module definition\n\nmod iir_filter;\n\nmod butterworth_filter;\n\nmod show_response;\n\nmod equalizer;\n\n\n\n// Imports\n\nuse crate::iir_filter::ProcessingBlock; // Trait\n\nuse crate::iir_filter::IIRFilter;\n\nuse crate::butterworth_filter::make_lowpass;\n\nuse crate::butterworth_filter::make_highpass;\n\nuse crate::butterworth_filter::make_bandpass;\n\nuse crate::butterworth_filter::make_allpass;\n\nuse crate::butterworth_filter::make_peak;\n\nuse crate::butterworth_filter::make_peak_eq_constant_q;\n\nuse crate::butterworth_filter::make_lowshelf;\n\nuse crate::butterworth_filter::make_highshelf;\n\nuse crate::butterworth_filter::make_notch;\n\n\n\nuse crate::show_response::show_frequency_response;\n\nuse crate::show_response::show_phase_response;\n\n\n\nuse crate::equalizer::Equalizer;\n\n\n\n\n","file_path":"src/main.rs","rank":33,"score":6.553565462039288},{"content":" /// >>> filt.process(0)\n\n /// 0.0\n\n /// \n\n /// In Rust\n\n /// >>> let filt = IIRFilter::new(2)\n\n /// >>> filt.process(0.0)\n\n /// 0.0\n\n ///\n\n fn process(& mut self, sample: f64) -> f64 {\n\n let mut result: f64 = 0.0;\n\n\n\n // Start at index 1 and do index 0 at the end.\n\n for i in 1..(self.order + 1) {\n\n result += self.b_coeffs[i] * self.input_history[i - 1]\n\n - self.a_coeffs[i] * self.output_history[i - 1];\n\n }\n\n \n\n result = (result + self.b_coeffs[0] * sample) / self.a_coeffs[0];\n\n\n\n let input_len = self.input_history.len();\n","file_path":"src/iir_filter.rs","rank":34,"score":6.216356583348826},{"content":"\n\nuse crate::iir_filter::IIRFilter;\n\nuse std::f64::consts::TAU;\n\nuse std::f64::consts::PI;\n\n\n\n/// Create 2nd-order IIR filters with Butterworth design.\n\n/// \n\n/// Code based on https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html\n\n/// Alternatively you can use scipy.signal.butter, which should yield the same results.\n\n/// \n\n\n\n\n\n/// Creates a low-pass filter\n\n///\n\n/// In Python: \n\n/// >>> filter = make_lowpass(1000, 48000)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\n\n/// 0.008555138626189618, 0.004277569313094809]\n\n/// \n\n/// In Rust:\n\n/// >>> let filter = make_lowpass(1000, 48000);\n\n/// >>> let res_coeffs: Vec<f64> = filter.a_coeffs.iter.extends(filter.b_coeffs).collect();\n\n/// >>> println!(\"{}\", res_coeffs);\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\n\n/// 0.008555138626189618, 0.004277569313094809]\n\n///\n","file_path":"src/butterworth_filter.rs","rank":35,"score":6.161811141006847},{"content":" let k = f64::tan((PI * frequency_center) / sample_rate as f64);\n\n let mut v0 = 10.0_f64.powf(gain_db / 20.0);\n\n \n\n // Invert gain if a cut\n\n if v0 < 1.0 {\n\n v0 = 1.0 / v0;\n\n }\n\n \n\n let b0: f64;\n\n let b1: f64;\n\n let b2: f64;\n\n let a1: f64;\n\n let a2: f64;\n\n\n\n let _k_sqr = k.powf(2.0);\n\n //***********\n\n // BOOST\n\n //***********\n\n if gain_db > 0.0 {\n\n b0 = (1.0 + ((v0 / q) * k) + _k_sqr) / (1.0 + ((1.0 / q) * k) + _k_sqr);\n","file_path":"src/butterworth_filter.rs","rank":36,"score":6.045790776383819},{"content":"\n\n // peak_eq_constant_q positive and negative gain.\n\n let frequency = 10_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let gain_db = 5.0; // dB\n\n // A good value for a 10 band equalizer.\n\n // See: The second reference on the function make_peak_eq_constant_q.\n\n let q_factor = Some(2.0 * f64::sqrt(2.0));\n\n let mut filter = make_peak_eq_constant_q(frequency, sample_rate, gain_db, q_factor);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/peak_eq_pos_g_gain.svg\", \"peakEQ_G+\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/peak_eq_pos_g_phase.svg\", \"peakEQ_G+\");\n\n let gain_db = -5.0; // dB\n\n let mut filter = make_peak_eq_constant_q(frequency, sample_rate, gain_db, q_factor);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/peak_eq_neg_g_gain.svg\", \"peakEQ_G-\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/peak_eq_neg_g_phase.svg\", \"peakEQ_G-\");\n\n\n\n // low-shelf\n\n let frequency = 10_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let gain_db = 6.0; // dB\n","file_path":"src/main.rs","rank":37,"score":5.700478741502632},{"content":" let output_len = self.output_history.len();\n\n self.input_history.copy_within(0..(input_len - 1), 1);\n\n self.output_history.copy_within(0..(output_len - 1), 1);\n\n\n\n self.input_history[0] = sample;\n\n self.output_history[0] = result;\n\n\n\n result\n\n }\n\n\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_iir_filter_000() {\n\n\n\n let mut filter = IIRFilter::new(2);\n","file_path":"src/iir_filter.rs","rank":38,"score":4.581160787628104},{"content":" let mut filter = make_lowshelf(frequency, sample_rate, gain_db, None);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/lowshelf_gain.svg\", \"lowshelf\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/lowshelf_phase.svg\", \"lowshelf\");\n\n\n\n // high-shelf\n\n let frequency = 10_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let gain_db = 6.0; // dB\n\n let mut filter = make_highshelf(frequency, sample_rate, gain_db, None);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/highshelf_gain.svg\", \"highshelf\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/highshelf_phase.svg\", \"highshelf\");\n\n\n\n // notch\n\n let frequency = 10_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let q_factor = 0.05;\n\n let mut filter = make_notch(frequency, sample_rate, Some(q_factor));\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/notch_gain.svg\", \"notch\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/notch_phase.svg\", \"notch\");\n\n\n\n println!(\"\\n ... ended generating the SVG plots.\");\n\n}\n\n\n","file_path":"src/main.rs","rank":39,"score":3.3737662439818843},{"content":" // Note: I have put a larger q_factor then the default so that the band pass is more accentuated. \n\n let q_factor = Some(1.0);\n\n let mut filter = make_bandpass(frequency, sample_rate, q_factor);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/bandpass_gain.svg\", \"bandpass\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/bandpass_phase.svg\", \"bandpass\");\n\n\n\n // all-pass\n\n let frequency = 10_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let mut filter = make_allpass(frequency, sample_rate, None);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/allpass_gain.svg\", \"allpass\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/allpass_phase.svg\", \"allpass\");\n\n\n\n // peak\n\n let frequency = 10_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let gain_db = 6.0; // dB\n\n let mut filter = make_peak(frequency, sample_rate, gain_db, None);\n\n show_frequency_response(& mut filter, sample_rate as usize, \"plots/peak_gain.svg\", \"peak\");\n\n show_phase_response(& mut filter, sample_rate as usize, \"plots/peak_phase.svg\", \"peak\");\n","file_path":"src/main.rs","rank":40,"score":3.3737662439818843},{"content":" let bounds = get_bounds(& fft_db, sample_rate, x_bound_max);\n\n let (y_bound_min, y_bound_max) = (f32::max(-80.0, bounds.0), f32::min(80.0, bounds.1) );\n\n\n\n // Frequencies on log scale from 24 to nyquist frequency\n\n use plotters::prelude::*;\n\n //fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n let root = SVGBackend::new(path /* \"plots/0.svg\" */, (400, 300)).into_drawing_area();\n\n root.fill(&WHITE).unwrap();\n\n let mut chart = ChartBuilder::on(&root)\n\n .caption(line_name.to_string() + \" - Gain(dB) vs Freq\", (\"sans-serif\", 25).into_font())\n\n .margin(5)\n\n .x_label_area_size(30)\n\n .y_label_area_size(30)\n\n .build_cartesian_2d(x_bound_min..x_bound_max, y_bound_min..y_bound_max )\n\n .unwrap();\n\n \n\n chart.configure_mesh().draw().unwrap();\n\n \n\n chart\n\n .draw_series(LineSeries::new(\n","file_path":"src/show_response.rs","rank":41,"score":3.2664627784381053},{"content":" // NOTE: Remember that TAU = 2 * PI.\n\n let (y_bound_min, y_bound_max) = (f32::max(-TAU_f32, bounds.0), f32::min(TAU_f32, bounds.1) );\n\n\n\n // Frequencies on log scale from 24 to nyquist frequency\n\n use plotters::prelude::*;\n\n //fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n let root = SVGBackend::new(path /* \"plots/0.svg\" */, (400, 300)).into_drawing_area();\n\n root.fill(&WHITE).unwrap();\n\n let mut chart = ChartBuilder::on(&root)\n\n .caption(line_name.to_string() + \" - Phase shift(Rad) vs Freq\", (\"sans-serif\", 25).into_font())\n\n .margin(5)\n\n .x_label_area_size(30)\n\n .y_label_area_size(30)\n\n .build_cartesian_2d(x_bound_min..x_bound_max, y_bound_min..y_bound_max )\n\n .unwrap();\n\n \n\n chart.configure_mesh().draw().unwrap();\n\n \n\n chart\n\n .draw_series(LineSeries::new(\n","file_path":"src/show_response.rs","rank":42,"score":3.2664627784381053},{"content":"\n\nuse crate::iir_filter::ProcessingBlock; // Trait\n\nuse std::f32::consts::TAU as TAU_f32;\n\n\n\n\n\n/// Get bounds for printing fft results\n\n/// \n\n/// In Python:\n\n/// >>> import numpy\n\n/// >>> array = numpy.linspace(-20.0, 20.0, 1000)\n\n/// >>> get_bounds(array, 1000)\n\n/// (-20, 20)\n\n///\n","file_path":"src/show_response.rs","rank":43,"score":3.223986939398533},{"content":" fn test_show_frequency_response() {\n\n let frequency = 5_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let mut filter = make_lowpass(frequency, sample_rate, None);\n\n // show_frequency_response(& mut filter, sample_rate as usize, \"plots/lowpass.svg\", \"lowpass\");\n\n \n\n // assert_eq!(true, false);\n\n }\n\n}\n\n\n","file_path":"src/show_response.rs","rank":44,"score":3.0147007686748917},{"content":" fft_out.iter().enumerate().map(|pair| (pair.0, *pair.1 ) ),\n\n &BLUE,\n\n )).unwrap()\n\n .label(line_name)\n\n .legend(|(x, y)| PathElement::new(vec![(x, y), (x + 20, y)], &BLUE));\n\n \n\n chart\n\n .configure_series_labels()\n\n .background_style(&WHITE.mix(0.8))\n\n .border_style(&BLACK)\n\n .draw().unwrap();\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n use crate::butterworth_filter::make_lowpass;\n\n\n\n #[test]\n","file_path":"src/show_response.rs","rank":45,"score":2.9747615521659974},{"content":"# Audio filters in Rust\n\nA port of the WebAudio API filters to Rust.\n\n\n\n## Description \n\nAudio or DSP filters, allow you to attenuate or accentuate some frequencies or range of frequencies in a signal. The signal can be of any kind, but in here, we will focus on 1D signals. Like audio signals. There can also occur differences in the signal phases, that vary with the filter and the frequency components of the signal. <br>\n\nThis is a port of Audio filters, from Python to Rust. My port was made from TheAlgorithms GitHub in Python (see references below). That is, by it self a port from WebAudio API C++ filters implementation used by the browsers. <br>\n\n\n\n\n\n## The following filters are implemented over a BiQuad IIR filter\n\n1. **low-pass**\n\n2. **high-pass**\n\n3. **band-pass**\n\n4. **all-pass**\n\n5. **peak**\n\n6. **low-shelf**\n\n7. **high-shelf** \n\n8. **notch**\n\n9. **10 band equalizer**\n\n\n\n## Plots of the filters Gain (dB) and phase shift response \n\n\n\n### low-pass - freq = 5.000 Hz - sample_rate = 48.000 samples/sec \n\n\n\n\n\n <br>\n\n\n\n### high-pass - freq = 5.000 Hz - sample_rate = 48.000 samples/sec\n\n\n\n\n\n <br>\n\n\n\n### band-pass - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - q_factor = 1.0\n\n\n\n\n\n <br>\n\n\n\n### all-pass - freq = 10.000 Hz - sample_rate = 48.000 samples/sec\n\n\n\n\n\n <br>\n\n\n\n### peak - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 6 dB\n\n\n\n\n\n <br>\n\n\n","file_path":"README.md","rank":46,"score":2.9167655106882004},{"content":" let mut planner = FftPlanner::<f32>::new();\n\n let fft = planner.plan_fft_forward(sample_rate);\n\n\n\n let mut buffer = vec![Complex{ re: 0.0_f32, im: 0.0_f32 }; sample_rate];\n\n\n\n for i in 0..outputs.len() {\n\n buffer[i].re = outputs[i] as f32;\n\n }\n\n\n\n fft.process(& mut buffer[..]);\n\n\n\n // Calculates the absolute value or the norm. \n\n let fft_out = buffer.iter().map(|c| c.norm() ).collect::<Vec<f32>>();\n\n // Transform the result into dB's.\n\n let fft_db = fft_out.iter().map(|val| 20.0 * f32::log10(*val) ).collect::<Vec<f32>>();\n\n\n\n\n\n // Display within reasonable bounds\n\n let (x_bound_min, x_bound_max) = (0_usize, sample_rate / 2 - 1 - 100 );\n\n let fft_db = & fft_db[x_bound_min..x_bound_max];\n","file_path":"src/show_response.rs","rank":47,"score":2.81991270568186},{"content":" let mut planner = FftPlanner::<f32>::new();\n\n let fft = planner.plan_fft_forward(sample_rate);\n\n\n\n let mut buffer = vec![Complex{ re: 0.0_f32, im: 0.0_f32 }; sample_rate];\n\n\n\n for i in 0..outputs.len() {\n\n buffer[i].re = outputs[i] as f32;\n\n }\n\n\n\n fft.process(& mut buffer[..]);\n\n\n\n // Calculates the phase angle or the atan(b/a) for a complex number c = a + bj . \n\n // let fft_out = buffer.iter().map(|c| c.atan().re ).collect::<Vec<f32>>();\n\n let fft_out = buffer.iter().map(|c| f32::atan2(c.im, c.re) ).collect::<Vec<f32>>();\n\n\n\n // Display within reasonable bounds\n\n let (x_bound_min, x_bound_max) = (0_usize, sample_rate / 2 - 1 - 150 );\n\n let fft_out = & fft_out[x_bound_min..x_bound_max];\n\n let bounds = get_bounds(& fft_out, sample_rate, x_bound_max);\n\n // let (y_bound_min, y_bound_max) = (f32::max(-80.0, bounds.0), f32::min(80.0, bounds.1) );\n","file_path":"src/show_response.rs","rank":48,"score":2.683301681575874},{"content":" if a_coeffs.len() < self.order + 1 {\n\n self.a_coeffs.push(1.0);\n\n self.a_coeffs.extend(a_coeffs);\n\n } else {\n\n self.a_coeffs.extend(a_coeffs);\n\n }\n\n self.b_coeffs.clear();\n\n self.b_coeffs.extend(b_coeffs);\n\n \n\n Ok(())\n\n }\n\n\n\n}\n\n\n\nimpl ProcessingBlock for IIRFilter {\n\n\n\n /// Calculate y[n]\n\n /// \n\n /// In Python\n\n /// >>> filt = IIRFilter(2)\n","file_path":"src/iir_filter.rs","rank":49,"score":2.6258649820395767},{"content":"/// 11. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n/// \n\n/// 10 Band Equalizer\n\n/// \n\n/// 12. Making an EQ from cascading filters\n\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\n\n/// \n\n/// 13. PEAK/NOTCH FILTER DESIGN\n\n/// https://www.dsprelated.com/showcode/169.php\n\n/// \n\n/// 14. The Equivalence of Various Methods of Computing\n\n/// Biquad Coefficients for Audio Parametric Equalizers\n\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\n\n///\n\n/// 15. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n\n","file_path":"src/show_response.rs","rank":50,"score":2.583676947925235},{"content":"/// 11. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n/// \n\n/// 10 Band Equalizer\n\n/// \n\n/// 12. Making an EQ from cascading filters\n\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\n\n/// \n\n/// 13. PEAK/NOTCH FILTER DESIGN\n\n/// https://www.dsprelated.com/showcode/169.php\n\n/// \n\n/// 14. The Equivalence of Various Methods of Computing\n\n/// Biquad Coefficients for Audio Parametric Equalizers\n\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\n\n///\n\n/// 15. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n\n","file_path":"src/butterworth_filter.rs","rank":51,"score":2.583676947925235},{"content":"/// 11. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n/// \n\n/// 10 Band Equalizer\n\n/// \n\n/// 12. Making an EQ from cascading filters\n\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\n\n/// \n\n/// 13. PEAK/NOTCH FILTER DESIGN\n\n/// https://www.dsprelated.com/showcode/169.php\n\n/// \n\n/// 14. The Equivalence of Various Methods of Computing\n\n/// Biquad Coefficients for Audio Parametric Equalizers\n\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\n\n///\n\n/// 15. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n\n","file_path":"src/main.rs","rank":52,"score":2.583676947925235},{"content":"/// 11. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n/// \n\n/// 10 Band Equalizer\n\n/// \n\n/// 12. Making an EQ from cascading filters\n\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\n\n/// \n\n/// 13. PEAK/NOTCH FILTER DESIGN\n\n/// https://www.dsprelated.com/showcode/169.php\n\n/// \n\n/// 14. The Equivalence of Various Methods of Computing\n\n/// Biquad Coefficients for Audio Parametric Equalizers\n\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\n\n///\n\n/// 15. How to learn modern Rust\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\n\n///\n\n\n\n\n","file_path":"src/iir_filter.rs","rank":53,"score":2.583676947925235},{"content":" let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect(); \n\n print_values(& target_vec, & res_coeffs);\n\n for i in 0..target_vec.len() {\n\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\n\n }\n\n\n\n // assert_eq!(true, false);\n\n }\n\n\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":54,"score":2.423928089338},{"content":" let b2 = big_a * (pmc - aa2);\n\n let a0 = ppmc + aa2;\n\n let a1 = -2.0 * pmpc;\n\n let a2 = ppmc - aa2;\n\n\n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\n\n \n\n filter\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":55,"score":2.3884184060014437},{"content":" let b2 = big_a * (ppmc - aa2);\n\n let a0 = pmc + aa2;\n\n let a1 = 2.0 * mpc;\n\n let a2 = pmc - aa2;\n\n\n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\n\n \n\n filter\n\n}\n\n\n\n\n","file_path":"src/butterworth_filter.rs","rank":56,"score":2.3884184060014437},{"content":"\n\n // 2º case.\n\n let a_coeffs = [1.0, 0.0, 0.0];\n\n let b_coeffs = [0.0, 0.0, 0.0];\n\n let filter_order: usize = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let res_coef = filter.set_coefficients(& a_coeffs, & b_coeffs);\n\n assert!(res_coef.is_ok());\n\n let res = filter.process(0.0);\n\n assert!((res - 0.0).abs() < 0.00001);\n\n\n\n println!(\"filter res: {} , should be 0.0 .\", res);\n\n\n\n // assert_eq!(true, false);\n\n }\n\n\n\n}\n\n\n","file_path":"src/iir_filter.rs","rank":57,"score":2.260482778384333},{"content":" print!(\"{}, \", str_t); \n\n }\n\n println!(\"\");\n\n }\n\n\n\n #[test]\n\n fn test_make_lowpass() {\n\n // >>> filter = make_lowpass(1000, 48000)\n\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n // [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\n\n // 0.008555138626189618, 0.004277569313094809]\n\n \n\n let frequency = 1_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let filter = make_lowpass(frequency, sample_rate, None);\n\n \n\n let target_vec = vec![1.0922959556412573, -1.9828897227476208, 0.9077040443587427,\n\n 0.004277569313094809, 0.008555138626189618, 0.004277569313094809];\n\n \n\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\n","file_path":"src/butterworth_filter.rs","rank":58,"score":2.22595702334123},{"content":"### peakEQ_const_Q G_pos - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 5 dB\n\nq_factor = 2 * sqrt(2) = 2.828 <br>\n\n\n\n\n\n <br>\n\n\n\n### peakEQ_const_Q G_neg - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = -5 dB\n\nq_factor = 2 * sqrt(2) = 2.828 <br>\n\n\n\n\n\n <br>\n\n\n\n### low-shelf - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 6 dB\n\n\n\n\n\n <br>\n\n\n\n### high-shelf - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 6 dB\n\n\n\n\n\n <br>\n\n\n\n### notch - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - q_factor = 0.05\n\n\n\n\n\n <br>\n\n\n\n### 10 band Equalizer - sample_rate = 48.000 samples/sec - q_factor = 2.828\n\n```\n\n10 Band Equalizer\n\n\n\nband_0: 29 Hz, gain: -10 dB\n\nband_1: 59 Hz, gain: 0 dB\n\nband_2: 119 Hz, gain: -5 dB\n\nband_3: 237 Hz, gain: 5 dB\n\nband_4: 474 Hz, gain: 0 dB\n\nband_5: 947 Hz, gain: -5 dB\n\nband_6: 1.889 Hz, gain: 0 dB\n\nband_7: 3.770 Hz, gain: 5 dB\n\nband_8: 7.523 Hz, gain: 10 dB\n\nband_9: 15.011 Hz, gain: 12 dB\n\n```\n\n\n\n\n\n <br>\n\n\n\n\n","file_path":"README.md","rank":59,"score":2.2050192973473397},{"content":" 0.9957224306869052, -1.9914448613738105, 0.9957224306869052];\n\n \n\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\n\n print_values(& target_vec, & res_coeffs);\n\n for i in 0..target_vec.len() {\n\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\n\n }\n\n\n\n // assert_eq!(true, false);\n\n }\n\n\n\n #[test]\n\n fn test_make_bandpass() {\n\n // >>> filter = make_bandpass(1000, 48000)\n\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n // [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.06526309611002579,\n\n // 0, -0.06526309611002579]\n\n \n\n let frequency = 1_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n","file_path":"src/butterworth_filter.rs","rank":60,"score":2.1159807359636633},{"content":" \n\n let frequency = 1_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let filter = make_allpass(frequency, sample_rate, None);\n\n \n\n let target_vec = vec![1.0922959556412573, -1.9828897227476208, 0.9077040443587427,\n\n 0.9077040443587427, -1.9828897227476208, 1.0922959556412573];\n\n \n\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\n\n print_values(& target_vec, & res_coeffs);\n\n for i in 0..target_vec.len() {\n\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\n\n }\n\n\n\n // assert_eq!(true, false);\n\n }\n\n\n\n #[test]\n\n fn test_make_peak() {\n\n // >>> filter = make_peak(1000, 48000, 6)\n","file_path":"src/butterworth_filter.rs","rank":61,"score":2.0865271434709243},{"content":" b_coeffs[0] = 1.0;\n\n b_coeffs },\n\n // x[n-1] ... x[n-k]\n\n input_history: vec![0.0; order],\n\n // y[n-1] ... y[n-k]\n\n output_history: vec![0.0; order],\n\n }\n\n }\n\n\n\n /// Set the coefficients for the IIR filter. These should both be of size order + 1.\n\n /// a_0 may be left out, and it will use 1.0 as default value.\n\n ///\n\n /// This method works well with scipy's filter design functions\n\n /// >>> # Make a 2nd-order 1000Hz butterworth lowpass filter\n\n /// >>> import scipy.signal\n\n /// >>> b_coeffs, a_coeffs = scipy.signal.butter(2, 1000,\n\n /// ... btype='lowpass',\n\n /// ... fs=48000)\n\n /// >>> filt = IIRFilter(2)\n\n /// >>> filt.set_coefficients(a_coeffs, b_coeffs)\n","file_path":"src/iir_filter.rs","rank":62,"score":2.084560662282179},{"content":" let filter = make_bandpass(frequency, sample_rate, None);\n\n\n\n let target_vec = vec![1.0922959556412573, -1.9828897227476208, 0.9077040443587427,\n\n 0.06526309611002579, 0.0, -0.06526309611002579];\n\n\n\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\n\n print_values(& target_vec, & res_coeffs);\n\n for i in 0..target_vec.len() {\n\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\n\n }\n\n\n\n // assert_eq!(true, false);\n\n }\n\n\n\n #[test]\n\n fn test_make_allpass() {\n\n // >>> filter = make_allpass(1000, 48000)\n\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n // [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.9077040443587427,\n\n // -1.9828897227476208, 1.0922959556412573]\n","file_path":"src/butterworth_filter.rs","rank":63,"score":2.057882258193523},{"content":" let res = filter.process(0.0);\n\n assert!((res - 0.0).abs() < 0.00001);\n\n\n\n println!(\"filter res: {} , should be 0.0 .\", res);\n\n // assert_eq!(true, false);\n\n }\n\n\n\n #[test]\n\n fn test_iir_filter_001() {\n\n // 1º case.\n\n let a_coeffs = [0.0, 0.0];\n\n let b_coeffs = [0.0, 0.0, 0.0];\n\n let filter_order: usize = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n let res_coef = filter.set_coefficients(& a_coeffs, & b_coeffs);\n\n assert!(res_coef.is_ok());\n\n let res = filter.process(0.0);\n\n assert!((res - 0.0).abs() < 0.00001);\n\n\n\n println!(\"filter res: {} , should be 0.0 .\", res);\n","file_path":"src/iir_filter.rs","rank":64,"score":2.041750097763309},{"content":" [http://ethanwiner.com/filters.html](http://ethanwiner.com/filters.html)\n\n\n\n9. **Audio filter - Wikipedia** <br>\n\n [https://en.wikipedia.org/wiki/Audio_filter](https://en.wikipedia.org/wiki/Audio_filter)\n\n\n\n11. **Electronic filter - Wikipedia** <br>\n\n [https://en.wikipedia.org/wiki/Electronic_filter](https://en.wikipedia.org/wiki/Electronic_filter)\n\n\n\n**10 Bands Equalizer** <br>\n\n\n\n12. **Making an EQ from cascading filters** <br>\n\n [https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters](https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters)\n\n \n\n13. **Peak / Notch filter design** <br>\n\n [https://www.dsprelated.com/showcode/169.php](https://www.dsprelated.com/showcode/169.php)\n\n\n\n14. **The Equivalence of Various Methods of Computing** <br>\n\n **Biquad Coefficients for Audio Parametric Equalizers** <br>\n\n [http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf](http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf)\n\n\n\n15. **How to learn modern Rust** <br>\n\n [https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust](https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust)\n\n\n\n\n","file_path":"README.md","rank":65,"score":2.0274232705183395},{"content":" // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n // [1.0653405327119334, -1.9828897227476208, 0.9346594672880666, 1.1303715025601122,\n\n // -1.9828897227476208, 0.8696284974398878]\n\n\n\n let frequency = 1_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let gain_db = 6.0; // dB\n\n let filter = make_peak(frequency, sample_rate, gain_db, None);\n\n \n\n let target_vec = vec![1.0653405327119334, -1.9828897227476208, 0.9346594672880666,\n\n 1.1303715025601122, -1.9828897227476208, 0.8696284974398878];\n\n \n\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\n\n print_values(& target_vec, & res_coeffs);\n\n for i in 0..target_vec.len() {\n\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\n\n }\n\n\n\n // assert_eq!(true, false);\n\n }\n","file_path":"src/butterworth_filter.rs","rank":66,"score":2.0028889415397626},{"content":"\n\n #[test]\n\n fn test_make_lowshelf() {\n\n // >>> filter = make_lowshelf(1000, 48000, 6)\n\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n // [3.0409336710888786, -5.608870992220748, 2.602157875636628, 3.139954022810743,\n\n // -5.591841778072785, 2.5201667380627257]\n\n\n\n let frequency = 1_000.0; // Hz\n\n let sample_rate = 48_000; // Samples\n\n let gain_db = 6.0; // dB\n\n let filter = make_lowshelf(frequency, sample_rate, gain_db, None);\n\n\n\n let target_vec = vec![3.0409336710888786, -5.608870992220748, 2.602157875636628,\n\n 3.139954022810743, -5.591841778072785, 2.5201667380627257];\n\n\n\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\n\n print_values(& target_vec, & res_coeffs);\n\n for i in 0..target_vec.len() {\n\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\n","file_path":"src/butterworth_filter.rs","rank":67,"score":1.9764799506096642},{"content":" b1 = (2.0 * (_k_sqr - 1.0)) / (1.0 + ((1.0 / q) * k) + _k_sqr);\n\n b2 = (1.0 - ((v0 / q) * k) + _k_sqr) / (1.0 + ((1.0 / q) * k) + _k_sqr);\n\n a1 = b1;\n\n a2 = (1.0 - ((1.0 / q) * k) + _k_sqr) / (1.0 + ((1.0 / q) * k) + _k_sqr);\n\n \n\n //***********\n\n // CUT\n\n //***********\n\n } else { \n\n b0 = (1.0 + ((1.0 / q) * k) + _k_sqr) / (1.0 + ((v0 / q) * k) + _k_sqr);\n\n b1 = (2.0 * (_k_sqr - 1.0)) / (1.0 + ((v0 / q) * k) + _k_sqr);\n\n b2 = (1.0 - ((1.0 / q) * k) + _k_sqr) / (1.0 + ((v0 / q) * k) + _k_sqr);\n\n a1 = b1;\n\n a2 = (1.0 - ((v0 / q) * k) + _k_sqr) / (1.0 + ((v0 / q) * k) + _k_sqr);\n\n }\n\n\n\n let filter_order = 2;\n\n let mut filter = IIRFilter::new(filter_order);\n\n // Note: The BiQuad filter fill's in the a0 with i.0 automatically.\n\n let _ = filter.set_coefficients(& [a1, a2], & [b0, b1, b2]);\n\n \n\n filter\n\n}\n\n\n","file_path":"src/butterworth_filter.rs","rank":68,"score":1.9735473317844199},{"content":"/// -low-shelf\n\n/// -high-shelf \n\n/// -notch\n\n/// -10 band equalizer\n\n/// \n\n/// License: MIT Open Source License, like the original license from\n\n/// GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// How to run the code. \n\n/// \n\n/// To make a project for this files do:\n\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\n\n/// \n\n/// cargo new audio_filters_in_rust\n\n/// cd audio_filters_in_rust\n\n/// \n\n/// -Copy the repository files to this directory and overlap them.\n\n/// \n\n/// To compile do:\n","file_path":"src/iir_filter.rs","rank":69,"score":1.9502973675920736},{"content":"/// -low-shelf\n\n/// -high-shelf \n\n/// -notch\n\n/// -10 band equalizer\n\n/// \n\n/// License: MIT Open Source License, like the original license from\n\n/// GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// How to run the code. \n\n/// \n\n/// To make a project for this files do:\n\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\n\n/// \n\n/// cargo new audio_filters_in_rust\n\n/// cd audio_filters_in_rust\n\n/// \n\n/// -Copy the repository files to this directory and overlap them.\n\n/// \n\n/// To compile do:\n","file_path":"src/butterworth_filter.rs","rank":70,"score":1.9502973675920736},{"content":"/// -low-shelf\n\n/// -high-shelf \n\n/// -notch\n\n/// -10 band equalizer\n\n/// \n\n/// License: MIT Open Source License, like the original license from\n\n/// GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// How to run the code. \n\n/// \n\n/// To make a project for this files do:\n\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\n\n/// \n\n/// cargo new audio_filters_in_rust\n\n/// cd audio_filters_in_rust\n\n/// \n\n/// -Copy the repository files to this directory and overlap them.\n\n/// \n\n/// To compile do:\n","file_path":"src/show_response.rs","rank":71,"score":1.9502973675920736},{"content":"/// -low-shelf\n\n/// -high-shelf \n\n/// -notch\n\n/// -10 band equalizer\n\n/// \n\n/// License: MIT Open Source License, like the original license from\n\n/// GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// How to run the code. \n\n/// \n\n/// To make a project for this files do:\n\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\n\n/// \n\n/// cargo new audio_filters_in_rust\n\n/// cd audio_filters_in_rust\n\n/// \n\n/// -Copy the repository files to this directory and overlap them.\n\n/// \n\n/// To compile do:\n","file_path":"src/main.rs","rank":72,"score":1.9502973675920736},{"content":"/// cargo build --release\n\n/// \n\n/// To run do:\n\n/// cargo run --release\n\n/// \n\n/// to run the tests do:\n\n/// cargo test\n\n/// \n\n/// References:\n\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\n\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \n\n/// \n\n/// 3. Good resources on DSP – Digital Signal Programming\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\n\n///\n\n/// 4. Biquads - EarLevel\n\n/// http://www.earlevel.com/main/2003/02/28/biquads/\n","file_path":"src/butterworth_filter.rs","rank":73,"score":1.7619565013046903},{"content":"/// cargo build --release\n\n/// \n\n/// To run do:\n\n/// cargo run --release\n\n/// \n\n/// to run the tests do:\n\n/// cargo test\n\n/// \n\n/// References:\n\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\n\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \n\n/// \n\n/// 3. Good resources on DSP – Digital Signal Programming\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\n\n///\n\n/// 4. Biquads - EarLevel\n\n/// http://www.earlevel.com/main/2003/02/28/biquads/\n","file_path":"src/main.rs","rank":74,"score":1.7619565013046903},{"content":"/// cargo build --release\n\n/// \n\n/// To run do:\n\n/// cargo run --release\n\n/// \n\n/// to run the tests do:\n\n/// cargo test\n\n/// \n\n/// References:\n\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\n\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \n\n/// \n\n/// 3. Good resources on DSP – Digital Signal Programming\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\n\n///\n\n/// 4. Biquads - EarLevel\n\n/// http://www.earlevel.com/main/2003/02/28/biquads/\n","file_path":"src/iir_filter.rs","rank":75,"score":1.7619565013046903},{"content":"/// cargo build --release\n\n/// \n\n/// To run do:\n\n/// cargo run --release\n\n/// \n\n/// to run the tests do:\n\n/// cargo test\n\n/// \n\n/// References:\n\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\n\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\n\n///\n\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\n\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \n\n/// \n\n/// 3. Good resources on DSP – Digital Signal Programming\n\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\n\n///\n\n/// 4. Biquads - EarLevel\n\n/// http://www.earlevel.com/main/2003/02/28/biquads/\n","file_path":"src/show_response.rs","rank":76,"score":1.7619565013046903},{"content":"## How to run the code \n\n```\n\nTo make a project for this files do:\n\n -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\n\n \n\n cargo new audio_filters_in_rust\n\n cd audio_filters_in_rust\n\n \n\n -Copy the repository files to this directory and overlap them.\n\n \n\nTo compile do:\n\n cargo build --release\n\n \n\nTo run do:\n\n cargo run --release\n\n \n\nto run the tests do:\n\n cargo test\n\n```\n\n\n\n\n\n## References:\n\n\n\n1. **GitHub - TheAlgorithms / Python / audio_filters** <br>\n\n [https://github.com/TheAlgorithms/Python/tree/master/audio_filters](https://github.com/TheAlgorithms/Python/tree/master/audio_filters)\n\n\n\n2. **WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients** <br>\n\n [https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html](https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html)\n\n\n\n3. **Good resources on DSP** – Digital Signal Processing <br> \n\n [https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming](https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming)\n\n\n\n4. **Biquads - EarLevel** <br>\n\n [http://www.earlevel.com/main/2003/02/28/biquads/](http://www.earlevel.com/main/2003/02/28/biquads/)\n\n\n\n5. **Biquad C++ source code - EarLevel** <br>\n\n [https://www.earlevel.com/main/2012/11/26/biquad-c-source-code/](https://www.earlevel.com/main/2012/11/26/biquad-c-source-code/)\n\n\n\n6. **A biquad calculator v3 - EarLevel** <br>\n\n [https://www.earlevel.com/main/2021/09/02/biquad-calculator-v3/](https://www.earlevel.com/main/2021/09/02/biquad-calculator-v3/)\n\n\n\n7. **WebAudio API - Mozilla Docs** <br>\n\n [https://developer.mozilla.org/en-US/docs/Web/API/Web_Audio_API](https://developer.mozilla.org/pt-BR/docs/Web/API/Web_Audio_API)\n\n \n\n8. **Audio Filters - Theory and Practice** <br>\n\n by Ethan Winer <br>\n","file_path":"README.md","rank":77,"score":0.8908783042355926}],"string":"[\n {\n \"content\": \"/// Creates a low-pass filter\\n\\n///\\n\\n/// In Python: \\n\\n/// >>> filter = make_lowpass(1000, 48000)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\\n\\n/// 0.008555138626189618, 0.004277569313094809]\\n\\n/// \\n\\n/// In Rust:\\n\\n/// >>> let filter = make_lowpass(1000, 48000);\\n\\n/// >>> let res_coeffs: Vec<f64> = filter.a_coeffs.iter.extends(filter.b_coeffs).collect();\\n\\n/// >>> println!(\\\"{}\\\", res_coeffs);\\n\\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\\n\\n/// 0.008555138626189618, 0.004277569313094809]\\n\\n///\\n\\npub fn make_lowpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64;\\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n let alpha = _sin / (2.0 * q_factor);\\n\\n \\n\\n let b0 = (1.0 - _cos) / 2.0;\\n\\n let b1 = 1.0 - _cos;\\n\\n \\n\\n let a0 = 1.0 + alpha;\\n\\n let a1 = -2.0 * _cos;\\n\\n let a2 = 1.0 - alpha;\\n\\n \\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b0]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 0,\n \"score\": 115298.8387382214\n },\n {\n \"content\": \"/// Creates a notch filter\\n\\n///\\n\\n/// In Python: \\n\\n/// >>> filter = make_notch(1000, 48000, 10)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [, , , ,\\n\\n/// , ]\\n\\n/// \\n\\npub fn make_notch(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64;\\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n use std::f64::consts::E;\\n\\n let alpha = _sin * f64::sinh((f64::log(2.0,E) / 2.0) * q_factor * (w0 /_sin ));\\n\\n \\n\\n let b0 = 1.0;\\n\\n let b1 = -2.0 * _cos;\\n\\n\\n\\n let a0 = 1.0 + alpha;\\n\\n let a1 = -2.0 * _cos;\\n\\n let a2 = 1.0 - alpha;\\n\\n \\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 1,\n \"score\": 115293.30429982745\n },\n {\n \"content\": \"/// Creates a high-pass filter\\n\\n/// \\n\\n/// In Python:\\n\\n/// >>> filter = make_highpass(1000, 48000)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.9957224306869052,\\n\\n/// -1.9914448613738105, 0.9957224306869052]\\n\\n/// \\n\\npub fn make_highpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64; \\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n let alpha = _sin / (2.0 * q_factor);\\n\\n\\n\\n let b0 = (1.0 + _cos) / 2.0;\\n\\n let b1 = -1.0 - _cos;\\n\\n\\n\\n let a0 = 1.0 + alpha;\\n\\n let a1 = -2.0 * _cos;\\n\\n let a2 = 1.0 - alpha;\\n\\n\\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b0]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 2,\n \"score\": 115293.30429982746\n },\n {\n \"content\": \"/// Creates an all-pass filter\\n\\n/// \\n\\n/// In Python:\\n\\n/// >>> filter = make_allpass(1000, 48000)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.9077040443587427,\\n\\n/// -1.9828897227476208, 1.0922959556412573]\\n\\n///\\n\\npub fn make_allpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64;\\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n let alpha = _sin / (2.0 * q_factor);\\n\\n\\n\\n let b0 = 1.0 - alpha;\\n\\n let b1 = -2.0 * _cos;\\n\\n let b2 = 1.0 + alpha;\\n\\n\\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [b2, b1, b0], & [b0, b1, b2]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 3,\n \"score\": 115293.30429982746\n },\n {\n \"content\": \"/// Creates a band-pass filter\\n\\n/// \\n\\n/// In Python:\\n\\n/// >>> filter = make_bandpass(1000, 48000)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.06526309611002579,\\n\\n/// 0, -0.06526309611002579]\\n\\n/// \\n\\npub fn make_bandpass(frequency: f64, sample_rate: u32, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64;\\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n let alpha = _sin / (2.0 * q_factor);\\n\\n\\n\\n let b0 = _sin / 2.0;\\n\\n let b1 = 0.0;\\n\\n let b2 = -b0;\\n\\n\\n\\n let a0 = 1.0 + alpha;\\n\\n let a1 = -2.0 * _cos;\\n\\n let a2 = 1.0 - alpha;\\n\\n\\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 4,\n \"score\": 115293.30429982745\n },\n {\n \"content\": \"/// Creates a peak filter\\n\\n///\\n\\n/// In Python: \\n\\n/// >>> filter = make_peak(1000, 48000, 6)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [1.0653405327119334, -1.9828897227476208, 0.9346594672880666, 1.1303715025601122,\\n\\n/// -1.9828897227476208, 0.8696284974398878]\\n\\n///\\n\\npub fn make_peak(frequency: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64;\\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n let alpha = _sin / (2.0 * q_factor);\\n\\n let big_a = 10.0_f64.powf(gain_db / 40.0);\\n\\n\\n\\n let b0 = 1.0 + alpha * big_a;\\n\\n let b1 = -2.0 * _cos;\\n\\n let b2 = 1.0 - alpha * big_a;\\n\\n let a0 = 1.0 + alpha / big_a;\\n\\n let a1 = -2.0 * _cos;\\n\\n let a2 = 1.0 - alpha / big_a;\\n\\n\\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\\n\\n \\n\\n filter\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 5,\n \"score\": 112936.55210617889\n },\n {\n \"content\": \"/// Creates a low-shelf filter\\n\\n/// \\n\\n/// In Python:\\n\\n/// >>> filter = make_lowshelf(1000, 48000, 6)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [3.0409336710888786, -5.608870992220748, 2.602157875636628, 3.139954022810743,\\n\\n/// -5.591841778072785, 2.5201667380627257]\\n\\n/// \\n\\npub fn make_lowshelf(frequency: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64;\\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n let alpha = _sin / (2.0 * q_factor);\\n\\n let big_a = 10.0_f64.powf(gain_db / 40.0);\\n\\n let pmc = (big_a + 1.0) - (big_a - 1.0) * _cos;\\n\\n let ppmc = (big_a + 1.0) + (big_a - 1.0) * _cos;\\n\\n let mpc = (big_a - 1.0) - (big_a + 1.0) * _cos;\\n\\n let pmpc = (big_a - 1.0) + (big_a + 1.0) * _cos;\\n\\n let aa2 = 2.0 * f64::sqrt(big_a) * alpha;\\n\\n\\n\\n let b0 = big_a * (pmc + aa2);\\n\\n let b1 = 2.0 * big_a * mpc;\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 6,\n \"score\": 112936.55210617889\n },\n {\n \"content\": \"/// Creates a high-shelf filter\\n\\n///\\n\\n/// In Python: \\n\\n/// >>> filter = make_highshelf(1000, 48000, 6)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [2.2229172136088806, -3.9587208137297303, 1.7841414181566304, 4.295432981120543,\\n\\n/// -7.922740859457287, 3.6756456963725253]\\n\\n///\\n\\npub fn make_highshelf(frequency: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let w0 = TAU * frequency / sample_rate as f64;\\n\\n let _sin = f64::sin(w0);\\n\\n let _cos = f64::cos(w0);\\n\\n let alpha = _sin / (2.0 * q_factor);\\n\\n let big_a = 10.0_f64.powf(gain_db / 40.0);\\n\\n let pmc = (big_a + 1.0) - (big_a - 1.0) * _cos;\\n\\n let ppmc = (big_a + 1.0) + (big_a - 1.0) * _cos;\\n\\n let mpc = (big_a - 1.0) - (big_a + 1.0) * _cos;\\n\\n let pmpc = (big_a - 1.0) + (big_a + 1.0) * _cos;\\n\\n let aa2 = 2.0 * f64::sqrt(big_a) * alpha;\\n\\n\\n\\n let b0 = big_a * (ppmc + aa2);\\n\\n let b1 = -2.0 * big_a * pmpc;\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 7,\n \"score\": 112936.55210617889\n },\n {\n \"content\": \"// This is a peak_eq filter similar to the above peak filter but with constant Q and the gain\\n\\n// is taken at -3dB like a analog peak_eq filter would be.\\n\\n// This filter is ideal to make equalizers, like a 10 band parametric equalizer.\\n\\n//\\n\\n// See:\\n\\n// 1. Peak / notch filter design\\n\\n// https://www.dsprelated.com/showcode/169.php#commax_container\\n\\n//\\n\\n// and\\n\\n//\\n\\n// 2. Making an EQ from cascading filters\\n\\n// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters \\n\\n//\\n\\n// and\\n\\n//\\n\\n// 3. The Equivalence of Various Methods of Computing\\n\\n// Biquad Coefficients for Audio Parametric Equalizers\\n\\n// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\\n\\n//\\n\\npub fn make_peak_eq_constant_q(frequency_center: f64, sample_rate: u32, gain_db: f64, q_factor: Option<f64>) -> IIRFilter {\\n\\n // This specific filter is a port to Rust with modifications from the following example code:\\n\\n // PEAK/NOTCH FILTER DESIGN\\n\\n // https://www.dsprelated.com/showcode/169.php#commax_container\\n\\n //\\n\\n // Derive coefficients for a peaking filter with a given amplitude and\\n\\n // bandwidth. All coefficients are calculated as described in Zolzer's\\n\\n // DAFX book (p. 50 - 55). This algorithm assumes a constant Q-term\\n\\n // is used through the equation.\\n\\n //\\n\\n // Original Author: sparafucile17 08/22/05\\n\\n //\\n\\n \\n\\n let q_factor: f64 = if q_factor.is_none() {\\n\\n 1.0 / f64::sqrt(2.0)\\n\\n } else {\\n\\n q_factor.unwrap()\\n\\n };\\n\\n\\n\\n let q = q_factor;\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 8,\n \"score\": 108489.38163178213\n },\n {\n \"content\": \"/// Show phase response of a filter\\n\\n/// \\n\\n/// In Python:\\n\\n/// >>> from audio_filters.iir_filter import IIRFilter\\n\\n/// >>> filt = IIRFilter(4)\\n\\n/// >>> show_phase_response(filt, 48000)\\n\\n/// \\n\\npub fn show_phase_response(processing_block: & mut dyn ProcessingBlock, sample_rate: usize, path: & str, line_name: & str) {\\n\\n\\n\\n let size = 512_usize;\\n\\n // Excites the filter with an input of only a peak value (1.0) in the first sample, and the rest with (0.0) zero, as samples.\\n\\n // It's a Dirac Impulse. \\n\\n let inputs = { let mut inputs = vec![0.0; size - 1 + 1];\\n\\n inputs[0] = 1.0; \\n\\n inputs\\n\\n };\\n\\n let mut outputs: Vec<f64> = Vec::with_capacity(size);\\n\\n for i in 0..size {\\n\\n outputs.push(processing_block.process(inputs[i]));\\n\\n }\\n\\n // zero-padding.\\n\\n let filler = vec![0.0; sample_rate - size];\\n\\n outputs.extend(filler);\\n\\n\\n\\n // Perform a forward FFT of size 1234\\n\\n use rustfft::{FftPlanner, num_complex::Complex};\\n\\n\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 9,\n \"score\": 61630.94304320555\n },\n {\n \"content\": \"/// Show frequency response of a filter\\n\\n///\\n\\n/// In Python:\\n\\n/// >>> from audio_filters.iir_filter import IIRFilter\\n\\n/// >>> filt = IIRFilter(4)\\n\\n/// >>> show_frequency_response(filt, 48000)\\n\\n///\\n\\npub fn show_frequency_response(processing_block: & mut dyn ProcessingBlock, sample_rate: usize, path: & str, line_name: & str) {\\n\\n\\n\\n let size = 512_usize;\\n\\n // Excites the filter with an input of only a peak value (1.0) in the first sample, and the rest with (0.0) zero, as samples.\\n\\n // It's a Dirac Impulse. \\n\\n let inputs = { let mut inputs = vec![0.0; size - 1 + 1];\\n\\n inputs[0] = 1.0; \\n\\n inputs\\n\\n };\\n\\n let mut outputs: Vec<f64> = Vec::with_capacity(size);\\n\\n for i in 0..size {\\n\\n outputs.push(processing_block.process(inputs[i]));\\n\\n }\\n\\n // zero-padding.\\n\\n let filler = vec![0.0; sample_rate - size];\\n\\n outputs.extend(filler);\\n\\n\\n\\n // Perform a forward FFT of size 1234\\n\\n use rustfft::{FftPlanner, num_complex::Complex};\\n\\n\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 10,\n \"score\": 61630.94304320555\n },\n {\n \"content\": \"fn generate_plot_equalizer_10_bands_02() {\\n\\n println!(\\\"\\\\n10 Band Equalizer\\\\n\\\");\\n\\n let sample_rate = 48_000;\\n\\n let mut eq: Equalizer = Equalizer::make_equalizer_10_band(sample_rate);\\n\\n // Set the gains for each_frequency band.\\n\\n let _= eq.set_band_gain(0, -10.0);\\n\\n let _= eq.set_band_gain(2, -5.0);\\n\\n let _= eq.set_band_gain(1, 0.0);\\n\\n let _= eq.set_band_gain(3, 5.0);\\n\\n let _= eq.set_band_gain(4, 0.0);\\n\\n let _= eq.set_band_gain(5, -5.0);\\n\\n let _= eq.set_band_gain(6, 0.0);\\n\\n let _= eq.set_band_gain(7, 5.0);\\n\\n let _= eq.set_band_gain(8, 10.0);\\n\\n let _= eq.set_band_gain(9, 12.0);\\n\\n for i in 0..10 {\\n\\n println!(\\\"{} Hz : {} dB\\\", eq.get_bands_freq(i), eq.get_band_gain(i));\\n\\n }\\n\\n println!(\\\"\\\\n\\\");\\n\\n show_frequency_response(& mut eq, sample_rate as usize, \\\"plots/equalizer_10_band_gain.svg\\\", \\\"equ_10_bands\\\");\\n\\n show_phase_response(& mut eq, sample_rate as usize, \\\"plots/equalizer_10_band_phase.svg\\\", \\\"equ_10_bands\\\");\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 11,\n \"score\": 60905.56034251199\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn generate_plot_equalizer_10_bands_01() {\\n\\n println!(\\\"\\\\n10 Band Equalizer\\\\n\\\");\\n\\n let sample_rate = 48_000;\\n\\n let mut eq: Equalizer = Equalizer::make_equalizer_10_band(sample_rate);\\n\\n // Set the gains for each_frequency band.\\n\\n let _= eq.set_band_gain(0, -15.0);\\n\\n let _= eq.set_band_gain(2, -10.0);\\n\\n let _= eq.set_band_gain(1, -5.0);\\n\\n let _= eq.set_band_gain(3, 0.0);\\n\\n let _= eq.set_band_gain(4, -5.0);\\n\\n let _= eq.set_band_gain(5, 10.0);\\n\\n let _= eq.set_band_gain(6, -15.0);\\n\\n let _= eq.set_band_gain(7, 0.0);\\n\\n let _= eq.set_band_gain(8, 5.0);\\n\\n let _= eq.set_band_gain(9, -10.0);\\n\\n for i in 0..10 {\\n\\n println!(\\\"{} Hz : {} dB\\\", eq.get_bands_freq(i), eq.get_band_gain(i));\\n\\n }\\n\\n println!(\\\"\\\\n\\\");\\n\\n show_frequency_response(& mut eq, sample_rate as usize, \\\"plots/equalizer_10_band_gain.svg\\\", \\\"equ_10_bands\\\");\\n\\n show_phase_response(& mut eq, sample_rate as usize, \\\"plots/equalizer_10_band_phase.svg\\\", \\\"equ_10_bands\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 12,\n \"score\": 60905.56034251199\n },\n {\n \"content\": \"/// Get bounds for printing fft results\\n\\n/// \\n\\n/// In Python:\\n\\n/// >>> import numpy\\n\\n/// >>> array = numpy.linspace(-20.0, 20.0, 1000)\\n\\n/// >>> get_bounds(array, 1000)\\n\\n/// (-20, 20)\\n\\n///\\n\\npub fn get_bounds(fft_results: & [f32], _sample_rate: usize, x_bound_max: usize) -> (f32, f32) {\\n\\n // let slice_upper_bound = (sample_rate / 2) - 1;\\n\\n // let slice_upper_bound = (sample_rate / 2) - 1 - 100;\\n\\n let slice_upper_bound = x_bound_max;\\n\\n // This will remove the bounds checks from the array at each access.\\n\\n assert!(slice_upper_bound <= fft_results.len());\\n\\n let mut min_t = -20.0; // f64::MAX;\\n\\n let mut max_t = 20.0; // f64::MIN;\\n\\n for i in 1..slice_upper_bound{\\n\\n min_t = f32::min(fft_results[i], min_t);\\n\\n max_t = f32::max(fft_results[i], max_t);\\n\\n }\\n\\n let lowest = min_t;\\n\\n let highest = max_t;\\n\\n \\n\\n (lowest, highest)\\n\\n} \\n\\n\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 13,\n \"score\": 45133.41971788301\n },\n {\n \"content\": \"fn test_a() {\\n\\n let mut filter = IIRFilter::new(2);\\n\\n let res = filter.process(0.0);\\n\\n println!(\\\"filter res: {} should be 0.0 .\\\", res);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 14,\n \"score\": 42902.902070198346\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"***************************\\\");\\n\\n println!(\\\"** Audio filters in Rust **\\\");\\n\\n println!(\\\"***************************\\\");\\n\\n\\n\\n test_a();\\n\\n test_b();\\n\\n\\n\\n generate_plots();\\n\\n // generate_plot_equalizer_10_bands_01();\\n\\n generate_plot_equalizer_10_bands_02();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 15,\n \"score\": 42902.902070198346\n },\n {\n \"content\": \"fn test_b() {\\n\\n let frequency = 200.0; // Hz\\n\\n let sample_rate = 44100; // Hz\\n\\n let mut filter = make_lowpass(frequency, sample_rate, None);\\n\\n let sample = 0.0;\\n\\n let res = filter.process(sample);\\n\\n\\n\\n println!(\\\"filter res: {} should be ?? .\\\", res);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 16,\n \"score\": 42902.902070198346\n },\n {\n \"content\": \"fn generate_plots() {\\n\\n print!(\\\"\\\\nStarting generating the SVG plots...\\\");\\n\\n\\n\\n // low-pass\\n\\n let frequency = 5_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let mut filter = make_lowpass(frequency, sample_rate, None);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/lowpass_gain.svg\\\", \\\"lowpass\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/lowpass_phase.svg\\\", \\\"lowpass\\\");\\n\\n\\n\\n // high-pass\\n\\n let frequency = 5_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let mut filter = make_highpass(frequency, sample_rate, None);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/highpass_gain.svg\\\", \\\"highpass\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/highpass_phase.svg\\\", \\\"highpass\\\");\\n\\n\\n\\n // band-pass\\n\\n let frequency = 10_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 17,\n \"score\": 41679.391626412325\n },\n {\n \"content\": \"pub trait ProcessingBlock {\\n\\n fn process(& mut self, sample: f64) -> f64;\\n\\n}\\n\\n\\n\\n\\n\\n/// N-Order IIR filter\\n\\n/// Assumes working with float samples normalized on [-1, 1]\\n\\n///\\n\\n/// Implementation details:\\n\\n/// Based on the 2nd-order function from\\n\\n/// https://en.wikipedia.org/wiki/Digital_biquad_filter,\\n\\n/// this generalized N-order function was made.\\n\\n///\\n\\n/// Using the following transfer function\\n\\n/// H(z)=\\\\frac{b_{0}+b_{1}z^{-1}+b_{2}z^{-2}+...+b_{k}z^{-k}}{a_{0}+a_{1}z^{-1}+a_{2}z^{-2}+...+a_{k}z^{-k}}\\n\\n/// we can rewrite this to\\n\\n/// y[n]={\\\\frac{1}{a_{0}}}\\\\left(\\\\left(b_{0}x[n]+b_{1}x[n-1]+b_{2}x[n-2]+...+b_{k}x[n-k]\\\\right)-\\\\left(a_{1}y[n-1]+a_{2}y[n-2]+...+a_{k}y[n-k]\\\\right)\\\\right)\\n\\n///\\n\\npub struct IIRFilter {\\n\\n pub order: usize,\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 18,\n \"score\": 38438.041250418675\n },\n {\n \"content\": \" // a_{0} ... a_{k}\\n\\n pub a_coeffs: Vec<f64>,\\n\\n // b_{0} ... b_{k}\\n\\n pub b_coeffs: Vec<f64>,\\n\\n // x[n-1] ... x[n-k]\\n\\n input_history: Vec<f64>,\\n\\n // y[n-1] ... y[n-k]\\n\\n output_history: Vec<f64>,\\n\\n}\\n\\n\\n\\nimpl IIRFilter {\\n\\n pub fn new(order: usize) -> Self {\\n\\n IIRFilter {\\n\\n order: order,\\n\\n // a_{0} ... a_{k}\\n\\n a_coeffs: { let mut a_coeffs = vec![0.0; 1 + order];\\n\\n a_coeffs[0] = 1.0;\\n\\n a_coeffs },\\n\\n // b_{0} ... b_{k}\\n\\n b_coeffs: { let mut b_coeffs = vec![0.0; 1 + order];\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 30,\n \"score\": 14.515874929748593\n },\n {\n \"content\": \" ///\\n\\n /// In Rust\\n\\n /// >>> let a_coeffs = [0.1, 0.2, 0.3]\\n\\n /// >>> let b_coeffs = [0.15, 0.25, 0.35]\\n\\n /// >>> let filter_order: u32 = 2;\\n\\n /// >>> let iir_filter = IIR_Filter::new(filter_order);\\n\\n /// >>> iir_filter.set_coefficients(& a_coeffs[], & b_coeffs[]);\\n\\n /// \\n\\n pub fn set_coefficients(& mut self, a_coeffs: &[f64], b_coeffs: &[f64]) -> Result<(), String> {\\n\\n if a_coeffs.len() != self.order + 1 && a_coeffs.len() != self.order {\\n\\n return Err(\\n\\n r\\\"Expected a_coeffs to have {self.order + 1} elements for {self.order} /\\n\\n -order filter, got {len(a_coeffs)}\\\".to_string());\\n\\n }\\n\\n if b_coeffs.len() != self.order + 1 {\\n\\n return Err(\\n\\n r\\\"Expected b_coeffs to have {self.order + 1} elements for {self.order} /\\n\\n -order filter, got {len(a_coeffs)}\\\".to_string());\\n\\n }\\n\\n self.a_coeffs.clear();\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 31,\n \"score\": 8.526992075927435\n },\n {\n \"content\": \" let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b0]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n fn print_values(target_vec: & Vec<f64>, res_coeffs: & Vec<&f64>) {\\n\\n println!(\\\"\\\\n >>>> target_coefficents\\\");\\n\\n for str_t in target_vec {\\n\\n print!(\\\"{}, \\\", str_t); \\n\\n }\\n\\n println!(\\\"\\\\n >>>> res_coefficents\\\");\\n\\n for str_t in res_coeffs {\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 32,\n \"score\": 7.0731280528574105\n },\n {\n \"content\": \"\\n\\n// Module definition\\n\\nmod iir_filter;\\n\\nmod butterworth_filter;\\n\\nmod show_response;\\n\\nmod equalizer;\\n\\n\\n\\n// Imports\\n\\nuse crate::iir_filter::ProcessingBlock; // Trait\\n\\nuse crate::iir_filter::IIRFilter;\\n\\nuse crate::butterworth_filter::make_lowpass;\\n\\nuse crate::butterworth_filter::make_highpass;\\n\\nuse crate::butterworth_filter::make_bandpass;\\n\\nuse crate::butterworth_filter::make_allpass;\\n\\nuse crate::butterworth_filter::make_peak;\\n\\nuse crate::butterworth_filter::make_peak_eq_constant_q;\\n\\nuse crate::butterworth_filter::make_lowshelf;\\n\\nuse crate::butterworth_filter::make_highshelf;\\n\\nuse crate::butterworth_filter::make_notch;\\n\\n\\n\\nuse crate::show_response::show_frequency_response;\\n\\nuse crate::show_response::show_phase_response;\\n\\n\\n\\nuse crate::equalizer::Equalizer;\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 33,\n \"score\": 6.553565462039288\n },\n {\n \"content\": \" /// >>> filt.process(0)\\n\\n /// 0.0\\n\\n /// \\n\\n /// In Rust\\n\\n /// >>> let filt = IIRFilter::new(2)\\n\\n /// >>> filt.process(0.0)\\n\\n /// 0.0\\n\\n ///\\n\\n fn process(& mut self, sample: f64) -> f64 {\\n\\n let mut result: f64 = 0.0;\\n\\n\\n\\n // Start at index 1 and do index 0 at the end.\\n\\n for i in 1..(self.order + 1) {\\n\\n result += self.b_coeffs[i] * self.input_history[i - 1]\\n\\n - self.a_coeffs[i] * self.output_history[i - 1];\\n\\n }\\n\\n \\n\\n result = (result + self.b_coeffs[0] * sample) / self.a_coeffs[0];\\n\\n\\n\\n let input_len = self.input_history.len();\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 34,\n \"score\": 6.216356583348826\n },\n {\n \"content\": \"\\n\\nuse crate::iir_filter::IIRFilter;\\n\\nuse std::f64::consts::TAU;\\n\\nuse std::f64::consts::PI;\\n\\n\\n\\n/// Create 2nd-order IIR filters with Butterworth design.\\n\\n/// \\n\\n/// Code based on https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html\\n\\n/// Alternatively you can use scipy.signal.butter, which should yield the same results.\\n\\n/// \\n\\n\\n\\n\\n\\n/// Creates a low-pass filter\\n\\n///\\n\\n/// In Python: \\n\\n/// >>> filter = make_lowpass(1000, 48000)\\n\\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\\n\\n/// 0.008555138626189618, 0.004277569313094809]\\n\\n/// \\n\\n/// In Rust:\\n\\n/// >>> let filter = make_lowpass(1000, 48000);\\n\\n/// >>> let res_coeffs: Vec<f64> = filter.a_coeffs.iter.extends(filter.b_coeffs).collect();\\n\\n/// >>> println!(\\\"{}\\\", res_coeffs);\\n\\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\\n\\n/// 0.008555138626189618, 0.004277569313094809]\\n\\n///\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 35,\n \"score\": 6.161811141006847\n },\n {\n \"content\": \" let k = f64::tan((PI * frequency_center) / sample_rate as f64);\\n\\n let mut v0 = 10.0_f64.powf(gain_db / 20.0);\\n\\n \\n\\n // Invert gain if a cut\\n\\n if v0 < 1.0 {\\n\\n v0 = 1.0 / v0;\\n\\n }\\n\\n \\n\\n let b0: f64;\\n\\n let b1: f64;\\n\\n let b2: f64;\\n\\n let a1: f64;\\n\\n let a2: f64;\\n\\n\\n\\n let _k_sqr = k.powf(2.0);\\n\\n //***********\\n\\n // BOOST\\n\\n //***********\\n\\n if gain_db > 0.0 {\\n\\n b0 = (1.0 + ((v0 / q) * k) + _k_sqr) / (1.0 + ((1.0 / q) * k) + _k_sqr);\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 36,\n \"score\": 6.045790776383819\n },\n {\n \"content\": \"\\n\\n // peak_eq_constant_q positive and negative gain.\\n\\n let frequency = 10_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let gain_db = 5.0; // dB\\n\\n // A good value for a 10 band equalizer.\\n\\n // See: The second reference on the function make_peak_eq_constant_q.\\n\\n let q_factor = Some(2.0 * f64::sqrt(2.0));\\n\\n let mut filter = make_peak_eq_constant_q(frequency, sample_rate, gain_db, q_factor);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/peak_eq_pos_g_gain.svg\\\", \\\"peakEQ_G+\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/peak_eq_pos_g_phase.svg\\\", \\\"peakEQ_G+\\\");\\n\\n let gain_db = -5.0; // dB\\n\\n let mut filter = make_peak_eq_constant_q(frequency, sample_rate, gain_db, q_factor);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/peak_eq_neg_g_gain.svg\\\", \\\"peakEQ_G-\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/peak_eq_neg_g_phase.svg\\\", \\\"peakEQ_G-\\\");\\n\\n\\n\\n // low-shelf\\n\\n let frequency = 10_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let gain_db = 6.0; // dB\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 37,\n \"score\": 5.700478741502632\n },\n {\n \"content\": \" let output_len = self.output_history.len();\\n\\n self.input_history.copy_within(0..(input_len - 1), 1);\\n\\n self.output_history.copy_within(0..(output_len - 1), 1);\\n\\n\\n\\n self.input_history[0] = sample;\\n\\n self.output_history[0] = result;\\n\\n\\n\\n result\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_iir_filter_000() {\\n\\n\\n\\n let mut filter = IIRFilter::new(2);\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 38,\n \"score\": 4.581160787628104\n },\n {\n \"content\": \" let mut filter = make_lowshelf(frequency, sample_rate, gain_db, None);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/lowshelf_gain.svg\\\", \\\"lowshelf\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/lowshelf_phase.svg\\\", \\\"lowshelf\\\");\\n\\n\\n\\n // high-shelf\\n\\n let frequency = 10_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let gain_db = 6.0; // dB\\n\\n let mut filter = make_highshelf(frequency, sample_rate, gain_db, None);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/highshelf_gain.svg\\\", \\\"highshelf\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/highshelf_phase.svg\\\", \\\"highshelf\\\");\\n\\n\\n\\n // notch\\n\\n let frequency = 10_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let q_factor = 0.05;\\n\\n let mut filter = make_notch(frequency, sample_rate, Some(q_factor));\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/notch_gain.svg\\\", \\\"notch\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/notch_phase.svg\\\", \\\"notch\\\");\\n\\n\\n\\n println!(\\\"\\\\n ... ended generating the SVG plots.\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 39,\n \"score\": 3.3737662439818843\n },\n {\n \"content\": \" // Note: I have put a larger q_factor then the default so that the band pass is more accentuated. \\n\\n let q_factor = Some(1.0);\\n\\n let mut filter = make_bandpass(frequency, sample_rate, q_factor);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/bandpass_gain.svg\\\", \\\"bandpass\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/bandpass_phase.svg\\\", \\\"bandpass\\\");\\n\\n\\n\\n // all-pass\\n\\n let frequency = 10_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let mut filter = make_allpass(frequency, sample_rate, None);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/allpass_gain.svg\\\", \\\"allpass\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/allpass_phase.svg\\\", \\\"allpass\\\");\\n\\n\\n\\n // peak\\n\\n let frequency = 10_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let gain_db = 6.0; // dB\\n\\n let mut filter = make_peak(frequency, sample_rate, gain_db, None);\\n\\n show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/peak_gain.svg\\\", \\\"peak\\\");\\n\\n show_phase_response(& mut filter, sample_rate as usize, \\\"plots/peak_phase.svg\\\", \\\"peak\\\");\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 40,\n \"score\": 3.3737662439818843\n },\n {\n \"content\": \" let bounds = get_bounds(& fft_db, sample_rate, x_bound_max);\\n\\n let (y_bound_min, y_bound_max) = (f32::max(-80.0, bounds.0), f32::min(80.0, bounds.1) );\\n\\n\\n\\n // Frequencies on log scale from 24 to nyquist frequency\\n\\n use plotters::prelude::*;\\n\\n //fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let root = SVGBackend::new(path /* \\\"plots/0.svg\\\" */, (400, 300)).into_drawing_area();\\n\\n root.fill(&WHITE).unwrap();\\n\\n let mut chart = ChartBuilder::on(&root)\\n\\n .caption(line_name.to_string() + \\\" - Gain(dB) vs Freq\\\", (\\\"sans-serif\\\", 25).into_font())\\n\\n .margin(5)\\n\\n .x_label_area_size(30)\\n\\n .y_label_area_size(30)\\n\\n .build_cartesian_2d(x_bound_min..x_bound_max, y_bound_min..y_bound_max )\\n\\n .unwrap();\\n\\n \\n\\n chart.configure_mesh().draw().unwrap();\\n\\n \\n\\n chart\\n\\n .draw_series(LineSeries::new(\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 41,\n \"score\": 3.2664627784381053\n },\n {\n \"content\": \" // NOTE: Remember that TAU = 2 * PI.\\n\\n let (y_bound_min, y_bound_max) = (f32::max(-TAU_f32, bounds.0), f32::min(TAU_f32, bounds.1) );\\n\\n\\n\\n // Frequencies on log scale from 24 to nyquist frequency\\n\\n use plotters::prelude::*;\\n\\n //fn main() -> Result<(), Box<dyn std::error::Error>> {\\n\\n let root = SVGBackend::new(path /* \\\"plots/0.svg\\\" */, (400, 300)).into_drawing_area();\\n\\n root.fill(&WHITE).unwrap();\\n\\n let mut chart = ChartBuilder::on(&root)\\n\\n .caption(line_name.to_string() + \\\" - Phase shift(Rad) vs Freq\\\", (\\\"sans-serif\\\", 25).into_font())\\n\\n .margin(5)\\n\\n .x_label_area_size(30)\\n\\n .y_label_area_size(30)\\n\\n .build_cartesian_2d(x_bound_min..x_bound_max, y_bound_min..y_bound_max )\\n\\n .unwrap();\\n\\n \\n\\n chart.configure_mesh().draw().unwrap();\\n\\n \\n\\n chart\\n\\n .draw_series(LineSeries::new(\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 42,\n \"score\": 3.2664627784381053\n },\n {\n \"content\": \"\\n\\nuse crate::iir_filter::ProcessingBlock; // Trait\\n\\nuse std::f32::consts::TAU as TAU_f32;\\n\\n\\n\\n\\n\\n/// Get bounds for printing fft results\\n\\n/// \\n\\n/// In Python:\\n\\n/// >>> import numpy\\n\\n/// >>> array = numpy.linspace(-20.0, 20.0, 1000)\\n\\n/// >>> get_bounds(array, 1000)\\n\\n/// (-20, 20)\\n\\n///\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 43,\n \"score\": 3.223986939398533\n },\n {\n \"content\": \" fn test_show_frequency_response() {\\n\\n let frequency = 5_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let mut filter = make_lowpass(frequency, sample_rate, None);\\n\\n // show_frequency_response(& mut filter, sample_rate as usize, \\\"plots/lowpass.svg\\\", \\\"lowpass\\\");\\n\\n \\n\\n // assert_eq!(true, false);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 44,\n \"score\": 3.0147007686748917\n },\n {\n \"content\": \" fft_out.iter().enumerate().map(|pair| (pair.0, *pair.1 ) ),\\n\\n &BLUE,\\n\\n )).unwrap()\\n\\n .label(line_name)\\n\\n .legend(|(x, y)| PathElement::new(vec![(x, y), (x + 20, y)], &BLUE));\\n\\n \\n\\n chart\\n\\n .configure_series_labels()\\n\\n .background_style(&WHITE.mix(0.8))\\n\\n .border_style(&BLACK)\\n\\n .draw().unwrap();\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n use crate::butterworth_filter::make_lowpass;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 45,\n \"score\": 2.9747615521659974\n },\n {\n \"content\": \"# Audio filters in Rust\\n\\nA port of the WebAudio API filters to Rust.\\n\\n\\n\\n## Description \\n\\nAudio or DSP filters, allow you to attenuate or accentuate some frequencies or range of frequencies in a signal. The signal can be of any kind, but in here, we will focus on 1D signals. Like audio signals. There can also occur differences in the signal phases, that vary with the filter and the frequency components of the signal. <br>\\n\\nThis is a port of Audio filters, from Python to Rust. My port was made from TheAlgorithms GitHub in Python (see references below). That is, by it self a port from WebAudio API C++ filters implementation used by the browsers. <br>\\n\\n\\n\\n\\n\\n## The following filters are implemented over a BiQuad IIR filter\\n\\n1. **low-pass**\\n\\n2. **high-pass**\\n\\n3. **band-pass**\\n\\n4. **all-pass**\\n\\n5. **peak**\\n\\n6. **low-shelf**\\n\\n7. **high-shelf** \\n\\n8. **notch**\\n\\n9. **10 band equalizer**\\n\\n\\n\\n## Plots of the filters Gain (dB) and phase shift response \\n\\n\\n\\n### low-pass - freq = 5.000 Hz - sample_rate = 48.000 samples/sec \\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### high-pass - freq = 5.000 Hz - sample_rate = 48.000 samples/sec\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### band-pass - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - q_factor = 1.0\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### all-pass - freq = 10.000 Hz - sample_rate = 48.000 samples/sec\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### peak - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 6 dB\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 46,\n \"score\": 2.9167655106882004\n },\n {\n \"content\": \" let mut planner = FftPlanner::<f32>::new();\\n\\n let fft = planner.plan_fft_forward(sample_rate);\\n\\n\\n\\n let mut buffer = vec![Complex{ re: 0.0_f32, im: 0.0_f32 }; sample_rate];\\n\\n\\n\\n for i in 0..outputs.len() {\\n\\n buffer[i].re = outputs[i] as f32;\\n\\n }\\n\\n\\n\\n fft.process(& mut buffer[..]);\\n\\n\\n\\n // Calculates the absolute value or the norm. \\n\\n let fft_out = buffer.iter().map(|c| c.norm() ).collect::<Vec<f32>>();\\n\\n // Transform the result into dB's.\\n\\n let fft_db = fft_out.iter().map(|val| 20.0 * f32::log10(*val) ).collect::<Vec<f32>>();\\n\\n\\n\\n\\n\\n // Display within reasonable bounds\\n\\n let (x_bound_min, x_bound_max) = (0_usize, sample_rate / 2 - 1 - 100 );\\n\\n let fft_db = & fft_db[x_bound_min..x_bound_max];\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 47,\n \"score\": 2.81991270568186\n },\n {\n \"content\": \" let mut planner = FftPlanner::<f32>::new();\\n\\n let fft = planner.plan_fft_forward(sample_rate);\\n\\n\\n\\n let mut buffer = vec![Complex{ re: 0.0_f32, im: 0.0_f32 }; sample_rate];\\n\\n\\n\\n for i in 0..outputs.len() {\\n\\n buffer[i].re = outputs[i] as f32;\\n\\n }\\n\\n\\n\\n fft.process(& mut buffer[..]);\\n\\n\\n\\n // Calculates the phase angle or the atan(b/a) for a complex number c = a + bj . \\n\\n // let fft_out = buffer.iter().map(|c| c.atan().re ).collect::<Vec<f32>>();\\n\\n let fft_out = buffer.iter().map(|c| f32::atan2(c.im, c.re) ).collect::<Vec<f32>>();\\n\\n\\n\\n // Display within reasonable bounds\\n\\n let (x_bound_min, x_bound_max) = (0_usize, sample_rate / 2 - 1 - 150 );\\n\\n let fft_out = & fft_out[x_bound_min..x_bound_max];\\n\\n let bounds = get_bounds(& fft_out, sample_rate, x_bound_max);\\n\\n // let (y_bound_min, y_bound_max) = (f32::max(-80.0, bounds.0), f32::min(80.0, bounds.1) );\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 48,\n \"score\": 2.683301681575874\n },\n {\n \"content\": \" if a_coeffs.len() < self.order + 1 {\\n\\n self.a_coeffs.push(1.0);\\n\\n self.a_coeffs.extend(a_coeffs);\\n\\n } else {\\n\\n self.a_coeffs.extend(a_coeffs);\\n\\n }\\n\\n self.b_coeffs.clear();\\n\\n self.b_coeffs.extend(b_coeffs);\\n\\n \\n\\n Ok(())\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\nimpl ProcessingBlock for IIRFilter {\\n\\n\\n\\n /// Calculate y[n]\\n\\n /// \\n\\n /// In Python\\n\\n /// >>> filt = IIRFilter(2)\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 49,\n \"score\": 2.6258649820395767\n },\n {\n \"content\": \"/// 11. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n/// \\n\\n/// 10 Band Equalizer\\n\\n/// \\n\\n/// 12. Making an EQ from cascading filters\\n\\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\\n\\n/// \\n\\n/// 13. PEAK/NOTCH FILTER DESIGN\\n\\n/// https://www.dsprelated.com/showcode/169.php\\n\\n/// \\n\\n/// 14. The Equivalence of Various Methods of Computing\\n\\n/// Biquad Coefficients for Audio Parametric Equalizers\\n\\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\\n\\n///\\n\\n/// 15. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 50,\n \"score\": 2.583676947925235\n },\n {\n \"content\": \"/// 11. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n/// \\n\\n/// 10 Band Equalizer\\n\\n/// \\n\\n/// 12. Making an EQ from cascading filters\\n\\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\\n\\n/// \\n\\n/// 13. PEAK/NOTCH FILTER DESIGN\\n\\n/// https://www.dsprelated.com/showcode/169.php\\n\\n/// \\n\\n/// 14. The Equivalence of Various Methods of Computing\\n\\n/// Biquad Coefficients for Audio Parametric Equalizers\\n\\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\\n\\n///\\n\\n/// 15. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 51,\n \"score\": 2.583676947925235\n },\n {\n \"content\": \"/// 11. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n/// \\n\\n/// 10 Band Equalizer\\n\\n/// \\n\\n/// 12. Making an EQ from cascading filters\\n\\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\\n\\n/// \\n\\n/// 13. PEAK/NOTCH FILTER DESIGN\\n\\n/// https://www.dsprelated.com/showcode/169.php\\n\\n/// \\n\\n/// 14. The Equivalence of Various Methods of Computing\\n\\n/// Biquad Coefficients for Audio Parametric Equalizers\\n\\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\\n\\n///\\n\\n/// 15. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 52,\n \"score\": 2.583676947925235\n },\n {\n \"content\": \"/// 11. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n/// \\n\\n/// 10 Band Equalizer\\n\\n/// \\n\\n/// 12. Making an EQ from cascading filters\\n\\n/// https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters\\n\\n/// \\n\\n/// 13. PEAK/NOTCH FILTER DESIGN\\n\\n/// https://www.dsprelated.com/showcode/169.php\\n\\n/// \\n\\n/// 14. The Equivalence of Various Methods of Computing\\n\\n/// Biquad Coefficients for Audio Parametric Equalizers\\n\\n/// http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf\\n\\n///\\n\\n/// 15. How to learn modern Rust\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust\\n\\n///\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 53,\n \"score\": 2.583676947925235\n },\n {\n \"content\": \" let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect(); \\n\\n print_values(& target_vec, & res_coeffs);\\n\\n for i in 0..target_vec.len() {\\n\\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\\n\\n }\\n\\n\\n\\n // assert_eq!(true, false);\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 54,\n \"score\": 2.423928089338\n },\n {\n \"content\": \" let b2 = big_a * (pmc - aa2);\\n\\n let a0 = ppmc + aa2;\\n\\n let a1 = -2.0 * pmpc;\\n\\n let a2 = ppmc - aa2;\\n\\n\\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 55,\n \"score\": 2.3884184060014437\n },\n {\n \"content\": \" let b2 = big_a * (ppmc - aa2);\\n\\n let a0 = pmc + aa2;\\n\\n let a1 = 2.0 * mpc;\\n\\n let a2 = pmc - aa2;\\n\\n\\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let _ = filter.set_coefficients(& [a0, a1, a2], & [b0, b1, b2]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 56,\n \"score\": 2.3884184060014437\n },\n {\n \"content\": \"\\n\\n // 2º case.\\n\\n let a_coeffs = [1.0, 0.0, 0.0];\\n\\n let b_coeffs = [0.0, 0.0, 0.0];\\n\\n let filter_order: usize = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let res_coef = filter.set_coefficients(& a_coeffs, & b_coeffs);\\n\\n assert!(res_coef.is_ok());\\n\\n let res = filter.process(0.0);\\n\\n assert!((res - 0.0).abs() < 0.00001);\\n\\n\\n\\n println!(\\\"filter res: {} , should be 0.0 .\\\", res);\\n\\n\\n\\n // assert_eq!(true, false);\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 57,\n \"score\": 2.260482778384333\n },\n {\n \"content\": \" print!(\\\"{}, \\\", str_t); \\n\\n }\\n\\n println!(\\\"\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_make_lowpass() {\\n\\n // >>> filter = make_lowpass(1000, 48000)\\n\\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n // [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\\n\\n // 0.008555138626189618, 0.004277569313094809]\\n\\n \\n\\n let frequency = 1_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let filter = make_lowpass(frequency, sample_rate, None);\\n\\n \\n\\n let target_vec = vec![1.0922959556412573, -1.9828897227476208, 0.9077040443587427,\\n\\n 0.004277569313094809, 0.008555138626189618, 0.004277569313094809];\\n\\n \\n\\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 58,\n \"score\": 2.22595702334123\n },\n {\n \"content\": \"### peakEQ_const_Q G_pos - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 5 dB\\n\\nq_factor = 2 * sqrt(2) = 2.828 <br>\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### peakEQ_const_Q G_neg - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = -5 dB\\n\\nq_factor = 2 * sqrt(2) = 2.828 <br>\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### low-shelf - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 6 dB\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### high-shelf - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - gain = 6 dB\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### notch - freq = 10.000 Hz - sample_rate = 48.000 samples/sec - q_factor = 0.05\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n### 10 band Equalizer - sample_rate = 48.000 samples/sec - q_factor = 2.828\\n\\n```\\n\\n10 Band Equalizer\\n\\n\\n\\nband_0: 29 Hz, gain: -10 dB\\n\\nband_1: 59 Hz, gain: 0 dB\\n\\nband_2: 119 Hz, gain: -5 dB\\n\\nband_3: 237 Hz, gain: 5 dB\\n\\nband_4: 474 Hz, gain: 0 dB\\n\\nband_5: 947 Hz, gain: -5 dB\\n\\nband_6: 1.889 Hz, gain: 0 dB\\n\\nband_7: 3.770 Hz, gain: 5 dB\\n\\nband_8: 7.523 Hz, gain: 10 dB\\n\\nband_9: 15.011 Hz, gain: 12 dB\\n\\n```\\n\\n\\n\\n\\n\\n <br>\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 59,\n \"score\": 2.2050192973473397\n },\n {\n \"content\": \" 0.9957224306869052, -1.9914448613738105, 0.9957224306869052];\\n\\n \\n\\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\\n\\n print_values(& target_vec, & res_coeffs);\\n\\n for i in 0..target_vec.len() {\\n\\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\\n\\n }\\n\\n\\n\\n // assert_eq!(true, false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_make_bandpass() {\\n\\n // >>> filter = make_bandpass(1000, 48000)\\n\\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n // [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.06526309611002579,\\n\\n // 0, -0.06526309611002579]\\n\\n \\n\\n let frequency = 1_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 60,\n \"score\": 2.1159807359636633\n },\n {\n \"content\": \" \\n\\n let frequency = 1_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let filter = make_allpass(frequency, sample_rate, None);\\n\\n \\n\\n let target_vec = vec![1.0922959556412573, -1.9828897227476208, 0.9077040443587427,\\n\\n 0.9077040443587427, -1.9828897227476208, 1.0922959556412573];\\n\\n \\n\\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\\n\\n print_values(& target_vec, & res_coeffs);\\n\\n for i in 0..target_vec.len() {\\n\\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\\n\\n }\\n\\n\\n\\n // assert_eq!(true, false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_make_peak() {\\n\\n // >>> filter = make_peak(1000, 48000, 6)\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 61,\n \"score\": 2.0865271434709243\n },\n {\n \"content\": \" b_coeffs[0] = 1.0;\\n\\n b_coeffs },\\n\\n // x[n-1] ... x[n-k]\\n\\n input_history: vec![0.0; order],\\n\\n // y[n-1] ... y[n-k]\\n\\n output_history: vec![0.0; order],\\n\\n }\\n\\n }\\n\\n\\n\\n /// Set the coefficients for the IIR filter. These should both be of size order + 1.\\n\\n /// a_0 may be left out, and it will use 1.0 as default value.\\n\\n ///\\n\\n /// This method works well with scipy's filter design functions\\n\\n /// >>> # Make a 2nd-order 1000Hz butterworth lowpass filter\\n\\n /// >>> import scipy.signal\\n\\n /// >>> b_coeffs, a_coeffs = scipy.signal.butter(2, 1000,\\n\\n /// ... btype='lowpass',\\n\\n /// ... fs=48000)\\n\\n /// >>> filt = IIRFilter(2)\\n\\n /// >>> filt.set_coefficients(a_coeffs, b_coeffs)\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 62,\n \"score\": 2.084560662282179\n },\n {\n \"content\": \" let filter = make_bandpass(frequency, sample_rate, None);\\n\\n\\n\\n let target_vec = vec![1.0922959556412573, -1.9828897227476208, 0.9077040443587427,\\n\\n 0.06526309611002579, 0.0, -0.06526309611002579];\\n\\n\\n\\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\\n\\n print_values(& target_vec, & res_coeffs);\\n\\n for i in 0..target_vec.len() {\\n\\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\\n\\n }\\n\\n\\n\\n // assert_eq!(true, false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_make_allpass() {\\n\\n // >>> filter = make_allpass(1000, 48000)\\n\\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n // [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.9077040443587427,\\n\\n // -1.9828897227476208, 1.0922959556412573]\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 63,\n \"score\": 2.057882258193523\n },\n {\n \"content\": \" let res = filter.process(0.0);\\n\\n assert!((res - 0.0).abs() < 0.00001);\\n\\n\\n\\n println!(\\\"filter res: {} , should be 0.0 .\\\", res);\\n\\n // assert_eq!(true, false);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_iir_filter_001() {\\n\\n // 1º case.\\n\\n let a_coeffs = [0.0, 0.0];\\n\\n let b_coeffs = [0.0, 0.0, 0.0];\\n\\n let filter_order: usize = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n let res_coef = filter.set_coefficients(& a_coeffs, & b_coeffs);\\n\\n assert!(res_coef.is_ok());\\n\\n let res = filter.process(0.0);\\n\\n assert!((res - 0.0).abs() < 0.00001);\\n\\n\\n\\n println!(\\\"filter res: {} , should be 0.0 .\\\", res);\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 64,\n \"score\": 2.041750097763309\n },\n {\n \"content\": \" [http://ethanwiner.com/filters.html](http://ethanwiner.com/filters.html)\\n\\n\\n\\n9. **Audio filter - Wikipedia** <br>\\n\\n [https://en.wikipedia.org/wiki/Audio_filter](https://en.wikipedia.org/wiki/Audio_filter)\\n\\n\\n\\n11. **Electronic filter - Wikipedia** <br>\\n\\n [https://en.wikipedia.org/wiki/Electronic_filter](https://en.wikipedia.org/wiki/Electronic_filter)\\n\\n\\n\\n**10 Bands Equalizer** <br>\\n\\n\\n\\n12. **Making an EQ from cascading filters** <br>\\n\\n [https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters](https://dsp.stackexchange.com/questions/10309/making-an-eq-from-cascading-filters)\\n\\n \\n\\n13. **Peak / Notch filter design** <br>\\n\\n [https://www.dsprelated.com/showcode/169.php](https://www.dsprelated.com/showcode/169.php)\\n\\n\\n\\n14. **The Equivalence of Various Methods of Computing** <br>\\n\\n **Biquad Coefficients for Audio Parametric Equalizers** <br>\\n\\n [http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf](http://www.thesounddesign.com/MIO/EQ-Coefficients.pdf)\\n\\n\\n\\n15. **How to learn modern Rust** <br>\\n\\n [https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust](https://github.com/joaocarvalhoopen/How_to_learn_modern_Rust)\\n\\n\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 65,\n \"score\": 2.0274232705183395\n },\n {\n \"content\": \" // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n // [1.0653405327119334, -1.9828897227476208, 0.9346594672880666, 1.1303715025601122,\\n\\n // -1.9828897227476208, 0.8696284974398878]\\n\\n\\n\\n let frequency = 1_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let gain_db = 6.0; // dB\\n\\n let filter = make_peak(frequency, sample_rate, gain_db, None);\\n\\n \\n\\n let target_vec = vec![1.0653405327119334, -1.9828897227476208, 0.9346594672880666,\\n\\n 1.1303715025601122, -1.9828897227476208, 0.8696284974398878];\\n\\n \\n\\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\\n\\n print_values(& target_vec, & res_coeffs);\\n\\n for i in 0..target_vec.len() {\\n\\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\\n\\n }\\n\\n\\n\\n // assert_eq!(true, false);\\n\\n }\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 66,\n \"score\": 2.0028889415397626\n },\n {\n \"content\": \"\\n\\n #[test]\\n\\n fn test_make_lowshelf() {\\n\\n // >>> filter = make_lowshelf(1000, 48000, 6)\\n\\n // >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\\n\\n // [3.0409336710888786, -5.608870992220748, 2.602157875636628, 3.139954022810743,\\n\\n // -5.591841778072785, 2.5201667380627257]\\n\\n\\n\\n let frequency = 1_000.0; // Hz\\n\\n let sample_rate = 48_000; // Samples\\n\\n let gain_db = 6.0; // dB\\n\\n let filter = make_lowshelf(frequency, sample_rate, gain_db, None);\\n\\n\\n\\n let target_vec = vec![3.0409336710888786, -5.608870992220748, 2.602157875636628,\\n\\n 3.139954022810743, -5.591841778072785, 2.5201667380627257];\\n\\n\\n\\n let res_coeffs: Vec<&f64> = filter.a_coeffs.iter().chain(filter.b_coeffs.iter()).collect();\\n\\n print_values(& target_vec, & res_coeffs);\\n\\n for i in 0..target_vec.len() {\\n\\n assert_eq!(*(res_coeffs[i]), target_vec[i]);\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 67,\n \"score\": 1.9764799506096642\n },\n {\n \"content\": \" b1 = (2.0 * (_k_sqr - 1.0)) / (1.0 + ((1.0 / q) * k) + _k_sqr);\\n\\n b2 = (1.0 - ((v0 / q) * k) + _k_sqr) / (1.0 + ((1.0 / q) * k) + _k_sqr);\\n\\n a1 = b1;\\n\\n a2 = (1.0 - ((1.0 / q) * k) + _k_sqr) / (1.0 + ((1.0 / q) * k) + _k_sqr);\\n\\n \\n\\n //***********\\n\\n // CUT\\n\\n //***********\\n\\n } else { \\n\\n b0 = (1.0 + ((1.0 / q) * k) + _k_sqr) / (1.0 + ((v0 / q) * k) + _k_sqr);\\n\\n b1 = (2.0 * (_k_sqr - 1.0)) / (1.0 + ((v0 / q) * k) + _k_sqr);\\n\\n b2 = (1.0 - ((1.0 / q) * k) + _k_sqr) / (1.0 + ((v0 / q) * k) + _k_sqr);\\n\\n a1 = b1;\\n\\n a2 = (1.0 - ((v0 / q) * k) + _k_sqr) / (1.0 + ((v0 / q) * k) + _k_sqr);\\n\\n }\\n\\n\\n\\n let filter_order = 2;\\n\\n let mut filter = IIRFilter::new(filter_order);\\n\\n // Note: The BiQuad filter fill's in the a0 with i.0 automatically.\\n\\n let _ = filter.set_coefficients(& [a1, a2], & [b0, b1, b2]);\\n\\n \\n\\n filter\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 68,\n \"score\": 1.9735473317844199\n },\n {\n \"content\": \"/// -low-shelf\\n\\n/// -high-shelf \\n\\n/// -notch\\n\\n/// -10 band equalizer\\n\\n/// \\n\\n/// License: MIT Open Source License, like the original license from\\n\\n/// GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// How to run the code. \\n\\n/// \\n\\n/// To make a project for this files do:\\n\\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\\n\\n/// \\n\\n/// cargo new audio_filters_in_rust\\n\\n/// cd audio_filters_in_rust\\n\\n/// \\n\\n/// -Copy the repository files to this directory and overlap them.\\n\\n/// \\n\\n/// To compile do:\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 69,\n \"score\": 1.9502973675920736\n },\n {\n \"content\": \"/// -low-shelf\\n\\n/// -high-shelf \\n\\n/// -notch\\n\\n/// -10 band equalizer\\n\\n/// \\n\\n/// License: MIT Open Source License, like the original license from\\n\\n/// GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// How to run the code. \\n\\n/// \\n\\n/// To make a project for this files do:\\n\\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\\n\\n/// \\n\\n/// cargo new audio_filters_in_rust\\n\\n/// cd audio_filters_in_rust\\n\\n/// \\n\\n/// -Copy the repository files to this directory and overlap them.\\n\\n/// \\n\\n/// To compile do:\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 70,\n \"score\": 1.9502973675920736\n },\n {\n \"content\": \"/// -low-shelf\\n\\n/// -high-shelf \\n\\n/// -notch\\n\\n/// -10 band equalizer\\n\\n/// \\n\\n/// License: MIT Open Source License, like the original license from\\n\\n/// GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// How to run the code. \\n\\n/// \\n\\n/// To make a project for this files do:\\n\\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\\n\\n/// \\n\\n/// cargo new audio_filters_in_rust\\n\\n/// cd audio_filters_in_rust\\n\\n/// \\n\\n/// -Copy the repository files to this directory and overlap them.\\n\\n/// \\n\\n/// To compile do:\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 71,\n \"score\": 1.9502973675920736\n },\n {\n \"content\": \"/// -low-shelf\\n\\n/// -high-shelf \\n\\n/// -notch\\n\\n/// -10 band equalizer\\n\\n/// \\n\\n/// License: MIT Open Source License, like the original license from\\n\\n/// GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// How to run the code. \\n\\n/// \\n\\n/// To make a project for this files do:\\n\\n/// -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\\n\\n/// \\n\\n/// cargo new audio_filters_in_rust\\n\\n/// cd audio_filters_in_rust\\n\\n/// \\n\\n/// -Copy the repository files to this directory and overlap them.\\n\\n/// \\n\\n/// To compile do:\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 72,\n \"score\": 1.9502973675920736\n },\n {\n \"content\": \"/// cargo build --release\\n\\n/// \\n\\n/// To run do:\\n\\n/// cargo run --release\\n\\n/// \\n\\n/// to run the tests do:\\n\\n/// cargo test\\n\\n/// \\n\\n/// References:\\n\\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\\n\\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \\n\\n/// \\n\\n/// 3. Good resources on DSP – Digital Signal Programming\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\\n\\n///\\n\\n/// 4. Biquads - EarLevel\\n\\n/// http://www.earlevel.com/main/2003/02/28/biquads/\\n\",\n \"file_path\": \"src/butterworth_filter.rs\",\n \"rank\": 73,\n \"score\": 1.7619565013046903\n },\n {\n \"content\": \"/// cargo build --release\\n\\n/// \\n\\n/// To run do:\\n\\n/// cargo run --release\\n\\n/// \\n\\n/// to run the tests do:\\n\\n/// cargo test\\n\\n/// \\n\\n/// References:\\n\\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\\n\\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \\n\\n/// \\n\\n/// 3. Good resources on DSP – Digital Signal Programming\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\\n\\n///\\n\\n/// 4. Biquads - EarLevel\\n\\n/// http://www.earlevel.com/main/2003/02/28/biquads/\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 74,\n \"score\": 1.7619565013046903\n },\n {\n \"content\": \"/// cargo build --release\\n\\n/// \\n\\n/// To run do:\\n\\n/// cargo run --release\\n\\n/// \\n\\n/// to run the tests do:\\n\\n/// cargo test\\n\\n/// \\n\\n/// References:\\n\\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\\n\\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \\n\\n/// \\n\\n/// 3. Good resources on DSP – Digital Signal Programming\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\\n\\n///\\n\\n/// 4. Biquads - EarLevel\\n\\n/// http://www.earlevel.com/main/2003/02/28/biquads/\\n\",\n \"file_path\": \"src/iir_filter.rs\",\n \"rank\": 75,\n \"score\": 1.7619565013046903\n },\n {\n \"content\": \"/// cargo build --release\\n\\n/// \\n\\n/// To run do:\\n\\n/// cargo run --release\\n\\n/// \\n\\n/// to run the tests do:\\n\\n/// cargo test\\n\\n/// \\n\\n/// References:\\n\\n/// 1. GitHub - TheAlgorithms / Python / audio_filters\\n\\n/// https://github.com/TheAlgorithms/Python/tree/master/audio_filters\\n\\n///\\n\\n/// 2. WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients\\n\\n/// https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html \\n\\n/// \\n\\n/// 3. Good resources on DSP – Digital Signal Programming\\n\\n/// https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming\\n\\n///\\n\\n/// 4. Biquads - EarLevel\\n\\n/// http://www.earlevel.com/main/2003/02/28/biquads/\\n\",\n \"file_path\": \"src/show_response.rs\",\n \"rank\": 76,\n \"score\": 1.7619565013046903\n },\n {\n \"content\": \"## How to run the code \\n\\n```\\n\\nTo make a project for this files do:\\n\\n -Install Rust your computer (Linux, Win, Mac, Raspberry Pi).\\n\\n \\n\\n cargo new audio_filters_in_rust\\n\\n cd audio_filters_in_rust\\n\\n \\n\\n -Copy the repository files to this directory and overlap them.\\n\\n \\n\\nTo compile do:\\n\\n cargo build --release\\n\\n \\n\\nTo run do:\\n\\n cargo run --release\\n\\n \\n\\nto run the tests do:\\n\\n cargo test\\n\\n```\\n\\n\\n\\n\\n\\n## References:\\n\\n\\n\\n1. **GitHub - TheAlgorithms / Python / audio_filters** <br>\\n\\n [https://github.com/TheAlgorithms/Python/tree/master/audio_filters](https://github.com/TheAlgorithms/Python/tree/master/audio_filters)\\n\\n\\n\\n2. **WebAudio - Cookbook formulae for audio equalizer biquad filter coefficients** <br>\\n\\n [https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html](https://webaudio.github.io/Audio-EQ-Cookbook/audio-eq-cookbook.html)\\n\\n\\n\\n3. **Good resources on DSP** – Digital Signal Processing <br> \\n\\n [https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming](https://github.com/joaocarvalhoopen/How_to_learn_modern_electronics#dsp--digital-signal-programming)\\n\\n\\n\\n4. **Biquads - EarLevel** <br>\\n\\n [http://www.earlevel.com/main/2003/02/28/biquads/](http://www.earlevel.com/main/2003/02/28/biquads/)\\n\\n\\n\\n5. **Biquad C++ source code - EarLevel** <br>\\n\\n [https://www.earlevel.com/main/2012/11/26/biquad-c-source-code/](https://www.earlevel.com/main/2012/11/26/biquad-c-source-code/)\\n\\n\\n\\n6. **A biquad calculator v3 - EarLevel** <br>\\n\\n [https://www.earlevel.com/main/2021/09/02/biquad-calculator-v3/](https://www.earlevel.com/main/2021/09/02/biquad-calculator-v3/)\\n\\n\\n\\n7. **WebAudio API - Mozilla Docs** <br>\\n\\n [https://developer.mozilla.org/en-US/docs/Web/API/Web_Audio_API](https://developer.mozilla.org/pt-BR/docs/Web/API/Web_Audio_API)\\n\\n \\n\\n8. **Audio Filters - Theory and Practice** <br>\\n\\n by Ethan Winer <br>\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 77,\n \"score\": 0.8908783042355926\n }\n]","isConversational":false}}},{"rowIdx":796,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"sandbox/src/tilemap.rs"},"repo_name":{"kind":"string","value":"aengusmcmillin/Gouda"},"commit":{"kind":"string","value":"4aed65c94ad4147372d71c08622dacf01f5eac4e"},"file_code":{"kind":"string","value":"use gouda::rendering::{drawable::{TextureDrawable, QuadDrawable}, Renderer, Scene, texture::RenderableTexture};\nuse gouda::ecs::{ECS, Entity, GenIndex};\nuse std::rc::Rc;\nuse crate::camera::Camera;\nuse gouda::bmp::Bitmap;\nuse gouda::mouse_capture::{MouseCaptureArea, MouseCaptureLayer, ActiveCaptureLayer};\nuse gouda::types::{Bounds, Direction};\nuse gouda::images::Image;\nuse gouda::images::png::PNG;\nuse crate::hearth::Hearth;\n\nconst GRASS_COLOR: [f32; 3] = [0.2, 0.4, 0.3];\nconst HEARTH_COLOR: [f32; 3] = [0.5, 0.2, 0.2];\nconst BORDER_COLOR: [f32; 3] = [0.5, 0.5, 0.5];\n\n#[derive(Debug)]\npub struct Tile {\n pub x: i32,\n pub y: i32,\n pub occupied: bool,\n neighbors: [Option<Entity>; 4],\n color_drawable: Option<QuadDrawable>,\n texture_drawable: Option<TextureDrawable>,\n}\n\nimpl Tile {\n pub fn create_image_tile(image: &Image, ecs: &mut ECS, x: usize, y: usize) -> Entity {\n Self::create_texture_tile(ecs, image, x, y)\n }\n\n pub fn neighbor(&self, direction: Direction) -> Option<Entity> {\n self.neighbors[direction as usize]\n }\n\n fn create_texture_tile(ecs: &mut ECS, image: &Image, x: usize, y: usize) -> Entity {\n let renderer = ecs.read_res::<Rc<Renderer>>();\n let drawable = TextureDrawable::new(false, renderer, RenderableTexture::new(renderer, image), [-5. + x as f32, -3. + y as f32, 0.], [0.52, 0.52, 1.], [0.; 3]);\n let tile = Tile {\n color_drawable: None,\n texture_drawable: Some(drawable),\n occupied: false,\n x: x as i32 - 5,\n y: y as i32 - 3,\n neighbors: [None; 4],\n };\n ecs.build_entity().add(tile).add(MouseCaptureArea::new(Bounds{x: x as i32 * 80, y: y as i32 * 80 + 160, w: 80, h: 80})).entity()\n }\n\n fn create_tile(ecs: &mut ECS, color: [f32; 3], x: usize, y: usize) -> Entity {\n let renderer = ecs.read_res::<Rc<Renderer>>();\n let quad = QuadDrawable::new(false, renderer, color, [-5. + x as f32 * 1., -3. + y as f32 * 1., 0.], [0.5, 0.5, 1.], [0.; 3]);\n let tile = Tile {\n color_drawable: Some(quad),\n texture_drawable: None,\n occupied: false,\n x: x as i32 - 5,\n y: y as i32 - 3,\n neighbors: [None; 4],\n };\n ecs.build_entity().add(tile).add(MouseCaptureArea::new(Bounds{x: x as i32 * 80, y: y as i32 * 80 + 160, w: 80, h: 80})).entity()\n }\n\n pub fn draw(&self, scene: &Scene, camera: &Camera) {\n if let Some(drawable) = &self.color_drawable {\n drawable.draw_with_projection(&scene, &camera.projection_buffer);\n }\n if let Some(drawable) = &self.texture_drawable {\n drawable.draw_with_projection(&scene, &camera.projection_buffer);\n }\n }\n}\n\npub struct Tilemap {\n tiles: Vec<Vec<Entity>>,\n borders: Vec<Entity>,\n}\n\nfn set_neighbors(tile: &mut Tile, x: usize, y: usize, tiles: &Vec<Vec<Entity>>) {\n tile.neighbors = [\n if y > 0 { Some(tiles[x][y - 1]) } else { None },\n if x < (tiles.len() - 1) { Some(tiles[x + 1][y]) } else { None },\n if y < (tiles[x].len() - 1) { Some(tiles[x][y + 1]) } else { None },\n if x > 0 { Some(tiles[x - 1][y]) } else { None },\n ]\n}\n\nimpl Tilemap {\n pub fn borders(&self) -> &Vec<Entity> {\n return &self.borders;\n }\n\n pub fn create(ecs: &mut ECS) {\n let mut tiles: Vec<Vec<Entity>> = vec![Vec::with_capacity(9); 11];\n let mut center_tile = None;\n let grass = PNG::from_file(\"bitmap/grass.png\").unwrap().image();\n let border = Bitmap::new(\"bitmap/grass2.bmp\").unwrap().image();\n let mut borders = vec!();\n for x in 0..11 {\n for y in 0..9 {\n let tile = if x == 0 || x == 10 || y == 0 || y == 8 {\n let e = Tile::create_image_tile(&border, ecs, x, y);\n borders.push(e);\n e\n } else {\n Tile::create_image_tile(&grass, ecs, x, y)\n };\n if x == 5 && y == 4 {\n center_tile = Some(tile.clone());\n }\n tiles[x].push(tile);\n }\n }\n let mut all_tiles = vec![];\n for tiles in &tiles {\n for tile in tiles {\n all_tiles.push(tile.clone());\n }\n }\n\n for x in 0..11 {\n for y in 0..9 {\n let t = ecs.write::<Tile>(&tiles[x][y]).unwrap();\n set_neighbors(t, x, y, &tiles);\n }\n }\n let capture_area = MouseCaptureLayer {\n sort_index: 0,\n capture_areas: all_tiles,\n };\n ecs.build_entity().add(capture_area).add(ActiveCaptureLayer {});\n let res = Tilemap {\n tiles,\n borders\n };\n ecs.add_res(res);\n\n Hearth::create(ecs, center_tile.unwrap());\n ecs.write::<Tile>(¢er_tile.unwrap()).unwrap().occupied = true;\n }\n\n pub fn tile_at_pos(&self, x: usize, y: usize) -> Entity {\n self.tiles[x][y].clone()\n }\n\n pub fn pos_of_tile(&self, tile: Entity) -> (f32, f32) {\n let mut x = 0.;\n for column in &self.tiles {\n let mut y = 0.;\n for t in column {\n if tile == *t {\n return (x - 5., y - 3.);\n }\n y += 1.;\n }\n x += 1.;\n }\n return (0., 0.);\n }\n}\n\n"},"prefix":{"kind":"string","value":"use gouda::rendering::{drawable::{TextureDrawable, QuadDrawable}, Renderer, Scene, texture::RenderableTexture};\nuse gouda::ecs::{ECS, Entity, GenIndex};\nuse std::rc::Rc;\nuse crate::camera::Camera;\nuse gouda::bmp::Bitmap;\nuse gouda::mouse_capture::{MouseCaptureArea, MouseCaptureLayer, ActiveCaptureLayer};\nuse gouda::types::{Bounds, Direction};\nuse gouda::images::Image;\nuse gouda::images::png::PNG;\nuse crate::hearth::Hearth;\n\nconst GRASS_COLOR: [f32; 3] = [0.2, 0.4, 0.3];\nconst HEARTH_COLOR: [f32; 3] = [0.5, 0.2, 0.2];\nconst BORDER_COLOR: [f32; 3] = [0.5, 0.5, 0.5];\n\n#[derive(Debug)]\npub struct Tile {\n pub x: i32,\n pub y: i32,\n pub occupied: bool,\n neighbors: [Option<Entity>; 4],\n color_drawable: Option<QuadDrawable>,\n texture_drawable: Option<TextureDrawable>,\n}\n\nimpl Tile {\n pub fn create_image_tile(image: &Image, ecs: &mut ECS, x: usize, y: usize) -> Entity {\n Self::create_texture_tile(ecs, image, x, y)\n }\n\n pub fn neighbor(&self, direction: Direction) -> Option<Entity> {\n self.neighbors[direction as usize]\n }\n\n fn create_texture_tile(ecs: &mut ECS, image: &Image, x: usize, y: usize) -> Entity {\n let renderer = ecs.read_res::<Rc<Renderer>>();\n let drawable = TextureDrawable::new(false, renderer, RenderableTexture::new(renderer, image), [-5. + x as f32, -3. + y as f32, 0.], [0.52, 0.52, 1.], [0.; 3]);\n let tile = Tile {\n color_drawable: None,\n texture_drawable: Some(drawable),\n "},"suffix":{"kind":"string","value":"\n\n fn create_tile(ecs: &mut ECS, color: [f32; 3], x: usize, y: usize) -> Entity {\n let renderer = ecs.read_res::<Rc<Renderer>>();\n let quad = QuadDrawable::new(false, renderer, color, [-5. + x as f32 * 1., -3. + y as f32 * 1., 0.], [0.5, 0.5, 1.], [0.; 3]);\n let tile = Tile {\n color_drawable: Some(quad),\n texture_drawable: None,\n occupied: false,\n x: x as i32 - 5,\n y: y as i32 - 3,\n neighbors: [None; 4],\n };\n ecs.build_entity().add(tile).add(MouseCaptureArea::new(Bounds{x: x as i32 * 80, y: y as i32 * 80 + 160, w: 80, h: 80})).entity()\n }\n\n pub fn draw(&self, scene: &Scene, camera: &Camera) {\n if let Some(drawable) = &self.color_drawable {\n drawable.draw_with_projection(&scene, &camera.projection_buffer);\n }\n if let Some(drawable) = &self.texture_drawable {\n drawable.draw_with_projection(&scene, &camera.projection_buffer);\n }\n }\n}\n\npub struct Tilemap {\n tiles: Vec<Vec<Entity>>,\n borders: Vec<Entity>,\n}\n\nfn set_neighbors(tile: &mut Tile, x: usize, y: usize, tiles: &Vec<Vec<Entity>>) {\n tile.neighbors = [\n if y > 0 { Some(tiles[x][y - 1]) } else { None },\n if x < (tiles.len() - 1) { Some(tiles[x + 1][y]) } else { None },\n if y < (tiles[x].len() - 1) { Some(tiles[x][y + 1]) } else { None },\n if x > 0 { Some(tiles[x - 1][y]) } else { None },\n ]\n}\n\nimpl Tilemap {\n pub fn borders(&self) -> &Vec<Entity> {\n return &self.borders;\n }\n\n pub fn create(ecs: &mut ECS) {\n let mut tiles: Vec<Vec<Entity>> = vec![Vec::with_capacity(9); 11];\n let mut center_tile = None;\n let grass = PNG::from_file(\"bitmap/grass.png\").unwrap().image();\n let border = Bitmap::new(\"bitmap/grass2.bmp\").unwrap().image();\n let mut borders = vec!();\n for x in 0..11 {\n for y in 0..9 {\n let tile = if x == 0 || x == 10 || y == 0 || y == 8 {\n let e = Tile::create_image_tile(&border, ecs, x, y);\n borders.push(e);\n e\n } else {\n Tile::create_image_tile(&grass, ecs, x, y)\n };\n if x == 5 && y == 4 {\n center_tile = Some(tile.clone());\n }\n tiles[x].push(tile);\n }\n }\n let mut all_tiles = vec![];\n for tiles in &tiles {\n for tile in tiles {\n all_tiles.push(tile.clone());\n }\n }\n\n for x in 0..11 {\n for y in 0..9 {\n let t = ecs.write::<Tile>(&tiles[x][y]).unwrap();\n set_neighbors(t, x, y, &tiles);\n }\n }\n let capture_area = MouseCaptureLayer {\n sort_index: 0,\n capture_areas: all_tiles,\n };\n ecs.build_entity().add(capture_area).add(ActiveCaptureLayer {});\n let res = Tilemap {\n tiles,\n borders\n };\n ecs.add_res(res);\n\n Hearth::create(ecs, center_tile.unwrap());\n ecs.write::<Tile>(¢er_tile.unwrap()).unwrap().occupied = true;\n }\n\n pub fn tile_at_pos(&self, x: usize, y: usize) -> Entity {\n self.tiles[x][y].clone()\n }\n\n pub fn pos_of_tile(&self, tile: Entity) -> (f32, f32) {\n let mut x = 0.;\n for column in &self.tiles {\n let mut y = 0.;\n for t in column {\n if tile == *t {\n return (x - 5., y - 3.);\n }\n y += 1.;\n }\n x += 1.;\n }\n return (0., 0.);\n }\n}\n\n"},"middle":{"kind":"string","value":"occupied: false,\n x: x as i32 - 5,\n y: y as i32 - 3,\n neighbors: [None; 4],\n };\n ecs.build_entity().add(tile).add(MouseCaptureArea::new(Bounds{x: x as i32 * 80, y: y as i32 * 80 + 160, w: 80, h: 80})).entity()\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"pub fn win32_process_keyboard(keyboard: &mut KeyboardInput, vkcode: i32, was_down: bool, is_down: bool) {\n\n if was_down != is_down {\n\n if vkcode == VK_UP {\n\n win32_process_keyboard_message(\n\n &mut keyboard.special_keys[SpecialKeys::UpArrow],\n\n is_down,\n\n );\n\n } else if vkcode == VK_LEFT {\n\n win32_process_keyboard_message(\n\n &mut keyboard.special_keys[SpecialKeys::LeftArrow],\n\n is_down,\n\n );\n\n } else if vkcode == VK_DOWN {\n\n win32_process_keyboard_message(\n\n &mut keyboard.special_keys[SpecialKeys::DownArrow],\n\n is_down,\n\n );\n\n } else if vkcode == VK_RIGHT {\n\n win32_process_keyboard_message(\n\n &mut keyboard.special_keys[SpecialKeys::RightArrow],\n","file_path":"src/platform/win32/win32_input.rs","rank":1,"score":222205.92440643694},{"content":"pub fn change_stone_text(ecs: &mut ECS) {\n\n let e = ecs.get2::<StoneText, GuiText>().first().unwrap().clone();\n\n let font = ecs.read_res::<Rc<Font>>().clone();\n\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\n\n let gold = ecs.read_res::<Supplies>().stone;\n\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, format!(\"STONE: {}\", gold), font);\n\n}\n\n\n\npub struct UpdateResourceTextMutation {\n\n\n\n}\n\n\n\nimpl Mutation for UpdateResourceTextMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n change_gold_text(ecs);\n\n change_wood_text(ecs);\n\n change_stone_text(ecs);\n\n }\n\n}\n\n\n","file_path":"sandbox/src/gui.rs","rank":2,"score":189950.36876607488},{"content":"pub fn change_gold_text(ecs: &mut ECS) {\n\n let e = ecs.get2::<GoldText, GuiText>().first().unwrap().clone();\n\n let font = ecs.read_res::<Rc<Font>>().clone();\n\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\n\n let gold = ecs.read_res::<Supplies>().gold;\n\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, format!(\"GOLD: {}\", gold), font);\n\n}\n\n\n","file_path":"sandbox/src/gui.rs","rank":3,"score":189950.36876607488},{"content":"pub fn change_wood_text(ecs: &mut ECS) {\n\n let e = ecs.get2::<WoodText, GuiText>().first().unwrap().clone();\n\n let font = ecs.read_res::<Rc<Font>>().clone();\n\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\n\n let gold = ecs.read_res::<Supplies>().wood;\n\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, format!(\"WOOD: {}\", gold), font);\n\n}\n\n\n","file_path":"sandbox/src/gui.rs","rank":4,"score":189950.36876607488},{"content":"pub fn i32_from_bytes(bytes: [u8; 4]) -> i32 {\n\n ((bytes[0] as i32) << 24)\n\n + ((bytes[1] as i32) << 16)\n\n + ((bytes[2] as i32) << 8)\n\n + ((bytes[3] as i32) << 0)\n\n}\n","file_path":"src/utils.rs","rank":5,"score":183126.7007148657},{"content":"pub fn create_transformation_matrix(translate: [f32; 3], rot: [f32; 3], scale: [f32; 3]) -> Mat4x4 {\n\n let transform_mat = Mat4x4 {\n\n data: [\n\n [1., 0., 0., translate[0]],\n\n [0., 1., 0., translate[1]],\n\n [0., 0., 1., translate[2]],\n\n [0., 0., 0., 1.],\n\n ]\n\n };\n\n\n\n let xrot = Mat4x4::x_rot_matrix(rot[0]);\n\n let yrot = Mat4x4::y_rot_matrix(rot[1]);\n\n let zrot = Mat4x4::z_rot_matrix(rot[2]);\n\n\n\n let scale_mat = Mat4x4 {\n\n data: [\n\n [scale[0], 0., 0., 0.],\n\n [0., scale[1], 0., 0.],\n\n [0., 0., scale[2], 0.],\n\n [0., 0., 0., 1.],\n\n ]\n\n };\n\n\n\n let transform_mat = zrot * yrot * xrot * transform_mat * scale_mat;\n\n return transform_mat;\n\n}\n","file_path":"src/math.rs","rank":6,"score":180871.82287601335},{"content":"pub fn change_stage_text(ecs: &mut ECS, text: &str) {\n\n let e = ecs.get2::<StageText, GuiText>().first().unwrap().clone();\n\n let font = ecs.read_res::<Rc<Font>>().clone();\n\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\n\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, String::from(text), font);\n\n}\n\n\n","file_path":"sandbox/src/gui.rs","rank":7,"score":177631.2114996994},{"content":"pub fn osx_process_keyboard_message(new_state: &mut GameButtonState, is_down: bool) {\n\n if new_state.ended_down != is_down {\n\n new_state.ended_down = is_down;\n\n new_state.half_transition_count += 1;\n\n }\n\n}\n\n\n","file_path":"src/platform/osx/osx_input.rs","rank":8,"score":174956.6671528549},{"content":"pub fn win32_process_keyboard_message(new_state: &mut GameButtonState, is_down: bool) {\n\n if new_state.ended_down != is_down {\n\n new_state.ended_down = is_down;\n\n new_state.half_transition_count += 1;\n\n }\n\n}\n\n\n","file_path":"src/platform/win32/win32_input.rs","rank":9,"score":174956.66715285493},{"content":"pub fn create_view_matrix(pitch: f32, yaw: f32, camera_pos: [f32; 3]) -> Mat4x4 {\n\n let pitch_rotate = Mat4x4::x_rot_matrix(pitch);\n\n let yaw_rotate = Mat4x4::y_rot_matrix(yaw);\n\n let mut rotated = Mat4x4::identity() * pitch_rotate * yaw_rotate;\n\n rotated.data[0][3] = -camera_pos[0];\n\n rotated.data[1][3] = -camera_pos[1];\n\n rotated.data[2][3] = -camera_pos[2];\n\n return rotated;\n\n}\n\n\n","file_path":"src/math.rs","rank":10,"score":172278.1465613702},{"content":"fn create_top_bar(ecs: &mut ECS, mouse_layer: Entity) -> Entity {\n\n const TOP_BAR_PERCENT_HEIGHT: f32 = 0.03;\n\n let top_bar = GuiComponent::create_hoverable(\n\n ecs,\n\n None,\n\n None,\n\n GuiConstraints::new(\n\n Constraint::CenterConstraint,\n\n Constraint::RelativeConstraint {size: 1.0 - TOP_BAR_PERCENT_HEIGHT},\n\n RelativeConstraint {size: 1.0},\n\n RelativeConstraint {size: TOP_BAR_PERCENT_HEIGHT},\n\n ),\n\n 0.0,\n\n Color::from_u8(0x22, 0x22, 0x22, 0xFF),\n\n Color::from_u8(0x55, 0x55, 0x55, 0xFF));\n\n\n\n let bounds = ecs.read::<GuiComponent>(&top_bar).unwrap().calculated_bounds;\n\n let font = ecs.read_res::<Rc<Font>>().clone();\n\n let gold_text = GuiText::create(\n\n ecs,\n","file_path":"sandbox/src/gui.rs","rank":11,"score":167318.9050717581},{"content":"fn create_bottom_panel(ecs: &mut ECS, mouse_layer: Entity) -> Entity {\n\n let mut bottom_panel_entity = GuiComponent::create(\n\n ecs,\n\n None,\n\n None,\n\n GuiConstraints::new(\n\n Constraint::CenterConstraint,\n\n Constraint::RelativeConstraint { size: 0.0 },\n\n Constraint::RelativeConstraint {size: 1.},\n\n Constraint::PixelConstraint {size: 160}\n\n ),\n\n 0.,\n\n Color::from_u8(0x22, 0x22, 0x22, 0xFF));\n\n let bottom_panel = ecs.read::<GuiComponent>(&bottom_panel_entity).unwrap();\n\n let mut buttons_box_entity = GuiComponent::create(\n\n ecs,\n\n None,\n\n Some(bottom_panel.calculated_bounds),\n\n GuiConstraints::new(\n\n Constraint::CenterConstraint,\n","file_path":"sandbox/src/gui.rs","rank":12,"score":167318.9050717581},{"content":"fn add_menu_button(button_id: StartMenuButtonId, text: &str, menu_layer: Entity, bounds: Bounds, y: f32, ecs: &mut ECS, menu_screen_entity: Entity) {\n\n let button = GuiComponent::create_hoverable(\n\n ecs,\n\n Some(menu_layer),\n\n Some(bounds),\n\n GuiConstraints::new(\n\n Constraint::CenterConstraint,\n\n RelativeConstraint {size: y},\n\n RelativeConstraint {size: 0.6},\n\n RelativeConstraint {size: 0.12},\n\n ),\n\n 10.,\n\n Color::from_u8(0x33, 0x33, 0x33, 0xAA),\n\n Color::from_u8(0x88, 0x33, 0x33, 0xAA),\n\n );\n\n ecs.add_component(&button, button_id);\n\n\n\n let comp = ecs.read::<GuiComponent>(&button).unwrap();\n\n let font = ecs.read_res::<Rc<Font>>();\n\n let text = GuiText::create(\n","file_path":"sandbox/src/start_menu.rs","rank":13,"score":165355.56336017128},{"content":"fn add_menu_button(button_id: MainMenuButtonId, text: &str, menu_layer: Entity, bounds: Bounds, y: f32, ecs: &mut ECS, menu_screen_entity: Entity) {\n\n let button = GuiComponent::create_hoverable(\n\n ecs,\n\n Some(menu_layer),\n\n Some(bounds),\n\n GuiConstraints::new(\n\n Constraint::CenterConstraint,\n\n RelativeConstraint {size: y},\n\n RelativeConstraint {size: 0.6},\n\n RelativeConstraint {size: 0.12},\n\n ),\n\n 10.,\n\n Color::from_u8(0x33, 0x33, 0x33, 0xAA),\n\n Color::from_u8(0x88, 0x33, 0x33, 0xAA),\n\n );\n\n ecs.add_component(&button, button_id);\n\n\n\n let comp = ecs.read::<GuiComponent>(&button).unwrap();\n\n let font = ecs.read_res::<Rc<Font>>();\n\n let text = GuiText::create(\n","file_path":"sandbox/src/main_menu.rs","rank":14,"score":165355.56336017128},{"content":"fn draw_everything(ecs: &ECS, scene: &Scene) {\n\n let camera = ecs.read_res::<Camera>();\n\n for (tile, _) in ecs.read1::<Tile>() {\n\n tile.draw(&scene, &camera);\n\n }\n\n\n\n ecs.read_res::<Cursor>().draw(&scene, &camera);\n\n\n\n for (monster, _) in ecs.read1::<Monster>() {\n\n monster.draw(&scene, &camera);\n\n }\n\n\n\n for (player, _) in ecs.read1::<Player>() {\n\n player.draw(&scene, &camera);\n\n }\n\n\n\n for (turret, _) in ecs.read1::<Turret>() {\n\n turret.draw(&scene, &camera);\n\n }\n\n\n","file_path":"sandbox/src/main.rs","rank":15,"score":160127.0346150935},{"content":"pub fn create_projection_matrix(aspect: f32, fov: f32, zfar: f32, znear: f32) -> Mat4x4 {\n\n let fov = fov * f32::consts::PI/180.0;\n\n let zm = zfar - znear;\n\n let zp = zfar + znear;\n\n let xscale = (1./(fov / 2.).tan()) / aspect;\n\n let yscale = 1./(fov / 2.).tan();\n\n let zscale = -zp / zm;\n\n let ztranslate = -(2. * zfar * znear)/zm;\n\n\n\n return Mat4x4 {\n\n data: [\n\n [xscale, 0., 0., 0.],\n\n [0., yscale, 0., 0.],\n\n [0., 0., zscale, ztranslate],\n\n [0., 0., -1., 0.],\n\n ]\n\n };\n\n}\n\n\n","file_path":"src/math.rs","rank":16,"score":157698.6439224983},{"content":"fn paeth(a: i32, b: i32, c: i32) -> u8 {\n\n let p = a + b - c;\n\n let pa = (p - a).abs();\n\n let pb = (p - b).abs();\n\n let pc = (p - c).abs();\n\n\n\n if pa <= pb && pa <= pc {\n\n return a as u8;\n\n } else if pb <= pc {\n\n return b as u8;\n\n } else {\n\n return c as u8;\n\n }\n\n}\n\n\n\nimpl PNG {\n\n pub fn image(&self) -> Image {\n\n let w = self.header_chunk.width as usize;\n\n let h = self.header_chunk.height as usize;\n\n\n","file_path":"src/images/png.rs","rank":17,"score":156364.89109294701},{"content":"fn next_day(ecs: &mut ECS) {\n\n change_stage_text(ecs, \"Day\");\n\n\n\n let game_day = ecs.write_res::<Vec<GameDay>>().remove(0);\n\n ecs.add_res(game_day);\n\n ecs.write_res::<StateTimer>().countdown_s = ecs.read_res::<GameDay>().day_length;\n\n\n\n\n\n let tilemap = ecs.read_res::<Tilemap>();\n\n let borders: Vec<(f32, f32)> = tilemap.borders().iter().map(|border| {\n\n tilemap.pos_of_tile(*border)\n\n }).collect();\n\n\n\n let waves = &ecs.read_res::<GameDay>().waves.clone();\n\n for wave in waves {\n\n let border_index = thread_rng().gen_range(0, borders.len());\n\n let border = borders.get(border_index).unwrap();\n\n WaveSpawner::create(ecs, wave.wave.clone(), border.0, border.1, 1.);\n\n }\n\n\n\n let tilemap = ecs.read_res::<Tilemap>();\n\n Tree::create(ecs, tilemap.tile_at_pos(2, 4));\n\n let tilemap = ecs.read_res::<Tilemap>();\n\n Tree::create(ecs, tilemap.tile_at_pos(8, 2));\n\n}\n\n\n","file_path":"sandbox/src/main.rs","rank":18,"score":146637.94369736},{"content":"fn next_night(ecs: &mut ECS) {\n\n change_stage_text(ecs, \"Night\");\n\n\n\n ecs.write_res::<StateTimer>().countdown_s = ecs.read_res::<GameDay>().night_length;\n\n}\n\n\n\npub const DAY_GAME_STATE: GameStateId = 10;\n\n\n\npub struct DayGameState {\n\n}\n\n\n\nimpl GameState for DayGameState {\n\n fn on_state_start(&self, ecs: &mut ECS) {\n\n register_core_systems(ecs);\n\n ecs.add_system(Box::new(mouse_click_system));\n\n ecs.add_system(Box::new(mouse_cursor_system));\n\n ecs.add_system(Box::new(day_state_countdown));\n\n\n\n if ecs.read_res::<StateTimer>().countdown_s <= 0. {\n\n next_day(ecs);\n","file_path":"sandbox/src/main.rs","rank":19,"score":146637.94369736},{"content":"fn register_core_systems(ecs: &mut ECS) {\n\n ecs.add_system(Box::new(player_move_system));\n\n ecs.add_system(Box::new(mouse_capture_system));\n\n ecs.add_system(Box::new(game_gui_system));\n\n}\n\n\n","file_path":"sandbox/src/main.rs","rank":20,"score":144126.83922696934},{"content":"pub fn player_move_system(ecs: &ECS) -> Mutations {\n\n let input = ecs.read_res::<GameInput>();\n\n let mut mutations: Mutations = Vec::new();\n\n for (p, ent) in ecs.read1::<Player>() {\n\n let tile = ecs.read::<Tile>(&p.current_tile);\n\n if input.keyboard.letter_pressed(LetterKeys::A) {\n\n mutations.push(Box::new(MoveMutation {entity: ent, dx: -1, dy: 0}))\n\n } else if input.keyboard.letter_pressed(LetterKeys::D) {\n\n mutations.push(Box::new(MoveMutation {entity: ent, dx: 1, dy: 0}))\n\n }\n\n if input.keyboard.letter_pressed(LetterKeys::W) {\n\n mutations.push(Box::new(MoveMutation {entity: ent, dx: 0, dy: 1}))\n\n } else if input.keyboard.letter_pressed(LetterKeys::S) {\n\n mutations.push(Box::new(MoveMutation {entity: ent, dx: 0, dy: -1}))\n\n }\n\n }\n\n return mutations;\n\n}\n","file_path":"sandbox/src/player.rs","rank":21,"score":138116.1915894177},{"content":"pub fn game_gui_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = vec![];\n\n mutations.push(Box::new(UpdateResourceTextMutation {}));\n\n for (capture, gui, entity) in ecs.read2::<MouseCaptureArea, GuiComponent>() {\n\n mutations.push(Box::new(GuiHoveredMutation{entity, hovered: capture.is_hovered}));\n\n\n\n if capture.clicked_buttons[0] {\n\n println!(\"Clicked a button\");\n\n }\n\n }\n\n return mutations;\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct StageText {}\n\n\n\n#[derive(Debug)]\n\npub struct GoldText {}\n\n\n\n#[derive(Debug)]\n","file_path":"sandbox/src/gui.rs","rank":22,"score":138116.1915894177},{"content":"pub fn arrow_move_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = vec![];\n\n let dt = ecs.read_res::<GameInput>().seconds_to_advance_over_update;\n\n for (arrow, entity) in ecs.read1::<Arrow>() {\n\n let target = ecs.read::<Monster>(&arrow.target);\n\n if let Some(monster) = target {\n\n let v = (monster.x - arrow.x, monster.y - arrow.y);\n\n let dist = (v.0 * v.0 + v.1 * v.1).sqrt();\n\n if dist < 0.5 {\n\n mutations.push(Box::new(ArrowCollisionMutation {\n\n arrow: entity,\n\n }));\n\n } else {\n\n mutations.push(Box::new(MoveArrowTowardsMutation {\n\n arrow: entity,\n\n dx: v.0 * dt / dist * arrow.speed,\n\n dy: v.1 * dt / dist * arrow.speed,\n\n }))\n\n }\n\n } else {\n","file_path":"sandbox/src/building.rs","rank":23,"score":138116.1915894177},{"content":"pub fn wave_spawner_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = Vec::new();\n\n let input = ecs.read_res::<GameInput>();\n\n\n\n for (spawner, entity) in ecs.read1::<WaveSpawner>() {\n\n mutations.push(Box::new(ProcessSpawnerMutation {entity, dt: input.seconds_to_advance_over_update, x: spawner.x, y: spawner.y}));\n\n }\n\n\n\n return mutations;\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct WaveSpawner {\n\n wave_spec: WaveSpec,\n\n num_monsters: usize,\n\n current_monster_index: usize,\n\n spawn_max_cd: f32,\n\n spawn_current_cd: f32,\n\n x: f32,\n\n y: f32,\n","file_path":"sandbox/src/spawners.rs","rank":24,"score":138116.1915894177},{"content":"pub fn mouse_capture_system(ecs: &ECS) -> Mutations {\n\n let mut layers = ecs.read2::<MouseCaptureLayer, ActiveCaptureLayer>();\n\n layers.sort_by(|a, b| b.0.sort_index.cmp(&a.0.sort_index));\n\n\n\n let input = ecs.read_res::<GameInput>();\n\n let mouse_x = input.mouse.x;\n\n let mouse_y = 900 - input.mouse.y;\n\n let down_buttons = [\n\n input.mouse.buttons[0].ended_down,\n\n input.mouse.buttons[1].ended_down,\n\n input.mouse.buttons[2].ended_down,\n\n input.mouse.buttons[3].ended_down,\n\n input.mouse.buttons[4].ended_down,\n\n ];\n\n let clicked_buttons = [\n\n input.mouse.buttons[0].ended_down && input.mouse.buttons[0].half_transition_count > 0,\n\n input.mouse.buttons[1].ended_down && input.mouse.buttons[1].half_transition_count > 0,\n\n input.mouse.buttons[2].ended_down && input.mouse.buttons[2].half_transition_count > 0,\n\n input.mouse.buttons[3].ended_down && input.mouse.buttons[3].half_transition_count > 0,\n\n input.mouse.buttons[4].ended_down && input.mouse.buttons[4].half_transition_count > 0,\n","file_path":"src/mouse_capture.rs","rank":25,"score":138116.1915894177},{"content":"pub fn monster_damage_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = vec![];\n\n for (monster, damage, entity) in ecs.read2::<Monster, DamageDealt>() {\n\n mutations.push(Box::new(MonsterDamageMutation {monster: entity, damage: damage.damage}));\n\n }\n\n return mutations;\n\n}","file_path":"sandbox/src/monster.rs","rank":26,"score":138116.1915894177},{"content":"pub fn turret_attack_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = vec![];\n\n let dt = ecs.read_res::<GameInput>().seconds_to_advance_over_update;\n\n\n\n let mut monster_positions: Vec<(Entity, f32, f32)> = vec![];\n\n for (monster, entity) in ecs.read1::<Monster>() {\n\n monster_positions.push((entity, monster.x, monster.y));\n\n }\n\n\n\n let input = ecs.read_res::<GameInput>();\n\n for (turret, e) in ecs.read1::<Turret>() {\n\n let mut closest: Option<(Entity, f32)> = None;\n\n for (monster, x, y) in &monster_positions {\n\n let (x, y) = (turret.x - x, turret.y - y);\n\n let dist = (x * x + y * y).sqrt();\n\n\n\n if let Some((_, closest_dist)) = closest {\n\n if dist < closest_dist {\n\n closest = Some((monster.clone(), dist));\n\n }\n","file_path":"sandbox/src/building.rs","rank":27,"score":138116.1915894177},{"content":"pub fn monster_move_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = Vec::new();\n\n for monster in ecs.get1::<Monster>() {\n\n mutations.push(Box::new(MonsterMoveMutation {monster}));\n\n }\n\n return mutations;\n\n}\n\n\n","file_path":"sandbox/src/monster.rs","rank":28,"score":138116.1915894177},{"content":"pub fn spawner_blink_system(ecs: &ECS) -> Mutations {\n\n let mut mutations = vec![];\n\n return mutations;\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct WaveSpec {\n\n pub monsters: Vec<MonsterSpec>,\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub struct MonsterSpec {\n\n pub monster_type: MonsterType,\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub enum MonsterType {\n\n Wolf,\n\n}\n\n\n","file_path":"sandbox/src/spawners.rs","rank":29,"score":138116.1915894177},{"content":"pub fn menu_mouse_system(ecs: &ECS) -> Mutations {\n\n let menu = ecs.read_res::<MenuScreen>();\n\n let mut mutations: Mutations = vec![];\n\n for (capture_area, button, entity) in ecs.read2::<MouseCaptureArea, MainMenuButtonId>() {\n\n if capture_area.clicked_buttons[0] {\n\n mutations.push(Box::new(MenuClickMutation {\n\n buttonid: *button,\n\n }));\n\n }\n\n }\n\n return mutations;\n\n}\n\n\n","file_path":"sandbox/src/main_menu.rs","rank":30,"score":135842.440884383},{"content":"pub fn start_menu_mouse_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = vec![];\n\n for (capture_area, button, entity) in ecs.read2::<MouseCaptureArea, StartMenuButtonId>() {\n\n if capture_area.clicked_buttons[0] {\n\n mutations.push(Box::new(MenuClickMutation {\n\n buttonid: *button,\n\n }));\n\n }\n\n }\n\n return mutations;\n\n}\n\n\n\n\n","file_path":"sandbox/src/start_menu.rs","rank":31,"score":133672.41213409457},{"content":"pub fn u32_from_bytes(bytes: [u8; 4]) -> u32 {\n\n ((bytes[0] as u32) << 24)\n\n + ((bytes[1] as u32) << 16)\n\n + ((bytes[2] as u32) << 8)\n\n + ((bytes[3] as u32) << 0)\n\n}\n\n\n","file_path":"src/utils.rs","rank":32,"score":120190.87168979071},{"content":"fn win32_process_xinput_stick_values(value: f32, dead_zone_threshold: f32) -> f32 {\n\n if value < -dead_zone_threshold {\n\n return (value + dead_zone_threshold) / (32768f32 - dead_zone_threshold);\n\n } else if value > dead_zone_threshold {\n\n return (value - dead_zone_threshold) / (32767f32 - dead_zone_threshold);\n\n } else {\n\n return 0f32;\n\n }\n\n}\n","file_path":"src/platform/win32/win32_input.rs","rank":33,"score":115425.66916529271},{"content":"fn parse_chunk(c: &Vec<u8>, i: usize) -> Chunk {\n\n let length = u32_from_bytes([c[i], c[i + 1], c[i + 2], c[i + 3]]);\n\n let mut chunk_type = String::from(\"\");\n\n chunk_type.push(c[i + 4].into());\n\n chunk_type.push(c[i + 5].into());\n\n chunk_type.push(c[i + 6].into());\n\n chunk_type.push(c[i + 7].into());\n\n\n\n let mut bytes = vec![];\n\n for j in 0..length {\n\n let byte = c[i + 8 + j as usize];\n\n bytes.push(byte);\n\n }\n\n\n\n return Chunk {\n\n length,\n\n chunk_type,\n\n chunk_data: bytes,\n\n crc: 0,\n\n }\n\n}","file_path":"src/images/png.rs","rank":34,"score":110122.09033924865},{"content":"pub fn osx_process_key(\n\n keyboard: &mut KeyboardInput,\n\n u16_char: u16,\n\n key_down: bool,\n\n _alt_down: bool,\n\n _ctrl_down: bool,\n\n cmd_down: bool,\n\n) {\n\n match u16_char {\n\n 0xF700 => {\n\n osx_process_keyboard_message(&mut keyboard.special_keys[SpecialKeys::UpArrow], key_down)\n\n }\n\n 0xF701 => osx_process_keyboard_message(\n\n &mut keyboard.special_keys[SpecialKeys::DownArrow],\n\n key_down,\n\n ),\n\n 0xF702 => osx_process_keyboard_message(\n\n &mut keyboard.special_keys[SpecialKeys::LeftArrow],\n\n key_down,\n\n ),\n","file_path":"src/platform/osx/osx_input.rs","rank":35,"score":108179.3197929227},{"content":"type XInputGetStateFunc = unsafe extern \"system\" fn(DWORD, *mut XINPUT_STATE) -> DWORD;\n","file_path":"src/platform/win32/window.rs","rank":36,"score":106729.24889623598},{"content":"type XInputSetStateFunc = unsafe extern \"system\" fn(DWORD, *mut XINPUT_VIBRATION) -> DWORD;\n\nstatic mut OPT_XINPUT_GET_STATE_FUNC: Option<XInputGetStateFunc> = None;\n\nstatic mut OPT_XINPUT_SET_STATE_FUNC: Option<XInputSetStateFunc> = None;\n\n\n","file_path":"src/platform/win32/window.rs","rank":37,"score":106729.24889623598},{"content":"pub fn generate_days() -> Vec<GameDay> {\n\n return vec![\n\n GameDay {day_length: 5., night_length: 20., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 15]}}]},\n\n GameDay {day_length: 5., night_length: 30., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 20]}}]},\n\n GameDay {day_length: 5., night_length: 40., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 25]}}]},\n\n GameDay {day_length: 5., night_length: 50., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 30]}}]},\n\n GameDay {day_length: 5., night_length: 60., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 35]}}]},\n\n GameDay {day_length: 5., night_length: 70., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 40]}}]},\n\n ]\n\n}\n","file_path":"sandbox/src/spawners.rs","rank":38,"score":102282.5814553553},{"content":"pub fn u16_from_bytes(bytes: [u8; 2]) -> u16 {\n\n ((bytes[0] as u16) << 8) + ((bytes[1] as u16) << 0)\n\n}\n\n\n","file_path":"src/utils.rs","rank":39,"score":99504.79260700247},{"content":"pub fn i16_from_bytes(bytes: [u8; 2]) -> i16 {\n\n ((bytes[0] as i16) << 8) + ((bytes[1] as i16) << 0)\n\n}\n\n\n","file_path":"src/utils.rs","rank":40,"score":99504.79260700247},{"content":"struct MissingComponentError;\n\n\n\nimpl From<&str> for MissingComponentError {\n\n fn from(_: &str) -> MissingComponentError {\n\n return MissingComponentError;\n\n }\n\n}\n\n\n\nimpl ECS {\n\n pub fn add_system(&mut self, system: Box<System>) {\n\n self.systems.push(system);\n\n }\n\n\n\n pub fn clear_systems(&mut self) {\n\n self.systems.clear();\n\n }\n\n\n\n pub fn register_component_type<T: 'static + Debug>(&mut self) {\n\n let e: EntityMap<T> = EntityMap::new();\n\n self.components.insert(e);\n","file_path":"src/ecs.rs","rank":41,"score":98813.50985845883},{"content":"pub trait Mutation {\n\n fn apply(&self, ecs: &mut ECS);\n\n}\n\n\n\npub type Mutations = Vec<Box<dyn Mutation>>;\n\npub type System = dyn Fn(&ECS) -> Mutations;\n\npub type GameStateId = u32;\n\n\n\n\n\npub struct ECS {\n\n entity_allocator: GenIndexAllocator,\n\n components: AnyMap,\n\n resources: AnyMap,\n\n systems: Vec<Box<System>>,\n\n queued_events: AnyMap,\n\n processing_events: AnyMap,\n\n}\n\n\n\n#[macro_use]\n\nmacro_rules! impl_read {\n","file_path":"src/ecs.rs","rank":42,"score":97194.20469626153},{"content":"#[derive(Debug)]\n\nstruct ArrayEntry<T> {\n\n value: T,\n\n generation: u64,\n\n}\n\n\n\npub struct GenIndexArray<T>(Vec<Option<ArrayEntry<T>>>);\n\n\n\nimpl<T> GenIndexArray<T> {\n\n pub fn new() -> GenIndexArray<T> {\n\n GenIndexArray(Vec::new())\n\n }\n\n\n\n pub fn set(&mut self, index: GenIndex, value: T) {\n\n while index.index >= self.0.len() {\n\n self.0.push(None);\n\n }\n\n let entry = self.0.get_mut(index.index).unwrap();\n\n *entry = Some(ArrayEntry {value, generation: index.generation})\n\n }\n\n\n","file_path":"src/ecs.rs","rank":43,"score":96727.8481813819},{"content":"#[derive(Eq, PartialEq, Clone)]\n\nstruct GenIndexAllocationEntry {\n\n is_free: bool,\n\n generation: u64,\n\n}\n\n\n\n#[derive(Eq, PartialEq, Clone)]\n\npub struct GenIndexAllocator {\n\n entries: Vec<GenIndexAllocationEntry>,\n\n free: Vec<usize>,\n\n}\n\n\n\nimpl GenIndexAllocator {\n\n pub fn new() -> GenIndexAllocator {\n\n GenIndexAllocator {\n\n entries: Vec::new(),\n\n free: Vec::new(),\n\n }\n\n }\n\n\n\n pub fn allocate(&mut self) -> GenIndex {\n","file_path":"src/ecs.rs","rank":44,"score":96697.53296420666},{"content":"pub trait GameWindowImpl {\n\n fn capture_events(&mut self) -> Vec<WindowEvent>;\n\n fn capture_input(&mut self) -> GameInput;\n\n fn get_width(&self) -> usize;\n\n fn get_height(&self) -> usize;\n\n}\n\n\n\npub struct WindowProps {\n\n pub width: f64,\n\n pub height: f64,\n\n pub title: String,\n\n pub target_ms_per_frame: f32,\n\n}\n\n\n\npub enum WindowEvent {\n\n ResizeEvent {width: f32, height: f32},\n\n CloseEvent,\n\n}","file_path":"src/window.rs","rank":45,"score":93648.94248241308},{"content":"fn mouse_cursor_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = vec![];\n\n let mut any_hovered = false;\n\n for (tile, mouse_capture, e) in ecs.read2::<Tile, MouseCaptureArea>() {\n\n if mouse_capture.is_hovered {\n\n mutations.push(Box::new(CursorSetPositionMutation {tile: e}));\n\n any_hovered = true;\n\n }\n\n }\n\n mutations.push(Box::new(CursorVisibilityMutation {visible: any_hovered}));\n\n return mutations;\n\n}\n\n\n","file_path":"sandbox/src/main.rs","rank":46,"score":90088.44878930994},{"content":"fn mouse_click_system(ecs: &ECS) -> Mutations {\n\n let mut mutations: Mutations = Vec::new();\n\n for (tile, mouse_capture, tile_e) in ecs.read2::<Tile, MouseCaptureArea>() {\n\n if mouse_capture.clicked_buttons[0] {\n\n mutations.push(Box::new(TurretDeselectMutation{}));\n\n if !tile.occupied {\n\n println!(\"Unoccupied\");\n\n mutations.push(Box::new(CreateTurretMutation{tile_e}));\n\n } else {\n\n println!(\"Occupied\");\n\n for (turret, e) in ecs.read1::<Turret>() {\n\n if turret.x == tile.x as f32 && turret.y == tile.y as f32 && !turret.selected {\n\n println!(\"Mutating\");\n\n mutations.push(Box::new(TurretSelectMutation{turret_e: e}));\n\n }\n\n }\n\n\n\n for (tree, e) in ecs.read1::<Tree>() {\n\n if tree.x == tile.x as f32 && tree.y == tile.y as f32 {\n\n mutations.push(Box::new(TreeHarvestMutation {tree: e}))\n\n }\n\n }\n\n }\n\n }\n\n }\n\n return mutations;\n\n}\n\n\n","file_path":"sandbox/src/main.rs","rank":47,"score":90088.44878930994},{"content":"fn day_state_countdown(ecs: &ECS) -> Mutations {\n\n let input = ecs.read_res::<GameInput>();\n\n return vec![Box::new(StateCountdownMutation {dt: input.seconds_to_advance_over_update})];\n\n}\n\n\n","file_path":"sandbox/src/main.rs","rank":48,"score":90088.44878930994},{"content":"fn update_buffer<T>(buffer: &Buffer, mut data: Vec<T>) {\n\n unsafe {\n\n std::ptr::copy(data.as_mut_ptr(), mem::transmute(buffer.contents()), data.len());\n\n };\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct IndexBuffer {\n\n pub data: Buffer,\n\n}\n\n\n\nimpl IndexBuffer {\n\n pub fn new(renderer: &Renderer, indices: Vec<i16>) -> IndexBuffer {\n\n return IndexBuffer {\n\n data: create_buffer(renderer, indices),\n\n };\n\n }\n\n\n\n pub fn bind(&self, scene: &Scene) {\n\n\n","file_path":"src/platform/metal/buffers.rs","rank":49,"score":88918.50287650057},{"content":"fn create_buffer<T>(renderer: &Renderer, data: Vec<T>) -> Buffer {\n\n let buffer = renderer.device.new_buffer_with_data(\n\n unsafe { mem::transmute(data.as_ptr()) },\n\n (data.len() * mem::size_of::<T>()) as u64,\n\n MTLResourceOptions::CPUCacheModeDefaultCache,\n\n );\n\n return buffer;\n\n}\n\n\n","file_path":"src/platform/metal/buffers.rs","rank":50,"score":81195.97706171847},{"content":"fn prepare_render_pass_descriptor(descriptor: &RenderPassDescriptorRef, texture: &TextureRef) {\n\n let color_attachment = descriptor.color_attachments().object_at(0).unwrap();\n\n\n\n color_attachment.set_texture(Some(texture));\n\n color_attachment.set_load_action(MTLLoadAction::Clear);\n\n color_attachment.set_clear_color(MTLClearColor::new(0.2, 0.2, 0.2, 1.0));\n\n color_attachment.set_store_action(MTLStoreAction::Store);\n\n}\n\n\n\npub struct Renderer {\n\n device: Device,\n\n layer: CoreAnimationLayer,\n\n command_queue: CommandQueue,\n\n width: usize,\n\n height: usize,\n\n drawables: Vec<Box<Drawable>>,\n\n}\n\n\n\nimpl Renderer {\n\n pub fn new(window: &mut OsxWindow) -> Self {\n","file_path":"src/platform/metal/mod.rs","rank":51,"score":80081.13271193411},{"content":"use crate::rendering::shader::Shader;\n\nuse crate::rendering::buffers::{VertexBuffer, IndexBuffer, VertexConstantBuffer, FragmentConstantBuffer};\n\nuse crate::rendering::{Scene, Renderer};\n\nuse crate::input::{GameInput, LetterKeys};\n\nuse crate::math::{create_transformation_matrix, create_projection_matrix, create_view_matrix, Mat4x4};\n\nuse crate::rendering::texture::RenderableTexture;\n\nuse crate::ecs::Entity;\n\nuse crate::{RenderLayer, RenderOrder};\n\n\n\n#[derive(Debug)]\n\npub struct TextureDrawable {\n\n pub vertex_buffer: VertexBuffer<[f32; 6]>,\n\n pub index_buffer: IndexBuffer,\n\n pub transform_buffer: VertexConstantBuffer<f32>,\n\n pub shader: Shader,\n\n pub identity_buffer: VertexConstantBuffer<f32>,\n\n pub texture: RenderableTexture,\n\n pub position: [f32; 3],\n\n pub scale: [f32; 3],\n\n pub rotation: [f32; 3],\n","file_path":"src/rendering/drawable.rs","rank":52,"score":76129.55903535528},{"content":"\n\n scene.draw_indexed(6, &self.index_buffer);\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct QuadDrawable {\n\n pub vertex_buffer: VertexBuffer<[f32; 4]>,\n\n pub index_buffer: IndexBuffer,\n\n pub transform_buffer: VertexConstantBuffer<f32>,\n\n pub shader: Shader,\n\n pub color_buffer: FragmentConstantBuffer<f32>,\n\n pub identity_buffer: VertexConstantBuffer<f32>,\n\n pub position: [f32; 3],\n\n pub scale: [f32; 3],\n\n pub rotation: [f32; 3],\n\n}\n\n\n\nimpl QuadDrawable {\n\n pub fn new(is_gui: bool, renderer: &Renderer, color: [f32; 3], position: [f32; 3], scale: [f32; 3], rotation: [f32; 3]) -> Self {\n","file_path":"src/rendering/drawable.rs","rank":53,"score":76127.50177101564},{"content":" self.update_transform(renderer);\n\n }\n\n\n\n pub fn set_rotation(&mut self, renderer: &Renderer, rotation: [f32; 3]) {\n\n self.rotation = rotation;\n\n self.update_transform(renderer);\n\n }\n\n\n\n fn update_transform(&self, renderer: &Renderer) {\n\n let transform_mat = create_transformation_matrix(self.position, self.rotation, self.scale);\n\n self.transform_buffer.update_data(renderer, transform_mat.to_vec());\n\n }\n\n\n\n pub fn draw_with_projection(&self, scene: &Scene, camera_projection: &VertexConstantBuffer<f32>) {\n\n camera_projection.bind_to_offset(scene, 1);\n\n self.draw_impl(scene);\n\n }\n\n\n\n pub fn draw(&self, scene: &Scene) {\n\n self.identity_buffer.bind(scene);\n","file_path":"src/rendering/drawable.rs","rank":54,"score":76125.58058595573},{"content":"}\n\n\n\nimpl TextureDrawable {\n\n pub fn new(is_gui: bool, renderer: &Renderer, texture: RenderableTexture, position: [f32; 3], scale: [f32; 3], rotation: [f32; 3]) -> Self {\n\n let vb = VertexBuffer::new(\n\n renderer,\n\n 0,\n\n vec![\n\n [-1., -1., 0., 1., 0., 1.], // bottom left\n\n [1., -1., 0., 1., 1., 1.], // bottom right\n\n [1., 1., 0., 1., 1., 0.], // top right\n\n [-1., 1., 0., 1., 0., 0.], // top left\n\n ]);\n\n\n\n let ib = IndexBuffer::new(\n\n renderer,\n\n vec![\n\n 0, 3, 2,\n\n 0, 1, 2,\n\n ]);\n","file_path":"src/rendering/drawable.rs","rank":55,"score":76125.12513241221},{"content":" rotation,\n\n }\n\n }\n\n\n\n pub fn set_position(&mut self, renderer: &Renderer, position: [f32; 3]) {\n\n self.position = position;\n\n self.update_transform(renderer);\n\n }\n\n\n\n pub fn set_scale(&mut self, renderer: &Renderer, scale: [f32; 3]) {\n\n self.scale = scale;\n\n self.update_transform(renderer);\n\n }\n\n\n\n pub fn set_rotation(&mut self, renderer: &Renderer, rotation: [f32; 3]) {\n\n self.rotation = rotation;\n\n self.update_transform(renderer);\n\n }\n\n\n\n fn update_transform(&self, renderer: &Renderer) {\n","file_path":"src/rendering/drawable.rs","rank":56,"score":76121.64258647189},{"content":" let transform_mat = create_transformation_matrix(self.position, self.rotation, self.scale);\n\n self.transform_buffer.update_data(renderer, transform_mat.to_vec());\n\n }\n\n\n\n pub fn draw_with_projection(&self, scene: &Scene, camera_projection: &VertexConstantBuffer<f32>) {\n\n camera_projection.bind_to_offset(scene, 1);\n\n self.draw_impl(scene);\n\n }\n\n\n\n pub fn draw(&self, scene: &Scene) {\n\n self.identity_buffer.bind(scene);\n\n self.draw_impl(scene);\n\n }\n\n\n\n fn draw_impl(&self, scene: &Scene) {\n\n self.shader.bind(scene);\n\n self.vertex_buffer.bind(scene);\n\n self.transform_buffer.bind(scene);\n\n self.texture.bind(scene);\n\n self.index_buffer.bind(scene);\n","file_path":"src/rendering/drawable.rs","rank":57,"score":76121.47548278286},{"content":" shader,\n\n identity_buffer,\n\n position,\n\n scale,\n\n rotation\n\n }\n\n }\n\n\n\n pub fn translate(&self, renderer: &Renderer, position: [f32; 3], scale: [f32; 3]) {\n\n let transform_mat = create_transformation_matrix(position, [0., 0., 0.], scale);\n\n self.transform_buffer.update_data(renderer, transform_mat.to_vec());\n\n }\n\n\n\n pub fn set_position(&mut self, renderer: &Renderer, position: [f32; 3]) {\n\n self.position = position;\n\n self.update_transform(renderer);\n\n }\n\n\n\n pub fn set_scale(&mut self, renderer: &Renderer, scale: [f32; 3]) {\n\n self.scale = scale;\n","file_path":"src/rendering/drawable.rs","rank":58,"score":76120.93923760831},{"content":" self.draw_impl(scene);\n\n }\n\n\n\n fn draw_impl(&self, scene: &Scene) {\n\n self.shader.bind(scene);\n\n self.vertex_buffer.bind(scene);\n\n self.transform_buffer.bind(scene);\n\n self.index_buffer.bind(scene);\n\n self.color_buffer.bind(&scene);\n\n\n\n scene.draw_indexed(6, &self.index_buffer);\n\n }\n\n}\n","file_path":"src/rendering/drawable.rs","rank":59,"score":76114.35947302663},{"content":" let vb = VertexBuffer::new(\n\n renderer,\n\n 0,\n\n vec![\n\n [-1., -1., 0., 1.], // bottom left\n\n [1., -1., 0., 1.], // bottom right\n\n [1., 1., 0., 1.], // top right\n\n [-1., 1., 0., 1.], // top left\n\n ]);\n\n\n\n let ib = IndexBuffer::new(\n\n renderer,\n\n vec![\n\n 0, 3, 2,\n\n 0, 1, 2,\n\n ]);\n\n\n\n let shader = Shader::new(\n\n renderer,\n\n false,\n","file_path":"src/rendering/drawable.rs","rank":60,"score":76109.65894615203},{"content":"\n\n let shader = Shader::new(\n\n renderer,\n\n true,\n\n \"shaders/textureVertexShader.txt\",\n\n \"shaders/textureFragmentShader.txt\");\n\n\n\n let transform_mat = create_transformation_matrix(position, rotation, scale);\n\n let transform_buffer = VertexConstantBuffer::new(renderer, 0, transform_mat.raw_data().to_vec());\n\n let identity_buffer = VertexConstantBuffer::new(renderer, 1, Mat4x4::identity().to_vec());\n\n\n\n return Self {\n\n vertex_buffer: vb,\n\n index_buffer: ib,\n\n transform_buffer,\n\n shader,\n\n identity_buffer,\n\n texture,\n\n position,\n\n scale,\n","file_path":"src/rendering/drawable.rs","rank":61,"score":76109.10742727946},{"content":" \"shaders/quadVertexShader.txt\",\n\n \"shaders/quadFragmentShader.txt\");\n\n\n\n let transform_mat = create_transformation_matrix(position, rotation, scale);\n\n let transform_buffer = VertexConstantBuffer::new(renderer,0, transform_mat.raw_data().to_vec());\n\n\n\n let alpha = if is_gui {\n\n 0.5\n\n } else {\n\n 1.0\n\n };\n\n let data = [color[0], color[1], color[2], alpha];\n\n let color_buffer = FragmentConstantBuffer::new(renderer, 0, data.to_vec());\n\n\n\n let identity_buffer = VertexConstantBuffer::new(renderer, 1, Mat4x4::identity().to_vec());\n\n return Self {\n\n vertex_buffer: vb,\n\n index_buffer: ib,\n\n transform_buffer,\n\n color_buffer,\n","file_path":"src/rendering/drawable.rs","rank":62,"score":76109.01415652134},{"content":"struct Game {\n\n}\n\n\n\nimpl Game {\n\n pub fn new() -> Self { Game {} }\n\n}\n\n\n\nimpl GameLogic for Game {\n\n fn window_props(&self) -> WindowProps {\n\n WindowProps {\n\n width: 900.0,\n\n height: 900.0,\n\n title: \"Hearth of Hestia\".to_string(),\n\n target_ms_per_frame: 30.0,\n\n }\n\n }\n\n\n\n fn register_components(&self, ecs: &mut ECS) {\n\n ecs.register_component_type::<Tile>();\n\n ecs.register_component_type::<Hearth>();\n","file_path":"sandbox/src/main.rs","rank":63,"score":64874.04954698867},{"content":"#[derive(Debug)]\n\nstruct Pos {\n\n pub x: f32,\n\n pub y: f32,\n\n}\n\n\n\npub struct CreateTurretMutation {\n\n tile_e: Entity,\n\n}\n\n\n\nimpl Mutation for CreateTurretMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n if ecs.write_res::<Supplies>().spend_supplies(0, 5, 0) {\n\n Turret::create(ecs, self.tile_e);\n\n\n\n ecs.write::<Tile>(&self.tile_e).unwrap().occupied = true;\n\n } else {\n\n\n\n }\n\n }\n\n}\n","file_path":"sandbox/src/main.rs","rank":64,"score":64874.04954698867},{"content":"fn create_window(class_name: &str, title: &str, width: u32, height: u32) -> Option<HWND> {\n\n let class_name = win32_string(class_name);\n\n let title = win32_string(title);\n\n\n\n let handle_instance = unsafe { GetModuleHandleW(null_mut()) };\n\n\n\n let window_class = WNDCLASSW {\n\n style: CS_OWNDC | CS_HREDRAW | CS_VREDRAW,\n\n lpfnWndProc: Some(win32_handle_proc),\n\n cbClsExtra: 0,\n\n cbWndExtra: 0,\n\n hInstance: handle_instance,\n\n lpszClassName: class_name.as_ptr(),\n\n hIcon: null_mut(),\n\n hCursor: null_mut(),\n\n hbrBackground: null_mut(),\n\n lpszMenuName: null_mut(),\n\n };\n\n unsafe {\n\n match RegisterClassW(&window_class) {\n","file_path":"src/platform/win32/window.rs","rank":65,"score":64346.41586174465},{"content":"struct MoveMutation {\n\n entity: Entity,\n\n dx: i32,\n\n dy: i32,\n\n}\n\n\n\nimpl Mutation for MoveMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\n\n let player = ecs.read::<Player>(&self.entity).unwrap();\n\n let tilemap = ecs.read_res::<Tilemap>();\n\n let tile = tilemap.tile_at_pos((player.x + self.dx + 5) as usize, (player.y + self.dy + 3) as usize);\n\n\n\n let player = ecs.write::<Player>(&self.entity).unwrap();\n\n player.move_pos(tile, &renderer, self.dx, self.dy);\n\n }\n\n}\n\n\n","file_path":"sandbox/src/player.rs","rank":66,"score":63738.968434994604},{"content":"type EntityMap<T> = GenIndexArray<T>;\n\n\n","file_path":"src/ecs.rs","rank":67,"score":63113.22642760371},{"content":"struct ArrowCollisionMutation {\n\n arrow: Entity,\n\n}\n\n\n\nimpl Mutation for ArrowCollisionMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n let arrow = ecs.read::<Arrow>(&self.arrow).unwrap();\n\n let target = arrow.target.clone();\n\n let damage = arrow.damage;\n\n ecs.delete_entity(&self.arrow);\n\n\n\n ecs.add_component(&target, DamageDealt {damage});\n\n }\n\n}\n\n\n","file_path":"sandbox/src/building.rs","rank":68,"score":62671.768276851566},{"content":"struct CursorVisibilityMutation {\n\n visible: bool,\n\n}\n\n\n\nimpl Mutation for CursorVisibilityMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n ecs.write_res::<Cursor>().set_visible(self.visible);\n\n }\n\n}\n\n\n","file_path":"sandbox/src/main.rs","rank":69,"score":62671.768276851566},{"content":"struct ArrowDestroyMutation {\n\n arrow: Entity,\n\n}\n\n\n\nimpl Mutation for ArrowDestroyMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n ecs.delete_entity(&self.arrow);\n\n }\n\n}\n\n\n","file_path":"sandbox/src/building.rs","rank":70,"score":62671.768276851566},{"content":"struct MonsterDamageMutation {\n\n monster: Entity,\n\n damage: u32,\n\n}\n\n\n\nimpl Mutation for MonsterDamageMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n ecs.remove_component::<DamageDealt>(&self.monster);\n\n let monster = ecs.write::<Monster>(&self.monster).unwrap();\n\n monster.take_damage(self.damage);\n\n if monster.is_dead() {\n\n ecs.delete_entity(&self.monster);\n\n }\n\n }\n\n}\n\n\n","file_path":"sandbox/src/monster.rs","rank":71,"score":62671.768276851566},{"content":"struct MoveArrowTowardsMutation {\n\n arrow: Entity,\n\n dx: f32,\n\n dy: f32,\n\n}\n\n\n\nimpl Mutation for MoveArrowTowardsMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\n\n let arrow = ecs.write::<Arrow>(&self.arrow).unwrap();\n\n arrow.change_pos(&renderer, self.dx, self.dy);\n\n }\n\n}\n\n\n","file_path":"sandbox/src/building.rs","rank":72,"score":61666.536661780236},{"content":"struct CursorSetPositionMutation {\n\n tile: Entity,\n\n}\n\n\n\nimpl Mutation for CursorSetPositionMutation {\n\n fn apply(&self, ecs: &mut ECS) {\n\n let tile = ecs.read::<Tile>(&self.tile).unwrap();\n\n let (x, y) = (tile.x, tile.y);\n\n\n\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\n\n let cursor = ecs.write_res::<Cursor>();\n\n cursor.set_pos(&renderer, [x as f32, y as f32, 0.]);\n\n }\n\n}\n\n\n","file_path":"sandbox/src/main.rs","rank":73,"score":61666.536661780236},{"content":"struct CocoaEventQueue {\n\n\n\n}\n\n\n\nimpl CocoaEventQueue {\n\n\n\n pub fn new() -> CocoaEventQueue {\n\n CocoaEventQueue {}\n\n }\n\n\n\n pub fn queue_resize_event(&mut self, width: f32, height: f32) {\n\n\n\n }\n\n\n\n pub fn queue_close_event(&mut self) {\n\n\n\n }\n\n}\n\n\n\npub struct OsxWindow {\n","file_path":"src/platform/osx/osx_window.rs","rank":74,"score":60718.0284321004},{"content":"pub trait GameLogic {\n\n fn window_props(&self) -> WindowProps;\n\n fn register_components(&self, ecs: &mut ECS);\n\n fn cleanup_components(&self, ecs: &mut ECS);\n\n fn register_events(&self, ecs: &mut ECS);\n\n fn migrate_events(&self, ecs: &mut ECS);\n\n fn game_states(&self) -> HashMap<GameStateId, Box<dyn GameState>>;\n\n fn initial_game_state(&self) -> GameStateId;\n\n fn setup(&mut self, ecs: &mut ECS);\n\n}\n\n\n\npub struct Gouda<T: GameLogic> {\n\n game_logic: T,\n\n ecs: ECS,\n\n game_states: HashMap<GameStateId, Box<dyn GameState>>,\n\n active_state: Option<GameStateId>,\n\n}\n\n\n\nimpl<T: GameLogic> Gouda<T> {\n\n pub fn new(game_logic: T) -> Self {\n","file_path":"src/lib.rs","rank":75,"score":59878.10462002457},{"content":"pub trait GameState {\n\n fn on_state_start(&self, ecs: &mut ECS);\n\n fn on_state_stop(&self, ecs: &mut ECS);\n\n fn render_state(&self, ecs: &ECS, scene: &Scene);\n\n fn next_state(&self, ecs: &ECS) -> Option<GameStateId>;\n\n fn active_layers(&self) -> Vec<RenderLayer>;\n\n}\n\n\n","file_path":"src/lib.rs","rank":76,"score":59878.10462002457},{"content":"#[derive(Debug)]\n\nstruct ConstantBuffer<T> {\n\n buffer: *mut ID3D11Buffer,\n\n phantom: PhantomData<T>,\n\n}\n\n\n\nimpl <T> ConstantBuffer<T> {\n\n pub fn new(renderer: &Renderer, data: Vec<T>) -> ConstantBuffer<T> {\n\n println!(\"Creating constant buffer\");\n\n unsafe {\n\n let constant_buffer_desc = D3D11_BUFFER_DESC {\n\n ByteWidth: (size_of::<T>() * data.len()) as u32,\n\n Usage: D3D11_USAGE_DYNAMIC,\n\n BindFlags: D3D11_BIND_CONSTANT_BUFFER,\n\n CPUAccessFlags: D3D11_CPU_ACCESS_WRITE,\n\n MiscFlags: 0,\n\n StructureByteStride: size_of::<T>() as u32,\n\n };\n\n let subresource_data = D3D11_SUBRESOURCE_DATA {\n\n pSysMem: mem::transmute(data.as_ptr()),\n\n SysMemPitch: 0,\n","file_path":"src/platform/d3d/buffers.rs","rank":77,"score":59580.8749847033},{"content":"fn main() {\n\n let mut gouda = Gouda::new(Game::new());\n\n gouda.run();\n\n}\n","file_path":"sandbox/src/main.rs","rank":78,"score":58827.85348068943},{"content":"fn win32_load_xinput() {\n\n unsafe {\n\n let dll_14 = win32_string(\"xinput1_4.dll\");\n\n let mut xinput_lib = LoadLibraryW(dll_14.as_ptr());\n\n\n\n if xinput_lib.is_null() {\n\n let dll_910 = win32_string(\"xinput9_1_0.dll\");\n\n xinput_lib = LoadLibraryW(dll_910.as_ptr());\n\n }\n\n\n\n if xinput_lib.is_null() {\n\n let dll_13 = win32_string(\"xinput1_3.dll\");\n\n xinput_lib = LoadLibraryW(dll_13.as_ptr());\n\n }\n\n\n\n if !xinput_lib.is_null() {\n\n let get_state_name_c = CString::new(\"XInputGetState\").unwrap();\n\n let get_state_ptr = GetProcAddress(xinput_lib, get_state_name_c.as_ptr());\n\n OPT_XINPUT_GET_STATE_FUNC = Some(\n\n transmute::<*mut __some_function, XInputGetStateFunc>(get_state_ptr),\n","file_path":"src/platform/win32/window.rs","rank":79,"score":55687.16309675046},{"content":"fn win32_process_xinput_digital_button(\n\n xinput_button_state: u16,\n\n old_state: &GameButtonState,\n\n new_state: &mut GameButtonState,\n\n button_bit: u16,\n\n) {\n\n new_state.ended_down = (xinput_button_state & button_bit) == button_bit;\n\n new_state.half_transition_count = if old_state.ended_down != new_state.ended_down {\n\n 1\n\n } else {\n\n 0\n\n };\n\n}\n\n\n","file_path":"src/platform/win32/win32_input.rs","rank":80,"score":53049.744294844175},{"content":"fn create_menu_bar(title: &String) {\n\n unsafe {\n\n let app_name = NSString::alloc(nil).init_str(title);\n\n let menu_bar = NSMenu::new(nil).autorelease();\n\n let app_menu_item = NSMenuItem::new(nil).autorelease();\n\n menu_bar.addItem_(app_menu_item);\n\n\n\n NSApp().setMainMenu_(menu_bar);\n\n\n\n let app_menu = NSMenu::new(nil).autorelease();\n\n let quit_prefix = NSString::alloc(nil).init_str(\"Quit \");\n\n let quit_title = quit_prefix.stringByAppendingString_(app_name);\n\n let quit_action = selector(\"terminate:\");\n\n let quit_key = NSString::alloc(nil).init_str(\"q\");\n\n let quit_menu_item = NSMenuItem::alloc(nil)\n\n .initWithTitle_action_keyEquivalent_(quit_title, quit_action, quit_key)\n\n .autorelease();\n\n app_menu.addItem_(quit_menu_item);\n\n app_menu_item.setSubmenu_(app_menu);\n\n }\n\n}\n\n\n","file_path":"src/platform/osx/osx_window.rs","rank":81,"score":49897.882000651065},{"content":"fn win32_string(value: &str) -> Vec<u16> {\n\n OsStr::new(value).encode_wide().chain(once(0)).collect()\n\n}\n\n\n","file_path":"src/platform/d3d/shader.rs","rank":82,"score":47512.51627879045},{"content":"fn win32_string(value: &str) -> Vec<u16> {\n\n OsStr::new(value).encode_wide().chain(once(0)).collect()\n\n}\n\n\n","file_path":"src/platform/win32/window.rs","rank":83,"score":47512.51627879045},{"content":"fn win32_string_short(value: &str) -> Vec<i8> {\n\n let wstr = win32_string(value);\n\n let mut result = vec![];\n\n for c in wstr {\n\n result.push(c as i8);\n\n }\n\n return result;\n\n}\n\n\n\nimpl Shader {\n\n pub fn new(renderer: &Renderer, has_textures: bool, vertex_file: &str, fragment_file: &str) -> Shader {\n\n return Shader {\n\n vertex_shader: VertexShader::new(renderer, has_textures, vertex_file),\n\n fragment_shader: FragmentShader::new(renderer, fragment_file),\n\n };\n\n }\n\n\n\n pub fn bind(&self, scene: &Scene) {\n\n self.vertex_shader.bind(scene);\n\n self.fragment_shader.bind(scene);\n\n }\n\n}\n\n\n\nimpl std::fmt::Debug for Shader {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {\n\n return Ok(());\n\n }\n\n}\n","file_path":"src/platform/d3d/shader.rs","rank":84,"score":46724.85060438703},{"content":"fn collect_elements(line: &String) -> HashMap<String, String> {\n\n let mut result = HashMap::new();\n\n let lines: Vec<&str> = line.split_whitespace().collect();\n\n for line in lines {\n\n let split: Vec<&str> = line.split(\"=\").collect();\n\n if split.len() == 2 {\n\n result.insert(String::from(split[0]), String::from(split[1]));\n\n }\n\n }\n\n return result;\n\n}\n\n\n\nimpl Font {\n\n\n\n pub fn new(renderer: &Renderer, font_file_path: &str, font_png_path: &str) -> Font {\n\n let font_file = File::open(font_file_path).unwrap();\n\n let mut font_file_reader = BufReader::new(font_file);\n\n\n\n let mut font_entries = Vec::new();\n\n let mut line_iter = font_file_reader.lines().filter_map(|result| result.ok());\n","file_path":"src/font.rs","rank":85,"score":46524.9009443627},{"content":" return None;\n\n }\n\n\n\n pub fn write<T: 'static>(&mut self, entity: &Entity) -> Option<&mut T>{\n\n if let Some(map) = self.components.get_mut::<EntityMap<T>>() {\n\n if let Some(Some(val)) = map.0.get_mut(entity.index) {\n\n return Some(&mut val.value);\n\n }\n\n }\n\n return None;\n\n }\n\n\n\n impl_read!(read1, [t1]);\n\n impl_read!(read2, [t1, t2]);\n\n impl_read!(read3, [t1, t2, t3]);\n\n impl_read!(read4, [t1, t2, t3, t4]);\n\n impl_read!(read5, [t1, t2, t3, t4, t5]);\n\n\n\n impl_get!(get1, [t1]);\n\n impl_get!(get2, [t1, t2]);\n","file_path":"src/ecs.rs","rank":86,"score":38668.49255128113},{"content":"}\n\n\n\npub struct EntityBuilder<'a> {\n\n ecs: &'a mut ECS,\n\n entity: Entity,\n\n}\n\n\n\nimpl <'a> EntityBuilder<'a> {\n\n pub fn add<T: 'static + Debug>(mut self, c: T) -> EntityBuilder<'a> {\n\n self.ecs.add_component(&self.entity, c);\n\n self\n\n }\n\n\n\n pub fn entity(&mut self) -> Entity {\n\n self.entity.clone()\n\n }\n\n}\n","file_path":"src/ecs.rs","rank":87,"score":38668.381093147815},{"content":" self.resources.get::<T>().unwrap()\n\n }\n\n\n\n pub fn write_res<T: 'static>(&mut self) -> &mut T {\n\n self.resources.get_mut::<T>().unwrap()\n\n }\n\n\n\n pub fn read<T: 'static>(&self, entity: &Entity) -> Option<&T>{\n\n let i = self.components.get::<EntityMap<T>>().unwrap().0.get(entity.index);\n\n match i {\n\n Some(i) => {\n\n match i {\n\n Some(i) => {\n\n return Some(&i.value);\n\n },\n\n None => {}\n\n }\n\n }\n\n None => {}\n\n }\n","file_path":"src/ecs.rs","rank":88,"score":38666.60238222991},{"content":"}\n\n\n\n#[macro_use]\n\nmacro_rules! impl_get {\n\n ( $fn_name:ident, [$($r:ident),*] ) => {\n\n pub fn $fn_name<$($r: 'static),*>(&self) -> Vec<Entity> {\n\n\n\n let mut minlen = 1000;\n\n $(\n\n let $r = self.components.get::<EntityMap<$r>>().unwrap();\n\n minlen = std::cmp::min(minlen, $r.0.len());\n\n )*\n\n\n\n let mut res = Vec::new();\n\n let num_iter = minlen;\n\n for i in 0..num_iter {\n\n $(\n\n let $r = $r.0.get(i);\n\n )*\n\n match ($($r),*) {\n","file_path":"src/ecs.rs","rank":89,"score":38663.72194583364},{"content":" }\n\n\n\n pub fn run_systems(&mut self) {\n\n let num_systems = self.systems.len();\n\n for i in 0..num_systems {\n\n let mutations = self.systems[i](&self);\n\n for mutation in mutations {\n\n mutation.apply(self);\n\n }\n\n }\n\n }\n\n\n\n pub fn new_entity(&mut self) -> Entity {\n\n self.entity_allocator.allocate()\n\n }\n\n\n\n pub fn build_entity(&mut self) -> EntityBuilder {\n\n let e = self.entity_allocator.allocate();\n\n EntityBuilder {\n\n ecs: self,\n","file_path":"src/ecs.rs","rank":90,"score":38663.590876928705},{"content":" entity: e,\n\n }\n\n }\n\n\n\n pub fn delete_entity(&mut self, entity: &Entity) {\n\n self.entity_allocator.deallocate(entity.clone());\n\n }\n\n\n\n pub fn add_component<T: 'static + Debug>(&mut self, entity: &Entity, component: T) {\n\n let comps = self.components.get_mut::<EntityMap<T>>();\n\n match comps {\n\n Some(comps) => {\n\n comps.set(*entity, component);\n\n },\n\n None => {}\n\n }\n\n }\n\n\n\n pub fn remove_component<T: 'static + Debug>(&mut self, entity: &Entity) {\n\n let comps = self.components.get_mut::<EntityMap<T>>();\n","file_path":"src/ecs.rs","rank":91,"score":38663.41043359218},{"content":" },\n\n None => { None }\n\n }\n\n },\n\n None => { None }\n\n }\n\n }\n\n\n\n pub fn get_mut(&mut self, index: GenIndex) -> Option<&mut T> {\n\n let entry = self.0.get_mut(index.index);\n\n match entry {\n\n Some(entry) => {\n\n match entry {\n\n Some(entry) => {\n\n if entry.generation == index.generation {\n\n Some(&mut entry.value)\n\n } else {\n\n None\n\n }\n\n\n","file_path":"src/ecs.rs","rank":92,"score":38663.10145276559},{"content":" pub fn clear(&mut self, index: GenIndex) {\n\n if index.index >= self.0.len() {\n\n return;\n\n }\n\n let entry = self.0.get_mut(index.index).unwrap();\n\n *entry = None;\n\n }\n\n\n\n pub fn get(&self, index: GenIndex) -> Option<&T> {\n\n let entry = self.0.get(index.index);\n\n match entry {\n\n Some(entry) => {\n\n match entry {\n\n Some(entry) => {\n\n if entry.generation == index.generation {\n\n Some(&entry.value)\n\n } else {\n\n None\n\n }\n\n\n","file_path":"src/ecs.rs","rank":93,"score":38661.609976275155},{"content":" impl_get!(get3, [t1, t2, t3]);\n\n impl_get!(get4, [t1, t2, t3, t4]);\n\n impl_get!(get5, [t1, t2, t3, t4, t5]);\n\n\n\n pub fn new() -> ECS {\n\n ECS {\n\n entity_allocator: GenIndexAllocator::new(),\n\n components: AnyMap::new(),\n\n resources: AnyMap::new(),\n\n systems: Vec::new(),\n\n queued_events: AnyMap::new(),\n\n processing_events: AnyMap::new(),\n\n }\n\n }\n\n}\n\n\n\nimpl Default for ECS {\n\n fn default() -> Self {\n\n ECS::new()\n\n }\n","file_path":"src/ecs.rs","rank":94,"score":38661.33268381838},{"content":" match comps {\n\n Some(comps) => {\n\n comps.clear(*entity);\n\n },\n\n None => {}\n\n }\n\n }\n\n\n\n pub fn cleanup_components<T: 'static + Debug>(&mut self) {\n\n let mut comps_to_remove = vec![];\n\n if let Some(comps) = self.components.get::<EntityMap<T>>() {\n\n let l = comps.0.len();\n\n for i in 0..l {\n\n if let Some(e) = &comps.0[i] {\n\n let e = GenIndex {index: i, generation: e.generation};\n\n if !self.entity_allocator.is_live(e) {\n\n println!(\"Not live\");\n\n comps_to_remove.push(e);\n\n }\n\n }\n","file_path":"src/ecs.rs","rank":95,"score":38661.21089083702},{"content":" },\n\n None => { None }\n\n }\n\n },\n\n None => { None }\n\n }\n\n }\n\n}\n\n\n\npub type Entity = GenIndex;\n","file_path":"src/ecs.rs","rank":96,"score":38660.613232368334},{"content":" ( $fn_name:ident, [$($r:ident),*] ) => {\n\n pub fn $fn_name<$($r: 'static),*>(&self) -> Vec<($(&$r),*, Entity)> {\n\n\n\n let mut minlen = 1000;\n\n $(\n\n let $r = self.components.get::<EntityMap<$r>>().unwrap();\n\n minlen = std::cmp::min(minlen, $r.0.len());\n\n )*\n\n\n\n let mut res = Vec::new();\n\n let num_iter = minlen;\n\n for i in 0..num_iter {\n\n $(\n\n let $r = $r.0.get(i);\n\n )*\n\n match ($($r),*) {\n\n ($(Some($r)),*) => {\n\n match ($($r),*) {\n\n ($(Some($r)),*) => {\n\n let mut generation = 0;\n","file_path":"src/ecs.rs","rank":97,"score":38658.56738670879},{"content":"#![allow(non_camel_case_types)]\n\n#![allow(unused_parens)]\n\n\n\nuse anymap::AnyMap;\n\nuse std::fmt::Debug;\n\nuse std::collections::HashMap;\n\n\n\n#[derive(Debug, Eq, PartialEq, Copy, Clone)]\n\npub struct GenIndex {\n\n index: usize,\n\n generation: u64,\n\n}\n\n\n\n#[derive(Eq, PartialEq, Clone)]\n","file_path":"src/ecs.rs","rank":98,"score":38658.012238196716},{"content":" entry.is_free = true;\n\n self.free.push(index.index);\n\n return true;\n\n },\n\n None => {\n\n return false;\n\n }\n\n }\n\n }\n\n\n\n pub fn is_live(&self, index: GenIndex) -> bool {\n\n let e = self.entries.get(index.index).unwrap();\n\n return e.generation == index.generation && !e.is_free;\n\n }\n\n}\n\n\n","file_path":"src/ecs.rs","rank":99,"score":38657.765319220496}],"string":"[\n {\n \"content\": \"pub fn win32_process_keyboard(keyboard: &mut KeyboardInput, vkcode: i32, was_down: bool, is_down: bool) {\\n\\n if was_down != is_down {\\n\\n if vkcode == VK_UP {\\n\\n win32_process_keyboard_message(\\n\\n &mut keyboard.special_keys[SpecialKeys::UpArrow],\\n\\n is_down,\\n\\n );\\n\\n } else if vkcode == VK_LEFT {\\n\\n win32_process_keyboard_message(\\n\\n &mut keyboard.special_keys[SpecialKeys::LeftArrow],\\n\\n is_down,\\n\\n );\\n\\n } else if vkcode == VK_DOWN {\\n\\n win32_process_keyboard_message(\\n\\n &mut keyboard.special_keys[SpecialKeys::DownArrow],\\n\\n is_down,\\n\\n );\\n\\n } else if vkcode == VK_RIGHT {\\n\\n win32_process_keyboard_message(\\n\\n &mut keyboard.special_keys[SpecialKeys::RightArrow],\\n\",\n \"file_path\": \"src/platform/win32/win32_input.rs\",\n \"rank\": 1,\n \"score\": 222205.92440643694\n },\n {\n \"content\": \"pub fn change_stone_text(ecs: &mut ECS) {\\n\\n let e = ecs.get2::<StoneText, GuiText>().first().unwrap().clone();\\n\\n let font = ecs.read_res::<Rc<Font>>().clone();\\n\\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\\n\\n let gold = ecs.read_res::<Supplies>().stone;\\n\\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, format!(\\\"STONE: {}\\\", gold), font);\\n\\n}\\n\\n\\n\\npub struct UpdateResourceTextMutation {\\n\\n\\n\\n}\\n\\n\\n\\nimpl Mutation for UpdateResourceTextMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n change_gold_text(ecs);\\n\\n change_wood_text(ecs);\\n\\n change_stone_text(ecs);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/gui.rs\",\n \"rank\": 2,\n \"score\": 189950.36876607488\n },\n {\n \"content\": \"pub fn change_gold_text(ecs: &mut ECS) {\\n\\n let e = ecs.get2::<GoldText, GuiText>().first().unwrap().clone();\\n\\n let font = ecs.read_res::<Rc<Font>>().clone();\\n\\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\\n\\n let gold = ecs.read_res::<Supplies>().gold;\\n\\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, format!(\\\"GOLD: {}\\\", gold), font);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/gui.rs\",\n \"rank\": 3,\n \"score\": 189950.36876607488\n },\n {\n \"content\": \"pub fn change_wood_text(ecs: &mut ECS) {\\n\\n let e = ecs.get2::<WoodText, GuiText>().first().unwrap().clone();\\n\\n let font = ecs.read_res::<Rc<Font>>().clone();\\n\\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\\n\\n let gold = ecs.read_res::<Supplies>().wood;\\n\\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, format!(\\\"WOOD: {}\\\", gold), font);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/gui.rs\",\n \"rank\": 4,\n \"score\": 189950.36876607488\n },\n {\n \"content\": \"pub fn i32_from_bytes(bytes: [u8; 4]) -> i32 {\\n\\n ((bytes[0] as i32) << 24)\\n\\n + ((bytes[1] as i32) << 16)\\n\\n + ((bytes[2] as i32) << 8)\\n\\n + ((bytes[3] as i32) << 0)\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 5,\n \"score\": 183126.7007148657\n },\n {\n \"content\": \"pub fn create_transformation_matrix(translate: [f32; 3], rot: [f32; 3], scale: [f32; 3]) -> Mat4x4 {\\n\\n let transform_mat = Mat4x4 {\\n\\n data: [\\n\\n [1., 0., 0., translate[0]],\\n\\n [0., 1., 0., translate[1]],\\n\\n [0., 0., 1., translate[2]],\\n\\n [0., 0., 0., 1.],\\n\\n ]\\n\\n };\\n\\n\\n\\n let xrot = Mat4x4::x_rot_matrix(rot[0]);\\n\\n let yrot = Mat4x4::y_rot_matrix(rot[1]);\\n\\n let zrot = Mat4x4::z_rot_matrix(rot[2]);\\n\\n\\n\\n let scale_mat = Mat4x4 {\\n\\n data: [\\n\\n [scale[0], 0., 0., 0.],\\n\\n [0., scale[1], 0., 0.],\\n\\n [0., 0., scale[2], 0.],\\n\\n [0., 0., 0., 1.],\\n\\n ]\\n\\n };\\n\\n\\n\\n let transform_mat = zrot * yrot * xrot * transform_mat * scale_mat;\\n\\n return transform_mat;\\n\\n}\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 6,\n \"score\": 180871.82287601335\n },\n {\n \"content\": \"pub fn change_stage_text(ecs: &mut ECS, text: &str) {\\n\\n let e = ecs.get2::<StageText, GuiText>().first().unwrap().clone();\\n\\n let font = ecs.read_res::<Rc<Font>>().clone();\\n\\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\\n\\n ecs.write::<GuiText>(&e).unwrap().change_text(&renderer, String::from(text), font);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/gui.rs\",\n \"rank\": 7,\n \"score\": 177631.2114996994\n },\n {\n \"content\": \"pub fn osx_process_keyboard_message(new_state: &mut GameButtonState, is_down: bool) {\\n\\n if new_state.ended_down != is_down {\\n\\n new_state.ended_down = is_down;\\n\\n new_state.half_transition_count += 1;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/platform/osx/osx_input.rs\",\n \"rank\": 8,\n \"score\": 174956.6671528549\n },\n {\n \"content\": \"pub fn win32_process_keyboard_message(new_state: &mut GameButtonState, is_down: bool) {\\n\\n if new_state.ended_down != is_down {\\n\\n new_state.ended_down = is_down;\\n\\n new_state.half_transition_count += 1;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/platform/win32/win32_input.rs\",\n \"rank\": 9,\n \"score\": 174956.66715285493\n },\n {\n \"content\": \"pub fn create_view_matrix(pitch: f32, yaw: f32, camera_pos: [f32; 3]) -> Mat4x4 {\\n\\n let pitch_rotate = Mat4x4::x_rot_matrix(pitch);\\n\\n let yaw_rotate = Mat4x4::y_rot_matrix(yaw);\\n\\n let mut rotated = Mat4x4::identity() * pitch_rotate * yaw_rotate;\\n\\n rotated.data[0][3] = -camera_pos[0];\\n\\n rotated.data[1][3] = -camera_pos[1];\\n\\n rotated.data[2][3] = -camera_pos[2];\\n\\n return rotated;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 10,\n \"score\": 172278.1465613702\n },\n {\n \"content\": \"fn create_top_bar(ecs: &mut ECS, mouse_layer: Entity) -> Entity {\\n\\n const TOP_BAR_PERCENT_HEIGHT: f32 = 0.03;\\n\\n let top_bar = GuiComponent::create_hoverable(\\n\\n ecs,\\n\\n None,\\n\\n None,\\n\\n GuiConstraints::new(\\n\\n Constraint::CenterConstraint,\\n\\n Constraint::RelativeConstraint {size: 1.0 - TOP_BAR_PERCENT_HEIGHT},\\n\\n RelativeConstraint {size: 1.0},\\n\\n RelativeConstraint {size: TOP_BAR_PERCENT_HEIGHT},\\n\\n ),\\n\\n 0.0,\\n\\n Color::from_u8(0x22, 0x22, 0x22, 0xFF),\\n\\n Color::from_u8(0x55, 0x55, 0x55, 0xFF));\\n\\n\\n\\n let bounds = ecs.read::<GuiComponent>(&top_bar).unwrap().calculated_bounds;\\n\\n let font = ecs.read_res::<Rc<Font>>().clone();\\n\\n let gold_text = GuiText::create(\\n\\n ecs,\\n\",\n \"file_path\": \"sandbox/src/gui.rs\",\n \"rank\": 11,\n \"score\": 167318.9050717581\n },\n {\n \"content\": \"fn create_bottom_panel(ecs: &mut ECS, mouse_layer: Entity) -> Entity {\\n\\n let mut bottom_panel_entity = GuiComponent::create(\\n\\n ecs,\\n\\n None,\\n\\n None,\\n\\n GuiConstraints::new(\\n\\n Constraint::CenterConstraint,\\n\\n Constraint::RelativeConstraint { size: 0.0 },\\n\\n Constraint::RelativeConstraint {size: 1.},\\n\\n Constraint::PixelConstraint {size: 160}\\n\\n ),\\n\\n 0.,\\n\\n Color::from_u8(0x22, 0x22, 0x22, 0xFF));\\n\\n let bottom_panel = ecs.read::<GuiComponent>(&bottom_panel_entity).unwrap();\\n\\n let mut buttons_box_entity = GuiComponent::create(\\n\\n ecs,\\n\\n None,\\n\\n Some(bottom_panel.calculated_bounds),\\n\\n GuiConstraints::new(\\n\\n Constraint::CenterConstraint,\\n\",\n \"file_path\": \"sandbox/src/gui.rs\",\n \"rank\": 12,\n \"score\": 167318.9050717581\n },\n {\n \"content\": \"fn add_menu_button(button_id: StartMenuButtonId, text: &str, menu_layer: Entity, bounds: Bounds, y: f32, ecs: &mut ECS, menu_screen_entity: Entity) {\\n\\n let button = GuiComponent::create_hoverable(\\n\\n ecs,\\n\\n Some(menu_layer),\\n\\n Some(bounds),\\n\\n GuiConstraints::new(\\n\\n Constraint::CenterConstraint,\\n\\n RelativeConstraint {size: y},\\n\\n RelativeConstraint {size: 0.6},\\n\\n RelativeConstraint {size: 0.12},\\n\\n ),\\n\\n 10.,\\n\\n Color::from_u8(0x33, 0x33, 0x33, 0xAA),\\n\\n Color::from_u8(0x88, 0x33, 0x33, 0xAA),\\n\\n );\\n\\n ecs.add_component(&button, button_id);\\n\\n\\n\\n let comp = ecs.read::<GuiComponent>(&button).unwrap();\\n\\n let font = ecs.read_res::<Rc<Font>>();\\n\\n let text = GuiText::create(\\n\",\n \"file_path\": \"sandbox/src/start_menu.rs\",\n \"rank\": 13,\n \"score\": 165355.56336017128\n },\n {\n \"content\": \"fn add_menu_button(button_id: MainMenuButtonId, text: &str, menu_layer: Entity, bounds: Bounds, y: f32, ecs: &mut ECS, menu_screen_entity: Entity) {\\n\\n let button = GuiComponent::create_hoverable(\\n\\n ecs,\\n\\n Some(menu_layer),\\n\\n Some(bounds),\\n\\n GuiConstraints::new(\\n\\n Constraint::CenterConstraint,\\n\\n RelativeConstraint {size: y},\\n\\n RelativeConstraint {size: 0.6},\\n\\n RelativeConstraint {size: 0.12},\\n\\n ),\\n\\n 10.,\\n\\n Color::from_u8(0x33, 0x33, 0x33, 0xAA),\\n\\n Color::from_u8(0x88, 0x33, 0x33, 0xAA),\\n\\n );\\n\\n ecs.add_component(&button, button_id);\\n\\n\\n\\n let comp = ecs.read::<GuiComponent>(&button).unwrap();\\n\\n let font = ecs.read_res::<Rc<Font>>();\\n\\n let text = GuiText::create(\\n\",\n \"file_path\": \"sandbox/src/main_menu.rs\",\n \"rank\": 14,\n \"score\": 165355.56336017128\n },\n {\n \"content\": \"fn draw_everything(ecs: &ECS, scene: &Scene) {\\n\\n let camera = ecs.read_res::<Camera>();\\n\\n for (tile, _) in ecs.read1::<Tile>() {\\n\\n tile.draw(&scene, &camera);\\n\\n }\\n\\n\\n\\n ecs.read_res::<Cursor>().draw(&scene, &camera);\\n\\n\\n\\n for (monster, _) in ecs.read1::<Monster>() {\\n\\n monster.draw(&scene, &camera);\\n\\n }\\n\\n\\n\\n for (player, _) in ecs.read1::<Player>() {\\n\\n player.draw(&scene, &camera);\\n\\n }\\n\\n\\n\\n for (turret, _) in ecs.read1::<Turret>() {\\n\\n turret.draw(&scene, &camera);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 15,\n \"score\": 160127.0346150935\n },\n {\n \"content\": \"pub fn create_projection_matrix(aspect: f32, fov: f32, zfar: f32, znear: f32) -> Mat4x4 {\\n\\n let fov = fov * f32::consts::PI/180.0;\\n\\n let zm = zfar - znear;\\n\\n let zp = zfar + znear;\\n\\n let xscale = (1./(fov / 2.).tan()) / aspect;\\n\\n let yscale = 1./(fov / 2.).tan();\\n\\n let zscale = -zp / zm;\\n\\n let ztranslate = -(2. * zfar * znear)/zm;\\n\\n\\n\\n return Mat4x4 {\\n\\n data: [\\n\\n [xscale, 0., 0., 0.],\\n\\n [0., yscale, 0., 0.],\\n\\n [0., 0., zscale, ztranslate],\\n\\n [0., 0., -1., 0.],\\n\\n ]\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/math.rs\",\n \"rank\": 16,\n \"score\": 157698.6439224983\n },\n {\n \"content\": \"fn paeth(a: i32, b: i32, c: i32) -> u8 {\\n\\n let p = a + b - c;\\n\\n let pa = (p - a).abs();\\n\\n let pb = (p - b).abs();\\n\\n let pc = (p - c).abs();\\n\\n\\n\\n if pa <= pb && pa <= pc {\\n\\n return a as u8;\\n\\n } else if pb <= pc {\\n\\n return b as u8;\\n\\n } else {\\n\\n return c as u8;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PNG {\\n\\n pub fn image(&self) -> Image {\\n\\n let w = self.header_chunk.width as usize;\\n\\n let h = self.header_chunk.height as usize;\\n\\n\\n\",\n \"file_path\": \"src/images/png.rs\",\n \"rank\": 17,\n \"score\": 156364.89109294701\n },\n {\n \"content\": \"fn next_day(ecs: &mut ECS) {\\n\\n change_stage_text(ecs, \\\"Day\\\");\\n\\n\\n\\n let game_day = ecs.write_res::<Vec<GameDay>>().remove(0);\\n\\n ecs.add_res(game_day);\\n\\n ecs.write_res::<StateTimer>().countdown_s = ecs.read_res::<GameDay>().day_length;\\n\\n\\n\\n\\n\\n let tilemap = ecs.read_res::<Tilemap>();\\n\\n let borders: Vec<(f32, f32)> = tilemap.borders().iter().map(|border| {\\n\\n tilemap.pos_of_tile(*border)\\n\\n }).collect();\\n\\n\\n\\n let waves = &ecs.read_res::<GameDay>().waves.clone();\\n\\n for wave in waves {\\n\\n let border_index = thread_rng().gen_range(0, borders.len());\\n\\n let border = borders.get(border_index).unwrap();\\n\\n WaveSpawner::create(ecs, wave.wave.clone(), border.0, border.1, 1.);\\n\\n }\\n\\n\\n\\n let tilemap = ecs.read_res::<Tilemap>();\\n\\n Tree::create(ecs, tilemap.tile_at_pos(2, 4));\\n\\n let tilemap = ecs.read_res::<Tilemap>();\\n\\n Tree::create(ecs, tilemap.tile_at_pos(8, 2));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 18,\n \"score\": 146637.94369736\n },\n {\n \"content\": \"fn next_night(ecs: &mut ECS) {\\n\\n change_stage_text(ecs, \\\"Night\\\");\\n\\n\\n\\n ecs.write_res::<StateTimer>().countdown_s = ecs.read_res::<GameDay>().night_length;\\n\\n}\\n\\n\\n\\npub const DAY_GAME_STATE: GameStateId = 10;\\n\\n\\n\\npub struct DayGameState {\\n\\n}\\n\\n\\n\\nimpl GameState for DayGameState {\\n\\n fn on_state_start(&self, ecs: &mut ECS) {\\n\\n register_core_systems(ecs);\\n\\n ecs.add_system(Box::new(mouse_click_system));\\n\\n ecs.add_system(Box::new(mouse_cursor_system));\\n\\n ecs.add_system(Box::new(day_state_countdown));\\n\\n\\n\\n if ecs.read_res::<StateTimer>().countdown_s <= 0. {\\n\\n next_day(ecs);\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 19,\n \"score\": 146637.94369736\n },\n {\n \"content\": \"fn register_core_systems(ecs: &mut ECS) {\\n\\n ecs.add_system(Box::new(player_move_system));\\n\\n ecs.add_system(Box::new(mouse_capture_system));\\n\\n ecs.add_system(Box::new(game_gui_system));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 20,\n \"score\": 144126.83922696934\n },\n {\n \"content\": \"pub fn player_move_system(ecs: &ECS) -> Mutations {\\n\\n let input = ecs.read_res::<GameInput>();\\n\\n let mut mutations: Mutations = Vec::new();\\n\\n for (p, ent) in ecs.read1::<Player>() {\\n\\n let tile = ecs.read::<Tile>(&p.current_tile);\\n\\n if input.keyboard.letter_pressed(LetterKeys::A) {\\n\\n mutations.push(Box::new(MoveMutation {entity: ent, dx: -1, dy: 0}))\\n\\n } else if input.keyboard.letter_pressed(LetterKeys::D) {\\n\\n mutations.push(Box::new(MoveMutation {entity: ent, dx: 1, dy: 0}))\\n\\n }\\n\\n if input.keyboard.letter_pressed(LetterKeys::W) {\\n\\n mutations.push(Box::new(MoveMutation {entity: ent, dx: 0, dy: 1}))\\n\\n } else if input.keyboard.letter_pressed(LetterKeys::S) {\\n\\n mutations.push(Box::new(MoveMutation {entity: ent, dx: 0, dy: -1}))\\n\\n }\\n\\n }\\n\\n return mutations;\\n\\n}\\n\",\n \"file_path\": \"sandbox/src/player.rs\",\n \"rank\": 21,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn game_gui_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = vec![];\\n\\n mutations.push(Box::new(UpdateResourceTextMutation {}));\\n\\n for (capture, gui, entity) in ecs.read2::<MouseCaptureArea, GuiComponent>() {\\n\\n mutations.push(Box::new(GuiHoveredMutation{entity, hovered: capture.is_hovered}));\\n\\n\\n\\n if capture.clicked_buttons[0] {\\n\\n println!(\\\"Clicked a button\\\");\\n\\n }\\n\\n }\\n\\n return mutations;\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct StageText {}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct GoldText {}\\n\\n\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"sandbox/src/gui.rs\",\n \"rank\": 22,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn arrow_move_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = vec![];\\n\\n let dt = ecs.read_res::<GameInput>().seconds_to_advance_over_update;\\n\\n for (arrow, entity) in ecs.read1::<Arrow>() {\\n\\n let target = ecs.read::<Monster>(&arrow.target);\\n\\n if let Some(monster) = target {\\n\\n let v = (monster.x - arrow.x, monster.y - arrow.y);\\n\\n let dist = (v.0 * v.0 + v.1 * v.1).sqrt();\\n\\n if dist < 0.5 {\\n\\n mutations.push(Box::new(ArrowCollisionMutation {\\n\\n arrow: entity,\\n\\n }));\\n\\n } else {\\n\\n mutations.push(Box::new(MoveArrowTowardsMutation {\\n\\n arrow: entity,\\n\\n dx: v.0 * dt / dist * arrow.speed,\\n\\n dy: v.1 * dt / dist * arrow.speed,\\n\\n }))\\n\\n }\\n\\n } else {\\n\",\n \"file_path\": \"sandbox/src/building.rs\",\n \"rank\": 23,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn wave_spawner_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = Vec::new();\\n\\n let input = ecs.read_res::<GameInput>();\\n\\n\\n\\n for (spawner, entity) in ecs.read1::<WaveSpawner>() {\\n\\n mutations.push(Box::new(ProcessSpawnerMutation {entity, dt: input.seconds_to_advance_over_update, x: spawner.x, y: spawner.y}));\\n\\n }\\n\\n\\n\\n return mutations;\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct WaveSpawner {\\n\\n wave_spec: WaveSpec,\\n\\n num_monsters: usize,\\n\\n current_monster_index: usize,\\n\\n spawn_max_cd: f32,\\n\\n spawn_current_cd: f32,\\n\\n x: f32,\\n\\n y: f32,\\n\",\n \"file_path\": \"sandbox/src/spawners.rs\",\n \"rank\": 24,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn mouse_capture_system(ecs: &ECS) -> Mutations {\\n\\n let mut layers = ecs.read2::<MouseCaptureLayer, ActiveCaptureLayer>();\\n\\n layers.sort_by(|a, b| b.0.sort_index.cmp(&a.0.sort_index));\\n\\n\\n\\n let input = ecs.read_res::<GameInput>();\\n\\n let mouse_x = input.mouse.x;\\n\\n let mouse_y = 900 - input.mouse.y;\\n\\n let down_buttons = [\\n\\n input.mouse.buttons[0].ended_down,\\n\\n input.mouse.buttons[1].ended_down,\\n\\n input.mouse.buttons[2].ended_down,\\n\\n input.mouse.buttons[3].ended_down,\\n\\n input.mouse.buttons[4].ended_down,\\n\\n ];\\n\\n let clicked_buttons = [\\n\\n input.mouse.buttons[0].ended_down && input.mouse.buttons[0].half_transition_count > 0,\\n\\n input.mouse.buttons[1].ended_down && input.mouse.buttons[1].half_transition_count > 0,\\n\\n input.mouse.buttons[2].ended_down && input.mouse.buttons[2].half_transition_count > 0,\\n\\n input.mouse.buttons[3].ended_down && input.mouse.buttons[3].half_transition_count > 0,\\n\\n input.mouse.buttons[4].ended_down && input.mouse.buttons[4].half_transition_count > 0,\\n\",\n \"file_path\": \"src/mouse_capture.rs\",\n \"rank\": 25,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn monster_damage_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = vec![];\\n\\n for (monster, damage, entity) in ecs.read2::<Monster, DamageDealt>() {\\n\\n mutations.push(Box::new(MonsterDamageMutation {monster: entity, damage: damage.damage}));\\n\\n }\\n\\n return mutations;\\n\\n}\",\n \"file_path\": \"sandbox/src/monster.rs\",\n \"rank\": 26,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn turret_attack_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = vec![];\\n\\n let dt = ecs.read_res::<GameInput>().seconds_to_advance_over_update;\\n\\n\\n\\n let mut monster_positions: Vec<(Entity, f32, f32)> = vec![];\\n\\n for (monster, entity) in ecs.read1::<Monster>() {\\n\\n monster_positions.push((entity, monster.x, monster.y));\\n\\n }\\n\\n\\n\\n let input = ecs.read_res::<GameInput>();\\n\\n for (turret, e) in ecs.read1::<Turret>() {\\n\\n let mut closest: Option<(Entity, f32)> = None;\\n\\n for (monster, x, y) in &monster_positions {\\n\\n let (x, y) = (turret.x - x, turret.y - y);\\n\\n let dist = (x * x + y * y).sqrt();\\n\\n\\n\\n if let Some((_, closest_dist)) = closest {\\n\\n if dist < closest_dist {\\n\\n closest = Some((monster.clone(), dist));\\n\\n }\\n\",\n \"file_path\": \"sandbox/src/building.rs\",\n \"rank\": 27,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn monster_move_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = Vec::new();\\n\\n for monster in ecs.get1::<Monster>() {\\n\\n mutations.push(Box::new(MonsterMoveMutation {monster}));\\n\\n }\\n\\n return mutations;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/monster.rs\",\n \"rank\": 28,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn spawner_blink_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations = vec![];\\n\\n return mutations;\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct WaveSpec {\\n\\n pub monsters: Vec<MonsterSpec>,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub struct MonsterSpec {\\n\\n pub monster_type: MonsterType,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub enum MonsterType {\\n\\n Wolf,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/spawners.rs\",\n \"rank\": 29,\n \"score\": 138116.1915894177\n },\n {\n \"content\": \"pub fn menu_mouse_system(ecs: &ECS) -> Mutations {\\n\\n let menu = ecs.read_res::<MenuScreen>();\\n\\n let mut mutations: Mutations = vec![];\\n\\n for (capture_area, button, entity) in ecs.read2::<MouseCaptureArea, MainMenuButtonId>() {\\n\\n if capture_area.clicked_buttons[0] {\\n\\n mutations.push(Box::new(MenuClickMutation {\\n\\n buttonid: *button,\\n\\n }));\\n\\n }\\n\\n }\\n\\n return mutations;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main_menu.rs\",\n \"rank\": 30,\n \"score\": 135842.440884383\n },\n {\n \"content\": \"pub fn start_menu_mouse_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = vec![];\\n\\n for (capture_area, button, entity) in ecs.read2::<MouseCaptureArea, StartMenuButtonId>() {\\n\\n if capture_area.clicked_buttons[0] {\\n\\n mutations.push(Box::new(MenuClickMutation {\\n\\n buttonid: *button,\\n\\n }));\\n\\n }\\n\\n }\\n\\n return mutations;\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"sandbox/src/start_menu.rs\",\n \"rank\": 31,\n \"score\": 133672.41213409457\n },\n {\n \"content\": \"pub fn u32_from_bytes(bytes: [u8; 4]) -> u32 {\\n\\n ((bytes[0] as u32) << 24)\\n\\n + ((bytes[1] as u32) << 16)\\n\\n + ((bytes[2] as u32) << 8)\\n\\n + ((bytes[3] as u32) << 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 32,\n \"score\": 120190.87168979071\n },\n {\n \"content\": \"fn win32_process_xinput_stick_values(value: f32, dead_zone_threshold: f32) -> f32 {\\n\\n if value < -dead_zone_threshold {\\n\\n return (value + dead_zone_threshold) / (32768f32 - dead_zone_threshold);\\n\\n } else if value > dead_zone_threshold {\\n\\n return (value - dead_zone_threshold) / (32767f32 - dead_zone_threshold);\\n\\n } else {\\n\\n return 0f32;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/platform/win32/win32_input.rs\",\n \"rank\": 33,\n \"score\": 115425.66916529271\n },\n {\n \"content\": \"fn parse_chunk(c: &Vec<u8>, i: usize) -> Chunk {\\n\\n let length = u32_from_bytes([c[i], c[i + 1], c[i + 2], c[i + 3]]);\\n\\n let mut chunk_type = String::from(\\\"\\\");\\n\\n chunk_type.push(c[i + 4].into());\\n\\n chunk_type.push(c[i + 5].into());\\n\\n chunk_type.push(c[i + 6].into());\\n\\n chunk_type.push(c[i + 7].into());\\n\\n\\n\\n let mut bytes = vec![];\\n\\n for j in 0..length {\\n\\n let byte = c[i + 8 + j as usize];\\n\\n bytes.push(byte);\\n\\n }\\n\\n\\n\\n return Chunk {\\n\\n length,\\n\\n chunk_type,\\n\\n chunk_data: bytes,\\n\\n crc: 0,\\n\\n }\\n\\n}\",\n \"file_path\": \"src/images/png.rs\",\n \"rank\": 34,\n \"score\": 110122.09033924865\n },\n {\n \"content\": \"pub fn osx_process_key(\\n\\n keyboard: &mut KeyboardInput,\\n\\n u16_char: u16,\\n\\n key_down: bool,\\n\\n _alt_down: bool,\\n\\n _ctrl_down: bool,\\n\\n cmd_down: bool,\\n\\n) {\\n\\n match u16_char {\\n\\n 0xF700 => {\\n\\n osx_process_keyboard_message(&mut keyboard.special_keys[SpecialKeys::UpArrow], key_down)\\n\\n }\\n\\n 0xF701 => osx_process_keyboard_message(\\n\\n &mut keyboard.special_keys[SpecialKeys::DownArrow],\\n\\n key_down,\\n\\n ),\\n\\n 0xF702 => osx_process_keyboard_message(\\n\\n &mut keyboard.special_keys[SpecialKeys::LeftArrow],\\n\\n key_down,\\n\\n ),\\n\",\n \"file_path\": \"src/platform/osx/osx_input.rs\",\n \"rank\": 35,\n \"score\": 108179.3197929227\n },\n {\n \"content\": \"type XInputGetStateFunc = unsafe extern \\\"system\\\" fn(DWORD, *mut XINPUT_STATE) -> DWORD;\\n\",\n \"file_path\": \"src/platform/win32/window.rs\",\n \"rank\": 36,\n \"score\": 106729.24889623598\n },\n {\n \"content\": \"type XInputSetStateFunc = unsafe extern \\\"system\\\" fn(DWORD, *mut XINPUT_VIBRATION) -> DWORD;\\n\\nstatic mut OPT_XINPUT_GET_STATE_FUNC: Option<XInputGetStateFunc> = None;\\n\\nstatic mut OPT_XINPUT_SET_STATE_FUNC: Option<XInputSetStateFunc> = None;\\n\\n\\n\",\n \"file_path\": \"src/platform/win32/window.rs\",\n \"rank\": 37,\n \"score\": 106729.24889623598\n },\n {\n \"content\": \"pub fn generate_days() -> Vec<GameDay> {\\n\\n return vec![\\n\\n GameDay {day_length: 5., night_length: 20., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 15]}}]},\\n\\n GameDay {day_length: 5., night_length: 30., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 20]}}]},\\n\\n GameDay {day_length: 5., night_length: 40., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 25]}}]},\\n\\n GameDay {day_length: 5., night_length: 50., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 30]}}]},\\n\\n GameDay {day_length: 5., night_length: 60., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 35]}}]},\\n\\n GameDay {day_length: 5., night_length: 70., waves: vec![SpawnerSpec {wave: WaveSpec {monsters: vec![MonsterSpec {monster_type: Wolf}; 40]}}]},\\n\\n ]\\n\\n}\\n\",\n \"file_path\": \"sandbox/src/spawners.rs\",\n \"rank\": 38,\n \"score\": 102282.5814553553\n },\n {\n \"content\": \"pub fn u16_from_bytes(bytes: [u8; 2]) -> u16 {\\n\\n ((bytes[0] as u16) << 8) + ((bytes[1] as u16) << 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 39,\n \"score\": 99504.79260700247\n },\n {\n \"content\": \"pub fn i16_from_bytes(bytes: [u8; 2]) -> i16 {\\n\\n ((bytes[0] as i16) << 8) + ((bytes[1] as i16) << 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 40,\n \"score\": 99504.79260700247\n },\n {\n \"content\": \"struct MissingComponentError;\\n\\n\\n\\nimpl From<&str> for MissingComponentError {\\n\\n fn from(_: &str) -> MissingComponentError {\\n\\n return MissingComponentError;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ECS {\\n\\n pub fn add_system(&mut self, system: Box<System>) {\\n\\n self.systems.push(system);\\n\\n }\\n\\n\\n\\n pub fn clear_systems(&mut self) {\\n\\n self.systems.clear();\\n\\n }\\n\\n\\n\\n pub fn register_component_type<T: 'static + Debug>(&mut self) {\\n\\n let e: EntityMap<T> = EntityMap::new();\\n\\n self.components.insert(e);\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 41,\n \"score\": 98813.50985845883\n },\n {\n \"content\": \"pub trait Mutation {\\n\\n fn apply(&self, ecs: &mut ECS);\\n\\n}\\n\\n\\n\\npub type Mutations = Vec<Box<dyn Mutation>>;\\n\\npub type System = dyn Fn(&ECS) -> Mutations;\\n\\npub type GameStateId = u32;\\n\\n\\n\\n\\n\\npub struct ECS {\\n\\n entity_allocator: GenIndexAllocator,\\n\\n components: AnyMap,\\n\\n resources: AnyMap,\\n\\n systems: Vec<Box<System>>,\\n\\n queued_events: AnyMap,\\n\\n processing_events: AnyMap,\\n\\n}\\n\\n\\n\\n#[macro_use]\\n\\nmacro_rules! impl_read {\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 42,\n \"score\": 97194.20469626153\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct ArrayEntry<T> {\\n\\n value: T,\\n\\n generation: u64,\\n\\n}\\n\\n\\n\\npub struct GenIndexArray<T>(Vec<Option<ArrayEntry<T>>>);\\n\\n\\n\\nimpl<T> GenIndexArray<T> {\\n\\n pub fn new() -> GenIndexArray<T> {\\n\\n GenIndexArray(Vec::new())\\n\\n }\\n\\n\\n\\n pub fn set(&mut self, index: GenIndex, value: T) {\\n\\n while index.index >= self.0.len() {\\n\\n self.0.push(None);\\n\\n }\\n\\n let entry = self.0.get_mut(index.index).unwrap();\\n\\n *entry = Some(ArrayEntry {value, generation: index.generation})\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 43,\n \"score\": 96727.8481813819\n },\n {\n \"content\": \"#[derive(Eq, PartialEq, Clone)]\\n\\nstruct GenIndexAllocationEntry {\\n\\n is_free: bool,\\n\\n generation: u64,\\n\\n}\\n\\n\\n\\n#[derive(Eq, PartialEq, Clone)]\\n\\npub struct GenIndexAllocator {\\n\\n entries: Vec<GenIndexAllocationEntry>,\\n\\n free: Vec<usize>,\\n\\n}\\n\\n\\n\\nimpl GenIndexAllocator {\\n\\n pub fn new() -> GenIndexAllocator {\\n\\n GenIndexAllocator {\\n\\n entries: Vec::new(),\\n\\n free: Vec::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn allocate(&mut self) -> GenIndex {\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 44,\n \"score\": 96697.53296420666\n },\n {\n \"content\": \"pub trait GameWindowImpl {\\n\\n fn capture_events(&mut self) -> Vec<WindowEvent>;\\n\\n fn capture_input(&mut self) -> GameInput;\\n\\n fn get_width(&self) -> usize;\\n\\n fn get_height(&self) -> usize;\\n\\n}\\n\\n\\n\\npub struct WindowProps {\\n\\n pub width: f64,\\n\\n pub height: f64,\\n\\n pub title: String,\\n\\n pub target_ms_per_frame: f32,\\n\\n}\\n\\n\\n\\npub enum WindowEvent {\\n\\n ResizeEvent {width: f32, height: f32},\\n\\n CloseEvent,\\n\\n}\",\n \"file_path\": \"src/window.rs\",\n \"rank\": 45,\n \"score\": 93648.94248241308\n },\n {\n \"content\": \"fn mouse_cursor_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = vec![];\\n\\n let mut any_hovered = false;\\n\\n for (tile, mouse_capture, e) in ecs.read2::<Tile, MouseCaptureArea>() {\\n\\n if mouse_capture.is_hovered {\\n\\n mutations.push(Box::new(CursorSetPositionMutation {tile: e}));\\n\\n any_hovered = true;\\n\\n }\\n\\n }\\n\\n mutations.push(Box::new(CursorVisibilityMutation {visible: any_hovered}));\\n\\n return mutations;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 46,\n \"score\": 90088.44878930994\n },\n {\n \"content\": \"fn mouse_click_system(ecs: &ECS) -> Mutations {\\n\\n let mut mutations: Mutations = Vec::new();\\n\\n for (tile, mouse_capture, tile_e) in ecs.read2::<Tile, MouseCaptureArea>() {\\n\\n if mouse_capture.clicked_buttons[0] {\\n\\n mutations.push(Box::new(TurretDeselectMutation{}));\\n\\n if !tile.occupied {\\n\\n println!(\\\"Unoccupied\\\");\\n\\n mutations.push(Box::new(CreateTurretMutation{tile_e}));\\n\\n } else {\\n\\n println!(\\\"Occupied\\\");\\n\\n for (turret, e) in ecs.read1::<Turret>() {\\n\\n if turret.x == tile.x as f32 && turret.y == tile.y as f32 && !turret.selected {\\n\\n println!(\\\"Mutating\\\");\\n\\n mutations.push(Box::new(TurretSelectMutation{turret_e: e}));\\n\\n }\\n\\n }\\n\\n\\n\\n for (tree, e) in ecs.read1::<Tree>() {\\n\\n if tree.x == tile.x as f32 && tree.y == tile.y as f32 {\\n\\n mutations.push(Box::new(TreeHarvestMutation {tree: e}))\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n return mutations;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 47,\n \"score\": 90088.44878930994\n },\n {\n \"content\": \"fn day_state_countdown(ecs: &ECS) -> Mutations {\\n\\n let input = ecs.read_res::<GameInput>();\\n\\n return vec![Box::new(StateCountdownMutation {dt: input.seconds_to_advance_over_update})];\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 48,\n \"score\": 90088.44878930994\n },\n {\n \"content\": \"fn update_buffer<T>(buffer: &Buffer, mut data: Vec<T>) {\\n\\n unsafe {\\n\\n std::ptr::copy(data.as_mut_ptr(), mem::transmute(buffer.contents()), data.len());\\n\\n };\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct IndexBuffer {\\n\\n pub data: Buffer,\\n\\n}\\n\\n\\n\\nimpl IndexBuffer {\\n\\n pub fn new(renderer: &Renderer, indices: Vec<i16>) -> IndexBuffer {\\n\\n return IndexBuffer {\\n\\n data: create_buffer(renderer, indices),\\n\\n };\\n\\n }\\n\\n\\n\\n pub fn bind(&self, scene: &Scene) {\\n\\n\\n\",\n \"file_path\": \"src/platform/metal/buffers.rs\",\n \"rank\": 49,\n \"score\": 88918.50287650057\n },\n {\n \"content\": \"fn create_buffer<T>(renderer: &Renderer, data: Vec<T>) -> Buffer {\\n\\n let buffer = renderer.device.new_buffer_with_data(\\n\\n unsafe { mem::transmute(data.as_ptr()) },\\n\\n (data.len() * mem::size_of::<T>()) as u64,\\n\\n MTLResourceOptions::CPUCacheModeDefaultCache,\\n\\n );\\n\\n return buffer;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/platform/metal/buffers.rs\",\n \"rank\": 50,\n \"score\": 81195.97706171847\n },\n {\n \"content\": \"fn prepare_render_pass_descriptor(descriptor: &RenderPassDescriptorRef, texture: &TextureRef) {\\n\\n let color_attachment = descriptor.color_attachments().object_at(0).unwrap();\\n\\n\\n\\n color_attachment.set_texture(Some(texture));\\n\\n color_attachment.set_load_action(MTLLoadAction::Clear);\\n\\n color_attachment.set_clear_color(MTLClearColor::new(0.2, 0.2, 0.2, 1.0));\\n\\n color_attachment.set_store_action(MTLStoreAction::Store);\\n\\n}\\n\\n\\n\\npub struct Renderer {\\n\\n device: Device,\\n\\n layer: CoreAnimationLayer,\\n\\n command_queue: CommandQueue,\\n\\n width: usize,\\n\\n height: usize,\\n\\n drawables: Vec<Box<Drawable>>,\\n\\n}\\n\\n\\n\\nimpl Renderer {\\n\\n pub fn new(window: &mut OsxWindow) -> Self {\\n\",\n \"file_path\": \"src/platform/metal/mod.rs\",\n \"rank\": 51,\n \"score\": 80081.13271193411\n },\n {\n \"content\": \"use crate::rendering::shader::Shader;\\n\\nuse crate::rendering::buffers::{VertexBuffer, IndexBuffer, VertexConstantBuffer, FragmentConstantBuffer};\\n\\nuse crate::rendering::{Scene, Renderer};\\n\\nuse crate::input::{GameInput, LetterKeys};\\n\\nuse crate::math::{create_transformation_matrix, create_projection_matrix, create_view_matrix, Mat4x4};\\n\\nuse crate::rendering::texture::RenderableTexture;\\n\\nuse crate::ecs::Entity;\\n\\nuse crate::{RenderLayer, RenderOrder};\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct TextureDrawable {\\n\\n pub vertex_buffer: VertexBuffer<[f32; 6]>,\\n\\n pub index_buffer: IndexBuffer,\\n\\n pub transform_buffer: VertexConstantBuffer<f32>,\\n\\n pub shader: Shader,\\n\\n pub identity_buffer: VertexConstantBuffer<f32>,\\n\\n pub texture: RenderableTexture,\\n\\n pub position: [f32; 3],\\n\\n pub scale: [f32; 3],\\n\\n pub rotation: [f32; 3],\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 52,\n \"score\": 76129.55903535528\n },\n {\n \"content\": \"\\n\\n scene.draw_indexed(6, &self.index_buffer);\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct QuadDrawable {\\n\\n pub vertex_buffer: VertexBuffer<[f32; 4]>,\\n\\n pub index_buffer: IndexBuffer,\\n\\n pub transform_buffer: VertexConstantBuffer<f32>,\\n\\n pub shader: Shader,\\n\\n pub color_buffer: FragmentConstantBuffer<f32>,\\n\\n pub identity_buffer: VertexConstantBuffer<f32>,\\n\\n pub position: [f32; 3],\\n\\n pub scale: [f32; 3],\\n\\n pub rotation: [f32; 3],\\n\\n}\\n\\n\\n\\nimpl QuadDrawable {\\n\\n pub fn new(is_gui: bool, renderer: &Renderer, color: [f32; 3], position: [f32; 3], scale: [f32; 3], rotation: [f32; 3]) -> Self {\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 53,\n \"score\": 76127.50177101564\n },\n {\n \"content\": \" self.update_transform(renderer);\\n\\n }\\n\\n\\n\\n pub fn set_rotation(&mut self, renderer: &Renderer, rotation: [f32; 3]) {\\n\\n self.rotation = rotation;\\n\\n self.update_transform(renderer);\\n\\n }\\n\\n\\n\\n fn update_transform(&self, renderer: &Renderer) {\\n\\n let transform_mat = create_transformation_matrix(self.position, self.rotation, self.scale);\\n\\n self.transform_buffer.update_data(renderer, transform_mat.to_vec());\\n\\n }\\n\\n\\n\\n pub fn draw_with_projection(&self, scene: &Scene, camera_projection: &VertexConstantBuffer<f32>) {\\n\\n camera_projection.bind_to_offset(scene, 1);\\n\\n self.draw_impl(scene);\\n\\n }\\n\\n\\n\\n pub fn draw(&self, scene: &Scene) {\\n\\n self.identity_buffer.bind(scene);\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 54,\n \"score\": 76125.58058595573\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl TextureDrawable {\\n\\n pub fn new(is_gui: bool, renderer: &Renderer, texture: RenderableTexture, position: [f32; 3], scale: [f32; 3], rotation: [f32; 3]) -> Self {\\n\\n let vb = VertexBuffer::new(\\n\\n renderer,\\n\\n 0,\\n\\n vec![\\n\\n [-1., -1., 0., 1., 0., 1.], // bottom left\\n\\n [1., -1., 0., 1., 1., 1.], // bottom right\\n\\n [1., 1., 0., 1., 1., 0.], // top right\\n\\n [-1., 1., 0., 1., 0., 0.], // top left\\n\\n ]);\\n\\n\\n\\n let ib = IndexBuffer::new(\\n\\n renderer,\\n\\n vec![\\n\\n 0, 3, 2,\\n\\n 0, 1, 2,\\n\\n ]);\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 55,\n \"score\": 76125.12513241221\n },\n {\n \"content\": \" rotation,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_position(&mut self, renderer: &Renderer, position: [f32; 3]) {\\n\\n self.position = position;\\n\\n self.update_transform(renderer);\\n\\n }\\n\\n\\n\\n pub fn set_scale(&mut self, renderer: &Renderer, scale: [f32; 3]) {\\n\\n self.scale = scale;\\n\\n self.update_transform(renderer);\\n\\n }\\n\\n\\n\\n pub fn set_rotation(&mut self, renderer: &Renderer, rotation: [f32; 3]) {\\n\\n self.rotation = rotation;\\n\\n self.update_transform(renderer);\\n\\n }\\n\\n\\n\\n fn update_transform(&self, renderer: &Renderer) {\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 56,\n \"score\": 76121.64258647189\n },\n {\n \"content\": \" let transform_mat = create_transformation_matrix(self.position, self.rotation, self.scale);\\n\\n self.transform_buffer.update_data(renderer, transform_mat.to_vec());\\n\\n }\\n\\n\\n\\n pub fn draw_with_projection(&self, scene: &Scene, camera_projection: &VertexConstantBuffer<f32>) {\\n\\n camera_projection.bind_to_offset(scene, 1);\\n\\n self.draw_impl(scene);\\n\\n }\\n\\n\\n\\n pub fn draw(&self, scene: &Scene) {\\n\\n self.identity_buffer.bind(scene);\\n\\n self.draw_impl(scene);\\n\\n }\\n\\n\\n\\n fn draw_impl(&self, scene: &Scene) {\\n\\n self.shader.bind(scene);\\n\\n self.vertex_buffer.bind(scene);\\n\\n self.transform_buffer.bind(scene);\\n\\n self.texture.bind(scene);\\n\\n self.index_buffer.bind(scene);\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 57,\n \"score\": 76121.47548278286\n },\n {\n \"content\": \" shader,\\n\\n identity_buffer,\\n\\n position,\\n\\n scale,\\n\\n rotation\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn translate(&self, renderer: &Renderer, position: [f32; 3], scale: [f32; 3]) {\\n\\n let transform_mat = create_transformation_matrix(position, [0., 0., 0.], scale);\\n\\n self.transform_buffer.update_data(renderer, transform_mat.to_vec());\\n\\n }\\n\\n\\n\\n pub fn set_position(&mut self, renderer: &Renderer, position: [f32; 3]) {\\n\\n self.position = position;\\n\\n self.update_transform(renderer);\\n\\n }\\n\\n\\n\\n pub fn set_scale(&mut self, renderer: &Renderer, scale: [f32; 3]) {\\n\\n self.scale = scale;\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 58,\n \"score\": 76120.93923760831\n },\n {\n \"content\": \" self.draw_impl(scene);\\n\\n }\\n\\n\\n\\n fn draw_impl(&self, scene: &Scene) {\\n\\n self.shader.bind(scene);\\n\\n self.vertex_buffer.bind(scene);\\n\\n self.transform_buffer.bind(scene);\\n\\n self.index_buffer.bind(scene);\\n\\n self.color_buffer.bind(&scene);\\n\\n\\n\\n scene.draw_indexed(6, &self.index_buffer);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 59,\n \"score\": 76114.35947302663\n },\n {\n \"content\": \" let vb = VertexBuffer::new(\\n\\n renderer,\\n\\n 0,\\n\\n vec![\\n\\n [-1., -1., 0., 1.], // bottom left\\n\\n [1., -1., 0., 1.], // bottom right\\n\\n [1., 1., 0., 1.], // top right\\n\\n [-1., 1., 0., 1.], // top left\\n\\n ]);\\n\\n\\n\\n let ib = IndexBuffer::new(\\n\\n renderer,\\n\\n vec![\\n\\n 0, 3, 2,\\n\\n 0, 1, 2,\\n\\n ]);\\n\\n\\n\\n let shader = Shader::new(\\n\\n renderer,\\n\\n false,\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 60,\n \"score\": 76109.65894615203\n },\n {\n \"content\": \"\\n\\n let shader = Shader::new(\\n\\n renderer,\\n\\n true,\\n\\n \\\"shaders/textureVertexShader.txt\\\",\\n\\n \\\"shaders/textureFragmentShader.txt\\\");\\n\\n\\n\\n let transform_mat = create_transformation_matrix(position, rotation, scale);\\n\\n let transform_buffer = VertexConstantBuffer::new(renderer, 0, transform_mat.raw_data().to_vec());\\n\\n let identity_buffer = VertexConstantBuffer::new(renderer, 1, Mat4x4::identity().to_vec());\\n\\n\\n\\n return Self {\\n\\n vertex_buffer: vb,\\n\\n index_buffer: ib,\\n\\n transform_buffer,\\n\\n shader,\\n\\n identity_buffer,\\n\\n texture,\\n\\n position,\\n\\n scale,\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 61,\n \"score\": 76109.10742727946\n },\n {\n \"content\": \" \\\"shaders/quadVertexShader.txt\\\",\\n\\n \\\"shaders/quadFragmentShader.txt\\\");\\n\\n\\n\\n let transform_mat = create_transformation_matrix(position, rotation, scale);\\n\\n let transform_buffer = VertexConstantBuffer::new(renderer,0, transform_mat.raw_data().to_vec());\\n\\n\\n\\n let alpha = if is_gui {\\n\\n 0.5\\n\\n } else {\\n\\n 1.0\\n\\n };\\n\\n let data = [color[0], color[1], color[2], alpha];\\n\\n let color_buffer = FragmentConstantBuffer::new(renderer, 0, data.to_vec());\\n\\n\\n\\n let identity_buffer = VertexConstantBuffer::new(renderer, 1, Mat4x4::identity().to_vec());\\n\\n return Self {\\n\\n vertex_buffer: vb,\\n\\n index_buffer: ib,\\n\\n transform_buffer,\\n\\n color_buffer,\\n\",\n \"file_path\": \"src/rendering/drawable.rs\",\n \"rank\": 62,\n \"score\": 76109.01415652134\n },\n {\n \"content\": \"struct Game {\\n\\n}\\n\\n\\n\\nimpl Game {\\n\\n pub fn new() -> Self { Game {} }\\n\\n}\\n\\n\\n\\nimpl GameLogic for Game {\\n\\n fn window_props(&self) -> WindowProps {\\n\\n WindowProps {\\n\\n width: 900.0,\\n\\n height: 900.0,\\n\\n title: \\\"Hearth of Hestia\\\".to_string(),\\n\\n target_ms_per_frame: 30.0,\\n\\n }\\n\\n }\\n\\n\\n\\n fn register_components(&self, ecs: &mut ECS) {\\n\\n ecs.register_component_type::<Tile>();\\n\\n ecs.register_component_type::<Hearth>();\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 63,\n \"score\": 64874.04954698867\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Pos {\\n\\n pub x: f32,\\n\\n pub y: f32,\\n\\n}\\n\\n\\n\\npub struct CreateTurretMutation {\\n\\n tile_e: Entity,\\n\\n}\\n\\n\\n\\nimpl Mutation for CreateTurretMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n if ecs.write_res::<Supplies>().spend_supplies(0, 5, 0) {\\n\\n Turret::create(ecs, self.tile_e);\\n\\n\\n\\n ecs.write::<Tile>(&self.tile_e).unwrap().occupied = true;\\n\\n } else {\\n\\n\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 64,\n \"score\": 64874.04954698867\n },\n {\n \"content\": \"fn create_window(class_name: &str, title: &str, width: u32, height: u32) -> Option<HWND> {\\n\\n let class_name = win32_string(class_name);\\n\\n let title = win32_string(title);\\n\\n\\n\\n let handle_instance = unsafe { GetModuleHandleW(null_mut()) };\\n\\n\\n\\n let window_class = WNDCLASSW {\\n\\n style: CS_OWNDC | CS_HREDRAW | CS_VREDRAW,\\n\\n lpfnWndProc: Some(win32_handle_proc),\\n\\n cbClsExtra: 0,\\n\\n cbWndExtra: 0,\\n\\n hInstance: handle_instance,\\n\\n lpszClassName: class_name.as_ptr(),\\n\\n hIcon: null_mut(),\\n\\n hCursor: null_mut(),\\n\\n hbrBackground: null_mut(),\\n\\n lpszMenuName: null_mut(),\\n\\n };\\n\\n unsafe {\\n\\n match RegisterClassW(&window_class) {\\n\",\n \"file_path\": \"src/platform/win32/window.rs\",\n \"rank\": 65,\n \"score\": 64346.41586174465\n },\n {\n \"content\": \"struct MoveMutation {\\n\\n entity: Entity,\\n\\n dx: i32,\\n\\n dy: i32,\\n\\n}\\n\\n\\n\\nimpl Mutation for MoveMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\\n\\n let player = ecs.read::<Player>(&self.entity).unwrap();\\n\\n let tilemap = ecs.read_res::<Tilemap>();\\n\\n let tile = tilemap.tile_at_pos((player.x + self.dx + 5) as usize, (player.y + self.dy + 3) as usize);\\n\\n\\n\\n let player = ecs.write::<Player>(&self.entity).unwrap();\\n\\n player.move_pos(tile, &renderer, self.dx, self.dy);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/player.rs\",\n \"rank\": 66,\n \"score\": 63738.968434994604\n },\n {\n \"content\": \"type EntityMap<T> = GenIndexArray<T>;\\n\\n\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 67,\n \"score\": 63113.22642760371\n },\n {\n \"content\": \"struct ArrowCollisionMutation {\\n\\n arrow: Entity,\\n\\n}\\n\\n\\n\\nimpl Mutation for ArrowCollisionMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n let arrow = ecs.read::<Arrow>(&self.arrow).unwrap();\\n\\n let target = arrow.target.clone();\\n\\n let damage = arrow.damage;\\n\\n ecs.delete_entity(&self.arrow);\\n\\n\\n\\n ecs.add_component(&target, DamageDealt {damage});\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/building.rs\",\n \"rank\": 68,\n \"score\": 62671.768276851566\n },\n {\n \"content\": \"struct CursorVisibilityMutation {\\n\\n visible: bool,\\n\\n}\\n\\n\\n\\nimpl Mutation for CursorVisibilityMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n ecs.write_res::<Cursor>().set_visible(self.visible);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 69,\n \"score\": 62671.768276851566\n },\n {\n \"content\": \"struct ArrowDestroyMutation {\\n\\n arrow: Entity,\\n\\n}\\n\\n\\n\\nimpl Mutation for ArrowDestroyMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n ecs.delete_entity(&self.arrow);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/building.rs\",\n \"rank\": 70,\n \"score\": 62671.768276851566\n },\n {\n \"content\": \"struct MonsterDamageMutation {\\n\\n monster: Entity,\\n\\n damage: u32,\\n\\n}\\n\\n\\n\\nimpl Mutation for MonsterDamageMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n ecs.remove_component::<DamageDealt>(&self.monster);\\n\\n let monster = ecs.write::<Monster>(&self.monster).unwrap();\\n\\n monster.take_damage(self.damage);\\n\\n if monster.is_dead() {\\n\\n ecs.delete_entity(&self.monster);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/monster.rs\",\n \"rank\": 71,\n \"score\": 62671.768276851566\n },\n {\n \"content\": \"struct MoveArrowTowardsMutation {\\n\\n arrow: Entity,\\n\\n dx: f32,\\n\\n dy: f32,\\n\\n}\\n\\n\\n\\nimpl Mutation for MoveArrowTowardsMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\\n\\n let arrow = ecs.write::<Arrow>(&self.arrow).unwrap();\\n\\n arrow.change_pos(&renderer, self.dx, self.dy);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/building.rs\",\n \"rank\": 72,\n \"score\": 61666.536661780236\n },\n {\n \"content\": \"struct CursorSetPositionMutation {\\n\\n tile: Entity,\\n\\n}\\n\\n\\n\\nimpl Mutation for CursorSetPositionMutation {\\n\\n fn apply(&self, ecs: &mut ECS) {\\n\\n let tile = ecs.read::<Tile>(&self.tile).unwrap();\\n\\n let (x, y) = (tile.x, tile.y);\\n\\n\\n\\n let renderer = ecs.read_res::<Rc<Renderer>>().clone();\\n\\n let cursor = ecs.write_res::<Cursor>();\\n\\n cursor.set_pos(&renderer, [x as f32, y as f32, 0.]);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 73,\n \"score\": 61666.536661780236\n },\n {\n \"content\": \"struct CocoaEventQueue {\\n\\n\\n\\n}\\n\\n\\n\\nimpl CocoaEventQueue {\\n\\n\\n\\n pub fn new() -> CocoaEventQueue {\\n\\n CocoaEventQueue {}\\n\\n }\\n\\n\\n\\n pub fn queue_resize_event(&mut self, width: f32, height: f32) {\\n\\n\\n\\n }\\n\\n\\n\\n pub fn queue_close_event(&mut self) {\\n\\n\\n\\n }\\n\\n}\\n\\n\\n\\npub struct OsxWindow {\\n\",\n \"file_path\": \"src/platform/osx/osx_window.rs\",\n \"rank\": 74,\n \"score\": 60718.0284321004\n },\n {\n \"content\": \"pub trait GameLogic {\\n\\n fn window_props(&self) -> WindowProps;\\n\\n fn register_components(&self, ecs: &mut ECS);\\n\\n fn cleanup_components(&self, ecs: &mut ECS);\\n\\n fn register_events(&self, ecs: &mut ECS);\\n\\n fn migrate_events(&self, ecs: &mut ECS);\\n\\n fn game_states(&self) -> HashMap<GameStateId, Box<dyn GameState>>;\\n\\n fn initial_game_state(&self) -> GameStateId;\\n\\n fn setup(&mut self, ecs: &mut ECS);\\n\\n}\\n\\n\\n\\npub struct Gouda<T: GameLogic> {\\n\\n game_logic: T,\\n\\n ecs: ECS,\\n\\n game_states: HashMap<GameStateId, Box<dyn GameState>>,\\n\\n active_state: Option<GameStateId>,\\n\\n}\\n\\n\\n\\nimpl<T: GameLogic> Gouda<T> {\\n\\n pub fn new(game_logic: T) -> Self {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 75,\n \"score\": 59878.10462002457\n },\n {\n \"content\": \"pub trait GameState {\\n\\n fn on_state_start(&self, ecs: &mut ECS);\\n\\n fn on_state_stop(&self, ecs: &mut ECS);\\n\\n fn render_state(&self, ecs: &ECS, scene: &Scene);\\n\\n fn next_state(&self, ecs: &ECS) -> Option<GameStateId>;\\n\\n fn active_layers(&self) -> Vec<RenderLayer>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 76,\n \"score\": 59878.10462002457\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct ConstantBuffer<T> {\\n\\n buffer: *mut ID3D11Buffer,\\n\\n phantom: PhantomData<T>,\\n\\n}\\n\\n\\n\\nimpl <T> ConstantBuffer<T> {\\n\\n pub fn new(renderer: &Renderer, data: Vec<T>) -> ConstantBuffer<T> {\\n\\n println!(\\\"Creating constant buffer\\\");\\n\\n unsafe {\\n\\n let constant_buffer_desc = D3D11_BUFFER_DESC {\\n\\n ByteWidth: (size_of::<T>() * data.len()) as u32,\\n\\n Usage: D3D11_USAGE_DYNAMIC,\\n\\n BindFlags: D3D11_BIND_CONSTANT_BUFFER,\\n\\n CPUAccessFlags: D3D11_CPU_ACCESS_WRITE,\\n\\n MiscFlags: 0,\\n\\n StructureByteStride: size_of::<T>() as u32,\\n\\n };\\n\\n let subresource_data = D3D11_SUBRESOURCE_DATA {\\n\\n pSysMem: mem::transmute(data.as_ptr()),\\n\\n SysMemPitch: 0,\\n\",\n \"file_path\": \"src/platform/d3d/buffers.rs\",\n \"rank\": 77,\n \"score\": 59580.8749847033\n },\n {\n \"content\": \"fn main() {\\n\\n let mut gouda = Gouda::new(Game::new());\\n\\n gouda.run();\\n\\n}\\n\",\n \"file_path\": \"sandbox/src/main.rs\",\n \"rank\": 78,\n \"score\": 58827.85348068943\n },\n {\n \"content\": \"fn win32_load_xinput() {\\n\\n unsafe {\\n\\n let dll_14 = win32_string(\\\"xinput1_4.dll\\\");\\n\\n let mut xinput_lib = LoadLibraryW(dll_14.as_ptr());\\n\\n\\n\\n if xinput_lib.is_null() {\\n\\n let dll_910 = win32_string(\\\"xinput9_1_0.dll\\\");\\n\\n xinput_lib = LoadLibraryW(dll_910.as_ptr());\\n\\n }\\n\\n\\n\\n if xinput_lib.is_null() {\\n\\n let dll_13 = win32_string(\\\"xinput1_3.dll\\\");\\n\\n xinput_lib = LoadLibraryW(dll_13.as_ptr());\\n\\n }\\n\\n\\n\\n if !xinput_lib.is_null() {\\n\\n let get_state_name_c = CString::new(\\\"XInputGetState\\\").unwrap();\\n\\n let get_state_ptr = GetProcAddress(xinput_lib, get_state_name_c.as_ptr());\\n\\n OPT_XINPUT_GET_STATE_FUNC = Some(\\n\\n transmute::<*mut __some_function, XInputGetStateFunc>(get_state_ptr),\\n\",\n \"file_path\": \"src/platform/win32/window.rs\",\n \"rank\": 79,\n \"score\": 55687.16309675046\n },\n {\n \"content\": \"fn win32_process_xinput_digital_button(\\n\\n xinput_button_state: u16,\\n\\n old_state: &GameButtonState,\\n\\n new_state: &mut GameButtonState,\\n\\n button_bit: u16,\\n\\n) {\\n\\n new_state.ended_down = (xinput_button_state & button_bit) == button_bit;\\n\\n new_state.half_transition_count = if old_state.ended_down != new_state.ended_down {\\n\\n 1\\n\\n } else {\\n\\n 0\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/platform/win32/win32_input.rs\",\n \"rank\": 80,\n \"score\": 53049.744294844175\n },\n {\n \"content\": \"fn create_menu_bar(title: &String) {\\n\\n unsafe {\\n\\n let app_name = NSString::alloc(nil).init_str(title);\\n\\n let menu_bar = NSMenu::new(nil).autorelease();\\n\\n let app_menu_item = NSMenuItem::new(nil).autorelease();\\n\\n menu_bar.addItem_(app_menu_item);\\n\\n\\n\\n NSApp().setMainMenu_(menu_bar);\\n\\n\\n\\n let app_menu = NSMenu::new(nil).autorelease();\\n\\n let quit_prefix = NSString::alloc(nil).init_str(\\\"Quit \\\");\\n\\n let quit_title = quit_prefix.stringByAppendingString_(app_name);\\n\\n let quit_action = selector(\\\"terminate:\\\");\\n\\n let quit_key = NSString::alloc(nil).init_str(\\\"q\\\");\\n\\n let quit_menu_item = NSMenuItem::alloc(nil)\\n\\n .initWithTitle_action_keyEquivalent_(quit_title, quit_action, quit_key)\\n\\n .autorelease();\\n\\n app_menu.addItem_(quit_menu_item);\\n\\n app_menu_item.setSubmenu_(app_menu);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/platform/osx/osx_window.rs\",\n \"rank\": 81,\n \"score\": 49897.882000651065\n },\n {\n \"content\": \"fn win32_string(value: &str) -> Vec<u16> {\\n\\n OsStr::new(value).encode_wide().chain(once(0)).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/platform/d3d/shader.rs\",\n \"rank\": 82,\n \"score\": 47512.51627879045\n },\n {\n \"content\": \"fn win32_string(value: &str) -> Vec<u16> {\\n\\n OsStr::new(value).encode_wide().chain(once(0)).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/platform/win32/window.rs\",\n \"rank\": 83,\n \"score\": 47512.51627879045\n },\n {\n \"content\": \"fn win32_string_short(value: &str) -> Vec<i8> {\\n\\n let wstr = win32_string(value);\\n\\n let mut result = vec![];\\n\\n for c in wstr {\\n\\n result.push(c as i8);\\n\\n }\\n\\n return result;\\n\\n}\\n\\n\\n\\nimpl Shader {\\n\\n pub fn new(renderer: &Renderer, has_textures: bool, vertex_file: &str, fragment_file: &str) -> Shader {\\n\\n return Shader {\\n\\n vertex_shader: VertexShader::new(renderer, has_textures, vertex_file),\\n\\n fragment_shader: FragmentShader::new(renderer, fragment_file),\\n\\n };\\n\\n }\\n\\n\\n\\n pub fn bind(&self, scene: &Scene) {\\n\\n self.vertex_shader.bind(scene);\\n\\n self.fragment_shader.bind(scene);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::fmt::Debug for Shader {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error> {\\n\\n return Ok(());\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/platform/d3d/shader.rs\",\n \"rank\": 84,\n \"score\": 46724.85060438703\n },\n {\n \"content\": \"fn collect_elements(line: &String) -> HashMap<String, String> {\\n\\n let mut result = HashMap::new();\\n\\n let lines: Vec<&str> = line.split_whitespace().collect();\\n\\n for line in lines {\\n\\n let split: Vec<&str> = line.split(\\\"=\\\").collect();\\n\\n if split.len() == 2 {\\n\\n result.insert(String::from(split[0]), String::from(split[1]));\\n\\n }\\n\\n }\\n\\n return result;\\n\\n}\\n\\n\\n\\nimpl Font {\\n\\n\\n\\n pub fn new(renderer: &Renderer, font_file_path: &str, font_png_path: &str) -> Font {\\n\\n let font_file = File::open(font_file_path).unwrap();\\n\\n let mut font_file_reader = BufReader::new(font_file);\\n\\n\\n\\n let mut font_entries = Vec::new();\\n\\n let mut line_iter = font_file_reader.lines().filter_map(|result| result.ok());\\n\",\n \"file_path\": \"src/font.rs\",\n \"rank\": 85,\n \"score\": 46524.9009443627\n },\n {\n \"content\": \" return None;\\n\\n }\\n\\n\\n\\n pub fn write<T: 'static>(&mut self, entity: &Entity) -> Option<&mut T>{\\n\\n if let Some(map) = self.components.get_mut::<EntityMap<T>>() {\\n\\n if let Some(Some(val)) = map.0.get_mut(entity.index) {\\n\\n return Some(&mut val.value);\\n\\n }\\n\\n }\\n\\n return None;\\n\\n }\\n\\n\\n\\n impl_read!(read1, [t1]);\\n\\n impl_read!(read2, [t1, t2]);\\n\\n impl_read!(read3, [t1, t2, t3]);\\n\\n impl_read!(read4, [t1, t2, t3, t4]);\\n\\n impl_read!(read5, [t1, t2, t3, t4, t5]);\\n\\n\\n\\n impl_get!(get1, [t1]);\\n\\n impl_get!(get2, [t1, t2]);\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 86,\n \"score\": 38668.49255128113\n },\n {\n \"content\": \"}\\n\\n\\n\\npub struct EntityBuilder<'a> {\\n\\n ecs: &'a mut ECS,\\n\\n entity: Entity,\\n\\n}\\n\\n\\n\\nimpl <'a> EntityBuilder<'a> {\\n\\n pub fn add<T: 'static + Debug>(mut self, c: T) -> EntityBuilder<'a> {\\n\\n self.ecs.add_component(&self.entity, c);\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn entity(&mut self) -> Entity {\\n\\n self.entity.clone()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 87,\n \"score\": 38668.381093147815\n },\n {\n \"content\": \" self.resources.get::<T>().unwrap()\\n\\n }\\n\\n\\n\\n pub fn write_res<T: 'static>(&mut self) -> &mut T {\\n\\n self.resources.get_mut::<T>().unwrap()\\n\\n }\\n\\n\\n\\n pub fn read<T: 'static>(&self, entity: &Entity) -> Option<&T>{\\n\\n let i = self.components.get::<EntityMap<T>>().unwrap().0.get(entity.index);\\n\\n match i {\\n\\n Some(i) => {\\n\\n match i {\\n\\n Some(i) => {\\n\\n return Some(&i.value);\\n\\n },\\n\\n None => {}\\n\\n }\\n\\n }\\n\\n None => {}\\n\\n }\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 88,\n \"score\": 38666.60238222991\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[macro_use]\\n\\nmacro_rules! impl_get {\\n\\n ( $fn_name:ident, [$($r:ident),*] ) => {\\n\\n pub fn $fn_name<$($r: 'static),*>(&self) -> Vec<Entity> {\\n\\n\\n\\n let mut minlen = 1000;\\n\\n $(\\n\\n let $r = self.components.get::<EntityMap<$r>>().unwrap();\\n\\n minlen = std::cmp::min(minlen, $r.0.len());\\n\\n )*\\n\\n\\n\\n let mut res = Vec::new();\\n\\n let num_iter = minlen;\\n\\n for i in 0..num_iter {\\n\\n $(\\n\\n let $r = $r.0.get(i);\\n\\n )*\\n\\n match ($($r),*) {\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 89,\n \"score\": 38663.72194583364\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn run_systems(&mut self) {\\n\\n let num_systems = self.systems.len();\\n\\n for i in 0..num_systems {\\n\\n let mutations = self.systems[i](&self);\\n\\n for mutation in mutations {\\n\\n mutation.apply(self);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn new_entity(&mut self) -> Entity {\\n\\n self.entity_allocator.allocate()\\n\\n }\\n\\n\\n\\n pub fn build_entity(&mut self) -> EntityBuilder {\\n\\n let e = self.entity_allocator.allocate();\\n\\n EntityBuilder {\\n\\n ecs: self,\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 90,\n \"score\": 38663.590876928705\n },\n {\n \"content\": \" entity: e,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn delete_entity(&mut self, entity: &Entity) {\\n\\n self.entity_allocator.deallocate(entity.clone());\\n\\n }\\n\\n\\n\\n pub fn add_component<T: 'static + Debug>(&mut self, entity: &Entity, component: T) {\\n\\n let comps = self.components.get_mut::<EntityMap<T>>();\\n\\n match comps {\\n\\n Some(comps) => {\\n\\n comps.set(*entity, component);\\n\\n },\\n\\n None => {}\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn remove_component<T: 'static + Debug>(&mut self, entity: &Entity) {\\n\\n let comps = self.components.get_mut::<EntityMap<T>>();\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 91,\n \"score\": 38663.41043359218\n },\n {\n \"content\": \" },\\n\\n None => { None }\\n\\n }\\n\\n },\\n\\n None => { None }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_mut(&mut self, index: GenIndex) -> Option<&mut T> {\\n\\n let entry = self.0.get_mut(index.index);\\n\\n match entry {\\n\\n Some(entry) => {\\n\\n match entry {\\n\\n Some(entry) => {\\n\\n if entry.generation == index.generation {\\n\\n Some(&mut entry.value)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 92,\n \"score\": 38663.10145276559\n },\n {\n \"content\": \" pub fn clear(&mut self, index: GenIndex) {\\n\\n if index.index >= self.0.len() {\\n\\n return;\\n\\n }\\n\\n let entry = self.0.get_mut(index.index).unwrap();\\n\\n *entry = None;\\n\\n }\\n\\n\\n\\n pub fn get(&self, index: GenIndex) -> Option<&T> {\\n\\n let entry = self.0.get(index.index);\\n\\n match entry {\\n\\n Some(entry) => {\\n\\n match entry {\\n\\n Some(entry) => {\\n\\n if entry.generation == index.generation {\\n\\n Some(&entry.value)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 93,\n \"score\": 38661.609976275155\n },\n {\n \"content\": \" impl_get!(get3, [t1, t2, t3]);\\n\\n impl_get!(get4, [t1, t2, t3, t4]);\\n\\n impl_get!(get5, [t1, t2, t3, t4, t5]);\\n\\n\\n\\n pub fn new() -> ECS {\\n\\n ECS {\\n\\n entity_allocator: GenIndexAllocator::new(),\\n\\n components: AnyMap::new(),\\n\\n resources: AnyMap::new(),\\n\\n systems: Vec::new(),\\n\\n queued_events: AnyMap::new(),\\n\\n processing_events: AnyMap::new(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for ECS {\\n\\n fn default() -> Self {\\n\\n ECS::new()\\n\\n }\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 94,\n \"score\": 38661.33268381838\n },\n {\n \"content\": \" match comps {\\n\\n Some(comps) => {\\n\\n comps.clear(*entity);\\n\\n },\\n\\n None => {}\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn cleanup_components<T: 'static + Debug>(&mut self) {\\n\\n let mut comps_to_remove = vec![];\\n\\n if let Some(comps) = self.components.get::<EntityMap<T>>() {\\n\\n let l = comps.0.len();\\n\\n for i in 0..l {\\n\\n if let Some(e) = &comps.0[i] {\\n\\n let e = GenIndex {index: i, generation: e.generation};\\n\\n if !self.entity_allocator.is_live(e) {\\n\\n println!(\\\"Not live\\\");\\n\\n comps_to_remove.push(e);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 95,\n \"score\": 38661.21089083702\n },\n {\n \"content\": \" },\\n\\n None => { None }\\n\\n }\\n\\n },\\n\\n None => { None }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub type Entity = GenIndex;\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 96,\n \"score\": 38660.613232368334\n },\n {\n \"content\": \" ( $fn_name:ident, [$($r:ident),*] ) => {\\n\\n pub fn $fn_name<$($r: 'static),*>(&self) -> Vec<($(&$r),*, Entity)> {\\n\\n\\n\\n let mut minlen = 1000;\\n\\n $(\\n\\n let $r = self.components.get::<EntityMap<$r>>().unwrap();\\n\\n minlen = std::cmp::min(minlen, $r.0.len());\\n\\n )*\\n\\n\\n\\n let mut res = Vec::new();\\n\\n let num_iter = minlen;\\n\\n for i in 0..num_iter {\\n\\n $(\\n\\n let $r = $r.0.get(i);\\n\\n )*\\n\\n match ($($r),*) {\\n\\n ($(Some($r)),*) => {\\n\\n match ($($r),*) {\\n\\n ($(Some($r)),*) => {\\n\\n let mut generation = 0;\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 97,\n \"score\": 38658.56738670879\n },\n {\n \"content\": \"#![allow(non_camel_case_types)]\\n\\n#![allow(unused_parens)]\\n\\n\\n\\nuse anymap::AnyMap;\\n\\nuse std::fmt::Debug;\\n\\nuse std::collections::HashMap;\\n\\n\\n\\n#[derive(Debug, Eq, PartialEq, Copy, Clone)]\\n\\npub struct GenIndex {\\n\\n index: usize,\\n\\n generation: u64,\\n\\n}\\n\\n\\n\\n#[derive(Eq, PartialEq, Clone)]\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 98,\n \"score\": 38658.012238196716\n },\n {\n \"content\": \" entry.is_free = true;\\n\\n self.free.push(index.index);\\n\\n return true;\\n\\n },\\n\\n None => {\\n\\n return false;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn is_live(&self, index: GenIndex) -> bool {\\n\\n let e = self.entries.get(index.index).unwrap();\\n\\n return e.generation == index.generation && !e.is_free;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ecs.rs\",\n \"rank\": 99,\n \"score\": 38657.765319220496\n }\n]","isConversational":false}}},{"rowIdx":797,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"DownToZero-Cloud/dtz-identity-auth"},"commit":{"kind":"string","value":"a93d6ca8472680fd8d1d7f6dc4082e5726aa5438"},"file_code":{"kind":"string","value":"#![deny(missing_docs)]\n#![feature(adt_const_params)]\n\nuse serde::{Serialize,Deserialize};\nuse axum::{\n async_trait,\n extract::{FromRequest, RequestParts},\n http::header::HeaderValue,\n http::{StatusCode},\n};\nuse uuid::Uuid;\nuse jwt::PKeyWithDigest;\nuse openssl::hash::MessageDigest;\nuse openssl::pkey::PKey;\nuse jwt::algorithm::VerifyingAlgorithm;\nuse jwt::claims::Claims;\nuse jwt::FromBase64;\nuse cookie::Cookie;\nuse hyper::{Body, Request,Client,Method};\nuse hyper::body;\nuse lru_time_cache::LruCache;\nuse std::sync::Mutex;\nuse once_cell::sync::Lazy;\n\nconst PUBLIC_KEY: &str = r#\"-----BEGIN PUBLIC KEY-----\nMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA0gVBfnAa7748XyjOYXQ5\nYf39yKJ/t3b2wF5F1yPUuyLanwZYTGBV804Vs0YWiiKJ1H/csI3jWX5CWkV5TzMx\nCIP4kCugsFH6wP8rCt8Vei+rdJFB/LrlYz8Ks8Td60c5t/Hq9yQEz6kIpa5TmZw2\nDSDPvOKXW2SJRPCqj3JEk6fHsJ6nZ2BIoFvs6NMRNqgSEHr1x7lUUt9teWM2wOtF\nze24D+luvXWhRUjMMvMKkPuxdS6mPbXqoyde3U9tcsC+t2tThqVaREPkj6ew1IcU\nRnoXLi+43p4j4cQqxRjG3DzzjqAlivFjlGR/vqfLvUrGP9opjI+zs3l4G8IYWsqM\nKQIDAQAB\n-----END PUBLIC KEY-----\"#;\n\n#[derive(Serialize, Deserialize, Debug, Default, Clone)]\npub struct DtzProfile {\n \n pub identity_id: Uuid,\n \n pub context_id: Uuid,\n \n #[serde(skip_serializing_if = \"Vec::is_empty\")]\n pub roles: Vec<String>,\n}\n\npub struct DtzRequiredRole<const N: &'static str>(pub DtzProfile);\n\n#[async_trait]\nimpl<B, const N: &'static str> FromRequest<B> for DtzRequiredRole<N>\nwhere\n B: Send,\n{\n type Rejection = (StatusCode, &'static str);\n\n async fn from_request(req: &mut RequestParts<B>) -> Result<Self, Self::Rejection> {\n let result = get_profile_from_request(req).await;\n match result {\n Ok(profile) => {\n let scope = replace_placeholder(N, &profile);\n if !profile.roles.contains(&scope) {\n return Err((StatusCode::FORBIDDEN, \"no permission\"));\n }\n Ok(DtzRequiredRole(profile))\n },\n Err(e) => Err((StatusCode::UNAUTHORIZED, &e)),\n } \n }\n}\n\npub struct DtzRequiredUser(pub DtzProfile);\n\n#[async_trait]\nimpl<B> FromRequest<B> for DtzRequiredUser\nwhere\n B: Send,\n{\n type Rejection = (StatusCode, &'static str);\n\n async fn from_request(req: &mut RequestParts<B>) -> Result<Self, Self::Rejection> {\n let result = get_profile_from_request(req).await;\n match result {\n Ok(profile) => Ok(DtzRequiredUser(profile)),\n Err(e) => Err((StatusCode::UNAUTHORIZED, e)),\n }\n }\n}\n\npub struct DtzOptionalUser(pub Option<DtzProfile>);\n\n#[async_trait]\nimpl<B> FromRequest<B> for DtzOptionalUser\nwhere\n B: Send,\n{\n type Rejection = (StatusCode, &'static str);\n\n async fn from_request(req: &mut RequestParts<B>) -> Result<Self, Self::Rejection> {\n let result = get_profile_from_request(req).await;\n match result {\n Ok(profile) => Ok(DtzOptionalUser(Some(profile))),\n Err(_e) => Ok(DtzOptionalUser(None)),\n }\n }\n}\n\nasync fn get_profile_from_request<B>(req: &mut RequestParts<B>) -> Result<DtzProfile,&'static str> {\n let headers = req.headers().clone();\n let cookie: Option<&HeaderValue> = headers.get(\"cookie\");\n let authorization: Option<&HeaderValue> = headers.get(\"authorization\");\n let header_api_key: Option<&HeaderValue> = headers.get(\"x-api-key\");\n let header_context_id: Option<&HeaderValue> = headers.get(\"x-dtz-context\");\n let profile: DtzProfile;\n if let Some(cookie) = cookie {\n match verify_token_from_cookie(cookie.clone()) {\n Ok(p) => {\n profile = p;\n },\n Err(_) => {\n return Err(\"no valid token found in cookie\");\n }\n }\n }else if let Some(authorization) = authorization {\n match verify_token_from_bearer(authorization.clone()) {\n Ok(p) => {\n profile = p;\n },\n Err(_) => {\n return Err(\"not authorized\");\n }\n }\n }else if let Some(header_api_key) = header_api_key {\n if header_context_id.is_some() {\n profile = verifiy_api_key(header_api_key.to_str().unwrap(), Some(header_context_id.unwrap().to_str().unwrap())).await.unwrap();\n }else{\n profile = verifiy_api_key(header_api_key.to_str().unwrap(), None).await.unwrap();\n }\n }else {\n \n let query = req.uri().query().unwrap_or_default();\n let value: GetAuthParams = serde_urlencoded::from_str(query).unwrap();\n if value.api_key.is_some() {\n if value.context_id.is_some() {\n profile = verifiy_api_key(&value.api_key.unwrap(), Some(&value.context_id.unwrap())).await.unwrap();\n }else{\n profile = verifiy_api_key(&value.api_key.unwrap(), None).await.unwrap();\n }\n }else{\n return Err(\"no authorization header\");\n }\n }\n Ok(profile)\n}\n\nfn verify_token_from_cookie(cookie: HeaderValue) -> Result<DtzProfile,String> {\n let cookie_str = cookie.to_str().unwrap();\n match Cookie::parse(cookie_str){\n Ok(cookie) => {\n let token = cookie.value().to_string();\n verify_token(token)\n },\n Err(_) => Err(\"no valid token found in cookie\".to_string())\n }\n}\n\nfn verify_token_from_bearer(bearer: HeaderValue) -> Result<DtzProfile,String> {\n let bearer_str = bearer.to_str().unwrap();\n let jwt = bearer_str.replace(\"Bearer \",\"\");\n verify_token(jwt)\n}\n\nfn verify_token(token: String) -> Result<DtzProfile,String> {\n\n if token.as_str().contains('.') {\n let jwt_parts: Vec<&str> = token.split('.').collect();\n let jwt_alg = jwt_parts.get(0).unwrap();\n let jwt_payload = jwt_parts.get(1).unwrap();\n let jwt_sig = jwt_parts.get(2).unwrap();\n let algorithm = PKeyWithDigest {\n digest: MessageDigest::sha256(),\n key: PKey::public_key_from_pem(PUBLIC_KEY.as_bytes()).unwrap(),\n };\n match algorithm.verify(jwt_alg, jwt_payload, jwt_sig) {\n Ok(_) => {\n let claims = Claims::from_base64(jwt_payload).unwrap();\n let roles_claim = claims.private.get(\"roles\").unwrap();\n let mut roles: Vec<String> = Vec::new();\n let arr = roles_claim.as_array().unwrap();\n for role in arr {\n roles.push(role.as_str().unwrap().to_string());\n }\n let scope_str = claims.private.get(\"scope\").unwrap().as_str().unwrap();\n let result = DtzProfile{\n identity_id: Uuid::parse_str(&claims.registered.subject.unwrap()).unwrap(),\n context_id: Uuid::parse_str(scope_str).unwrap(),\n roles,\n };\n Ok(result)\n },\n Err(_) => {\n return Err(\"invalid token\".to_string());\n }\n }\n }else{\n \n Err(\"not authorized\".to_string())\n }\n}\n\n#[derive(Serialize, Deserialize, Debug)]\nstruct TokenResponse {\n access_token: String,\n scope: Option<String>,\n token_type: String,\n expires_in: u32,\n}\n\n#[derive(Serialize, Deserialize, Debug)]\n#[serde(rename_all = \"camelCase\")]\nstruct GetAuthParams {\n api_key: Option<String>,\n context_id: Option<String>,\n}\n\nstatic KNOWN_IDENTITIES: Lazy<Mutex<LruCache::<String, DtzProfile>>> = Lazy::new(|| {\n let time_to_live = std::time::Duration::from_secs(3600);\n let m = LruCache::<String, DtzProfile>::with_expiry_duration_and_capacity(time_to_live,100);\n Mutex::new(m)\n});\n\nasync fn verifiy_api_key(api_key: &str, context_id: Option<&str>) -> Result<DtzProfile,String> {\n let req_data = if context_id.is_some() {\n format!(\"{{\\\"apiKey\\\":\\\"{}\\\",\\\"contextId\\\":\\\"{}\\\"}}\",api_key,context_id.unwrap())\n } else {\n format!(\"{{\\\"apiKey\\\":\\\"{}\\\"}}\",api_key)\n };\n {\n let mut x = KNOWN_IDENTITIES.lock().unwrap();\n if x.contains_key(&req_data){\n let profile = x.get(&req_data).unwrap().clone();\n return Ok(profile);\n }\n }\n \n let hostname = std::env::var(\"HOSTNAME\").unwrap_or(\"localhost\".to_string());\n let req = Request::builder()\n .method(Method::POST)\n .uri(\"https://identity.dtz.rocks/api/2021-02-21/auth/apikey\")\n .header(\"content-type\", \"application/json\")\n .header(\"X-DTZ-SOURCE\", hostname)\n .body(Body::from(req_data.clone())).unwrap();\n let https = hyper_rustls::HttpsConnectorBuilder::new()\n .with_native_roots()\n .https_only()\n .enable_http1()\n .build();\n let http_client = Client::builder().build(https);\n let resp = http_client.request(req).await.unwrap();\n if resp.status().is_success() {\n let bytes = body::to_bytes(resp.into_body()).await.unwrap();\n let resp_str = String::from_utf8(bytes.to_vec()).expect(\"response was not valid utf-8\");\n let token_response: TokenResponse = serde_json::from_str(&resp_str).unwrap();\n let jwt = token_response.access_token;\n let result = verify_token(jwt);\n \n {\n if result.is_ok() {\n let mut x = KNOWN_IDENTITIES.lock().unwrap();\n x.insert(req_data,result.clone().unwrap());\n }\n }\n result\n }else{\n Err(\"not authorized\".to_string())\n }\n}\n\nfn replace_placeholder(template: &str, profile: &DtzProfile) -> String {\n let mut result = template.to_string();\n result = result.replace(\"{identity_id}\", &profile.identity_id.to_string());\n result = result.replace(\"{context_id}\", &profile.context_id.to_string());\n result = result.replace(\"{roles}\", &profile.roles.join(\",\"));\n result\n}\n\npub fn verify_role(profile: &DtzProfile, role: &str) -> bool {\n profile.roles.contains(&role.to_string())\n}\n\npub fn verfify_context_role(profile: &DtzProfile, role: &str) -> bool {\n let replaced_role = replace_placeholder(role, profile);\n profile.roles.contains(&replaced_role.to_string())\n}\n\n#[cfg(test)]\nmod tests {\n use uuid::Uuid;\n use super::*;\n #[test]\n fn test_replacement_identity() {\n let identity = DtzProfile{\n identity_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n context_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n roles: vec![\"admin\".to_string()],\n };\n let result = super::replace_placeholder(\"https://dtz.rocks/context/admin/{identity_id}\", &identity);\n assert_eq!(result, \"https://dtz.rocks/context/admin/00000000-0000-0000-0000-000000000000\");\n }\n #[test]\n fn test_replacement_context() {\n let identity = DtzProfile{\n identity_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n context_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n roles: vec![\"admin\".to_string()],\n };\n let result = super::replace_placeholder(\"https://dtz.rocks/context/admin/{context_id}\", &identity);\n assert_eq!(result, \"https://dtz.rocks/context/admin/00000000-0000-0000-0000-000000000000\");\n }\n #[test]\n fn test_replacement_nothing() {\n let identity = DtzProfile{\n identity_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n context_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n roles: vec![\"admin\".to_string()],\n };\n let result = super::replace_placeholder(\"https://dtz.rocks/context/admin\", &identity);\n assert_eq!(result, \"https://dtz.rocks/context/admin\");\n }\n}\n"},"prefix":{"kind":"string","value":"#![deny(missing_docs)]\n#![feature(adt_const_params)]\n\nuse serde::{Serialize,Deserialize};\nuse axum::{\n async_trait,\n extract::{FromRequest, RequestParts},\n http::header::HeaderValue,\n http::{StatusCode},\n};\nuse uuid::Uuid;\nuse jwt::PKeyWithDigest;\nuse openssl::hash::MessageDigest;\nuse openssl::pkey::PKey;\nuse jwt::algorithm::VerifyingAlgorithm;\nuse jwt::claims::Claims;\nuse jwt::FromBase64;\nuse cookie::Cookie;\nuse hyper::{Body, Request,Client,Method};\nuse hyper::body;\nuse lru_time_cache::LruCache;\nuse std::sync::Mutex;\nuse once_cell::sync::Lazy;\n\nconst PUBLIC_KEY: &str = r#\"-----BEGIN PUBLIC KEY-----\nMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA0gVBfnAa7748XyjOYXQ5\nYf39yKJ/t3b2wF5F1yPUuyLanwZYTGBV804Vs0YWiiKJ1H/csI3jWX5CWkV5TzMx\nCIP4kCugsFH6wP8rCt8Vei+rdJFB/LrlYz8Ks8Td60c5t/Hq9yQEz6kIpa5TmZw2\nDSDPvOKXW2SJRPCqj3JEk6fHsJ6nZ2BIoFvs6NMRNqgSEHr1x7lUUt9teWM2wOtF\nze24D+luvXWhRUjMMvMKkPuxdS6mPbXqoyde3U9tcsC+t2tThqVaREPkj6ew1IcU\nRnoXLi+43p4j4cQqxRjG3DzzjqAlivFjlGR/vqfLvUrGP9opjI+zs3l4G8IYWsqM\nKQIDAQAB\n-----END PUBLIC KEY-----\"#;\n\n#[derive(Serialize, Deserialize, Debug, Default, Clone)]\npub struct DtzProfile {\n \n pub identity_id: Uuid,\n \n pub context_id: Uuid,\n \n #[serde(skip_serializing_if = \"Vec::is_empty\")]\n pub roles: Vec<String>,\n}\n\npub struct DtzRequiredRole<const N: &'static str>(pub DtzProfile);\n\n#[async_trait]\nimpl<B, const N: &'static str> FromRequest<B> for DtzRequiredRole<N>\nwhere\n B: Send,\n{\n type Rejection = (StatusCode, &'static str);\n\n async fn from_request(req: &mut RequestParts<B>) -> Result<Self, Self::Rejection> {\n let result = get_profile_from_request(req).await;\n match result {\n Ok(profile) => {\n let scope = replace_placeholder(N, &profile);\n if !profile.roles.contains(&scope) {\n return Err((StatusCode::FORBIDDEN, \"no permission\"));\n }\n Ok(DtzRequiredRole(profile))\n },\n Err(e) => Err((StatusCode::UNAUTHORIZED, &e)),\n } \n }\n}\n\npub struct DtzRequiredUser(pub DtzProfile);\n\n#[async_trait]\nimpl<B> FromRequest<B> for DtzRequiredUser\nwhere\n B: Send,\n{\n type Rejection = (StatusCode, &'static str);\n\n async fn from_request(req: &mut RequestParts<B>) -> Result<Self, Self::Rejection> {\n let result = get_profile_from_request(req).await;\n match result {\n Ok(profile) => Ok(DtzRequiredUser(profile)),\n Err(e) => Err((StatusCode::UNAUTHORIZED, e)),\n }\n }\n}\n\npub struct DtzOptionalUser(pub Option<DtzProfile>);\n\n#[async_trait]\nimpl<B> FromRequest<B> for DtzOptionalUser\nwhere\n B: Send,\n{\n type Rejection = (StatusCode, &'static str);\n\n async fn from_request(req: &mut RequestParts<B>) -> Result<Self, Self::Rejection> {\n let result = get_profile_from_request(req).await;\n match result {\n Ok(profile) => Ok(DtzOptionalUser(Some(profile))),\n Err(_e) => Ok(DtzOptionalUser(None)),\n }\n }\n}\n\nasync fn get_profile_from_request<B>(req: &mut RequestParts<B>) -> Result<DtzProfile,&'static str> {\n let headers = req.headers().clone();\n let cookie: Option<&HeaderValue> = headers.get(\"cookie\");\n let authorization: Option<&HeaderValue> = headers.get(\"authorization\");\n let header_api_key: Option<&HeaderValue> = headers.get(\"x-api-key\");\n let header_context_id: Option<&HeaderValue> = headers.get(\"x-dtz-context\");\n let profile: DtzProfile;\n if let Some(cookie) = cookie {\n match verify_token_from_cookie(cookie.clone()) {\n Ok(p) => {\n profile = p;\n },\n Err(_) => {\n return Err(\"no valid token found in cookie\");\n }\n }\n }else if let Some(authorization) = authorization {\n match verify_token_from_bearer(authorization.clone()) {\n Ok(p) => {\n profile = p;\n },\n Err(_) => {\n return Err(\"not authorized\");\n }\n }\n }else if let Some(header_api_key) = header_api_key {\n "},"suffix":{"kind":"string","value":"\n }else {\n \n let query = req.uri().query().unwrap_or_default();\n let value: GetAuthParams = serde_urlencoded::from_str(query).unwrap();\n if value.api_key.is_some() {\n if value.context_id.is_some() {\n profile = verifiy_api_key(&value.api_key.unwrap(), Some(&value.context_id.unwrap())).await.unwrap();\n }else{\n profile = verifiy_api_key(&value.api_key.unwrap(), None).await.unwrap();\n }\n }else{\n return Err(\"no authorization header\");\n }\n }\n Ok(profile)\n}\n\nfn verify_token_from_cookie(cookie: HeaderValue) -> Result<DtzProfile,String> {\n let cookie_str = cookie.to_str().unwrap();\n match Cookie::parse(cookie_str){\n Ok(cookie) => {\n let token = cookie.value().to_string();\n verify_token(token)\n },\n Err(_) => Err(\"no valid token found in cookie\".to_string())\n }\n}\n\nfn verify_token_from_bearer(bearer: HeaderValue) -> Result<DtzProfile,String> {\n let bearer_str = bearer.to_str().unwrap();\n let jwt = bearer_str.replace(\"Bearer \",\"\");\n verify_token(jwt)\n}\n\nfn verify_token(token: String) -> Result<DtzProfile,String> {\n\n if token.as_str().contains('.') {\n let jwt_parts: Vec<&str> = token.split('.').collect();\n let jwt_alg = jwt_parts.get(0).unwrap();\n let jwt_payload = jwt_parts.get(1).unwrap();\n let jwt_sig = jwt_parts.get(2).unwrap();\n let algorithm = PKeyWithDigest {\n digest: MessageDigest::sha256(),\n key: PKey::public_key_from_pem(PUBLIC_KEY.as_bytes()).unwrap(),\n };\n match algorithm.verify(jwt_alg, jwt_payload, jwt_sig) {\n Ok(_) => {\n let claims = Claims::from_base64(jwt_payload).unwrap();\n let roles_claim = claims.private.get(\"roles\").unwrap();\n let mut roles: Vec<String> = Vec::new();\n let arr = roles_claim.as_array().unwrap();\n for role in arr {\n roles.push(role.as_str().unwrap().to_string());\n }\n let scope_str = claims.private.get(\"scope\").unwrap().as_str().unwrap();\n let result = DtzProfile{\n identity_id: Uuid::parse_str(&claims.registered.subject.unwrap()).unwrap(),\n context_id: Uuid::parse_str(scope_str).unwrap(),\n roles,\n };\n Ok(result)\n },\n Err(_) => {\n return Err(\"invalid token\".to_string());\n }\n }\n }else{\n \n Err(\"not authorized\".to_string())\n }\n}\n\n#[derive(Serialize, Deserialize, Debug)]\nstruct TokenResponse {\n access_token: String,\n scope: Option<String>,\n token_type: String,\n expires_in: u32,\n}\n\n#[derive(Serialize, Deserialize, Debug)]\n#[serde(rename_all = \"camelCase\")]\nstruct GetAuthParams {\n api_key: Option<String>,\n context_id: Option<String>,\n}\n\nstatic KNOWN_IDENTITIES: Lazy<Mutex<LruCache::<String, DtzProfile>>> = Lazy::new(|| {\n let time_to_live = std::time::Duration::from_secs(3600);\n let m = LruCache::<String, DtzProfile>::with_expiry_duration_and_capacity(time_to_live,100);\n Mutex::new(m)\n});\n\nasync fn verifiy_api_key(api_key: &str, context_id: Option<&str>) -> Result<DtzProfile,String> {\n let req_data = if context_id.is_some() {\n format!(\"{{\\\"apiKey\\\":\\\"{}\\\",\\\"contextId\\\":\\\"{}\\\"}}\",api_key,context_id.unwrap())\n } else {\n format!(\"{{\\\"apiKey\\\":\\\"{}\\\"}}\",api_key)\n };\n {\n let mut x = KNOWN_IDENTITIES.lock().unwrap();\n if x.contains_key(&req_data){\n let profile = x.get(&req_data).unwrap().clone();\n return Ok(profile);\n }\n }\n \n let hostname = std::env::var(\"HOSTNAME\").unwrap_or(\"localhost\".to_string());\n let req = Request::builder()\n .method(Method::POST)\n .uri(\"https://identity.dtz.rocks/api/2021-02-21/auth/apikey\")\n .header(\"content-type\", \"application/json\")\n .header(\"X-DTZ-SOURCE\", hostname)\n .body(Body::from(req_data.clone())).unwrap();\n let https = hyper_rustls::HttpsConnectorBuilder::new()\n .with_native_roots()\n .https_only()\n .enable_http1()\n .build();\n let http_client = Client::builder().build(https);\n let resp = http_client.request(req).await.unwrap();\n if resp.status().is_success() {\n let bytes = body::to_bytes(resp.into_body()).await.unwrap();\n let resp_str = String::from_utf8(bytes.to_vec()).expect(\"response was not valid utf-8\");\n let token_response: TokenResponse = serde_json::from_str(&resp_str).unwrap();\n let jwt = token_response.access_token;\n let result = verify_token(jwt);\n \n {\n if result.is_ok() {\n let mut x = KNOWN_IDENTITIES.lock().unwrap();\n x.insert(req_data,result.clone().unwrap());\n }\n }\n result\n }else{\n Err(\"not authorized\".to_string())\n }\n}\n\nfn replace_placeholder(template: &str, profile: &DtzProfile) -> String {\n let mut result = template.to_string();\n result = result.replace(\"{identity_id}\", &profile.identity_id.to_string());\n result = result.replace(\"{context_id}\", &profile.context_id.to_string());\n result = result.replace(\"{roles}\", &profile.roles.join(\",\"));\n result\n}\n\npub fn verify_role(profile: &DtzProfile, role: &str) -> bool {\n profile.roles.contains(&role.to_string())\n}\n\npub fn verfify_context_role(profile: &DtzProfile, role: &str) -> bool {\n let replaced_role = replace_placeholder(role, profile);\n profile.roles.contains(&replaced_role.to_string())\n}\n\n#[cfg(test)]\nmod tests {\n use uuid::Uuid;\n use super::*;\n #[test]\n fn test_replacement_identity() {\n let identity = DtzProfile{\n identity_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n context_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n roles: vec![\"admin\".to_string()],\n };\n let result = super::replace_placeholder(\"https://dtz.rocks/context/admin/{identity_id}\", &identity);\n assert_eq!(result, \"https://dtz.rocks/context/admin/00000000-0000-0000-0000-000000000000\");\n }\n #[test]\n fn test_replacement_context() {\n let identity = DtzProfile{\n identity_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n context_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n roles: vec![\"admin\".to_string()],\n };\n let result = super::replace_placeholder(\"https://dtz.rocks/context/admin/{context_id}\", &identity);\n assert_eq!(result, \"https://dtz.rocks/context/admin/00000000-0000-0000-0000-000000000000\");\n }\n #[test]\n fn test_replacement_nothing() {\n let identity = DtzProfile{\n identity_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n context_id: Uuid::parse_str(\"00000000-0000-0000-0000-000000000000\").unwrap(),\n roles: vec![\"admin\".to_string()],\n };\n let result = super::replace_placeholder(\"https://dtz.rocks/context/admin\", &identity);\n assert_eq!(result, \"https://dtz.rocks/context/admin\");\n }\n}\n"},"middle":{"kind":"string","value":"if header_context_id.is_some() {\n profile = verifiy_api_key(header_api_key.to_str().unwrap(), Some(header_context_id.unwrap().to_str().unwrap())).await.unwrap();\n }else{\n profile = verifiy_api_key(header_api_key.to_str().unwrap(), None).await.unwrap();\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"# 0.4.10 2022-04-30\n\n\n\n* fix unparsable cookie\n\n\n\n# 0.4.9 2022-04-20\n\n\n\n* fail on invalid jwts\n\n\n\n# 0.4.8 2022-04-17\n\n\n\n* add verify_role functions\n\n\n\n# 0.4.7 2022-03-11\n\n\n\n* support foreign cookies\n\n\n\n# 0.4.6 2022-03-11\n\n\n\n* update deps\n\n\n\n# 0.4.4 2022-03-11\n\n\n\n* cache api keys\n\n* add x-dtz-source header\n\n\n\n# 0.4.1 2022-03-07\n\n\n\n* unify auth methods\n\n\n\n# 0.4.0 2022-03-04\n\n\n","file_path":"CHANGELOG.md","rank":19,"score":5.831813479340455}],"string":"[\n {\n \"content\": \"# 0.4.10 2022-04-30\\n\\n\\n\\n* fix unparsable cookie\\n\\n\\n\\n# 0.4.9 2022-04-20\\n\\n\\n\\n* fail on invalid jwts\\n\\n\\n\\n# 0.4.8 2022-04-17\\n\\n\\n\\n* add verify_role functions\\n\\n\\n\\n# 0.4.7 2022-03-11\\n\\n\\n\\n* support foreign cookies\\n\\n\\n\\n# 0.4.6 2022-03-11\\n\\n\\n\\n* update deps\\n\\n\\n\\n# 0.4.4 2022-03-11\\n\\n\\n\\n* cache api keys\\n\\n* add x-dtz-source header\\n\\n\\n\\n# 0.4.1 2022-03-07\\n\\n\\n\\n* unify auth methods\\n\\n\\n\\n# 0.4.0 2022-03-04\\n\\n\\n\",\n \"file_path\": \"CHANGELOG.md\",\n \"rank\": 19,\n \"score\": 5.831813479340455\n }\n]","isConversational":false}}},{"rowIdx":798,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"examples/capture-test.rs"},"repo_name":{"kind":"string","value":"petrosagg/differential-dataflow"},"commit":{"kind":"string","value":"2e38abbb62aedf02cb9b6b5debb73c29b6e97dbb"},"file_code":{"kind":"string","value":"extern crate rand;\nextern crate timely;\nextern crate differential_dataflow;\n\nextern crate serde;\nextern crate rdkafka;\n\nuse rand::{Rng, SeedableRng, StdRng};\n\nuse timely::dataflow::*;\nuse timely::dataflow::operators::probe::Handle;\n\nuse differential_dataflow::input::Input;\nuse differential_dataflow::Collection;\nuse differential_dataflow::operators::*;\nuse differential_dataflow::lattice::Lattice;\n\ntype Node = u32;\ntype Edge = (Node, Node);\n\nfn main() {\n\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\n let edges: u32 = std::env::args().nth(2).unwrap().parse().unwrap();\n let batch: u32 = std::env::args().nth(3).unwrap().parse().unwrap();\n let topic = std::env::args().nth(4).unwrap();\n\n let write = std::env::args().any(|x| x == \"write\");\n let read = std::env::args().any(|x| x == \"read\");\n\n \n timely::execute_from_args(std::env::args(), move |worker| {\n\n let timer = ::std::time::Instant::now();\n\n \n let mut probe = Handle::new();\n let (mut roots, mut graph, _write_token, _read_token) = worker.dataflow(|scope| {\n\n let (root_input, roots) = scope.new_collection();\n let (edge_input, graph) = scope.new_collection();\n\n let result = bfs(&graph, &roots);\n\n let result =\n result.map(|(_,l)| l)\n .consolidate()\n .probe_with(&mut probe);\n\n let write_token = if write {\n Some(kafka::create_sink(&result.inner, \"localhost:9092\", &topic))\n } else { None };\n\n let read_token = if read {\n let (read_token, stream) = kafka::create_source(result.scope(), \"localhost:9092\", &topic, \"group\");\n use differential_dataflow::AsCollection;\n stream\n .as_collection()\n .negate()\n .concat(&result)\n .consolidate()\n .inspect(|x| println!(\"In error: {:?}\", x))\n .probe_with(&mut probe)\n .assert_empty()\n ;\n Some(read_token)\n } else { None };\n\n (root_input, edge_input, write_token, read_token)\n });\n\n let seed: &[_] = &[1, 2, 3, 4];\n let mut rng1: StdRng = SeedableRng::from_seed(seed); \n let mut rng2: StdRng = SeedableRng::from_seed(seed); \n\n roots.insert(0);\n roots.close();\n\n println!(\"performing BFS on {} nodes, {} edges:\", nodes, edges);\n\n if worker.index() == 0 {\n for _ in 0 .. edges {\n graph.insert((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)));\n }\n }\n\n println!(\"{:?}\\tloaded\", timer.elapsed());\n\n graph.advance_to(1);\n graph.flush();\n worker.step_while(|| probe.less_than(graph.time()));\n\n println!(\"{:?}\\tstable\", timer.elapsed());\n\n for round in 0 .. {\n if write {\n std::thread::sleep(std::time::Duration::from_millis(100));\n }\n for element in 0 .. batch {\n if worker.index() == 0 {\n graph.insert((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)));\n graph.remove((rng2.gen_range(0, nodes), rng2.gen_range(0, nodes)));\n }\n graph.advance_to(2 + round * batch + element);\n }\n graph.flush();\n\n let timer2 = ::std::time::Instant::now();\n worker.step_while(|| probe.less_than(&graph.time()));\n\n if worker.index() == 0 {\n let elapsed = timer2.elapsed();\n println!(\"{:?}\\t{:?}:\\t{}\", timer.elapsed(), round, elapsed.as_secs() * 1000000000 + (elapsed.subsec_nanos() as u64));\n }\n }\n println!(\"finished; elapsed: {:?}\", timer.elapsed());\n }).unwrap();\n}\n\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Node>) -> Collection<G, (Node, u32)>\nwhere G::Timestamp: Lattice+Ord {\n\n \n let nodes = roots.map(|x| (x, 0));\n\n \n nodes.iterate(|inner| {\n\n let edges = edges.enter(&inner.scope());\n let nodes = nodes.enter(&inner.scope());\n\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\n .concat(&nodes)\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\n })\n}\n\npub mod kafka {\n\n use serde::{Serialize, Deserialize};\n use timely::scheduling::SyncActivator;\n use rdkafka::{ClientContext, config::ClientConfig};\n use rdkafka::consumer::{BaseConsumer, ConsumerContext};\n use rdkafka::error::{KafkaError, RDKafkaError};\n use differential_dataflow::capture::Writer;\n\n use std::hash::Hash;\n use timely::progress::Timestamp;\n use timely::dataflow::{Scope, Stream};\n use differential_dataflow::ExchangeData;\n use differential_dataflow::lattice::Lattice;\n\n \n pub fn create_source<G, D, T, R>(scope: G, addr: &str, topic: &str, group: &str) -> (Box<dyn std::any::Any>, Stream<G, (D, T, R)>)\n where\n G: Scope<Timestamp = T>,\n D: ExchangeData + Hash + for<'a> serde::Deserialize<'a>,\n T: ExchangeData + Hash + for<'a> serde::Deserialize<'a> + Timestamp + Lattice,\n R: ExchangeData + Hash + for<'a> serde::Deserialize<'a>,\n {\n differential_dataflow::capture::source::build(scope, |activator| {\n let source = KafkaSource::new(addr, topic, group, activator);\n differential_dataflow::capture::YieldingIter::new_from(Iter::<D,T,R>::new_from(source), std::time::Duration::from_millis(10))\n })\n }\n\n pub fn create_sink<G, D, T, R>(stream: &Stream<G, (D, T, R)>, addr: &str, topic: &str) -> Box<dyn std::any::Any>\n where\n G: Scope<Timestamp = T>,\n D: ExchangeData + Hash + Serialize + for<'a> Deserialize<'a>,\n T: ExchangeData + Hash + Serialize + for<'a> Deserialize<'a> + Timestamp + Lattice,\n R: ExchangeData + Hash + Serialize + for<'a> Deserialize<'a>,\n {\n use std::rc::Rc;\n use std::cell::RefCell;\n use differential_dataflow::hashable::Hashable;\n\n let sink = KafkaSink::new(addr, topic);\n let result = Rc::new(RefCell::new(sink));\n let sink_hash = (addr.to_string(), topic.to_string()).hashed();\n differential_dataflow::capture::sink::build(\n &stream,\n sink_hash,\n Rc::downgrade(&result),\n Rc::downgrade(&result),\n );\n Box::new(result)\n\n }\n\n pub struct KafkaSource {\n consumer: BaseConsumer<ActivationConsumerContext>,\n }\n\n impl KafkaSource {\n pub fn new(addr: &str, topic: &str, group: &str, activator: SyncActivator) -> Self {\n let mut kafka_config = ClientConfig::new();\n \n kafka_config.set(\"bootstrap.servers\", &addr.to_string());\n kafka_config\n .set(\"enable.auto.commit\", \"false\")\n .set(\"auto.offset.reset\", \"earliest\");\n\n kafka_config.set(\"topic.metadata.refresh.interval.ms\", \"30000\"); \n kafka_config.set(\"fetch.message.max.bytes\", \"134217728\");\n kafka_config.set(\"group.id\", group);\n kafka_config.set(\"isolation.level\", \"read_committed\");\n let activator = ActivationConsumerContext(activator);\n let consumer = kafka_config.create_with_context::<_, BaseConsumer<_>>(activator).unwrap();\n use rdkafka::consumer::Consumer;\n consumer.subscribe(&[topic]).unwrap();\n Self {\n consumer,\n }\n }\n }\n\n pub struct Iter<D, T, R> {\n pub source: KafkaSource,\n phantom: std::marker::PhantomData<(D, T, R)>,\n }\n\n impl<D, T, R> Iter<D, T, R> {\n \n pub fn new_from(source: KafkaSource) -> Self {\n Self {\n source,\n phantom: std::marker::PhantomData,\n }\n }\n }\n\n impl<D, T, R> Iterator for Iter<D, T, R>\n where\n D: for<'a>Deserialize<'a>,\n T: for<'a>Deserialize<'a>,\n R: for<'a>Deserialize<'a>,\n {\n type Item = differential_dataflow::capture::Message<D, T, R>;\n fn next(&mut self) -> Option<Self::Item> {\n use rdkafka::message::Message;\n self.source\n .consumer\n .poll(std::time::Duration::from_millis(0))\n .and_then(|result| result.ok())\n .and_then(|message| {\n message.payload().and_then(|message| bincode::deserialize::<differential_dataflow::capture::Message<D, T, R>>(message).ok())\n })\n }\n }\n\n \n \n struct ActivationConsumerContext(SyncActivator);\n\n impl ClientContext for ActivationConsumerContext { }\n\n impl ActivationConsumerContext {\n fn activate(&self) {\n self.0.activate().unwrap();\n }\n }\n\n impl ConsumerContext for ActivationConsumerContext {\n fn message_queue_nonempty_callback(&self) {\n self.activate();\n }\n }\n\n use std::time::Duration;\n use rdkafka::producer::DefaultProducerContext;\n use rdkafka::producer::{BaseRecord, ThreadedProducer};\n\n pub struct KafkaSink {\n topic: String,\n producer: ThreadedProducer<DefaultProducerContext>,\n buffer: Vec<u8>,\n }\n\n impl KafkaSink {\n pub fn new(addr: &str, topic: &str) -> Self {\n let mut config = ClientConfig::new();\n config.set(\"bootstrap.servers\", &addr);\n config.set(\"queue.buffering.max.kbytes\", &format!(\"{}\", 16 << 20));\n config.set(\"queue.buffering.max.messages\", &format!(\"{}\", 10_000_000));\n config.set(\"queue.buffering.max.ms\", &format!(\"{}\", 10));\n let producer = config\n .create_with_context::<_, ThreadedProducer<_>>(DefaultProducerContext)\n .expect(\"creating kafka producer for kafka sinks failed\");\n Self {\n producer,\n topic: topic.to_string(),\n buffer: Vec::new(),\n }\n }\n }\n\n impl<T: Serialize> Writer<T> for KafkaSink {\n fn poll(&mut self, item: &T) -> Option<Duration> {\n self.buffer.clear();\n bincode::serialize_into(&mut self.buffer, item).expect(\"Writing to a `Vec<u8>` cannot fail\");\n let record = BaseRecord::<[u8], _>::to(&self.topic).payload(&self.buffer);\n self.producer.send(record).err().map(|(e, _)| {\n if let KafkaError::MessageProduction(RDKafkaError::QueueFull) = e {\n Duration::from_secs(1)\n } else {\n \n Duration::from_secs(1)\n }\n })\n }\n fn done(&self) -> bool {\n self.producer.in_flight_count() == 0\n }\n }\n\n}\n"},"prefix":{"kind":"string","value":"extern crate rand;\nextern crate timely;\nextern crate differential_dataflow;\n\nextern crate serde;\nextern crate rdkafka;\n\nuse rand::{Rng, SeedableRng, StdRng};\n\nuse timely::dataflow::*;\nuse timely::dataflow::operators::probe::Handle;\n\nuse differential_dataflow::input::Input;\nuse differential_dataflow::Collection;\nuse differential_dataflow::operators::*;\nuse differential_dataflow::lattice::Lattice;\n\ntype Node = u32;\ntype Edge = (Node, Node);\n\nfn main() {\n\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\n let edges: u32 = std::env::args().nth(2).unwrap().parse().unwrap();\n let batch: u32 = std::env::args().nth(3).unwrap().parse().unwrap();\n let topic = std::env::args().nth(4).unwrap();\n\n let write = std::env::args().any(|x| x == \"write\");\n let read = std::env::args().any(|x| x == \"read\");\n\n \n timely::execute_from_args(std::env::args(), move |worker| {\n\n let timer = ::std::time::Instant::now();\n\n \n let mut probe = Handle::new();\n let (mut roots, mut graph, _write_token, _read_token) = worker.dataflow(|scope| {\n\n let (root_input, roots) = scope.new_collection();\n let (edge_input, graph) = scope.new_collection();\n\n let result = bfs(&graph, &roots);\n\n let result =\n result.map(|(_,l)| l)\n .consolidate()\n .probe_with(&mut probe);\n\n let write_token = if write {\n Some(kafka::create_sink(&result.inner, \"localhost:9092\", &topic))\n } else { None };\n\n let read_token = if read {\n let (read_token, stream) = kafka::create_source(result.scope(), \"localhost:9092\", &topic, \"group\");\n use differential_dataflow::AsCollection;\n stream\n .as_collection()\n .negate()\n .concat(&result)\n .consolidate()\n .inspect(|x| println!(\"In error: {:?}\", x))\n .probe_with(&mut probe)\n .assert_empty()\n ;\n Some(read_token)\n } else { None };\n\n (root_input, edge_input, write_token, read_token)\n });\n\n let seed: &[_] = &[1, 2, 3, 4];\n let mut rng1: StdRng = SeedableRng::from_seed(seed); \n let mut rng2: StdRng = SeedableRng::from_seed(seed); \n\n roots.insert(0);\n roots.close();\n\n println!(\"performing BFS on {} nodes, {} edges:\", nodes, edges);\n\n if worker.index() == 0 {\n for _ in 0 .. edges {\n graph.insert((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)));\n }\n }\n\n println!(\"{:?}\\tloaded\", timer.elapsed());\n\n graph.advance_to(1);\n graph.flush();\n worker.step_while(|| probe.less_than(graph.time()));\n\n println!(\"{:?}\\tstable\", timer.elapsed());\n\n for round in 0 .. {\n if write {\n std::thread::sleep(std::time::Duration::from_millis(100));\n }\n for element in 0 .. batch {\n if worker.index() == 0 {\n graph.insert((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)));\n graph.remove((rng2.gen_range(0, nodes), rng2.gen_range(0, nodes)));\n }\n graph.advance_to(2 + round * batch + element);\n }\n graph.flush();\n\n let timer2 = ::std::time::Instant::now();\n worker.step_while(|| probe.less_than(&graph.time()));\n\n if worker.index() == 0 {\n let elapsed = timer2.elapsed();\n println!(\"{:?}\\t{:?}:\\t{}\", timer.elapsed(), round, elapsed.as_secs() * 1000000000 + (elapsed.subsec_nanos() as u64));\n }\n }\n println!(\"finished; elapsed: {:?}\", timer.elapsed());\n }).unwrap();\n}\n\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Nod"},"suffix":{"kind":"string","value":"\n\npub mod kafka {\n\n use serde::{Serialize, Deserialize};\n use timely::scheduling::SyncActivator;\n use rdkafka::{ClientContext, config::ClientConfig};\n use rdkafka::consumer::{BaseConsumer, ConsumerContext};\n use rdkafka::error::{KafkaError, RDKafkaError};\n use differential_dataflow::capture::Writer;\n\n use std::hash::Hash;\n use timely::progress::Timestamp;\n use timely::dataflow::{Scope, Stream};\n use differential_dataflow::ExchangeData;\n use differential_dataflow::lattice::Lattice;\n\n \n pub fn create_source<G, D, T, R>(scope: G, addr: &str, topic: &str, group: &str) -> (Box<dyn std::any::Any>, Stream<G, (D, T, R)>)\n where\n G: Scope<Timestamp = T>,\n D: ExchangeData + Hash + for<'a> serde::Deserialize<'a>,\n T: ExchangeData + Hash + for<'a> serde::Deserialize<'a> + Timestamp + Lattice,\n R: ExchangeData + Hash + for<'a> serde::Deserialize<'a>,\n {\n differential_dataflow::capture::source::build(scope, |activator| {\n let source = KafkaSource::new(addr, topic, group, activator);\n differential_dataflow::capture::YieldingIter::new_from(Iter::<D,T,R>::new_from(source), std::time::Duration::from_millis(10))\n })\n }\n\n pub fn create_sink<G, D, T, R>(stream: &Stream<G, (D, T, R)>, addr: &str, topic: &str) -> Box<dyn std::any::Any>\n where\n G: Scope<Timestamp = T>,\n D: ExchangeData + Hash + Serialize + for<'a> Deserialize<'a>,\n T: ExchangeData + Hash + Serialize + for<'a> Deserialize<'a> + Timestamp + Lattice,\n R: ExchangeData + Hash + Serialize + for<'a> Deserialize<'a>,\n {\n use std::rc::Rc;\n use std::cell::RefCell;\n use differential_dataflow::hashable::Hashable;\n\n let sink = KafkaSink::new(addr, topic);\n let result = Rc::new(RefCell::new(sink));\n let sink_hash = (addr.to_string(), topic.to_string()).hashed();\n differential_dataflow::capture::sink::build(\n &stream,\n sink_hash,\n Rc::downgrade(&result),\n Rc::downgrade(&result),\n );\n Box::new(result)\n\n }\n\n pub struct KafkaSource {\n consumer: BaseConsumer<ActivationConsumerContext>,\n }\n\n impl KafkaSource {\n pub fn new(addr: &str, topic: &str, group: &str, activator: SyncActivator) -> Self {\n let mut kafka_config = ClientConfig::new();\n \n kafka_config.set(\"bootstrap.servers\", &addr.to_string());\n kafka_config\n .set(\"enable.auto.commit\", \"false\")\n .set(\"auto.offset.reset\", \"earliest\");\n\n kafka_config.set(\"topic.metadata.refresh.interval.ms\", \"30000\"); \n kafka_config.set(\"fetch.message.max.bytes\", \"134217728\");\n kafka_config.set(\"group.id\", group);\n kafka_config.set(\"isolation.level\", \"read_committed\");\n let activator = ActivationConsumerContext(activator);\n let consumer = kafka_config.create_with_context::<_, BaseConsumer<_>>(activator).unwrap();\n use rdkafka::consumer::Consumer;\n consumer.subscribe(&[topic]).unwrap();\n Self {\n consumer,\n }\n }\n }\n\n pub struct Iter<D, T, R> {\n pub source: KafkaSource,\n phantom: std::marker::PhantomData<(D, T, R)>,\n }\n\n impl<D, T, R> Iter<D, T, R> {\n \n pub fn new_from(source: KafkaSource) -> Self {\n Self {\n source,\n phantom: std::marker::PhantomData,\n }\n }\n }\n\n impl<D, T, R> Iterator for Iter<D, T, R>\n where\n D: for<'a>Deserialize<'a>,\n T: for<'a>Deserialize<'a>,\n R: for<'a>Deserialize<'a>,\n {\n type Item = differential_dataflow::capture::Message<D, T, R>;\n fn next(&mut self) -> Option<Self::Item> {\n use rdkafka::message::Message;\n self.source\n .consumer\n .poll(std::time::Duration::from_millis(0))\n .and_then(|result| result.ok())\n .and_then(|message| {\n message.payload().and_then(|message| bincode::deserialize::<differential_dataflow::capture::Message<D, T, R>>(message).ok())\n })\n }\n }\n\n \n \n struct ActivationConsumerContext(SyncActivator);\n\n impl ClientContext for ActivationConsumerContext { }\n\n impl ActivationConsumerContext {\n fn activate(&self) {\n self.0.activate().unwrap();\n }\n }\n\n impl ConsumerContext for ActivationConsumerContext {\n fn message_queue_nonempty_callback(&self) {\n self.activate();\n }\n }\n\n use std::time::Duration;\n use rdkafka::producer::DefaultProducerContext;\n use rdkafka::producer::{BaseRecord, ThreadedProducer};\n\n pub struct KafkaSink {\n topic: String,\n producer: ThreadedProducer<DefaultProducerContext>,\n buffer: Vec<u8>,\n }\n\n impl KafkaSink {\n pub fn new(addr: &str, topic: &str) -> Self {\n let mut config = ClientConfig::new();\n config.set(\"bootstrap.servers\", &addr);\n config.set(\"queue.buffering.max.kbytes\", &format!(\"{}\", 16 << 20));\n config.set(\"queue.buffering.max.messages\", &format!(\"{}\", 10_000_000));\n config.set(\"queue.buffering.max.ms\", &format!(\"{}\", 10));\n let producer = config\n .create_with_context::<_, ThreadedProducer<_>>(DefaultProducerContext)\n .expect(\"creating kafka producer for kafka sinks failed\");\n Self {\n producer,\n topic: topic.to_string(),\n buffer: Vec::new(),\n }\n }\n }\n\n impl<T: Serialize> Writer<T> for KafkaSink {\n fn poll(&mut self, item: &T) -> Option<Duration> {\n self.buffer.clear();\n bincode::serialize_into(&mut self.buffer, item).expect(\"Writing to a `Vec<u8>` cannot fail\");\n let record = BaseRecord::<[u8], _>::to(&self.topic).payload(&self.buffer);\n self.producer.send(record).err().map(|(e, _)| {\n if let KafkaError::MessageProduction(RDKafkaError::QueueFull) = e {\n Duration::from_secs(1)\n } else {\n \n Duration::from_secs(1)\n }\n })\n }\n fn done(&self) -> bool {\n self.producer.in_flight_count() == 0\n }\n }\n\n}\n"},"middle":{"kind":"string","value":"e>) -> Collection<G, (Node, u32)>\nwhere G::Timestamp: Lattice+Ord {\n\n \n let nodes = roots.map(|x| (x, 0));\n\n \n nodes.iterate(|inner| {\n\n let edges = edges.enter(&inner.scope());\n let nodes = nodes.enter(&inner.scope());\n\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\n .concat(&nodes)\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\n })\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"// Type aliases for differential execution.\n\ntype Time = u32;\n","file_path":"doop/src/main.rs","rank":0,"score":294510.99856603285},{"content":"type Node = u32;\n\n\n","file_path":"src/trace/implementations/graph.rs","rank":1,"score":289060.6563150857},{"content":"#[no_mangle]\n\npub fn build((dataflow, handles, probe, timer, args): Environment) -> Result<(), String> {\n\n\n\n // This call either starts the production of random graph edges.\n\n //\n\n // The arguments should be\n\n //\n\n // <graph_name> <nodes> <edges> <rate>\n\n //\n\n // where <rate> is the target number of edge changes per second. The source\n\n // will play out changes to keep up with this, and timestamp them as if they\n\n // were emitted at the correct time. The timestamps use the system `timer`,\n\n // but only start whenever the method is called. This means that the data are\n\n // not deterministic, but if you subtract the elapsed time between system start\n\n // up and method call, they should be deterministic.\n\n //\n\n // The method also registers a capability with name `<graph_name>-capability`,\n\n // and will continue to execute until this capability is dropped from `handles`.\n\n // To terminate the operator it is sufficient to drop the capability, as the\n\n // operator holds only a weak reference to it.\n\n //\n","file_path":"server/dataflows/random_graph/src/lib.rs","rank":2,"score":283334.70969676506},{"content":"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\n\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Node>) -> Collection<G, (Node, u32)>\n\nwhere G::Timestamp: Lattice+Ord {\n\n\n\n // initialize roots as reaching themselves at distance 0\n\n let nodes = roots.map(|x| (x, 0));\n\n\n\n // repeatedly update minimal distances each node can be reached from each root\n\n nodes.iterate(|inner| {\n\n\n\n let edges = edges.enter(&inner.scope());\n\n let nodes = nodes.enter(&inner.scope());\n\n\n\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\n\n .concat(&nodes)\n\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\n\n })\n\n}","file_path":"examples/bfs.rs","rank":3,"score":273521.8120165493},{"content":"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\n\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Node>) -> Collection<G, (Node, u32)>\n\nwhere G::Timestamp: Lattice+Ord {\n\n\n\n // initialize roots as reaching themselves at distance 0\n\n let nodes = roots.map(|x| (x, 0));\n\n\n\n // repeatedly update minimal distances each node can be reached from each root\n\n nodes.iterate(|inner| {\n\n\n\n let edges = edges.enter(&inner.scope());\n\n let nodes = nodes.enter(&inner.scope());\n\n\n\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\n\n .concat(&nodes)\n\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\n\n })\n\n}","file_path":"examples/stackoverflow.rs","rank":4,"score":273521.8120165493},{"content":"fn dump_cursor<Tr>(round: u32, index: usize, trace: &mut Tr)\n\nwhere\n\n Tr: TraceReader,\n\n Tr::Key: Debug + Clone,\n\n Tr::Val: Debug + Clone,\n\n Tr::Time: Debug + Clone,\n\n Tr::R: Debug + Clone,\n\n{\n\n let (mut cursor, storage) = trace.cursor();\n\n for ((k, v), diffs) in cursor.to_vec(&storage).iter() {\n\n println!(\"round {}, w{} {:?}:{:?}: {:?}\", round, index, *k, *v, diffs);\n\n }\n\n}\n","file_path":"examples/cursors.rs","rank":6,"score":265138.44606916915},{"content":"fn read_u25(string: &str) -> [u8;25] { let mut buff = [0;25]; copy_from_to(string.as_bytes(), &mut buff); buff }\n\n\n\nunsafe_abomonate!(AbomonationWrapper<ArrayString<[u8; 25]>>);\n\nunsafe_abomonate!(AbomonationWrapper<ArrayString<[u8; 40]>>);\n\nunsafe_abomonate!(AbomonationWrapper<ArrayString<[u8; 128]>>);\n\n\n\n#[derive(Ord,PartialOrd,Eq,PartialEq,Clone,Copy,Debug,Hash,Default)]\n\npub struct AbomonationWrapper<T> {\n\n pub element: T,\n\n}\n\n\n\nuse ::std::ops::Deref;\n\nimpl<T> Deref for AbomonationWrapper<T> {\n\n type Target = T;\n\n fn deref(&self) -> &Self::Target {\n\n &self.element\n\n }\n\n}\n\n\n\nunsafe_abomonate!(Part);\n","file_path":"tpchlike/src/types.rs","rank":7,"score":265036.73541693133},{"content":"fn read_u10(string: &str) -> [u8;10] { let mut buff = [0;10]; copy_from_to(string.as_bytes(), &mut buff); buff }\n","file_path":"tpchlike/src/types.rs","rank":8,"score":265036.73541693133},{"content":"fn read_u15(string: &str) -> [u8;15] { let mut buff = [0;15]; copy_from_to(string.as_bytes(), &mut buff); buff }\n","file_path":"tpchlike/src/types.rs","rank":9,"score":265036.73541693133},{"content":"fn read_u01(string: &str) -> [u8;1] { let mut buff = [0;1]; copy_from_to(string.as_bytes(), &mut buff); buff }\n","file_path":"tpchlike/src/types.rs","rank":10,"score":265036.73541693133},{"content":"type Time = u32;\n","file_path":"examples/cursors.rs","rank":11,"score":253688.27089614252},{"content":"type Time = u32;\n","file_path":"examples/pagerank.rs","rank":12,"score":253688.27089614252},{"content":"type Node = u32;\n","file_path":"examples/pagerank.rs","rank":13,"score":253093.0110743976},{"content":"type Node = u32;\n","file_path":"examples/stackoverflow.rs","rank":14,"score":253093.0110743976},{"content":"type Node = u32;\n","file_path":"examples/cursors.rs","rank":15,"score":253093.0110743976},{"content":"type Node = u32;\n","file_path":"examples/interpreted.rs","rank":16,"score":253093.0110743976},{"content":"type Node = u32;\n","file_path":"examples/bfs.rs","rank":17,"score":253093.0110743976},{"content":"type Node = u32;\n","file_path":"dogsdogsdogs/examples/ngo.rs","rank":19,"score":249070.47743759854},{"content":"type Node = u32;\n","file_path":"examples/monoid-bfs.rs","rank":20,"score":249070.4774375985},{"content":"/// Enables logging of differential dataflow events.\n\npub fn enable<A, W>(worker: &mut timely::worker::Worker<A>, writer: W) -> Option<Box<dyn std::any::Any+'static>>\n\nwhere\n\n A: timely::communication::Allocate,\n\n W: std::io::Write+'static,\n\n{\n\n let writer = ::timely::dataflow::operators::capture::EventWriter::new(writer);\n\n let mut logger = ::timely::logging::BatchLogger::new(writer);\n\n worker\n\n .log_register()\n\n .insert::<DifferentialEvent,_>(\"differential/arrange\", move |time, data| logger.publish_batch(time, data))\n\n}\n\n\n\n/// Possible different differential events.\n\n#[derive(Debug, Clone, Abomonation, Ord, PartialOrd, Eq, PartialEq)]\n\npub enum DifferentialEvent {\n\n /// Batch creation.\n\n Batch(BatchEvent),\n\n /// Merge start and stop events.\n\n Merge(MergeEvent),\n\n /// Batch dropped when trace dropped.\n","file_path":"src/logging.rs","rank":21,"score":233140.2729517994},{"content":"type Edge = (Node, Node);\n\n\n\n#[test] fn bfs_10_20_1000() { test_sizes(10, 20, 1000, Config::process(3)); }\n\n#[test] fn bfs_100_200_10() { test_sizes(100, 200, 10, Config::process(3)); }\n\n#[test] fn bfs_100_2000_1() { test_sizes(100, 2000, 1, Config::process(3)); }\n\n\n","file_path":"tests/bfs.rs","rank":22,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"examples/interpreted.rs","rank":23,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n","file_path":"examples/cursors.rs","rank":24,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n","file_path":"examples/pagerank.rs","rank":25,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n\n#[test] fn scc_10_20_1000() { test_sizes(10, 20, 1000, Config::process(3)); }\n\n#[test] fn scc_100_200_10() { test_sizes(100, 200, 10, Config::process(3)); }\n\n#[test] fn scc_100_2000_1() { test_sizes(100, 2000, 1, Config::process(3)); }\n\n\n","file_path":"tests/scc.rs","rank":26,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"examples/bfs.rs","rank":27,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n","file_path":"examples/graspan.rs","rank":28,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"examples/stackoverflow.rs","rank":29,"score":226348.37484132207},{"content":"fn assign(node: usize, root: usize, reverse: &HashMap<usize, Vec<usize>>, component: &mut HashMap<usize, usize>) {\n\n if !component.contains_key(&node) {\n\n component.insert(node, root);\n\n if let Some(edges) = reverse.get(&node) {\n\n for &edge in edges.iter() {\n\n assign(edge, root, reverse, component);\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"tests/scc.rs","rank":30,"score":224895.80643971608},{"content":"#[no_mangle]\n\npub fn build((dataflow, handles, probe, _timer, args): Environment) -> Result<(), String> {\n\n\n\n if args.len() != 2 { return Err(format!(\"expected two arguments; instead: {:?}\", args)); }\n\n\n\n let edges = handles\n\n .get_mut::<Rc<RefCell<Option<TraceHandle>>>>(&args[0])?\n\n .borrow_mut().as_mut().unwrap().import(dataflow);\n\n\n\n let source = args[1].parse::<usize>().map_err(|_| format!(\"parse error, source: {:?}\", args[1]))?; \n\n let (_input, query) = dataflow.new_collection_from(Some(source));\n\n\n\n let timer = ::std::time::Instant::now();\n\n\n\n query\n\n .map(|x| (x, x))\n\n .join_core(&edges, |_n, &q, &d| Some((d, q))) // one hop\n\n .join_core(&edges, |_n, &q, &d| Some((d, q))) // two hops\n\n .join_core(&edges, |_n, &q, &d| Some((d, q))) // three hops\n\n .map(|x| x.1)\n\n .consolidate()\n\n .inspect(move |x| println!(\"{:?}:\\t{:?}\", timer.elapsed(), x))\n\n .probe_with(probe);\n\n\n\n Ok(())\n\n}","file_path":"server/dataflows/neighborhood/src/lib.rs","rank":31,"score":222903.30899012528},{"content":"#[no_mangle]\n\npub fn build((dataflow, handles, probe, _timer, args): Environment) -> Result<(), String> {\n\n\n\n if args.len() != 2 { return Err(format!(\"expected two arguments; instead: {:?}\", args)); }\n\n\n\n let edges = handles\n\n .get_mut::<Rc<RefCell<Option<TraceHandle>>>>(&args[0])?\n\n .borrow_mut().as_mut().unwrap().import(dataflow);\n\n\n\n let source = args[1].parse::<usize>().map_err(|_| format!(\"parse error, source: {:?}\", args[1]))?; \n\n let (_input, roots) = dataflow.new_collection_from(Some(source));\n\n\n\n // repeatedly update minimal distances each node can be reached from each root\n\n roots.iterate(|dists| {\n\n let edges = edges.enter(&dists.scope());\n\n let roots = roots.enter(&dists.scope());\n\n dists.arrange_by_self()\n\n .join_core(&edges, |_src, _, &dst| Some(dst))\n\n .concat(&roots)\n\n .distinct()\n\n })\n\n .probe_with(probe);\n\n\n\n Ok(())\n\n}","file_path":"server/dataflows/reachability/src/lib.rs","rank":32,"score":222903.30899012528},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"dogsdogsdogs/examples/ngo.rs","rank":34,"score":222835.71298371206},{"content":"type Edge = (Node, Node);\n\n\n\n#[derive(Abomonation, Copy, Ord, PartialOrd, Eq, PartialEq, Debug, Clone, Serialize, Deserialize, Hash)]\n\npub struct MinSum {\n\n value: u32,\n\n}\n\n\n\nuse std::ops::{AddAssign, Mul};\n\nuse differential_dataflow::difference::Semigroup;\n\n\n\nimpl<'a> AddAssign<&'a Self> for MinSum {\n\n fn add_assign(&mut self, rhs: &'a Self) {\n\n self.value = std::cmp::min(self.value, rhs.value);\n\n }\n\n}\n\n\n\nimpl Mul<Self> for MinSum {\n\n type Output = Self;\n\n fn mul(self, rhs: Self) -> Self {\n\n MinSum { value: self.value + rhs.value }\n\n }\n\n}\n\n\n\nimpl Semigroup for MinSum {\n\n fn is_zero(&self) -> bool { false }\n\n}\n\n\n","file_path":"examples/monoid-bfs.rs","rank":35,"score":222835.71298371206},{"content":"#[no_mangle]\n\npub fn build((dataflow, handles, probe, _timer, args): Environment) -> Result<(), String> {\n\n\n\n if args.len() != 1 { return Err(format!(\"expected one argument, instead: {:?}\", args)); }\n\n\n\n handles\n\n .get_mut::<Rc<RefCell<Option<TraceHandle>>>>(&args[0])?\n\n .borrow_mut().as_mut().unwrap()\n\n .import(dataflow)\n\n .as_collection(|&src,_dst| src)\n\n .count_total()\n\n .map(|(_deg, cnt)| cnt as usize)\n\n .count_total()\n\n .probe_with(probe);\n\n\n\n Ok(())\n\n}","file_path":"server/dataflows/degr_dist/src/lib.rs","rank":36,"score":219838.94394000177},{"content":"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\n\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Node>) -> Collection<G, (Node, usize)>\n\nwhere G::Timestamp: Lattice+Ord {\n\n\n\n // initialize roots as reaching themselves at distance 0\n\n let nodes = roots.map(|x| (x, 0));\n\n\n\n // repeatedly update minimal distances each node can be reached from each root\n\n nodes.iterate(|inner| {\n\n\n\n let edges = edges.enter(&inner.scope());\n\n let nodes = nodes.enter(&inner.scope());\n\n\n\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\n\n .concat(&nodes)\n\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\n\n })\n\n}\n","file_path":"tests/bfs.rs","rank":37,"score":214965.4824300761},{"content":"/// Propagates labels forward, retaining the minimum label.\n\n///\n\n/// This algorithm naively propagates all labels at once, much like standard label propagation.\n\n/// To more carefully control the label propagation, consider `propagate_core` which supports a\n\n/// method to limit the introduction of labels.\n\npub fn propagate<G, N, L, R>(edges: &Collection<G, (N,N), R>, nodes: &Collection<G,(N,L),R>) -> Collection<G,(N,L),R>\n\nwhere\n\n G: Scope,\n\n G::Timestamp: Lattice+Ord,\n\n N: ExchangeData+Hash,\n\n R: ExchangeData+Abelian,\n\n R: Mul<R, Output=R>,\n\n R: From<i8>,\n\n L: ExchangeData,\n\n{\n\n propagate_core(&edges.arrange_by_key(), nodes, |_label| 0)\n\n}\n\n\n","file_path":"src/algorithms/graphs/propagate.rs","rank":38,"score":211521.45495163626},{"content":"type Iter = u32;\n","file_path":"doop/src/main.rs","rank":39,"score":210647.21909271507},{"content":"type Number = u32;\n","file_path":"doop/src/main.rs","rank":40,"score":210647.21909271507},{"content":"type Symbol = u32;\n","file_path":"doop/src/main.rs","rank":41,"score":210647.21909271507},{"content":"/// Introduces differential options to a timely configuration.\n\npub fn configure(config: &mut timely::WorkerConfig, options: &Config) {\n\n if let Some(effort) = options.idle_merge_effort {\n\n config.set(\"differential/idle_merge_effort\".to_string(), effort);\n\n }\n\n}\n","file_path":"src/lib.rs","rank":42,"score":210616.34569801207},{"content":"type Result = std::sync::mpsc::Receiver<timely::dataflow::operators::capture::Event<usize, ((u64, i64), usize, i64)>>;\n\n\n","file_path":"tests/import.rs","rank":43,"score":209117.31130603747},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n // revenue by supplier\n\n let revenue =\n\n collections\n\n .lineitems()\n\n .explode(|item|\n\n if create_date(1996, 1, 1) <= item.ship_date && item.ship_date < create_date(1996,4,1) {\n\n Some((item.supp_key, (item.extended_price * (100 - item.discount) / 100) as isize))\n\n }\n\n else { None }\n\n );\n\n\n\n // suppliers with maximum revenue\n\n let top_suppliers =\n\n revenue\n\n // do a hierarchical min, to improve update perf.\n\n .map(|key| ((key % 1000) as u16, key))\n\n .reduce(|_k, s, t| {\n","file_path":"tpchlike/src/queries/query15.rs","rank":44,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let regions = collections.regions().filter(|r| starts_with(&r.name, b\"AMERICA\")).map(|r| r.region_key);\n\n let nations1 = collections.nations().map(|n| (n.region_key, n.nation_key)).semijoin(®ions).map(|x| x.1);\n\n let customers = collections.customers().map(|c| (c.nation_key, c.cust_key)).semijoin(&nations1).map(|x| x.1);\n\n let orders =\n\n collections\n\n .orders()\n\n .flat_map(|o|\n\n if create_date(1995,1,1) <= o.order_date && o.order_date <= create_date(1996, 12, 31) {\n\n Some((o.cust_key, (o.order_key, o.order_date >> 16)))\n\n }\n\n else { None }\n\n )\n\n .semijoin(&customers)\n\n .map(|x| x.1);\n\n\n\n let nations2 = collections.nations.map(|n| (n.nation_key, starts_with(&n.name, b\"BRAZIL\")));\n\n let suppliers =\n","file_path":"tpchlike/src/queries/query08.rs","rank":45,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let customers =\n\n collections\n\n .customers()\n\n .flat_map(|c| if starts_with(&c.mktsegment[..], b\"BUILDING\") { Some(c.cust_key) } else { None });\n\n\n\n let lineitems =\n\n collections\n\n .lineitems()\n\n .explode(|l|\n\n if l.ship_date > create_date(1995, 3, 15) {\n\n Some((l.order_key, (l.extended_price * (100 - l.discount) / 100) as isize))\n\n }\n\n else { None }\n\n );\n\n\n\n let orders =\n\n collections\n","file_path":"tpchlike/src/queries/query03.rs","rank":46,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let regex = Regex::new(\"special.*requests\").expect(\"Regex construction failed\");\n\n\n\n let orders =\n\n collections\n\n .orders()\n\n .flat_map(move |o| if !regex.is_match(&o.comment) { Some(o.cust_key) } else { None } );\n\n\n\n collections\n\n .customers()\n\n .map(|c| c.cust_key)\n\n .concat(&orders)\n\n .count_total()\n\n .map(|(_cust_key, count)| (count-1) as usize)\n\n .count_total()\n\n // .inspect(|x| println!(\"{:?}\", x))\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query13.rs","rank":47,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n println!(\"TODO: Q20 uses a `reduce_abelian` to get an arrangement, but could use `count_total`\");\n\n\n\n let partkeys = collections.parts.filter(|p| p.name.as_bytes() == b\"forest\").map(|p| p.part_key);\n\n\n\n let available =\n\n collections\n\n .lineitems()\n\n .flat_map(|l|\n\n if l.ship_date >= create_date(1994, 1, 1) && l.ship_date < create_date(1995, 1, 1) {\n\n Some((l.part_key, (l.supp_key, l.quantity)))\n\n }\n\n else { None }\n\n )\n\n .semijoin(&partkeys)\n\n .explode(|l| Some(((((l.0 as u64) << 32) + (l.1).0 as u64, ()), (l.1).1 as isize)))\n\n .reduce_abelian::<_,DefaultValTrace<_,_,_,_>>(\"Reduce\", |_k,s,t| t.push((s[0].1, 1)));\n\n\n","file_path":"tpchlike/src/queries/query20.rs","rank":48,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let regex = Regex::new(\"Customer.*Complaints\").expect(\"Regex construction failed\");\n\n\n\n let suppliers =\n\n collections\n\n .suppliers()\n\n .flat_map(move |s| if regex.is_match(&s.comment) { Some(s.supp_key) } else { None } );\n\n\n\n let parts = collections\n\n .partsupps()\n\n .map(|ps| (ps.supp_key, ps.part_key))\n\n .antijoin(&suppliers)\n\n .map(|(_supp_key, part_key)| part_key);\n\n\n\n collections\n\n .parts()\n\n .flat_map(|p|\n\n if !starts_with(&p.brand, b\"Brand#45\") && !starts_with(&p.typ.as_bytes(), b\"MEDIUM POLISHED\") && [49, 14, 23, 45, 19, 3, 36, 9].contains(&p.size) {\n","file_path":"tpchlike/src/queries/query16.rs","rank":49,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n println!(\"TODO: Q22 uses a `group` for counting to get an arrangement; could use `count_total`\");\n\n\n\n let customers =\n\n collections\n\n .customers()\n\n .flat_map(|c| {\n\n if c.acctbal > 0 {\n\n match &[c.phone[0], c.phone[1]] {\n\n b\"13\" | b\"31\" | b\"23\" | b\"29\" | b\"30\" | b\"18\" | b\"17\" => {\n\n Some((((c.phone[1] as u16) << 8) + c.phone[0] as u16, c.acctbal, c.cust_key))\n\n },\n\n _ => None,\n\n }\n\n }\n\n else { None }\n\n });\n\n\n","file_path":"tpchlike/src/queries/query22.rs","rank":50,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let nations =\n\n collections\n\n .nations()\n\n .filter(|n| starts_with(&n.name, b\"GERMANY\"))\n\n .map(|n| n.nation_key);\n\n\n\n let suppliers =\n\n collections\n\n .suppliers()\n\n .map(|s| (s.nation_key, s.supp_key))\n\n .semijoin(&nations)\n\n .map(|s| s.1);\n\n\n\n collections\n\n .partsupps()\n\n .explode(|x| Some(((x.supp_key, x.part_key), (x.supplycost as isize) * (x.availqty as isize))))\n\n .semijoin(&suppliers)\n\n .map(|(_, part_key)| ((), part_key))\n\n .reduce(|_part_key, s, t| {\n\n let threshold: isize = s.iter().map(|x| x.1 as isize).sum::<isize>() / 10000;\n\n t.extend(s.iter().filter(|x| x.1 > threshold).map(|&(&a,b)| (a, b)));\n\n })\n\n .map(|(_, part_key)| part_key)\n\n .count_total()\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query11.rs","rank":51,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let orders =\n\n collections\n\n .orders()\n\n .map(|o| (o.order_key, (o.cust_key, o.order_date, o.total_price)));\n\n\n\n collections\n\n .lineitems()\n\n .explode(|l| Some((l.order_key, l.quantity as isize)))\n\n .count_total()\n\n .filter(|&(_key, cnt)| cnt > 300)\n\n .join_map(&orders, |&o_key, &quant, &(cust_key, date, price)| (cust_key, (o_key, date, price, quant)))\n\n .join(&collections.customers().map(|c| (c.cust_key, c.name)))\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query18.rs","rank":52,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n println!(\"TODO: Q07 could use `join_core` to fuse map and filter\");\n\n\n\n let nations =\n\n collections\n\n .nations()\n\n .filter(|n| starts_with(&n.name, b\"FRANCE\") || starts_with(&n.name, b\"GERMANY\"))\n\n .map(|n| (n.nation_key, n.name));\n\n\n\n let customers =\n\n collections\n\n .customers()\n\n .map(|c| (c.nation_key, c.cust_key))\n\n .join_map(&nations, |_, &cust_key, &name| (cust_key, name));\n\n\n\n let orders =\n\n collections\n\n .orders()\n","file_path":"tpchlike/src/queries/query07.rs","rank":53,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let regions =\n\n collections\n\n .regions()\n\n .filter(|x| starts_with(&x.name[..], b\"ASIA\"))\n\n .map(|x| x.region_key);\n\n\n\n let nations =\n\n collections\n\n .nations()\n\n .map(|x| (x.region_key, x.nation_key))\n\n .semijoin(®ions)\n\n .map(|(_region_key, nation_key)| nation_key);\n\n\n\n let suppliers =\n\n collections\n\n .suppliers()\n\n .map(|x| (x.nation_key, x.supp_key))\n","file_path":"tpchlike/src/queries/query05.rs","rank":54,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let lineitems =\n\n collections\n\n .lineitems()\n\n .explode(|x|\n\n if (starts_with(&x.ship_mode, b\"AIR\") || starts_with(&x.ship_mode, b\"AIR REG\")) && starts_with(&x.ship_instruct, b\"DELIVER IN PERSON\") {\n\n Some(((x.part_key, x.quantity), (x.extended_price * (100 - x.discount) / 100) as isize))\n\n }\n\n else { None }\n\n );\n\n\n\n let lines1 = lineitems.filter(|&(_, quant)| quant >= 1 && quant <= 11).map(|x| x.0).arrange_by_self();\n\n let lines2 = lineitems.filter(|&(_, quant)| quant >= 10 && quant <= 20).map(|x| x.0).arrange_by_self();\n\n let lines3 = lineitems.filter(|&(_, quant)| quant >= 20 && quant <= 30).map(|x| x.0).arrange_by_self();\n\n\n\n let parts = collections.parts().map(|p| (p.part_key, (p.brand, p.container, p.size)));\n\n\n\n let parts1 = parts.filter(|&(_key, (brand, container, size))| starts_with(&brand, b\"Brand#12\") && 1 <= size && size <= 5 && (starts_with(&container, b\"SM CASE\") || starts_with(&container, b\"SM BOX\") || starts_with(&container, b\"SM PACK\") || starts_with(&container, b\"MED PKG\"))).map(|x| x.0).arrange_by_self();\n","file_path":"tpchlike/src/queries/query19.rs","rank":55,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let regions =\n\n collections\n\n .regions()\n\n .flat_map(|x| if starts_with(&x.name[..], b\"EUROPE\") { Some(x.region_key) } else { None });\n\n\n\n let nations =\n\n collections\n\n .nations()\n\n .map(|x| (x.region_key, (x.nation_key, x.name)))\n\n .semijoin(®ions)\n\n .map(|(_region_key, (nation_key, name))| (nation_key, name));\n\n\n\n let suppliers =\n\n collections\n\n .suppliers()\n\n .map(|x| (x.nation_key, (x.acctbal, x.name, x.address, x.phone, x.comment, x.supp_key)))\n\n .semijoin(&nations.map(|x| x.0))\n","file_path":"tpchlike/src/queries/query02.rs","rank":56,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n collections\n\n .lineitems()\n\n .explode(|x| {\n\n if (create_date(1994, 1, 1) <= x.ship_date) && (x.ship_date < create_date(1995, 1, 1)) && (5 <= x.discount) && (x.discount <= 7) && (x.quantity < 24) {\n\n Some(((), (x.extended_price * x.discount / 100) as isize))\n\n }\n\n else { None }\n\n })\n\n .count_total()\n\n // .inspect(|x| println!(\"{:?}\", x))\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query06.rs","rank":57,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let lineitems =\n\n collections\n\n .lineitems()\n\n .explode(|l|\n\n if create_date(1995,9,1) <= l.ship_date && l.ship_date < create_date(1995,10,1) {\n\n Some((l.part_key, (l.extended_price * (100 - l.discount) / 100) as isize ))\n\n }\n\n else { None }\n\n )\n\n .arrange_by_self();\n\n\n\n collections\n\n .parts()\n\n .explode(|p| Some((p.part_key, DiffPair::new(1, if starts_with(&p.typ.as_bytes(), b\"PROMO\") { 1 } else { 0 }))))\n\n .arrange_by_self()\n\n .join_core(&lineitems, |&_part_key, _, _| Some(()))\n\n .count_total()\n\n // .inspect(|x| println!(\"{:?}\", x))\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query14.rs","rank":58,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere\n\n G::Timestamp: Lattice+TotalOrder+Ord\n\n{\n\n collections\n\n .lineitems()\n\n .explode(|item|\n\n if item.ship_date <= ::types::create_date(1998, 9, 2) {\n\n Some(((item.return_flag[0], item.line_status[0]),\n\n DiffPair::new(item.quantity as isize,\n\n DiffPair::new(item.extended_price as isize,\n\n DiffPair::new((item.extended_price * (100 - item.discount) / 100) as isize,\n\n DiffPair::new((item.extended_price * (100 - item.discount) * (100 + item.tax) / 10000) as isize,\n\n DiffPair::new(item.discount as isize, 1)))))))\n\n }\n\n else {\n\n None\n\n }\n\n )\n\n .count_total()\n\n // .inspect(|x| println!(\"{:?}\", x))\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query01.rs","rank":59,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let lineitems =\n\n collections\n\n .lineitems()\n\n .explode(|x|\n\n if starts_with(&x.return_flag, b\"R\") {\n\n Some((x.order_key, (x.extended_price * (100 - x.discount)) as isize))\n\n }\n\n else { None }\n\n );\n\n\n\n let orders =\n\n collections\n\n .orders()\n\n .flat_map(|o|\n\n if create_date(1993,10,1) < o.order_date && o.order_date <= create_date(1994,1,1) {\n\n Some((o.order_key, o.cust_key))\n\n }\n","file_path":"tpchlike/src/queries/query10.rs","rank":60,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n println!(\"TODO: Q12 does contortions because isize doesn't implement Mul<DiffPair<isize, isize>>.\");\n\n\n\n let orders =\n\n collections\n\n .orders()\n\n .explode(|o|\n\n if starts_with(&o.order_priority, b\"1-URGENT\") || starts_with(&o.order_priority, b\"2-HIGH\") {\n\n Some((o.order_key, DiffPair::new(1, 0)))\n\n }\n\n else {\n\n Some((o.order_key, DiffPair::new(0, 1)))\n\n }\n\n )\n\n .arrange_by_self();\n\n\n\n let lineitems =\n\n collections\n","file_path":"tpchlike/src/queries/query12.rs","rank":61,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n println!(\"TODO: Q09 join order may be pessimal; could pivot to put lineitems last\");\n\n\n\n let parts =\n\n collections\n\n .parts()\n\n .flat_map(|x| if substring(&x.name.as_bytes(), b\"green\") { Some(x.part_key) } else { None } );\n\n\n\n collections\n\n .lineitems()\n\n .map(|l| (l.part_key, (l.supp_key, l.order_key, l.extended_price * (100 - l.discount) / 100, l.quantity)))\n\n .semijoin(&parts)\n\n .map(|(part_key, (supp_key, order_key, revenue, quantity))| ((part_key, supp_key), (order_key, revenue, quantity)))\n\n .join(&collections.partsupps().map(|ps| ((ps.part_key, ps.supp_key), ps.supplycost)))\n\n .explode(|((_part_key, supp_key), ((order_key, revenue, quantity), supplycost))|\n\n Some(((order_key, supp_key), ((revenue - supplycost * quantity) as isize)))\n\n )\n\n .join_map(&collections.orders().map(|o| (o.order_key, o.order_date >> 16)), |_, &supp_key, &order_year| (supp_key, order_year))\n\n .join_map(&collections.suppliers().map(|s| (s.supp_key, s.nation_key)), |_, &order_year, &nation_key| (nation_key, order_year))\n\n .join(&collections.nations().map(|n| (n.nation_key, n.name)))\n\n .count_total()\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query09.rs","rank":62,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let lineitems =\n\n collections\n\n .lineitems()\n\n .flat_map(|l| if l.commit_date < l.receipt_date { Some(l.order_key) } else { None })\n\n .distinct_total();\n\n\n\n collections\n\n .orders()\n\n .flat_map(|o|\n\n if o.order_date >= ::types::create_date(1993, 7, 1) && o.order_date < ::types::create_date(1993, 10, 1) {\n\n Some((o.order_key, o.order_priority))\n\n }\n\n else { None }\n\n )\n\n .semijoin(&lineitems)\n\n .map(|(_k,v)| v)\n\n .count_total()\n\n // .inspect(|x| println!(\"{:?}\", x))\n\n .probe_with(probe);\n\n}\n\n\n","file_path":"tpchlike/src/queries/query04.rs","rank":63,"score":208213.4998824624},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let parts =\n\n collections\n\n .parts() // We fluff out search strings to have the right lengths. \\\\\n\n .flat_map(|x| {\n\n if &x.brand[..8] == b\"Brand#23\" && &x.container[..7] == b\"MED BOX\" {\n\n Some(x.part_key)\n\n }\n\n else { None }\n\n });\n\n\n\n collections\n\n .lineitems()\n\n .map(|x| (x.part_key, (x.quantity, x.extended_price)))\n\n .semijoin(&parts)\n\n .reduce(|_k, s, t| {\n\n\n\n // determine the total and count of quantity.\n","file_path":"tpchlike/src/queries/query17.rs","rank":64,"score":208213.49988246243},{"content":"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\n\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\n\n\n\n let orders =\n\n collections\n\n .orders()\n\n .flat_map(|o|\n\n if starts_with(&o.order_status, b\"F\") { Some(o.order_key) }\n\n else { None }\n\n );\n\n\n\n // lineitems relevant to \"F\" orders.\n\n let lineitems =\n\n collections\n\n .lineitems()\n\n .map(|l| (l.order_key, (l.supp_key, l.receipt_date > l.commit_date)))\n\n .semijoin(&orders);\n\n\n\n let lateitems = lineitems.filter(|l| (l.1).1);\n\n let lateorders = lateitems.map(|l| l.0).distinct_total();\n","file_path":"tpchlike/src/queries/query21.rs","rank":65,"score":208213.49988246243},{"content":"/// Propagates labels forward, retaining the minimum label.\n\n///\n\n/// This variant takes a pre-arranged edge collection, to facilitate re-use, and allows\n\n/// a method `logic` to specify the rounds in which we introduce various labels. The output\n\n/// of `logic should be a number in the interval [0,64],\n\npub fn propagate_core<G, N, L, Tr, F, R>(edges: &Arranged<G,Tr>, nodes: &Collection<G,(N,L),R>, logic: F) -> Collection<G,(N,L),R>\n\nwhere\n\n G: Scope,\n\n G::Timestamp: Lattice+Ord,\n\n N: ExchangeData+Hash,\n\n R: ExchangeData+Abelian,\n\n R: Mul<R, Output=R>,\n\n R: From<i8>,\n\n L: ExchangeData,\n\n Tr: TraceReader<Key=N, Val=N, Time=G::Timestamp, R=R>+Clone+'static,\n\n Tr::Batch: crate::trace::BatchReader<N, N, G::Timestamp, Tr::R>+'static,\n\n Tr::Cursor: crate::trace::Cursor<N, N, G::Timestamp, Tr::R>+'static,\n\n F: Fn(&L)->u64+Clone+'static,\n\n{\n\n // Morally the code performs the following iterative computation. However, in the interest of a simplified\n\n // dataflow graph and reduced memory footprint we instead have a wordier version below. The core differences\n\n // between the two are that 1. the former filters its input and pretends to perform non-monotonic computation,\n\n // whereas the latter creates an initially empty monotonic iteration variable, and 2. the latter rotates the\n\n // iterative computation so that the arrangement produced by `reduce` can be re-used.\n\n\n","file_path":"src/algorithms/graphs/propagate.rs","rank":66,"score":202952.39720036724},{"content":"/// Propagates labels forward, retaining the minimum label.\n\n///\n\n/// This algorithm naively propagates all labels at once, much like standard label propagation.\n\n/// To more carefully control the label propagation, consider `propagate_core` which supports a\n\n/// method to limit the introduction of labels.\n\npub fn propagate_at<G, N, L, F, R>(edges: &Collection<G, (N,N), R>, nodes: &Collection<G,(N,L),R>, logic: F) -> Collection<G,(N,L),R>\n\nwhere\n\n G: Scope,\n\n G::Timestamp: Lattice+Ord,\n\n N: ExchangeData+Hash,\n\n R: ExchangeData+Abelian,\n\n R: Mul<R, Output=R>,\n\n R: From<i8>,\n\n L: ExchangeData,\n\n F: Fn(&L)->u64+Clone+'static,\n\n{\n\n propagate_core(&edges.arrange_by_key(), nodes, logic)\n\n}\n\n\n\nuse trace::TraceReader;\n\nuse operators::arrange::arrangement::Arranged;\n\n\n","file_path":"src/algorithms/graphs/propagate.rs","rank":67,"score":202149.53089895178},{"content":"fn triangles<G: Scope>(edges: &Collection<G, Edge>) -> Collection<G, (Node, Node, Node)>\n\nwhere G::Timestamp: Lattice+Hash+Ord {\n\n\n\n // only use forward-pointing edges.\n\n let edges = edges.filter(|&(src, dst)| src < dst);\n\n\n\n // arrange the edge relation three ways.\n\n let as_self = edges.arrange_by_self();\n\n let forward = edges.arrange_by_key();\n\n let reverse = edges.map_in_place(|x| ::std::mem::swap(&mut x.0, &mut x.1))\n\n .arrange_by_key();\n\n\n\n // arrange the count of extensions from each source.\n\n let counts = edges.map(|(src, _dst)| src)\n\n .arrange_by_self();\n\n\n\n // extract ((src, dst), idx) tuples with weights equal to the number of extensions.\n\n let cand_count1 = forward.join_core(&counts, |&src, &dst, &()| Some(((src, dst), 1)));\n\n let cand_count2 = reverse.join_core(&counts, |&dst, &src, &()| Some(((src, dst), 2)));\n\n\n","file_path":"dogsdogsdogs/examples/ngo.rs","rank":68,"score":200829.5973722318},{"content":"// Generate synthetic interactions with a skewed distribution\n\nfn generate_interactions<R>(how_many: usize, rng: &mut R) -> Vec<(u32,u32)> where R: Rng {\n\n let mut interactions = Vec::with_capacity(how_many);\n\n\n\n let mut user_sampler = CRP::new(6000.0, 0.35);\n\n let mut item_sampler = CRP::new(6000.0, 0.35);\n\n\n\n for _ in 0 .. how_many {\n\n let user = user_sampler.sample(rng);\n\n let item = item_sampler.sample(rng);\n\n interactions.push((user, item));\n\n }\n\n\n\n interactions\n\n}\n","file_path":"examples/itembased_cf.rs","rank":69,"score":199960.6201059934},{"content":"/// Returns pairs (node, dist) indicating distance of each node from a root.\n\npub fn bfs<G, N>(edges: &Collection<G, (N,N)>, roots: &Collection<G, N>) -> Collection<G, (N,u32)>\n\nwhere\n\n G: Scope,\n\n G::Timestamp: Lattice+Ord,\n\n N: ExchangeData+Hash,\n\n{\n\n use operators::arrange::arrangement::ArrangeByKey;\n\n let edges = edges.arrange_by_key();\n\n bfs_arranged(&edges, roots)\n\n}\n\n\n\nuse crate::trace::TraceReader;\n\nuse crate::operators::arrange::Arranged;\n\n\n","file_path":"src/algorithms/graphs/bfs.rs","rank":70,"score":198264.63813113488},{"content":"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\n\nfn bfs<G: Scope>(edges: &Collection<G, Edge, MinSum>, roots: &Collection<G, Node, MinSum>) -> Collection<G, Node, MinSum>\n\nwhere G::Timestamp: Lattice+Ord {\n\n\n\n // repeatedly update minimal distances each node can be reached from each root\n\n roots.scope().iterative::<u32,_,_>(|scope| {\n\n\n\n use differential_dataflow::operators::iterate::SemigroupVariable;\n\n use differential_dataflow::operators::reduce::ReduceCore;\n\n use differential_dataflow::trace::implementations::ord::OrdKeySpine as DefaultKeyTrace;\n\n\n\n\n\n use timely::order::Product;\n\n let variable = SemigroupVariable::new(scope, Product::new(Default::default(), 1));\n\n\n\n let edges = edges.enter(scope);\n\n let roots = roots.enter(scope);\n\n\n\n let result =\n\n variable\n\n .map(|n| (n,()))\n","file_path":"examples/monoid-bfs.rs","rank":71,"score":197548.57929519942},{"content":"/// Returns pairs (node, dist) indicating distance of each node from a root.\n\npub fn bfs_arranged<G, N, Tr>(edges: &Arranged<G, Tr>, roots: &Collection<G, N>) -> Collection<G, (N, u32)>\n\nwhere\n\n G: Scope,\n\n G::Timestamp: Lattice+Ord,\n\n N: ExchangeData+Hash,\n\n Tr: TraceReader<Key=N, Val=N, Time=G::Timestamp, R=isize>+Clone+'static,\n\n Tr::Batch: crate::trace::BatchReader<N, N, G::Timestamp, Tr::R>+'static,\n\n Tr::Cursor: crate::trace::Cursor<N, N, G::Timestamp, Tr::R>+'static,\n\n{\n\n // initialize roots as reaching themselves at distance 0\n\n let nodes = roots.map(|x| (x, 0));\n\n\n\n // repeatedly update minimal distances each node can be reached from each root\n\n nodes.iterate(|inner| {\n\n\n\n let edges = edges.enter(&inner.scope());\n\n let nodes = nodes.enter(&inner.scope());\n\n\n\n inner.join_core(&edges, |_k,l,d| Some((d.clone(), l+1)))\n\n .concat(&nodes)\n\n .reduce(|_, s, t| t.push((s[0].0.clone(), 1)))\n\n })\n\n}","file_path":"src/algorithms/graphs/bfs.rs","rank":72,"score":195282.3297459216},{"content":"fn _reachability<G: Scope>(edges: &Collection<G, Edge>, nodes: &Collection<G, (Node, Node)>) -> Collection<G, Edge>\n\nwhere G::Timestamp: Lattice+Ord+Hash {\n\n\n\n edges.filter(|_| false)\n\n .iterate(|inner| {\n\n let edges = edges.enter(&inner.scope());\n\n let nodes = nodes.enter_at(&inner.scope(), |r| 256 * (64 - (r.0 as u64).leading_zeros() as u64));\n\n\n\n inner.join_map(&edges, |_k,l,d| (*d,*l))\n\n .concat(&nodes)\n\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\n\n\n\n })\n\n}\n","file_path":"tests/scc.rs","rank":73,"score":194494.05172426775},{"content":"type TraceBatch = OrdValBatch<usize, usize, RootTime, isize>;\n","file_path":"server/src/lib.rs","rank":74,"score":191018.3791368112},{"content":"fn visit(node: usize, forward: &HashMap<usize, Vec<usize>>, visited: &mut HashSet<usize>, list: &mut Vec<usize>) {\n\n if !visited.contains(&node) {\n\n visited.insert(node);\n\n if let Some(edges) = forward.get(&node) {\n\n for &edge in edges.iter() {\n\n visit(edge, forward, visited, list)\n\n }\n\n }\n\n list.push(node);\n\n }\n\n}\n\n\n","file_path":"tests/scc.rs","rank":75,"score":185770.7911406774},{"content":"fn _color<G, N>(edges: &Collection<G, (N,N)>) -> Collection<G,(N,Option<u32>)>\n\nwhere\n\n G: Scope,\n\n G::Timestamp: Lattice+Ord,\n\n N: ExchangeData+Hash,\n\n{\n\n // need some bogus initial values.\n\n let start = edges.map(|(x,_y)| (x,u32::max_value()))\n\n .distinct();\n\n\n\n // repeatedly apply color-picking logic.\n\n sequence(&start, &edges, |_node, vals| {\n\n\n\n // look for the first absent positive integer.\n\n // start at 1 in case we ever use NonZero<u32>.\n\n\n\n (1u32 ..)\n\n .filter(|&i| vals.get(i as usize - 1).map(|x| *x.0) != Some(i))\n\n .next()\n\n .unwrap()\n\n })\n\n}\n\n\n","file_path":"src/algorithms/graphs/sequential.rs","rank":76,"score":182900.11177307827},{"content":"fn get_trace() -> Spine<UnsignedWrapper<u64>, u64, usize, i64, Rc<OrdValBatch<UnsignedWrapper<u64>, u64, usize, i64>>> {\n\n let op_info = OperatorInfo::new(0, 0, &[]);\n\n let mut trace = IntegerTrace::new(op_info, None, None);\n\n {\n\n let mut batcher = <<IntegerTrace as TraceReader>::Batch as Batch<UnsignedWrapper<u64>, u64, usize, i64>>::Batcher::new();\n\n\n\n batcher.push_batch(&mut vec![\n\n ((1.into(), 2), 0, 1),\n\n ((2.into(), 3), 1, 1),\n\n ((2.into(), 3), 2, -1),\n\n ]);\n\n\n\n let batch_ts = &[1, 2, 3];\n\n let batches = batch_ts.iter().map(move |i| batcher.seal(Antichain::from_elem(*i)));\n\n for b in batches {\n\n trace.insert(b);\n\n }\n\n }\n\n trace\n\n}\n\n\n","file_path":"tests/trace.rs","rank":77,"score":182579.83456345863},{"content":"/// Read a command and its arguments.\n\nfn read_integers<'a>(input: impl Iterator<Item=&'a str>) -> Result<Vec<isize>, std::num::ParseIntError> {\n\n let mut integers = Vec::new();\n\n for text in input {\n\n integers.push(text.parse()?);\n\n }\n\n Ok(integers)\n\n}","file_path":"examples/multitemporal.rs","rank":78,"score":182128.3523159607},{"content":"fn copy_from_to(src: &[u8], dst: &mut [u8]) {\n\n let limit = if src.len() < dst.len() { src.len() } else { dst.len() };\n\n for index in 0 .. limit {\n\n dst[index] = src[index];\n\n }\n\n}\n\n\n","file_path":"tpchlike/src/types.rs","rank":79,"score":181795.43084477726},{"content":"fn main() {\n\n\n\n let mut args = std::env::args().skip(1);\n\n let prefix = args.next().expect(\"must supply path to facts\");\n\n let batch: Time = args.next().unwrap_or(\"1\".to_string()).parse().expect(\"batch must be an integer\");\n\n\n\n timely::execute_from_args(std::env::args(), move |worker| {\n\n\n\n let timer = ::std::time::Instant::now();\n\n let index = worker.index();\n\n\n\n let mut probe = ProbeHandle::new();\n\n\n\n // For interning strings.\n\n let interner = Rc::new(RefCell::new(StringInterner::new()));\n\n\n\n let mut inputs = (\n\n Vec::new(),\n\n Vec::new(),\n\n Vec::new(),\n","file_path":"doop/src/main.rs","rank":80,"score":177152.9297868865},{"content":"fn _strongly_connected<G: Scope>(graph: &Collection<G, Edge>) -> Collection<G, Edge>\n\nwhere G::Timestamp: Lattice+Ord+Hash {\n\n graph.iterate(|inner| {\n\n let edges = graph.enter(&inner.scope());\n\n let trans = edges.map_in_place(|x| mem::swap(&mut x.0, &mut x.1));\n\n _trim_edges(&_trim_edges(inner, &edges), &trans)\n\n })\n\n}\n\n\n","file_path":"tests/scc.rs","rank":81,"score":175987.9073013793},{"content":"fn test_sizes(nodes: usize, edges: usize, rounds: usize, config: Config) {\n\n\n\n let root_list = vec![(1, 0, 1)];\n\n let mut edge_list = Vec::new();\n\n\n\n let seed: &[_] = &[1, 2, 3, 4];\n\n let mut rng1: StdRng = SeedableRng::from_seed(seed); // rng for edge additions\n\n let mut rng2: StdRng = SeedableRng::from_seed(seed); // rng for edge deletions\n\n\n\n for _ in 0 .. edges {\n\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), 0, 1));\n\n }\n\n\n\n for round in 1 .. rounds {\n\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), round, 1));\n\n edge_list.push(((rng2.gen_range(0, nodes), rng2.gen_range(0, nodes)), round,-1));\n\n }\n\n\n\n let mut results1 = bfs_sequential(root_list.clone(), edge_list.clone());\n\n let mut results2 = bfs_differential(root_list.clone(), edge_list.clone(), config);\n","file_path":"tests/bfs.rs","rank":82,"score":175535.5698981652},{"content":"fn test_sizes(nodes: usize, edges: usize, rounds: usize, config: Config) {\n\n\n\n let mut edge_list = Vec::new();\n\n\n\n let seed: &[_] = &[1, 2, 3, 4];\n\n let mut rng1: StdRng = SeedableRng::from_seed(seed); // rng for edge additions\n\n let mut rng2: StdRng = SeedableRng::from_seed(seed); // rng for edge deletions\n\n\n\n for _ in 0 .. edges {\n\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), 0, 1));\n\n }\n\n\n\n for round in 1 .. rounds {\n\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), round, 1));\n\n edge_list.push(((rng2.gen_range(0, nodes), rng2.gen_range(0, nodes)), round,-1));\n\n }\n\n\n\n // for thing in edge_list.iter() {\n\n // println!(\"input: {:?}\", thing);\n\n // }\n","file_path":"tests/scc.rs","rank":83,"score":175535.5698981652},{"content":"/// Sorts and consolidates `vec`.\n\n///\n\n/// This method will sort `vec` and then consolidate runs of more than one entry with\n\n/// identical first elements by accumulating the second elements of the pairs. Should the final\n\n/// accumulation be zero, the element is discarded.\n\npub fn consolidate<T: Ord, R: Semigroup>(vec: &mut Vec<(T, R)>) {\n\n consolidate_from(vec, 0);\n\n}\n\n\n","file_path":"src/consolidation.rs","rank":84,"score":173834.8534790057},{"content":"type TraceSpine = Spine<usize, usize, RootTime, isize, Rc<TraceBatch>>;\n\npub type TraceHandle = TraceAgent<usize, usize, RootTime, isize, TraceSpine>;\n\n\n\n/// Arguments provided to each shared library to help build their dataflows and register their results.\n\npub type Environment<'a, 'b> = (\n\n &'a mut Child<'b, Worker<Allocator>,usize>,\n\n &'a mut TraceHandler,\n\n &'a mut ProbeHandle<RootTime>,\n\n &'a Instant,\n\n &'a [String]\n\n);\n\n\n\n/// A wrapper around types that keep their source libraries alive.\n\n///\n\n/// This type is meant to be a smart pointer for a type `T` that needs to keep\n\n/// a `Library` alive, perhaps because its methods would call in to the library.\n\n/// The type should have a specified drop order (viz RFC 1857) which guarentees\n\n/// that the shared library reference drops only after the element itself is\n\n/// dropped. It also implements `Deref` and `DerefMut` to provide the experience\n\n/// of a `T` itself.\n","file_path":"server/src/lib.rs","rank":85,"score":173254.92458231538},{"content":"/// Sorts and consolidates a slice, returning the valid prefix length.\n\npub fn consolidate_slice<T: Ord, R: Semigroup>(slice: &mut [(T, R)]) -> usize {\n\n\n\n // We could do an insertion-sort like initial scan which builds up sorted, consolidated runs.\n\n // In a world where there are not many results, we may never even need to call in to merge sort.\n\n slice.sort_by(|x,y| x.0.cmp(&y.0));\n\n\n\n // Counts the number of distinct known-non-zero accumulations. Indexes the write location.\n\n let mut offset = 0;\n\n for index in 1 .. slice.len() {\n\n\n\n // The following unsafe block elides various bounds checks, using the reasoning that `offset`\n\n // is always strictly less than `index` at the beginning of each iteration. This is initially\n\n // true, and in each iteration `offset` can increase by at most one (whereas `index` always\n\n // increases by one). As `index` is always in bounds, and `offset` starts at zero, it too is\n\n // always in bounds.\n\n //\n\n // LLVM appears to struggle to optimize out Rust's split_at_mut, which would prove disjointness\n\n // using run-time tests.\n\n unsafe {\n\n\n","file_path":"src/consolidation.rs","rank":86,"score":171403.57398581167},{"content":"fn main() {\n\n let rounds: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\n\n\n\n let mut summaries = timely::execute_from_args(std::env::args(), move |worker| {\n\n let mut probe = Handle::new();\n\n let (mut graph, mut graph_trace) = worker.dataflow(|scope| {\n\n let (graph_input, graph) = scope.new_collection();\n\n\n\n let graph_arr = graph.map(|(x, y): Edge| (x, (x, y))).arrange_by_key();\n\n let graph_trace = graph_arr.trace.clone();\n\n\n\n /* Be sure to attach probe to arrangements we want to enumerate;\n\n * so we know when all updates for a given epoch have been added to the arrangement. */\n\n graph_arr\n\n .as_collection(|_, v| *v)\n\n .consolidate()\n\n //.inspect(move |x| println!(\"{:?}\", x))\n\n .probe_with(&mut probe);\n\n\n\n /* Return `graph_trace`, so we can obtain cursor for the arrangement at runtime. */\n","file_path":"examples/cursors.rs","rank":87,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n let keys: usize = std::env::args().nth(1).unwrap().parse().unwrap();\n\n let batch: usize = 10_000;\n\n\n\n // This computation demonstrates in-place accumulation of arbitrarily large \n\n // volumes of input data, consuming space bounded by the number of distinct keys.\n\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\n\n\n\n let index = worker.index();\n\n let peers = worker.peers();\n\n\n\n let mut input = worker.dataflow::<(), _, _>(|scope| {\n\n let (input, data) = scope.new_collection::<_, isize>();\n\n data.consolidate();\n\n input\n\n });\n\n\n\n let seed: &[_] = &[1, 2, 3, 4];\n\n let mut rng: StdRng = SeedableRng::from_seed(seed);\n","file_path":"examples/accumulate.rs","rank":88,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n timely::execute_from_args(std::env::args(), move |worker| {\n\n\n\n let timer = worker.timer();\n\n let mut probe = Handle::new();\n\n\n\n let (mut nodes, mut edges, mut times) = worker.dataflow::<usize,_,_>(|scope| {\n\n\n\n let (node_input, nodes) = scope.new_collection();\n\n let (edge_input, edges) = scope.new_collection();\n\n let (time_input, times) = scope.new_collection();\n\n\n\n // Detect cycles that do not increment timestamps.\n\n find_cycles::<_,usize>(nodes.clone(), edges.clone())\n\n .inspect(move |x| println!(\"{:?}\\tcycles: {:?}\", timer.elapsed(), x))\n\n .probe_with(&mut probe);\n\n\n\n // Summarize all paths to inputs of operator zero.\n\n summarize::<_,usize>(nodes.clone(), edges.clone())\n","file_path":"examples/progress.rs","rank":89,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\n\n let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();\n\n let batch: usize = std::env::args().nth(3).unwrap().parse().unwrap();\n\n let pre: usize = std::env::args().nth(4).unwrap().parse().unwrap();\n\n let inspect: bool = std::env::args().nth(5).unwrap() == \"inspect\";\n\n\n\n\n\n // define a new timely dataflow computation.\n\n timely::execute_from_args(std::env::args().skip(6), move |worker| {\n\n\n\n let timer = ::std::time::Instant::now();\n\n\n\n let index = worker.index();\n\n let peers = worker.peers();\n\n\n\n let mut probe = timely::dataflow::operators::probe::Handle::new();\n\n\n\n // create a dataflow managing an ever-changing edge collection.\n","file_path":"examples/arrange.rs","rank":90,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\n\n let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();\n\n let batch: usize = std::env::args().nth(3).unwrap().parse().unwrap();\n\n let inspect: bool = std::env::args().nth(4).unwrap() == \"inspect\";\n\n let open_loop: bool = std::env::args().nth(5).unwrap() == \"open-loop\";\n\n\n\n // define a new computational scope, in which to run BFS\n\n timely::execute_from_args(std::env::args().skip(6), move |worker| {\n\n\n\n let timer = ::std::time::Instant::now();\n\n\n\n let index = worker.index();\n\n let peers = worker.peers();\n\n\n\n // create a degree counting differential dataflow\n\n let (mut input, probe) = worker.dataflow(|scope| {\n\n\n\n // create edge input, count a few ways.\n","file_path":"examples/degrees.rs","rank":91,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n timely::execute_from_args(std::env::args(), move |worker| {\n\n\n\n // Used to determine if our output has caught up to our input.\n\n let mut probe: ProbeHandle<Pair<isize, isize>> = ProbeHandle::new();\n\n\n\n let (mut input, mut capability, mut trace) =\n\n worker.dataflow(|scope| {\n\n\n\n // Create \"unordered\" inputs which provide their capabilities to users.\n\n // Here \"capability\" is a technical term, which is \"permission to send\n\n // data or after a certain timestamp\". When this capability is dropped\n\n // or downgraded, the input communicates that its possible timestamps\n\n // have advanced, and the system can start to make progress.\n\n let ((input, capability), data) = scope.new_unordered_input();\n\n\n\n let arrangement =\n\n data.as_collection()\n\n .count()\n","file_path":"examples/multitemporal.rs","rank":92,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n let large: usize = std::env::args().nth(1).unwrap().parse().unwrap();\n\n let small: usize = std::env::args().nth(2).unwrap().parse().unwrap();\n\n let batch: usize = std::env::args().nth(3).unwrap().parse().unwrap();\n\n let total: usize = std::env::args().nth(4).unwrap().parse().unwrap();\n\n\n\n // define a new timely dataflow computation.\n\n timely::execute_from_args(std::env::args().skip(3), move |worker| {\n\n\n\n let timer = ::std::time::Instant::now();\n\n\n\n let mut probe = timely::dataflow::operators::probe::Handle::new();\n\n\n\n // create a dataflow managing an ever-changing edge collection.\n\n \tlet mut handle = worker.dataflow(|scope| {\n\n let (handle, input) = scope.new_collection();\n\n input.distinct().probe_with(&mut probe);\n\n handle\n\n });\n","file_path":"examples/compact.rs","rank":93,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n // snag a filename to use for the input graph.\n\n let filename = std::env::args().nth(1).unwrap();\n\n let iterations: Iter = std::env::args().nth(2).unwrap().parse().unwrap();\n\n let inspect = std::env::args().nth(3) == Some(\"inspect\".to_string());\n\n\n\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\n\n\n\n let peers = worker.peers();\n\n let index = worker.index();\n\n let timer = worker.timer();\n\n\n\n let mut input = InputSession::new();\n\n let mut probe = ProbeHandle::new();\n\n\n\n worker.dataflow::<Time,_,_>(|scope| {\n\n let edges = input.to_collection(scope);\n\n pagerank(iterations, &edges)\n\n .filter(move |_| inspect)\n","file_path":"examples/pagerank.rs","rank":94,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n // snag a filename to use for the input graph.\n\n let filename = std::env::args().nth(1).unwrap();\n\n\n\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\n\n\n\n let peers = worker.peers();\n\n let index = worker.index();\n\n\n\n // // What you might do if you used GraphMMap:\n\n let graph = GraphMMap::new(&filename);\n\n let nodes = graph.nodes();\n\n let edges = (0..nodes).filter(move |node| node % peers == index)\n\n .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| ((node as u32, dst))))\n\n .map(|(src, dst)| ((src, dst), Default::default(), 1))\n\n .collect::<Vec<_>>();\n\n\n\n println!(\"loaded {} nodes, {} edges\", nodes, edges.len());\n\n\n\n worker.dataflow::<(),_,_>(|scope| {\n\n interpret(&Collection::new(edges.to_stream(scope)), &[(0,2), (1,2)]);\n\n });\n\n\n\n }).unwrap();\n\n}\n\n\n","file_path":"examples/interpreted.rs","rank":95,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n // define a new computational scope, in which to run BFS\n\n timely::execute_from_args(std::env::args(), move |worker| {\n\n \n\n // define BFS dataflow; return handles to roots and edges inputs\n\n let mut probe = Handle::new();\n\n let (mut rules, mut graph) = worker.dataflow(|scope| {\n\n\n\n let (rule_input, rules) = scope.new_collection();\n\n let (edge_input, graph) = scope.new_collection();\n\n\n\n let result = graph.iterate(|inner| {\n\n\n\n let rules = rules.enter(&inner.scope());\n\n let arranged = inner.arrange_by_key();\n\n\n\n // rule 0: remove self-loops:\n\n let freeze0 = freeze(&arranged, |t| {\n\n if t.inner <= 0 {\n","file_path":"examples/freeze.rs","rank":96,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n // define a new computational scope, in which to run BFS\n\n timely::execute_from_args(std::env::args(), move |worker| {\n\n\n\n // An input for (x,y,z) placements.\n\n let mut xyzs = InputSession::<_,_,isize>::new();\n\n\n\n // Inputs for (x,y) and (x,z) goals.\n\n let mut xy_goal = InputSession::new();\n\n let mut xz_goal = InputSession::new();\n\n\n\n let mut probe = Handle::new();\n\n\n\n // Dataflow to validate input against goals.\n\n worker.dataflow(|scope| {\n\n\n\n // Introduce inputs to the scope.\n\n let xyzs = xyzs.to_collection(scope);\n\n let xy_goal = xy_goal.to_collection(scope);\n","file_path":"examples/projekt.rs","rank":97,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\n\n let edges: u32 = std::env::args().nth(2).unwrap().parse().unwrap();\n\n let batch: u32 = std::env::args().nth(3).unwrap().parse().unwrap();\n\n let rounds: u32 = std::env::args().nth(4).unwrap().parse().unwrap();\n\n let inspect: bool = std::env::args().nth(5).unwrap() == \"inspect\";\n\n\n\n // define a new computational scope, in which to run BFS\n\n timely::execute_from_args(std::env::args(), move |worker| {\n\n\n\n if let Ok(addr) = ::std::env::var(\"DIFFERENTIAL_LOG_ADDR\") {\n\n\n\n eprintln!(\"enabled DIFFERENTIAL logging to {}\", addr);\n\n\n\n if let Ok(stream) = ::std::net::TcpStream::connect(&addr) {\n\n let writer = ::timely::dataflow::operators::capture::EventWriter::new(stream);\n\n let mut logger = ::timely::logging::BatchLogger::new(writer);\n\n worker.log_register().insert::<DifferentialEvent,_>(\"differential/arrange\", move |time, data|\n\n logger.publish_batch(time, data)\n","file_path":"examples/bfs.rs","rank":98,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n let mut args = std::env::args();\n\n args.next();\n\n\n\n let nodes: u32 = args.next().unwrap().parse().unwrap();\n\n let edges: usize = args.next().unwrap().parse().unwrap();\n\n let batch: u32 = args.next().unwrap().parse().unwrap();\n\n let inspect: bool = args.next().unwrap() == \"inspect\";\n\n\n\n // define a new computational scope, in which to run BFS\n\n timely::execute_from_args(std::env::args().skip(5), move |worker| {\n\n\n\n let timer = ::std::time::Instant::now();\n\n\n\n let index = worker.index();\n\n let peers = worker.peers();\n\n\n\n // create a degree counting differential dataflow\n\n let (mut input, probe) = worker.dataflow::<u32,_,_>(|scope| {\n","file_path":"examples/hello.rs","rank":99,"score":169558.44478451117}],"string":"[\n {\n \"content\": \"// Type aliases for differential execution.\\n\\ntype Time = u32;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 0,\n \"score\": 294510.99856603285\n },\n {\n \"content\": \"type Node = u32;\\n\\n\\n\",\n \"file_path\": \"src/trace/implementations/graph.rs\",\n \"rank\": 1,\n \"score\": 289060.6563150857\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn build((dataflow, handles, probe, timer, args): Environment) -> Result<(), String> {\\n\\n\\n\\n // This call either starts the production of random graph edges.\\n\\n //\\n\\n // The arguments should be\\n\\n //\\n\\n // <graph_name> <nodes> <edges> <rate>\\n\\n //\\n\\n // where <rate> is the target number of edge changes per second. The source\\n\\n // will play out changes to keep up with this, and timestamp them as if they\\n\\n // were emitted at the correct time. The timestamps use the system `timer`,\\n\\n // but only start whenever the method is called. This means that the data are\\n\\n // not deterministic, but if you subtract the elapsed time between system start\\n\\n // up and method call, they should be deterministic.\\n\\n //\\n\\n // The method also registers a capability with name `<graph_name>-capability`,\\n\\n // and will continue to execute until this capability is dropped from `handles`.\\n\\n // To terminate the operator it is sufficient to drop the capability, as the\\n\\n // operator holds only a weak reference to it.\\n\\n //\\n\",\n \"file_path\": \"server/dataflows/random_graph/src/lib.rs\",\n \"rank\": 2,\n \"score\": 283334.70969676506\n },\n {\n \"content\": \"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\\n\\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Node>) -> Collection<G, (Node, u32)>\\n\\nwhere G::Timestamp: Lattice+Ord {\\n\\n\\n\\n // initialize roots as reaching themselves at distance 0\\n\\n let nodes = roots.map(|x| (x, 0));\\n\\n\\n\\n // repeatedly update minimal distances each node can be reached from each root\\n\\n nodes.iterate(|inner| {\\n\\n\\n\\n let edges = edges.enter(&inner.scope());\\n\\n let nodes = nodes.enter(&inner.scope());\\n\\n\\n\\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\\n\\n .concat(&nodes)\\n\\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\\n\\n })\\n\\n}\",\n \"file_path\": \"examples/bfs.rs\",\n \"rank\": 3,\n \"score\": 273521.8120165493\n },\n {\n \"content\": \"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\\n\\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Node>) -> Collection<G, (Node, u32)>\\n\\nwhere G::Timestamp: Lattice+Ord {\\n\\n\\n\\n // initialize roots as reaching themselves at distance 0\\n\\n let nodes = roots.map(|x| (x, 0));\\n\\n\\n\\n // repeatedly update minimal distances each node can be reached from each root\\n\\n nodes.iterate(|inner| {\\n\\n\\n\\n let edges = edges.enter(&inner.scope());\\n\\n let nodes = nodes.enter(&inner.scope());\\n\\n\\n\\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\\n\\n .concat(&nodes)\\n\\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\\n\\n })\\n\\n}\",\n \"file_path\": \"examples/stackoverflow.rs\",\n \"rank\": 4,\n \"score\": 273521.8120165493\n },\n {\n \"content\": \"fn dump_cursor<Tr>(round: u32, index: usize, trace: &mut Tr)\\n\\nwhere\\n\\n Tr: TraceReader,\\n\\n Tr::Key: Debug + Clone,\\n\\n Tr::Val: Debug + Clone,\\n\\n Tr::Time: Debug + Clone,\\n\\n Tr::R: Debug + Clone,\\n\\n{\\n\\n let (mut cursor, storage) = trace.cursor();\\n\\n for ((k, v), diffs) in cursor.to_vec(&storage).iter() {\\n\\n println!(\\\"round {}, w{} {:?}:{:?}: {:?}\\\", round, index, *k, *v, diffs);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 6,\n \"score\": 265138.44606916915\n },\n {\n \"content\": \"fn read_u25(string: &str) -> [u8;25] { let mut buff = [0;25]; copy_from_to(string.as_bytes(), &mut buff); buff }\\n\\n\\n\\nunsafe_abomonate!(AbomonationWrapper<ArrayString<[u8; 25]>>);\\n\\nunsafe_abomonate!(AbomonationWrapper<ArrayString<[u8; 40]>>);\\n\\nunsafe_abomonate!(AbomonationWrapper<ArrayString<[u8; 128]>>);\\n\\n\\n\\n#[derive(Ord,PartialOrd,Eq,PartialEq,Clone,Copy,Debug,Hash,Default)]\\n\\npub struct AbomonationWrapper<T> {\\n\\n pub element: T,\\n\\n}\\n\\n\\n\\nuse ::std::ops::Deref;\\n\\nimpl<T> Deref for AbomonationWrapper<T> {\\n\\n type Target = T;\\n\\n fn deref(&self) -> &Self::Target {\\n\\n &self.element\\n\\n }\\n\\n}\\n\\n\\n\\nunsafe_abomonate!(Part);\\n\",\n \"file_path\": \"tpchlike/src/types.rs\",\n \"rank\": 7,\n \"score\": 265036.73541693133\n },\n {\n \"content\": \"fn read_u10(string: &str) -> [u8;10] { let mut buff = [0;10]; copy_from_to(string.as_bytes(), &mut buff); buff }\\n\",\n \"file_path\": \"tpchlike/src/types.rs\",\n \"rank\": 8,\n \"score\": 265036.73541693133\n },\n {\n \"content\": \"fn read_u15(string: &str) -> [u8;15] { let mut buff = [0;15]; copy_from_to(string.as_bytes(), &mut buff); buff }\\n\",\n \"file_path\": \"tpchlike/src/types.rs\",\n \"rank\": 9,\n \"score\": 265036.73541693133\n },\n {\n \"content\": \"fn read_u01(string: &str) -> [u8;1] { let mut buff = [0;1]; copy_from_to(string.as_bytes(), &mut buff); buff }\\n\",\n \"file_path\": \"tpchlike/src/types.rs\",\n \"rank\": 10,\n \"score\": 265036.73541693133\n },\n {\n \"content\": \"type Time = u32;\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 11,\n \"score\": 253688.27089614252\n },\n {\n \"content\": \"type Time = u32;\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 12,\n \"score\": 253688.27089614252\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 13,\n \"score\": 253093.0110743976\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/stackoverflow.rs\",\n \"rank\": 14,\n \"score\": 253093.0110743976\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 15,\n \"score\": 253093.0110743976\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/interpreted.rs\",\n \"rank\": 16,\n \"score\": 253093.0110743976\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/bfs.rs\",\n \"rank\": 17,\n \"score\": 253093.0110743976\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"dogsdogsdogs/examples/ngo.rs\",\n \"rank\": 19,\n \"score\": 249070.47743759854\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/monoid-bfs.rs\",\n \"rank\": 20,\n \"score\": 249070.4774375985\n },\n {\n \"content\": \"/// Enables logging of differential dataflow events.\\n\\npub fn enable<A, W>(worker: &mut timely::worker::Worker<A>, writer: W) -> Option<Box<dyn std::any::Any+'static>>\\n\\nwhere\\n\\n A: timely::communication::Allocate,\\n\\n W: std::io::Write+'static,\\n\\n{\\n\\n let writer = ::timely::dataflow::operators::capture::EventWriter::new(writer);\\n\\n let mut logger = ::timely::logging::BatchLogger::new(writer);\\n\\n worker\\n\\n .log_register()\\n\\n .insert::<DifferentialEvent,_>(\\\"differential/arrange\\\", move |time, data| logger.publish_batch(time, data))\\n\\n}\\n\\n\\n\\n/// Possible different differential events.\\n\\n#[derive(Debug, Clone, Abomonation, Ord, PartialOrd, Eq, PartialEq)]\\n\\npub enum DifferentialEvent {\\n\\n /// Batch creation.\\n\\n Batch(BatchEvent),\\n\\n /// Merge start and stop events.\\n\\n Merge(MergeEvent),\\n\\n /// Batch dropped when trace dropped.\\n\",\n \"file_path\": \"src/logging.rs\",\n \"rank\": 21,\n \"score\": 233140.2729517994\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\\n#[test] fn bfs_10_20_1000() { test_sizes(10, 20, 1000, Config::process(3)); }\\n\\n#[test] fn bfs_100_200_10() { test_sizes(100, 200, 10, Config::process(3)); }\\n\\n#[test] fn bfs_100_2000_1() { test_sizes(100, 2000, 1, Config::process(3)); }\\n\\n\\n\",\n \"file_path\": \"tests/bfs.rs\",\n \"rank\": 22,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"examples/interpreted.rs\",\n \"rank\": 23,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 24,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 25,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\\n#[test] fn scc_10_20_1000() { test_sizes(10, 20, 1000, Config::process(3)); }\\n\\n#[test] fn scc_100_200_10() { test_sizes(100, 200, 10, Config::process(3)); }\\n\\n#[test] fn scc_100_2000_1() { test_sizes(100, 2000, 1, Config::process(3)); }\\n\\n\\n\",\n \"file_path\": \"tests/scc.rs\",\n \"rank\": 26,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"examples/bfs.rs\",\n \"rank\": 27,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\",\n \"file_path\": \"examples/graspan.rs\",\n \"rank\": 28,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"examples/stackoverflow.rs\",\n \"rank\": 29,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"fn assign(node: usize, root: usize, reverse: &HashMap<usize, Vec<usize>>, component: &mut HashMap<usize, usize>) {\\n\\n if !component.contains_key(&node) {\\n\\n component.insert(node, root);\\n\\n if let Some(edges) = reverse.get(&node) {\\n\\n for &edge in edges.iter() {\\n\\n assign(edge, root, reverse, component);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/scc.rs\",\n \"rank\": 30,\n \"score\": 224895.80643971608\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn build((dataflow, handles, probe, _timer, args): Environment) -> Result<(), String> {\\n\\n\\n\\n if args.len() != 2 { return Err(format!(\\\"expected two arguments; instead: {:?}\\\", args)); }\\n\\n\\n\\n let edges = handles\\n\\n .get_mut::<Rc<RefCell<Option<TraceHandle>>>>(&args[0])?\\n\\n .borrow_mut().as_mut().unwrap().import(dataflow);\\n\\n\\n\\n let source = args[1].parse::<usize>().map_err(|_| format!(\\\"parse error, source: {:?}\\\", args[1]))?; \\n\\n let (_input, query) = dataflow.new_collection_from(Some(source));\\n\\n\\n\\n let timer = ::std::time::Instant::now();\\n\\n\\n\\n query\\n\\n .map(|x| (x, x))\\n\\n .join_core(&edges, |_n, &q, &d| Some((d, q))) // one hop\\n\\n .join_core(&edges, |_n, &q, &d| Some((d, q))) // two hops\\n\\n .join_core(&edges, |_n, &q, &d| Some((d, q))) // three hops\\n\\n .map(|x| x.1)\\n\\n .consolidate()\\n\\n .inspect(move |x| println!(\\\"{:?}:\\\\t{:?}\\\", timer.elapsed(), x))\\n\\n .probe_with(probe);\\n\\n\\n\\n Ok(())\\n\\n}\",\n \"file_path\": \"server/dataflows/neighborhood/src/lib.rs\",\n \"rank\": 31,\n \"score\": 222903.30899012528\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn build((dataflow, handles, probe, _timer, args): Environment) -> Result<(), String> {\\n\\n\\n\\n if args.len() != 2 { return Err(format!(\\\"expected two arguments; instead: {:?}\\\", args)); }\\n\\n\\n\\n let edges = handles\\n\\n .get_mut::<Rc<RefCell<Option<TraceHandle>>>>(&args[0])?\\n\\n .borrow_mut().as_mut().unwrap().import(dataflow);\\n\\n\\n\\n let source = args[1].parse::<usize>().map_err(|_| format!(\\\"parse error, source: {:?}\\\", args[1]))?; \\n\\n let (_input, roots) = dataflow.new_collection_from(Some(source));\\n\\n\\n\\n // repeatedly update minimal distances each node can be reached from each root\\n\\n roots.iterate(|dists| {\\n\\n let edges = edges.enter(&dists.scope());\\n\\n let roots = roots.enter(&dists.scope());\\n\\n dists.arrange_by_self()\\n\\n .join_core(&edges, |_src, _, &dst| Some(dst))\\n\\n .concat(&roots)\\n\\n .distinct()\\n\\n })\\n\\n .probe_with(probe);\\n\\n\\n\\n Ok(())\\n\\n}\",\n \"file_path\": \"server/dataflows/reachability/src/lib.rs\",\n \"rank\": 32,\n \"score\": 222903.30899012528\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"dogsdogsdogs/examples/ngo.rs\",\n \"rank\": 34,\n \"score\": 222835.71298371206\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\\n#[derive(Abomonation, Copy, Ord, PartialOrd, Eq, PartialEq, Debug, Clone, Serialize, Deserialize, Hash)]\\n\\npub struct MinSum {\\n\\n value: u32,\\n\\n}\\n\\n\\n\\nuse std::ops::{AddAssign, Mul};\\n\\nuse differential_dataflow::difference::Semigroup;\\n\\n\\n\\nimpl<'a> AddAssign<&'a Self> for MinSum {\\n\\n fn add_assign(&mut self, rhs: &'a Self) {\\n\\n self.value = std::cmp::min(self.value, rhs.value);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Mul<Self> for MinSum {\\n\\n type Output = Self;\\n\\n fn mul(self, rhs: Self) -> Self {\\n\\n MinSum { value: self.value + rhs.value }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Semigroup for MinSum {\\n\\n fn is_zero(&self) -> bool { false }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/monoid-bfs.rs\",\n \"rank\": 35,\n \"score\": 222835.71298371206\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn build((dataflow, handles, probe, _timer, args): Environment) -> Result<(), String> {\\n\\n\\n\\n if args.len() != 1 { return Err(format!(\\\"expected one argument, instead: {:?}\\\", args)); }\\n\\n\\n\\n handles\\n\\n .get_mut::<Rc<RefCell<Option<TraceHandle>>>>(&args[0])?\\n\\n .borrow_mut().as_mut().unwrap()\\n\\n .import(dataflow)\\n\\n .as_collection(|&src,_dst| src)\\n\\n .count_total()\\n\\n .map(|(_deg, cnt)| cnt as usize)\\n\\n .count_total()\\n\\n .probe_with(probe);\\n\\n\\n\\n Ok(())\\n\\n}\",\n \"file_path\": \"server/dataflows/degr_dist/src/lib.rs\",\n \"rank\": 36,\n \"score\": 219838.94394000177\n },\n {\n \"content\": \"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\\n\\nfn bfs<G: Scope>(edges: &Collection<G, Edge>, roots: &Collection<G, Node>) -> Collection<G, (Node, usize)>\\n\\nwhere G::Timestamp: Lattice+Ord {\\n\\n\\n\\n // initialize roots as reaching themselves at distance 0\\n\\n let nodes = roots.map(|x| (x, 0));\\n\\n\\n\\n // repeatedly update minimal distances each node can be reached from each root\\n\\n nodes.iterate(|inner| {\\n\\n\\n\\n let edges = edges.enter(&inner.scope());\\n\\n let nodes = nodes.enter(&inner.scope());\\n\\n\\n\\n inner.join_map(&edges, |_k,l,d| (*d, l+1))\\n\\n .concat(&nodes)\\n\\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"tests/bfs.rs\",\n \"rank\": 37,\n \"score\": 214965.4824300761\n },\n {\n \"content\": \"/// Propagates labels forward, retaining the minimum label.\\n\\n///\\n\\n/// This algorithm naively propagates all labels at once, much like standard label propagation.\\n\\n/// To more carefully control the label propagation, consider `propagate_core` which supports a\\n\\n/// method to limit the introduction of labels.\\n\\npub fn propagate<G, N, L, R>(edges: &Collection<G, (N,N), R>, nodes: &Collection<G,(N,L),R>) -> Collection<G,(N,L),R>\\n\\nwhere\\n\\n G: Scope,\\n\\n G::Timestamp: Lattice+Ord,\\n\\n N: ExchangeData+Hash,\\n\\n R: ExchangeData+Abelian,\\n\\n R: Mul<R, Output=R>,\\n\\n R: From<i8>,\\n\\n L: ExchangeData,\\n\\n{\\n\\n propagate_core(&edges.arrange_by_key(), nodes, |_label| 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/algorithms/graphs/propagate.rs\",\n \"rank\": 38,\n \"score\": 211521.45495163626\n },\n {\n \"content\": \"type Iter = u32;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 39,\n \"score\": 210647.21909271507\n },\n {\n \"content\": \"type Number = u32;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 40,\n \"score\": 210647.21909271507\n },\n {\n \"content\": \"type Symbol = u32;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 41,\n \"score\": 210647.21909271507\n },\n {\n \"content\": \"/// Introduces differential options to a timely configuration.\\n\\npub fn configure(config: &mut timely::WorkerConfig, options: &Config) {\\n\\n if let Some(effort) = options.idle_merge_effort {\\n\\n config.set(\\\"differential/idle_merge_effort\\\".to_string(), effort);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 42,\n \"score\": 210616.34569801207\n },\n {\n \"content\": \"type Result = std::sync::mpsc::Receiver<timely::dataflow::operators::capture::Event<usize, ((u64, i64), usize, i64)>>;\\n\\n\\n\",\n \"file_path\": \"tests/import.rs\",\n \"rank\": 43,\n \"score\": 209117.31130603747\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n // revenue by supplier\\n\\n let revenue =\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|item|\\n\\n if create_date(1996, 1, 1) <= item.ship_date && item.ship_date < create_date(1996,4,1) {\\n\\n Some((item.supp_key, (item.extended_price * (100 - item.discount) / 100) as isize))\\n\\n }\\n\\n else { None }\\n\\n );\\n\\n\\n\\n // suppliers with maximum revenue\\n\\n let top_suppliers =\\n\\n revenue\\n\\n // do a hierarchical min, to improve update perf.\\n\\n .map(|key| ((key % 1000) as u16, key))\\n\\n .reduce(|_k, s, t| {\\n\",\n \"file_path\": \"tpchlike/src/queries/query15.rs\",\n \"rank\": 44,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let regions = collections.regions().filter(|r| starts_with(&r.name, b\\\"AMERICA\\\")).map(|r| r.region_key);\\n\\n let nations1 = collections.nations().map(|n| (n.region_key, n.nation_key)).semijoin(®ions).map(|x| x.1);\\n\\n let customers = collections.customers().map(|c| (c.nation_key, c.cust_key)).semijoin(&nations1).map(|x| x.1);\\n\\n let orders =\\n\\n collections\\n\\n .orders()\\n\\n .flat_map(|o|\\n\\n if create_date(1995,1,1) <= o.order_date && o.order_date <= create_date(1996, 12, 31) {\\n\\n Some((o.cust_key, (o.order_key, o.order_date >> 16)))\\n\\n }\\n\\n else { None }\\n\\n )\\n\\n .semijoin(&customers)\\n\\n .map(|x| x.1);\\n\\n\\n\\n let nations2 = collections.nations.map(|n| (n.nation_key, starts_with(&n.name, b\\\"BRAZIL\\\")));\\n\\n let suppliers =\\n\",\n \"file_path\": \"tpchlike/src/queries/query08.rs\",\n \"rank\": 45,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let customers =\\n\\n collections\\n\\n .customers()\\n\\n .flat_map(|c| if starts_with(&c.mktsegment[..], b\\\"BUILDING\\\") { Some(c.cust_key) } else { None });\\n\\n\\n\\n let lineitems =\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|l|\\n\\n if l.ship_date > create_date(1995, 3, 15) {\\n\\n Some((l.order_key, (l.extended_price * (100 - l.discount) / 100) as isize))\\n\\n }\\n\\n else { None }\\n\\n );\\n\\n\\n\\n let orders =\\n\\n collections\\n\",\n \"file_path\": \"tpchlike/src/queries/query03.rs\",\n \"rank\": 46,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let regex = Regex::new(\\\"special.*requests\\\").expect(\\\"Regex construction failed\\\");\\n\\n\\n\\n let orders =\\n\\n collections\\n\\n .orders()\\n\\n .flat_map(move |o| if !regex.is_match(&o.comment) { Some(o.cust_key) } else { None } );\\n\\n\\n\\n collections\\n\\n .customers()\\n\\n .map(|c| c.cust_key)\\n\\n .concat(&orders)\\n\\n .count_total()\\n\\n .map(|(_cust_key, count)| (count-1) as usize)\\n\\n .count_total()\\n\\n // .inspect(|x| println!(\\\"{:?}\\\", x))\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query13.rs\",\n \"rank\": 47,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n println!(\\\"TODO: Q20 uses a `reduce_abelian` to get an arrangement, but could use `count_total`\\\");\\n\\n\\n\\n let partkeys = collections.parts.filter(|p| p.name.as_bytes() == b\\\"forest\\\").map(|p| p.part_key);\\n\\n\\n\\n let available =\\n\\n collections\\n\\n .lineitems()\\n\\n .flat_map(|l|\\n\\n if l.ship_date >= create_date(1994, 1, 1) && l.ship_date < create_date(1995, 1, 1) {\\n\\n Some((l.part_key, (l.supp_key, l.quantity)))\\n\\n }\\n\\n else { None }\\n\\n )\\n\\n .semijoin(&partkeys)\\n\\n .explode(|l| Some(((((l.0 as u64) << 32) + (l.1).0 as u64, ()), (l.1).1 as isize)))\\n\\n .reduce_abelian::<_,DefaultValTrace<_,_,_,_>>(\\\"Reduce\\\", |_k,s,t| t.push((s[0].1, 1)));\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query20.rs\",\n \"rank\": 48,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let regex = Regex::new(\\\"Customer.*Complaints\\\").expect(\\\"Regex construction failed\\\");\\n\\n\\n\\n let suppliers =\\n\\n collections\\n\\n .suppliers()\\n\\n .flat_map(move |s| if regex.is_match(&s.comment) { Some(s.supp_key) } else { None } );\\n\\n\\n\\n let parts = collections\\n\\n .partsupps()\\n\\n .map(|ps| (ps.supp_key, ps.part_key))\\n\\n .antijoin(&suppliers)\\n\\n .map(|(_supp_key, part_key)| part_key);\\n\\n\\n\\n collections\\n\\n .parts()\\n\\n .flat_map(|p|\\n\\n if !starts_with(&p.brand, b\\\"Brand#45\\\") && !starts_with(&p.typ.as_bytes(), b\\\"MEDIUM POLISHED\\\") && [49, 14, 23, 45, 19, 3, 36, 9].contains(&p.size) {\\n\",\n \"file_path\": \"tpchlike/src/queries/query16.rs\",\n \"rank\": 49,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n println!(\\\"TODO: Q22 uses a `group` for counting to get an arrangement; could use `count_total`\\\");\\n\\n\\n\\n let customers =\\n\\n collections\\n\\n .customers()\\n\\n .flat_map(|c| {\\n\\n if c.acctbal > 0 {\\n\\n match &[c.phone[0], c.phone[1]] {\\n\\n b\\\"13\\\" | b\\\"31\\\" | b\\\"23\\\" | b\\\"29\\\" | b\\\"30\\\" | b\\\"18\\\" | b\\\"17\\\" => {\\n\\n Some((((c.phone[1] as u16) << 8) + c.phone[0] as u16, c.acctbal, c.cust_key))\\n\\n },\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n else { None }\\n\\n });\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query22.rs\",\n \"rank\": 50,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let nations =\\n\\n collections\\n\\n .nations()\\n\\n .filter(|n| starts_with(&n.name, b\\\"GERMANY\\\"))\\n\\n .map(|n| n.nation_key);\\n\\n\\n\\n let suppliers =\\n\\n collections\\n\\n .suppliers()\\n\\n .map(|s| (s.nation_key, s.supp_key))\\n\\n .semijoin(&nations)\\n\\n .map(|s| s.1);\\n\\n\\n\\n collections\\n\\n .partsupps()\\n\\n .explode(|x| Some(((x.supp_key, x.part_key), (x.supplycost as isize) * (x.availqty as isize))))\\n\\n .semijoin(&suppliers)\\n\\n .map(|(_, part_key)| ((), part_key))\\n\\n .reduce(|_part_key, s, t| {\\n\\n let threshold: isize = s.iter().map(|x| x.1 as isize).sum::<isize>() / 10000;\\n\\n t.extend(s.iter().filter(|x| x.1 > threshold).map(|&(&a,b)| (a, b)));\\n\\n })\\n\\n .map(|(_, part_key)| part_key)\\n\\n .count_total()\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query11.rs\",\n \"rank\": 51,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let orders =\\n\\n collections\\n\\n .orders()\\n\\n .map(|o| (o.order_key, (o.cust_key, o.order_date, o.total_price)));\\n\\n\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|l| Some((l.order_key, l.quantity as isize)))\\n\\n .count_total()\\n\\n .filter(|&(_key, cnt)| cnt > 300)\\n\\n .join_map(&orders, |&o_key, &quant, &(cust_key, date, price)| (cust_key, (o_key, date, price, quant)))\\n\\n .join(&collections.customers().map(|c| (c.cust_key, c.name)))\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query18.rs\",\n \"rank\": 52,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n println!(\\\"TODO: Q07 could use `join_core` to fuse map and filter\\\");\\n\\n\\n\\n let nations =\\n\\n collections\\n\\n .nations()\\n\\n .filter(|n| starts_with(&n.name, b\\\"FRANCE\\\") || starts_with(&n.name, b\\\"GERMANY\\\"))\\n\\n .map(|n| (n.nation_key, n.name));\\n\\n\\n\\n let customers =\\n\\n collections\\n\\n .customers()\\n\\n .map(|c| (c.nation_key, c.cust_key))\\n\\n .join_map(&nations, |_, &cust_key, &name| (cust_key, name));\\n\\n\\n\\n let orders =\\n\\n collections\\n\\n .orders()\\n\",\n \"file_path\": \"tpchlike/src/queries/query07.rs\",\n \"rank\": 53,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let regions =\\n\\n collections\\n\\n .regions()\\n\\n .filter(|x| starts_with(&x.name[..], b\\\"ASIA\\\"))\\n\\n .map(|x| x.region_key);\\n\\n\\n\\n let nations =\\n\\n collections\\n\\n .nations()\\n\\n .map(|x| (x.region_key, x.nation_key))\\n\\n .semijoin(®ions)\\n\\n .map(|(_region_key, nation_key)| nation_key);\\n\\n\\n\\n let suppliers =\\n\\n collections\\n\\n .suppliers()\\n\\n .map(|x| (x.nation_key, x.supp_key))\\n\",\n \"file_path\": \"tpchlike/src/queries/query05.rs\",\n \"rank\": 54,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let lineitems =\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|x|\\n\\n if (starts_with(&x.ship_mode, b\\\"AIR\\\") || starts_with(&x.ship_mode, b\\\"AIR REG\\\")) && starts_with(&x.ship_instruct, b\\\"DELIVER IN PERSON\\\") {\\n\\n Some(((x.part_key, x.quantity), (x.extended_price * (100 - x.discount) / 100) as isize))\\n\\n }\\n\\n else { None }\\n\\n );\\n\\n\\n\\n let lines1 = lineitems.filter(|&(_, quant)| quant >= 1 && quant <= 11).map(|x| x.0).arrange_by_self();\\n\\n let lines2 = lineitems.filter(|&(_, quant)| quant >= 10 && quant <= 20).map(|x| x.0).arrange_by_self();\\n\\n let lines3 = lineitems.filter(|&(_, quant)| quant >= 20 && quant <= 30).map(|x| x.0).arrange_by_self();\\n\\n\\n\\n let parts = collections.parts().map(|p| (p.part_key, (p.brand, p.container, p.size)));\\n\\n\\n\\n let parts1 = parts.filter(|&(_key, (brand, container, size))| starts_with(&brand, b\\\"Brand#12\\\") && 1 <= size && size <= 5 && (starts_with(&container, b\\\"SM CASE\\\") || starts_with(&container, b\\\"SM BOX\\\") || starts_with(&container, b\\\"SM PACK\\\") || starts_with(&container, b\\\"MED PKG\\\"))).map(|x| x.0).arrange_by_self();\\n\",\n \"file_path\": \"tpchlike/src/queries/query19.rs\",\n \"rank\": 55,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let regions =\\n\\n collections\\n\\n .regions()\\n\\n .flat_map(|x| if starts_with(&x.name[..], b\\\"EUROPE\\\") { Some(x.region_key) } else { None });\\n\\n\\n\\n let nations =\\n\\n collections\\n\\n .nations()\\n\\n .map(|x| (x.region_key, (x.nation_key, x.name)))\\n\\n .semijoin(®ions)\\n\\n .map(|(_region_key, (nation_key, name))| (nation_key, name));\\n\\n\\n\\n let suppliers =\\n\\n collections\\n\\n .suppliers()\\n\\n .map(|x| (x.nation_key, (x.acctbal, x.name, x.address, x.phone, x.comment, x.supp_key)))\\n\\n .semijoin(&nations.map(|x| x.0))\\n\",\n \"file_path\": \"tpchlike/src/queries/query02.rs\",\n \"rank\": 56,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|x| {\\n\\n if (create_date(1994, 1, 1) <= x.ship_date) && (x.ship_date < create_date(1995, 1, 1)) && (5 <= x.discount) && (x.discount <= 7) && (x.quantity < 24) {\\n\\n Some(((), (x.extended_price * x.discount / 100) as isize))\\n\\n }\\n\\n else { None }\\n\\n })\\n\\n .count_total()\\n\\n // .inspect(|x| println!(\\\"{:?}\\\", x))\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query06.rs\",\n \"rank\": 57,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let lineitems =\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|l|\\n\\n if create_date(1995,9,1) <= l.ship_date && l.ship_date < create_date(1995,10,1) {\\n\\n Some((l.part_key, (l.extended_price * (100 - l.discount) / 100) as isize ))\\n\\n }\\n\\n else { None }\\n\\n )\\n\\n .arrange_by_self();\\n\\n\\n\\n collections\\n\\n .parts()\\n\\n .explode(|p| Some((p.part_key, DiffPair::new(1, if starts_with(&p.typ.as_bytes(), b\\\"PROMO\\\") { 1 } else { 0 }))))\\n\\n .arrange_by_self()\\n\\n .join_core(&lineitems, |&_part_key, _, _| Some(()))\\n\\n .count_total()\\n\\n // .inspect(|x| println!(\\\"{:?}\\\", x))\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query14.rs\",\n \"rank\": 58,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere\\n\\n G::Timestamp: Lattice+TotalOrder+Ord\\n\\n{\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|item|\\n\\n if item.ship_date <= ::types::create_date(1998, 9, 2) {\\n\\n Some(((item.return_flag[0], item.line_status[0]),\\n\\n DiffPair::new(item.quantity as isize,\\n\\n DiffPair::new(item.extended_price as isize,\\n\\n DiffPair::new((item.extended_price * (100 - item.discount) / 100) as isize,\\n\\n DiffPair::new((item.extended_price * (100 - item.discount) * (100 + item.tax) / 10000) as isize,\\n\\n DiffPair::new(item.discount as isize, 1)))))))\\n\\n }\\n\\n else {\\n\\n None\\n\\n }\\n\\n )\\n\\n .count_total()\\n\\n // .inspect(|x| println!(\\\"{:?}\\\", x))\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query01.rs\",\n \"rank\": 59,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let lineitems =\\n\\n collections\\n\\n .lineitems()\\n\\n .explode(|x|\\n\\n if starts_with(&x.return_flag, b\\\"R\\\") {\\n\\n Some((x.order_key, (x.extended_price * (100 - x.discount)) as isize))\\n\\n }\\n\\n else { None }\\n\\n );\\n\\n\\n\\n let orders =\\n\\n collections\\n\\n .orders()\\n\\n .flat_map(|o|\\n\\n if create_date(1993,10,1) < o.order_date && o.order_date <= create_date(1994,1,1) {\\n\\n Some((o.order_key, o.cust_key))\\n\\n }\\n\",\n \"file_path\": \"tpchlike/src/queries/query10.rs\",\n \"rank\": 60,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n println!(\\\"TODO: Q12 does contortions because isize doesn't implement Mul<DiffPair<isize, isize>>.\\\");\\n\\n\\n\\n let orders =\\n\\n collections\\n\\n .orders()\\n\\n .explode(|o|\\n\\n if starts_with(&o.order_priority, b\\\"1-URGENT\\\") || starts_with(&o.order_priority, b\\\"2-HIGH\\\") {\\n\\n Some((o.order_key, DiffPair::new(1, 0)))\\n\\n }\\n\\n else {\\n\\n Some((o.order_key, DiffPair::new(0, 1)))\\n\\n }\\n\\n )\\n\\n .arrange_by_self();\\n\\n\\n\\n let lineitems =\\n\\n collections\\n\",\n \"file_path\": \"tpchlike/src/queries/query12.rs\",\n \"rank\": 61,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n println!(\\\"TODO: Q09 join order may be pessimal; could pivot to put lineitems last\\\");\\n\\n\\n\\n let parts =\\n\\n collections\\n\\n .parts()\\n\\n .flat_map(|x| if substring(&x.name.as_bytes(), b\\\"green\\\") { Some(x.part_key) } else { None } );\\n\\n\\n\\n collections\\n\\n .lineitems()\\n\\n .map(|l| (l.part_key, (l.supp_key, l.order_key, l.extended_price * (100 - l.discount) / 100, l.quantity)))\\n\\n .semijoin(&parts)\\n\\n .map(|(part_key, (supp_key, order_key, revenue, quantity))| ((part_key, supp_key), (order_key, revenue, quantity)))\\n\\n .join(&collections.partsupps().map(|ps| ((ps.part_key, ps.supp_key), ps.supplycost)))\\n\\n .explode(|((_part_key, supp_key), ((order_key, revenue, quantity), supplycost))|\\n\\n Some(((order_key, supp_key), ((revenue - supplycost * quantity) as isize)))\\n\\n )\\n\\n .join_map(&collections.orders().map(|o| (o.order_key, o.order_date >> 16)), |_, &supp_key, &order_year| (supp_key, order_year))\\n\\n .join_map(&collections.suppliers().map(|s| (s.supp_key, s.nation_key)), |_, &order_year, &nation_key| (nation_key, order_year))\\n\\n .join(&collections.nations().map(|n| (n.nation_key, n.name)))\\n\\n .count_total()\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query09.rs\",\n \"rank\": 62,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let lineitems =\\n\\n collections\\n\\n .lineitems()\\n\\n .flat_map(|l| if l.commit_date < l.receipt_date { Some(l.order_key) } else { None })\\n\\n .distinct_total();\\n\\n\\n\\n collections\\n\\n .orders()\\n\\n .flat_map(|o|\\n\\n if o.order_date >= ::types::create_date(1993, 7, 1) && o.order_date < ::types::create_date(1993, 10, 1) {\\n\\n Some((o.order_key, o.order_priority))\\n\\n }\\n\\n else { None }\\n\\n )\\n\\n .semijoin(&lineitems)\\n\\n .map(|(_k,v)| v)\\n\\n .count_total()\\n\\n // .inspect(|x| println!(\\\"{:?}\\\", x))\\n\\n .probe_with(probe);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/queries/query04.rs\",\n \"rank\": 63,\n \"score\": 208213.4998824624\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let parts =\\n\\n collections\\n\\n .parts() // We fluff out search strings to have the right lengths. \\\\\\\\\\n\\n .flat_map(|x| {\\n\\n if &x.brand[..8] == b\\\"Brand#23\\\" && &x.container[..7] == b\\\"MED BOX\\\" {\\n\\n Some(x.part_key)\\n\\n }\\n\\n else { None }\\n\\n });\\n\\n\\n\\n collections\\n\\n .lineitems()\\n\\n .map(|x| (x.part_key, (x.quantity, x.extended_price)))\\n\\n .semijoin(&parts)\\n\\n .reduce(|_k, s, t| {\\n\\n\\n\\n // determine the total and count of quantity.\\n\",\n \"file_path\": \"tpchlike/src/queries/query17.rs\",\n \"rank\": 64,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"pub fn query<G: Scope>(collections: &mut Collections<G>, probe: &mut ProbeHandle<G::Timestamp>)\\n\\nwhere G::Timestamp: Lattice+TotalOrder+Ord {\\n\\n\\n\\n let orders =\\n\\n collections\\n\\n .orders()\\n\\n .flat_map(|o|\\n\\n if starts_with(&o.order_status, b\\\"F\\\") { Some(o.order_key) }\\n\\n else { None }\\n\\n );\\n\\n\\n\\n // lineitems relevant to \\\"F\\\" orders.\\n\\n let lineitems =\\n\\n collections\\n\\n .lineitems()\\n\\n .map(|l| (l.order_key, (l.supp_key, l.receipt_date > l.commit_date)))\\n\\n .semijoin(&orders);\\n\\n\\n\\n let lateitems = lineitems.filter(|l| (l.1).1);\\n\\n let lateorders = lateitems.map(|l| l.0).distinct_total();\\n\",\n \"file_path\": \"tpchlike/src/queries/query21.rs\",\n \"rank\": 65,\n \"score\": 208213.49988246243\n },\n {\n \"content\": \"/// Propagates labels forward, retaining the minimum label.\\n\\n///\\n\\n/// This variant takes a pre-arranged edge collection, to facilitate re-use, and allows\\n\\n/// a method `logic` to specify the rounds in which we introduce various labels. The output\\n\\n/// of `logic should be a number in the interval [0,64],\\n\\npub fn propagate_core<G, N, L, Tr, F, R>(edges: &Arranged<G,Tr>, nodes: &Collection<G,(N,L),R>, logic: F) -> Collection<G,(N,L),R>\\n\\nwhere\\n\\n G: Scope,\\n\\n G::Timestamp: Lattice+Ord,\\n\\n N: ExchangeData+Hash,\\n\\n R: ExchangeData+Abelian,\\n\\n R: Mul<R, Output=R>,\\n\\n R: From<i8>,\\n\\n L: ExchangeData,\\n\\n Tr: TraceReader<Key=N, Val=N, Time=G::Timestamp, R=R>+Clone+'static,\\n\\n Tr::Batch: crate::trace::BatchReader<N, N, G::Timestamp, Tr::R>+'static,\\n\\n Tr::Cursor: crate::trace::Cursor<N, N, G::Timestamp, Tr::R>+'static,\\n\\n F: Fn(&L)->u64+Clone+'static,\\n\\n{\\n\\n // Morally the code performs the following iterative computation. However, in the interest of a simplified\\n\\n // dataflow graph and reduced memory footprint we instead have a wordier version below. The core differences\\n\\n // between the two are that 1. the former filters its input and pretends to perform non-monotonic computation,\\n\\n // whereas the latter creates an initially empty monotonic iteration variable, and 2. the latter rotates the\\n\\n // iterative computation so that the arrangement produced by `reduce` can be re-used.\\n\\n\\n\",\n \"file_path\": \"src/algorithms/graphs/propagate.rs\",\n \"rank\": 66,\n \"score\": 202952.39720036724\n },\n {\n \"content\": \"/// Propagates labels forward, retaining the minimum label.\\n\\n///\\n\\n/// This algorithm naively propagates all labels at once, much like standard label propagation.\\n\\n/// To more carefully control the label propagation, consider `propagate_core` which supports a\\n\\n/// method to limit the introduction of labels.\\n\\npub fn propagate_at<G, N, L, F, R>(edges: &Collection<G, (N,N), R>, nodes: &Collection<G,(N,L),R>, logic: F) -> Collection<G,(N,L),R>\\n\\nwhere\\n\\n G: Scope,\\n\\n G::Timestamp: Lattice+Ord,\\n\\n N: ExchangeData+Hash,\\n\\n R: ExchangeData+Abelian,\\n\\n R: Mul<R, Output=R>,\\n\\n R: From<i8>,\\n\\n L: ExchangeData,\\n\\n F: Fn(&L)->u64+Clone+'static,\\n\\n{\\n\\n propagate_core(&edges.arrange_by_key(), nodes, logic)\\n\\n}\\n\\n\\n\\nuse trace::TraceReader;\\n\\nuse operators::arrange::arrangement::Arranged;\\n\\n\\n\",\n \"file_path\": \"src/algorithms/graphs/propagate.rs\",\n \"rank\": 67,\n \"score\": 202149.53089895178\n },\n {\n \"content\": \"fn triangles<G: Scope>(edges: &Collection<G, Edge>) -> Collection<G, (Node, Node, Node)>\\n\\nwhere G::Timestamp: Lattice+Hash+Ord {\\n\\n\\n\\n // only use forward-pointing edges.\\n\\n let edges = edges.filter(|&(src, dst)| src < dst);\\n\\n\\n\\n // arrange the edge relation three ways.\\n\\n let as_self = edges.arrange_by_self();\\n\\n let forward = edges.arrange_by_key();\\n\\n let reverse = edges.map_in_place(|x| ::std::mem::swap(&mut x.0, &mut x.1))\\n\\n .arrange_by_key();\\n\\n\\n\\n // arrange the count of extensions from each source.\\n\\n let counts = edges.map(|(src, _dst)| src)\\n\\n .arrange_by_self();\\n\\n\\n\\n // extract ((src, dst), idx) tuples with weights equal to the number of extensions.\\n\\n let cand_count1 = forward.join_core(&counts, |&src, &dst, &()| Some(((src, dst), 1)));\\n\\n let cand_count2 = reverse.join_core(&counts, |&dst, &src, &()| Some(((src, dst), 2)));\\n\\n\\n\",\n \"file_path\": \"dogsdogsdogs/examples/ngo.rs\",\n \"rank\": 68,\n \"score\": 200829.5973722318\n },\n {\n \"content\": \"// Generate synthetic interactions with a skewed distribution\\n\\nfn generate_interactions<R>(how_many: usize, rng: &mut R) -> Vec<(u32,u32)> where R: Rng {\\n\\n let mut interactions = Vec::with_capacity(how_many);\\n\\n\\n\\n let mut user_sampler = CRP::new(6000.0, 0.35);\\n\\n let mut item_sampler = CRP::new(6000.0, 0.35);\\n\\n\\n\\n for _ in 0 .. how_many {\\n\\n let user = user_sampler.sample(rng);\\n\\n let item = item_sampler.sample(rng);\\n\\n interactions.push((user, item));\\n\\n }\\n\\n\\n\\n interactions\\n\\n}\\n\",\n \"file_path\": \"examples/itembased_cf.rs\",\n \"rank\": 69,\n \"score\": 199960.6201059934\n },\n {\n \"content\": \"/// Returns pairs (node, dist) indicating distance of each node from a root.\\n\\npub fn bfs<G, N>(edges: &Collection<G, (N,N)>, roots: &Collection<G, N>) -> Collection<G, (N,u32)>\\n\\nwhere\\n\\n G: Scope,\\n\\n G::Timestamp: Lattice+Ord,\\n\\n N: ExchangeData+Hash,\\n\\n{\\n\\n use operators::arrange::arrangement::ArrangeByKey;\\n\\n let edges = edges.arrange_by_key();\\n\\n bfs_arranged(&edges, roots)\\n\\n}\\n\\n\\n\\nuse crate::trace::TraceReader;\\n\\nuse crate::operators::arrange::Arranged;\\n\\n\\n\",\n \"file_path\": \"src/algorithms/graphs/bfs.rs\",\n \"rank\": 70,\n \"score\": 198264.63813113488\n },\n {\n \"content\": \"// returns pairs (n, s) indicating node n can be reached from a root in s steps.\\n\\nfn bfs<G: Scope>(edges: &Collection<G, Edge, MinSum>, roots: &Collection<G, Node, MinSum>) -> Collection<G, Node, MinSum>\\n\\nwhere G::Timestamp: Lattice+Ord {\\n\\n\\n\\n // repeatedly update minimal distances each node can be reached from each root\\n\\n roots.scope().iterative::<u32,_,_>(|scope| {\\n\\n\\n\\n use differential_dataflow::operators::iterate::SemigroupVariable;\\n\\n use differential_dataflow::operators::reduce::ReduceCore;\\n\\n use differential_dataflow::trace::implementations::ord::OrdKeySpine as DefaultKeyTrace;\\n\\n\\n\\n\\n\\n use timely::order::Product;\\n\\n let variable = SemigroupVariable::new(scope, Product::new(Default::default(), 1));\\n\\n\\n\\n let edges = edges.enter(scope);\\n\\n let roots = roots.enter(scope);\\n\\n\\n\\n let result =\\n\\n variable\\n\\n .map(|n| (n,()))\\n\",\n \"file_path\": \"examples/monoid-bfs.rs\",\n \"rank\": 71,\n \"score\": 197548.57929519942\n },\n {\n \"content\": \"/// Returns pairs (node, dist) indicating distance of each node from a root.\\n\\npub fn bfs_arranged<G, N, Tr>(edges: &Arranged<G, Tr>, roots: &Collection<G, N>) -> Collection<G, (N, u32)>\\n\\nwhere\\n\\n G: Scope,\\n\\n G::Timestamp: Lattice+Ord,\\n\\n N: ExchangeData+Hash,\\n\\n Tr: TraceReader<Key=N, Val=N, Time=G::Timestamp, R=isize>+Clone+'static,\\n\\n Tr::Batch: crate::trace::BatchReader<N, N, G::Timestamp, Tr::R>+'static,\\n\\n Tr::Cursor: crate::trace::Cursor<N, N, G::Timestamp, Tr::R>+'static,\\n\\n{\\n\\n // initialize roots as reaching themselves at distance 0\\n\\n let nodes = roots.map(|x| (x, 0));\\n\\n\\n\\n // repeatedly update minimal distances each node can be reached from each root\\n\\n nodes.iterate(|inner| {\\n\\n\\n\\n let edges = edges.enter(&inner.scope());\\n\\n let nodes = nodes.enter(&inner.scope());\\n\\n\\n\\n inner.join_core(&edges, |_k,l,d| Some((d.clone(), l+1)))\\n\\n .concat(&nodes)\\n\\n .reduce(|_, s, t| t.push((s[0].0.clone(), 1)))\\n\\n })\\n\\n}\",\n \"file_path\": \"src/algorithms/graphs/bfs.rs\",\n \"rank\": 72,\n \"score\": 195282.3297459216\n },\n {\n \"content\": \"fn _reachability<G: Scope>(edges: &Collection<G, Edge>, nodes: &Collection<G, (Node, Node)>) -> Collection<G, Edge>\\n\\nwhere G::Timestamp: Lattice+Ord+Hash {\\n\\n\\n\\n edges.filter(|_| false)\\n\\n .iterate(|inner| {\\n\\n let edges = edges.enter(&inner.scope());\\n\\n let nodes = nodes.enter_at(&inner.scope(), |r| 256 * (64 - (r.0 as u64).leading_zeros() as u64));\\n\\n\\n\\n inner.join_map(&edges, |_k,l,d| (*d,*l))\\n\\n .concat(&nodes)\\n\\n .reduce(|_, s, t| t.push((*s[0].0, 1)))\\n\\n\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"tests/scc.rs\",\n \"rank\": 73,\n \"score\": 194494.05172426775\n },\n {\n \"content\": \"type TraceBatch = OrdValBatch<usize, usize, RootTime, isize>;\\n\",\n \"file_path\": \"server/src/lib.rs\",\n \"rank\": 74,\n \"score\": 191018.3791368112\n },\n {\n \"content\": \"fn visit(node: usize, forward: &HashMap<usize, Vec<usize>>, visited: &mut HashSet<usize>, list: &mut Vec<usize>) {\\n\\n if !visited.contains(&node) {\\n\\n visited.insert(node);\\n\\n if let Some(edges) = forward.get(&node) {\\n\\n for &edge in edges.iter() {\\n\\n visit(edge, forward, visited, list)\\n\\n }\\n\\n }\\n\\n list.push(node);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/scc.rs\",\n \"rank\": 75,\n \"score\": 185770.7911406774\n },\n {\n \"content\": \"fn _color<G, N>(edges: &Collection<G, (N,N)>) -> Collection<G,(N,Option<u32>)>\\n\\nwhere\\n\\n G: Scope,\\n\\n G::Timestamp: Lattice+Ord,\\n\\n N: ExchangeData+Hash,\\n\\n{\\n\\n // need some bogus initial values.\\n\\n let start = edges.map(|(x,_y)| (x,u32::max_value()))\\n\\n .distinct();\\n\\n\\n\\n // repeatedly apply color-picking logic.\\n\\n sequence(&start, &edges, |_node, vals| {\\n\\n\\n\\n // look for the first absent positive integer.\\n\\n // start at 1 in case we ever use NonZero<u32>.\\n\\n\\n\\n (1u32 ..)\\n\\n .filter(|&i| vals.get(i as usize - 1).map(|x| *x.0) != Some(i))\\n\\n .next()\\n\\n .unwrap()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/algorithms/graphs/sequential.rs\",\n \"rank\": 76,\n \"score\": 182900.11177307827\n },\n {\n \"content\": \"fn get_trace() -> Spine<UnsignedWrapper<u64>, u64, usize, i64, Rc<OrdValBatch<UnsignedWrapper<u64>, u64, usize, i64>>> {\\n\\n let op_info = OperatorInfo::new(0, 0, &[]);\\n\\n let mut trace = IntegerTrace::new(op_info, None, None);\\n\\n {\\n\\n let mut batcher = <<IntegerTrace as TraceReader>::Batch as Batch<UnsignedWrapper<u64>, u64, usize, i64>>::Batcher::new();\\n\\n\\n\\n batcher.push_batch(&mut vec![\\n\\n ((1.into(), 2), 0, 1),\\n\\n ((2.into(), 3), 1, 1),\\n\\n ((2.into(), 3), 2, -1),\\n\\n ]);\\n\\n\\n\\n let batch_ts = &[1, 2, 3];\\n\\n let batches = batch_ts.iter().map(move |i| batcher.seal(Antichain::from_elem(*i)));\\n\\n for b in batches {\\n\\n trace.insert(b);\\n\\n }\\n\\n }\\n\\n trace\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/trace.rs\",\n \"rank\": 77,\n \"score\": 182579.83456345863\n },\n {\n \"content\": \"/// Read a command and its arguments.\\n\\nfn read_integers<'a>(input: impl Iterator<Item=&'a str>) -> Result<Vec<isize>, std::num::ParseIntError> {\\n\\n let mut integers = Vec::new();\\n\\n for text in input {\\n\\n integers.push(text.parse()?);\\n\\n }\\n\\n Ok(integers)\\n\\n}\",\n \"file_path\": \"examples/multitemporal.rs\",\n \"rank\": 78,\n \"score\": 182128.3523159607\n },\n {\n \"content\": \"fn copy_from_to(src: &[u8], dst: &mut [u8]) {\\n\\n let limit = if src.len() < dst.len() { src.len() } else { dst.len() };\\n\\n for index in 0 .. limit {\\n\\n dst[index] = src[index];\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tpchlike/src/types.rs\",\n \"rank\": 79,\n \"score\": 181795.43084477726\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let mut args = std::env::args().skip(1);\\n\\n let prefix = args.next().expect(\\\"must supply path to facts\\\");\\n\\n let batch: Time = args.next().unwrap_or(\\\"1\\\".to_string()).parse().expect(\\\"batch must be an integer\\\");\\n\\n\\n\\n timely::execute_from_args(std::env::args(), move |worker| {\\n\\n\\n\\n let timer = ::std::time::Instant::now();\\n\\n let index = worker.index();\\n\\n\\n\\n let mut probe = ProbeHandle::new();\\n\\n\\n\\n // For interning strings.\\n\\n let interner = Rc::new(RefCell::new(StringInterner::new()));\\n\\n\\n\\n let mut inputs = (\\n\\n Vec::new(),\\n\\n Vec::new(),\\n\\n Vec::new(),\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 80,\n \"score\": 177152.9297868865\n },\n {\n \"content\": \"fn _strongly_connected<G: Scope>(graph: &Collection<G, Edge>) -> Collection<G, Edge>\\n\\nwhere G::Timestamp: Lattice+Ord+Hash {\\n\\n graph.iterate(|inner| {\\n\\n let edges = graph.enter(&inner.scope());\\n\\n let trans = edges.map_in_place(|x| mem::swap(&mut x.0, &mut x.1));\\n\\n _trim_edges(&_trim_edges(inner, &edges), &trans)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/scc.rs\",\n \"rank\": 81,\n \"score\": 175987.9073013793\n },\n {\n \"content\": \"fn test_sizes(nodes: usize, edges: usize, rounds: usize, config: Config) {\\n\\n\\n\\n let root_list = vec![(1, 0, 1)];\\n\\n let mut edge_list = Vec::new();\\n\\n\\n\\n let seed: &[_] = &[1, 2, 3, 4];\\n\\n let mut rng1: StdRng = SeedableRng::from_seed(seed); // rng for edge additions\\n\\n let mut rng2: StdRng = SeedableRng::from_seed(seed); // rng for edge deletions\\n\\n\\n\\n for _ in 0 .. edges {\\n\\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), 0, 1));\\n\\n }\\n\\n\\n\\n for round in 1 .. rounds {\\n\\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), round, 1));\\n\\n edge_list.push(((rng2.gen_range(0, nodes), rng2.gen_range(0, nodes)), round,-1));\\n\\n }\\n\\n\\n\\n let mut results1 = bfs_sequential(root_list.clone(), edge_list.clone());\\n\\n let mut results2 = bfs_differential(root_list.clone(), edge_list.clone(), config);\\n\",\n \"file_path\": \"tests/bfs.rs\",\n \"rank\": 82,\n \"score\": 175535.5698981652\n },\n {\n \"content\": \"fn test_sizes(nodes: usize, edges: usize, rounds: usize, config: Config) {\\n\\n\\n\\n let mut edge_list = Vec::new();\\n\\n\\n\\n let seed: &[_] = &[1, 2, 3, 4];\\n\\n let mut rng1: StdRng = SeedableRng::from_seed(seed); // rng for edge additions\\n\\n let mut rng2: StdRng = SeedableRng::from_seed(seed); // rng for edge deletions\\n\\n\\n\\n for _ in 0 .. edges {\\n\\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), 0, 1));\\n\\n }\\n\\n\\n\\n for round in 1 .. rounds {\\n\\n edge_list.push(((rng1.gen_range(0, nodes), rng1.gen_range(0, nodes)), round, 1));\\n\\n edge_list.push(((rng2.gen_range(0, nodes), rng2.gen_range(0, nodes)), round,-1));\\n\\n }\\n\\n\\n\\n // for thing in edge_list.iter() {\\n\\n // println!(\\\"input: {:?}\\\", thing);\\n\\n // }\\n\",\n \"file_path\": \"tests/scc.rs\",\n \"rank\": 83,\n \"score\": 175535.5698981652\n },\n {\n \"content\": \"/// Sorts and consolidates `vec`.\\n\\n///\\n\\n/// This method will sort `vec` and then consolidate runs of more than one entry with\\n\\n/// identical first elements by accumulating the second elements of the pairs. Should the final\\n\\n/// accumulation be zero, the element is discarded.\\n\\npub fn consolidate<T: Ord, R: Semigroup>(vec: &mut Vec<(T, R)>) {\\n\\n consolidate_from(vec, 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/consolidation.rs\",\n \"rank\": 84,\n \"score\": 173834.8534790057\n },\n {\n \"content\": \"type TraceSpine = Spine<usize, usize, RootTime, isize, Rc<TraceBatch>>;\\n\\npub type TraceHandle = TraceAgent<usize, usize, RootTime, isize, TraceSpine>;\\n\\n\\n\\n/// Arguments provided to each shared library to help build their dataflows and register their results.\\n\\npub type Environment<'a, 'b> = (\\n\\n &'a mut Child<'b, Worker<Allocator>,usize>,\\n\\n &'a mut TraceHandler,\\n\\n &'a mut ProbeHandle<RootTime>,\\n\\n &'a Instant,\\n\\n &'a [String]\\n\\n);\\n\\n\\n\\n/// A wrapper around types that keep their source libraries alive.\\n\\n///\\n\\n/// This type is meant to be a smart pointer for a type `T` that needs to keep\\n\\n/// a `Library` alive, perhaps because its methods would call in to the library.\\n\\n/// The type should have a specified drop order (viz RFC 1857) which guarentees\\n\\n/// that the shared library reference drops only after the element itself is\\n\\n/// dropped. It also implements `Deref` and `DerefMut` to provide the experience\\n\\n/// of a `T` itself.\\n\",\n \"file_path\": \"server/src/lib.rs\",\n \"rank\": 85,\n \"score\": 173254.92458231538\n },\n {\n \"content\": \"/// Sorts and consolidates a slice, returning the valid prefix length.\\n\\npub fn consolidate_slice<T: Ord, R: Semigroup>(slice: &mut [(T, R)]) -> usize {\\n\\n\\n\\n // We could do an insertion-sort like initial scan which builds up sorted, consolidated runs.\\n\\n // In a world where there are not many results, we may never even need to call in to merge sort.\\n\\n slice.sort_by(|x,y| x.0.cmp(&y.0));\\n\\n\\n\\n // Counts the number of distinct known-non-zero accumulations. Indexes the write location.\\n\\n let mut offset = 0;\\n\\n for index in 1 .. slice.len() {\\n\\n\\n\\n // The following unsafe block elides various bounds checks, using the reasoning that `offset`\\n\\n // is always strictly less than `index` at the beginning of each iteration. This is initially\\n\\n // true, and in each iteration `offset` can increase by at most one (whereas `index` always\\n\\n // increases by one). As `index` is always in bounds, and `offset` starts at zero, it too is\\n\\n // always in bounds.\\n\\n //\\n\\n // LLVM appears to struggle to optimize out Rust's split_at_mut, which would prove disjointness\\n\\n // using run-time tests.\\n\\n unsafe {\\n\\n\\n\",\n \"file_path\": \"src/consolidation.rs\",\n \"rank\": 86,\n \"score\": 171403.57398581167\n },\n {\n \"content\": \"fn main() {\\n\\n let rounds: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\\n\\n\\n\\n let mut summaries = timely::execute_from_args(std::env::args(), move |worker| {\\n\\n let mut probe = Handle::new();\\n\\n let (mut graph, mut graph_trace) = worker.dataflow(|scope| {\\n\\n let (graph_input, graph) = scope.new_collection();\\n\\n\\n\\n let graph_arr = graph.map(|(x, y): Edge| (x, (x, y))).arrange_by_key();\\n\\n let graph_trace = graph_arr.trace.clone();\\n\\n\\n\\n /* Be sure to attach probe to arrangements we want to enumerate;\\n\\n * so we know when all updates for a given epoch have been added to the arrangement. */\\n\\n graph_arr\\n\\n .as_collection(|_, v| *v)\\n\\n .consolidate()\\n\\n //.inspect(move |x| println!(\\\"{:?}\\\", x))\\n\\n .probe_with(&mut probe);\\n\\n\\n\\n /* Return `graph_trace`, so we can obtain cursor for the arrangement at runtime. */\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 87,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let keys: usize = std::env::args().nth(1).unwrap().parse().unwrap();\\n\\n let batch: usize = 10_000;\\n\\n\\n\\n // This computation demonstrates in-place accumulation of arbitrarily large \\n\\n // volumes of input data, consuming space bounded by the number of distinct keys.\\n\\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\\n\\n\\n\\n let index = worker.index();\\n\\n let peers = worker.peers();\\n\\n\\n\\n let mut input = worker.dataflow::<(), _, _>(|scope| {\\n\\n let (input, data) = scope.new_collection::<_, isize>();\\n\\n data.consolidate();\\n\\n input\\n\\n });\\n\\n\\n\\n let seed: &[_] = &[1, 2, 3, 4];\\n\\n let mut rng: StdRng = SeedableRng::from_seed(seed);\\n\",\n \"file_path\": \"examples/accumulate.rs\",\n \"rank\": 88,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n timely::execute_from_args(std::env::args(), move |worker| {\\n\\n\\n\\n let timer = worker.timer();\\n\\n let mut probe = Handle::new();\\n\\n\\n\\n let (mut nodes, mut edges, mut times) = worker.dataflow::<usize,_,_>(|scope| {\\n\\n\\n\\n let (node_input, nodes) = scope.new_collection();\\n\\n let (edge_input, edges) = scope.new_collection();\\n\\n let (time_input, times) = scope.new_collection();\\n\\n\\n\\n // Detect cycles that do not increment timestamps.\\n\\n find_cycles::<_,usize>(nodes.clone(), edges.clone())\\n\\n .inspect(move |x| println!(\\\"{:?}\\\\tcycles: {:?}\\\", timer.elapsed(), x))\\n\\n .probe_with(&mut probe);\\n\\n\\n\\n // Summarize all paths to inputs of operator zero.\\n\\n summarize::<_,usize>(nodes.clone(), edges.clone())\\n\",\n \"file_path\": \"examples/progress.rs\",\n \"rank\": 89,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\\n\\n let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();\\n\\n let batch: usize = std::env::args().nth(3).unwrap().parse().unwrap();\\n\\n let pre: usize = std::env::args().nth(4).unwrap().parse().unwrap();\\n\\n let inspect: bool = std::env::args().nth(5).unwrap() == \\\"inspect\\\";\\n\\n\\n\\n\\n\\n // define a new timely dataflow computation.\\n\\n timely::execute_from_args(std::env::args().skip(6), move |worker| {\\n\\n\\n\\n let timer = ::std::time::Instant::now();\\n\\n\\n\\n let index = worker.index();\\n\\n let peers = worker.peers();\\n\\n\\n\\n let mut probe = timely::dataflow::operators::probe::Handle::new();\\n\\n\\n\\n // create a dataflow managing an ever-changing edge collection.\\n\",\n \"file_path\": \"examples/arrange.rs\",\n \"rank\": 90,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\\n\\n let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();\\n\\n let batch: usize = std::env::args().nth(3).unwrap().parse().unwrap();\\n\\n let inspect: bool = std::env::args().nth(4).unwrap() == \\\"inspect\\\";\\n\\n let open_loop: bool = std::env::args().nth(5).unwrap() == \\\"open-loop\\\";\\n\\n\\n\\n // define a new computational scope, in which to run BFS\\n\\n timely::execute_from_args(std::env::args().skip(6), move |worker| {\\n\\n\\n\\n let timer = ::std::time::Instant::now();\\n\\n\\n\\n let index = worker.index();\\n\\n let peers = worker.peers();\\n\\n\\n\\n // create a degree counting differential dataflow\\n\\n let (mut input, probe) = worker.dataflow(|scope| {\\n\\n\\n\\n // create edge input, count a few ways.\\n\",\n \"file_path\": \"examples/degrees.rs\",\n \"rank\": 91,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n timely::execute_from_args(std::env::args(), move |worker| {\\n\\n\\n\\n // Used to determine if our output has caught up to our input.\\n\\n let mut probe: ProbeHandle<Pair<isize, isize>> = ProbeHandle::new();\\n\\n\\n\\n let (mut input, mut capability, mut trace) =\\n\\n worker.dataflow(|scope| {\\n\\n\\n\\n // Create \\\"unordered\\\" inputs which provide their capabilities to users.\\n\\n // Here \\\"capability\\\" is a technical term, which is \\\"permission to send\\n\\n // data or after a certain timestamp\\\". When this capability is dropped\\n\\n // or downgraded, the input communicates that its possible timestamps\\n\\n // have advanced, and the system can start to make progress.\\n\\n let ((input, capability), data) = scope.new_unordered_input();\\n\\n\\n\\n let arrangement =\\n\\n data.as_collection()\\n\\n .count()\\n\",\n \"file_path\": \"examples/multitemporal.rs\",\n \"rank\": 92,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let large: usize = std::env::args().nth(1).unwrap().parse().unwrap();\\n\\n let small: usize = std::env::args().nth(2).unwrap().parse().unwrap();\\n\\n let batch: usize = std::env::args().nth(3).unwrap().parse().unwrap();\\n\\n let total: usize = std::env::args().nth(4).unwrap().parse().unwrap();\\n\\n\\n\\n // define a new timely dataflow computation.\\n\\n timely::execute_from_args(std::env::args().skip(3), move |worker| {\\n\\n\\n\\n let timer = ::std::time::Instant::now();\\n\\n\\n\\n let mut probe = timely::dataflow::operators::probe::Handle::new();\\n\\n\\n\\n // create a dataflow managing an ever-changing edge collection.\\n\\n \\tlet mut handle = worker.dataflow(|scope| {\\n\\n let (handle, input) = scope.new_collection();\\n\\n input.distinct().probe_with(&mut probe);\\n\\n handle\\n\\n });\\n\",\n \"file_path\": \"examples/compact.rs\",\n \"rank\": 93,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n // snag a filename to use for the input graph.\\n\\n let filename = std::env::args().nth(1).unwrap();\\n\\n let iterations: Iter = std::env::args().nth(2).unwrap().parse().unwrap();\\n\\n let inspect = std::env::args().nth(3) == Some(\\\"inspect\\\".to_string());\\n\\n\\n\\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\\n\\n\\n\\n let peers = worker.peers();\\n\\n let index = worker.index();\\n\\n let timer = worker.timer();\\n\\n\\n\\n let mut input = InputSession::new();\\n\\n let mut probe = ProbeHandle::new();\\n\\n\\n\\n worker.dataflow::<Time,_,_>(|scope| {\\n\\n let edges = input.to_collection(scope);\\n\\n pagerank(iterations, &edges)\\n\\n .filter(move |_| inspect)\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 94,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n // snag a filename to use for the input graph.\\n\\n let filename = std::env::args().nth(1).unwrap();\\n\\n\\n\\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\\n\\n\\n\\n let peers = worker.peers();\\n\\n let index = worker.index();\\n\\n\\n\\n // // What you might do if you used GraphMMap:\\n\\n let graph = GraphMMap::new(&filename);\\n\\n let nodes = graph.nodes();\\n\\n let edges = (0..nodes).filter(move |node| node % peers == index)\\n\\n .flat_map(|node| graph.edges(node).iter().cloned().map(move |dst| ((node as u32, dst))))\\n\\n .map(|(src, dst)| ((src, dst), Default::default(), 1))\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n println!(\\\"loaded {} nodes, {} edges\\\", nodes, edges.len());\\n\\n\\n\\n worker.dataflow::<(),_,_>(|scope| {\\n\\n interpret(&Collection::new(edges.to_stream(scope)), &[(0,2), (1,2)]);\\n\\n });\\n\\n\\n\\n }).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/interpreted.rs\",\n \"rank\": 95,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n // define a new computational scope, in which to run BFS\\n\\n timely::execute_from_args(std::env::args(), move |worker| {\\n\\n \\n\\n // define BFS dataflow; return handles to roots and edges inputs\\n\\n let mut probe = Handle::new();\\n\\n let (mut rules, mut graph) = worker.dataflow(|scope| {\\n\\n\\n\\n let (rule_input, rules) = scope.new_collection();\\n\\n let (edge_input, graph) = scope.new_collection();\\n\\n\\n\\n let result = graph.iterate(|inner| {\\n\\n\\n\\n let rules = rules.enter(&inner.scope());\\n\\n let arranged = inner.arrange_by_key();\\n\\n\\n\\n // rule 0: remove self-loops:\\n\\n let freeze0 = freeze(&arranged, |t| {\\n\\n if t.inner <= 0 {\\n\",\n \"file_path\": \"examples/freeze.rs\",\n \"rank\": 96,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n // define a new computational scope, in which to run BFS\\n\\n timely::execute_from_args(std::env::args(), move |worker| {\\n\\n\\n\\n // An input for (x,y,z) placements.\\n\\n let mut xyzs = InputSession::<_,_,isize>::new();\\n\\n\\n\\n // Inputs for (x,y) and (x,z) goals.\\n\\n let mut xy_goal = InputSession::new();\\n\\n let mut xz_goal = InputSession::new();\\n\\n\\n\\n let mut probe = Handle::new();\\n\\n\\n\\n // Dataflow to validate input against goals.\\n\\n worker.dataflow(|scope| {\\n\\n\\n\\n // Introduce inputs to the scope.\\n\\n let xyzs = xyzs.to_collection(scope);\\n\\n let xy_goal = xy_goal.to_collection(scope);\\n\",\n \"file_path\": \"examples/projekt.rs\",\n \"rank\": 97,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let nodes: u32 = std::env::args().nth(1).unwrap().parse().unwrap();\\n\\n let edges: u32 = std::env::args().nth(2).unwrap().parse().unwrap();\\n\\n let batch: u32 = std::env::args().nth(3).unwrap().parse().unwrap();\\n\\n let rounds: u32 = std::env::args().nth(4).unwrap().parse().unwrap();\\n\\n let inspect: bool = std::env::args().nth(5).unwrap() == \\\"inspect\\\";\\n\\n\\n\\n // define a new computational scope, in which to run BFS\\n\\n timely::execute_from_args(std::env::args(), move |worker| {\\n\\n\\n\\n if let Ok(addr) = ::std::env::var(\\\"DIFFERENTIAL_LOG_ADDR\\\") {\\n\\n\\n\\n eprintln!(\\\"enabled DIFFERENTIAL logging to {}\\\", addr);\\n\\n\\n\\n if let Ok(stream) = ::std::net::TcpStream::connect(&addr) {\\n\\n let writer = ::timely::dataflow::operators::capture::EventWriter::new(stream);\\n\\n let mut logger = ::timely::logging::BatchLogger::new(writer);\\n\\n worker.log_register().insert::<DifferentialEvent,_>(\\\"differential/arrange\\\", move |time, data|\\n\\n logger.publish_batch(time, data)\\n\",\n \"file_path\": \"examples/bfs.rs\",\n \"rank\": 98,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let mut args = std::env::args();\\n\\n args.next();\\n\\n\\n\\n let nodes: u32 = args.next().unwrap().parse().unwrap();\\n\\n let edges: usize = args.next().unwrap().parse().unwrap();\\n\\n let batch: u32 = args.next().unwrap().parse().unwrap();\\n\\n let inspect: bool = args.next().unwrap() == \\\"inspect\\\";\\n\\n\\n\\n // define a new computational scope, in which to run BFS\\n\\n timely::execute_from_args(std::env::args().skip(5), move |worker| {\\n\\n\\n\\n let timer = ::std::time::Instant::now();\\n\\n\\n\\n let index = worker.index();\\n\\n let peers = worker.peers();\\n\\n\\n\\n // create a degree counting differential dataflow\\n\\n let (mut input, probe) = worker.dataflow::<u32,_,_>(|scope| {\\n\",\n \"file_path\": \"examples/hello.rs\",\n \"rank\": 99,\n \"score\": 169558.44478451117\n }\n]","isConversational":false}}},{"rowIdx":799,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"incident-recipient/gherkin-rust"},"commit":{"kind":"string","value":"7668c349ced30d5332821538ce321737cdbbacec"},"file_code":{"kind":"string","value":"\n\nmod parser;\npub mod tagexpr;\n\npub use peg::error::ParseError;\npub use peg::str::LineCol;\n\nuse typed_builder::TypedBuilder;\n\nuse std::path::{Path, PathBuf};\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Background {\n \n pub steps: Vec<Step>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Examples {\n \n pub table: Table,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Feature {\n \n pub name: String,\n \n #[builder(default)]\n pub description: Option<String>,\n \n #[builder(default)]\n pub background: Option<Background>,\n \n #[builder(default)]\n pub scenarios: Vec<Scenario>,\n \n #[builder(default)]\n pub rules: Vec<Rule>,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n \n #[builder(default)]\n pub path: Option<PathBuf>,\n}\n\nimpl PartialOrd for Feature {\n fn partial_cmp(&self, other: &Feature) -> Option<std::cmp::Ordering> {\n Some(self.cmp(other))\n }\n}\n\nimpl Ord for Feature {\n fn cmp(&self, other: &Feature) -> std::cmp::Ordering {\n self.name.cmp(&other.name)\n }\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Rule {\n \n pub name: String,\n \n #[builder(default)]\n pub background: Option<Background>,\n \n pub scenarios: Vec<Scenario>,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Scenario {\n \n pub name: String,\n \n pub steps: Vec<Step>,\n \n #[builder(default)]\n pub examples: Option<Examples>,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Step {\n \n pub ty: StepType,\n \n pub raw_type: String,\n \n pub value: String,\n \n #[builder(default)]\n pub docstring: Option<String>,\n \n #[builder(default)]\n pub table: Option<Table>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Hash, Eq)]\npub enum StepType {\n Given,\n When,\n Then,\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Table {\n \n pub rows: Vec<Vec<String>>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\nimpl Table {\n pub fn row_width(&self) -> usize {\n self.rows\n .iter()\n .next()\n .map(|x| x.len())\n .unwrap_or_else(|| 0)\n }\n}\n\n#[derive(Debug, thiserror::Error)]\npub enum ParseFileError {\n #[error(\"Could not read path: {0}\")]\n Reading(PathBuf, #[source] std::io::Error),\n\n #[error(\"Could not parse feature file: {0}\")]\n Parsing(\n PathBuf,\n #[source] peg::error::ParseError<peg::str::LineCol>,\n ),\n}\n\nimpl Feature {\n #[inline]\n pub fn parse_path<P: AsRef<Path>>(path: P) -> Result<Feature, ParseFileError> {\n let s = std::fs::read_to_string(path.as_ref())\n .map_err(|e| ParseFileError::Reading(path.as_ref().to_path_buf(), e))?;\n let mut feature = parser::gherkin_parser::feature(&s, &Default::default())\n .map_err(|e| ParseFileError::Parsing(path.as_ref().to_path_buf(), e))?;\n feature.path = Some(path.as_ref().to_path_buf());\n Ok(feature)\n }\n\n #[inline]\n pub fn parse<S: AsRef<str>>(input: S) -> Result<Feature, ParseError<LineCol>> {\n parser::gherkin_parser::feature(input.as_ref(), &Default::default())\n }\n}\n\nimpl Step {\n pub fn docstring(&self) -> Option<&String> {\n match &self.docstring {\n Some(v) => Some(&v),\n None => None,\n }\n }\n\n pub fn table(&self) -> Option<&Table> {\n match &self.table {\n Some(v) => Some(&v),\n None => None,\n }\n }\n}\n\nimpl std::fmt::Display for Step {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n write!(f, \"{} {}\", &self.raw_type, &self.value)\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nmod parser;\npub mod tagexpr;\n\npub use peg::error::ParseError;\npub use peg::str::LineCol;\n\nuse typed_builder::TypedBuilder;\n\nuse std::path::{Path, PathBuf};\n\n#[derive(Debug, Clone, TypedBuilder, P"},"suffix":{"kind":"string","value":"e {\n Some(v) => Some(&v),\n None => None,\n }\n }\n}\n\nimpl std::fmt::Display for Step {\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n write!(f, \"{} {}\", &self.raw_type, &self.value)\n }\n}\n"},"middle":{"kind":"string","value":"artialEq, Hash, Eq)]\npub struct Background {\n \n pub steps: Vec<Step>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Examples {\n \n pub table: Table,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Feature {\n \n pub name: String,\n \n #[builder(default)]\n pub description: Option<String>,\n \n #[builder(default)]\n pub background: Option<Background>,\n \n #[builder(default)]\n pub scenarios: Vec<Scenario>,\n \n #[builder(default)]\n pub rules: Vec<Rule>,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n \n #[builder(default)]\n pub path: Option<PathBuf>,\n}\n\nimpl PartialOrd for Feature {\n fn partial_cmp(&self, other: &Feature) -> Option<std::cmp::Ordering> {\n Some(self.cmp(other))\n }\n}\n\nimpl Ord for Feature {\n fn cmp(&self, other: &Feature) -> std::cmp::Ordering {\n self.name.cmp(&other.name)\n }\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Rule {\n \n pub name: String,\n \n #[builder(default)]\n pub background: Option<Background>,\n \n pub scenarios: Vec<Scenario>,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Scenario {\n \n pub name: String,\n \n pub steps: Vec<Step>,\n \n #[builder(default)]\n pub examples: Option<Examples>,\n \n #[builder(default)]\n pub tags: Vec<String>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Step {\n \n pub ty: StepType,\n \n pub raw_type: String,\n \n pub value: String,\n \n #[builder(default)]\n pub docstring: Option<String>,\n \n #[builder(default)]\n pub table: Option<Table>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Hash, Eq)]\npub enum StepType {\n Given,\n When,\n Then,\n}\n\n#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]\npub struct Table {\n \n pub rows: Vec<Vec<String>>,\n \n #[builder(default)]\n pub span: (usize, usize),\n \n #[builder(default)]\n pub position: (usize, usize),\n}\n\nimpl Table {\n pub fn row_width(&self) -> usize {\n self.rows\n .iter()\n .next()\n .map(|x| x.len())\n .unwrap_or_else(|| 0)\n }\n}\n\n#[derive(Debug, thiserror::Error)]\npub enum ParseFileError {\n #[error(\"Could not read path: {0}\")]\n Reading(PathBuf, #[source] std::io::Error),\n\n #[error(\"Could not parse feature file: {0}\")]\n Parsing(\n PathBuf,\n #[source] peg::error::ParseError<peg::str::LineCol>,\n ),\n}\n\nimpl Feature {\n #[inline]\n pub fn parse_path<P: AsRef<Path>>(path: P) -> Result<Feature, ParseFileError> {\n let s = std::fs::read_to_string(path.as_ref())\n .map_err(|e| ParseFileError::Reading(path.as_ref().to_path_buf(), e))?;\n let mut feature = parser::gherkin_parser::feature(&s, &Default::default())\n .map_err(|e| ParseFileError::Parsing(path.as_ref().to_path_buf(), e))?;\n feature.path = Some(path.as_ref().to_path_buf());\n Ok(feature)\n }\n\n #[inline]\n pub fn parse<S: AsRef<str>>(input: S) -> Result<Feature, ParseError<LineCol>> {\n parser::gherkin_parser::feature(input.as_ref(), &Default::default())\n }\n}\n\nimpl Step {\n pub fn docstring(&self) -> Option<&String> {\n match &self.docstring {\n Some(v) => Some(&v),\n None => None,\n }\n }\n\n pub fn table(&self) -> Option<&Table> {\n match &self.tabl"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"//! let op: TagOperation = \"@a and @b\".parse()?;\n\n//! # Ok(())\n\n//! # }\n\n//! ```\n\n\n\nuse std::str::FromStr;\n\n\n\nimpl FromStr for TagOperation {\n\n type Err = peg::error::ParseError<peg::str::LineCol>;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n crate::parser::gherkin_parser::tag_operation(s, &Default::default())\n\n }\n\n}\n\n\n\n/// A parsed tree of operations for Gherkin tags.\n\n#[derive(Debug, Clone)]\n\npub enum TagOperation {\n\n And(Box<TagOperation>, Box<TagOperation>),\n\n Or(Box<TagOperation>, Box<TagOperation>),\n","file_path":"src/tagexpr.rs","rank":0,"score":18712.470849082445},{"content":" Not(Box<TagOperation>),\n\n Tag(String),\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn parse_tag_expr1() {\n\n let foo: TagOperation = \"@foo and @bar\".parse().unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n #[test]\n\n fn parse_tag_expr2() {\n\n let foo: TagOperation = \"@foo or @bar\".parse().unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n\n\n #[test]\n","file_path":"src/tagexpr.rs","rank":1,"score":18710.12728539006},{"content":"// Copyright (c) 2020 Brendan Molloy <brendan@bbqsrc.net>\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\n//! ### Tag expressions\n\n//!\n\n//! You can read about tag expressions in the [Cucumber documentation](https://cucumber.io/docs/cucumber/api/#tag-expressions).\n\n//!\n\n//! This implements the parsing apparatus for these expressions so that other crates like [cucumber_rust](https://github.com/bbqsrc/cucumber-rust)\n\n//! may take advantage of them.\n\n//!\n\n//! #### Usage\n\n//!\n\n//! ```\n\n//! use gherkin_rust::tagexpr::TagOperation;\n\n//! # fn main() -> Result<(), peg::error::ParseError<peg::str::LineCol>> {\n","file_path":"src/tagexpr.rs","rank":2,"score":18709.123782882394},{"content":" #[test]\n\n fn parse_tag_expr7() {\n\n let foo: TagOperation = \"not (@a or @b) and (@c or not @d)\"\n\n .parse()\n\n .unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n\n\n #[test]\n\n fn parse_tag_expr8() {\n\n let foo: TagOperation = \"@a or @b and @c or not @d\"\n\n .parse()\n\n .unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n}\n","file_path":"src/tagexpr.rs","rank":3,"score":18707.26713550207},{"content":" fn parse_tag_expr1b() {\n\n let foo: TagOperation = \"(@foo and @bar)\"\n\n .parse()\n\n .unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n #[test]\n\n fn parse_tag_expr2b() {\n\n let foo: TagOperation = \"(@foo or @bar)\".parse().unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n\n\n #[test]\n\n fn parse_tag_expr3() {\n\n let foo: TagOperation = \"not @fat\".parse().unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n\n\n #[test]\n\n fn parse_tag_expr4() {\n","file_path":"src/tagexpr.rs","rank":4,"score":18707.26713550207},{"content":" let foo: Result<TagOperation, _> = \"@foo not @bar\".parse();\n\n assert!(foo.is_err());\n\n }\n\n\n\n #[test]\n\n fn parse_tag_expr5() {\n\n let foo: TagOperation = \"(not @foo) and not (@haha or @bar)\"\n\n .parse()\n\n .unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n\n\n #[test]\n\n fn parse_tag_expr6() {\n\n let foo: TagOperation = \"not @foo and not @haha or @bar\"\n\n .parse()\n\n .unwrap_or_else(|e| panic!(\"{}\", e));\n\n println!(\"{:#?}\", foo);\n\n }\n\n\n","file_path":"src/tagexpr.rs","rank":5,"score":18707.26713550207},{"content":" Background:\n\n Given I have overdue tasks\n\n\n\n Example: First use of the day\n\n Given I last used the app yesterday\n\n When I use the app\n\n Then I am notified about overdue tasks\n\n\n\n Example: Already used today\n\n Given I last used the app earlier today\n\n When I use the app\n\n Then I am not notified about overdue tasks\n\n\";\n\n\n\n #[test]\n\n fn smoke() {\n\n let env = GherkinEnv::default();\n\n assert!(gherkin_parser::feature(FOO, &env).is_ok());\n\n }\n\n\n","file_path":"src/parser.rs","rank":6,"score":15198.794676032365},{"content":"// Copyright (c) 2020 Brendan Molloy <brendan@bbqsrc.net>\n\n//\n\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\n\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\n\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\n\n// option. This file may not be copied, modified, or distributed\n\n// except according to those terms.\n\n\n\nuse std::cell::RefCell;\n\n\n\nuse crate::tagexpr::TagOperation;\n\nuse crate::{Background, Examples, Feature, Rule, Scenario, Step, StepType, Table};\n\n\n","file_path":"src/parser.rs","rank":7,"score":15197.95008653198},{"content":"}}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n\n\n const FOO: &str = \"# language: formal\\r\\n\n\n@hot-stuff\n\nSection: 4.2. The thing we care about\n\nA description just jammed in here for no reason\n\n@lol @a @rule @with-spaces\n\nRule: All gubbins must be placed in the airlock\n\n\n\n@bad_idea\n\nEvidence: A gubbins in an airlock\n\n Given a gubbins\n\n \\\"\\\"\\\"\n\n That's a gubbins\n\n and that is\n\n and so is that\n","file_path":"src/parser.rs","rank":8,"score":15197.656489495515},{"content":"}\n\n\n\npeg::parser! { pub(crate) grammar gherkin_parser(env: &GherkinEnv) for str {\n\n\n\nrule _() = quiet!{[' ' | '\\t']*}\n\nrule __() = quiet!{[' ' | '\\t']+}\n\n\n\nrule nl0() = quiet!{\"\\r\"? \"\\n\"}\n\nrule nl() = quiet!{nl0() p:position!() comment()* {\n\n env.increment_nl(p);\n\n}} \n\nrule eof() = quiet!{![_]}\n\nrule nl_eof() = quiet!{(nl() / [' ' | '\\t'])+ / eof()}\n\nrule comment() = quiet!{[' ' | '\\t']* \"#\" $((!nl0()[_])*) nl()}\n\nrule not_nl() -> &'input str = n:$((!nl0()[_])+) { n }\n\n\n\nrule match_until_starting_word_is_keyword() -> &'input str = n:$((not_nl() / \n\n (!(nl() __ (keyword((env.keywords().given)) / keyword((env.keywords().when)) / keyword((env.keywords().then))) ) nl()))+ nl()) { n }\n\nrule keyword1(list: &[&'static str]) -> &'static str\n\n = input:$([_]*<\n","file_path":"src/parser.rs","rank":9,"score":15197.035150461717},{"content":" #[test]\n\n fn smoke2() {\n\n let env = GherkinEnv::default();\n\n let d = env!(\"CARGO_MANIFEST_DIR\");\n\n let s = std::fs::read_to_string(format!(\"{}/tests/test.feature\", d)).unwrap();\n\n assert!(gherkin_parser::feature(&s, &env).is_ok());\n\n }\n\n\n\n #[test]\n\n fn smoke3() {\n\n let env = GherkinEnv::default();\n\n assert!(gherkin_parser::feature(RULE_WITH_BACKGROUND, &env).is_ok(),\n\n \"RULE_WITH_BACKGROUND was not parsed correctly!\");\n\n }\n\n\n\n #[test]\n\n fn smoke4() {\n\n let env = GherkinEnv::default();\n\n assert!(gherkin_parser::feature(RULE_WITH_RULE_IN_BACKGROUND, &env).is_ok(),\n\n \"RULE_WITH_RULE_IN_BACKGROUND was not parsed correctly!\");\n","file_path":"src/parser.rs","rank":10,"score":15196.660757622052},{"content":" .position(env.position(pa))\n\n .build()\n\n }\n\n\n\nrule tag_char() -> &'input str\n\n = s:$([_]) {?\n\n let x = s.chars().next().unwrap();\n\n if x.is_alphanumeric() || x == '_' || x == '-' {\n\n Ok(s)\n\n } else {\n\n Err(\"tag character\")\n\n }\n\n }\n\n\n\npub(crate) rule tag() -> String\n\n = \"@\" s:tag_char()+ { s.join(\"\") }\n\n\n\npub(crate) rule tags() -> Vec<String>\n\n = t:(tag() ** ([' ']+)) _ nl() { t }\n\n / { vec![] }\n","file_path":"src/parser.rs","rank":11,"score":15196.521703465454},{"content":" }\n\n\n\nrule table_cell() -> &'input str\n\n = \"|\" _ !(nl0() / eof()) n:$((!\"|\"[_])*) { n }\n\n\n\npub(crate) rule table_row() -> Vec<String>\n\n = n:(table_cell() ** _) _ \"|\" _ nl_eof() {\n\n n.into_iter()\n\n .map(str::trim)\n\n .map(str::to_string)\n\n .collect()\n\n }\n\n\n\npub(crate) rule table0() -> Vec<Vec<String>>\n\n = _ d:(table_row() ++ _) {\n\n if d.is_empty() {\n\n d\n\n } else {\n\n let len = d[0].len();\n\n d.into_iter().map(|mut x| { x.truncate(len); x }).collect()\n","file_path":"src/parser.rs","rank":12,"score":15196.362214270746},{"content":" }\n\n\n\nrule rules() -> Vec<Rule>\n\n = _ r:(rule_() ** _)? { r.unwrap_or_else(|| vec![]) }\n\n\n\npub(crate) rule scenarios() -> Vec<Scenario>\n\n = _ s:(scenario() ** _)? { s.unwrap_or_else(|| vec![]) }\n\n\n\npub rule feature() -> Feature\n\n = _ language_directive()? nl()*\n\n t:tags() nl()*\n\n pa:position!()\n\n keyword((env.keywords().feature)) \":\" _ n:$([_]+)\n\n d:description()? nl()*\n\n b:background()? nl()*\n\n s:scenarios() nl()*\n\n r:rules() pb:position!()\n\n nl()*\n\n {\n\n Feature::builder()\n","file_path":"src/parser.rs","rank":13,"score":15196.346052255052},{"content":" const RULE_WITH_MULTILINE_DESCRIPTION: &str = \"\n\nFeature: Everything with background inside rule\n\n\n\nRule: Be sure that I didn't started yet\n\n Background:\n\n Given I didn't started yet\n\n And I'm pretty sure about it\n\n\n\n Scenario: Long winded \n\n A long description elaborating on what is happening\n\n Given I just started\n\n\";\n\n\n\n // From Gherkin 6 documentation\n\n const RULE_WITH_RULE_IN_BACKGROUND: &str = \"\n\nFeature: Overdue tasks\n\n Let users know when tasks are overdue, even when using other\n\n features of the app\n\n\n\n Rule: Users are notified about overdue tasks on first use of the day\n","file_path":"src/parser.rs","rank":14,"score":15196.334350111629},{"content":" }\n\n \n\n #[test]\n\n fn multiline_desription() {\n\n let env = GherkinEnv::default();\n\n let feature_result = gherkin_parser::feature(RULE_WITH_MULTILINE_DESCRIPTION, &env);\n\n assert!(feature_result.is_ok(),\n\n \"RULE_WITH_MULTILINE_DESCRIPTION was not parsed correctly!\");\n\n }\n\n}\n","file_path":"src/parser.rs","rank":15,"score":15196.327045830527},{"content":" }\n\n }\n\n\n\npub(crate) rule table() -> Table\n\n = pa:position!() t:table0() pb:position!() {\n\n Table::builder()\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .rows(t)\n\n .build()\n\n }\n\n\n\npub(crate) rule step() -> Step\n\n = pa:position!() k:keyword((env.keywords().given)) __ n:not_nl() pb:position!() _ nl_eof() _\n\n d:docstring()? t:table()?\n\n {\n\n env.set_last_step(StepType::Given);\n\n Step::builder().ty(StepType::Given)\n\n .raw_type(k.to_string())\n\n .value(n.to_string())\n","file_path":"src/parser.rs","rank":16,"score":15196.172170930116},{"content":" but: &[\"Men\"],\n\n};\n\n\n\npub struct GherkinEnv {\n\n keywords: RefCell<Keywords<'static>>,\n\n last_step: RefCell<Option<StepType>>,\n\n last_keyword: RefCell<Option<String>>,\n\n line_offsets: RefCell<Vec<usize>>,\n\n}\n\n\n\nimpl GherkinEnv {\n\n pub fn set_language(&self, language: &str) -> Result<(), &'static str> {\n\n let keywords = match language {\n\n \"formal\" => FORMAL_SPEC_KEYWORDS,\n\n \"sv\" => SV_KEYWORDS,\n\n \"en\" => DEFAULT_KEYWORDS,\n\n _ => return Err(\"Error: requested language not supported\"),\n\n };\n\n\n\n *self.keywords.borrow_mut() = keywords;\n","file_path":"src/parser.rs","rank":17,"score":15196.121362306085},{"content":" .docstring(d)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build())\n\n }\n\n None => {\n\n Err(\"given, when or then\")\n\n }\n\n }\n\n }\n\n\n\npub(crate) rule steps() -> Vec<Step>\n\n = s:(step() ** _) {\n\n env.clear_last_step();\n\n s\n\n }\n\n\n\nrule background() -> Background\n\n = _ pa:position!()\n\n keyword((env.keywords().background)) \":\" _ nl_eof()\n","file_path":"src/parser.rs","rank":18,"score":15195.9464530836},{"content":" .tags(t)\n\n .name(n.to_string())\n\n .description(d.flatten())\n\n .background(b)\n\n .scenarios(s)\n\n .rules(r)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n\n }\n\n\n\npub rule tag_operation() -> TagOperation = precedence!{\n\n x:@ _ \"and\" _ y:(@) { TagOperation::And(Box::new(x), Box::new(y)) }\n\n x:@ _ \"or\" _ y:(@) { TagOperation::Or(Box::new(x), Box::new(y)) }\n\n \"not\" _ x:(@) { TagOperation::Not(Box::new(x)) }\n\n --\n\n t:tag() { TagOperation::Tag(t) }\n\n \"(\" t:tag_operation() \")\" _ { t }\n\n}\n\n\n","file_path":"src/parser.rs","rank":19,"score":15195.759907500005},{"content":" match env.last_keyword().as_ref() {\n\n Some(v) => Ok(v.len()),\n\n None => Err(\"no match\")\n\n }\n\n }\n\n\n\npub(crate) rule keyword(list: &[&'static str]) -> &'static str\n\n = len:keyword0(list) [_]*<{len}> {\n\n let kw = env.take_keyword();\n\n list.iter().find(|x| **x == &*kw).unwrap()\n\n }\n\n\n\nrule language_directive() -> ()\n\n = \"# language: \" l:$(['a'..='z']+) _ nl() {?\n\n env.set_language(l)\n\n }\n\n\n\nrule docstring() -> String\n\n = \"\\\"\\\"\\\"\" n:$((!\"\\\"\\\"\\\"\"[_])*) \"\\\"\\\"\\\"\" nl_eof() {\n\n textwrap::dedent(n)\n","file_path":"src/parser.rs","rank":20,"score":15195.731128353984},{"content":" fn take_keyword(&self) -> String {\n\n self.last_keyword.borrow_mut().take().unwrap()\n\n }\n\n\n\n fn set_last_step(&self, ty: StepType) {\n\n *self.last_step.borrow_mut() = Some(ty);\n\n }\n\n\n\n fn clear_last_step(&self) {\n\n *self.last_step.borrow_mut() = None;\n\n }\n\n\n\n fn last_step(&self) -> Option<StepType> {\n\n *self.last_step.borrow()\n\n }\n\n\n\n fn increment_nl(&self, offset: usize) {\n\n self.line_offsets.borrow_mut().push(offset);\n\n }\n\n\n","file_path":"src/parser.rs","rank":21,"score":15194.525098564987},{"content":" .table(t)\n\n .docstring(d)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n\n }\n\n / pa:position!() k:keyword((env.keywords().when)) __ n:not_nl() pb:position!() _ nl_eof() _\n\n d:docstring()? t:table()?\n\n {\n\n env.set_last_step(StepType::When);\n\n Step::builder().ty(StepType::When)\n\n .raw_type(k.to_string())\n\n .value(n.to_string())\n\n .table(t)\n\n .docstring(d)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n\n }\n\n / pa:position!() k:keyword((env.keywords().then)) __ n:not_nl() pb:position!() _ nl_eof() _\n","file_path":"src/parser.rs","rank":22,"score":15194.525098564987},{"content":"\n\nrule rule_() -> Rule\n\n = _\n\n t:tags()\n\n _\n\n pa:position!()\n\n keyword((env.keywords().rule)) \":\" _ n:not_nl() _ nl_eof()\n\n b:background()? nl()*\n\n s:scenarios()? nl()*\n\n // e:examples()?\n\n pb:position!()\n\n {\n\n Rule::builder()\n\n .name(n.to_string())\n\n .tags(t)\n\n .background(b)\n\n .scenarios(s.unwrap_or_else(|| vec![]))\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n","file_path":"src/parser.rs","rank":23,"score":15194.525098564987},{"content":" .examples(e)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n\n }\n\n / _\n\n t:tags()\n\n _\n\n pa:position!()\n\n keyword((env.keywords().scenario_outline)) \":\" _ n:not_nl() _ nl_eof()\n\n s:steps()?\n\n e:examples()?\n\n pb:position!()\n\n {\n\n Scenario::builder()\n\n .name(n.to_string())\n\n .tags(t)\n\n .steps(s.unwrap_or_else(|| vec![]))\n\n .examples(e)\n\n .span((pa, pb))\n","file_path":"src/parser.rs","rank":24,"score":15194.525098564987},{"content":" .table(tb)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n\n }\n\n\n\nrule scenario() -> Scenario\n\n = _\n\n t:tags()\n\n _\n\n pa:position!()\n\n keyword((env.keywords().scenario)) \":\" _ n:$(match_until_starting_word_is_keyword())\n\n s:steps()?\n\n e:examples()?\n\n pb:position!()\n\n {\n\n Scenario::builder()\n\n .name(n.to_string())\n\n .tags(t)\n\n .steps(s.unwrap_or_else(|| vec![]))\n","file_path":"src/parser.rs","rank":25,"score":15194.525098564987},{"content":" self.background,\n\n self.rule,\n\n self.scenario,\n\n self.rule,\n\n self.scenario_outline,\n\n self.examples,\n\n self.given,\n\n self.when,\n\n self.then,\n\n self.and,\n\n self.but,\n\n ]\n\n .iter()\n\n {\n\n v.append(&mut x.to_vec());\n\n }\n\n\n\n v\n\n }\n\n}\n","file_path":"src/parser.rs","rank":26,"score":15194.525098564987},{"content":" = d:(description_line() ** _) {\n\n let d = d.join(\"\\n\");\n\n if d.trim() == \"\" {\n\n None\n\n } else {\n\n Some(d)\n\n }\n\n }\n\n\n\nrule examples() -> Examples\n\n = _\n\n t:tags()\n\n _\n\n pa:position!()\n\n keyword((env.keywords().examples)) \":\" _ nl_eof()\n\n tb:table()\n\n pb:position!()\n\n {\n\n Examples::builder()\n\n .tags(t)\n","file_path":"src/parser.rs","rank":27,"score":15194.525098564987},{"content":" {list.iter().map(|x| x.len()).min().unwrap()},\n\n {list.iter().map(|x| x.len()).max().unwrap()}\n\n >) {?\n\n // println!(\"Input: {} {:?}\", &input, &list);\n\n match list.iter().find(|x| input.starts_with(**x)) {\n\n Some(v) => {\n\n env.set_keyword((*v).to_string());\n\n // println!(\"Found: {}\", &v);\n\n Err(\"success\")\n\n },\n\n None => {\n\n // println!(\"Unfound: {}\", &input);\n\n env.clear_keyword();\n\n Err(\"unknown keyword\")\n\n }\n\n }\n\n }\n\n\n\nrule keyword0(list: &[&'static str]) -> usize\n\n = keyword1(list)? {?\n","file_path":"src/parser.rs","rank":28,"score":15194.525098564987},{"content":"\n\nconst DEFAULT_KEYWORDS: Keywords<'static> = Keywords {\n\n feature: &[\"Feature\"],\n\n background: &[\"Background\"],\n\n rule: &[\"Rule\"],\n\n scenario: &[\"Scenario\", \"Example\"],\n\n scenario_outline: &[\"Scenario Outline\", \"Scenario Template\"],\n\n examples: &[\"Examples\"],\n\n given: &[\"Given\"],\n\n when: &[\"When\"],\n\n then: &[\"Then\"],\n\n and: &[\"*\", \"And\"],\n\n but: &[\"But\"],\n\n};\n\n\n\nconst FORMAL_SPEC_KEYWORDS: Keywords<'static> = Keywords {\n\n feature: &[\"Section\"],\n\n background: &[\"Context\"],\n\n rule: &[\"Rule\"],\n\n scenario: &[\"Proof\", \"Evidence\"],\n","file_path":"src/parser.rs","rank":29,"score":15194.525098564987},{"content":"\n\n Ok(())\n\n }\n\n\n\n fn keywords(&self) -> std::cell::Ref<Keywords<'static>> {\n\n self.keywords.borrow()\n\n }\n\n\n\n fn set_keyword(&self, kw: String) {\n\n *self.last_keyword.borrow_mut() = Some(kw);\n\n }\n\n\n\n fn clear_keyword(&self) {\n\n *self.last_keyword.borrow_mut() = None;\n\n }\n\n\n\n fn last_keyword(&self) -> std::cell::Ref<Option<String>> {\n\n self.last_keyword.borrow()\n\n }\n\n\n","file_path":"src/parser.rs","rank":30,"score":15194.525098564987},{"content":" \\\"\\\"\\\"\n\n When a gubbins is forced into this weird corner\n\n | a | b | c |\n\n | 1 | 2 | 3 |\n\n | 4 | 5 | 6 |\n\n Then a gubbins is proven to be in an airlock\n\n\";\n\n\n\n const RULE_WITH_BACKGROUND: &str = \"\n\nFeature: Everything with background inside rule\n\n\n\nRule: Be sure that I didn't started yet\n\n Background:\n\n Given I didn't started yet\n\n And I'm pretty sure about it\n\n\n\n Scenario: Nothing\n\n Given I just started\n\n\";\n\n\n","file_path":"src/parser.rs","rank":31,"score":15194.525098564987},{"content":" scenario_outline: &[\"Demonstration\"],\n\n examples: &[\"Examples\"],\n\n given: &[\"Given\"],\n\n when: &[\"When\"],\n\n then: &[\"Then\"],\n\n and: &[\"*\", \"And\"],\n\n but: &[\"But\"],\n\n};\n\n\n\nconst SV_KEYWORDS: Keywords<'static> = Keywords {\n\n feature: &[\"Egenskap\"],\n\n background: &[\"Bakgrund\"],\n\n rule: &[\"Regel\"],\n\n scenario: &[\"Scenario\", \"Exempel\"],\n\n scenario_outline: &[\"Abstrakt Scenario\"],\n\n examples: &[\"Exempel\"],\n\n given: &[\"Givet\"],\n\n when: &[\"När\"],\n\n then: &[\"Så\"],\n\n and: &[\"*\", \"Och\"],\n","file_path":"src/parser.rs","rank":32,"score":15194.525098564987},{"content":" d:docstring()? t:table()?\n\n {\n\n env.set_last_step(StepType::Then);\n\n Step::builder().ty(StepType::Then)\n\n .raw_type(k.to_string())\n\n .value(n.to_string())\n\n .table(t)\n\n .docstring(d)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n\n }\n\n / pa:position!() k:keyword((env.keywords().and)) __ n:not_nl() pb:position!() _ nl_eof() _\n\n d:docstring()? t:table()?\n\n {?\n\n match env.last_step() {\n\n Some(v) => {\n\n Ok(Step::builder().ty(v)\n\n .raw_type(k.to_string())\n\n .value(n.to_string())\n","file_path":"src/parser.rs","rank":33,"score":15194.525098564987},{"content":" s:steps()?\n\n pb:position!()\n\n {\n\n Background::builder()\n\n .steps(s.unwrap_or_else(|| vec![]))\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build()\n\n }\n\n\n\nrule any_directive() -> &'static str\n\n = k:keyword((&*env.keywords().all())) {\n\n // println!(\"Found directive: {}\", &k);\n\n k\n\n }\n\n\n\nrule description_line() -> &'input str\n\n = _ !\"@\" !any_directive() _ n:not_nl() nl_eof() { n }\n\n\n\nrule description() -> Option<String>\n","file_path":"src/parser.rs","rank":34,"score":15194.525098564987},{"content":" .table(t)\n\n .docstring(d)\n\n .span((pa, pb))\n\n .position(env.position(pa))\n\n .build())\n\n }\n\n None => {\n\n Err(\"given, when or then\")\n\n }\n\n }\n\n }\n\n / pa:position!() k:keyword((env.keywords().but)) __ n:not_nl() pb:position!() _ nl_eof() _\n\n d:docstring()? t:table()?\n\n {?\n\n match env.last_step() {\n\n Some(v) => {\n\n Ok(Step::builder().ty(v)\n\n .raw_type(k.to_string())\n\n .value(n.to_string())\n\n .table(t)\n","file_path":"src/parser.rs","rank":35,"score":15194.525098564987},{"content":" fn position(&self, offset: usize) -> (usize, usize) {\n\n let line_offsets = self.line_offsets.borrow();\n\n let index = line_offsets.iter().position(|x| x > &offset);\n\n\n\n let line = index.unwrap_or(0);\n\n let col = index.map(|i| offset - line_offsets[i - 1]).unwrap_or(offset) + 1;\n\n\n\n (line, col)\n\n }\n\n}\n\n\n\nimpl Default for GherkinEnv {\n\n fn default() -> Self {\n\n GherkinEnv {\n\n keywords: RefCell::new(DEFAULT_KEYWORDS),\n\n last_step: RefCell::new(None),\n\n last_keyword: RefCell::new(None),\n\n line_offsets: RefCell::new(vec![0]),\n\n }\n\n }\n","file_path":"src/parser.rs","rank":36,"score":15194.525098564987},{"content":"struct Keywords<'a> {\n\n feature: &'a [&'a str],\n\n background: &'a [&'a str],\n\n rule: &'a [&'a str],\n\n scenario: &'a [&'a str],\n\n scenario_outline: &'a [&'a str],\n\n examples: &'a [&'a str],\n\n given: &'a [&'a str],\n\n when: &'a [&'a str],\n\n then: &'a [&'a str],\n\n and: &'a [&'a str],\n\n but: &'a [&'a str],\n\n}\n\n\n\nimpl<'a> Keywords<'a> {\n\n pub fn all(&self) -> Vec<&'a str> {\n\n let mut v = vec![];\n\n\n\n for x in [\n\n self.feature,\n","file_path":"src/parser.rs","rank":37,"score":13880.762666461987},{"content":"extern crate cucumber;\n\n\n\nuse async_trait::async_trait;\n\nuse std::convert::Infallible;\n\n\n\npub struct MyWorld {}\n\n\n\n#[async_trait(?Send)]\n\nimpl cucumber::World for MyWorld {\n\n type Error = Infallible;\n\n\n\n async fn new() -> Result<Self, Infallible> {\n\n Ok(MyWorld {})\n\n }\n\n}\n\n\n\nmod t {\n\n use cucumber::Steps;\n\n\n\n pub fn steps() -> Steps<crate::MyWorld> {\n\n let builder: Steps<crate::MyWorld> = Steps::new();\n\n builder\n\n }\n\n}\n\n\n","file_path":"tests/cucumber.rs","rank":39,"score":5.5497302077034565}],"string":"[\n {\n \"content\": \"//! let op: TagOperation = \\\"@a and @b\\\".parse()?;\\n\\n//! # Ok(())\\n\\n//! # }\\n\\n//! ```\\n\\n\\n\\nuse std::str::FromStr;\\n\\n\\n\\nimpl FromStr for TagOperation {\\n\\n type Err = peg::error::ParseError<peg::str::LineCol>;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n crate::parser::gherkin_parser::tag_operation(s, &Default::default())\\n\\n }\\n\\n}\\n\\n\\n\\n/// A parsed tree of operations for Gherkin tags.\\n\\n#[derive(Debug, Clone)]\\n\\npub enum TagOperation {\\n\\n And(Box<TagOperation>, Box<TagOperation>),\\n\\n Or(Box<TagOperation>, Box<TagOperation>),\\n\",\n \"file_path\": \"src/tagexpr.rs\",\n \"rank\": 0,\n \"score\": 18712.470849082445\n },\n {\n \"content\": \" Not(Box<TagOperation>),\\n\\n Tag(String),\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn parse_tag_expr1() {\\n\\n let foo: TagOperation = \\\"@foo and @bar\\\".parse().unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n #[test]\\n\\n fn parse_tag_expr2() {\\n\\n let foo: TagOperation = \\\"@foo or @bar\\\".parse().unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/tagexpr.rs\",\n \"rank\": 1,\n \"score\": 18710.12728539006\n },\n {\n \"content\": \"// Copyright (c) 2020 Brendan Molloy <brendan@bbqsrc.net>\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\n//! ### Tag expressions\\n\\n//!\\n\\n//! You can read about tag expressions in the [Cucumber documentation](https://cucumber.io/docs/cucumber/api/#tag-expressions).\\n\\n//!\\n\\n//! This implements the parsing apparatus for these expressions so that other crates like [cucumber_rust](https://github.com/bbqsrc/cucumber-rust)\\n\\n//! may take advantage of them.\\n\\n//!\\n\\n//! #### Usage\\n\\n//!\\n\\n//! ```\\n\\n//! use gherkin_rust::tagexpr::TagOperation;\\n\\n//! # fn main() -> Result<(), peg::error::ParseError<peg::str::LineCol>> {\\n\",\n \"file_path\": \"src/tagexpr.rs\",\n \"rank\": 2,\n \"score\": 18709.123782882394\n },\n {\n \"content\": \" #[test]\\n\\n fn parse_tag_expr7() {\\n\\n let foo: TagOperation = \\\"not (@a or @b) and (@c or not @d)\\\"\\n\\n .parse()\\n\\n .unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn parse_tag_expr8() {\\n\\n let foo: TagOperation = \\\"@a or @b and @c or not @d\\\"\\n\\n .parse()\\n\\n .unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/tagexpr.rs\",\n \"rank\": 3,\n \"score\": 18707.26713550207\n },\n {\n \"content\": \" fn parse_tag_expr1b() {\\n\\n let foo: TagOperation = \\\"(@foo and @bar)\\\"\\n\\n .parse()\\n\\n .unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n #[test]\\n\\n fn parse_tag_expr2b() {\\n\\n let foo: TagOperation = \\\"(@foo or @bar)\\\".parse().unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn parse_tag_expr3() {\\n\\n let foo: TagOperation = \\\"not @fat\\\".parse().unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn parse_tag_expr4() {\\n\",\n \"file_path\": \"src/tagexpr.rs\",\n \"rank\": 4,\n \"score\": 18707.26713550207\n },\n {\n \"content\": \" let foo: Result<TagOperation, _> = \\\"@foo not @bar\\\".parse();\\n\\n assert!(foo.is_err());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn parse_tag_expr5() {\\n\\n let foo: TagOperation = \\\"(not @foo) and not (@haha or @bar)\\\"\\n\\n .parse()\\n\\n .unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn parse_tag_expr6() {\\n\\n let foo: TagOperation = \\\"not @foo and not @haha or @bar\\\"\\n\\n .parse()\\n\\n .unwrap_or_else(|e| panic!(\\\"{}\\\", e));\\n\\n println!(\\\"{:#?}\\\", foo);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/tagexpr.rs\",\n \"rank\": 5,\n \"score\": 18707.26713550207\n },\n {\n \"content\": \" Background:\\n\\n Given I have overdue tasks\\n\\n\\n\\n Example: First use of the day\\n\\n Given I last used the app yesterday\\n\\n When I use the app\\n\\n Then I am notified about overdue tasks\\n\\n\\n\\n Example: Already used today\\n\\n Given I last used the app earlier today\\n\\n When I use the app\\n\\n Then I am not notified about overdue tasks\\n\\n\\\";\\n\\n\\n\\n #[test]\\n\\n fn smoke() {\\n\\n let env = GherkinEnv::default();\\n\\n assert!(gherkin_parser::feature(FOO, &env).is_ok());\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 6,\n \"score\": 15198.794676032365\n },\n {\n \"content\": \"// Copyright (c) 2020 Brendan Molloy <brendan@bbqsrc.net>\\n\\n//\\n\\n// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or\\n\\n// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license\\n\\n// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your\\n\\n// option. This file may not be copied, modified, or distributed\\n\\n// except according to those terms.\\n\\n\\n\\nuse std::cell::RefCell;\\n\\n\\n\\nuse crate::tagexpr::TagOperation;\\n\\nuse crate::{Background, Examples, Feature, Rule, Scenario, Step, StepType, Table};\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 7,\n \"score\": 15197.95008653198\n },\n {\n \"content\": \"}}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n\\n\\n const FOO: &str = \\\"# language: formal\\\\r\\\\n\\n\\n@hot-stuff\\n\\nSection: 4.2. The thing we care about\\n\\nA description just jammed in here for no reason\\n\\n@lol @a @rule @with-spaces\\n\\nRule: All gubbins must be placed in the airlock\\n\\n\\n\\n@bad_idea\\n\\nEvidence: A gubbins in an airlock\\n\\n Given a gubbins\\n\\n \\\\\\\"\\\\\\\"\\\\\\\"\\n\\n That's a gubbins\\n\\n and that is\\n\\n and so is that\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 8,\n \"score\": 15197.656489495515\n },\n {\n \"content\": \"}\\n\\n\\n\\npeg::parser! { pub(crate) grammar gherkin_parser(env: &GherkinEnv) for str {\\n\\n\\n\\nrule _() = quiet!{[' ' | '\\\\t']*}\\n\\nrule __() = quiet!{[' ' | '\\\\t']+}\\n\\n\\n\\nrule nl0() = quiet!{\\\"\\\\r\\\"? \\\"\\\\n\\\"}\\n\\nrule nl() = quiet!{nl0() p:position!() comment()* {\\n\\n env.increment_nl(p);\\n\\n}} \\n\\nrule eof() = quiet!{![_]}\\n\\nrule nl_eof() = quiet!{(nl() / [' ' | '\\\\t'])+ / eof()}\\n\\nrule comment() = quiet!{[' ' | '\\\\t']* \\\"#\\\" $((!nl0()[_])*) nl()}\\n\\nrule not_nl() -> &'input str = n:$((!nl0()[_])+) { n }\\n\\n\\n\\nrule match_until_starting_word_is_keyword() -> &'input str = n:$((not_nl() / \\n\\n (!(nl() __ (keyword((env.keywords().given)) / keyword((env.keywords().when)) / keyword((env.keywords().then))) ) nl()))+ nl()) { n }\\n\\nrule keyword1(list: &[&'static str]) -> &'static str\\n\\n = input:$([_]*<\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 9,\n \"score\": 15197.035150461717\n },\n {\n \"content\": \" #[test]\\n\\n fn smoke2() {\\n\\n let env = GherkinEnv::default();\\n\\n let d = env!(\\\"CARGO_MANIFEST_DIR\\\");\\n\\n let s = std::fs::read_to_string(format!(\\\"{}/tests/test.feature\\\", d)).unwrap();\\n\\n assert!(gherkin_parser::feature(&s, &env).is_ok());\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn smoke3() {\\n\\n let env = GherkinEnv::default();\\n\\n assert!(gherkin_parser::feature(RULE_WITH_BACKGROUND, &env).is_ok(),\\n\\n \\\"RULE_WITH_BACKGROUND was not parsed correctly!\\\");\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn smoke4() {\\n\\n let env = GherkinEnv::default();\\n\\n assert!(gherkin_parser::feature(RULE_WITH_RULE_IN_BACKGROUND, &env).is_ok(),\\n\\n \\\"RULE_WITH_RULE_IN_BACKGROUND was not parsed correctly!\\\");\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 10,\n \"score\": 15196.660757622052\n },\n {\n \"content\": \" .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n\\n\\nrule tag_char() -> &'input str\\n\\n = s:$([_]) {?\\n\\n let x = s.chars().next().unwrap();\\n\\n if x.is_alphanumeric() || x == '_' || x == '-' {\\n\\n Ok(s)\\n\\n } else {\\n\\n Err(\\\"tag character\\\")\\n\\n }\\n\\n }\\n\\n\\n\\npub(crate) rule tag() -> String\\n\\n = \\\"@\\\" s:tag_char()+ { s.join(\\\"\\\") }\\n\\n\\n\\npub(crate) rule tags() -> Vec<String>\\n\\n = t:(tag() ** ([' ']+)) _ nl() { t }\\n\\n / { vec![] }\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 11,\n \"score\": 15196.521703465454\n },\n {\n \"content\": \" }\\n\\n\\n\\nrule table_cell() -> &'input str\\n\\n = \\\"|\\\" _ !(nl0() / eof()) n:$((!\\\"|\\\"[_])*) { n }\\n\\n\\n\\npub(crate) rule table_row() -> Vec<String>\\n\\n = n:(table_cell() ** _) _ \\\"|\\\" _ nl_eof() {\\n\\n n.into_iter()\\n\\n .map(str::trim)\\n\\n .map(str::to_string)\\n\\n .collect()\\n\\n }\\n\\n\\n\\npub(crate) rule table0() -> Vec<Vec<String>>\\n\\n = _ d:(table_row() ++ _) {\\n\\n if d.is_empty() {\\n\\n d\\n\\n } else {\\n\\n let len = d[0].len();\\n\\n d.into_iter().map(|mut x| { x.truncate(len); x }).collect()\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 12,\n \"score\": 15196.362214270746\n },\n {\n \"content\": \" }\\n\\n\\n\\nrule rules() -> Vec<Rule>\\n\\n = _ r:(rule_() ** _)? { r.unwrap_or_else(|| vec![]) }\\n\\n\\n\\npub(crate) rule scenarios() -> Vec<Scenario>\\n\\n = _ s:(scenario() ** _)? { s.unwrap_or_else(|| vec![]) }\\n\\n\\n\\npub rule feature() -> Feature\\n\\n = _ language_directive()? nl()*\\n\\n t:tags() nl()*\\n\\n pa:position!()\\n\\n keyword((env.keywords().feature)) \\\":\\\" _ n:$([_]+)\\n\\n d:description()? nl()*\\n\\n b:background()? nl()*\\n\\n s:scenarios() nl()*\\n\\n r:rules() pb:position!()\\n\\n nl()*\\n\\n {\\n\\n Feature::builder()\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 13,\n \"score\": 15196.346052255052\n },\n {\n \"content\": \" const RULE_WITH_MULTILINE_DESCRIPTION: &str = \\\"\\n\\nFeature: Everything with background inside rule\\n\\n\\n\\nRule: Be sure that I didn't started yet\\n\\n Background:\\n\\n Given I didn't started yet\\n\\n And I'm pretty sure about it\\n\\n\\n\\n Scenario: Long winded \\n\\n A long description elaborating on what is happening\\n\\n Given I just started\\n\\n\\\";\\n\\n\\n\\n // From Gherkin 6 documentation\\n\\n const RULE_WITH_RULE_IN_BACKGROUND: &str = \\\"\\n\\nFeature: Overdue tasks\\n\\n Let users know when tasks are overdue, even when using other\\n\\n features of the app\\n\\n\\n\\n Rule: Users are notified about overdue tasks on first use of the day\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 14,\n \"score\": 15196.334350111629\n },\n {\n \"content\": \" }\\n\\n \\n\\n #[test]\\n\\n fn multiline_desription() {\\n\\n let env = GherkinEnv::default();\\n\\n let feature_result = gherkin_parser::feature(RULE_WITH_MULTILINE_DESCRIPTION, &env);\\n\\n assert!(feature_result.is_ok(),\\n\\n \\\"RULE_WITH_MULTILINE_DESCRIPTION was not parsed correctly!\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 15,\n \"score\": 15196.327045830527\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\npub(crate) rule table() -> Table\\n\\n = pa:position!() t:table0() pb:position!() {\\n\\n Table::builder()\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .rows(t)\\n\\n .build()\\n\\n }\\n\\n\\n\\npub(crate) rule step() -> Step\\n\\n = pa:position!() k:keyword((env.keywords().given)) __ n:not_nl() pb:position!() _ nl_eof() _\\n\\n d:docstring()? t:table()?\\n\\n {\\n\\n env.set_last_step(StepType::Given);\\n\\n Step::builder().ty(StepType::Given)\\n\\n .raw_type(k.to_string())\\n\\n .value(n.to_string())\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 16,\n \"score\": 15196.172170930116\n },\n {\n \"content\": \" but: &[\\\"Men\\\"],\\n\\n};\\n\\n\\n\\npub struct GherkinEnv {\\n\\n keywords: RefCell<Keywords<'static>>,\\n\\n last_step: RefCell<Option<StepType>>,\\n\\n last_keyword: RefCell<Option<String>>,\\n\\n line_offsets: RefCell<Vec<usize>>,\\n\\n}\\n\\n\\n\\nimpl GherkinEnv {\\n\\n pub fn set_language(&self, language: &str) -> Result<(), &'static str> {\\n\\n let keywords = match language {\\n\\n \\\"formal\\\" => FORMAL_SPEC_KEYWORDS,\\n\\n \\\"sv\\\" => SV_KEYWORDS,\\n\\n \\\"en\\\" => DEFAULT_KEYWORDS,\\n\\n _ => return Err(\\\"Error: requested language not supported\\\"),\\n\\n };\\n\\n\\n\\n *self.keywords.borrow_mut() = keywords;\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 17,\n \"score\": 15196.121362306085\n },\n {\n \"content\": \" .docstring(d)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build())\\n\\n }\\n\\n None => {\\n\\n Err(\\\"given, when or then\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\npub(crate) rule steps() -> Vec<Step>\\n\\n = s:(step() ** _) {\\n\\n env.clear_last_step();\\n\\n s\\n\\n }\\n\\n\\n\\nrule background() -> Background\\n\\n = _ pa:position!()\\n\\n keyword((env.keywords().background)) \\\":\\\" _ nl_eof()\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 18,\n \"score\": 15195.9464530836\n },\n {\n \"content\": \" .tags(t)\\n\\n .name(n.to_string())\\n\\n .description(d.flatten())\\n\\n .background(b)\\n\\n .scenarios(s)\\n\\n .rules(r)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n\\n\\npub rule tag_operation() -> TagOperation = precedence!{\\n\\n x:@ _ \\\"and\\\" _ y:(@) { TagOperation::And(Box::new(x), Box::new(y)) }\\n\\n x:@ _ \\\"or\\\" _ y:(@) { TagOperation::Or(Box::new(x), Box::new(y)) }\\n\\n \\\"not\\\" _ x:(@) { TagOperation::Not(Box::new(x)) }\\n\\n --\\n\\n t:tag() { TagOperation::Tag(t) }\\n\\n \\\"(\\\" t:tag_operation() \\\")\\\" _ { t }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 19,\n \"score\": 15195.759907500005\n },\n {\n \"content\": \" match env.last_keyword().as_ref() {\\n\\n Some(v) => Ok(v.len()),\\n\\n None => Err(\\\"no match\\\")\\n\\n }\\n\\n }\\n\\n\\n\\npub(crate) rule keyword(list: &[&'static str]) -> &'static str\\n\\n = len:keyword0(list) [_]*<{len}> {\\n\\n let kw = env.take_keyword();\\n\\n list.iter().find(|x| **x == &*kw).unwrap()\\n\\n }\\n\\n\\n\\nrule language_directive() -> ()\\n\\n = \\\"# language: \\\" l:$(['a'..='z']+) _ nl() {?\\n\\n env.set_language(l)\\n\\n }\\n\\n\\n\\nrule docstring() -> String\\n\\n = \\\"\\\\\\\"\\\\\\\"\\\\\\\"\\\" n:$((!\\\"\\\\\\\"\\\\\\\"\\\\\\\"\\\"[_])*) \\\"\\\\\\\"\\\\\\\"\\\\\\\"\\\" nl_eof() {\\n\\n textwrap::dedent(n)\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 20,\n \"score\": 15195.731128353984\n },\n {\n \"content\": \" fn take_keyword(&self) -> String {\\n\\n self.last_keyword.borrow_mut().take().unwrap()\\n\\n }\\n\\n\\n\\n fn set_last_step(&self, ty: StepType) {\\n\\n *self.last_step.borrow_mut() = Some(ty);\\n\\n }\\n\\n\\n\\n fn clear_last_step(&self) {\\n\\n *self.last_step.borrow_mut() = None;\\n\\n }\\n\\n\\n\\n fn last_step(&self) -> Option<StepType> {\\n\\n *self.last_step.borrow()\\n\\n }\\n\\n\\n\\n fn increment_nl(&self, offset: usize) {\\n\\n self.line_offsets.borrow_mut().push(offset);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 21,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" .table(t)\\n\\n .docstring(d)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n / pa:position!() k:keyword((env.keywords().when)) __ n:not_nl() pb:position!() _ nl_eof() _\\n\\n d:docstring()? t:table()?\\n\\n {\\n\\n env.set_last_step(StepType::When);\\n\\n Step::builder().ty(StepType::When)\\n\\n .raw_type(k.to_string())\\n\\n .value(n.to_string())\\n\\n .table(t)\\n\\n .docstring(d)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n / pa:position!() k:keyword((env.keywords().then)) __ n:not_nl() pb:position!() _ nl_eof() _\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 22,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \"\\n\\nrule rule_() -> Rule\\n\\n = _\\n\\n t:tags()\\n\\n _\\n\\n pa:position!()\\n\\n keyword((env.keywords().rule)) \\\":\\\" _ n:not_nl() _ nl_eof()\\n\\n b:background()? nl()*\\n\\n s:scenarios()? nl()*\\n\\n // e:examples()?\\n\\n pb:position!()\\n\\n {\\n\\n Rule::builder()\\n\\n .name(n.to_string())\\n\\n .tags(t)\\n\\n .background(b)\\n\\n .scenarios(s.unwrap_or_else(|| vec![]))\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 23,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" .examples(e)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n / _\\n\\n t:tags()\\n\\n _\\n\\n pa:position!()\\n\\n keyword((env.keywords().scenario_outline)) \\\":\\\" _ n:not_nl() _ nl_eof()\\n\\n s:steps()?\\n\\n e:examples()?\\n\\n pb:position!()\\n\\n {\\n\\n Scenario::builder()\\n\\n .name(n.to_string())\\n\\n .tags(t)\\n\\n .steps(s.unwrap_or_else(|| vec![]))\\n\\n .examples(e)\\n\\n .span((pa, pb))\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 24,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" .table(tb)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n\\n\\nrule scenario() -> Scenario\\n\\n = _\\n\\n t:tags()\\n\\n _\\n\\n pa:position!()\\n\\n keyword((env.keywords().scenario)) \\\":\\\" _ n:$(match_until_starting_word_is_keyword())\\n\\n s:steps()?\\n\\n e:examples()?\\n\\n pb:position!()\\n\\n {\\n\\n Scenario::builder()\\n\\n .name(n.to_string())\\n\\n .tags(t)\\n\\n .steps(s.unwrap_or_else(|| vec![]))\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 25,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" self.background,\\n\\n self.rule,\\n\\n self.scenario,\\n\\n self.rule,\\n\\n self.scenario_outline,\\n\\n self.examples,\\n\\n self.given,\\n\\n self.when,\\n\\n self.then,\\n\\n self.and,\\n\\n self.but,\\n\\n ]\\n\\n .iter()\\n\\n {\\n\\n v.append(&mut x.to_vec());\\n\\n }\\n\\n\\n\\n v\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 26,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" = d:(description_line() ** _) {\\n\\n let d = d.join(\\\"\\\\n\\\");\\n\\n if d.trim() == \\\"\\\" {\\n\\n None\\n\\n } else {\\n\\n Some(d)\\n\\n }\\n\\n }\\n\\n\\n\\nrule examples() -> Examples\\n\\n = _\\n\\n t:tags()\\n\\n _\\n\\n pa:position!()\\n\\n keyword((env.keywords().examples)) \\\":\\\" _ nl_eof()\\n\\n tb:table()\\n\\n pb:position!()\\n\\n {\\n\\n Examples::builder()\\n\\n .tags(t)\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 27,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" {list.iter().map(|x| x.len()).min().unwrap()},\\n\\n {list.iter().map(|x| x.len()).max().unwrap()}\\n\\n >) {?\\n\\n // println!(\\\"Input: {} {:?}\\\", &input, &list);\\n\\n match list.iter().find(|x| input.starts_with(**x)) {\\n\\n Some(v) => {\\n\\n env.set_keyword((*v).to_string());\\n\\n // println!(\\\"Found: {}\\\", &v);\\n\\n Err(\\\"success\\\")\\n\\n },\\n\\n None => {\\n\\n // println!(\\\"Unfound: {}\\\", &input);\\n\\n env.clear_keyword();\\n\\n Err(\\\"unknown keyword\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\nrule keyword0(list: &[&'static str]) -> usize\\n\\n = keyword1(list)? {?\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 28,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \"\\n\\nconst DEFAULT_KEYWORDS: Keywords<'static> = Keywords {\\n\\n feature: &[\\\"Feature\\\"],\\n\\n background: &[\\\"Background\\\"],\\n\\n rule: &[\\\"Rule\\\"],\\n\\n scenario: &[\\\"Scenario\\\", \\\"Example\\\"],\\n\\n scenario_outline: &[\\\"Scenario Outline\\\", \\\"Scenario Template\\\"],\\n\\n examples: &[\\\"Examples\\\"],\\n\\n given: &[\\\"Given\\\"],\\n\\n when: &[\\\"When\\\"],\\n\\n then: &[\\\"Then\\\"],\\n\\n and: &[\\\"*\\\", \\\"And\\\"],\\n\\n but: &[\\\"But\\\"],\\n\\n};\\n\\n\\n\\nconst FORMAL_SPEC_KEYWORDS: Keywords<'static> = Keywords {\\n\\n feature: &[\\\"Section\\\"],\\n\\n background: &[\\\"Context\\\"],\\n\\n rule: &[\\\"Rule\\\"],\\n\\n scenario: &[\\\"Proof\\\", \\\"Evidence\\\"],\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 29,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \"\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn keywords(&self) -> std::cell::Ref<Keywords<'static>> {\\n\\n self.keywords.borrow()\\n\\n }\\n\\n\\n\\n fn set_keyword(&self, kw: String) {\\n\\n *self.last_keyword.borrow_mut() = Some(kw);\\n\\n }\\n\\n\\n\\n fn clear_keyword(&self) {\\n\\n *self.last_keyword.borrow_mut() = None;\\n\\n }\\n\\n\\n\\n fn last_keyword(&self) -> std::cell::Ref<Option<String>> {\\n\\n self.last_keyword.borrow()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 30,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" \\\\\\\"\\\\\\\"\\\\\\\"\\n\\n When a gubbins is forced into this weird corner\\n\\n | a | b | c |\\n\\n | 1 | 2 | 3 |\\n\\n | 4 | 5 | 6 |\\n\\n Then a gubbins is proven to be in an airlock\\n\\n\\\";\\n\\n\\n\\n const RULE_WITH_BACKGROUND: &str = \\\"\\n\\nFeature: Everything with background inside rule\\n\\n\\n\\nRule: Be sure that I didn't started yet\\n\\n Background:\\n\\n Given I didn't started yet\\n\\n And I'm pretty sure about it\\n\\n\\n\\n Scenario: Nothing\\n\\n Given I just started\\n\\n\\\";\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 31,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" scenario_outline: &[\\\"Demonstration\\\"],\\n\\n examples: &[\\\"Examples\\\"],\\n\\n given: &[\\\"Given\\\"],\\n\\n when: &[\\\"When\\\"],\\n\\n then: &[\\\"Then\\\"],\\n\\n and: &[\\\"*\\\", \\\"And\\\"],\\n\\n but: &[\\\"But\\\"],\\n\\n};\\n\\n\\n\\nconst SV_KEYWORDS: Keywords<'static> = Keywords {\\n\\n feature: &[\\\"Egenskap\\\"],\\n\\n background: &[\\\"Bakgrund\\\"],\\n\\n rule: &[\\\"Regel\\\"],\\n\\n scenario: &[\\\"Scenario\\\", \\\"Exempel\\\"],\\n\\n scenario_outline: &[\\\"Abstrakt Scenario\\\"],\\n\\n examples: &[\\\"Exempel\\\"],\\n\\n given: &[\\\"Givet\\\"],\\n\\n when: &[\\\"När\\\"],\\n\\n then: &[\\\"Så\\\"],\\n\\n and: &[\\\"*\\\", \\\"Och\\\"],\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 32,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" d:docstring()? t:table()?\\n\\n {\\n\\n env.set_last_step(StepType::Then);\\n\\n Step::builder().ty(StepType::Then)\\n\\n .raw_type(k.to_string())\\n\\n .value(n.to_string())\\n\\n .table(t)\\n\\n .docstring(d)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n / pa:position!() k:keyword((env.keywords().and)) __ n:not_nl() pb:position!() _ nl_eof() _\\n\\n d:docstring()? t:table()?\\n\\n {?\\n\\n match env.last_step() {\\n\\n Some(v) => {\\n\\n Ok(Step::builder().ty(v)\\n\\n .raw_type(k.to_string())\\n\\n .value(n.to_string())\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 33,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" s:steps()?\\n\\n pb:position!()\\n\\n {\\n\\n Background::builder()\\n\\n .steps(s.unwrap_or_else(|| vec![]))\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build()\\n\\n }\\n\\n\\n\\nrule any_directive() -> &'static str\\n\\n = k:keyword((&*env.keywords().all())) {\\n\\n // println!(\\\"Found directive: {}\\\", &k);\\n\\n k\\n\\n }\\n\\n\\n\\nrule description_line() -> &'input str\\n\\n = _ !\\\"@\\\" !any_directive() _ n:not_nl() nl_eof() { n }\\n\\n\\n\\nrule description() -> Option<String>\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 34,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" .table(t)\\n\\n .docstring(d)\\n\\n .span((pa, pb))\\n\\n .position(env.position(pa))\\n\\n .build())\\n\\n }\\n\\n None => {\\n\\n Err(\\\"given, when or then\\\")\\n\\n }\\n\\n }\\n\\n }\\n\\n / pa:position!() k:keyword((env.keywords().but)) __ n:not_nl() pb:position!() _ nl_eof() _\\n\\n d:docstring()? t:table()?\\n\\n {?\\n\\n match env.last_step() {\\n\\n Some(v) => {\\n\\n Ok(Step::builder().ty(v)\\n\\n .raw_type(k.to_string())\\n\\n .value(n.to_string())\\n\\n .table(t)\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 35,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \" fn position(&self, offset: usize) -> (usize, usize) {\\n\\n let line_offsets = self.line_offsets.borrow();\\n\\n let index = line_offsets.iter().position(|x| x > &offset);\\n\\n\\n\\n let line = index.unwrap_or(0);\\n\\n let col = index.map(|i| offset - line_offsets[i - 1]).unwrap_or(offset) + 1;\\n\\n\\n\\n (line, col)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for GherkinEnv {\\n\\n fn default() -> Self {\\n\\n GherkinEnv {\\n\\n keywords: RefCell::new(DEFAULT_KEYWORDS),\\n\\n last_step: RefCell::new(None),\\n\\n last_keyword: RefCell::new(None),\\n\\n line_offsets: RefCell::new(vec![0]),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 36,\n \"score\": 15194.525098564987\n },\n {\n \"content\": \"struct Keywords<'a> {\\n\\n feature: &'a [&'a str],\\n\\n background: &'a [&'a str],\\n\\n rule: &'a [&'a str],\\n\\n scenario: &'a [&'a str],\\n\\n scenario_outline: &'a [&'a str],\\n\\n examples: &'a [&'a str],\\n\\n given: &'a [&'a str],\\n\\n when: &'a [&'a str],\\n\\n then: &'a [&'a str],\\n\\n and: &'a [&'a str],\\n\\n but: &'a [&'a str],\\n\\n}\\n\\n\\n\\nimpl<'a> Keywords<'a> {\\n\\n pub fn all(&self) -> Vec<&'a str> {\\n\\n let mut v = vec![];\\n\\n\\n\\n for x in [\\n\\n self.feature,\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 37,\n \"score\": 13880.762666461987\n },\n {\n \"content\": \"extern crate cucumber;\\n\\n\\n\\nuse async_trait::async_trait;\\n\\nuse std::convert::Infallible;\\n\\n\\n\\npub struct MyWorld {}\\n\\n\\n\\n#[async_trait(?Send)]\\n\\nimpl cucumber::World for MyWorld {\\n\\n type Error = Infallible;\\n\\n\\n\\n async fn new() -> Result<Self, Infallible> {\\n\\n Ok(MyWorld {})\\n\\n }\\n\\n}\\n\\n\\n\\nmod t {\\n\\n use cucumber::Steps;\\n\\n\\n\\n pub fn steps() -> Steps<crate::MyWorld> {\\n\\n let builder: Steps<crate::MyWorld> = Steps::new();\\n\\n builder\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/cucumber.rs\",\n \"rank\": 39,\n \"score\": 5.5497302077034565\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":7,"numItemsPerPage":100,"numTotalItems":13489,"offset":700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTQ3MDEwOSwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3Nzk0NzM3MDksImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.FNqcCTTHmelovGu9hmHF3Ui7I8_6JnbJQ7IF6LrqubX09NOoeYgUJd1tOz4OCO14HIl_yaX6gXSBxT2wvJFjCg","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/language.rs | Xetera/ginkou-api | 48e8cea435b477d9365dc736407159f00321b1b0 | use std::fs::File;
use std::io;
use std::io::Write;
use std::path::{Path, PathBuf};
use std::string::FromUtf8Error;
extern crate dirs;
#[macro_use]
use rusqlite::params;
use rusqlite::Connection;
use structopt;
use structopt::StructOpt;
use mecab;
use mecab::Tagger;
const DAKUTEN_BYTES: [u8; 3] = [227, 128, 130];
con... | use std::fs::File;
use std::io;
use std::io::Write;
use std::path::{Path, PathBuf};
use std::string::FromUtf8Error;
extern crate dirs;
#[macro_use]
use rusqlite::params;
use rusqlite::Connection;
use structopt;
use structopt::StructOpt;
use mecab;
use mecab::Tagger;
const DAKUTEN_BYTES: [u8; 3] = [227, 128, 130];
con... |
#[test]
fn sentences_can_be_consumed() -> rusqlite::Result<()> {
let conn = conn_from_memory()?;
let sentence1 = "猫を見た";
let sentence2 = "犬を見る";
consume_trimmed(&conn, sentence1)?;
consume_trimmed(&conn, sentence2)?;
let a_sentences = vec![sentence1.into(), sent... | fn bank_lookup_works_correctly() -> rusqlite::Result<()> {
let conn = conn_from_memory()?;
let sentence1 = String::from("A B");
let sentence2 = String::from("A B C");
let s1 = add_sentence(&conn, &sentence1)?;
add_word(&conn, "A", s1)?;
add_word(&conn, "B", s1)?;
... | function_block-full_function | [
{
"content": "SELECT id, ?2 FROM WORDS WHERE word=?1 AND NOT EXISTS (SELECT 1 FROM WordSentence WHERE word_id=id AND sentence_id=?2);",
"file_path": "src/sql/add_word_junction.sql",
"rank": 11,
"score": 86279.24715323126
},
{
"content": "fn main() {\n\n rocket::ignite().mount(\"/\", routes!... |
Rust | corp_bot/src/main.rs | lholznagel/eve_online | 7f8cc4aa46b06c0edf64f89ff5853216cf5597b7 | mod asset;
use appraisal::{Appraisal, Janice};
use caph_connector::{EveAuthClient, CorporationService};
use num_format::{Locale, ToFormattedString};
use reqwest::{header::{HeaderMap, HeaderValue}, Client};
use serde::Serialize;
use sqlx::{PgPool, postgres::PgPoolOptions};
use tracing_subscriber::EnvFilter;
const PG_A... | mod asset;
use appraisal::{Appraisal, Janice};
use caph_connector::{EveAuthClient, CorporationService};
use num_format::{Locale, ToFormattedString};
use reqwest::{header::{HeaderMap, HeaderValue}, Client};
use serde::Serialize;
use sqlx::{PgPool, postgres::PgPoolOptions};
use tracing_subscriber::EnvFilter;
const PG_A... | ration_service = CorporationService::new(info.corporation_id.into());
let wallets = corporation_service
.wallets(&client)
.await
.unwrap();
Wallets {
master: wallets[0].balance,
moon: wallets[1].balance,
alliance: wallets[2].balance,
}
}
struct Wallets... | oken IS NOT NULL
AND c.corporation_id IS NOT NULL
"#
)
.fetch_one(pool)
.await
.unwrap();
let client = EveAuthClient::new(info.refresh_token).unwrap();
let corpo | function_block-random_span | [
{
"content": "/// Generates the basic SQL-Query that is required for items.\n\n///\n\n/// # Returns\n\n///\n\n/// String containing the SQL-Query.\n\n///\n\nfn sql_header() -> String {\n\n r#\"DELETE FROM items CASCADE;\"#.into()\n\n}\n\n\n",
"file_path": "sde_parser/src/items.rs",
"rank": 1,
"sc... |
Rust | sdk/src/system_transaction.rs | sunnygleason/solana | 1fb9ed98372dfaf8f9a6691e7ec6d5bc5577bd2a |
use crate::hash::Hash;
use crate::pubkey::Pubkey;
use crate::signature::Keypair;
use crate::system_instruction::SystemInstruction;
use crate::system_program;
use crate::transaction::{Instruction, Transaction};
pub struct SystemTransaction {}
impl SystemTransaction {
pub fn new_program_account(
from... |
use crate::hash::Hash;
use crate::pubkey::Pubkey;
use crate::signature::Keypair;
use crate::system_instruction::SystemInstruction;
use crate::system_program;
use crate::transaction::{Instruction, Transaction};
pub struct SystemTransaction {}
impl SystemTransaction {
pub fn new_program_account(
from... |
pub fn new_move_many(
from: &Keypair,
moves: &[(Pubkey, u64)],
last_id: Hash,
fee: u64,
) -> Transaction {
let instructions: Vec<_> = moves
.iter()
.enumerate()
.map(|(i, (_, amount))| {
let spend = SystemInstructi... | last_id: Hash,
fee: u64,
) -> Transaction {
let move_tokens = SystemInstruction::Move { tokens };
Transaction::new(
from_keypair,
&[to],
system_program::id(),
&move_tokens,
last_id,
fee,
)
} | function_block-function_prefix_line | [
{
"content": "pub fn create_ticks(num_ticks: u64, mut hash: Hash) -> Vec<Entry> {\n\n let mut ticks = Vec::with_capacity(num_ticks as usize);\n\n for _ in 0..num_ticks {\n\n let new_tick = next_entry_mut(&mut hash, 1, vec![]);\n\n ticks.push(new_tick);\n\n }\n\n\n\n ticks\n\n}\n\n\n",
... |
Rust | kvserver/src/server.rs | GITHUBear/KV_Server | a3532a91f50604c6d757891ceed0f457a34f2afd | extern crate protobuf;
extern crate futures;
extern crate grpcio;
pub mod kvprotos;
use std::io::Read;
use std::sync::{Arc, RwLock};
use std::{io, thread};
use std::collections::{BTreeMap, HashMap};
use futures::sync::oneshot;
use futures::Future;
use grpcio::{Environment, RpcContext, ServerBuilder, UnarySink};
use ... | extern crate protobuf;
extern crate futures;
extern crate grpcio;
pub mod kvprotos;
use std::io::Read;
use std::sync::{Arc, RwLock};
use std::{io, thread};
use std::collections::{BTreeMap, HashMap};
use futures::sync::oneshot;
use futures::Future;
use grpcio::{Environment, RpcContext, ServerBuilder, UnarySink};
use ... | :new();
for (k, v) in mutengine.read().unwrap().range(key_start.clone()..key_end.clone()){
resmap.insert(k.clone(), v.clone());
}
if resmap.len() != 0 {
response.set_status(ResponseStatus::kSuccess);
response.set_key_value(resmap);
}else{
response.set_status(ResponseStatus::... | .map_err(move |err| eprintln!("Failed to reply: {:?}", err));
ctx.spawn(f)
}
fn put(&mut self, ctx: RpcContext, req: PutRequest, sink: UnarySink<PutResponse>){
let mut response = PutResponse::new();
println!("Received PutRequest {{ {:?} }}", req);
let mutengine = &mut self.engi... | random | [
{
"content": "pub fn create_kvdb<S: Kvdb + Send + Clone + 'static>(s: S) -> ::grpcio::Service {\n\n let mut builder = ::grpcio::ServiceBuilder::new();\n\n let mut instance = s.clone();\n\n builder = builder.add_unary_handler(&METHOD_KVDB_GET, move |ctx, req, resp| {\n\n instance.get(ctx, req, re... |
Rust | src/main.rs | rodneylab/cmessless | 7ba78963aea19b3618c60215a55745207195960f | mod parser;
mod utility;
use atty::{is, Stream};
use clap::Parser;
use std::{
fs,
io::{self, BufRead},
path::{Path, PathBuf},
};
use watchexec::{
config::{Config, ConfigBuilder},
error::Result,
pathop::PathOp,
run::{watch, ExecHandler, Handler},
};
use parser::{author_name_from_cargo_pkg_a... | mod parser;
mod utility;
use atty::{is, Stream};
use clap::Parser;
use std::{
fs,
io::{self, BufRead},
path::{Path, PathBuf},
};
use watchexec::{
config::{Config, ConfigBuilder},
error::Result,
pathop::PathOp,
run::{watch, ExecHandler, Handler},
};
use parser::{author_name_from_cargo_pkg_a... | ;
if output_modified == None
|| input_modified == None
|| input_modified.unwrap() > output_modified.unwrap()
{
modified_files.push(String::from(input_path.to_string_lossy()));
}
}
println!("{}", modified_files.join(" "));
}
fn parse_multiple_files(mdx... | match fs::metadata(output_path) {
Ok(metadata_value) => match metadata_value.modified() {
Ok(value) => Some(value),
Err(_) => None,
},
Err(_) => None,
} | if_condition | [
{
"content": "pub fn parse_mdx_file(input_path: &Path, output_path: &Path, verbose: bool) {\n\n println!(\"[ INFO ] Parsing {:?}...\", input_path);\n\n let start = Instant::now();\n\n\n\n let file = File::open(input_path).expect(\"[ ERROR ] Couldn't open that file!\");\n\n let frontmatter_end_line_n... |
Rust | sqlx-core/src/pool/mod.rs | broomstar/sqlx | 6c8fd949dd052ddbad5c4dfe343682aed9286615 |
use std::{
fmt,
ops::{Deref, DerefMut},
sync::Arc,
time::{Duration, Instant},
};
use crate::Database;
use self::inner::SharedPool;
pub use self::options::Builder;
use self::options::Options;
mod executor;
mod inner;
mod options;
pub struct Pool<DB>(Arc<SharedPool<DB>>)
where
DB: Database;
str... |
use std::{
fmt,
ops::{Deref, DerefMut},
sync::Arc,
time::{Duration, Instant},
};
use crate::Database;
use self::inner::SharedPool;
pub use self::options::Builder;
use self::options::Options;
mod executor;
mod inner;
mod options;
pub struct Pool<DB>(Arc<SharedPool<DB>>)
where
DB: Database;
str... | f::Target {
&mut self.live.as_mut().expect(DEREF_ERR).raw
}
}
impl<DB: Database> Drop for Connection<DB> {
fn drop(&mut self) {
if let Some(live) = self.live.take() {
self.pool.release(live);
}
}
}
| .try_acquire().map(|conn| Connection {
live: Some(conn),
pool: Arc::clone(&self.0),
})
}
pub async fn close(&self) {
self.0.close().await;
}
pub fn size(&self) -> u32 {
self.0.size()
}
pub fn idle(&self) -> usize {
... | random | [
{
"content": "fn is_beyond_lifetime<DB: Database>(live: &Live<DB>, options: &Options) -> bool {\n\n // check if connection was within max lifetime (or not set)\n\n options\n\n .max_lifetime\n\n .map_or(false, |max| live.created.elapsed() > max)\n\n}\n\n\n",
"file_path": "sqlx-core/src/po... |
Rust | src/subcommand/launch.rs | chipsenkbeil/distant | c6c07c5c2ce6ef5c1499c08ce077a14c2c558716 | use crate::{
exit::{ExitCode, ExitCodeError},
msg::{MsgReceiver, MsgSender},
opt::{CommonOpt, Format, LaunchSubcommand, SessionOutput},
session::CliSession,
utils,
};
use derive_more::{Display, Error, From};
use distant_core::{
PlainCodec, RelayServer, Session, SessionInfo, SessionInfoFile, Tran... | use crate::{
exit::{ExitCode, ExitCodeError},
msg::{MsgReceiver, MsgSender},
opt::{CommonOpt, Format, LaunchSubcommand, SessionOutput},
session::CliSession,
utils,
};
use derive_more::{Display, Error, From};
use distant_core::{
PlainCodec, RelayServer, Session, SessionInfo, SessionInfoFile, Tran... |
#[cfg(unix)]
async fn socket_loop(
socket_path: impl AsRef<Path>,
info: SessionInfo,
duration: Duration,
fail_if_socket_exists: bool,
shutdown_after: Option<Duration>,
) -> io::Result<()> {
debug!("Connecting to {} {}", info.host, info.port);
let addr = info.to_socket_addr().awai... | async fn keep_loop(info: SessionInfo, format: Format, duration: Duration) -> io::Result<()> {
let addr = info.to_socket_addr().await?;
let codec = XChaCha20Poly1305Codec::from(info.key);
match Session::tcp_connect_timeout(addr, codec, duration).await {
Ok(session) => {
let cli_session = ... | function_block-full_function | [
{
"content": "pub fn run(cmd: ActionSubcommand, opt: CommonOpt) -> Result<(), Error> {\n\n let rt = tokio::runtime::Runtime::new()?;\n\n\n\n rt.block_on(async { run_async(cmd, opt).await })\n\n}\n\n\n\nasync fn run_async(cmd: ActionSubcommand, opt: CommonOpt) -> Result<(), Error> {\n\n let method = cmd... |
Rust | crates/brix_processor/tests/to_case.rs | miapolis/brix | 4a3939db28fff05a7a45fa32f1a75cd9abc29be3 |
use lazy_static::lazy_static;
use std::collections::HashMap;
mod common;
lazy_static! {
static ref TO_CASE_CONTEXT: HashMap<String, String> = {
let mut map = HashMap::new();
map.insert(String::from("one"), String::from("tHIS iS tOGGLE cASE"));
map.insert(String::from("two"), String::from... |
use lazy_static::lazy_static;
use std::collections::HashMap;
mod common;
lazy_static! {
static ref TO_CASE_CONTEXT: HashMap<String, String> = {
let mut map = HashMap::new();
map.insert(String::from("one"), String::from("tHIS iS tOGGLE cASE"));
map.insert(String::from("two"), String::from... | fn to_case() {
let core = common::setup();
let context = brix_processor::create_context(TO_CASE_CONTEXT.clone());
let contents = common::load_file("case").unwrap();
let result = core.process(contents, context).unwrap();
assert!(common::line_assert(result, TO_CASE_ASSERTIONS.to_vec()))
} | function_block-full_function | [
{
"content": "pub fn line_assert(contents: String, assertion: Vec<&str>) -> bool {\n\n let mut itr = 0;\n\n for line in contents.lines() {\n\n if assertion[itr] != line {\n\n return false;\n\n }\n\n itr += 1;\n\n }\n\n return true;\n\n}\n",
"file_path": "crates/br... | |
Rust | src/lib.rs | mikelma/ostrich-server | 685c29502e09a5e0d668ad85cc531ea68711f1f7 | use ostrich_core::*;
#[macro_use] extern crate log;
use tokio::sync::mpsc;
use tokio::net::{TcpStream};
use tokio::io::{AsyncReadExt, AsyncWriteExt, AsyncRead};
use tokio::stream::{Stream};
use std::collections::HashMap;
use std::io::{self, BufReader, prelude::*};
use std::fs::File;
use core::task::{Poll, Context};
... | use ostrich_core::*;
#[macro_use] extern crate log;
use tokio::sync::mpsc;
use tokio::net::{TcpStream};
use tokio::io::{AsyncReadExt, AsyncWriteExt, AsyncRead};
use tokio::stream::{Stream};
use std::collections::HashMap;
use std::io::{self, BufReader, prelude::*};
use std::fs::File;
use core::task::{Poll, Context};
... |
trace!("Init user: {}", name);
let password = match user["password"].as_str() {
Some(s) => s.to_string(),
None => continue,
};
db.push(User {name, password});
}
Ok(DataBase {db})
}
... | let name = match user["name"].as_str() {
Some(n) => n.to_string(),
None => continue,
}; | assignment_statement | [
{
"content": "use serde::Deserialize;\n\nuse toml;\n\n\n\nuse std::fs::File;\n\nuse std::io::Read;\n\n\n\n#[derive(Deserialize)]\n\npub struct Config {\n\n pub ip_address: String,\n\n pub port: usize,\n\n\n\n pub logger_file: String,\n\n pub database_file: String,\n\n}\n\n\n\nimpl Config {\n\n\n\n ... |
Rust | victor/src/dom/mod.rs | servo/victor | dda60efe07dd4cae0e9d93780ed661d41efb16b9 |
mod html;
use crate::style::StyleSetBuilder;
use html5ever::tendril::StrTendril;
use html5ever::{Attribute, ExpandedName, LocalName, QualName};
use std::borrow::Cow;
use std::fmt;
pub struct Document {
nodes: Vec<Node>,
style_elements: Vec<NodeId>,
}
pub struct Node {
pub(crate) parent: Option<NodeId>,... |
mod html;
use crate::style::StyleSetBuilder;
use html5ever::tendril::StrTendril;
use html5ever::{Attribute, ExpandedName, LocalName, QualName};
use std::borrow::Cow;
use std::fmt;
pub struct Document {
nodes: Vec<Node>,
style_elements: Vec<NodeId>,
}
pub struct Node {
pub(crate) parent: Option<NodeId>,... |
pub(crate) fn as_text(&self) -> Option<&StrTendril> {
match self.data {
NodeData::Text { ref contents } => Some(contents),
_ => None,
}
}
fn new(data: NodeData) -> Self {
Node {
parent: None,
previous_sibling: None,
next_... | ementData> {
match self.data {
NodeData::Element(ref data) => Some(data),
_ => None,
}
} | function_block-function_prefixed | [
{
"content": "pub fn layout(text: &str, style: &Style) -> Result<Document, FontError> {\n\n let page_size = style.page_size * Px::per_mm();\n\n let page_margin = SideOffsets::from_length_all_same(style.page_margin * Px::per_mm());\n\n let page = Rect::new(Point::origin(), page_size);\n\n let content... |
Rust | panbuild/projects.rs | louib/panbuild | 2cb07ebd6c21d7f4f0fb588cb8ed4570f20d1344 | use serde::{Deserialize, Serialize};
use std::path::Path;
use std::process::Command;
pub const CORE_PROJECTS: [&'static str; 20] = [
"https://git.savannah.gnu.org/cgit/bash.git",
"https://git.savannah.gnu.org/cgit/make.git",
"https://git.savannah.gnu.org/cgit/diffutils.git",
"https://git.savannah.gnu.... | use serde::{Deserialize, Serialize};
use std::path::Path;
use std::process::Command;
pub const CORE_PROJECTS: [&'static str; 20] = [
"https://git.savannah.gnu.org/cgit/bash.git",
"https://git.savannah.gnu.org/cgit/make.git",
"https://git.savannah.gnu.org/cgit/diffutils.git",
"https://git.savannah.gnu.... |
pub fn merge(&mut self, other_project: &SoftwareProject) {
for build_system in &other_project.build_systems {
self.build_systems.push(build_system.clone());
}
}
}
#[derive(Serialize, Deserialize, Default)]
pub struct ProjectVersion {
pub project_id: String,
pub name: ... | h crate::manifests::manifest::AbstractManifest::load_from_file(file_path.to_str().unwrap().to_string()) {
Some(m) => m,
None => continue,
};
project.build_systems.push(abstract_manifest.get_type().unwrap().to_string());
}
match crate:... | function_block-function_prefixed | [
{
"content": "pub fn normalize_name(name: &String) -> String {\n\n let mut response: String = \"\".to_string();\n\n for c in name.chars() {\n\n if c.is_alphabetic() || c.is_numeric() {\n\n response.push_str(&c.to_string());\n\n continue;\n\n }\n\n // We don't wan... |
Rust | crates/swift-bridge-ir/src/parse/parse_struct.rs | Jomy10/swift-bridge | 4a21fd134a2fd4d2418081ba962b97e6d56b155f | use crate::bridged_type::{SharedStruct, StructFields, StructSwiftRepr};
use crate::errors::{ParseError, ParseErrors};
use proc_macro2::{Ident, TokenTree};
use syn::parse::{Parse, ParseStream};
use syn::{ItemStruct, LitStr, Token};
pub(crate) struct SharedStructDeclarationParser<'a> {
pub item_struct: ItemStruct,
... | use crate::bridged_type::{SharedStruct, StructFields, StructSwiftRepr};
use crate::errors::{ParseError, ParseErrors};
use proc_macro2::{Ident, TokenTree};
use syn::parse::{Parse, ParseStream};
use syn::{ItemStruct, LitStr, Token};
pub(crate) struct SharedStructDeclarationParser<'a> {
pub item_struct: ItemStruct,
... |
#[test]
fn parses_multiple_struct_attributes() {
let tokens = quote! {
#[swift_bridge::bridge]
mod ffi {
#[swift_bridge(swift_name = "FfiFoo", swift_repr = "class")]
struct Foo {
fied: u8
}
}
... | let ty = module.types.types()[0].unwrap_shared_struct();
assert_eq!(ty.swift_name.as_ref().unwrap().value(), "FfiFoo");
} | function_block-function_prefix_line | [
{
"content": "fn swift_calls_rust_struct_with_no_fields(arg: ffi::StructWithNoFields) -> ffi::StructWithNoFields {\n\n arg\n\n}\n\n\n",
"file_path": "crates/swift-integration-tests/src/shared_types/shared_struct.rs",
"rank": 0,
"score": 256582.61491422064
},
{
"content": "fn rust_echo_mut... |
Rust | mcu/bobbin-sam/samd21/src/ext/adc.rs | thomasantony/bobbin-sdk | 37375ca40351352a029aceb8b0cf17650a3624f6 | use periph::adc::*;
use bobbin_common::bits::*;
use bobbin_hal::analog::AnalogRead;
use gclk;
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
#[repr(u8)]
pub enum Resolution {
Bits12 = 0x0,
Bits16 = 0x1,
Bits10 = 0x2,
Bits8 = 0x3,
}
impl AdcPeriph {
pub fn init(&self) {
while gclk::GCLK.stat... | use periph::adc::*;
use bobbin_common::bits::*;
use bobbin_hal::analog::AnalogRead;
use gclk;
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
#[repr(u8)]
pub enum Resolution {
Bits12 = 0x0,
Bits16 = 0x1,
Bits10 = 0x2,
Bits8 = 0x3,
}
impl AdcPeriph {
pub fn init(&self) {
while gclk::GCLK.stat... |
}
impl AdcPeriph {
pub fn wait_busy(&self) -> &Self {
while self.status().syncbusy() != ... | self.set_ctrlb(|r| r.set_prescaler(0x7).set_ressel(0x2));
self.set_sampctrl(|r| r.set_samplen(0x3f));
self.wait_busy();
self.set_inputctrl(|r| r.set_muxneg(0x18));
self.set_avgctrl(|r| r.set_samplenum(0x0).set_adjres(0x0));
... | function_block-function_prefix_line | [
{
"content": "pub fn read_peripheral<R: std::io::Read>(r: &mut EventReader<R>,\n\n attrs: &[OwnedAttribute])\n\n -> Result<Peripheral, Error> {\n\n let mut p = Peripheral::default();\n\n\n\n for a in attrs.iter() {\n\n ... |
Rust | src/validate.rs | nlehuby/transport-validator | ea4ed1efd10c7a4ae91ebff92e4114bd95db1a20 | use crate::{issues, metadatas, validators};
use serde::Serialize;
use std::collections::BTreeMap;
use std::convert::TryFrom;
use std::error::Error;
fn create_unloadable_model_error(error: gtfs_structures::Error) -> issues::Issue {
let msg = if let Some(inner) = error.source() {
format!("{}: {}", error, inn... | use crate::{issues, metadatas, validators};
use serde::Serialize;
use std::collections::BTreeMap;
use std::convert::TryFrom;
use std::error::Error;
fn create_unloadable_model_error(error: gtfs_structures::Error) -> issues::Issue {
let msg = if let Some(inner) = error.source() {
format!("{}: {}", error, inn... |
#[derive(Serialize, Debug)]
pub struct Response {
pub metadata: Option<metadatas::Metadata>,
pub validations: BTreeMap<issues::IssueType, Vec<issues::Issue>>,
}
pub fn validate_and_metadata(rgtfs: gtfs_structures::RawGtfs, max_issues: usize) -> Response {
let mut validations = BTreeMap::new();
let m... | l,
issues::IssueType::UnloadableModel,
"A fatal error has occured while loading the model, many rules have not been checked",
)
.details(&msg);
if let gtfs_structures::Error::CSVError {
file_name,
source,
line_in_error,
} = error
{
issue.related_file ... | function_block-function_prefixed | [
{
"content": "fn validate_speeds(gtfs: >fs_structures::Gtfs) -> Result<Vec<Issue>, gtfs_structures::Error> {\n\n let mut issues_by_stops_and_type = std::collections::HashMap::new();\n\n\n\n for trip in gtfs.trips.values() {\n\n let route = gtfs.get_route(&trip.route_id)?;\n\n for (departur... |
Rust | src/conversion.rs | vilaureu/kml | 6a17f7ba075e489aa6c301f9b5a3c2963e0d5b48 |
use std::convert::TryFrom;
use crate::errors::Error;
use crate::types::{
Coord, CoordType, Geometry, Kml, LineString, LinearRing, MultiGeometry, Point, Polygon,
};
#[cfg_attr(docsrs, doc(cfg(feature = "geo-types")))]
impl<T> From<geo_types::Coordinate<T>> for Coord<T>
where
T: CoordType,
{
fn from(val: ... |
use std::convert::TryFrom;
use crate::errors::Error;
use crate::types::{
Coord, CoordType, Geometry, Kml, LineString, LinearRing, MultiGeometry, Point, Polygon,
};
#[cfg_attr(docsrs, doc(cfg(feature = "geo-types")))]
impl<T> From<geo_types::Coordinate<T>> for Coord<T>
where
T: CoordType,
{
fn from(val: ... |
assert_eq!(quick_collection(Kml::KmlDocument(k)).unwrap(), gc);
}
}
| let gc = geo_types::GeometryCollection(vec![
geo_types::Geometry::Point(geo_types::Point::from((1., 1.))),
geo_types::Geometry::LineString(geo_types::LineString::from(vec![(1., 1.), (2., 2.)])),
geo_types::Geometry::Point(geo_types::Point::from((3., 3.))),
]); | assignment_statement | [
{
"content": "/// Utility method for parsing multiple coordinates according to the spec\n\n///\n\n/// # Example\n\n///\n\n/// ```\n\n/// use kml::types::{Coord, coords_from_str};\n\n///\n\n/// let coords_str = \"1,1,0\\n\\n1,2,0 2,2,0\";\n\n/// let coords: Vec<Coord> = coords_from_str(coords_str).unwrap();\n\n... |
Rust | src/search.rs | lachlan-smith/scryfall-rs | 3c7a6d9258c9ad186a772094ebe5e84275e9c688 |
use url::Url;
use crate::list::ListIter;
use crate::Card;
pub mod advanced;
pub mod param;
pub mod query;
pub trait Search {
fn write_query(&self, url: &mut Url) -> crate::Result<()>;
#[cfg(test)]
fn query_string(&self) -> crate::Result<String> {
let mut url = Url::parse("http://localhost... |
use url::Url;
use crate::list::ListIter;
use crate::Card;
pub mod advanced;
pub mod param;
pub mod query;
pub trait Search {
fn write_query(&self, url: &mut Url) -> crate::Result<()>;
#[cfg(test)]
fn query_string(&self) -> crate::Result<String> {
let mut url = Url::parse("http://localhost... |
#[test]
fn random_works_with_search_options() {
assert!(
SearchOptions::new()
.query(keyword("storm"))
.unique(UniqueStrategy::Art)
.sort(SortOrder::Usd, SortDirection::Ascending)
.extras(true)
... | e("lightning"),
name("helix"),
cmc(eq(2)),
]))
.unique(UniqueStrategy::Prints)
.search()
.unwrap()
.map(|c| c.unwrap())
.collect::<Vec<_>>();
assert!(cards.len() > 1);
for card in cards {
... | function_block-function_prefixed | [] |
Rust | python_ext/pyo3/src/resolution.rs | hoodmane/sseq | 0f19a29c95486a629b0d054c703ca0a58999ae97 | use std::sync::Arc;
use std::collections::hash_map::DefaultHasher;
use std::hash::{Hash, Hasher};
use pyo3::prelude::*;
use ext::resolution::ResolutionInner as ResolutionRust;
use ext::chain_complex::{AugmentedChainComplex, ChainComplex, FiniteChainComplex, FreeChainComplex};
use python_algebra::module::{
... | use std::sync::Arc;
use std::collections::hash_map::DefaultHasher;
use std::hash::{Hash, Hasher};
use pyo3::prelude::*;
use ext::resolution::ResolutionInner as ResolutionRust;
use ext::chain_complex::{AugmentedChainComplex, ChainComplex, FiniteChainComplex, FreeChainComplex};
use python_algebra::module::{
... | }
pub fn number_of_gens_in_bidegree(&self, homological_degree : u32, internal_degree : i32) -> PyResult<usize> {
self.check_has_computed_bidegree(homological_degree, internal_degree)?;
Ok(self.inner()?.module(homological_degree).number_of_gens_in_degree(internal_degree))
... | elf, hom_deg : u32, int_deg : i32) -> PyResult<u64> {
self.check_has_computed_bidegree(hom_deg, int_deg)?;
let self_inner = self.inner()?;
let num_gens = self_inner.number_of_gens_in_bidegree(hom_deg, int_deg);
let mut hasher = DefaultHasher::new();
hom_deg.hash(&mut hasher)... | function_block-random_span | [
{
"content": "pub fn reduce_coefficient(p : u32, c : i32) -> u32 {\n\n let p = p as i32;\n\n (((c % p) + p) % p) as u32\n\n}\n\n\n",
"file_path": "python_ext/pyo3/python_utils/src/lib.rs",
"rank": 0,
"score": 290762.9992508795
},
{
"content": "#[allow(dead_code)]\n\nfn operation_drop(a... |
Rust | lib/megstd/src/drawing/color.rs | neri/toe | 8442f82bce551ce27b23b24336a285f25d422e98 |
use core::mem::transmute;
pub trait ColorTrait: Sized + Copy + Clone + PartialEq + Eq {}
#[repr(transparent)]
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct IndexedColor(pub u8);
impl ColorTrait for IndexedColor {}
impl IndexedColor {
pub const MIN: Self = Self(u8::MIN);
pub const MAX: Self = Sel... |
use core::mem::transmute;
pub trait ColorTrait: Sized + Copy + Clone + PartialEq + Eq {}
#[repr(transparent)]
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct IndexedColor(pub u8);
impl ColorTrait for IndexedColor {}
impl IndexedColor {
pub const MIN: Self = Self(u8::MIN);
pub const MAX: Self = Sel... | f {
AmbiguousColor::Indexed(v) => v.as_true_color(),
AmbiguousColor::Argb32(v) => *v,
}
}
}
impl Into<IndexedColor> for AmbiguousColor {
fn into(self) -> IndexedColor {
match self {
AmbiguousColor::Indexed(v) => v,
AmbiguousColor::Argb32(v) => v.i... | rom_rgb(0xFFFFFF);
#[inline]
pub const fn from_rgb(rgb: u32) -> Self {
Self {
argb: rgb | 0xFF000000,
}
}
#[inline]
pub const fn from_argb(argb: u32) -> Self {
Self { argb }
}
#[inline]
pub const fn gray(white: u8, alpha: u8) -> Self {
Self ... | random | [] |
Rust | src/vcs.rs | kascote/rpure | 7b12608ad46d2d81ead01abc2655153b431c1d09 | use git2::{Repository, Status};
use std::env;
use std::path::Path;
#[derive(Debug)]
pub enum VcsDirty {
WTmodified,
IDmodified,
Green,
}
#[derive(Debug)]
pub struct VcsStatus {
pub name: String,
pub dirty: String,
pub dirty_status: VcsDirty,
pub ahead: usize,
pub behind: usize,
pub... | use git2::{Repository, Status};
use std::env;
use std::path::Path;
#[derive(Debug)]
pub enum VcsDirty {
WTmodified,
IDmodified,
Green,
}
#[derive(Debug)]
pub struct VcsStatus {
pub name: String,
pub dirty: String,
pub dirty_status: VcsDirty,
pub ahead: usize,
pub behind: usize,
pub... | (ahead, behind)
},
Err(_) => (0, 0)
};
return Some(status);
}
fn get_repo_name(repo: &Repository) -> String {
let head = match repo.head() {
Ok(r) => r,
Err(_) => return String::from(""),
};
if head.is_branch() {
return head.shorthand().unwrap_or("... | turn Some((0, 0));
}
let head_name = head.shorthand()?;
let head_branch = (repo.find_branch(head_name, git2::BranchType::Local).ok())?;
let upstream = match head_branch.upstream() {
Ok(u) => u,
Err(_) => {
return Some((0, 0))
}
};
let head_oid = head.ta... | function_block-random_span | [
{
"content": "pub fn get_name() -> String {\n\n match env::var(\"VIRTUAL_ENV\") {\n\n Ok(venv_path) => {\n\n let venv_name = Path::new(&venv_path[..]).file_name();\n\n if let Some(name) = venv_name {\n\n if let Some(valid_name) = name.to_str() {\n\n ... |
Rust | utils/indigo-service-uploader/rust/src/sd_import/sd_import.rs | tsingdao-Tp/Indigo | b2d73faebb6a450e9b3d34fed553fad4f9d0012f | extern crate postgres;
extern crate time;
extern crate num_cpus;
extern crate threadpool;
extern crate flate2;
extern crate yaml_rust;
extern crate postgres_binary_copy;
extern crate rustc_serialize;
mod sd_batch_uploader;
mod sd_parser;
use postgres::{Connection, SslMode, ConnectParams, ConnectTarget, UserInfo};
use... | extern crate postgres;
extern crate time;
extern crate num_cpus;
extern crate threadpool;
extern crate flate2;
extern crate yaml_rust;
extern crate postgres_binary_copy;
extern crate rustc_serialize;
mod sd_batch_uploader;
mod sd_parser;
use postgres::{Connection, SslMode, ConnectParams, ConnectTarget, UserInfo};
use... |
}
sd_reader.join().unwrap();
let end_t = PreciseTime::now();
let timer_ms = start_t.to(end_t).num_milliseconds() as f32 ;
let timer_s = timer_ms / 1000f32;
println!("Insert total time = {} ms ", timer_ms as i32);
println!("Average insert time = {} structures p... | match status {
1u8 => {
let sd_item: SdItem = map_rec.recv().unwrap();
sd_uploader.upload(sd_item);
str_count += 1;
}
_ => break,
} | if_condition | [
{
"content": "fn import(file_name: &str, table_name: &str, config_name: Option<String>) {\n\n let conf_name = config_name.unwrap_or(\"config.yml\".to_string());\n\n let mut sd_import = SdImport::new(&conf_name);\n\n sd_import.insert(file_name, table_name);\n\n}\n\n\n",
"file_path": "utils/indigo-se... |
Rust | app/gui/src/ide/integration/file_system.rs | enso-org/enso | 2676aa50a3cc86a1c0673a3e60a553134e350b1b |
use crate::prelude::*;
use crate::controller::graph::NewNodeInfo;
use crate::controller::upload::pick_non_colliding_name;
use engine_protocol::language_server;
use engine_protocol::language_server::ContentRoot;
use engine_protocol::language_server::FileSystemObject;
use enso_frp as frp;
use ensogl_component::file_b... |
use crate::prelude::*;
use crate::controller::graph::NewNodeInfo;
use crate::controller::upload::pick_non_colliding_name;
use engine_protocol::language_server;
use engine_protocol::language_server::ContentRoot;
use engine_protocol::language_server::FileSystemObject;
use enso_frp as frp;
use ensogl_component::file_b... |
pub async fn get_entries_list(&self) -> Result<Vec<Entry>, RpcError> {
let response = self.connection.file_list(&self.path).await?;
let entries = response.paths.into_iter().map(|fs_obj| match fs_obj {
FileSystemObject::Directory { name, path }
| FileSystemObject::Direc... | pub fn sub_view(&self, sub_dir: impl Str) -> DirectoryView {
DirectoryView {
connection: self.connection.clone_ref(),
content_root: self.content_root.clone_ref(),
path: Rc::new(self.path.append_im(sub_dir)),
}
} | function_block-full_function | [
{
"content": "/// Return FRP endpoints for the parameters that define a shadow.\n\npub fn frp_from_style(style: &StyleWatchFrp, path: impl Into<style::Path>) -> ParametersFrp {\n\n let path: style::Path = path.into();\n\n ParametersFrp {\n\n base_color: style.get_color(&path),\n\n fading: ... |
Rust | hsp3-analyzer-mini/ham-core/src/assists/completion.rs | vain0x/hsp3-ginger | c5924b60686d4bf1769569c013c8110f7636732c | use super::*;
use crate::{
analysis::{HspSymbolKind, LocalScope, Scope, SymbolRc},
assists::from_document_position,
lang_service::docs::Docs,
parse::{p_param_ty::PParamCategory, PToken},
source::*,
token::TokenKind,
};
use lsp_types::{CompletionItem, CompletionItemKind, CompletionList, Documenta... | use super::*;
use crate::{
analysis::{HspSymbolKind, LocalScope, Scope, SymbolRc},
assists::from_document_position,
lang_service::docs::Docs,
parse::{p_param_ty::PParamCategory, PToken},
source::*,
token::TokenKind,
};
use lsp_types::{CompletionItem, CompletionItemKind, CompletionList, Documenta... |
items.swap_remove(i);
}
{
let mut set = HashSet::new();
let retain = items
.iter()
.map(|item| set.insert(item.label.as_str()))
.collect::<Vec<_>>();
let mut i = 0;
items.retain(|_| {
i += 1;
retain[i - 1]... | lete_completion_list() -> CompletionList {
CompletionList {
is_incomplete: true,
items: vec![],
}
}
fn do_completion(
uri: &Url,
position: Position,
docs: &Docs,
wa: &mut WorkspaceAnalysis,
) -> Option<CompletionList> {
let mut items = vec![];
let (doc, pos) = from_docu... | random | [
{
"content": "fn add_symbol(kind: HspSymbolKind, name: &PToken, def_site: bool, ctx: &mut Ctx) {\n\n let NameScopeNsTriple {\n\n basename,\n\n scope_opt,\n\n ns_opt,\n\n } = resolve_name_scope_ns_for_def(\n\n &name.body.text,\n\n ImportMode::Local,\n\n &ctx.scope,... |
Rust | muse/src/instrument.rs | khonsulabs/muse | 26aadbc56b3c2029b5d1740da7aa3f9873cfd66d | use crate::{
envelope::PlayingState,
manager::{Device, PlayingHandle},
node::{Instantiatable, LoadedInstrument},
note::Note,
sampler::PreparedSampler,
};
use crossbeam::atomic::AtomicCell;
use std::{
sync::{Arc, RwLock},
time::Duration,
};
#[cfg(feature = "serialization")]
pub mod serializa... | use crate::{
envelope::PlayingState,
manager::{Device, PlayingHandle},
node::{Instantiatable, LoadedInstrument},
note::Note,
sampler::PreparedSampler,
};
use crossbeam::atomic::AtomicCell;
use std::{
sync::{Arc, RwLock},
time::Duration,
};
#[cfg(feature = "serialization")]
pub mod serializa... | self.playing_notes.retain(|pn| pn.note.step() as u8 != step);
}
}
pub fn set_sustain(&mut self, active: bool) {
self.sustain = active;
if !active {
self.playing_notes.retain(|n| n.is_playing());
}
}
}
| self.controller.control_handles.stop()
}
fn sustain(&self) {
self.controller.control_handles.sustain()
}
}
impl<T> Drop for PlayingNote<T> {
fn drop(&mut self) {
self.stop();
let handle = std::mem::take(&mut self.handle);
let control_handles = std::mem::take(&mut se... | random | [
{
"content": "/// A mapping from a Rust type to its Muse [`Type`].\n\npub trait CustomType: Send + Sync + Debug + 'static {\n\n /// Returns the Muse type for this Rust type.\n\n fn muse_type(&self) -> &TypeRef;\n\n}\n\n\n",
"file_path": "src/runtime/value.rs",
"rank": 0,
"score": 193705.002593... |
Rust | gf256-macros/src/rs.rs | geky/gf256 | 57675335061b18e3614376981482fd7584454fd5 |
extern crate proc_macro;
use darling;
use darling::FromMeta;
use syn;
use syn::parse_macro_input;
use proc_macro2::*;
use std::collections::HashMap;
use quote::quote;
use std::iter::FromIterator;
use crate::common::*;
const RS_TEMPLATE: &'static str = include_str!("../templates/rs.rs");
#[derive(Debug, FromMeta)]
... |
extern crate proc_macro;
use darling;
use darling::FromMeta;
use syn;
use syn::parse_macro_input;
use proc_macro2::*;
use std::collections::HashMap;
use quote::quote;
use std::iter::FromIterator;
use crate::common::*;
const RS_TEMPLATE: &'static str = include_str!("../templates/rs.rs");
#[derive(Debug, FromMeta)]
... | r().into();
}
};
let output = quote! {
#(#attrs)* #vis mod #rs {
#template
}
#(#overrides)*
};
output.into()
}
| use #u as #__u;
})
}
None => {
overrides.push(quote! {
use u8 as #__u;
});
}
}
let replacements = HashMap::from_iter([
... | function_block-random_span | [
{
"content": "/// Generate `n` shares requiring `k` shares to reconstruct.\n\n///\n\n/// This scheme is limited to to the number of shares <= the number of\n\n/// non-zero elements in the field.\n\n///\n\npub fn generate(secret: &[__u], n: usize, k: usize) -> Vec<Vec<__u>> {\n\n // we only support up to 255 ... |
Rust | src/cli/collections.rs | RekhaDS/couchbase-shell | 81bdfd4a8e62bdb477857d31f7704d07d1f35da6 | use crate::cli::util::{cluster_identifiers_from, validate_is_not_cloud};
use crate::client::ManagementRequest;
use crate::state::State;
use async_trait::async_trait;
use log::debug;
use nu_engine::CommandArgs;
use nu_errors::ShellError;
use nu_protocol::{Signature, SyntaxShape, TaggedDictBuilder, UntaggedValue, Value};... | use crate::cli::util::{cluster_identifiers_from, validate_is_not_cloud};
use crate::client::ManagementRequest;
use crate::state::State;
use async_trait::async_trait;
use log::debug;
use nu_engine::CommandArgs;
use nu_errors::ShellError;
use nu_protocol::{Signature, SyntaxShape, TaggedDictBuilder, UntaggedValue, Value};... |
fn usage(&self) -> &str {
"Fetches collections through the HTTP API"
}
fn run(&self, args: CommandArgs) -> Result<OutputStream, ShellError> {
collections_get(self.state.clone(), args)
}
}
fn collections_get(
state: Arc<Mutex<State>>,
args: CommandArgs,
) -> Result<OutputStrea... | xShape::String, "the name of the scope", None)
.named(
"clusters",
SyntaxShape::String,
"the clusters to query against",
None,
)
} | function_block-function_prefixed | [
{
"content": "pub fn signature_dict(signature: Signature, tag: impl Into<Tag>) -> Value {\n\n let tag = tag.into();\n\n let mut sig = TaggedListBuilder::new(&tag);\n\n\n\n for arg in signature.positional.iter() {\n\n let is_required = matches!(arg.0, PositionalType::Mandatory(_, _));\n\n\n\n ... |
Rust | c-uint256-tests/src/bindings.rs | jjyr/godwoken-scripts | d983fb351410eb6fbe02bb298af909193aeb5f22 | /* automatically generated by rust-bindgen 0.59.2 */
pub const true_: u32 = 1;
pub const false_: u32 = 0;
pub const INT8_MIN: i32 = -128;
pub const INT16_MIN: i32 = -32768;
pub const INT32_MIN: i32 = -2147483648;
pub const INT64_MIN: i64 = -9223372036854775808;
pub const INT8_MAX: u32 = 127;
pub const INT16_MAX: u32 =... | /* automatically generated by rust-bindgen 0.59.2 */
pub const true_: u32 = 1;
pub const false_: u32 = 0;
pub const INT8_MIN: i32 = -128;
pub const INT16_MIN: i32 = -32768;
pub const INT32_MIN: i32 = -2147483648;
pub const INT64_MIN: i64 = -9223372036854775808;
pub const INT8_MAX: u32 = 127;
pub const INT16_MAX: u32 =... | t uint256_t {
pub array: [u32; 8usize],
}
#[test]
fn bindgen_test_layout_uint256_t() {
assert_eq!(
::std::mem::size_of::<uint256_t>(),
32usize,
concat!("Size of: ", stringify!(uint256_t))
);
assert_eq!(
::std::mem::align_of::<uint256_t>(),
4usize,
concat!(... | c_char) -> ::std::os::raw::c_ulong;
}
extern "C" {
pub fn strcmp(
l: *const ::std::os::raw::c_char,
r: *const ::std::os::raw::c_char,
) -> ::std::os::raw::c_int;
}
extern "C" {
pub fn malloc(size: ::std::os::raw::c_ulong) -> *mut ::std::os::raw::c_void;
}
extern "C" {
pub fn free(ptr: *m... | random | [
{
"content": "pub fn since_timestamp(t: u64) -> Uint64 {\n\n let input_timestamp = Duration::from_millis(t).as_secs() + 1;\n\n (SINCE_BLOCK_TIMESTAMP_FLAG | input_timestamp).pack()\n\n}\n\n\n",
"file_path": "tests/src/script_tests/utils/layer1.rs",
"rank": 0,
"score": 195985.14016819192
},
... |
Rust | src/message_decoder/mod.rs | silathdiir/pg_wire | f106d57abfd501e4f1a1f7f8c20418e2998c2be0 |
use crate::{
cursor::Cursor,
message_decoder::state::{Payload, Tag},
messages::FrontendMessage,
Result,
};
use state::State;
use std::mem::MaybeUninit;
mod state;
#[derive(Debug, PartialEq)]
pub enum Status {
Requesting(usize),
Decoding,
Done(FrontendMessage),
}
pub ... |
use crate::{
cursor::Cursor,
message_decoder::state::{Payload, Tag},
messages::FrontendMessage,
Result,
};
use state::State;
use std::mem::MaybeUninit;
mod state;
#[derive(Debug, PartialEq)]
pub enum Status {
Requesting(usize),
Decoding,
Done(FrontendMessage),
}
pub ... |
}
| r
.next_stage(Some(QUERY_BYTES))
.expect("proceed to the next stage");
decoder.next_stage(None).expect("proceed to the next stage");
assert_eq!(decoder.next_stage(None), Ok(Status::Requesting(1)));
} | function_block-function_prefixed | [
{
"content": "fn decode_execute(mut cursor: Cursor) -> Result<FrontendMessage> {\n\n let portal_name = cursor.read_cstr()?.to_owned();\n\n let max_rows = cursor.read_i32()?;\n\n Ok(FrontendMessage::Execute { portal_name, max_rows })\n\n}\n\n\n",
"file_path": "src/messages.rs",
"rank": 0,
"s... |
Rust | migrate/src/lib.rs | alekspickle/migrate | c0a95c0b81315e8588c58688bdb775b7dcf997d9 |
#![warn(missing_docs, unreachable_pub, rust_2018_idioms)]
#![forbid(unsafe_code)]
mod cli;
mod error;
pub use error::*;
pub use migrate_core as core;
use crate::core::MigrationRunMode;
use error::{DynError, Error};
use migrate_core::{MigrationsSelection, PlanBuilder};
use structopt::StructOpt;
#[cfg(doctest)]
do... |
#![warn(missing_docs, unreachable_pub, rust_2018_idioms)]
#![forbid(unsafe_code)]
mod cli;
mod error;
pub use error::*;
pub use migrate_core as core;
use crate::core::MigrationRunMode;
use error::{DynError, Error};
use migrate_core::{MigrationsSelection, PlanBuilder};
use structopt::StructOpt;
#[cfg(doctest)]
do... |
}
| pub async fn run(self, plan_builder: PlanBuilder) -> Result<(), Error> {
let (cli::PlanArgGroup { no_commit, no_run }, plan) = match self.0 {
cli::Args::Up(cmd) => {
let plan = plan_builder
.build(&MigrationsSelection::Up {
inclusive_bound:... | function_block-full_function | [] |
Rust | wasm/lib/src/browser_module.rs | alexpantyukhin/RustPython | b0ee1947c775145db055413dce217dca1613712d | use crate::{convert, vm_class::AccessibleVM, wasm_builtins::window};
use futures::{future, Future};
use js_sys::Promise;
use num_traits::cast::ToPrimitive;
use rustpython_vm::obj::{objint, objstr};
use rustpython_vm::pyobject::{PyContext, PyFuncArgs, PyObjectRef, PyResult, TypeProtocol};
use rustpython_vm::VirtualMachi... | use crate::{convert, vm_class::AccessibleVM, wasm_builtins::window};
use futures::{future, Future};
use js_sys::Promise;
use num_traits::cast::ToPrimitive;
use rustpython_vm::obj::{objint, objstr};
use rustpython_vm::pyobject::{PyContext, PyFuncArgs, PyObjectRef, PyResult, TypeProtocol};
use rustpython_vm::VirtualMachi... | ;
let result = match result.expect("prompt() not to fail") {
Some(result) => vm.new_str(result),
None => vm.get_none(),
};
Ok(result)
}
const BROWSER_NAME: &str = "browser";
pub fn mk_module(ctx: &PyContext) -> PyObjectRef {
py_module!(ctx, BROWSER_NAME, {
"fetch" => ctx.new_... | if let Some(default) = default {
window().prompt_with_message_and_default(
&objstr::get_value(message),
&objstr::get_value(default),
)
} else {
window().prompt_with_message(&objstr::get_value(message))
} | if_condition | [
{
"content": "fn str_str(vm: &mut VirtualMachine, args: PyFuncArgs) -> PyResult {\n\n arg_check!(vm, args, required = [(s, Some(vm.ctx.str_type()))]);\n\n Ok(s.clone())\n\n}\n\n\n",
"file_path": "vm/src/obj/objstr.rs",
"rank": 0,
"score": 466286.87047549686
},
{
"content": "pub fn subs... |
Rust | src/serializer.rs | aep/korhal-image | 6aa0cce631efe530d5f94a1b893c0efdc7712fec | use blockstore::{Block, BlockStore, BlockShard};
use chunker::*;
use index::*;
use pbr::ProgressBar;
use readchain::{Take,Chain};
use serde::{Serialize, Deserialize};
use std::ffi::OsString;
use std::io::{Stdout, Seek, SeekFrom, BufReader};
use std::path::Path;
use std::fs::File;
use elfkit;
use sha2::{Sha256, Digest}... | use blockstore::{Block, BlockStore, BlockShard};
use chunker::*;
use index::*;
use pbr::ProgressBar;
use readchain::{Take,Chain};
use serde::{Serialize, Deserialize};
use std::ffi::OsString;
use std::io::{Stdout, Seek, SeekFrom, BufReader};
use std::path::Path;
use std::fs::File;
use elfkit;
use sha2::{Sha256, Digest}... | fn print_progress_bar(bar: &mut ProgressBar<Stdout>, path: &OsString){
let s = path.to_str().unwrap();
if s.len() > 50 {
bar.message(&format!("indexing ..{:48} ", &s[s.len()-48..]));
} else {
bar.message(&format!("indexing {:50} ", &s));
}
} | function_block-full_function | [
{
"content": "pub fn new(path: String) -> BlockStore {\n\n let mut bs = BlockStore{\n\n path: path,\n\n blocks: HashMap::new(),\n\n };\n\n bs.load();\n\n bs\n\n}\n\n\n\n\n\nimpl BlockStore {\n\n pub fn get<'a>(&'a self, hash: &Vec<u8>) -> Option<&'a Block> {\n\n self.blocks.g... | |
Rust | crates/category/tests/product_bug.rs | Nertsal/categories | 3fd0a8b4f5c9a3df78c35126bb4af3a9ed10bae3 | use category::{axioms, Bindings};
use category::{prelude::*, Equality};
use std::fmt::Debug;
#[test]
fn test_bug() {
let rule_product = axioms::rule_product::<&str>().unwrap();
let mut category = Category::new();
let object_a = category.new_object(Object {
tags: vec![],
inner: ... | use category::{axioms, Bindings};
use category::{prelude::*, Equality};
use std::fmt::Debug;
#[test]
fn test_bug() {
let rule_product = axioms::rule_product::<&str>().unwrap();
let mut category = Category::new();
let object_a = category.new_object(Object {
tags: vec![],
inner: ... | for (id, morphism) in category.morphisms.iter() {
println!("{:4} - {:?}", id.raw(), morphism)
}
println!("Equalities:");
for (equality, inner) in category.equalities.iter() {
println!(
" {:?} = {:?}: {inner:?}",
equality.left(),
equality.right()
)... | function_block-function_prefix_line | [
{
"content": "fn print_category<O: Debug, M: Debug, E: Debug>(category: &Category<O, M, E>) {\n\n println!(\"\\n----- Category -----\");\n\n println!(\"Objects:\");\n\n for (id, object) in category.objects.iter() {\n\n println!(\"{:4} - {:?}\", id.raw(), object)\n\n }\n\n println!(\"Morphi... | |
Rust | db/src/impls/rangestore/kvdb.rs | shogochiai/plasma-rust-framework | e72cb12d80d3e3ab080746f9fb0576a242e9d194 | use crate::error::{Error, ErrorKind};
use crate::range::Range;
use crate::traits::db::DatabaseTrait;
use crate::traits::rangestore::RangeStore;
use kvdb::{DBTransaction, KeyValueDB};
use kvdb_memorydb::{create, InMemory};
pub struct RangeDb {
db: InMemory,
col: u32,
}
impl DatabaseTrait for RangeDb {
fn o... | use crate::error::{Error, ErrorKind};
use crate::range::Range;
use crate::traits::db::DatabaseTrait;
use crate::traits::rangestore::RangeStore;
use kvdb::{DBTransaction, KeyValueDB};
use kvdb_memorydb::{create, InMemory};
pub struct RangeDb {
db: InMemory,
col: u32,
}
impl DatabaseTrait for RangeDb {
fn o... | Dammy))
}
}
pub fn put_batch(&self, ranges: &[Range]) -> Result<(), Error> {
let mut tr = DBTransaction::new();
for range in ranges.iter() {
let query = range.get_end().to_be_bytes();
tr.put(Some(self.col), &query, &rlp::encode(range));
}
self.db.w... | u64) -> Result<Box<[Range]>, Error> {
let ranges = self.get(start, end)?;
let mut tr = DBTransaction::new();
for range in ranges.clone().iter() {
let query = range.get_end().to_be_bytes();
tr.delete(Some(self.col), &query);
}
self.db.write(tr)?;
i... | function_block-random_span | [
{
"content": "fn create_object_id(start: u64, end: u64) -> Vec<u8> {\n\n let mut object_id_buf = BytesMut::with_capacity(64);\n\n object_id_buf.put_u64_le(start);\n\n object_id_buf.put_u64_le(end);\n\n object_id_buf.to_vec()\n\n}\n\n*/\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub struct StateObj... |
Rust | crates/m-mazing-tile-util/src/main.rs | tmfink/m-mazing | e603dd081f56b897d49014dc45078db1ba9ec19b | use std::{fs::File, io::Read, path::PathBuf, sync::mpsc};
use anyhow::{Context, Result};
use clap::Parser;
use m_mazing_core::bevy;
use m_mazing_core::prelude::*;
use notify::Watcher;
use bevy::asset::AssetServerSettings;
use bevy::ecs as bevy_ecs;
use bevy::prelude::*;
use bevy::render::camera::ScalingMode;
mod g... | use std::{fs::File, io::Read, path::PathBuf, sync::mpsc};
use anyhow::{Context, Result};
use clap::Parser;
use m_mazing_core::bevy;
use m_mazing_core::prelude::*;
use notify::Watcher;
use bevy::asset::AssetServerSettings;
use bevy::ecs as bevy_ecs;
use bevy::prelude::*;
use bevy::render::camera::ScalingMode;
mod g... |
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, SystemLabel)]
enum MySystemLabels {
Input,
SpawnTile,
}
fn frame_init(mut refresh: ResMut<RefreshTile>) {
refresh.0 = false;
}
#[allow(unused)]
fn debug_system(query: Query<Entity>) {
info!("entities: {}", query.iter().count());
}
fn main() -> Resul... | TextStyle {
font: font.clone(),
font_size: 50.0,
color: Color::BLACK,
},
Default::default(),
),
... | function_block-function_prefix_line | [
{
"content": "pub fn notify_tileset_change(mut should_refresh: ResMut<RefreshTile>, mut ctx: NonSendMut<Ctx>) {\n\n match ctx.notify_rx.try_recv() {\n\n Ok(Ok(event)) => {\n\n info!(\"new event {:?}\", event);\n\n should_refresh.0 = true;\n\n\n\n match ctx.refresh() {\... |
Rust | common/machine.rs | camas/aoc2019 | 53b41dcf9990c9a4e460197b5e5031ec2158b453 | use crate::common::get_digits;
use num_derive::FromPrimitive;
use num_traits::FromPrimitive;
use std::collections::HashMap;
use std::ops::Range;
use Instr::*;
const MEM_CHUNK_SIZE: usize = 1000;
pub struct Machine {
memory: Memory,
ip: usize,
rel_base: usize,
}
impl Machine {
pub fn new(mem: &[i64])... | use crate::common::get_digits;
use num_derive::FromPrimitive;
use num_traits::FromPrimitive;
use std::collections::HashMap;
use std::ops::Range;
use Instr::*;
const MEM_CHUNK_SIZE: usize = 1000;
pub struct Machine {
memory: Memory,
ip: usize,
rel_base: usize,
}
impl Machine {
|
pub fn run(&mut self, input: impl FnMut() -> i64, output: impl FnMut(i64)) {
self.run_until(Instr::Halt, input, output);
}
#[allow(clippy::cognitive_complexity)]
pub fn run_until(
&mut self,
halt_instr: Instr,
mut input: impl FnMut() -> i64,
mut outpu... | pub fn new(mem: &[i64]) -> Machine {
Machine {
memory: Memory::from(&mem),
ip: 0,
rel_base: 0,
}
} | function_block-full_function | [] |
Rust | tests/admin_general.rs | gearbot/Gearbot-Animal-API | e103efc146324d411e641938617fc9eba69b5447 |
use animal_api::*;
use animal_facts::*;
mod generator;
use crate::generator::*;
use actix_web::web::{self, Bytes, Data};
use actix_web::{test, App};
#[actix_rt::test]
async fn no_admins_loaded() {
let dir = make_dir();
let mut state = gen_state(&dir);
state.config.admins = Vec::new();
let req_json = ... |
use animal_api::*;
use animal_facts::*;
mod generator;
use crate::generator::*;
use actix_web::web::{self, Bytes, Data};
use actix_web::{test, App};
#[actix_rt::test]
async fn no_admins_loaded() {
let dir = make_dir();
let mut state = gen_state(&dir);
state.config.admins = Vec::new();
let req_json = ... |
#[actix_rt::test]
async fn list_facts() {
let dir = make_dir();
let uri = "/admin/fact/list";
let state = gen_state(&dir);
let req_json = AdminFactRequest {
fact_id: None,
fact_content: None,
animal_type: Animal::Cat,
key: gen_admin_all_perms().key,
};
let raw ... | ke_dir();
let mut state = gen_state(&dir);
state.fact_lists.dog_facts = None;
let req_json = AdminFactRequest {
fact_id: Some(6682463169732688062),
fact_content: None,
animal_type: Animal::Dog,
key: state.config.admins[4].key.clone(),
};
assert_eq!(
... | function_block-function_prefixed | [
{
"content": "pub fn get_cat_fact(app_data: Data<APIState>) -> HttpResponse {\n\n if let Some(fact_list) = &app_data.fact_lists.cat_facts {\n\n let mut rng = thread_rng();\n\n let list_lock = fact_list.read().unwrap();\n\n\n\n // This should never panic since `Some()` means there is >= 1... |
Rust | examples/bank-emulator/integration-tests/src/fees.rs | m10io/sdk | 62f773304da0567986d5fc33c282649238c9f5c2 | use m10_bank_emulator::models::*;
use rust_decimal::Decimal;
use super::base_url;
use super::utils::*;
#[tokio::test]
async fn fees_routes() {
let jwt = default_user_jwt().await;
let client = reqwest::Client::default();
let tr_fees = FeeMetadata {
schedule: FeeSchedule {
fees: vec![
... | use m10_bank_emulator::models::*;
use rust_decimal::Decimal;
use super::base_url;
use super::utils::*;
#[tokio::test]
async fn fees_routes() {
let jwt = default_user_jwt().await;
let client = reqwest::Client::default();
let tr_fees = FeeMetadata {
schedule: FeeSchedule {
fees: vec![
... | t
.expect("get withdraw fee amount response")
.assert_json::<FeeResponse>()
.await;
assert_eq!(63, resp.fees[0].amount);
client
.get(format!("{}/api/v1/fees/ttt/deposit/60600", base_url()))
.bearer_auth(&jwt)
.send()
.await
.expect("get ... | function_block-function_prefixed | [
{
"content": "fn with_additional_protos(mut protos: Vec<String>, additional_paths: &[&str]) -> Vec<String> {\n\n for path in additional_paths {\n\n protos.push(proto_path(path).display().to_string());\n\n }\n\n protos\n\n}\n",
"file_path": "rust/protos/build.rs",
"rank": 0,
"score": ... | |
Rust | src/bin/mpc.rs | ys-nuem/rust-gurobi-example | a94bf00d1452a4753c0dc0fd6ea83d67fb0d735f | #![allow(non_snake_case)]
#![allow(dead_code)]
extern crate gurobi;
#[macro_use]
extern crate itertools;
use gurobi::*;
use itertools::*;
struct MPCModel(gurobi::Model);
impl std::ops::Deref for MPCModel {
type Target = gurobi::Model;
fn deref(&self) -> &gurobi::Model {
&self.0
}
}
impl std::ops::DerefMut... | #![allow(non_snake_case)]
#![allow(dead_code)]
extern crate gurobi;
#[macro_use]
extern crate itertools;
use gurobi::*;
use itertools::*;
struct MPCModel(gurobi::Model);
impl std::ops::Deref for MPCModel {
type Target = gurobi::Model;
fn deref(&self) -> &gurobi::Model {
&self.0
}
}
impl std::ops::DerefMut... | ;
input.push(u);
}
let u_t = input.last().cloned().unwrap();
let x_t = 0.99 * x_t + u_t + 0.01;
state.push(x_t);
}
println!("input = {:?}", input);
}
| match sol.status {
Status::Optimal => *sol.u.get(0).unwrap(),
_ => {
println!("step {}: cannot retrieve an optimal MIP solution", t);
0.0
}
} | if_condition | [
{
"content": "# rust-gurobi-example",
"file_path": "README.md",
"rank": 0,
"score": 2911.5059799016285
}
] |
Rust | nft_api/src/ingest/main.rs | jarry-xiao/merkle-wallet | 079c4c7b51ee9f90ad98c13a660ff97727db7127 | extern crate core;
use hyper::{Body, Client, Request, Response, Server, StatusCode};
use futures_util::future::join3;
use redis::streams::{StreamId, StreamKey, StreamReadOptions, StreamReadReply};
use redis::{Commands, Value};
use routerify::prelude::*;
use routerify::{Middleware, Router, RouterService};
use anchor_... | extern crate core;
use hyper::{Body, Client, Request, Response, Server, StatusCode};
use futures_util::future::join3;
use redis::streams::{StreamId, StreamKey, StreamReadOptions, StreamReadReply};
use redis::{Commands, Value};
use routerify::prelude::*;
use routerify::{Middleware, Router, RouterService};
use anchor_... | let mut conn = conn_res.unwrap();
let streams = vec!["GM_CL", "GMC_OP"];
let group_name = "ingester";
for key in &streams {
let created: Result<(), _> = conn.xgroup_create_mkstream(*key, group_name, "$");
if let Err(e) = created {
println!("Group already exists: {:?}", e)
... | await;
if f.is_err() {
println!("Error {:?}", f.err().unwrap());
}
i += 1;
}
match txn.commit().await {
Ok(_r) => {
println!("Sa... | random | [
{
"content": "/// Recomputes root of the Merkle tree from Node & proof\n\npub fn recompute(mut leaf: Node, proof: &[Node], index: u32) -> Node {\n\n for (i, s) in proof.iter().enumerate() {\n\n if index >> i & 1 == 0 {\n\n let res = hashv(&[&leaf, s.as_ref()]);\n\n leaf.copy_from... |
Rust | tapdance-rust-logic/src/util.rs | refraction-networking/tapdance | 39262efa194b520f3187ad98cab8efb953eccf39 | extern crate libc;
use std::fs::File;
use std::io::prelude::*;
use std::io::BufReader;
use mio::Ready;
use mio::unix::UnixReady;
use pnet::packet::Packet;
use pnet::packet::tcp::{TcpOptionNumbers, TcpPacket};
pub fn all_unix_events() -> UnixReady
{
UnixReady::from(Ready::readable() | Ready::writable()) |
Uni... | extern crate libc;
use std::fs::File;
use std::io::prelude::*;
use std::io::BufReader;
use mio::Ready;
use mio::unix::UnixReady;
use pnet::packet::Packet;
use pnet::packet::tcp::{TcpOptionNumbers, TcpPacket};
pub fn all_unix_events() -> UnixReady
{
UnixReady::from(Ready::readable() | Ready::writable()) |
Uni... |
pub fn mem_used_kb() -> u64
{
let my_pid: i32 = unsafe { libc::getpid() };
let f = match File::open(format!("/proc/{}/status", my_pid)) {
Ok(f) => f,
Err(e) => {
error!("Failed to open /proc/{}/status: {:?}", my_pid, e);
return 0; }
};
let buf_f = BufReader::new... | pub fn tcp_seq_lt(a: u32, b: u32) -> bool
{
if a == b { false }
else {
let res = a < b;
if tcp_seq_is_wrapped(a, b) { !res }
else { res }
}
} | function_block-full_function | [
{
"content": "// Pass in 1st, 2nd bytes of the TL (big-endian). Returns is_proto, len.\n\n// The len returned might be 0, meaning extended TL.\n\npub fn parse_typelen(byte1: u8, byte2: u8) -> (bool, usize)\n\n{\n\n let tl = unsafe { mem::transmute::<[u8;2], i16>([byte2, byte1]) };\n\n if tl >= 0 {\n\n ... |
Rust | src/models/withdrawal.rs | nervina-labs/compact-nft-aggregator | f5d4afebd732fdcd55c7590ddfc5af0eb30b2eda | use super::helper::{parse_cota_id_and_token_index_pairs, parse_lock_hash};
use crate::models::block::get_syncer_tip_block_number;
use crate::models::helper::{generate_crc, PAGE_SIZE};
use crate::models::scripts::get_script_map_by_ids;
use crate::models::{DBResult, DBTotalResult};
use crate::schema::withdraw_cota_nft_kv... | use super::helper::{parse_cota_id_and_token_index_pairs, parse_lock_hash};
use crate::models::block::get_syncer_tip_block_number;
use crate::models::helper::{generate_crc, PAGE_SIZE};
use crate::models::scripts::get_script_map_by_ids;
use crate::models::{DBResult, DBTotalResult};
use crate::schema::withdraw_cota_nft_kv... |
fn parse_withdraw_db(withdrawals: Vec<WithdrawCotaNft>) -> DBResult<WithdrawDb> {
let block_height = get_syncer_tip_block_number()?;
if withdrawals.is_empty() {
return Ok((vec![], block_height));
}
let receiver_lock_script_ids: Vec<i64> = withdrawals
.iter()
.map(|withdrawal| w... | pub fn get_sender_lock_by_script_id(
script_id: i64,
cota_id_: [u8; 20],
token_index_: [u8; 4],
) -> Result<Option<String>, Error> {
let start_time = Local::now().timestamp_millis();
let conn = &POOL.clone().get().expect("Mysql pool connection error");
let cota_id_hex = hex::encode(cota_id_);
... | function_block-full_function | [
{
"content": "pub fn parse_cota_id_and_token_index_pairs(pairs: Vec<([u8; 20], [u8; 4])>) -> Vec<(String, u32)> {\n\n pairs\n\n .into_iter()\n\n .map(|pair| (hex::encode(pair.0), u32::from_be_bytes(pair.1)))\n\n .collect()\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\... |
Rust | src/cluster/cut.rs | FridgeSeal/blip | 0a202eb0061d8e2ac34a4bd501cfa08051cb4087 |
use super::{proto, Metadata, State};
use futures::stream::{unfold, Stream};
use rand::{thread_rng, Rng};
use std::{
collections::HashMap,
convert::TryInto,
net::SocketAddr,
ops::Index,
result,
sync::{Arc, Weak},
};
use thiserror::Error;
use tokio::sync::{
broadcast::{error::RecvError, Rece... |
use super::{proto, Metadata, State};
use futures::stream::{unfold, Stream};
use rand::{thread_rng, Rng};
use std::{
collections::HashMap,
convert::TryInto,
net::SocketAddr,
ops::Index,
result,
sync::{Arc, Weak},
};
use thiserror::Error;
use tokio::sync::{
broadcast::{error::RecvError, Rece... |
impl Member {
#[inline]
pub(crate) fn new(addr: SocketAddr, tls: Option<Arc<ClientTlsConfig>>, meta: Metadata) -> Self {
let chan = endpoint(addr, tls.as_deref())
.connect_lazy()
.unwrap();
#[rustfmt::skip]
let m = Self { addr, tls, meta, chan };
... | fn endpoint(addr: SocketAddr, tls: Option<&ClientTlsConfig>) -> transport::Endpoint {
match tls.cloned() {
Some(tls) => format!("https://{}", addr)
.try_into()
.map(|e: transport::Endpoint| e.tls_config(tls).unwrap()),
None => format!("http://{}", addr).try_into(),
}
... | function_block-full_function | [
{
"content": "type ResolvedMember = Result<Member, MemberResolutionError>;\n\n\n",
"file_path": "src/cluster/mod.rs",
"rank": 0,
"score": 134911.461126479
},
{
"content": "pub fn addr_in(subnet: u32, host: u32) -> SocketAddr {\n\n let mut addr = (subnet & 0x1fff) << 12; // 11 bits of subn... |
Rust | src/interpreter/internal.rs | wareya/gammakit | 63d217f8ebc291844b8df69db12a03b9c906bef4 | use crate::interpreter::*;
impl Interpreter
{
pub (super) fn stack_len(&mut self) -> usize
{
self.top_frame.len()
}
pub (super) fn stack_pop_val(&mut self) -> Option<Value>
{
self.top_frame.pop_val()
}
pub (super) fn stack_pop_var(&mut self) -> Option<Variable>
{
... | use crate::interpreter::*;
impl Interpreter
{
pub (super) fn stack_len(&mut self) -> usize
{
self.top_frame.len()
}
pub (super) fn stack_pop_val(&mut self) -> Option<Value>
{
self.top_frame.pop_val()
}
pub (super) fn stack_pop_var(&mut self) -> Option<Variable>
{
... | s not holding function data; {:?}", funcdata))
}
Ok(())
}
} | Ok(())
}
pub (super) fn handle_func_call_or_expr(&mut self, isexpr : bool) -> Result<(), String>
{
let argcount = self.read_usize();
if cfg!(stack_len_debugging) && argcount+1 > self.stack_len()
{
return plainerr("internal error: fewer ... | random | [
{
"content": "type CompilerBinding<'a> = fn(&mut CompilerState<'a>, &ASTNode) -> Result<(), String>;\n\n\n",
"file_path": "src/compiler.rs",
"rank": 0,
"score": 132890.84490723212
},
{
"content": "pub fn default_step_result() -> StepResult\n\n{\n\n Ok(())\n\n}\n\n/// Type signature of fun... |
Rust | src/terrain/main.rs | fkaa/gfx_examples | dea8a8393e34d011873b9f9c39f945dc6755f3e2 |
extern crate cgmath;
#[macro_use]
extern crate gfx;
extern crate gfx_window_glutin;
extern crate glutin;
extern crate time;
extern crate rand;
extern crate genmesh;
extern crate noise;
use rand::Rng;
use cgmath::FixedArray;
use cgmath::{Matrix4, Point3, Vector3};
use cgmath::{Transform, AffineMatrix3};
use gfx::trai... |
extern crate cgmath;
#[macro_use]
extern crate gfx;
extern crate gfx_window_glutin;
extern crate glutin;
extern crate time;
extern crate rand;
extern crate genmesh;
extern crate noise;
use rand::Rng;
use cgmath::FixedArray;
use cgmath::{Matrix4, Point3, Vector3};
use cgmath::{Transform, AffineMatrix3};
use gfx::trai... |
pub fn main() {
let (mut stream, mut device, mut factory) = gfx_window_glutin::init(
glutin::Window::new().unwrap());
stream.out.window.set_title("Terrain example");
let rand_seed = rand::thread_rng().gen();
let seed = Seed::new(rand_seed);
let plane = Plane::subdivide(256, 256);
let ... | calculate_color(height: f32) -> [f32; 3] {
if height > 8.0 {
[0.9, 0.9, 0.9]
} else if height > 0.0 {
[0.7, 0.7, 0.7]
} else if height > -5.0 {
[0.2, 0.7, 0.2]
} else {
[0.2, 0.2, 0.7]
}
} | function_block-function_prefixed | [
{
"content": "fn calculate_color(height: f32) -> [f32; 3] {\n\n if height > 8.0 {\n\n [0.9, 0.9, 0.9] // white\n\n } else if height > 0.0 {\n\n [0.7, 0.7, 0.7] // greay\n\n } else if height > -5.0 {\n\n [0.2, 0.7, 0.2] // green\n\n } else {\n\n [0.2, 0.2, 0.7] // blue\n\n... |
Rust | src/search/aggregations/bucket/diversified_sampler_aggregation.rs | ypenglyn/elasticsearch-dsl-rs | bff3508055fb20eb54bde78edffa69da3ccbf4eb | use crate::search::*;
use crate::util::*;
use std::convert::TryInto;
#[derive(Debug, Clone, Serialize, PartialEq)]
pub struct DiversifiedSamplerAggregation {
diversified_sampler: DiversifiedSamplerAggregationInner,
#[serde(skip_serializing_if = "ShouldSkip::should_skip")]
aggs: Aggregations,
}
#[derive(D... | use crate::search::*;
use crate::util::*;
use std::convert::TryInto;
#[derive(Debug, Clone, Serialize, PartialEq)]
pub struct DiversifiedSamplerAggregation {
diversified_sampler: DiversifiedSamplerAggregationInner,
#[serde(skip_serializing_if = "ShouldSkip::should_skip")]
aggs: Aggregations,
}
#[derive(D... |
pub fn max_docs_per_value(mut self, max_docs_per_value: impl TryInto<u64>) -> Self {
if let Ok(max_docs_per_value) = max_docs_per_value.try_into() {
self.diversified_sampler.max_docs_per_value = Some(max_docs_per_value);
}
self
}
... | f, shard_size: impl TryInto<u64>) -> Self {
if let Ok(shard_size) = shard_size.try_into() {
self.diversified_sampler.shard_size = Some(shard_size);
}
self
} | function_block-function_prefixed | [
{
"content": "#[doc(hidden)]\n\npub trait Origin: Debug + PartialEq + Serialize + Clone {\n\n type Scale: Debug + PartialEq + Serialize + Clone;\n\n type Offset: Debug + PartialEq + Serialize + Clone;\n\n}\n\n\n\nimpl Origin for DateTime<Utc> {\n\n type Scale = Time;\n\n type Offset = Time;\n\n}\n\n... |
Rust | utoipa-gen/src/schema/component/attr.rs | juhaku/utoipa | 070b00c13b41040e9605c62a0d7c3b5fcf04899c | use std::mem;
use proc_macro2::{Ident, TokenStream};
use proc_macro_error::{abort, ResultExt};
use quote::{quote, ToTokens};
use syn::{
parenthesized,
parse::{Parse, ParseBuffer},
Attribute, Error, ExprPath, Token,
};
use crate::{
parse_utils,
schema::{ComponentPart, GenericType},
AnyValue,
};... | use std::mem;
use proc_macro2::{Ident, TokenStream};
use proc_macro_error::{abort, ResultExt};
use quote::{quote, ToTokens};
use syn::{
parenthesized,
parse::{Parse, ParseBuffer},
Attribute, Error, ExprPath, Token,
};
use crate::{
parse_utils,
schema::{ComponentPart, GenericType},
AnyValue,
};... |
impl<T> ToTokens for ComponentAttr<T>
where
T: quote::ToTokens,
{
fn to_tokens(&self, tokens: &mut TokenStream) {
tokens.extend(self.inner.to_token_stream())
}
}
impl ToTokens for Enum {
fn to_tokens(&self, tokens: &mut TokenStream) {
if let Some(ref default) = self.default {
... | pub fn parse_component_attr<T: Sized + Parse>(attributes: &[Attribute]) -> Option<T> {
attributes
.iter()
.find(|attribute| attribute.path.get_ident().unwrap() == "component")
.map(|attribute| attribute.parse_args::<T>().unwrap_or_abort())
} | function_block-full_function | [] |
Rust | cosmos-abci/abci/src/lib.rs | couragetec/courage_substrate_cosmos | d9b2038436ac8933e6dadda960cd66a543c851d3 | mod defaults;
pub mod grpc;
pub mod utils;
pub use defaults::*;
pub use grpc::*;
use lazy_static::lazy_static;
use owning_ref::MutexGuardRefMut;
use std::sync::Mutex;
use mockall::automock;
lazy_static! {
static ref ABCI_INTERFACE_INSTANCE: Mutex<Option<AIType>> = Mutex::new(None);
}
type AIType = Box<dyn Abci... | mod defaults;
pub mod grpc;
pub mod utils;
pub use defaults::*;
pub use grpc::*;
use lazy_static::lazy_static;
use owning_ref::MutexGuardRefMut;
use std::sync::Mutex;
use mockall::automock;
lazy_static! {
static ref ABCI_INTERFACE_INSTANCE: Mutex<Option<AIType>> = Mutex::new(None);
}
type AIType = Box<dyn Abci... | pub fn get_abci_instance<'ret>(
) -> Result<MutexGuardRefMut<'ret, Option<AIType>, AIType>, Box<dyn std::error::Error>> {
let instance = ABCI_INTERFACE_INSTANCE.lock()?;
if instance.is_none() {
panic!("abci instance has not been set, execute set_abci_instance before calling this function");
... | function_block-full_function | [
{
"content": "/// Method for getting gRPC url form active env.\n\npub fn get_server_url() -> String {\n\n crate::utils::get_option_from_node_args(crate::utils::NodeOptionVariables::AbciServerUrl)\n\n .unwrap_or_else(|| DEFAULT_ABCI_URL.to_owned())\n\n}\n\n\n",
"file_path": "cosmos-abci/abci/src/de... | |
Rust | contracts/link-token/src/contract.rs | hackbg/chainlink-terra-cosmwasm-contracts | a1a82fa5db9942f8c8e6ec5d0b8fe7effb830f84 | use cosmwasm_std::{
to_binary, Binary, Deps, DepsMut, Env, MessageInfo, Response, StdResult, Uint128,
};
use cw20::{Cw20Coin, TokenInfoResponse};
use cw20_base::{
allowances::{
execute_decrease_allowance, execute_increase_allowance, execute_transfer_from,
query_allowance,
},
contract::{c... | use cosmwasm_std::{
to_binary, Binary, Deps, DepsMut, Env, MessageInfo, Response, StdResult, Uint128,
};
use cw20::{Cw20Coin, TokenInfoResponse};
use cw20_base::{
allowances::{
execute_decrease_allowance, execute_increase_allowance, execute_transfer_from,
query_allowance,
},
contract::{c... |
pub fn query_token_info(deps: Deps) -> StdResult<TokenInfoResponse> {
let info = TOKEN_INFO.load(deps.storage)?;
Ok(info.into())
}
#[cfg(test)]
mod tests {
use super::*;
use cosmwasm_std::testing::{mock_dependencies, mock_env, mock_info};
use cosmwasm_std::{coins, Uint128};
#[test]
fn ... | QueryMsg::TokenInfo {} => to_binary(&query_token_info(deps)?),
QueryMsg::Allowance { owner, spender } => {
to_binary(&query_allowance(deps, owner, spender)?)
}
}
} | function_block-function_prefix_line | [
{
"content": "pub fn query(deps: Deps, _env: Env, msg: QueryMsg) -> StdResult<Binary> {\n\n match msg {\n\n QueryMsg::IsValid {\n\n previous_answer,\n\n answer,\n\n } => to_binary(&is_valid(deps, previous_answer, answer)?),\n\n QueryMsg::GetFlaggingThreshold {} => t... |
Rust | merkle_tree/src/lib.rs | mikong/mori | 75879172eeb7e733c62d472bafc6c6792d3b754a | use std::mem;
use sha2::{Sha256, Digest};
use sha2::digest::generic_array::GenericArray;
use sha2::digest::generic_array::typenum::U32;
use sha2::digest::generic_array::sequence::Concat;
type HashResult = GenericArray<u8, U32>;
#[derive(Debug, PartialEq)]
pub enum Position {
Left,
Right,
}
#[derive(Debug)]
... | use std::mem;
use sha2::{Sha256, Digest};
use sha2::digest::generic_array::GenericArray;
use sha2::digest::generic_array::typenum::U32;
use sha2::digest::generic_array::sequence::Concat;
type HashResult = GenericArray<u8, U32>;
#[derive(Debug, PartialEq)]
pub enum Position {
Left,
Right,
}
#[derive(Debug)]
... | _iter.next().unwrap();
assert_eq!(pos, &Position::Right);
assert_eq!(*hash, GenericArray::clone_from_slice(&hd));
let (pos, hash) = proof_iter.next().unwrap();
assert_eq!(pos, &Position::Left);
assert_eq!(*hash, GenericArray::clone_from_slice(&hab));
let (pos, hash) = p... |
pub fn root_hash(&self) -> HashResult {
match self {
MerkleTree::NonEmpty(node) => node.element,
MerkleTree::Empty => panic!("Merkle tree can't be empty"),
}
}
pub fn validate(
target: HashResult,
proof: Vec<(Position, HashResult)>,
... | random | [
{
"content": "type NodeId = usize;\n\n\n\nimpl<K, V> Node<K, V> {\n\n pub fn new(key: K, value: V, color: Color) -> Self {\n\n Node {\n\n key,\n\n value,\n\n left: None,\n\n right: None,\n\n color,\n\n size: 1,\n\n }\n\n }\n\n... |
Rust | src/generate/generator.rs | nurmohammed840/virtue | b645e092861377a1b11b97c681de9e9acb5a0d22 | use super::{GenerateMod, Impl, ImplFor, StreamBuilder};
use crate::parse::{GenericConstraints, Generics};
use crate::prelude::{Ident, TokenStream};
#[must_use]
pub struct Generator {
pub(crate) name: Ident,
pub(crate) generics: Option<Generics>,
pub(crate) generic_constraints: Option<GenericConstraints>,
... | use super::{GenerateMod, Impl, ImplFor, StreamBuilder};
use crate::parse::{GenericConstraints, Generics};
use crate::prelude::{Ident, TokenStream};
#[must_use]
pub struct Generator {
pub(crate) name: Ident,
pub(crate) generics: Option<Generics>,
pub(crate) generic_constraints: Option<GenericConstraints>,
... |
}
}
false
}
pub fn finish(mut self) -> crate::prelude::Result<TokenStream> {
Ok(std::mem::take(&mut self.stream).stream)
}
}
impl Drop for Generator {
fn drop(&mut self) {
if !self.stream.stream.is_empty() && !std::thread::panicking() {
epr... | if let Some(parent) = path.parent() {
path = parent.to_owned();
} else {
break;
} | if_condition | [] |
Rust | src/smr/tests/proposal_test.rs | zeroqn/overlord | 4bf43c4c4e94691e54bae586a07b82e39e13622a | use crate::smr::smr_types::{Lock, SMREvent, SMRTrigger, Step, TriggerType};
use crate::smr::tests::{gen_hash, trigger_test, InnerState, StateMachineTestCase};
use crate::{error::ConsensusError, types::Hash};
#[tokio::test(threaded_scheduler)]
async fn test_proposal_trigger() {
let mut index = 1;
let mut test_c... | use crate::smr::smr_types::{Lock, SMREvent, SMRTrigger, Step, TriggerType};
use crate::smr::tests::{gen_hash, trigger_test, InnerState, StateMachineTestCase};
use crate::{error::ConsensusError, types::Hash};
#[tokio::test(threaded_scheduler)]
async fn test_proposal_trigger() {
let mut index = 1;
let mut test_c... | ash = gen_hash();
let lock = Lock::new(1, lock_hash.clone());
test_cases.push(StateMachineTestCase::new(
InnerState::new(2, Step::Propose, lock_hash.clone(), Some(lock)),
SMRTrigger::new(lock_hash.clone(), TriggerType::Proposal, Some(1), 0),
SMREvent::PrevoteVote {
height: ... | voteVote {
height: 0u64,
round: 2u64,
block_hash: lock_hash.clone(),
lock_round: Some(1),
},
None,
Some((1, lock_hash)),
));
let hash = gen_hash();
let lock_hash = gen_hash();
let lock = Lock::new(... | random | [
{
"content": "fn gen_hash() -> Hash {\n\n Hash::from((0..16).map(|_| random::<u8>()).collect::<Vec<_>>())\n\n}\n",
"file_path": "tests/test_utils.rs",
"rank": 0,
"score": 137237.66059652547
},
{
"content": "fn gen_hash() -> Hash {\n\n Hash::from((0..16).map(|_| random::<u8>()).collect:... |
Rust | tracing-journald/tests/journal.rs | jswrenn/tracing | 388fff8371fef1ec0f75bc495fe1ad4cfa045f7b | #![cfg(target_os = "linux")]
use std::collections::HashMap;
use std::process::Command;
use std::time::Duration;
use serde::Deserialize;
use tracing::{debug, error, info, info_span, warn};
use tracing_journald::Subscriber;
use tracing_subscriber::subscribe::CollectExt;
use tracing_subscriber::Registry;
fn journalctl_... | #![cfg(target_os = "linux")]
use std::collections::HashMap;
use std::process::Command;
use std::time::Duration;
use serde::Deserialize;
use tracing::{debug, error, info, info_span, warn};
use tracing_journald::Subscriber;
use tracing_subscriber::subscribe::CollectExt;
use tracing_subscriber::Registry;
fn journalctl_... | ) {
with_journald(|| {
error!(
test.name = "multiline_message_trailing_newline",
"A trailing newline\n"
);
let message = retry_read_one_line_from_journal("multiline_message_trailing_newline");
assert_eq!(message["MESSAGE"], "A trailing newline\n");
as... | }
}
}
impl PartialEq<&str> for Field {
fn eq(&self, other: &&str) -> bool {
match self {
Field::Text(s) => s == other,
Field::Binary(_) => false,
Field::Array(_) => false,
}
}
}
impl PartialEq<[u8]> for Field {
fn eq(&self, other: &[u8]) -> bool {... | random | [
{
"content": "#[allow(clippy::manual_async_fn)]\n\n#[instrument(level = \"debug\")]\n\nfn instrumented_manual_async() -> impl Future<Output = ()> {\n\n async move {}\n\n}\n\n\n",
"file_path": "tracing/test_static_max_level_features/tests/test.rs",
"rank": 1,
"score": 282858.3962827644
},
{
... |
Rust | src/bin/day24/main.rs | MattiasBuelens/advent-of-code-2019 | 01a88977bc7b6471bdc84aebd41e1e8d3920946d | use std::collections::{HashMap, HashSet};
fn main() {
let grid: Grid = Grid::parse(include_str!("input"));
println!("Answer to part 1: {}", part1(grid.clone()));
println!("Answer to part 2: {}", part2(grid.clone()));
}
#[derive(Debug, Eq, PartialEq, Copy, Clone)]
enum Tile {
EMPTY,
BUG,
}
impl Ti... | use std::collections::{HashMap, HashSet};
fn main() {
let grid: Grid = Grid::parse(include_str!("input"));
println!("Answer to part 1: {}", part1(grid.clone()));
println!("Answer to part 2: {}", part2(grid.clone()));
}
#[derive(Debug, Eq, PartialEq, Copy, Clone)]
enum Tile {
EMPTY,
BUG,
}
impl Ti... | _key(&level) {
let new_grid = new_grids.entry(level).or_insert(Default::default());
new_grid.tiles[y][x] = new_tile;
}
}
}
}
self.grids = new_grids;
}
fn count_bugs(&self) -> usize {
self.gri... | y + 1 < SIZE {
neighbours.push(self.tiles[y + 1][x]);
}
neighbours
}
fn step(&mut self) {
let mut new_tiles: [[Tile; SIZE]; SIZE] = Default::default();
for y in 0..SIZE {
for x in 0..SIZE {
let neighbour_bugs = self
.ge... | random | [
{
"content": "pub fn parse_list<T, E>(input: &str, separator: char) -> Vec<T>\n\nwhere\n\n T: FromStr<Err = E>,\n\n E: Debug,\n\n{\n\n return input\n\n .trim()\n\n .split(separator)\n\n .map(|x| x.parse().expect(\"invalid input\"))\n\n .collect();\n\n}\n",
"file_path": "... |
Rust | src/decode.rs | 12101111/6502 | b333d946539f04fee8680f5b1b73de40c1102b3c | use super::address::AM::{self, *};
#[derive(Debug, Clone, Copy)]
#[allow(non_camel_case_types)]
pub enum OP {
LDA,
LDX,
LDY,
STA,
STX,
STY,
TAX,
TAY,
TXA,
TYA,
TSX,
TXS,
PHA,
PHP... | use super::address::AM::{self, *};
#[derive(Debug, Clone, Copy)]
#[allow(non_camel_case_types)]
pub enum OP {
LDA,
LDX,
LDY,
STA,
STX,
STY,
TAX,
TAY,
TXA,
TYA,
TSX,
TXS,
PHA,
PHP... | ),(STA, ZPX, 4),(STX, ZPY, 4),(SAX, ZPY, 4),
/*0x98*/(TYA, IMP, 2),(STA, ABY, 5),(TXS, IMP, 2),(TAS, ABY, 5),(SHY, ABX, 5),(STA, ABX, 5),(SHX, ABY, 5),(AHX, ABY, 5),
/*0xA0*/(LDY, IMM, 2),(LDA, ZIX, 6),(LDX, IMM, 2),(LAX, ZIX, 6),(LDY, ZPG, 3),(LDA, ZPG, 3),(LDX, ZPG, 3),(LAX, ZPG, 3),
/*0xA8*/(TAY, IMP, 2),(LDA, IMM, ... | 8),(BIT, ZPG, 3),(AND, ZPG, 3),(ROL, ZPG, 5),(RLA, ZPG, 5),
/*0x28*/(PLP, IMP, 4),(AND, IMM, 2),(ROL, ACC, 2),(ANC, IMM, 2),(BIT, ABS, 4),(AND, ABS, 4),(ROL, ABS, 6),(RLA, ABS, 6),
/*0x30*/(BMI, REL, 2),(AND, ZIY, 5),(STP, NON, 2),(RLA, ZIY, 8),(NOP, ZPX, 4),(AND, ZPX, 4),(ROL, ZPX, 6),(RLA, ZPX, 6),
/*0x38*/(SEC, IMP... | random | [
{
"content": "pub trait Memory {\n\n fn reset(&mut self);\n\n fn loadb(&mut self, addr: u16) -> u8;\n\n fn try_loadb(&self, addr: u16) -> Option<u8>;\n\n fn storeb(&mut self, addr: u16, val: u8);\n\n fn add_cycles(&mut self, val: usize);\n\n fn get_cycles(&self) -> usize;\n\n}\n\n\n\npub struc... |
Rust | src/day14/data/mod.rs | Fryuni/advent-of-code-2021 | 832121aba87516b4c2727eee9869348e1a5a7840 | /*
* MIT License
*
* Copyright (c) 2021 Luiz Ferraz
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modi... | /*
* MIT License
*
* Copyright (c) 2021 Luiz Ferraz
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modi... |
}
#[derive(Debug)]
pub struct Data {
pub template: Polymer,
pub rules: PolymerizationRules,
}
impl Debug for Polymer {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
f.write_str("Polymer(")?;
for c in &self.0 {
f.write_char(*c)?;
}
f.write_str(")")
... | pub fn into_element_counters(self) -> HashMap<char, usize> {
let mut counters: HashMap<char, usize> = HashMap::new();
for ((a, _), count) in self.0 {
counters.entry(a).or_default().add_assign(count);
}
counters
} | function_block-function_prefix_line | [
{
"content": "fn iter_matrix() -> impl Iterator<Item = (usize, usize)> {\n\n (0..10).cartesian_product(0..10)\n\n}\n\n\n\nimpl State {\n\n const FLASHED: usize = 20;\n\n\n\n pub fn advance_state(&mut self) -> usize {\n\n // println!(\"Initial state:\\n{:?}\", self);\n\n\n\n // Advance all... |
Rust | crates/melody_cli/src/main.rs | ikroeber/melody | 693832f659482d100000da84d6fc55b8ff43dd07 | pub mod consts;
pub mod macros;
pub mod output;
pub mod utils;
use clap::Parser;
use consts::COMMAND_MARKER;
use melody_compiler::{compiler, ParseError};
use output::{
print_output, print_output_pretty, print_repl_welcome, print_source_line, prompt, report_clear,
report_exit, report_missing_path, report_no_lin... | pub mod consts;
pub mod macros;
pub mod output;
pub mod utils;
use clap::Parser;
use consts::COMMAND_MARKER;
use melody_compiler::{compiler, ParseError};
use output::{
print_output, print_output_pretty, print_repl_welcome, print_source_line, prompt, report_clear,
report_exit, report_missing_path, report_no_lin... |
redo_lines.clear();
let output = raw_output.unwrap();
print_output_pretty(format!("{output}\n"))
}
}
| if let Err(error) = raw_output {
let ParseError {
token,
line: _,
line_index: _,
} = error;
report_repl_parse_error(token);
valid_lines.pop();
continue 'repl;
} | if_condition | [] |
Rust | crates/wasm-bindgen-cli-support/src/lib.rs | lukewagner/wasm-bindgen | 7384bd1967e325101b09234753598122c71eaefe | #[macro_use]
extern crate failure;
extern crate parity_wasm;
extern crate wasm_bindgen_shared as shared;
extern crate serde_json;
extern crate wasm_gc;
use std::fs::File;
use std::io::Write;
use std::path::{Path, PathBuf};
use failure::Error;
use parity_wasm::elements::*;
mod js;
pub mod wasm2es6js;
pub struct Bind... | #[macro_use]
extern crate failure;
extern crate parity_wasm;
extern crate wasm_bindgen_shared as shared;
extern crate serde_json;
extern crate wasm_gc;
use std::fs::File;
use std::io::Write;
use std::path::{Path, PathBuf};
use failure::Error;
use parity_wasm::elements::*;
mod js;
pub mod wasm2es6js;
pub struct Bind... | ts,
imported_structs,
custom_type_names,
} = p;
ret.structs.extend(structs);
ret.free_functions.extend(free_functions);
ret.imports.extend(imports);
ret.imported_structs.extend(imported_structs);
if custom_type_names... | tom_type_names: Vec::new(),
};
let data = match data {
Some(data) => data,
None => return ret,
};
for i in (0..data.entries().len()).rev() {
{
let value = data.entries()[i].value();
if !value.starts_with(b"wbg:") {
continue
}
... | function_block-random_span | [
{
"content": "fn bindgen_imported_struct(import: &ast::ImportStruct, tokens: &mut Tokens) {\n\n let name = import.name;\n\n\n\n let mut methods = Tokens::new();\n\n\n\n for &(_is_method, ref f) in import.functions.iter() {\n\n let import_name = shared::mangled_import_name(\n\n Some(&i... |
Rust | blocky-net/src/chat/component.rs | JAD3N/minecraft | cfa74fa48ca9c1399eb02cd11332f86121e7bd85 | use super::{Style, TextComponent, TranslatableComponent, TranslatableComponentArg};
use crate::{AsJson, FromJson};
use thiserror::Error;
#[derive(Error, Debug)]
pub enum ComponentError {
#[error("failed to parse json")]
Parse,
}
pub trait ComponentClone {
fn clone_box(&self) -> Box<dyn Component>;
}
pub ... | use super::{Style, TextComponent, TranslatableComponent, TranslatableComponentArg};
use crate::{AsJson, FromJson};
use thiserror::Error;
#[derive(Error, Debug)]
pub enum ComponentError {
#[error("failed to parse json")]
Parse,
}
pub trait ComponentClone {
fn clone_box(&self) -> Box<dyn Component>;
}
pub ... |
}
#[macro_export]
macro_rules! component {
($svis:vis struct $name:ident { $($fvis:vis $fname:ident: $fty:ty),* $(,)? }) => {
#[derive(Clone)]
$svis struct $name {
siblings: Vec<Box<dyn Component>>,
style: Style,
$($fvis $fname: $fty),*
}
impl $... | fn from_json(value: &serde_json::Value) -> Result<Self, Self::Err> {
if value.is_string() {
Ok(Box::new(TextComponent::new(value.as_str().unwrap())))
} else if value.is_object() {
let obj = value.as_object().unwrap();
let mut c: Box<dyn Component> = if let Some(text) ... | function_block-function_prefix_line | [
{
"content": "pub trait FromJson {\n\n type Err;\n\n fn from_json(value: &serde_json::Value) -> Result<Self, Self::Err> where Self: Sized;\n\n}\n",
"file_path": "blocky-net/src/lib.rs",
"rank": 2,
"score": 121584.79989159183
},
{
"content": "pub trait AsJson {\n\n fn as_json(&self) ... |
Rust | src/plugins.rs | ivmarkov/edge-frame | c3c8c270189d5f497180774c138de0717d919bb5 | use std::collections;
use enumset::*;
use yew::prelude::Html;
use yew::prelude::Properties;
use embedded_svc::edge_config::role::Role;
use crate::lambda::Lambda;
#[derive(EnumSetType, Debug, PartialOrd)]
#[cfg_attr(feature = "std", derive(Hash))]
pub enum InsertionPoint {
Drawer,
Appbar,
}
#[derive(EnumSe... | use std::collections;
use enumset::*;
use yew::prelude::Html;
use yew::prelude::Properties;
use embedded_svc::edge_config::role::Role;
use crate::lambda::Lambda;
#[derive(EnumSetType, Debug, PartialOrd)]
#[cfg_attr(feature = "std", derive(Hash))]
pub enum InsertionPoint {
Drawer,
Appbar,
}
#[derive(EnumSe... |
}
#[derive(PartialEq, Clone, Debug)]
pub struct ContentPlugin<R>
where
R: PartialEq + Clone,
{
pub component: Lambda<PluginProps<R>, Html>,
pub api_uri_prefix: String,
}
impl<R> ContentPlugin<R>
where
R: PartialEq + Clone,
{
pub fn map<F, RAPP>(&self, mapper: F) -> ContentPlugin<RAPP>
where
... | pub fn map<F, RAPP>(&self, mapper: F) -> NavigationPlugin<RAPP>
where
F: Fn(&RAPP) -> R + 'static,
RAPP: PartialEq + Clone,
R: 'static,
{
NavigationPlugin {
category: self.category,
insertion_point: self.insertion_point,
component: map(&self.co... | function_block-full_function | [
{
"content": "pub fn with_path_segment(uri: &str, segment: &str) -> Result<String> {\n\n let mut url = url::Url::parse(uri)?;\n\n\n\n {\n\n let mut segments = url\n\n .path_segments_mut()\n\n .map_err(|_| anyhow!(\"url cannot be used as a base\"))?;\n\n segments.push(se... |
Rust | src/didcomm/mod.rs | chriamue/identity-cloud-agent | 810d4498b26547b28e474cdaf5d44c2481d32109 | use crate::connection::{invitation::Invitation, Connections, Termination, TerminationResponse};
use crate::credential::{issue::Issuance, Credentials};
use crate::message::MessageRequest;
use crate::ping::{PingRequest, PingResponse};
use crate::webhook::Webhook;
use async_trait::async_trait;
use reqwest::RequestBuilder;... | use crate::connection::{invitation::Invitation, Connections, Termination, TerminationResponse};
use crate::credential::{issue::Issuance, Credentials};
use crate::message::MessageRequest;
use crate::ping::{PingRequest, PingResponse};
use crate::webhook::Webhook;
use async_trait::async_trait;
use reqwest::RequestBuilder;... |
}
| let ping_request: PingRequest = PingRequest {
type_: "https://didcomm.org/trust-ping/2.0/ping".to_string(),
id: "foo".to_string(),
from: "bar".to_string(),
body,
};
let ping_request: String = serde_json::to_string(&ping_request).unwrap();
let resp... | function_block-function_prefix_line | [
{
"content": "#[async_trait]\n\npub trait Webhook: Send + Sync {\n\n fn request(&self, topic: &str, body: &Value) -> RequestBuilder;\n\n async fn post(&self, topic: &str, body: &Value) -> Result<reqwest::Response, reqwest::Error>;\n\n}\n",
"file_path": "src/webhook/mod.rs",
"rank": 0,
"score":... |
Rust | src/kernel/x86/x86avxbitreversal.rs | yvt/yfft-rs | 2ba9934e9a3213a528e7ba4573fe08b96609d20b | use super::super::Num;
use super::utils::{if_compatible, AlignInfo, AlignReqKernel, AlignReqKernelWrapper};
use super::{Kernel, KernelParams, SliceAccessor};
use packed_simd::{u32x4, u64x2, u64x4};
use std::{mem, ptr};
pub unsafe fn new_x86_avx_bit_reversal_kernel<T>(indices: &Vec<usize>) -> Option<Box<Kernel<T>>>
w... | use super::super::Num;
use super::utils::{if_compatible, AlignInfo, AlignReqKernel, AlignReqKernelWrapper};
use super::{Kernel, KernelParams, SliceAccessor};
use packed_simd::{u32x4, u64x2, u64x4};
use std::{mem, ptr};
pub unsafe fn new_x86_avx_bit_reversal_kernel<T>(indices: &Vec<usize>) -> Option<Box<Kernel<T>>>
w... |
#[derive(Debug)]
struct AvxDWordBitReversalKernel {
indices: Vec<usize>,
}
impl<T: Num> AlignReqKernel<T> for AvxDWordBitReversalKernel {
fn transform<I: AlignInfo>(&self, params: &mut KernelParams<T>) {
assert_eq!(mem::size_of::<T>(), 4);
let indices = unsafe { SliceAccessor::new(&self.indi... | WordBitReversalKernel {
indices: indices.clone(),
})) as Box<Kernel<f32>>,
)
})
} | function_block-function_prefixed | [
{
"content": "pub trait Num:\n\n Clone\n\n + Debug\n\n + AddAssign\n\n + SubAssign\n\n + MulAssign\n\n + DivAssign\n\n + Default\n\n + num_traits::Float\n\n + num_traits::FloatConst\n\n + num_traits::Zero\n\n + 'static\n\n + Sync\n\n + Send\n\n{\n\n}\n\nimpl<T> Num for T w... |
Rust | client/src/renderer/glium/traits.rs | BonsaiDen/shooter-rs | 0ce5d02065be9ded30e29fdf133ad7a615f29323 |
use glium::{glutin, DisplayBuild, Surface};
use shared::Lithium::{
Client, ClientHandler, EntityState, EntityRegistry, Event, BaseLevel, Renderer
};
use super::GliumRenderer;
impl Renderer for GliumRenderer {
fn run<
H: ClientHandler<Self, G, L, E, S>,
E: Event,
S: EntityState,
... |
use glium::{glutin, DisplayBuild, Surface};
use shared::Lithium::{
Client, ClientHandler, EntityState, EntityRegistry, Event, BaseLevel, Renderer
};
use super::GliumRenderer;
impl Renderer for GliumRenderer {
fn run<
H: ClientHandler<Self, G, L, E, S>,
E: Event,
S: EntityState,
... |
fn time(&self) -> f64 {
self.time
}
fn set_time(&mut self, time: f64) {
self.time = time;
}
fn delta_time(&self) -> f32{
self.dt
}
fn set_delta_time(&mut self, dt: f32) {
self.dt = dt;
}
fn delta_u(&self) -> f32 {
self.u
}
f... | while renderer.running() {
if renderer.should_draw() {
let frame_time = renderer.time();
let tick_rate = renderer.tick_rate();
if frames_per_tick == 0 {
if client.tick(&mut renderer) {
frames_per_tick = renderer.f... | function_block-function_prefix_line | [
{
"content": "fn run() {\n\n\n\n let args = clap::App::new(\"shooter-client\")\n\n .version(&crate_version!())\n\n .author(\"Ivo Wetzel <ivo.wetzel@googlemail.com>\")\n\n .about(\"Shooter-Client\")\n\n .arg(clap::Arg::with_name(\"address:port\")\n\n .help(\"Remote serve... |
Rust | jissen/2nd/code4/src/main.rs | Hota822/Rust | 05a7756cfec474052161b3886b035a326a58f49a | fn main() {
f4_2();
f4_3();
}
fn f4_3() {
let t1 = (88, true);
assert_eq!(t1.0, 88);
let mut t2 = (88, true);
t2.1 = false;
assert_eq!(t2.1, false);
let (n1, b1) = t2;
println!("({}, {})", n1, b1);
let ((_, _), (n2, _)) = ((1, 2), (3, 4));
println!("{}", n2);
let m... | fn main() {
f4_2();
f4_3();
}
fn f4_3() {
let t1 = (88, true);
assert_eq!(t1.0, 88);
let mut t2 = (88, true);
t2.1 = false;
assert_eq!(t2.1, false);
let (n1, b1) = t2;
println!("({}, {})", n1, b1);
let ((_, _), (n2, _)) = ((1, 2), (3, 4));
println!("{}", n2);
let m... |
let s1 = "a";
let s2 = "あ";
let s3 = "😀";
println!("{}, {}, {}", s1.len(), s2.len(), s3.len());
let s = "abcあいう";
assert_eq!(s.get(0..1), Some("a"));
assert_eq!(s.get(3..6), Some("あ"));
assert_eq!(s.get(3..5), None);
assert_eq!(s.get(3..=6), None );
let s = "かか\u{3099}く";
... | if let Some(apples) = apple_line {
assert!(apples.starts_with("red"));
assert!(apples.contains("apple"));
println!("{:?}", apples.find("green"));
let mut apple_iter = apples.split(",");
assert_eq!(apple_iter.next(), Some("red apple"));
let green = apple_iter.next... | if_condition | [
{
"content": "fn print_info(name: &str, sl: &[char]) {\n\n println!(\" {:9} - {}, {:?}, {:?}, {:?}\",\n\n name,\n\n sl.len(),\n\n sl.first(),\n\n sl.get(1),\n\n sl.last()\n\n );\n\n}\n\n\n",
"file_path": "jissen/1st/code4/src/main.rs",
"rank": 0,
"score": 41... |
Rust | src/lt.rs | Others/fountain_codes | 798ea7240b1714958a5cf7e5af0f0c2048ce011e | use std::cmp;
use std::collections::{HashMap, HashSet};
use std::fmt::{self, Debug, Formatter};
use std::hash::{Hash, Hasher};
use std::io::{self, Cursor};
use std::ops::{BitXor, BitXorAssign, Index};
use byteorder::{BigEndian, ReadBytesExt, WriteBytesExt};
use super::{Client, CreationError, Data, Decoder, Encoder, M... | use std::cmp;
use std::collections::{HashMap, HashSet};
use std::fmt::{self, Debug, Formatter};
use std::hash::{Hash, Hasher};
use std::io::{self, Cursor};
use std::ops::{BitXor, BitXorAssign, Index};
use byteorder::{BigEndian, ReadBytesExt, WriteBytesExt};
use super::{Client, CreationError, Data, Decoder, Encoder, M... |
impl Encoder<LtPacket> for LtSource {
fn create_packet(&self) -> LtPacket {
let block_count = self.blocks.len();
let mut blocks: Vec<u32> = Vec::with_capacity(block_count);
for i in 0..block_count{
blocks.push(i as u32);
}
choose_blocks_to_combine(&self.distri... | r i in 0..blocks_to_combine {
let j = distribution.query_interior_rng_usize(i, blocks.len());
blocks.swap(i, j);
}
blocks.truncate(blocks_to_combine as usize);
} | function_block-function_prefixed | [
{
"content": "pub trait Source<P: Packet> : Encoder<P> + Sized {\n\n fn new(metadata: Metadata, data: Data) -> Result<Self, CreationError>;\n\n}\n\n\n",
"file_path": "src/lib.rs",
"rank": 2,
"score": 67255.24559277261
},
{
"content": "pub trait Decoder<P: Packet> {\n\n fn receive_packe... |
Rust | src/xcb/xconn.rs | psychon/penrose | 69912708f7982b7d6a61b9fa549040fb4c3625fb | /*!
* API wrapper for talking to the X server using XCB
*
* The crate used by penrose for talking to the X server is rust-xcb, which
* is a set of bindings for the C level XCB library that are autogenerated
* from an XML spec. The XML files can be found
* [here](https://github.com/rtbo/rust-xcb/tree/master/x... | /*!
* API wrapper for talking to the X server using XCB
*
* The crate used by penrose for talking to the X server is rust-xcb, which
* is a set of bindings for the C level XCB library that are autogenerated
* from an XML spec. The XML files can be found
* [here](https://github.com/rtbo/rust-xcb/tree/master/x... |
fn update_known_clients(&self, clients: &[WinId]) {
self.api.replace_prop(
self.api.root(),
Atom::NetClientList,
PropVal::Window(clients),
);
self.api.replace_prop(
self.api.root(),
Atom::NetClientListStacking,
PropVal... | t = self.api.root();
self.api.replace_prop(
root,
Atom::NetNumberOfDesktops,
PropVal::Cardinal(&[workspaces.len() as u32]),
);
self.api.replace_prop(
root,
Atom::NetDesktopNames,
PropVal::Str(&workspaces.join("\0")),
... | function_block-function_prefixed | [
{
"content": "fn process_property_notify(id: WinId, atom: String, is_root: bool) -> Vec<EventAction> {\n\n match Atom::from_str(&atom) {\n\n Ok(a) if [Atom::WmName, Atom::NetWmName].contains(&a) => {\n\n vec![EventAction::ClientNameChanged(id, is_root)]\n\n }\n\n _ => vec![Eve... |
Rust | src/fcfg1/config_if_adc.rs | luojia65/cc2640r2f | 03a5bfca3e739dbb8310e2b0dabb07a8ca572fe5 | #[doc = r" Value read from the register"]
pub struct R {
bits: u32,
}
#[doc = r" Value to write to the register"]
pub struct W {
bits: u32,
}
impl super::CONFIG_IF_ADC {
#[doc = r" Modifies the contents of the register"]
#[inline]
pub fn modify<F>(&self, f: F)
where
for<'w> F: FnOnce(&R,... | #[doc = r" Value read from the register"]
pub struct R {
bits: u32,
}
#[doc = r" Value to write to the register"]
pub struct W {
bits: u32,
}
impl super::CONFIG_IF_ADC {
#[doc = r" Modifies the contents of the register"]
#[inline]
pub fn modify<F>(&self, f: F)
where
for<'w> F: FnOnce(&R,... |
INT3ADJR { bits }
}
#[doc = "Bits 16:19 - 19:16\\] Internal. Only to be used through TI provided API."]
#[inline]
pub fn ff1adj(&self) -> FF1ADJR {
let bits = {
const MASK: u8 = 15;
const OFFSET: u8 = 16;
((self.bits >> OFFSET) & MASK as u32) as u8
... | let bits = {
const MASK: u8 = 15;
const OFFSET: u8 = 20;
((self.bits >> OFFSET) & MASK as u32) as u8
}; | assignment_statement | [
{
"content": "fn main() {\n\n if env::var_os(\"CARGO_FEATURE_RT\").is_some() {\n\n let out = &PathBuf::from(env::var_os(\"OUT_DIR\").unwrap());\n\n File::create(out.join(\"device.x\"))\n\n .unwrap()\n\n .write_all(include_bytes!(\"device.x\"))\n\n .unwrap();\n\n... |
Rust | rust/xaynet-server/src/storage/s3.rs | abargiela/xaynet | 2c87c5fd3f02f68dc9aefaaeb3a0371afa005722 | use crate::settings::{S3BucketsSettings, S3Settings};
use rusoto_core::{credential::StaticProvider, request::TlsError, HttpClient, RusotoError};
use rusoto_s3::{
CreateBucketError,
CreateBucketOutput,
CreateBucketRequest,
DeleteObjectsError,
ListObjectsV2Error,
PutObjectError,
PutObjectOutpu... | use crate::settings::{S3BucketsSettings, S3Settings};
use rusoto_core::{credential::StaticProvider, request::TlsError, HttpClient, RusotoError};
use rusoto_s3::{
CreateBucketError,
CreateBucketOutput,
CreateBucketRequest,
DeleteObjectsError,
ListObjectsV2Error,
PutObjectError,
PutObjectOutpu... | ifiers: Vec<ObjectIdentifier>,
) -> Result<DeleteObjectsOutput, RusotoError<DeleteObjectsError>> {
let req = DeleteObjectsRequest {
bucket: bucket.to_string(),
delete: Delete {
objects: identifiers,
..Default::default()
... | ccess_key);
let dispatcher = HttpClient::new()?;
Ok(Self {
buckets: Arc::new(settings.buckets),
s3_client: S3Client::new_with(dispatcher, credentials_provider, settings.region),
})
}
pub async fn upload_global_model(&self, key: &str, global_model: &Model) -... | random | [
{
"content": "fn error_code_type_error(response: &Value) -> RedisError {\n\n redis_type_error(\n\n \"Response status not valid integer\",\n\n Some(format!(\"Response was {:?}\", response)),\n\n )\n\n}\n\n\n\n/// Implements ['FromRedisValue'] and ['ToRedisArgs'] for types that implement ['Byt... |
Rust | src/agent/onefuzz-agent/src/local/tui.rs | henryzz0/onefuzz | cb0701b2f2daf5b7b6d71bec9acd8dc0e329e1c3 |
use crate::local::common::UiEvent;
use anyhow::{Context, Result};
use crossterm::{
event::{self, Event, KeyCode},
execute,
terminal::{disable_raw_mode, enable_raw_mode, EnterAlternateScreen, LeaveAlternateScreen},
};
use futures::{StreamExt, TryStreamExt};
use log::Level;
use onefuzz::utils::try_wait_all_... |
use crate::local::common::UiEvent;
use anyhow::{Context, Result};
use crossterm::{
event::{self, Event, KeyCode},
execute,
terminal::{disable_raw_mode, enable_raw_mode, EnterAlternateScreen, LeaveAlternateScreen},
};
use futures::{StreamExt, TryStreamExt};
use log::Level;
use onefuzz::utils::try_wait_all_... |
async fn ticking(ui_event_tx: mpsc::UnboundedSender<TerminalEvent>) -> Result<()> {
let mut interval = tokio::time::interval(TICK_RATE);
loop {
interval.tick().await;
if let Err(_err) = ui_event_tx.send(TerminalEvent::Tick) {
break;
}
}
... | pub async fn run(self, timeout: Option<Duration>) -> Result<()> {
enable_raw_mode()?;
let mut stdout = io::stdout();
execute!(stdout, EnterAlternateScreen)?;
let backend = CrosstermBackend::new(stdout);
let mut terminal = Terminal::new(backend)?;
terminal.clear()?;
... | function_block-full_function | [
{
"content": "pub fn digest_file_blocking(file: impl AsRef<Path>) -> Result<String> {\n\n let file = file.as_ref();\n\n let data = std::fs::read(file)\n\n .with_context(|| format!(\"unable to read file to generate digest: {}\", file.display()))?;\n\n Ok(hex::encode(Sha256::digest(&data)))\n\n}\n... |
Rust | tests/auth_test.rs | andygrove/rust-etcd | c1e51b3dff285ab62fd4424b3d4607b33721f774 | use etcd::auth::{self, AuthChange, NewUser, Role, RoleUpdate, UserUpdate};
use etcd::{BasicAuth, Client};
use futures::future::Future;
use tokio::runtime::Runtime;
#[test]
fn auth() {
let client = Client::new(&["http://etcd:2379"], None).unwrap();
let client_2 = client.clone();
let client_3 = client.clone(... | use etcd::auth::{self, AuthChange, NewUser, Role, RoleUpdate, UserUpdate};
use etcd::{BasicAuth, Client};
use futures::future::Future;
use tokio::runtime::Runtime;
#[test]
fn auth() {
let client = Client::new(&["http://etcd:2379"], None).unwrap();
let client_2 = client.clone();
let client_3 = client.clone(... | let role_name = &rkt_user.role_names()[0];
assert_eq!(role_name, "rkt");
let mut update_rkt_user = UserUpdate::new("rkt");
update_rkt_user.update_password("secret2");
update_rkt_user.grant_role("root");
auth::update_user(&authed_client_... | function_block-function_prefix_line | [] | |
Rust | src/bulk_string/mod.rs | WatchDG/rust-resp-protocol | b36689915d7fd3456a80165297a14d9e1a1257b6 | use crate::RespError;
use bytes::{BufMut, Bytes, BytesMut};
pub const EMPTY_BULK_STRING: BulkString = BulkString(Bytes::from_static(b"$0\r\n\r\n"));
pub const NULL_BULK_STRING: BulkString = BulkString(Bytes::from_static(b"$-1\r\n"));
#[derive(Debug, Clone, PartialEq)]
pub struct BulkString(Bytes);
impl BulkString {
... | use crate::RespError;
use bytes::{BufMut, Bytes, BytesMut};
pub const EMPTY_BULK_STRING: BulkString = BulkString(Bytes::from_static(b"$0\r\n\r\n"));
pub const NULL_BULK_STRING: BulkString = BulkString(Bytes::from_static(b"$-1\r\n"));
#[derive(Debug, Clone, PartialEq)]
pub struct BulkString(Bytes);
impl BulkString {
... |
}
impl<'a> PartialEq<BulkString> for &'a BulkString {
fn eq(&self, other: &BulkString) -> bool {
self.0 == other.bytes()
}
fn ne(&self, other: &BulkString) -> bool {
self.0 != other.bytes()
}
}
#[cfg(test)]
mod tests_bulk_string {
use crate::{BulkString, EMPTY_BULK_STRING, NULL_BU... | pub fn parse(input: &[u8], start: &mut usize, end: &usize) -> Result<Self, RespError> {
let mut index = *start;
Self::while_valid(input, &mut index, end)?;
let value = Self::from_slice(&input[*start..index]);
*start = index;
Ok(value)
} | function_block-full_function | [
{
"content": " #[inline]\n\n pub fn from_bytes(input: Bytes) -> Self {\n\n Self(input)\n\n }\n\n\n\n #[inline]\n\n pub fn from_slice(input: &[u8]) -> Self {\n\n let bytes = Bytes::copy_from_slice(input);\n\n Self::from_bytes(bytes)\n\n }\n\n\n\n #[inline]\n\n pub uns... |
Rust | src/lib.rs | niuhuan/pixirust | 8eeeebaf4e9cb9e7351a6f625c247375d8396644 | pub mod entities;
mod test;
mod utils;
pub use anyhow::Error;
pub use anyhow::Result;
pub use entities::*;
use serde_json::json;
use utils::*;
const APP_SERVER: &'static str = "app-api.pixiv.net";
const APP_SERVER_IP: &'static str = "210.140.131.199";
const OAUTH_SERVER: &'static str = "oauth.secure.pixiv.net";
const... | pub mod entities;
mod test;
mod utils;
pub use anyhow::Error;
pub use anyhow::Result;
pub use entities::*;
use serde_json::json;
use utils::*;
const APP_SERVER: &'static str = "app-api.pixiv.net";
const APP_SERVER_IP: &'static str = "210.140.131.199";
const OAUTH_SERVER: &'static str = "oauth.secure.pixiv.net";
const... | /{}", APP.server).as_str()) {
self.agent
.get(url.replacen(APP.server, APP.ip.clone(), 1))
.header("Host", APP.server)
} else {
self.agent.get(url)
}
}
false => self.agent.get(... | erde_json::from_str(resp.text().await?.as_str())?),
_ => {
let err: LoginErrorResponse =
serde_json::from_str(resp.text().await?.as_str())?;
Err(Error::msg(err.errors.system.message))
}
}
... | random | [
{
"content": "pub fn sha256(src: String) -> Vec<u8> {\n\n let mut hasher = Sha256::new();\n\n hasher.update(src.as_bytes());\n\n hasher.finalize().to_vec()\n\n}\n\n\n\n//////////////////////////////////////////////////\n",
"file_path": "src/utils.rs",
"rank": 0,
"score": 71134.40215482653
... |
Rust | codecs/src/aper/mod.rs | nplrkn/hampi | 0b07137ecef245d462c9f942bb219ad7bac2f434 | #![allow(dead_code)]
pub mod error;
pub use error::Error as AperCodecError;
pub mod decode;
pub mod encode;
pub trait AperCodec {
type Output;
fn decode(data: &mut AperCodecData) -> Result<Self::Output, AperCodecError>;
fn encode(&self, _data: &mut AperCodecData) -> Result<(), AperCodecError> {
... | #![allow(dead_code)]
pub mod error;
pub use error::Error as AperCodecError;
pub mod decode;
pub mod encode;
pub trait AperCodec {
type Output;
fn decode(data: &mut AperCodecData) -> Result<Self::Output, AperCodecError>;
fn encode(&self, _data: &mut AperCodecData) -> Result<(), AperCodecError> {
... | FF
};
let inner = inner as i64;
inner as i128
}
64 => {
let inner = self.bits[self.decode_offset..self.decode_offset + bits]
.load_be::<u128>() as i64;
... | s_deref().unwrap();
let _ = self.advance_maybe_err(1, true)?;
Ok(bit)
}
fn decode_bits_as_integer(
&mut self,
bits: usize,
signed: bool,
) -> Result<i128, AperCodecError> {
let remaining = self.bits.len() - self.decode_offset;
if remaining < bits {
... | random | [
{
"content": "/// Decode a Boolean\n\n///\n\n/// Decode a Boolean value. Returns the decoded value as a `bool`.\n\npub fn decode_bool(data: &mut AperCodecData) -> Result<bool, AperCodecError> {\n\n data.decode_bool()\n\n}\n\n\n",
"file_path": "codecs/src/aper/decode/mod.rs",
"rank": 0,
"score": 2... |
Rust | sdk/finspacedata/src/json_ser.rs | StevenBlack/aws-sdk-rust | f4a1458f0154318c47d7e6a4ac55226f400fbfbc |
pub fn serialize_structure_crate_input_create_changeset_input(
object: &mut aws_smithy_json::serialize::JsonObjectWriter,
input: &crate::input::CreateChangesetInput,
) -> Result<(), aws_smithy_http::operation::SerializationError> {
if let Some(var_1) = &input.change_type {
object.key("changeType").... |
pub fn serialize_structure_crate_input_create_changeset_input(
object: &mut aws_smithy_json::serialize::JsonObjectWriter,
input: &crate::input::CreateChangesetInput,
) -> Result<(), aws_smithy_http::operation::SerializationError> {
if let Some(var_1) = &input.change_type {
object.key("changeType").... | r());
}
Ok(())
}
pub fn serialize_structure_crate_input_update_user_input(
object: &mut aws_smithy_json::serialize::JsonObjectWriter,
input: &crate::input::UpdateUserInput,
) -> Result<(), aws_smithy_http::operation::SerializationError> {
if let Some(var_71) = &input.api_access {
object.key... | ay_33.value().string(item_34.as_str());
}
}
array_33.finish();
}
if let Some(var_35) = &input.client_token {
object.key("clientToken").string(var_35.as_str());
}
if let Some(var_36) = &input.description {
object.key("description").string(var_36.as_str());
... | random | [] |
Rust | src/view/rikai.rs | Netdex/niinii | d2fa91f3c16b1bdc20d7799a79e1d354247cd55e | use std::cell::RefCell;
use std::collections::{HashMap, HashSet};
use ichiran::romanize::*;
use imgui::*;
use super::deepl::DeepLView;
use super::mixins::*;
use super::settings::{DisplayRubyText, SettingsView};
use crate::backend::renderer::Env;
use crate::gloss::Gloss;
use crate::translation::Translation;
use crate:... | use std::cell::RefCell;
use std::collections::{HashMap, HashSet};
use ichiran::romanize::*;
use imgui::*;
use super::deepl::DeepLView;
use super::mixins::*;
use super::settings::{DisplayRubyText, SettingsView};
use crate::backend::renderer::Env;
use crate::gloss::Gloss;
use crate::translation::Translation;
use crate:... | text("");
self.add_root(env, ui, settings, &gloss.root);
if *show_raw {
Window::new("Raw")
.size([300., 110.], Condition::FirstUseEver)
.opened(show_raw)
.build(ui, || {
RawView::new(&gloss.root... | self.translation.as_ref()
}
fn term_window(
&self,
env: &mut Env,
ui: &Ui,
settings: &SettingsView,
romanized: &Romanized,
) -> bool {
let mut opened = true;
Window::new(&romanized.term().text().to_string())
.size_constraints([300.0... | random | [
{
"content": "fn add_gloss(ui: &Ui, gloss: &Gloss) {\n\n TreeNode::new(&format!(\"Gloss ({} {})\", gloss.pos(), gloss.gloss()))\n\n .default_open(false)\n\n .build(ui, || {\n\n wrap_bullet(ui, &format!(\"pos: {}\", gloss.pos()));\n\n wrap_bullet(ui, &format!(\"gloss: {}\",... |
Rust | src/pixel_task.rs | SharpCoder/hexagon2 | 0a565a263e5a3513c15e7e10ef75a9b6cd64efdb | use teensycore::*;
use teensycore::clock::*;
use teensycore::debug::blink_accumulate;
use teensycore::math::rand;
use teensycore::system::str::Str;
use teensycore::system::str::StringOps;
use teensycore::system::vector::Array;
use teensycore::system::vector::Vector;
use crate::date_time::DateTime;
use crate::get_shader... | use teensycore::*;
use teensycore::clock::*;
use teensycore::debug::blink_accumulate;
use teensycore::math::rand;
use teensycore::system::str::Str;
use teensycore::system::str::StringOps;
use teensycore::system::vector::Array;
use teensycore::system::vector::Vector;
use crate::date_time::DateTime;
use crate::get_shader... |
fn get_next_effect(&self, shader: &Shader) -> Effect {
let idx = rand() % self.effects.size() as u64;
let next_effect = self.effects.get(idx as usize).unwrap();
if next_effect.disabled || next_effect.max_color_segments.unwrap... | if crate::USE_WIFI {
let appropriate_shader = get_shader_configs().get_shader(crate::get_world_time());
match self.find_shader(&appropriate_shader) {
None => return self.shaders.get(0).unwrap(),
Some(shader) => {
if shader.disabled {
... | function_block-function_prefix_line | [
{
"content": "pub fn parse_http_request(rx_buffer: &Str, header: &mut Str, content: &mut Str) -> bool {\n\n // Ensure buffers are setup\n\n header.clear();\n\n content.clear();\n\n\n\n debug_str(b\"HELLO YES THIS IS DOG\");\n\n \n\n let mut content_length_cmp = str!(b\"Content-Length: \");\n\n... |
Rust | src/lib.rs | tickbh/td_rthreadpool | d7f23f07b56777afdef2e3c89324339d2ee97a32 | extern crate libc;
use std::panic;
use std::panic::AssertUnwindSafe;
use std::sync::mpsc::{channel, Sender, Receiver, SyncSender, sync_channel, RecvError};
use std::sync::{Arc, Mutex};
use std::thread::{self, JoinHandle};
mod mutex;
pub use mutex::{ReentrantMutex, ReentrantMutexGuard};
trait FnBox {
fn call_box... | extern crate libc;
use std::panic;
use std::panic::AssertUnwindSafe;
use std::sync::mpsc::{channel, Sender, Receiver, SyncSender, sync_channel, RecvError};
use std::sync::{Arc, Mutex};
use std::thread::{self, JoinHandle};
mod mutex;
pub use mutex::{ReentrantMutex, ReentrantMutexGuard};
trait FnBox {
fn call_box... | {
return;
}
}
Err(..) => {
retu... | .spawn(move || {
loop {
let result = panic::catch_unwind(AssertUnwindSafe(|| {
let message = {
let lock = job_... | random | [
{
"content": "#[test]\n\nfn join_all_with_thread_panic() {\n\n let mut pool = ThreadPool::new(TEST_TASKS);\n\n for _ in 0..4 {\n\n pool.execute(move || {\n\n panic!();\n\n });\n\n }\n\n\n\n sleep(Duration::from_millis(1000));\n\n\n\n let active_count = pool.active_count()... |
Rust | tests/asm.rs | jonas-schievink/x87 | c24fe7ee4fd51ebb8411187a7e200bd80c9ea87c |
#![feature(asm, untagged_unions)]
#![cfg(any(target_arch = "x86", target_arch = "x86_64"))]
#[macro_use] extern crate x87;
#[macro_use] extern crate proptest;
extern crate env_logger;
extern crate ieee754;
use x87::{X87State, f80};
use ieee754::Ieee754;
union X87StateUnion {
raw: [u8; 108],
structured: X87... |
#![feature(asm, untagged_unions)]
#![cfg(any(target_arch = "x86", target_arch = "x86_64"))]
#[macro_use] extern crate x87;
#[macro_use] extern crate proptest;
extern crate env_logger;
extern crate ieee754;
use x87::{X87State, f80};
use ieee754::Ieee754;
union X87StateUnion {
raw: [u8; 108],
structured: X87... |
fn add32(lhs_bits: u32, rhs_bits: u32) {
let (lhs, rhs) = (f32::from_bits(lhs_bits), f32::from_bits(rhs_bits));
let mut native_f32_sum = 0.0f32;
let mut native_f80_sum = [0u8; 10];
run_host_asm!(r"
flds $1
flds $0
faddp
fsts $2
fstpt $3
" : "=*m"(&lhs)... | p
fstpl $0
" : "=*m"(&mut result80), "=*m"(&lhs), "=*m"(&rhs));
println!("{}+{}={}", lhs, rhs, result80);
let result64 = lhs + rhs;
assert_eq!(result64.to_bits(), result80.to_bits() + 1, "host FPU returned wrong result");
let (l80, r80) = (f80::from(lhs), f80::from(rhs));
let f80s... | function_block-function_prefixed | [] |
Rust | 05_recon/src/types.rs | lazear/types-and-programming-languages | 0787493713b41639878db206e76d82fa8f29a77a | use std::collections::{HashMap, HashSet, VecDeque};
#[derive(Copy, Clone, Default, PartialEq, PartialOrd, Eq, Hash)]
pub struct TypeVar(pub u32, pub u32);
#[derive(Copy, Clone, PartialEq, PartialOrd, Eq, Hash)]
pub struct Tycon {
id: usize,
arity: usize,
}
#[derive(Clone, PartialEq, PartialOrd, Eq, Hash)]
pu... | use std::collections::{HashMap, HashSet, VecDeque};
#[derive(Copy, Clone, Default, PartialEq, PartialOrd, Eq, Hash)]
pub struct TypeVar(pub u32, pub u32);
#[derive(Copy, Clone, PartialEq, PartialOrd, Eq, Hash)]
pub struct Tycon {
id: usize,
arity: usize,
}
#[derive(Clone, PartialEq, PartialOrd, Eq, Hash)]
pu... | TypeVar {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
f.write_str(&fresh_name(self.0))
}
}
impl std::fmt::Debug for Type {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
match self {
Type::Var(x) => write!(f, "{:?}", x),
Type::... | ) as char;
(0..x / 26)
.map(|_| 'z')
.chain(std::iter::once(last))
.collect::<String>()
}
impl std::fmt::Debug for | random | [
{
"content": "fn var_bind(var: TypeVar, ty: Type) -> Result<HashMap<TypeVar, Type>, String> {\n\n if ty.occurs(var) {\n\n return Err(format!(\"Fails occurs check! {:?} {:?}\", var, ty));\n\n }\n\n let mut sub = HashMap::new();\n\n match ty {\n\n Type::Var(x) if x == var => {}\n\n ... |
Rust | circuit/src/execution-delivery/src/lib.rs | xylix/t3rn | fda43863b640fae63988042addadc21a1bfa32de |
#![cfg_attr(not(feature = "std"), no_std)]
use codec::{Decode, Encode};
use frame_support::traits::Get;
use frame_system::offchain::{AppCrypto, CreateSignedTransaction, SignedPayload, SigningTypes};
use sp_core::crypto::KeyTypeId;
use sp_runtime::{
transaction_validity::{InvalidTransaction, TransactionValidity,... |
#![cfg_attr(not(feature = "std"), no_std)]
use codec::{Decode, Encode};
use frame_support::traits::Get;
use frame_system::offchain::{AppCrypto, CreateSignedTransaction, SignedPayload, SigningTypes};
use sp_core::crypto::KeyTypeId;
use sp_runtime::{
transaction_validity::{InvalidTransaction, TransactionValidity,... | ong io schedule");
for phase in inter_schedule.phases.clone() {
for step in phase.steps {
Self::deposit_event(Event::NewPhase(who.clone(), 0, step.compose.name.clone(... | <Self::BlockNumber>;
#[pallet::constant]
type UnsignedPriority: Get<TransactionPriority>;
}
#[pallet::pallet]
#[pallet::generate_store(pub(super) trait Store)]
pub struct Pallet<T>(_);
#[pallet::hooks]
impl<T: Config> Hooks<BlockNumberFor<T>... | random | [
{
"content": "#[cfg(not(test))]\n\npub trait TestAuxiliaries {}\n\n#[cfg(not(test))]\n\nimpl<T> TestAuxiliaries for T {}\n\n\n",
"file_path": "gateway/pallet-escrow-gateway/escrow-engine/versatile-wasm/src/gas.rs",
"rank": 1,
"score": 203546.12681136615
},
{
"content": "#[cfg(not(test))]\n\n... |
Rust | key_config/src/old_key_map.rs | NordGeit/MMAccel | a45b2f8eecb795cb784d3a89be70ee41e60c84a9 | use crate::*;
use std::io::BufRead;
fn str_to_vk(k: &str) -> Option<u32> {
match k.trim() {
"esc" => Some(VK_ESCAPE.0 as u32),
"tab" => Some(VK_TAB.0 as u32),
"capslock" => Some(VK_CAPITAL.0 as u32),
"shift" => Some(VK_SHIFT.0 as u32),
"ctrl" => Some(VK_CONTROL.0 as u32),
... | use crate::*;
use std::io::BufRead;
fn str_to_vk(k: &str) -> Option<u32> {
match k.trim() {
"esc" => Some(VK_ESCAPE.0 as u32),
"tab" => Some(VK_TAB.0 as u32),
"capslock" => Some(VK_CAPITAL.0 as u32),
"shift" => Some(VK_SHIFT.0 as u32),
"ctrl" => Some(VK_CO | wrap();
let prev = data.0.iter().find(|item| item.id == "FramePrev").unwrap();
let mut keys = Keys::new();
keys.vk(b'A' as _);
assert!(prev.keys.as_ref().unwrap() == &keys);
let next = data.0.iter().find(|item| item.id == "FrameNext").unwrap();
let mut keys = Keys::new();... | NTROL.0 as u32),
"alt" => Some(VK_MENU.0 as u32),
"backspace" => Some(VK_BACK.0 as u32),
"enter" => Some(VK_RETURN.0 as u32),
"space" => Some(VK_SPACE.0 as u32),
"printscreen" => Some(VK_SNAPSHOT.0 as u32),
"pause" => Some(VK_PAUSE.0 as u32),
"insert" => Some(VK_I... | random | [
{
"content": "fn error(msg: &str) {\n\n message_box(None, msg, \"d3d9.dll エラー\", MB_OK | MB_ICONERROR);\n\n}\n\n\n\n#[inline]\n\nunsafe fn mmaccel_run(base_addr: usize) {\n\n if let Some(mmaccel) = MMACCEL.get() {\n\n let f = mmaccel.get::<unsafe fn(usize)>(b\"mmaccel_run\").unwrap();\n\n f(... |
Rust | src/processor.rs | jswh/wslexe | 964319b2cb2b830c54289138db7c2deeb3b938b9 | use std::borrow::Cow;
use std::env;
use std::io::{self, Write};
use std::path::{Component, Path, Prefix, PrefixComponent};
use std::process;
use std::process::{Command, Stdio};
use regex::bytes::Regex;
fn get_drive_letter(pc: &PrefixComponent) -> Option<String> {
let drive_byte = match pc.kind() {
Prefix:... | use std::borrow::Cow;
use std::env;
use std::io::{self, Write};
use std::path::{Component, Path, Prefix, PrefixComponent};
use std::process;
use std::process::{Command, Stdio};
use regex::bytes::Regex;
fn get_drive_letter(pc: &PrefixComponent) -> Option<String> {
let drive_byte = match pc.kind() {
Prefix:... |
fn shell_escape(arg: String) -> String {
if arg.contains(" ") {
return vec![String::from("\""), arg, String::from("\"")].join("");
}
arg.replace("\n", "$'\n'");
arg.replace(";", "$';'")
}
pub fn execute(interactive: bool) {
let mut exe_path = env::current_exe().unwrap();
exe_... | n translate_path_to_win(line: &[u8]) -> Cow<[u8]> {
lazy_static! {
static ref WSLPATH_RE: Regex = Regex::new(r"(?m-u)/mnt/(?P<drive>[A-Za-z])(?P<path>/\S*)")
.expect("Failed to compile WSLPATH regex");
}
WSLPATH_RE.replace_all(line, &b"${drive}:${path}"[..])
} | function_block-function_prefixed | [
{
"content": "fn main() {\n\n processor::execute(false)\n\n}\n",
"file_path": "src/main.rs",
"rank": 10,
"score": 18098.30613938591
},
{
"content": "fn main() {\n\n processor::execute(true)\n\n}\n",
"file_path": "src/main_i.rs",
"rank": 11,
"score": 18098.30613938591
},
... |
Rust | packages/server/src/middleware/tests.rs | sogrim/technion-sogrim | 6d9f86266252ac0b7348725a295aabca9eba5222 | use crate::{config::CONFIG, init_mongodb_client, middleware, resources::user::User};
use actix_rt::test;
use actix_web::{
http::StatusCode,
test::{self},
web::{self, Bytes},
App,
};
use actix_web_lab::middleware::from_fn;
use dotenv::dotenv;
use mongodb::Client;
#[test]
async fn test_from_request_no_db... | use crate::{config::CONFIG, init_mongodb_client, middleware, resources::user::User};
use actix_rt::test;
use actix_web::{
http::StatusCode,
test::{self},
web::{self, Bytes},
App,
};
use actix_web_lab::middleware::from_fn;
use dotenv::dotenv;
use mongodb::Client;
#[test]
async fn test_from_request_no_db... | t_header(("authorization", "bugo-the-debugo"))
.send_request(&app)
.await;
assert!(resp.status().is_server_error());
assert_eq!(
Bytes::from("JwtDecoder not initialized"),
test::read_body(resp).await
);
}
#[test]
async fn test_auth_mw_client_errors() {
let token_cl... | middleware::auth::authenticate))
.service(web::resource("/").route(web::get().to(|| async { "Shouldn't get here" }))),
)
.await;
let resp = test::TestRequest::get()
.uri("/")
.inser | function_block-random_span | [
{
"content": "pub fn parse_copy_paste_data(data: &str) -> Result<Vec<CourseStatus>, AppError> {\n\n // Sanity validation\n\n if !(data.starts_with(\"גיליון ציונים\") && data.contains(\"סוף גיליון ציונים\"))\n\n {\n\n return Err(AppError::Parser(\"Invalid copy paste data\".into()));\n\n }\n\n\... |
Rust | nonebot_rs/src/matcher/matchers/action.rs | abrahum/nonebot-rs | 8c090098a10f574637fcad16fd74357e875bd43e | use super::{Matchers, MatchersBTreeMap, MatchersHashMap};
use crate::event::{MessageEvent, MetaEvent, NoticeEvent, RequestEvent};
use crate::matcher::{action::MatchersAction, Matcher};
use std::collections::{BTreeMap, HashMap};
use tokio::sync::broadcast;
impl Matchers {
pub fn new(
message: Option<Ma... | use super::{Matchers, MatchersBTreeMap, MatchersHashMap};
use crate::event::{MessageEvent, MetaEvent, NoticeEvent, RequestEvent};
use crate::matcher::{action::MatchersAction, Matcher};
use std::collections::{BTreeMap, HashMap};
use tokio::sync::broadcast;
impl Matchers {
pub fn new(
message: Option<Ma... | }
self
}
pub fn add_notice_matcher(&mut self, matcher: Matcher<NoticeEvent>) -> &mut Self {
Matchers::add_matcher(&mut self.notice, matcher, self.action_sender.clone());
self
}
pub fn add_request_matcher(&mut self, matcher: Matcher<RequestEvent>) -> &mut Self {
... | ).await;
lock_handler.load_config(data.clone());
}
}
}
}
f(&self.message, &self.config).await;
f(&self.notice, &self.config).await;
f(&self.request, &self.config).await;
f(&self.meta, &self.config).await;
... | random | [
{
"content": "#[doc(hidden)]\n\nfn command_start_(event: &mut MessageEvent, config: BotConfig) -> bool {\n\n let raw_message = remove_space(&event.get_raw_message());\n\n let command_starts = config.command_starts;\n\n if command_starts.is_empty() {\n\n return true;\n\n }\n\n for sc in &co... |
Rust | src/bitwidth.rs | Robbepop/apin | 0b863c6f5dfcee22e6c2f4ead88bce9814788fc2 | use crate::{
mem::NonZeroUsize,
storage::Storage,
BitPos,
Digit,
Error,
Result,
ShiftAmount,
};
#[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct BitWidth(NonZeroUsize);
impl BitWidth {
#[inline]
pub fn w1() -> Self {
BitWidth(NonZeroUsize:... | use crate::{
mem::NonZeroUsize,
storage::Storage,
BitPos,
Digit,
Error,
Result,
ShiftAmount,
};
#[derive(Debug, Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct BitWidth(NonZeroUsize);
impl BitWidth {
#[inline]
pub fn w1() -> Self {
BitWidth(NonZeroUsize:... |
#[inline]
pub(crate) fn is_valid_pos<P>(self, pos: P) -> bool
where
P: Into<BitPos>,
{
pos.into().to_usize() < self.to_usize()
}
#[inline]
pub(crate) fn is_valid_shift_amount<S>(self, shift_amount: S) -> bool
where
S: Into<ShiftAmount>,
{
... | h == 0 {
return Err(Error::invalid_zero_bitwidth())
}
Ok(BitWidth(NonZeroUsize::new(width).unwrap()))
} | function_block-function_prefixed | [] |
Rust | src/borrows.rs | TimonPost/legion | 43acaaa1b68e177636c618f63aaf6f5cf8f10558 | use std::fmt::Debug;
use std::fmt::Display;
use std::ops::Deref;
use std::ops::DerefMut;
use std::slice::Iter;
use std::slice::IterMut;
use std::sync::atomic::{AtomicIsize, Ordering};
pub enum Borrow<'a> {
Read { state: &'a AtomicIsize },
Write { state: &'a AtomicIsize },
}
impl<'a> Borrow<'a> {
pub ... | use std::fmt::Debug;
use std::fmt::Display;
use std::ops::Deref;
use std::ops::DerefMut;
use std::slice::Iter;
use std::slice::IterMut;
use std::sync::atomic::{AtomicIsize, Ordering};
pub enum Borrow<'a> {
Read { state: &'a AtomicIsize },
Write { state: &'a AtomicIsize },
}
impl<'a> Borrow<'a> {
pub ... | i: usize) -> Option<BorrowedMut<'a, T>> {
let slice = self.slice;
let state = self.state;
slice.get_mut(i).map(|x| BorrowedMut::new(x, state))
}
}
impl<'a, T: 'a> Deref for BorrowedMutSlice<'a, T> {
type Target = [T];
fn deref(&self) -> &Self::Target {
self.slice
}
}
... | if x < 0 => Err("resource already borrowed as mutable"),
_ => Err("resource already borrowed as immutable"),
}
}
}
impl<'a> Drop for Borrow<'a> {
fn drop(&mut self) {
match *self {
Borrow::Read { state } => {
state.fetch_sub(1, Ordering::SeqCst);
... | random | [
{
"content": "/// A type which can fetch a strongly-typed view of the data contained\n\n/// within a `Chunk`.\n\npub trait View<'a>: Sized + Send + Sync + 'static {\n\n /// The iterator over the chunk data.\n\n type Iter: Iterator + 'a;\n\n\n\n /// Pulls data out of a chunk.\n\n fn fetch(chunk: &'a ... |
Rust | src/route.rs | quarterblue/-kademlia-dht | de82d5407922f97a6b7885c9dea4828b7ed04f55 | use crate::node::{Bit, ByteString, Node, ID_LENGTH};
use std::cell::RefCell;
use std::iter::Iterator;
use std::rc::Rc;
use std::rc::Weak;
const K_BUCKET_SIZE: usize = 4;
type LeafNode = Option<Rc<RefCell<Vertex>>>;
#[derive(Debug)]
pub struct KBucket {
node_bucket: Vec<Node>,
depth: usize,
}
impl KBucket ... | use crate::node::{Bit, ByteString, Node, ID_LENGTH};
use std::cell::RefCell;
use std::iter::Iterator;
use std::rc::Rc;
use std::rc::Weak;
const K_BUCKET_SIZE: usize = 4;
type LeafNode = Option<Rc<RefCell<Vertex>>>;
#[derive(Debug)]
pub struct KBucket {
node_bucket: Vec<Node>,
depth: usize,
}
impl KBucket ... |
vertex.borrow_mut().left = left_vert;
vertex.borrow_mut().right = right_vert;
}
Vertex::add_node(vertex, node, node_iter, &node_id, false);
}
... | match node_iter_next {
1 => {
if !matches!(vert.bit, Bit::One) {
split = false;
}
}
... | random | [
{
"content": "pub fn deserialize_message(v: Vec<u8>) -> Message {\n\n bincode::deserialize(&v).expect(\"Could not serialize message\")\n\n}\n\n\n",
"file_path": "src/rpc.rs",
"rank": 1,
"score": 65682.53778056285
},
{
"content": "pub fn serialize_message(msg: Message) -> Vec<u8> {\n\n ... |
Rust | sulis_module/src/generator/terrain_tiles.rs | ThyWoof/sulis | e89eda94a1a72228224e1926d307aa4c9228bdcb |
use std::collections::HashMap;
use std::io::Error;
use std::rc::Rc;
use crate::{
area::tile::{EdgeRules, TerrainKind, TerrainRules, Tile},
Module,
};
use sulis_core::util::unable_to_create_error;
#[derive(Clone)]
pub struct TerrainTiles {
pub id: String,
pub base: Rc<Tile>,
pub base_weight: u32,... |
use std::collections::HashMap;
use std::io::Error;
use std::rc::Rc;
use crate::{
area::tile::{EdgeRules, TerrainKind, TerrainRules, Tile},
Module,
};
use sulis_core::util::unable_to_create_error;
#[derive(Clone)]
pub struct TerrainTiles {
pub id: String,
pub base: Rc<Tile>,
pub base_weight: u32,... |
}
fn get_edge(prefix: &str, id: &str, edge_postfix: &str, dir_postfix: &str) -> Option<Rc<Tile>> {
let tile_id = format!("{}{}{}{}", prefix, id, edge_postfix, dir_postfix);
match Module::tile(&tile_id) {
None => {
trace!(
"Edge tile with '{}', '... | Ok(EdgesList {
inner_nw,
inner_ne,
inner_sw,
inner_se,
outer_n,
outer_s,
outer_e,
outer_w,
outer_se,
outer_ne,
outer_sw,
outer_nw,
outer_all,
inner_ne_s... | call_expression | [] |
Rust | src/i2s/rx_timing.rs | ForsakenHarmony/esp32c3-pac | 7d9eb9a5b5a51077d1d1eb6c6efd186064b7149b | #[doc = "Reader of register RX_TIMING"]
pub type R = crate::R<u32, super::RX_TIMING>;
#[doc = "Writer for register RX_TIMING"]
pub type W = crate::W<u32, super::RX_TIMING>;
#[doc = "Register RX_TIMING `reset()`'s with value 0"]
impl crate::ResetValue for super::RX_TIMING {
type Type = u32;
#[inline(always)]
... | #[doc = "Reader of register RX_TIMING"]
pub type R = crate::R<u32, super::RX_TIMING>;
#[doc = "Writer for register RX_TIMING"]
pub type W = crate::W<u32, super::RX_TIMING>;
#[doc = "Register RX_TIMING `reset()`'s with value 0"]
impl crate::ResetValue for super::RX_TIMING {
type Type = u32;
#[inline(always)]
... | w: self }
}
#[doc = "Bits 16:17"]
#[inline(always)]
pub fn rx_ws_out_dm(&mut self) -> RX_WS_OUT_DM_W {
RX_WS_OUT_DM_W { w: self }
}
#[doc = "Bits 0:1"]
#[inline(always)]
pub fn rx_sd_in_dm(&mut self) -> RX_SD_IN_DM_W {
RX_SD_IN_DM_W { w: self }
}
}
| }
impl<'a> RX_WS_OUT_DM_W<'a> {
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub unsafe fn bits(self, value: u8) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x03 << 16)) | (((value as u32) & 0x03) << 16);
self.w
}
}
#[doc = "Reader of field `RX_SD_IN_DM`"]
pub type RX_SD_... | random | [
{
"content": "#[doc = \"Reset value of the register\"]\n\n#[doc = \"\"]\n\n#[doc = \"This value is initial value for `write` method.\"]\n\n#[doc = \"It can be also directly writed to register by `reset` method.\"]\n\npub trait ResetValue {\n\n #[doc = \"Register size\"]\n\n type Type;\n\n #[doc = \"Res... |
Rust | src/entity/manager.rs | Connicpu/conniecs | b914ff8a5ebc8214869f588aa21e2a11d695f306 | use index_pool::IndexPool;
use vec_map::VecMap;
use std::collections::hash_map::HashMap;
use std::marker::PhantomData;
use std::mem;
use crate::component::ComponentManager;
use crate::entity::iter::{EntityIter, IndexedEntityIter};
use crate::entity::{BuildData, Entity, EntityBuilder, EntityData, Id, IndexedEntity};
u... | use index_pool::IndexPool;
use vec_map::VecMap;
use std::collections::hash_map::HashMap;
use std::marker::PhantomData;
use std::mem;
use crate::component::ComponentManager;
use crate::entity::iter::{EntityIter, IndexedEntityIter};
use crate::entity::{BuildData, Entity, EntityBuilder, EntityData, Id, IndexedEntity};
u... |
}
pub fn iter(&self) -> EntityIter<C> {
EntityIter::Indexed(IndexedEntityIter {
iter: self.indices.all_indices(),
values: &self.indexed_entities,
})
}
pub fn count(&self) -> usize {
self.indices.maximum()
}
pub fn indexed(&self, entity: Entity)... | if self.entities.contains_key(&entity) {
self.event_queue.push(Event::RemoveEntity(entity));
true
} else {
false
} | if_condition | [
{
"content": "fn activated(_: &mut IVSystem, _: EntityData, _: &Components, _: &mut Services) {\n\n ATOMIC_BOOP.store(true, std::sync::atomic::Ordering::SeqCst);\n\n}\n\n\n",
"file_path": "tests/aspects.rs",
"rank": 0,
"score": 173722.56101871424
},
{
"content": "pub trait EntityBuilder<C... |
Rust | tests/integration.rs | saltyrtc/saltyrtc-task-relayed-data-rs | c290b4ae7e1cbed145b16c34b17e1f6bf8380465 |
extern crate env_logger;
#[macro_use] extern crate log;
extern crate saltyrtc_client;
extern crate saltyrtc_task_relayed_data;
extern crate tokio_core;
extern crate tokio_timer;
use std::boxed::Box;
use std::env;
use std::fs::File;
use std::io::Read;
use std::path::Path;
use std::sync::{Arc, RwLock};
use std::time::... |
extern crate env_logger;
#[macro_use] extern crate log;
extern crate saltyrtc_client;
extern crate saltyrtc_task_relayed_data;
extern crate tokio_core;
extern crate tokio_timer;
use std::boxed::Box;
use std::env;
use std::fs::File;
use std::io::Read;
use std::path::Path;
use std::sync::{Arc, RwLock};
use std::time::... |
let rd_task_responder: &mut RelayedDataTask = (&mut **t_responder as &mut dyn Task)
.downcast_mut::<RelayedDataTask>()
.expect("Chosen task is not a RelayedDataTask");
let tx_initiator = rd_task_initiator.get_sender().unwrap();
let tx_responder = rd_task_respon... | let rd_task_initiator: &mut RelayedDataTask = (&mut **t_initiator as &mut dyn Task)
.downcast_mut::<RelayedDataTask>()
.expect("Chosen task is not a RelayedDataTask"); | assignment_statement | [
{
"content": "fn build_tests() -> (MutexGuard<'static, ()>, PathBuf) {\n\n let guard = match C_TEST_MUTEX.lock() {\n\n Ok(guard) => guard,\n\n Err(poisoned) => poisoned.into_inner(),\n\n };\n\n\n\n let out_dir = env!(\"OUT_DIR\");\n\n let build_dir = Path::new(out_dir).join(\"build\");... |
Rust | src/test/instruction_tests/instr_vdbpsadbw.rs | ftilde/rust-x86asm | f6584b8cfe8e75d978bf7b83a67c69444fd3f161 | use instruction_def::*;
use test::run_test;
use Operand::*;
use Reg::*;
use RegScale::*;
use RegType::*;
use {BroadcastMode, Instruction, MaskReg, MergeMode, Mnemonic, OperandSize, Reg, RoundingMode};
#[test]
fn vdbpsadbw_1() {
run_test(
&Instruction {
mnemonic: Mnemonic::VDBPSADBW,
... | use instruction_def::*;
use test::run_test;
use Operand::*;
use Reg::*;
use RegScale::*;
use RegType::*;
use {BroadcastMode, Instruction, MaskReg, MergeMode, Mnemonic, OperandSize, Reg, RoundingMode};
#[test]
fn vdbpsadbw_1() {
run_test(
&Instruction {
mnemonic: Mnemonic::VDBPSADBW,
... | mask: Some(MaskReg::K7),
broadcast: None,
},
&[98, 243, 125, 207, 66, 20, 198, 73],
OperandSize::Dword,
)
}
#[test]
fn vdbpsadbw_11() {
run_test(
&Instruction {
mnemonic: Mnemonic::VDBPSADBW,
operand1: Some(Direct(ZMM26)),
oper... | me(Direct(XMM2)),
operand4: Some(Literal8(93)),
lock: false,
rounding_mode: None,
merge_mode: Some(MergeMode::Zero),
sae: false,
mask: Some(MaskReg::K6),
broadcast: None,
},
&[98, 243, 69, 142, 66, 202, 93],
Oper... | random | [
{
"content": "fn encode32_helper2(mnemonic: Mnemonic, operand1: Operand, operand2: Operand, expected: &Vec<u8>) {\n\n let instr = Instruction {\n\n mnemonic: mnemonic,\n\n operand1: Some(operand1),\n\n operand2: Some(operand2),\n\n operand3: None,\n\n operand4: None,\n\n ... |
Rust | src/parser.rs | opp11/chemtool2 | d8cace048c5adf2ed61ab503534c287304a57644 |
use std::str::CharRange;
use elem::{PerElem, Molecule};
use error::{CTResult, CTError};
use error::CTErrorKind::InputError;
pub struct Parser {
pos: usize,
input: String,
paren_level: u32,
}
impl Parser {
pub fn new(input: &str) -> Parser {
Parser { pos: 0, input: String::from_str(input... |
use std::str::CharRange;
use elem::{PerElem, Molecule};
use error::{CTResult, CTError};
use error::CTErrorKind::InputError;
pub struct Parser {
pos: usize,
input: String,
paren_level: u32,
}
impl Parser {
pub fn new(input: &str) -> Parser {
Parser { pos: 0, input: String::from_str(input... |
fn parse_element(&mut self) -> CTResult<Vec<PerElem>> {
if self.eof() {
return Err(CTError {
kind: InputError,
desc: "Found no periodic element".to_string(),
pos: Some((self.pos, 1))
});
}
let start_pos = self... | fn parse_periodic(&mut self) -> CTResult<Vec<PerElem>> {
let mut elem = try!(self.parse_element());
if !self.eof() && self.peek_char().is_numeric() {
let coef = try!(self.parse_coefficient());
for e in elem.iter_mut() {
e.coef *= coef;
}
}
... | function_block-full_function | [
{
"content": "/// Sorts the PerElems and groups those with the same name field.\n\n///\n\n/// Grouping of two (or more) PerElems means adding the coef field of the\n\n/// duplicate to the one already found, and then throwing away the duplicate.\n\n/// E.g. CH3CH3 would turn into C2H6.\n\npub fn group_elems(mut ... |
Rust | rsnes/src/smp.rs | nat-rix/rsnes | 05b68de39041e68fa65184c1842c1cd7108543d6 | use crate::{
backend::AudioBackend as Backend,
spc700::Spc700,
timing::{Cycles, APU_CPU_TIMING_PROPORTION_NTSC, APU_CPU_TIMING_PROPORTION_PAL},
};
use save_state::{InSaveState, SaveStateDeserializer, SaveStateSerializer};
use save_state_macro::InSaveState;
use std::sync::mpsc::{channel, Receiver, RecvError,... | use crate::{
backend::AudioBackend as Backend,
spc700::Spc700,
timing::{Cycles, APU_CPU_TIMING_PROPORTION_NTSC, APU_CPU_TIMING_PROPORTION_PAL},
};
use save_ | mple)
}
}
match action {
Some(Action::WriteInputPort { addr, data }) => {
spc.input[usize::from(addr & 3)] = data
}
Some(Action::ReadOutputPort { addr }) => {
... | state::{InSaveState, SaveStateDeserializer, SaveStateSerializer};
use save_state_macro::InSaveState;
use std::sync::mpsc::{channel, Receiver, RecvError, Sender};
#[derive(Debug, Clone)]
enum Action {
WriteInputPort { addr: u8, data: u8 },
ReadOutputPort { addr: u8 },
}
#[derive(Debug, Clone)]
enum ThreadComma... | random | [
{
"content": "pub trait AccessType<B: crate::backend::AudioBackend, FB: crate::backend::FrameBuffer> {\n\n fn read<D: Data>(device: &mut Device<B, FB>, addr: Addr24) -> D;\n\n fn write<D: Data>(device: &mut Device<B, FB>, addr: Addr24, val: D);\n\n fn cpu(device: &Device<B, FB>) -> &Cpu;\n\n fn cpu_... |
Rust | src/serialization/database.rs | MDeiml/attomath | 4aac4dad3cd776dd2cb1602aa930c04c315d5186 | use crate::{error::ProofError, expression::SingleSubstitution, Identifier, Theorem};
use std::collections::HashMap;
#[derive(Debug, PartialEq, Eq)]
pub struct Database {
names: HashMap<String, (usize, usize)>,
theorems: Vec<(Theorem, Proof<usize>, Option<String>)>,
last_name: usize,
}
#[derive(Debug, Part... | use crate::{error::ProofError, expression::SingleSubstitution, Identifier, Theorem};
use std::collections::HashMap;
#[derive(Debug, PartialEq, Eq)]
pub struct Database {
names: HashMap<String, (usize, usize)>,
theorems: Vec<(Theorem, Proof<usize>, Option<String>)>,
last_name: usize,
}
#[derive(Debug, Part... |
fn reverse_id(&self, id: usize, current_id: usize) -> (Option<&str>, Option<usize>) {
if let Some(name) = &self.theorems[id].2 {
(Some(name), None)
} else if id == current_id - 1 {
(None, None)
} else if id >= self.last_name {
(None, Some(id - self.last_... | pub fn substitute(&mut self, theorem: Theorem) -> Result<(), DatabaseError> {
let last = &mut self
.theorems
.last_mut()
.ok_or(DatabaseError::TheoremNotFound(None, None))?
.0;
let mut theorem_standardized = theorem.clone();
theorem_standardized.st... | function_block-full_function | [
{
"content": "pub fn or_fail<I, O, E: ParseError<I>, F>(mut f: F) -> impl FnMut(I) -> IResult<I, O, E>\n\nwhere\n\n F: Parser<I, O, E>,\n\n{\n\n move |input| {\n\n f.parse(input).map_err(|error| match error {\n\n nom::Err::Error(e) => nom::Err::Failure(e),\n\n e => e,\n\n ... |
Rust | socrates-core/src/service/registry.rs | ckaran/socrates-rs | 450f364e38cf663367c36991a99cd8b689d76768 | use hashbrown::HashMap;
use super::*;
pub struct RegisteredService {
core_props: ServiceCoreProps,
type_id: TypeId,
name: Arc<str>,
owner_id: DynamodId,
used_by_count: HashMap<DynamodId, u32>,
service_object: Arc<dyn Service>,
}
impl RegisteredService {
pub fn make_service_ref(&self) -> ... | use hashbrown::HashMap;
use super::*;
pub struct RegisteredService {
core_props: ServiceCoreProps,
type_id: TypeId,
name: Arc<str>,
owner_id: Dyn | .expect("unsynced registry!");
let svc_ref = rs.make_service_ref();
if !rs.used_by_count.is_empty() {
self.zombies.insert(svc_id, rs);
} else {
println!("Dropping service (no users): {:?}", rs.make_... | amodId,
used_by_count: HashMap<DynamodId, u32>,
service_object: Arc<dyn Service>,
}
impl RegisteredService {
pub fn make_service_ref(&self) -> ServiceRef {
ServiceRef {
core: self.core_props.clone(),
name: (*(self.name)).into(),
type_id: self.type_id,
... | random | [
{
"content": "pub trait Named {\n\n fn type_name() -> &'static str;\n\n}\n\n\n",
"file_path": "socrates-core/src/service/service.rs",
"rank": 0,
"score": 67362.85685948143
},
{
"content": "#[inline(always)]\n\npub fn service_name<T: Named + ?Sized>() -> &'static str {\n\n <T>::type_nam... |
Rust | src/gf/gf_num.rs | irreducible-polynoms/irrpoly-rust | b4d5e023fb02ddf32e4fd56b417a5cc89b2295f2 | use crate::Gf;
use std::vec::Vec;
use std::fmt;
use std::ops;
use std::cmp;
#[derive(Debug, Clone)]
pub struct GfNum {
field: Gf,
num: usize,
}
impl fmt::Display for GfNum {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.num)
}
}
impl GfNum {
pub fn new(fie... | use crate::Gf;
use std::vec::Vec;
use std::fmt;
use std::ops;
use std::cmp;
#[derive(Debug, Clone)]
pub struct GfNum {
field: Gf,
num: usize,
}
impl fmt::Display for GfNum {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.num)
}
}
impl GfNum {
pub fn new(fie... |
}
impl ops::SubAssign<GfNum> for GfNum {
fn sub_assign(&mut self, other: GfNum) {
debug_assert_eq!(self.field(), other.field(), "Numbers from different fields");
let base = self.field().base();
self.num = (base + self.num - other.num) % base;
}
}
impl ops::SubAssign<usize> for GfNum {... | s.field().base();
GfNum {
field: rhs.field,
num: (base + rhs.num - (self % base)) % base
}
} | function_block-function_prefixed | [
{
"content": "#[test]\n\nfn not_a_field() {\n\n assert!(Gf::new(0).is_err());\n\n assert!(Gf::new(1).is_err());\n\n assert!(Gf::new(4).is_err());\n\n assert!(Gf::new(isize::max_value() as usize).is_err());\n\n}\n\n\n",
"file_path": "src/gf/tests.rs",
"rank": 0,
"score": 54802.98112542429... |
Rust | src/equalizer.rs | joaocarvalhoopen/Audio_filters_in_Rust | 00639f0c30078a5fd3f39a690243f5742743ae02 |
use crate::iir_filter::ProcessingBlock;
use crate::iir_filter::IIRFilter;
use crate::butterworth_filter::make_peak_eq_constant_q;
pub struct Equalizer {
sample_rate: u32,
bands_vec: Vec<f64>,
bands_gain_vec: Vec<f64>,
gain_max_db: f64,
gain_min_db: f64,
q_factor: f6... |
use crate::iir_filter::ProcessingBlock;
use crate::iir_filter::IIRFilter;
use crate::butterworth_filter::make_peak_eq_constant_q;
pub struct Equalizer {
sample_rate: u32,
bands_vec: Vec<f64>,
bands_gain_vec: Vec<f64>,
gain_max_db: f64,
gain_min_db: f64,
q_factor: f6... | self.iir_filters_vec.push(iir_filter);
}
}
fn change_filter(& mut self, index: usize) {
assert!(index < self.bands_vec.len());
let frequency_center = self.bands_vec[index];
let gain_db = self.bands_gain_vec[index];
let q_factor = Some(self.q_factor);
... | or band in & self.bands_vec {
let frequency_center = *band;
let gain_db = 0.0;
let iir_filter = make_peak_eq_constant_q(frequency_center, self.sample_rate, gain_db, Some(self.q_factor));
| function_block-random_span | [
{
"content": "/// Creates a low-pass filter\n\n///\n\n/// In Python: \n\n/// >>> filter = make_lowpass(1000, 48000)\n\n/// >>> filter.a_coeffs + filter.b_coeffs # doctest: +NORMALIZE_WHITESPACE\n\n/// [1.0922959556412573, -1.9828897227476208, 0.9077040443587427, 0.004277569313094809,\n\n/// 0.00855... |
Rust | sandbox/src/tilemap.rs | aengusmcmillin/Gouda | 4aed65c94ad4147372d71c08622dacf01f5eac4e | use gouda::rendering::{drawable::{TextureDrawable, QuadDrawable}, Renderer, Scene, texture::RenderableTexture};
use gouda::ecs::{ECS, Entity, GenIndex};
use std::rc::Rc;
use crate::camera::Camera;
use gouda::bmp::Bitmap;
use gouda::mouse_capture::{MouseCaptureArea, MouseCaptureLayer, ActiveCaptureLayer};
use gouda::typ... | use gouda::rendering::{drawable::{TextureDrawable, QuadDrawable}, Renderer, Scene, texture::RenderableTexture};
use gouda::ecs::{ECS, Entity, GenIndex};
use std::rc::Rc;
use crate::camera::Camera;
use gouda::bmp::Bitmap;
use gouda::mouse_capture::{MouseCaptureArea, MouseCaptureLayer, ActiveCaptureLayer};
use gouda::typ... |
fn create_tile(ecs: &mut ECS, color: [f32; 3], x: usize, y: usize) -> Entity {
let renderer = ecs.read_res::<Rc<Renderer>>();
let quad = QuadDrawable::new(false, renderer, color, [-5. + x as f32 * 1., -3. + y as f32 * 1., 0.], [0.5, 0.5, 1.], [0.; 3]);
let tile = Tile {
color_d... | occupied: false,
x: x as i32 - 5,
y: y as i32 - 3,
neighbors: [None; 4],
};
ecs.build_entity().add(tile).add(MouseCaptureArea::new(Bounds{x: x as i32 * 80, y: y as i32 * 80 + 160, w: 80, h: 80})).entity()
} | function_block-function_prefix_line | [
{
"content": "pub fn win32_process_keyboard(keyboard: &mut KeyboardInput, vkcode: i32, was_down: bool, is_down: bool) {\n\n if was_down != is_down {\n\n if vkcode == VK_UP {\n\n win32_process_keyboard_message(\n\n &mut keyboard.special_keys[SpecialKeys::UpArrow],\n\n ... |
Rust | src/lib.rs | DownToZero-Cloud/dtz-identity-auth | a93d6ca8472680fd8d1d7f6dc4082e5726aa5438 | #![deny(missing_docs)]
#![feature(adt_const_params)]
use serde::{Serialize,Deserialize};
use axum::{
async_trait,
extract::{FromRequest, RequestParts},
http::header::HeaderValue,
http::{StatusCode},
};
use uuid::Uuid;
use jwt::PKeyWithDigest;
use openssl::hash::MessageDigest;
use openssl::pkey::PKey;
use jwt::... | #![deny(missing_docs)]
#![feature(adt_const_params)]
use serde::{Serialize,Deserialize};
use axum::{
async_trait,
extract::{FromRequest, RequestParts},
http::header::HeaderValue,
http::{StatusCode},
};
use uuid::Uuid;
use jwt::PKeyWithDigest;
use openssl::hash::MessageDigest;
use openssl::pkey::PKey;
use jwt::... |
}else {
let query = req.uri().query().unwrap_or_default();
let value: GetAuthParams = serde_urlencoded::from_str(query).unwrap();
if value.api_key.is_some() {
if value.context_id.is_some() {
profile = verifiy_api_key(&value.api_key.unwrap(), Some(&value.context_id.unwrap())).await.unwr... | if header_context_id.is_some() {
profile = verifiy_api_key(header_api_key.to_str().unwrap(), Some(header_context_id.unwrap().to_str().unwrap())).await.unwrap();
}else{
profile = verifiy_api_key(header_api_key.to_str().unwrap(), None).await.unwrap();
} | if_condition | [
{
"content": "# 0.4.10 2022-04-30\n\n\n\n* fix unparsable cookie\n\n\n\n# 0.4.9 2022-04-20\n\n\n\n* fail on invalid jwts\n\n\n\n# 0.4.8 2022-04-17\n\n\n\n* add verify_role functions\n\n\n\n# 0.4.7 2022-03-11\n\n\n\n* support foreign cookies\n\n\n\n# 0.4.6 2022-03-11\n\n\n\n* update deps\n\n\n\n# 0.4.4 2022-03-1... |
Rust | examples/capture-test.rs | petrosagg/differential-dataflow | 2e38abbb62aedf02cb9b6b5debb73c29b6e97dbb | extern crate rand;
extern crate timely;
extern crate differential_dataflow;
extern crate serde;
extern crate rdkafka;
use rand::{Rng, SeedableRng, StdRng};
use timely::dataflow::*;
use timely::dataflow::operators::probe::Handle;
use differential_dataflow::input::Input;
use differential_dataflow::Collection;
use dif... | extern crate rand;
extern crate timely;
extern crate differential_dataflow;
extern crate serde;
extern crate rdkafka;
use rand::{Rng, SeedableRng, StdRng};
use timely::dataflow::*;
use timely::dataflow::operators::probe::Handle;
use differential_dataflow::input::Input;
use differential_dataflow::Collection;
use dif... |
pub mod kafka {
use serde::{Serialize, Deserialize};
use timely::scheduling::SyncActivator;
use rdkafka::{ClientContext, config::ClientConfig};
use rdkafka::consumer::{BaseConsumer, ConsumerContext};
use rdkafka::error::{KafkaError, RDKafkaError};
use differential_dataflow::capture::Writer;
... | e>) -> Collection<G, (Node, u32)>
where G::Timestamp: Lattice+Ord {
let nodes = roots.map(|x| (x, 0));
nodes.iterate(|inner| {
let edges = edges.enter(&inner.scope());
let nodes = nodes.enter(&inner.scope());
inner.join_map(&edges, |_k,l,d| (*d, l+1))
.concat(&... | function_block-function_prefixed | [
{
"content": "// Type aliases for differential execution.\n\ntype Time = u32;\n",
"file_path": "doop/src/main.rs",
"rank": 0,
"score": 294510.99856603285
},
{
"content": "type Node = u32;\n\n\n",
"file_path": "src/trace/implementations/graph.rs",
"rank": 1,
"score": 289060.656315... |
Rust | src/lib.rs | incident-recipient/gherkin-rust | 7668c349ced30d5332821538ce321737cdbbacec |
mod parser;
pub mod tagexpr;
pub use peg::error::ParseError;
pub use peg::str::LineCol;
use typed_builder::TypedBuilder;
use std::path::{Path, PathBuf};
#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]
pub struct Background {
pub steps: Vec<Step>,
#[builder(default)]
pub span: (usi... |
mod parser;
pub mod tagexpr;
pub use peg::error::ParseError;
pub use peg::str::LineCol;
use typed_builder::TypedBuilder;
use std::path::{Path, PathBuf};
#[derive(Debug, Clone, TypedBuilder, P | e {
Some(v) => Some(&v),
None => None,
}
}
}
impl std::fmt::Display for Step {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "{} {}", &self.raw_type, &self.value)
}
}
| artialEq, Hash, Eq)]
pub struct Background {
pub steps: Vec<Step>,
#[builder(default)]
pub span: (usize, usize),
#[builder(default)]
pub position: (usize, usize),
}
#[derive(Debug, Clone, TypedBuilder, PartialEq, Hash, Eq)]
pub struct Examples {
pub table: Table,
#[... | random | [
{
"content": "//! let op: TagOperation = \"@a and @b\".parse()?;\n\n//! # Ok(())\n\n//! # }\n\n//! ```\n\n\n\nuse std::str::FromStr;\n\n\n\nimpl FromStr for TagOperation {\n\n type Err = peg::error::ParseError<peg::str::LineCol>;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n crate::... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.