{\\n\\n weapons: RectangleShape<'s>,\\n\\n animations: Vec<Animation>,\\n\\n texture_loader: &'s TextureLoader,\\n\\n shadows: RectangleShape<'s>,\\n\\n shadows_id: Vec<i32>,\\n\\n current_weapon: i32,\\n\\n mouse_fire: bool,\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 37,\n \"score\": 12.2115002603146\n },\n {\n \"content\": \"//! Basic class to display the games frames per seconds (FPS).\\n\\n//!\\n\\n//! This class displays the current FPS in the bottom-left of the window.\\n\\n#![allow(non_snake_case)]\\n\\n\\n\\nuse rsfml::{\\n\\n graphics::{Color, Font, RenderTarget, RenderWindow, Text, Transformable},\\n\\n system::{Clock, Vector2f},\\n\\n};\\n\\n\\n\\npub struct FPSHandler<'t> {\\n\\n fps_clock: Clock,\\n\\n text: Text<'t>,\\n\\n images: usize,\\n\\n}\\n\\n\\n\\nimpl<'t> FPSHandler<'t> {\\n\\n /// Constructs a new instance of FPSHandler\\n\\n ///\\n\\n /// # Arguments\\n\",\n \"file_path\": \"src/fps.rs\",\n \"rank\": 38,\n \"score\": 11.845449409848886\n },\n {\n \"content\": \" .set_position(Vector2f::new(10., self.window_size.y - 70.));\\n\\n self.face_animation.update();\\n\\n self.face.set_texture(\\n\\n self.texture_loader\\n\\n .get_texture(self.face_animation.get_current_texture_id()),\\n\\n false,\\n\\n );\\n\\n if self.face_clock.elapsed_time().as_seconds() >= 7. {\\n\\n self.face_animation.set_state(AnimationState::Play);\\n\\n self.face_clock.restart();\\n\\n }\\n\\n }\\n\\n\\n\\n fn draw_line(&mut self, line_coords: Line2D, color: &Color, render_window: &mut RenderWindow) {\\n\\n self.hud_vertex_array.clear();\\n\\n self.hud_vertex_array.append(&Vertex::with_pos_color(\\n\\n Vector2f::new(line_coords[0], line_coords[1]),\\n\\n *color,\\n\\n ));\\n\\n self.hud_vertex_array.append(&Vertex::with_pos_color(\\n\",\n \"file_path\": \"src/hud.rs\",\n \"rank\": 39,\n \"score\": 11.752992839484051\n },\n {\n \"content\": \"\\n\\n pub fn has_mouse_moved_event(&self) -> Option<(i32, i32)> {\\n\\n self.events.iter().find_map(|ev| match *ev {\\n\\n Event::MouseMoved { x, y } => Some((x, y)),\\n\\n _ => None,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn has_mouse_entered_event(&self) -> bool {\\n\\n self.events.iter().any(|ev| *ev == Event::MouseEntered)\\n\\n }\\n\\n\\n\\n pub fn has_mouse_left_event(&self) -> bool {\\n\\n self.events.iter().any(|ev| *ev == Event::MouseLeft)\\n\\n }\\n\\n\\n\\n // pub fn get_mouse_position(&self) -> Vector2i {\\n\\n // self.render_window.get_mouse_position()\\n\\n // }\\n\\n\\n\",\n \"file_path\": \"src/event_handler.rs\",\n \"rank\": 40,\n \"score\": 11.742245828919428\n },\n {\n \"content\": \" }\\n\\n self.r_engine.update(event_handler);\\n\\n if self.mini_map.is_active() {\\n\\n self.mini_map\\n\\n .update(self.r_engine.get_player_pos(), rotation);\\n\\n }\\n\\n self.hud.update();\\n\\n self.weapon.update(event_handler);\\n\\n }\\n\\n\\n\\n pub fn draw(&mut self, render_window: &mut RenderWindow) {\\n\\n render_window.draw(&self.sky);\\n\\n render_window.draw(&self.ground);\\n\\n self.r_engine.draw(render_window, self.texture_loader);\\n\\n if self.mini_map.is_active() {\\n\\n self.mini_map.draw(render_window, self.texture_loader);\\n\\n }\\n\\n self.hud.draw(render_window);\\n\\n self.weapon.draw(render_window);\\n\\n render_window.set_mouse_cursor_visible(false);\\n\\n render_window.set_mouse_position(Vector2i::new(\\n\\n (self.window_size.x / 2) as i32,\\n\\n (self.window_size.y / 2) as i32,\\n\\n ));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/game_mode.rs\",\n \"rank\": 44,\n \"score\": 11.054426419734382\n },\n {\n \"content\": \"//! Module for event handling\\n\\n\\n\\nuse rsfml::{\\n\\n graphics::RenderWindow,\\n\\n window::{mouse::Button as MouseButton, Event, Key},\\n\\n};\\n\\n\\n\\npub struct EventHandler {\\n\\n pub events: Vec<Event>,\\n\\n}\\n\\n\\n\\nimpl EventHandler {\\n\\n pub fn new() -> EventHandler {\\n\\n EventHandler { events: Vec::new() }\\n\\n }\\n\\n\\n\\n pub fn is_key_pressed(&self, key: Key) -> bool {\\n\\n Key::is_pressed(key)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/event_handler.rs\",\n \"rank\": 45,\n \"score\": 10.939107780309445\n },\n {\n \"content\": \" 0, 1, 1, 4, 0, 4, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 4, 0,\\n\\n 0, 0, 0, 5, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 4, 0, 4, 0, 0, 0, 0,\\n\\n 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 4, 0, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0,\\n\\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\n 0, 0, 0, 0, 0, 1, 1, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\n 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\\n\\n ];\\n\\n Map::new(map_i32, &Vector2f::new(24., 24.))\\n\\n }\\n\\n\\n\\n pub fn update(&mut self, event_handler: &EventHandler) {\\n\\n let mut rotation: f32 = 0.;\\n\\n if event_handler.is_key_pressed(Key::Left) {\\n\\n rotation = -5.25;\\n\\n }\\n\\n if event_handler.is_key_pressed(Key::Right) {\\n\\n rotation = 5.25;\\n\\n }\\n\\n if let Some(_) = event_handler.has_key_pressed_event(Key::M) {\\n\\n self.mini_map.toggle_active();\\n\",\n \"file_path\": \"src/game_mode.rs\",\n \"rank\": 46,\n \"score\": 10.93697327944958\n },\n {\n \"content\": \" Vector2f::new(line_coords[2], line_coords[3]),\\n\\n *color,\\n\\n ));\\n\\n render_window.draw(&self.hud_vertex_array);\\n\\n }\\n\\n\\n\\n fn draw_2line(&mut self, line_coords: Line3D, color: &Color, render_window: &mut RenderWindow) {\\n\\n self.hud_vertex_array.clear();\\n\\n self.hud_vertex_array.append(&Vertex::with_pos_color(\\n\\n Vector2f::new(line_coords[0], line_coords[1]),\\n\\n *color,\\n\\n ));\\n\\n self.hud_vertex_array.append(&Vertex::with_pos_color(\\n\\n Vector2f::new(line_coords[2], line_coords[3]),\\n\\n *color,\\n\\n ));\\n\\n self.hud_vertex_array.append(&Vertex::with_pos_color(\\n\\n Vector2f::new(line_coords[4], line_coords[5]),\\n\\n *color,\\n\\n ));\\n\",\n \"file_path\": \"src/hud.rs\",\n \"rank\": 48,\n \"score\": 10.622583198120287\n },\n {\n \"content\": \"//! Module for game state management\\n\\n\\n\\n#![allow(non_snake_case)]\\n\\n\\n\\nuse rsfml::{\\n\\n graphics::{Color, Font, RenderTarget, RenderWindow},\\n\\n window::Key,\\n\\n};\\n\\n\\n\\nuse crate::{event_handler::*, fps::*, game_mode::*, texture_loader::TextureLoader};\\n\\n\\n\\npub struct GameLoop<'s> {\\n\\n render_window: RenderWindow,\\n\\n fps_handler: Option<FPSHandler<'s>>,\\n\\n event_handler: EventHandler,\\n\\n clear_color: Color,\\n\\n game_mode: GameMode<'s>,\\n\\n}\\n\\n\\n\\nimpl<'s> GameLoop<'s> {\\n\",\n \"file_path\": \"src/game.rs\",\n \"rank\": 49,\n \"score\": 10.209704097109205\n },\n {\n \"content\": \" offset: u32,\\n\\n texture_ids: Vec<i32>,\\n\\n state: AnimationState,\\n\\n mode: AnimationPlayMode,\\n\\n lag: f32,\\n\\n current_texture: u32,\\n\\n clock: Clock,\\n\\n}\\n\\n\\n\\nimpl Animation {\\n\\n pub fn new(\\n\\n texture_ids: Vec<i32>,\\n\\n state: AnimationState,\\n\\n mode: AnimationPlayMode,\\n\\n lag: f32,\\n\\n offset: u32,\\n\\n ) -> Animation {\\n\\n Animation {\\n\\n a: 1,\\n\\n b: texture_ids.len() as u32 - 1u32,\\n\",\n \"file_path\": \"src/animation.rs\",\n \"rank\": 50,\n \"score\": 10.140477977035701\n },\n {\n \"content\": \" ///\\n\\n /// # Arguments\\n\\n /// `render_window` - The window to draw the weapon onto\\n\\n pub fn draw<'r>(&'r mut self, render_window: &'r mut RenderWindow) -> () {\\n\\n self.weapons.set_texture(\\n\\n self.texture_loader.get_texture(\\n\\n self.animations[self.current_weapon as usize].get_current_texture_id(),\\n\\n ),\\n\\n false,\\n\\n );\\n\\n self.shadows.set_texture(\\n\\n self.texture_loader\\n\\n .get_texture(self.shadows_id[self.current_weapon as usize]),\\n\\n false,\\n\\n );\\n\\n render_window.draw(&self.weapons);\\n\\n render_window.draw(&self.shadows);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 51,\n \"score\": 10.079044808418702\n },\n {\n \"content\": \"//! Module for loading textures\\n\\n\\n\\nuse rsfml::{graphics::Texture, system::SfBox};\\n\\n\\n\\npub struct TextureLoader {\\n\\n textures: Vec<SfBox<Texture>>,\\n\\n}\\n\\n\\n\\nimpl TextureLoader {\\n\\n pub fn new() -> TextureLoader {\\n\\n TextureLoader {\\n\\n textures: Vec::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn load_texture(&mut self, texture_path: &str) -> Result<(), String> {\\n\\n let texture = Texture::from_file(texture_path);\\n\\n\\n\\n if let Some(tex) = texture {\\n\\n self.textures.push(tex);\\n\",\n \"file_path\": \"src/texture_loader.rs\",\n \"rank\": 52,\n \"score\": 9.867385948371863\n },\n {\n \"content\": \" }\\n\\n _ => {}\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_mode(&mut self, new_mode: AnimationPlayMode) -> () {\\n\\n self.mode = new_mode;\\n\\n }\\n\\n\\n\\n pub fn get_state(&self) -> AnimationState {\\n\\n self.state\\n\\n }\\n\\n\\n\\n pub fn get_mode(&self) -> AnimationPlayMode {\\n\\n self.mode\\n\\n }\\n\\n\\n\\n pub fn set_lag(&mut self, new_lag: f32) -> () {\\n\\n self.lag = new_lag\\n\\n }\\n\",\n \"file_path\": \"src/animation.rs\",\n \"rank\": 53,\n \"score\": 9.172141781463017\n },\n {\n \"content\": \" self.fps_handler.as_mut().unwrap().update();\\n\\n }\\n\\n\\n\\n pub fn draw(&mut self) {\\n\\n self.render_window.clear(self.clear_color);\\n\\n self.game_mode.draw(&mut self.render_window);\\n\\n if let Some(_) = self.fps_handler {\\n\\n self.fps_handler\\n\\n .as_mut()\\n\\n .unwrap()\\n\\n .draw(&mut self.render_window)\\n\\n };\\n\\n self.render_window.display();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/game.rs\",\n \"rank\": 54,\n \"score\": 9.12664544648493\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn update_reload<'r>(&'r mut self, event_handler: &EventHandler) {\\n\\n if event_handler.is_key_pressed(Key::E) {\\n\\n self.animations\\n\\n .get_mut(self.current_weapon as usize)\\n\\n .unwrap()\\n\\n .set_state(AnimationState::Play);\\n\\n }\\n\\n }\\n\\n\\n\\n fn update_action<'r>(&'r mut self, event_handler: &EventHandler) {\\n\\n if !self.mouse_fire {\\n\\n if let Some(_) = event_handler.get_mouse_button_pressed_event(MouseButton::Left) {\\n\\n self.animations\\n\\n .get_mut(self.current_weapon as usize)\\n\\n .unwrap()\\n\\n .set_state(AnimationState::Play);\\n\\n self.mouse_fire = true\\n\\n };\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 55,\n \"score\": 9.03242991108431\n },\n {\n \"content\": \" Ok(())\\n\\n } else {\\n\\n Err(format!(\\\"ERROR: Failed to load texture {}\\\", texture_path))\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn get_texture(&self, index: i32) -> &Texture {\\n\\n &self.textures[index as usize]\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/texture_loader.rs\",\n \"rank\": 58,\n \"score\": 8.72356279604574\n },\n {\n \"content\": \" pub fn new(\\n\\n render_window: RenderWindow,\\n\\n texture_loader: &'s TextureLoader,\\n\\n no_ground: bool,\\n\\n ) -> GameLoop<'s> {\\n\\n let tmp_size = render_window.size();\\n\\n GameLoop {\\n\\n render_window,\\n\\n fps_handler: None,\\n\\n event_handler: EventHandler::new(),\\n\\n clear_color: Color::rgb(3, 64, 59),\\n\\n game_mode: GameMode::new(tmp_size, texture_loader, no_ground),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn activate_FPS(&mut self, font: &'s Font) {\\n\\n if let None = self.fps_handler {\\n\\n self.fps_handler = Some(FPSHandler::new(font))\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/game.rs\",\n \"rank\": 59,\n \"score\": 8.490348060878041\n },\n {\n \"content\": \" background: RectangleShape::new(),\\n\\n hud_vertex_array: array,\\n\\n face: tmp_face,\\n\\n face_animation: Animation::new(\\n\\n vec![40, 41, 42],\\n\\n AnimationState::Play,\\n\\n AnimationPlayMode::Once,\\n\\n 1.,\\n\\n 0,\\n\\n ),\\n\\n texture_loader,\\n\\n face_clock: Clock::start(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn update(&mut self) {\\n\\n self.background\\n\\n .set_size(Vector2f::new(self.window_size.x - 21., 59.));\\n\\n self.background.set_fill_color(Color::rgb(6, 1, 162));\\n\\n self.background\\n\",\n \"file_path\": \"src/hud.rs\",\n \"rank\": 60,\n \"score\": 8.177154628902956\n },\n {\n \"content\": \" } if code == key => Some((code, alt, ctrl, shift, system)),\\n\\n _ => None,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn has_mouse_wheel_moved_event(&self) -> Option<(i32, i32, i32)> {\\n\\n self.events.iter().find_map(|ev| match *ev {\\n\\n Event::MouseWheelScrolled {\\n\\n wheel: _,\\n\\n delta,\\n\\n x,\\n\\n y,\\n\\n } => Some((delta as i32, x, y)),\\n\\n _ => None,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_mouse_button_pressed_event(\\n\\n &self,\\n\\n mouse_button: MouseButton,\\n\",\n \"file_path\": \"src/event_handler.rs\",\n \"rank\": 62,\n \"score\": 8.01173817518543\n },\n {\n \"content\": \"#![allow(non_snake_case)]\\n\\n\\n\\npub mod animation;\\n\\npub mod event_handler;\\n\\npub mod fps;\\n\\npub mod game;\\n\\npub mod game_mode;\\n\\npub mod hud;\\n\\npub mod map;\\n\\npub mod mini_map;\\n\\npub mod raycasting_engine;\\n\\npub mod texture_loader;\\n\\npub mod weapon;\\n\\n\\n\\nuse std::error::Error;\\n\\nuse std::fs;\\n\\nuse std::path::Path;\\n\\n\\n\\nuse texture_loader::TextureLoader;\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 63,\n \"score\": 7.904062708463769\n },\n {\n \"content\": \"#![allow(non_snake_case)]\\n\\n\\n\\nuse rsfml::{\\n\\n graphics::{Font, RenderWindow},\\n\\n system::Vector2i,\\n\\n window::{ContextSettings, Style, VideoMode},\\n\\n};\\n\\nuse rustenstein3D::game::GameLoop;\\n\\nuse rustenstein3D::{load_texture, parse_arguments, Arguments, ParsedResult, RESOURCES_BASE_PATH};\\n\\n\\n\\n#[cfg(target_os = \\\"macos\\\")]\\n\\n#[start]\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 64,\n \"score\": 7.786156778315804\n },\n {\n \"content\": \"\\n\\n fn initialize_weapons(window_size: &Vector2f) -> RectangleShape<'s> {\\n\\n let mut tmp_weapon = RectangleShape::with_size(Vector2f { x: 400., y: 400. });\\n\\n tmp_weapon.set_position(Vector2f::new(\\n\\n window_size.x / 2. - 200.,\\n\\n window_size.y - 400. - 81.,\\n\\n ));\\n\\n tmp_weapon\\n\\n }\\n\\n\\n\\n fn initialize_shadows(window_size: &Vector2f) -> RectangleShape<'s> {\\n\\n let mut tmp_shadow = RectangleShape::with_size(Vector2f { x: 99., y: 48. });\\n\\n tmp_shadow.set_position(Vector2f::new(window_size.x - 115., window_size.y - 66.));\\n\\n tmp_shadow\\n\\n }\\n\\n\\n\\n fn create_animation_by_range(texture_id_range: Range<i32>) -> Animation {\\n\\n Animation::new(\\n\\n texture_id_range.collect(),\\n\\n AnimationState::Stop,\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 65,\n \"score\": 7.595845257013101\n },\n {\n \"content\": \" ) -> Option<(MouseButton, i32, i32)> {\\n\\n self.events.iter().find_map(|ev| match *ev {\\n\\n Event::MouseButtonPressed { button, x, y } if mouse_button == button => {\\n\\n Some((button, x, y))\\n\\n }\\n\\n _ => None,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn get_mouse_button_released_event(\\n\\n &self,\\n\\n mouse_button: MouseButton,\\n\\n ) -> Option<(MouseButton, i32, i32)> {\\n\\n self.events.iter().find_map(|ev| match *ev {\\n\\n Event::MouseButtonReleased { button, x, y } if mouse_button == button => {\\n\\n Some((button, x, y))\\n\\n }\\n\\n _ => None,\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"src/event_handler.rs\",\n \"rank\": 66,\n \"score\": 7.350396025380373\n },\n {\n \"content\": \" render_window.draw(&self.hud_vertex_array);\\n\\n }\\n\\n\\n\\n pub fn draw(&mut self, render_window: &mut RenderWindow) {\\n\\n render_window.draw(&self.background);\\n\\n let window_x = self.window_size.x;\\n\\n let window_y = self.window_size.y;\\n\\n self.draw_2line(\\n\\n [\\n\\n window_x - 9.,\\n\\n window_x - 9.,\\n\\n 9.,\\n\\n window_y - 70.,\\n\\n window_y - 10.,\\n\\n window_y - 10.,\\n\\n ],\\n\\n &Color::rgba(255, 255, 255, 75),\\n\\n render_window,\\n\\n );\\n\\n self.draw_2line(\\n\",\n \"file_path\": \"src/hud.rs\",\n \"rank\": 67,\n \"score\": 7.221571335748709\n },\n {\n \"content\": \"pub const RESOURCES_BASE_PATH: &'static str = \\\"resources\\\";\\n\\n\\n\\npub struct Arguments {\\n\\n pub window_dimensions: (u32, u32),\\n\\n pub no_ground: bool,\\n\\n pub framerate_limit: u32,\\n\\n}\\n\\n\\n\\npub enum ParsedResult {\\n\\n Success,\\n\\n Parsed(Arguments),\\n\\n Failure(String),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 68,\n \"score\": 7.07240488556225\n },\n {\n \"content\": \" pub fn has_closed_event(&self) -> bool {\\n\\n self.events.iter().any(|ev| *ev == Event::Closed)\\n\\n }\\n\\n\\n\\n pub fn has_gained_focus_event(&self) -> bool {\\n\\n self.events.iter().any(|ev| *ev == Event::GainedFocus)\\n\\n }\\n\\n\\n\\n pub fn has_lost_focus_event(&self) -> bool {\\n\\n self.events.iter().any(|ev| *ev == Event::LostFocus)\\n\\n }\\n\\n\\n\\n pub fn has_text_entered(&self) -> Option<char> {\\n\\n self.events.iter().find_map(|ev| match *ev {\\n\\n Event::TextEntered { unicode } => Some(unicode),\\n\\n _ => None,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn has_key_pressed_event(&self, key: Key) -> Option<(Key, bool, bool, bool, bool)> {\\n\",\n \"file_path\": \"src/event_handler.rs\",\n \"rank\": 69,\n \"score\": 7.049330236229626\n },\n {\n \"content\": \" AnimationPlayMode::Once,\\n\\n 0.07,\\n\\n 3,\\n\\n )\\n\\n }\\n\\n\\n\\n fn initialize_animation() -> Vec<Animation> {\\n\\n let mut animations = Vec::new();\\n\\n animations.push(Weapon::create_animation_by_range(12..18));\\n\\n animations.push(Weapon::create_animation_by_range(19..25));\\n\\n animations.push(Weapon::create_animation_by_range(26..32));\\n\\n animations.push(Weapon::create_animation_by_range(33..39));\\n\\n animations\\n\\n }\\n\\n\\n\\n fn update_animations<'r>(&'r mut self) {\\n\\n self.animations\\n\\n .get_mut(self.current_weapon as usize)\\n\\n .unwrap()\\n\\n .update();\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 70,\n \"score\": 6.999712420256095\n },\n {\n \"content\": \" /// `font` - The font to render the text on the window.\\n\\n pub fn new(font: &'t Font) -> FPSHandler<'t> {\\n\\n let mut t = Text::new(\\\"0\\\", font, 20);\\n\\n t.set_position(Vector2f::new(10., 10.));\\n\\n t.set_fill_color(Color::WHITE);\\n\\n FPSHandler {\\n\\n fps_clock: Clock::start(),\\n\\n text: t,\\n\\n images: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Update internal data of the FPSHandler\\n\\n ///\\n\\n /// Call this function at each end of the loop to update FPSHandler internal data.\\n\\n pub fn update(&mut self) {\\n\\n if self.fps_clock.elapsed_time().as_seconds() >= 0.33 {\\n\\n self.text.set_string((self.images * 3).to_string().as_str());\\n\\n self.images = 0;\\n\\n self.fps_clock.restart();\\n\",\n \"file_path\": \"src/fps.rs\",\n \"rank\": 71,\n \"score\": 6.76450981086831\n },\n {\n \"content\": \" } else if let Some(_) = event_handler.get_mouse_button_released_event(MouseButton::Left) {\\n\\n self.mouse_fire = false\\n\\n } else {\\n\\n self.animations\\n\\n .get_mut(self.current_weapon as usize)\\n\\n .unwrap()\\n\\n .set_state(AnimationState::Play)\\n\\n };\\n\\n }\\n\\n\\n\\n fn update_selection<'r>(&'r mut self, event_handler: &EventHandler) {\\n\\n if let Some(_) = event_handler.has_key_pressed_event(Key::Num1) {\\n\\n self.current_weapon = 0\\n\\n };\\n\\n if let Some(_) = event_handler.has_key_pressed_event(Key::Num2) {\\n\\n self.current_weapon = 1\\n\\n };\\n\\n if let Some(_) = event_handler.has_key_pressed_event(Key::Num3) {\\n\\n self.current_weapon = 2\\n\\n };\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 72,\n \"score\": 6.571705155693365\n },\n {\n \"content\": \" self.events.iter().find_map(|ev| match *ev {\\n\\n Event::KeyPressed {\\n\\n code,\\n\\n alt,\\n\\n ctrl,\\n\\n shift,\\n\\n system,\\n\\n } if code == key => Some((code, alt, ctrl, shift, system)),\\n\\n _ => None,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn has_key_released_event(&self, key: Key) -> Option<(Key, bool, bool, bool, bool)> {\\n\\n self.events.iter().find_map(|ev| match *ev {\\n\\n Event::KeyReleased {\\n\\n code,\\n\\n alt,\\n\\n ctrl,\\n\\n shift,\\n\\n system,\\n\",\n \"file_path\": \"src/event_handler.rs\",\n \"rank\": 73,\n \"score\": 6.328772935331427\n },\n {\n \"content\": \"//! Module for animation management\\n\\n\\n\\nuse rsfml::system::Clock;\\n\\n\\n\\n#[derive(PartialEq, Eq, Clone, Copy)]\\n\\npub enum AnimationState {\\n\\n Play,\\n\\n Pause,\\n\\n Stop,\\n\\n}\\n\\n\\n\\n#[derive(PartialEq, Eq, Clone, Copy)]\\n\\npub enum AnimationPlayMode {\\n\\n Once,\\n\\n Infinite,\\n\\n}\\n\\n\\n\\npub struct Animation {\\n\\n a: u32,\\n\\n b: u32,\\n\",\n \"file_path\": \"src/animation.rs\",\n \"rank\": 74,\n \"score\": 6.275553140676789\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<'s> Weapon<'s> {\\n\\n /// Instantiates a new Weapon.\\n\\n ///\\n\\n /// # Arguments\\n\\n /// `window_size` - The size of the window to draw the weapons onto\\n\\n ///\\n\\n /// `texture_loader` - A [TextureLoader] to obtain weapon textures from\\n\\n pub fn new(window_size: &Vector2f, texture_loader: &'s TextureLoader) -> Weapon<'s> {\\n\\n Weapon {\\n\\n weapons: Weapon::initialize_weapons(window_size),\\n\\n animations: Weapon::initialize_animation(),\\n\\n texture_loader,\\n\\n shadows: Weapon::initialize_shadows(window_size),\\n\\n shadows_id: vec![18, 25, 32, 39],\\n\\n current_weapon: 0,\\n\\n mouse_fire: false,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 75,\n \"score\": 5.362393412825686\n },\n {\n \"content\": \"\\n\\n pub fn deactivate_FPS(&mut self) {\\n\\n if let Some(_) = self.fps_handler {\\n\\n self.fps_handler = None\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) {\\n\\n while self.render_window.is_open() {\\n\\n self.update();\\n\\n self.draw();\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn update(&mut self) {\\n\\n self.event_handler.update_events(&mut self.render_window);\\n\\n if self.event_handler.has_closed_event() || self.event_handler.is_key_pressed(Key::Escape) {\\n\\n self.render_window.close();\\n\\n }\\n\\n self.game_mode.update(&self.event_handler);\\n\",\n \"file_path\": \"src/game.rs\",\n \"rank\": 76,\n \"score\": 5.048388803094471\n },\n {\n \"content\": \" pub fn get_events(&self) -> Vec<Event> {\\n\\n self.events.clone()\\n\\n }\\n\\n\\n\\n pub fn update_events(&mut self, render_window: &mut RenderWindow) -> () {\\n\\n self.events.clear();\\n\\n while let Some(ev) = render_window.poll_event() {\\n\\n self.events.push(ev)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n// TODO IMPLEMENT FUNCTION FOR JOYSTICK HANDLE\\n\\n// JoystickButtonPressed { joystickid : int, button : int },\\n\\n// JoystickButtonReleased { joystickid : int, button : int },\\n\\n// JoystickMoved { joystickid : uint, axis : Axis, position : float },\\n\\n// JoystickConnected { joystickid : uint },\\n\\n// JoystickDisconnected { joystickid : uint },\\n\",\n \"file_path\": \"src/event_handler.rs\",\n \"rank\": 77,\n \"score\": 4.874394391417158\n },\n {\n \"content\": \" render_window.set_mouse_cursor_visible(false);\\n\\n\\n\\n // set the mouse positon on the center of the window\\n\\n render_window.set_mouse_position(Vector2i::new(width as i32 / 2, height as i32 / 2));\\n\\n\\n\\n // Create the font for the FPS_handler.\\n\\n let font = Font::from_file(&format!(\\\"{}/sansation.ttf\\\", RESOURCES_BASE_PATH))\\n\\n .ok_or(\\\"ERROR: Cannot load font! Font (resources/sansation.ttf) does not exist!\\\")?;\\n\\n\\n\\n // Create the texture loader and load textures\\n\\n let texture_loader = match load_texture() {\\n\\n Ok(tl) => tl,\\n\\n Err(err) => return Err(err.to_string()),\\n\\n };\\n\\n\\n\\n // Create the game_loop and activate the fps handler.\\n\\n let mut game_loop = GameLoop::new(render_window, &texture_loader, no_ground);\\n\\n game_loop.activate_FPS(&font);\\n\\n\\n\\n game_loop.run();\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 78,\n \"score\": 4.63248895776503\n },\n {\n \"content\": \" offset,\\n\\n texture_ids,\\n\\n state,\\n\\n mode,\\n\\n lag,\\n\\n current_texture: 0,\\n\\n clock: Clock::start(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_state(&mut self, new_state: AnimationState) -> () {\\n\\n self.state = new_state;\\n\\n match new_state {\\n\\n AnimationState::Stop => {\\n\\n self.current_texture = 0;\\n\\n self.clock.restart();\\n\\n }\\n\\n AnimationState::Play if self.offset <= self.current_texture => {\\n\\n self.current_texture = self.a;\\n\\n self.clock.restart();\\n\",\n \"file_path\": \"src/animation.rs\",\n \"rank\": 79,\n \"score\": 4.542070270510915\n },\n {\n \"content\": \" }\\n\\n self.images += 1;\\n\\n }\\n\\n\\n\\n /// Draw the current FPS on the left bottom of the window\\n\\n ///\\n\\n /// # Arguments\\n\\n /// `&mut render_window` - The window to draw onto\\n\\n pub fn draw(&self, render_window: &mut RenderWindow) {\\n\\n render_window.draw(&self.text)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/fps.rs\",\n \"rank\": 80,\n \"score\": 4.262456901776284\n },\n {\n \"content\": \" &Color::BLACK,\\n\\n render_window,\\n\\n );\\n\\n self.draw_2line(\\n\\n [\\n\\n 11.,\\n\\n 11.,\\n\\n window_x - 11.,\\n\\n window_y - 11.,\\n\\n window_y - 69.,\\n\\n window_y - 69.,\\n\\n ],\\n\\n &Color::rgba(255, 255, 255, 75),\\n\\n render_window,\\n\\n );\\n\\n self.draw_line(\\n\\n [window_x, 0., window_y - 80., window_y - 80.],\\n\\n &Color::rgba(255, 255, 255, 50),\\n\\n render_window,\\n\\n );\\n\\n self.draw_line(\\n\\n [window_x, 0., window_y - 79., window_y - 79.],\\n\\n &Color::rgba(255, 255, 255, 75),\\n\\n render_window,\\n\\n );\\n\\n render_window.draw(&self.face);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/hud.rs\",\n \"rank\": 81,\n \"score\": 3.1036862283454063\n },\n {\n \"content\": \" if let Some(_) = event_handler.has_key_pressed_event(Key::Num4) {\\n\\n self.current_weapon = 3\\n\\n };\\n\\n }\\n\\n\\n\\n /// Updates the weapon state\\n\\n ///\\n\\n /// # Arguments\\n\\n /// `event_handler` - The event handler to read input from to update state\\n\\n pub fn update<'r>(&'r mut self, event_handler: &'r EventHandler) -> () {\\n\\n self.update_selection(event_handler);\\n\\n\\n\\n self.update_action(event_handler);\\n\\n\\n\\n self.update_reload(event_handler);\\n\\n\\n\\n self.update_animations();\\n\\n }\\n\\n\\n\\n /// Updates the weapon animation on the next frame\\n\",\n \"file_path\": \"src/weapon.rs\",\n \"rank\": 82,\n \"score\": 2.740843130013035\n },\n {\n \"content\": \" [\\n\\n window_x - 11.,\\n\\n window_x - 11.,\\n\\n 11.,\\n\\n window_y - 70.,\\n\\n window_y - 12.,\\n\\n window_y - 12.,\\n\\n ],\\n\\n &Color::BLACK,\\n\\n render_window,\\n\\n );\\n\\n self.draw_2line(\\n\\n [\\n\\n 9.,\\n\\n 9.,\\n\\n window_x - 9.,\\n\\n window_y - 12.,\\n\\n window_y - 71.,\\n\\n window_y - 71.,\\n\\n ],\\n\",\n \"file_path\": \"src/hud.rs\",\n \"rank\": 83,\n \"score\": 2.3829201002030223\n },\n {\n \"content\": \" return;\\n\\n }\\n\\n\\n\\n if self.current_texture != self.texture_ids.len() as u32 - 1 {\\n\\n self.current_texture += 1;\\n\\n } else {\\n\\n self.current_texture = 0;\\n\\n if let AnimationPlayMode::Once = self.mode {\\n\\n self.state = AnimationState::Stop\\n\\n }\\n\\n }\\n\\n\\n\\n self.clock.restart();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/animation.rs\",\n \"rank\": 84,\n \"score\": 2.2157003342273014\n },\n {\n \"content\": \"# Rustenstein3D\\n\\n\\n\\nSimple Wolfenstein3D engine in rust.\\n\\n\\n\\n## Build Instructions\\n\\n\\n\\n1. Clone the repository\\n\\n2. Run `cargo check` to pre-build the project\\n\\n3. Windows:\\n\\n 1. Download [SFML2](https://www.sfml-dev.org/download/sfml/2.5.1/) and [CSFML2](https://www.sfml-dev.org/download/csfml/)\\n\\n 2. Copy the `.lib` files from the `lib` folders in (C)SFML to your toolchain.\\n\\n - `C:\\\\Users\\\\[USERNAME]\\\\.rustup\\\\toolchains\\\\[RUST_TOOLCHAIN]\\\\lib\\\\rustlib\\\\[MSVC_TOOLCHAIN]\\\\lib`\\n\\n 3. Copy the `.dll` files from the `bin` folders in CSFML to the `target/[debug/release]` folders.\\n\\n4. Macintosh:\\n\\n 1. TODO\\n\\n5. Linux:\\n\\n 1. TODO\\n\\n6. Use `cargo run` to run Rustenstein3D.\\n\\n - Use `cargo run -- -w \\\"[WIDTH]\\\" \\\"[HEIGHT]\\\"` for a custom window size.\\n\\n\\n\\n## Screenshot\\n\\n\\n\\n![rustenstein screenshot](resources/screen.png \\\"rustenstein3D screenshot\\\")\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 85,\n \"score\": 1.6736202865518233\n }\n]","isConversational":false}}},{"rowIdx":2981,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"datafusion/src/logical_plan/window_frames.rs"},"repo_name":{"kind":"string","value":"cube-js/arrow-datafusion"},"commit":{"kind":"string","value":"4e9d31e05b69017d972ae4c1ffbeeaab163fd654"},"file_code":{"kind":"string","value":"\n\nuse crate::error::{DataFusionError, Result};\nuse crate::execution::context::ExecutionContextState;\nuse crate::logical_plan::Expr;\nuse crate::scalar::ScalarValue;\nuse crate::sql::planner::SqlToRel;\nuse serde_derive::{Deserialize, Serialize};\nuse sqlparser::ast;\nuse sqlparser::ast::DateTimeField;\nuse std::cmp::Ordering;\nuse std::convert::TryInto;\nuse std::convert::{From, TryFrom};\nuse std::fmt;\n\n#[derive(Debug, Clone, PartialEq)]\npub struct WindowFrame {\n \n pub units: WindowFrameUnits,\n \n pub start_bound: WindowFrameBound,\n \n pub end_bound: WindowFrameBound,\n}\n\nimpl fmt::Display for WindowFrame {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(\n f,\n \"{} BETWEEN {} AND {}\",\n self.units, self.start_bound, self.end_bound\n )?;\n Ok(())\n }\n}\n\nimpl TryFrom<ast::WindowFrame> for WindowFrame {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrame) -> Result<Self> {\n let start_bound = value.start_bound.try_into()?;\n let end_bound = value\n .end_bound\n .map(WindowFrameBound::try_from)\n .unwrap_or(Ok(WindowFrameBound::CurrentRow))?;\n check_window_bound_order(&start_bound, &end_bound)?;\n\n let is_allowed_range_bound = |s: &ScalarValue| match s {\n ScalarValue::Int64(Some(i)) => *i == 0,\n _ => false,\n };\n\n let units = value.units.into();\n if units == WindowFrameUnits::Range {\n for bound in &[&start_bound, &end_bound] {\n match bound {\n WindowFrameBound::Preceding(Some(v))\n | WindowFrameBound::Following(Some(v)) if !is_allowed_range_bound(v) => {\n Err(DataFusionError::NotImplemented(format!(\n \"With WindowFrameUnits={}, the bound cannot be {} PRECEDING or FOLLOWING at the moment\",\n units, v\n )))\n }\n _ => Ok(()),\n }?;\n }\n }\n Ok(Self {\n units,\n start_bound,\n end_bound,\n })\n }\n}\n\n#[allow(missing_docs)]\npub fn check_window_bound_order(\n start_bound: &WindowFrameBound,\n end_bound: &WindowFrameBound,\n) -> Result<()> {\n if let WindowFrameBound::Following(None) = start_bound {\n Err(DataFusionError::Execution(\n \"Invalid window frame: start bound cannot be unbounded following\".to_owned(),\n ))\n } else if let WindowFrameBound::Preceding(None) = end_bound {\n Err(DataFusionError::Execution(\n \"Invalid window frame: end bound cannot be unbounded preceding\".to_owned(),\n ))\n } else {\n match start_bound.logical_cmp(&end_bound) {\n None => Err(DataFusionError::Execution(format!(\n \"Invalid window frame: start bound ({}) is incompatble with the end bound ({})\",\n start_bound, end_bound\n ))),\n Some(o) if o > Ordering::Equal => Err(DataFusionError::Execution(format!(\n \"Invalid window frame: start bound ({}) cannot be larger than end bound ({})\",\n start_bound, end_bound\n ))),\n Some(_) => Ok(()),\n }\n }\n}\n\nimpl Default for WindowFrame {\n fn default() -> Self {\n WindowFrame {\n units: WindowFrameUnits::Range,\n start_bound: WindowFrameBound::Preceding(None),\n end_bound: WindowFrameBound::CurrentRow,\n }\n }\n}\n\n#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]\npub enum WindowFrameBound {\n \n \n \n \n \n \n Preceding(Option<ScalarValue>),\n \n \n \n \n \n \n CurrentRow,\n \n \n \n \n \n Following(Option<ScalarValue>),\n}\n\nimpl TryFrom<ast::WindowFrameBound> for WindowFrameBound {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrameBound) -> Result<Self> {\n let value_to_scalar = |v| -> Result<_> {\n match v {\n None => Ok(None),\n Some(ast::Value::Number(v, _)) => match v.parse() {\n Err(_) => Err(DataFusionError::Plan(format!(\"could not convert window frame bound '{}' to int64\", v))),\n Ok(v) => Ok(Some(ScalarValue::Int64(Some(v)))),\n },\n Some(ast::Value::Interval { value, leading_field, leading_precision, last_field, fractional_seconds_precision })\n => Ok(Some(interval_to_scalar(&value, &leading_field, &leading_precision, &last_field, &fractional_seconds_precision)?)),\n Some(o) => Err(DataFusionError::Plan(format!(\"window frame bound must be a positive integer or an INTERVAL, got {}\", o))),\n }\n };\n\n match value {\n ast::WindowFrameBound::Preceding(v) => {\n Ok(Self::Preceding(value_to_scalar(v)?))\n }\n ast::WindowFrameBound::Following(v) => {\n Ok(Self::Following(value_to_scalar(v)?))\n }\n ast::WindowFrameBound::CurrentRow => Ok(Self::CurrentRow),\n }\n }\n}\n\nfn interval_to_scalar(\n value: &str,\n leading_field: &Option<DateTimeField>,\n leading_precision: &Option<u64>,\n last_field: &Option<DateTimeField>,\n fractional_seconds_precision: &Option<u64>,\n) -> Result<ScalarValue> {\n match SqlToRel::<ExecutionContextState>::sql_interval_to_literal(\n value,\n leading_field,\n leading_precision,\n last_field,\n fractional_seconds_precision,\n )? {\n Expr::Literal(v) => Ok(v),\n o => panic!(\"unexpected result of interval_to_literal: {:?}\", o),\n }\n}\n\nimpl fmt::Display for WindowFrameBound {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n match self {\n WindowFrameBound::CurrentRow => f.write_str(\"CURRENT ROW\"),\n WindowFrameBound::Preceding(None) => f.write_str(\"UNBOUNDED PRECEDING\"),\n WindowFrameBound::Following(None) => f.write_str(\"UNBOUNDED FOLLOWING\"),\n WindowFrameBound::Preceding(Some(n)) => write!(f, \"{} PRECEDING\", n),\n WindowFrameBound::Following(Some(n)) => write!(f, \"{} FOLLOWING\", n),\n }\n }\n}\n\nimpl WindowFrameBound {\n \n \n pub fn logical_cmp(&self, other: &Self) -> Option<Ordering> {\n use WindowFrameBound::{CurrentRow, Following, Preceding};\n let ord = |v: &WindowFrameBound| match v {\n Preceding(_) => 0,\n CurrentRow => 1,\n Following(_) => 2,\n };\n\n let lo = ord(self);\n let ro = ord(other);\n let o = lo.cmp(&ro);\n if o != Ordering::Equal {\n return Some(o);\n }\n\n let (l, r) = match (self, other) {\n (Preceding(Some(l)), Preceding(Some(r))) => (r, l), \n (Following(Some(l)), Following(Some(r))) => (l, r),\n\n (CurrentRow, CurrentRow) => return Some(Ordering::Equal),\n\n (Preceding(None), Preceding(None)) => return Some(Ordering::Equal),\n (Preceding(None), Preceding(Some(_))) => return Some(Ordering::Less),\n (Preceding(Some(_)), Preceding(None)) => return Some(Ordering::Greater),\n\n (Following(None), Following(None)) => return Some(Ordering::Equal),\n (Following(Some(_)), Following(None)) => return Some(Ordering::Less),\n (Following(None), Following(Some(_))) => return Some(Ordering::Greater),\n _ => panic!(\"unhandled bounds: {} and {}\", self, other),\n };\n\n match (l, r) {\n (ScalarValue::Int64(Some(l)), ScalarValue::Int64(Some(r))) => Some(l.cmp(r)),\n (\n ScalarValue::IntervalDayTime(Some(l)),\n ScalarValue::IntervalDayTime(Some(r)),\n ) => Some(l.cmp(r)),\n (\n ScalarValue::IntervalYearMonth(Some(l)),\n ScalarValue::IntervalYearMonth(Some(r)),\n ) => Some(l.cmp(r)),\n \n _ => None,\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\npub enum WindowFrameUnits {\n \n \n Rows,\n \n \n \n \n \n Range,\n \n \n \n Groups,\n}\n\nimpl fmt::Display for WindowFrameUnits {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n f.write_str(match self {\n WindowFrameUnits::Rows => \"ROWS\",\n WindowFrameUnits::Range => \"RANGE\",\n WindowFrameUnits::Groups => \"GROUPS\",\n })\n }\n}\n\nimpl From<ast::WindowFrameUnits> for WindowFrameUnits {\n fn from(value: ast::WindowFrameUnits) -> Self {\n match value {\n ast::WindowFrameUnits::Range => Self::Range,\n ast::WindowFrameUnits::Groups => Self::Groups,\n ast::WindowFrameUnits::Rows => Self::Rows,\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_window_frame_creation() -> Result<()> {\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Following(None),\n end_bound: None,\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"Execution error: Invalid window frame: start bound cannot be unbounded following\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Preceding(None),\n end_bound: Some(ast::WindowFrameBound::Preceding(None)),\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"Execution error: Invalid window frame: end bound cannot be unbounded preceding\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Preceding(Some(1)),\n end_bound: Some(ast::WindowFrameBound::Preceding(Some(2))),\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"Execution error: Invalid window frame: start bound (1 PRECEDING) cannot be larger than end bound (2 PRECEDING)\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Preceding(Some(2)),\n end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"This feature is not implemented: With WindowFrameUnits=RANGE, the bound cannot be 2 PRECEDING or FOLLOWING at the moment\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Rows,\n start_bound: ast::WindowFrameBound::Preceding(Some(2)),\n end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),\n };\n let result = WindowFrame::try_from(window_frame);\n assert!(result.is_ok());\n Ok(())\n }\n\n #[test]\n fn test_eq() {\n assert_eq!(\n WindowFrameBound::Preceding(Some(0)),\n WindowFrameBound::CurrentRow\n );\n assert_eq!(\n WindowFrameBound::CurrentRow,\n WindowFrameBound::Following(Some(0))\n );\n assert_eq!(\n WindowFrameBound::Following(Some(2)),\n WindowFrameBound::Following(Some(2))\n );\n assert_eq!(\n WindowFrameBound::Following(None),\n WindowFrameBound::Following(None)\n );\n assert_eq!(\n WindowFrameBound::Preceding(Some(2)),\n WindowFrameBound::Preceding(Some(2))\n );\n assert_eq!(\n WindowFrameBound::Preceding(None),\n WindowFrameBound::Preceding(None)\n );\n }\n\n #[test]\n fn test_ord() {\n assert!(WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::CurrentRow);\n \n assert!(\n WindowFrameBound::Preceding(Some(2)) < WindowFrameBound::Preceding(Some(1))\n );\n assert!(\n WindowFrameBound::Preceding(Some(u64::MAX))\n < WindowFrameBound::Preceding(Some(u64::MAX - 1))\n );\n assert!(\n WindowFrameBound::Preceding(None)\n < WindowFrameBound::Preceding(Some(1000000))\n );\n assert!(\n WindowFrameBound::Preceding(None)\n < WindowFrameBound::Preceding(Some(u64::MAX))\n );\n assert!(WindowFrameBound::Preceding(None) < WindowFrameBound::Following(Some(0)));\n assert!(\n WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::Following(Some(1))\n );\n assert!(WindowFrameBound::CurrentRow < WindowFrameBound::Following(Some(1)));\n assert!(\n WindowFrameBound::Following(Some(1)) < WindowFrameBound::Following(Some(2))\n );\n assert!(WindowFrameBound::Following(Some(2)) < WindowFrameBound::Following(None));\n assert!(\n WindowFrameBound::Following(Some(u64::MAX))\n < WindowFrameBound::Following(None)\n );\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::error::{DataFusionError, Result};\nuse crate::execution::context::ExecutionContextState;\nuse crate::logical_plan::Expr;\nuse crate::scalar::ScalarValue;\nuse crate::sql::planner::SqlToRel;\nuse serde_derive::{Deserialize, Serialize};\nuse sqlparser::ast;\nuse sqlparser::ast::DateTimeField;\nuse std::cmp::Ordering;\nuse std::convert::TryInto;\nuse std::convert::{From, TryFrom};\nuse std::fmt;\n\n#[derive(Debug, Clone, PartialEq)]\npub struct WindowFrame {\n \n pub units: WindowFrameUnits,\n \n pub start_bound: WindowFrameBound,\n \n pub end_bound: WindowFrameBound,\n}\n\nimpl fmt::Display for WindowFrame {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(\n f,\n \"{} BETWEEN {} AND {}\",\n self.units, self.start_bound, self.end_bound\n )?;\n Ok(())\n }\n}\n\nimpl TryFrom<ast::WindowFrame> for WindowFrame {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrame) -> Result<Self> {\n let start_bound = value.start_bound.try_into()?;\n let end_bound = value\n .end_bound\n .map(WindowFrameBound::try_from)\n .unwrap_or(Ok(WindowFrameBound::CurrentRow))?;\n check_window_bound_order(&start_bound, &end_bound)?;\n\n let is_allowed_range_bound = |s: &ScalarValue| match s {\n ScalarValue::Int64(Some(i)) => *i == 0,\n _ => false,\n };\n\n let units = value.units.into();\n if units == WindowFrameUnits::Range {\n for bound in &[&start_bound, &end_bound] {\n match bound {\n WindowFrameBound::Preceding(Some(v))\n | WindowFrameBound::Following(Some(v)) if !is_allowed_range_bound(v) => {\n Err(DataFusionError::NotImplemented(format!(\n \"With WindowFrameUnits={}, the bound cannot be {} PRECEDING or FOLLOWING at the moment\",\n units, v\n )))\n }\n _ => Ok(()),\n }?;\n }\n }\n Ok(Self {\n units,\n start_bound,\n end_bound,\n })\n }\n}\n\n#[allow(missing_docs)]\npub fn check_window_bound_order(\n start_bound: &WindowFrameBound,\n end_bound: &WindowFrameBound,\n) -> Result<()> {\n if let WindowFrameBound::Following(None) = start_bound {\n Err(DataFusionError::Execution(\n \"Invalid window frame: start bound cannot be unbounded following\".to_owned(),\n ))\n } else if let WindowFrameBound::Preceding(None) = end_bound {\n Err(DataFusionError::Execution(\n \"Invalid window frame: end bound cannot be unbounded preceding\".to_owned(),\n ))\n } else {\n match start_bound.logical_cmp(&end_bound) {\n None => Err(DataFusionError::Execution(format!(\n \"Invalid window frame: start bound ({}) is incompatble with the end bound ({})\",\n start_bound, end_bound\n ))),\n Some(o) if o > Ordering::Equal => Err(DataFusionError::Execution(format!(\n \"Invalid window frame: start bound ({}) cannot be larger than end bound ({})\",\n start_bound, end_bound\n ))),\n Some(_) => Ok(()),\n }\n }\n}\n\nimpl Default for WindowFrame {\n fn default() -> Self {\n WindowFrame {\n units: WindowFrameUnits::Range,\n start_bound: WindowFrameBound::Preceding(None),\n end_bound: WindowFrameBound::CurrentRow,\n }\n }\n}\n\n#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]\npub enum WindowFrameBound {\n \n \n \n \n \n \n Preceding(Option<ScalarValue>),\n \n \n \n \n \n \n CurrentRow,\n \n \n \n \n \n Following(Option<ScalarValue>),\n}\n\nimpl TryFrom<ast::WindowFrameBound> for WindowFrameBound {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrameBound) -> Result<Self> {\n let value_to_scalar = |v| -> Result<_> {\n match v {\n None => Ok(None),\n Some(ast::Value::Number(v, _)) => match v.parse() {\n Err(_) => Err(DataFusionError::Plan(format!(\"could not convert window frame bound '{}' to int64\", v))),\n Ok(v) => Ok(Some(ScalarValue::Int64(Some(v)))),\n },\n Some(ast::Value::Interval { value, leading_field, leading_precision, last_field, fractional_seconds_precision })\n => Ok(Some(interval_to_scalar(&value, &leading_field, &leading_precision, &last_field, &fractional_seconds_precision)?)),\n Some(o) => Err(DataFusionError::Plan(format!(\"window frame bound must be a positive integer or an INTERVAL, got {}\", o))),\n }\n };\n\n match value {\n ast::WindowFrameBound::Preceding(v) => {\n Ok(Self::Preceding(value_to_scalar(v)?))\n }\n ast::WindowFrameBound::Following(v) => {\n Ok(Self::Following(value_to_scalar(v)?))\n }\n ast::WindowFrameBound::CurrentRow => Ok(Self::CurrentRow),\n }\n }\n}\n\nfn interval_to_scalar(\n value: &str,\n leading_field: &Option<DateTimeField>,\n leading_precision: &Option<u64>,\n last_field: &Option<DateTimeField>,\n fractional_seconds_precision: &Option<u64>,\n) -> Result<ScalarValue> {\n match SqlToRel::<ExecutionContextState>::sql_interval_to_literal(\n value,\n leading_field,\n leading_precision,\n last_field,\n fractional_seconds_precision,\n )? {\n Expr::Literal(v) => Ok(v),\n o => panic!(\"unexpected result of interval_to_literal: {:?}\", o),\n }\n}\n\nimpl fmt::Display for WindowFrameBound {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n match self {\n WindowFrameBound::CurrentRow => f.write_str(\"CURRENT ROW\"),\n WindowFrameBound::Preceding(None) => f.write_str(\"UNBOUNDED PRECEDING\"),\n WindowFrameBound::Following(None) => f.write_str(\"UNBOUNDED FOLLOWING\"),\n WindowFrameBound::Preceding(Some(n)) => write!(f, \"{} PRECEDING\", n),\n WindowFrameBound::Following(Some(n)) => write!(f, \"{} FOLLOWING\", n),\n }\n }\n}\n\nimpl WindowFrameBound {\n \n \n pub fn logical_cmp(&self, other: &Self) -> Option<Ordering> {\n use WindowFrameBound::{CurrentRow, Following, Preceding};\n let ord = |v: &WindowFrameBound| match v {\n Preceding(_) => 0,\n CurrentRow => 1,\n Following(_) => 2,\n };\n\n let lo = ord(self);\n let ro = ord(other);\n let o = lo.cmp(&ro);\n if o != Ordering::Equal {\n return Some(o);\n }\n\n let (l, r) = match (self, other) {\n (Preceding(Some(l)), Preceding(Some(r))) => (r, l), \n (Following(Some(l)), Following(Some(r))) => (l, r),\n\n (CurrentRow, CurrentRow) => return Some(Ordering::Equal),\n\n (Preceding(None), Preceding(None)) => return Some(Ordering::Equal),\n (Preceding(None), Preceding(Some(_))) => return Some(Ordering::Less),\n (Preceding(Some(_)), Preceding(None)) => return Some(Ordering::Greater),\n\n (Following(None), Following(None)) => return Some(Ordering::Equal),\n (Following(Some(_)), Following(None)) => return Some(Ordering::Less),\n (Following(None), Following(Some(_))) => return Some(Ordering::Greater),\n _ => panic!(\"unhandled bounds: {} and {}\", self, other),\n };\n\n match (l, r) {\n (ScalarValue::Int64(Some(l)), ScalarValue::Int64(Some(r))) => Some(l.cmp(r)),\n (\n ScalarValue::IntervalDayTime(Some(l)),\n ScalarValue::IntervalDayTime(Some(r)),\n ) => Some(l.cmp(r)),\n (\n ScalarValue::IntervalYearMonth(Some(l)),\n ScalarValue::IntervalYearMonth(Some(r)),\n ) => Some(l.cmp(r)),\n \n _ => None,\n }\n }\n}\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\npub enum WindowFrameUnits {\n \n \n Rows,\n \n \n \n \n \n Range,\n \n \n \n Groups,\n}\n\nimpl fmt::Display for WindowFrameUnits {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n f.write_str("},"suffix":{"kind":"string","value":")\n }\n}\n\nimpl From<ast::WindowFrameUnits> for WindowFrameUnits {\n fn from(value: ast::WindowFrameUnits) -> Self {\n match value {\n ast::WindowFrameUnits::Range => Self::Range,\n ast::WindowFrameUnits::Groups => Self::Groups,\n ast::WindowFrameUnits::Rows => Self::Rows,\n }\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n\n #[test]\n fn test_window_frame_creation() -> Result<()> {\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Following(None),\n end_bound: None,\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"Execution error: Invalid window frame: start bound cannot be unbounded following\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Preceding(None),\n end_bound: Some(ast::WindowFrameBound::Preceding(None)),\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"Execution error: Invalid window frame: end bound cannot be unbounded preceding\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Preceding(Some(1)),\n end_bound: Some(ast::WindowFrameBound::Preceding(Some(2))),\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"Execution error: Invalid window frame: start bound (1 PRECEDING) cannot be larger than end bound (2 PRECEDING)\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Range,\n start_bound: ast::WindowFrameBound::Preceding(Some(2)),\n end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),\n };\n let result = WindowFrame::try_from(window_frame);\n assert_eq!(\n result.err().unwrap().to_string(),\n \"This feature is not implemented: With WindowFrameUnits=RANGE, the bound cannot be 2 PRECEDING or FOLLOWING at the moment\".to_owned()\n );\n\n let window_frame = ast::WindowFrame {\n units: ast::WindowFrameUnits::Rows,\n start_bound: ast::WindowFrameBound::Preceding(Some(2)),\n end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),\n };\n let result = WindowFrame::try_from(window_frame);\n assert!(result.is_ok());\n Ok(())\n }\n\n #[test]\n fn test_eq() {\n assert_eq!(\n WindowFrameBound::Preceding(Some(0)),\n WindowFrameBound::CurrentRow\n );\n assert_eq!(\n WindowFrameBound::CurrentRow,\n WindowFrameBound::Following(Some(0))\n );\n assert_eq!(\n WindowFrameBound::Following(Some(2)),\n WindowFrameBound::Following(Some(2))\n );\n assert_eq!(\n WindowFrameBound::Following(None),\n WindowFrameBound::Following(None)\n );\n assert_eq!(\n WindowFrameBound::Preceding(Some(2)),\n WindowFrameBound::Preceding(Some(2))\n );\n assert_eq!(\n WindowFrameBound::Preceding(None),\n WindowFrameBound::Preceding(None)\n );\n }\n\n #[test]\n fn test_ord() {\n assert!(WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::CurrentRow);\n \n assert!(\n WindowFrameBound::Preceding(Some(2)) < WindowFrameBound::Preceding(Some(1))\n );\n assert!(\n WindowFrameBound::Preceding(Some(u64::MAX))\n < WindowFrameBound::Preceding(Some(u64::MAX - 1))\n );\n assert!(\n WindowFrameBound::Preceding(None)\n < WindowFrameBound::Preceding(Some(1000000))\n );\n assert!(\n WindowFrameBound::Preceding(None)\n < WindowFrameBound::Preceding(Some(u64::MAX))\n );\n assert!(WindowFrameBound::Preceding(None) < WindowFrameBound::Following(Some(0)));\n assert!(\n WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::Following(Some(1))\n );\n assert!(WindowFrameBound::CurrentRow < WindowFrameBound::Following(Some(1)));\n assert!(\n WindowFrameBound::Following(Some(1)) < WindowFrameBound::Following(Some(2))\n );\n assert!(WindowFrameBound::Following(Some(2)) < WindowFrameBound::Following(None));\n assert!(\n WindowFrameBound::Following(Some(u64::MAX))\n < WindowFrameBound::Following(None)\n );\n }\n}\n"},"middle":{"kind":"string","value":"match self {\n WindowFrameUnits::Rows => \"ROWS\",\n WindowFrameUnits::Range => \"RANGE\",\n WindowFrameUnits::Groups => \"GROUPS\",\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"fn handle<F, R>(args: &[ColumnarValue], op: F, name: &str) -> Result<ColumnarValue>\n\nwhere\n\n R: AsRef<[u8]>,\n\n F: Fn(&str) -> R,\n\n{\n\n match &args[0] {\n\n ColumnarValue::Array(a) => match a.data_type() {\n\n DataType::Utf8 => {\n\n Ok(ColumnarValue::Array(Arc::new(unary_binary_function::<\n\n i32,\n\n _,\n\n _,\n\n >(\n\n &[a.as_ref()], op, name\n\n )?)))\n\n }\n\n DataType::LargeUtf8 => {\n\n Ok(ColumnarValue::Array(Arc::new(unary_binary_function::<\n\n i64,\n\n _,\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":0,"score":418480.6843065396},{"content":"fn handle<'a, F, R>(args: &'a [ColumnarValue], op: F, name: &str) -> Result<ColumnarValue>\n\nwhere\n\n R: AsRef<str>,\n\n F: Fn(&'a str) -> R,\n\n{\n\n match &args[0] {\n\n ColumnarValue::Array(a) => match a.data_type() {\n\n DataType::Utf8 => {\n\n Ok(ColumnarValue::Array(Arc::new(unary_string_function::<\n\n i32,\n\n i32,\n\n _,\n\n _,\n\n >(\n\n &[a.as_ref()], op, name\n\n )?)))\n\n }\n\n DataType::LargeUtf8 => {\n\n Ok(ColumnarValue::Array(Arc::new(unary_string_function::<\n\n i64,\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":1,"score":409128.00970623724},{"content":"/// Returns the datatype of the window function\n\npub fn return_type(fun: &WindowFunction, arg_types: &[DataType]) -> Result<DataType> {\n\n match fun {\n\n WindowFunction::AggregateFunction(fun) => aggregates::return_type(fun, arg_types),\n\n WindowFunction::BuiltInWindowFunction(fun) => {\n\n return_type_for_built_in(fun, arg_types)\n\n }\n\n }\n\n}\n\n\n\n/// Returns the datatype of the built-in window function\n\npub(super) fn return_type_for_built_in(\n\n fun: &BuiltInWindowFunction,\n\n arg_types: &[DataType],\n\n) -> Result<DataType> {\n\n // Note that this function *must* return the same type that the respective physical expression returns\n\n // or the execution panics.\n\n\n\n // verify that this is a valid set of data types for this function\n\n data_types(arg_types, &signature_for_built_in(fun))?;\n\n\n","file_path":"datafusion/src/physical_plan/window_functions.rs","rank":2,"score":375360.38169924164},{"content":"/// Returns a cloned `Expr`, but any of the `Expr`'s in the tree may be\n\n/// replaced/customized by the replacement function.\n\n///\n\n/// The replacement function is called repeatedly with `Expr`, starting with\n\n/// the argument `expr`, then descending depth-first through its\n\n/// descendants. The function chooses to replace or keep (clone) each `Expr`.\n\n///\n\n/// The function's return type is `Result<Option<Expr>>>`, where:\n\n///\n\n/// * `Ok(Some(replacement_expr))`: A replacement `Expr` is provided; it is\n\n/// swapped in at the particular node in the tree. Any nested `Expr` are\n\n/// not subject to cloning/replacement.\n\n/// * `Ok(None)`: A replacement `Expr` is not provided. The `Expr` is\n\n/// recreated, with all of its nested `Expr`'s subject to\n\n/// cloning/replacement.\n\n/// * `Err(err)`: Any error returned by the function is returned as-is by\n\n/// `clone_with_replacement()`.\n\npub fn clone_with_replacement<F>(expr: &Expr, replacement_fn: &F) -> Result<Expr>\n\nwhere\n\n F: Fn(&Expr) -> Result<Option<Expr>>,\n\n{\n\n let replacement_opt = replacement_fn(expr)?;\n\n\n\n match replacement_opt {\n\n // If we were provided a replacement, use the replacement. Do not\n\n // descend further.\n\n Some(replacement) => Ok(replacement),\n\n // No replacement was provided, clone the node and recursively call\n\n // clone_with_replacement() on any nested expressions.\n\n None => match expr {\n\n Expr::AggregateFunction {\n\n fun,\n\n args,\n\n distinct,\n\n } => Ok(Expr::AggregateFunction {\n\n fun: fun.clone(),\n\n args: args\n","file_path":"datafusion/src/sql/utils.rs","rank":3,"score":371345.7518967459},{"content":"#[allow(missing_docs)]\n\npub fn write_group_result_row(\n\n mode: AggregateMode,\n\n group_by_values: &[GroupByScalar],\n\n accumulator_set: &AccumulatorSet,\n\n key_fields: &[Field],\n\n key_columns: &mut Vec<Box<dyn ArrayBuilder>>,\n\n value_columns: &mut Vec<Box<dyn ArrayBuilder>>,\n\n) -> Result<()> {\n\n let add_key_columns = key_columns.is_empty();\n\n for i in 0..group_by_values.len() {\n\n match &group_by_values[i] {\n\n // Optimization to avoid allocation on conversion to ScalarValue.\n\n GroupByScalar::Utf8(str) => {\n\n if add_key_columns {\n\n key_columns.push(Box::new(StringBuilder::new(0)));\n\n }\n\n key_columns[i]\n\n .as_any_mut()\n\n .downcast_mut::<StringBuilder>()\n\n .unwrap()\n","file_path":"datafusion/src/physical_plan/hash_aggregate.rs","rank":4,"score":366401.78927313944},{"content":"/// Propagates current span to blocking operation. See [spawn] for details.\n\npub fn spawn_blocking<F, R>(f: F) -> JoinHandle<R>\n\nwhere\n\n F: FnOnce() -> R + Send + 'static,\n\n R: Send + 'static,\n\n{\n\n if let Some(s) = new_subtask_span() {\n\n tokio::task::spawn_blocking(move || {\n\n let _p = s.parent; // ensure parent stays alive.\n\n s.child.in_scope(f)\n\n })\n\n } else {\n\n tokio::task::spawn_blocking(f)\n\n }\n\n}\n\n\n","file_path":"datafusion/src/cube_ext/spawn.rs","rank":5,"score":351332.8371089396},{"content":"/// Convert SQL data type to relational representation of data type\n\npub fn convert_data_type(sql: &SQLDataType) -> Result<DataType> {\n\n match sql {\n\n SQLDataType::Boolean => Ok(DataType::Boolean),\n\n SQLDataType::SmallInt => Ok(DataType::Int16),\n\n SQLDataType::Int => Ok(DataType::Int32),\n\n SQLDataType::BigInt => Ok(DataType::Int64),\n\n SQLDataType::Float(_) | SQLDataType::Real => Ok(DataType::Float64),\n\n SQLDataType::Double => Ok(DataType::Float64),\n\n SQLDataType::Char(_) | SQLDataType::Varchar(_) => Ok(DataType::Utf8),\n\n SQLDataType::Timestamp => Ok(DataType::Timestamp(TimeUnit::Nanosecond, None)),\n\n SQLDataType::Date => Ok(DataType::Date32),\n\n other => Err(DataFusionError::NotImplemented(format!(\n\n \"Unsupported SQL type {:?}\",\n\n other\n\n ))),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n","file_path":"datafusion/src/sql/planner.rs","rank":6,"score":336878.6714877247},{"content":"/// function return type of an average\n\npub fn avg_return_type(arg_type: &DataType) -> Result<DataType> {\n\n match arg_type {\n\n DataType::Int8\n\n | DataType::Int16\n\n | DataType::Int32\n\n | DataType::Int64\n\n | DataType::UInt8\n\n | DataType::UInt16\n\n | DataType::UInt32\n\n | DataType::UInt64\n\n | DataType::Float32\n\n | DataType::Float64 => Ok(DataType::Float64),\n\n other => Err(DataFusionError::Plan(format!(\n\n \"AVG does not support {:?}\",\n\n other\n\n ))),\n\n }\n\n}\n\n\n\nimpl Avg {\n","file_path":"datafusion/src/physical_plan/expressions/average.rs","rank":7,"score":333590.1468000982},{"content":"/// function return type of a sum\n\npub fn sum_return_type(arg_type: &DataType) -> Result<DataType> {\n\n match arg_type {\n\n DataType::Int8 | DataType::Int16 | DataType::Int32 | DataType::Int64 => {\n\n Ok(DataType::Int64)\n\n }\n\n DataType::Int64Decimal(scale) => Ok(DataType::Int64Decimal(*scale)),\n\n DataType::UInt8 | DataType::UInt16 | DataType::UInt32 | DataType::UInt64 => {\n\n Ok(DataType::UInt64)\n\n }\n\n DataType::Float32 => Ok(DataType::Float32),\n\n DataType::Float64 => Ok(DataType::Float64),\n\n other => Err(DataFusionError::Plan(format!(\n\n \"SUM does not support type \\\"{:?}\\\"\",\n\n other\n\n ))),\n\n }\n\n}\n\n\n\nimpl Sum {\n\n /// Create a new SUM aggregate function\n","file_path":"datafusion/src/physical_plan/expressions/sum.rs","rank":8,"score":333590.1468000982},{"content":"/// rewrite a `Vec` of `Expr`s with the rewriter\n\nfn rewrite_vec<R>(v: Vec<Expr>, rewriter: &mut R) -> Result<Vec<Expr>>\n\nwhere\n\n R: ExprRewriter,\n\n{\n\n v.into_iter().map(|expr| expr.rewrite(rewriter)).collect()\n\n}\n\n\n\n/// Controls how the visitor recursion should proceed.\n\npub enum Recursion<V: ExpressionVisitor> {\n\n /// Attempt to visit all the children, recursively, of this expression.\n\n Continue(V),\n\n /// Do not visit the children of this expression, though the walk\n\n /// of parents of this expression will not be affected\n\n Stop(V),\n\n}\n\n\n","file_path":"datafusion/src/logical_plan/expr.rs","rank":10,"score":327806.6815817945},{"content":"fn tuple_err<T, R>(value: (Result<T>, Result<R>)) -> Result<(T, R)> {\n\n match value {\n\n (Ok(e), Ok(e1)) => Ok((e, e1)),\n\n (Err(e), Ok(_)) => Err(e),\n\n (Ok(_), Err(e1)) => Err(e1),\n\n (Err(e), Err(_)) => Err(e),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::logical_plan::{DFField, DFSchema, DFSchemaRef};\n\n use crate::physical_plan::{csv::CsvReadOptions, expressions, Partitioning};\n\n use crate::scalar::ScalarValue;\n\n use crate::{\n\n logical_plan::{col, lit, sum, LogicalPlanBuilder},\n\n physical_plan::SendableRecordBatchStream,\n\n };\n\n use arrow::datatypes::{DataType, Field, SchemaRef};\n","file_path":"datafusion/src/physical_plan/planner.rs","rank":11,"score":324233.01660493},{"content":"/// Returns the datatype of the scalar function\n\npub fn return_type(fun: &AggregateFunction, arg_types: &[DataType]) -> Result<DataType> {\n\n // Note that this function *must* return the same type that the respective physical expression returns\n\n // or the execution panics.\n\n\n\n // verify that this is a valid set of data types for this function\n\n data_types(arg_types, &signature(fun))?;\n\n\n\n match fun {\n\n AggregateFunction::Count => Ok(DataType::UInt64),\n\n AggregateFunction::Max | AggregateFunction::Min => Ok(arg_types[0].clone()),\n\n AggregateFunction::Sum => sum_return_type(&arg_types[0]),\n\n AggregateFunction::Avg => avg_return_type(&arg_types[0]),\n\n }\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/aggregates.rs","rank":12,"score":321970.2322467006},{"content":"/// Recursively builds a list of files in a directory with a given extension\n\npub fn build_file_list(dir: &str, ext: &str) -> Result<Vec<String>> {\n\n let mut filenames: Vec<String> = Vec::new();\n\n build_file_list_recurse(dir, &mut filenames, ext)?;\n\n Ok(filenames)\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/common.rs","rank":13,"score":308593.0411597548},{"content":"pub fn ballista_error(message: &str) -> BallistaError {\n\n BallistaError::General(message.to_owned())\n\n}\n\n\n\nimpl From<String> for BallistaError {\n\n fn from(e: String) -> Self {\n\n BallistaError::General(e)\n\n }\n\n}\n\n\n\nimpl From<ArrowError> for BallistaError {\n\n fn from(e: ArrowError) -> Self {\n\n BallistaError::ArrowError(e)\n\n }\n\n}\n\n\n\nimpl From<parser::ParserError> for BallistaError {\n\n fn from(e: parser::ParserError) -> Self {\n\n BallistaError::SqlError(e)\n\n }\n","file_path":"ballista/rust/core/src/error.rs","rank":14,"score":306164.1734483945},{"content":"/// some tests share a common table with different names\n\npub fn test_table_scan_with_name(name: &str) -> Result<LogicalPlan> {\n\n let schema = Schema::new(vec![\n\n Field::new(\"a\", DataType::UInt32, false),\n\n Field::new(\"b\", DataType::UInt32, false),\n\n Field::new(\"c\", DataType::UInt32, false),\n\n ]);\n\n LogicalPlanBuilder::scan_empty(Some(name), &schema, None)?.build()\n\n}\n\n\n","file_path":"datafusion/src/test/mod.rs","rank":15,"score":306080.56563583063},{"content":"/// all tests share a common table\n\npub fn test_table_scan_with_alias(alias: &str) -> Result<LogicalPlan> {\n\n let schema = Schema::new(vec![\n\n Field::new(\"a\", DataType::UInt32, false),\n\n Field::new(\"b\", DataType::UInt32, false),\n\n Field::new(\"c\", DataType::UInt32, false),\n\n ]);\n\n LogicalPlanBuilder::scan_empty(Some(alias), &schema, None)?.build()\n\n}\n\n\n","file_path":"datafusion/src/test/mod.rs","rank":16,"score":306080.56563583063},{"content":"fn data_type_id(id: &i32) -> Result<DataType, errors::DataFusionError> {\n\n // see https://github.com/apache/arrow/blob/3694794bdfd0677b95b8c95681e392512f1c9237/python/pyarrow/includes/libarrow.pxd\n\n // this is not ideal as it does not generalize for non-basic types\n\n // Find a way to get a unique name from the pyarrow.DataType\n\n Ok(match id {\n\n 1 => DataType::Boolean,\n\n 2 => DataType::UInt8,\n\n 3 => DataType::Int8,\n\n 4 => DataType::UInt16,\n\n 5 => DataType::Int16,\n\n 6 => DataType::UInt32,\n\n 7 => DataType::Int32,\n\n 8 => DataType::UInt64,\n\n 9 => DataType::Int64,\n\n 10 => DataType::Float16,\n\n 11 => DataType::Float32,\n\n 12 => DataType::Float64,\n\n 13 => DataType::Utf8,\n\n 14 => DataType::Binary,\n\n 34 => DataType::LargeUtf8,\n\n 35 => DataType::LargeBinary,\n\n other => {\n\n return Err(errors::DataFusionError::Common(format!(\n\n \"The type {} is not valid\",\n\n other\n\n )))\n\n }\n\n })\n\n}\n","file_path":"python/src/types.rs","rank":17,"score":302793.0540222621},{"content":"pub fn datafusion_test_context(path: &str) -> Result<ExecutionContext> {\n\n let default_shuffle_partitions = 2;\n\n let config = ExecutionConfig::new().with_concurrency(default_shuffle_partitions);\n\n let mut ctx = ExecutionContext::with_config(config);\n\n for table in TPCH_TABLES {\n\n let schema = get_tpch_schema(table);\n\n let options = CsvReadOptions::new()\n\n .schema(&schema)\n\n .delimiter(b'|')\n\n .has_header(false)\n\n .file_extension(\".tbl\");\n\n let dir = format!(\"{}/{}\", path, table);\n\n ctx.register_csv(table, &dir, options)?;\n\n }\n\n Ok(ctx)\n\n}\n\n\n","file_path":"ballista/rust/scheduler/src/test_utils.rs","rank":18,"score":302784.7438203158},{"content":"/// Returns a directory path for finding test data.\n\n///\n\n/// udf_env: name of an environment variable\n\n///\n\n/// submodule_dir: fallback path (relative to CARGO_MANIFEST_DIR)\n\n///\n\n/// Returns either:\n\n/// The path referred to in `udf_env` if that variable is set and refers to a directory\n\n/// The submodule_data directory relative to CARGO_MANIFEST_PATH\n\nfn get_data_dir(udf_env: &str, submodule_data: &str) -> Result<PathBuf, Box<dyn Error>> {\n\n // Try user defined env.\n\n if let Ok(dir) = env::var(udf_env) {\n\n let trimmed = dir.trim().to_string();\n\n if !trimmed.is_empty() {\n\n let pb = PathBuf::from(trimmed);\n\n if pb.is_dir() {\n\n return Ok(pb);\n\n } else {\n\n return Err(format!(\n\n \"the data dir `{}` defined by env {} not found\",\n\n pb.display().to_string(),\n\n udf_env\n\n )\n\n .into());\n\n }\n\n }\n\n }\n\n\n\n // The env is undefined or its value is trimmed to empty, let's try default dir.\n","file_path":"datafusion/src/test_util.rs","rank":19,"score":297438.9154651019},{"content":"#[allow(clippy::boxed_local)]\n\nfn rewrite_boxed<R>(boxed_expr: Box<Expr>, rewriter: &mut R) -> Result<Box<Expr>>\n\nwhere\n\n R: ExprRewriter,\n\n{\n\n // TODO: It might be possible to avoid an allocation (the\n\n // Box::new) below by reusing the box.\n\n let expr: Expr = *boxed_expr;\n\n let rewritten_expr = expr.rewrite(rewriter)?;\n\n Ok(Box::new(rewritten_expr))\n\n}\n\n\n","file_path":"datafusion/src/logical_plan/expr.rs","rank":20,"score":296234.9473511569},{"content":"/// Generated partitioned copy of a CSV file\n\npub fn create_partitioned_csv(filename: &str, partitions: usize) -> Result<String> {\n\n let testdata = crate::test_util::arrow_test_data();\n\n let path = format!(\"{}/csv/{}\", testdata, filename);\n\n\n\n let tmp_dir = TempDir::new()?;\n\n\n\n let mut writers = vec![];\n\n for i in 0..partitions {\n\n let filename = format!(\"partition-{}.csv\", i);\n\n let filename = tmp_dir.path().join(&filename);\n\n\n\n let writer = BufWriter::new(File::create(&filename).unwrap());\n\n writers.push(writer);\n\n }\n\n\n\n let f = File::open(&path)?;\n\n let f = BufReader::new(f);\n\n for (i, line) in f.lines().enumerate() {\n\n let line = line.unwrap();\n\n\n","file_path":"datafusion/src/test/mod.rs","rank":21,"score":294952.8930606079},{"content":"/// put values in an array.\n\npub fn array(values: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n let arrays: Vec<&dyn Array> = values\n\n .iter()\n\n .map(|value| {\n\n if let ColumnarValue::Array(value) = value {\n\n Ok(value.as_ref())\n\n } else {\n\n Err(DataFusionError::NotImplemented(\n\n \"Array is not implemented for scalar values.\".to_string(),\n\n ))\n\n }\n\n })\n\n .collect::<Result<_>>()?;\n\n\n\n Ok(ColumnarValue::Array(array_array(&arrays)?))\n\n}\n\n\n\n/// Currently supported types by the array function.\n\n/// The order of these types correspond to the order on which coercion applies\n\n/// This should thus be from least informative to most informative\n","file_path":"datafusion/src/physical_plan/array_expressions.rs","rank":22,"score":294208.8706321672},{"content":"pub fn produce_diagram(filename: &str, stages: &[Arc<ShuffleWriterExec>]) -> Result<()> {\n\n let write_file = File::create(filename)?;\n\n let mut w = BufWriter::new(&write_file);\n\n writeln!(w, \"digraph G {{\")?;\n\n\n\n // draw stages and entities\n\n for stage in stages {\n\n writeln!(w, \"\\tsubgraph cluster{} {{\", stage.stage_id())?;\n\n writeln!(w, \"\\t\\tlabel = \\\"Stage {}\\\";\", stage.stage_id())?;\n\n let mut id = AtomicUsize::new(0);\n\n build_exec_plan_diagram(\n\n &mut w,\n\n stage.children()[0].as_ref(),\n\n stage.stage_id(),\n\n &mut id,\n\n true,\n\n )?;\n\n writeln!(w, \"\\t}}\")?;\n\n }\n\n\n","file_path":"ballista/rust/core/src/utils.rs","rank":23,"score":288470.1884757816},{"content":"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\n\npub fn md5(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n match &args[0] {\n\n ColumnarValue::Array(a) => match a.data_type() {\n\n DataType::Utf8 => Ok(ColumnarValue::Array(Arc::new(md5_array::<i32>(&[\n\n a.as_ref()\n\n ])?))),\n\n DataType::LargeUtf8 => {\n\n Ok(ColumnarValue::Array(Arc::new(md5_array::<i64>(&[\n\n a.as_ref()\n\n ])?)))\n\n }\n\n other => Err(DataFusionError::Internal(format!(\n\n \"Unsupported data type {:?} for function md5\",\n\n other,\n\n ))),\n\n },\n\n ColumnarValue::Scalar(scalar) => match scalar {\n\n ScalarValue::Utf8(a) => {\n\n let result = a.as_ref().map(|x| md5_process(x));\n\n Ok(ColumnarValue::Scalar(ScalarValue::Utf8(result)))\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":25,"score":287697.8275211335},{"content":"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\n\npub fn sha512(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle(args, sha_process::<Sha512>, \"sha512\")\n\n}\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":26,"score":287697.8275211335},{"content":"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\n\npub fn sha384(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle(args, sha_process::<Sha384>, \"sha384\")\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":27,"score":287697.8275211335},{"content":"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\n\npub fn sha256(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle(args, sha_process::<Sha256>, \"sha256\")\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":28,"score":287697.8275211335},{"content":"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\n\npub fn sha224(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle(args, sha_process::<Sha224>, \"ssh224\")\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":29,"score":287697.8275211335},{"content":"/// Converts the string to all upper case.\n\n/// upper('tom') = 'TOM'\n\npub fn upper(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle(args, |string| string.to_ascii_uppercase(), \"upper\")\n\n}\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":30,"score":287691.8817770411},{"content":"/// Converts the string to all lower case.\n\n/// lower('TOM') = 'tom'\n\npub fn lower(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle(args, |string| string.to_ascii_lowercase(), \"lower\")\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":31,"score":287691.8817770411},{"content":"/// Concatenates the text representations of all the arguments. NULL arguments are ignored.\n\n/// concat('abcde', 2, NULL, 22) = 'abcde222'\n\npub fn concat(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n // do not accept 0 arguments.\n\n if args.is_empty() {\n\n return Err(DataFusionError::Internal(format!(\n\n \"concat was called with {} arguments. It requires at least 1.\",\n\n args.len()\n\n )));\n\n }\n\n\n\n // first, decide whether to return a scalar or a vector.\n\n let mut return_array = args.iter().filter_map(|x| match x {\n\n ColumnarValue::Array(array) => Some(array.len()),\n\n _ => None,\n\n });\n\n if let Some(size) = return_array.next() {\n\n let result = (0..size)\n\n .map(|index| {\n\n let mut owned_string: String = \"\".to_owned();\n\n for arg in args {\n\n match arg {\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":32,"score":287685.6398648054},{"content":"/// to_timestamp SQL function\n\npub fn to_timestamp(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle::<TimestampNanosecondType, _, TimestampNanosecondType>(\n\n args,\n\n string_to_timestamp_nanos_shim,\n\n \"to_timestamp\",\n\n )\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":33,"score":287685.6398648054},{"content":"/// random SQL function\n\npub fn random(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n let len: usize = match &args[0] {\n\n ColumnarValue::Array(array) => array.len(),\n\n _ => {\n\n return Err(DataFusionError::Internal(\n\n \"Expect random function to take no param\".to_string(),\n\n ))\n\n }\n\n };\n\n let mut rng = thread_rng();\n\n let values = iter::repeat_with(|| rng.gen_range(0.0..1.0)).take(len);\n\n let array = Float64Array::from_iter_values(values);\n\n Ok(ColumnarValue::Array(Arc::new(array)))\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\n\n use super::*;\n\n use arrow::array::{Float64Array, NullArray};\n","file_path":"datafusion/src/physical_plan/math_expressions.rs","rank":34,"score":287685.6398648054},{"content":"/// Recursively walk a list of expression trees, collecting the unique set of columns\n\n/// referenced in the expression\n\npub fn exprlist_to_columns(expr: &[Expr], accum: &mut HashSet<Column>) -> Result<()> {\n\n for e in expr {\n\n expr_to_columns(e, accum)?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"datafusion/src/optimizer/utils.rs","rank":35,"score":286960.2248272653},{"content":"/// Recursively walk an expression tree, collecting the unique set of columns\n\n/// referenced in the expression\n\npub fn expr_to_columns(expr: &Expr, accum: &mut HashSet<Column>) -> Result<()> {\n\n expr.accept(ColumnNameVisitor { accum })?;\n\n Ok(())\n\n}\n\n\n","file_path":"datafusion/src/optimizer/utils.rs","rank":36,"score":286960.2248272653},{"content":"/// Implements NULLIF(expr1, expr2)\n\n/// Args: 0 - left expr is any array\n\n/// 1 - if the left is equal to this expr2, then the result is NULL, otherwise left value is passed.\n\n///\n\npub fn nullif_func(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n if args.len() != 2 {\n\n return Err(DataFusionError::Internal(format!(\n\n \"{:?} args were supplied but NULLIF takes exactly two args\",\n\n args.len(),\n\n )));\n\n }\n\n\n\n let (lhs, rhs) = (&args[0], &args[1]);\n\n\n\n match (lhs, rhs) {\n\n (ColumnarValue::Array(lhs), ColumnarValue::Scalar(rhs)) => {\n\n let cond_array = binary_array_op_scalar!(lhs, rhs.clone(), eq).unwrap()?;\n\n\n\n let array = primitive_bool_array_op!(lhs, *cond_array, nullif)?;\n\n\n\n Ok(ColumnarValue::Array(array))\n\n }\n\n (ColumnarValue::Array(lhs), ColumnarValue::Array(rhs)) => {\n\n // Get args0 == args1 evaluated and produce a boolean array\n","file_path":"datafusion/src/physical_plan/expressions/nullif.rs","rank":37,"score":284532.514620138},{"content":"/// to_timestamp_millis SQL function\n\npub fn to_timestamp_millis(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle::<TimestampMillisecondType, _, TimestampMillisecondType>(\n\n args,\n\n |s| string_to_timestamp_nanos_shim(s).map(|n| n / 1_000_000),\n\n \"to_timestamp_millis\",\n\n )\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":38,"score":284521.10630423814},{"content":"/// to_timestamp_seconds SQL function\n\npub fn to_timestamp_seconds(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle::<TimestampSecondType, _, TimestampSecondType>(\n\n args,\n\n |s| string_to_timestamp_nanos_shim(s).map(|n| n / 1_000_000_000),\n\n \"to_timestamp_seconds\",\n\n )\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":39,"score":284521.10630423814},{"content":"/// date_trunc SQL function\n\npub fn date_trunc(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n let (granularity, array) = (&args[0], &args[1]);\n\n\n\n let granularity =\n\n if let ColumnarValue::Scalar(ScalarValue::Utf8(Some(v))) = granularity {\n\n v\n\n } else {\n\n return Err(DataFusionError::Execution(\n\n \"Granularity of `date_trunc` must be non-null scalar Utf8\".to_string(),\n\n ));\n\n };\n\n\n\n let f = |x: Option<i64>| x.map(|x| date_trunc_single(granularity, x)).transpose();\n\n\n\n Ok(match array {\n\n ColumnarValue::Scalar(scalar) => {\n\n if let ScalarValue::TimestampNanosecond(v) = scalar {\n\n ColumnarValue::Scalar(ScalarValue::TimestampNanosecond((f)(*v)?))\n\n } else {\n\n return Err(DataFusionError::Execution(\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":40,"score":284521.10630423814},{"content":"/// DATE_PART SQL function\n\npub fn date_part(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n if args.len() != 2 {\n\n return Err(DataFusionError::Execution(\n\n \"Expected two arguments in DATE_PART\".to_string(),\n\n ));\n\n }\n\n let (date_part, array) = (&args[0], &args[1]);\n\n\n\n let date_part = if let ColumnarValue::Scalar(ScalarValue::Utf8(Some(v))) = date_part {\n\n v\n\n } else {\n\n return Err(DataFusionError::Execution(\n\n \"First argument of `DATE_PART` must be non-null scalar Utf8\".to_string(),\n\n ));\n\n };\n\n\n\n let is_scalar = matches!(array, ColumnarValue::Scalar(_));\n\n\n\n let array = match array {\n\n ColumnarValue::Array(array) => array.clone(),\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":41,"score":284521.10630423814},{"content":"/// to_timestamp_micros SQL function\n\npub fn to_timestamp_micros(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n handle::<TimestampMicrosecondType, _, TimestampMicrosecondType>(\n\n args,\n\n |s| string_to_timestamp_nanos_shim(s).map(|n| n / 1_000),\n\n \"to_timestamp_micros\",\n\n )\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":42,"score":284521.10630423814},{"content":"/// Returns the datatype of the scalar function\n\npub fn return_type(\n\n fun: &BuiltinScalarFunction,\n\n arg_types: &[DataType],\n\n) -> Result<DataType> {\n\n // Note that this function *must* return the same type that the respective physical expression returns\n\n // or the execution panics.\n\n\n\n // verify that this is a valid set of data types for this function\n\n data_types(arg_types, &signature(fun))?;\n\n\n\n // the return type of the built in function.\n\n // Some built-in functions' return type depends on the incoming type.\n\n match fun {\n\n BuiltinScalarFunction::Array => Ok(DataType::FixedSizeList(\n\n Box::new(Field::new(\"item\", arg_types[0].clone(), true)),\n\n arg_types.len() as i32,\n\n )),\n\n BuiltinScalarFunction::Ascii => Ok(DataType::Int32),\n\n BuiltinScalarFunction::BitLength => utf8_to_int_type(&arg_types[0], \"bit_length\"),\n\n BuiltinScalarFunction::Btrim => utf8_to_str_type(&arg_types[0], \"btrim\"),\n","file_path":"datafusion/src/physical_plan/functions.rs","rank":43,"score":280040.382574402},{"content":"/// Appends a sequence of [u8] bytes for the value in `col[row]` to\n\n/// `vec` to be used as a key into the hash map\n\nfn create_key_for_col(col: &ArrayRef, row: usize, vec: &mut KeyVec) -> Result<()> {\n\n match col.data_type() {\n\n DataType::Boolean => {\n\n let array = col.as_any().downcast_ref::<BooleanArray>().unwrap();\n\n vec.extend_from_slice(&[array.value(row) as u8]);\n\n }\n\n DataType::Float32 => {\n\n let array = col.as_any().downcast_ref::<Float32Array>().unwrap();\n\n vec.extend_from_slice(&array.value(row).to_le_bytes());\n\n }\n\n DataType::Float64 => {\n\n let array = col.as_any().downcast_ref::<Float64Array>().unwrap();\n\n vec.extend_from_slice(&array.value(row).to_le_bytes());\n\n }\n\n DataType::UInt8 => {\n\n let array = col.as_any().downcast_ref::<UInt8Array>().unwrap();\n\n vec.extend_from_slice(&array.value(row).to_le_bytes());\n\n }\n\n DataType::UInt16 => {\n\n let array = col.as_any().downcast_ref::<UInt16Array>().unwrap();\n","file_path":"datafusion/src/physical_plan/hash_aggregate.rs","rank":44,"score":276860.986116309},{"content":"/// Create a column expression\n\npub fn col(name: &str, schema: &Schema) -> Result<Arc<dyn PhysicalExpr>> {\n\n Ok(Arc::new(Column::new_with_schema(name, schema)?))\n\n}\n","file_path":"datafusion/src/physical_plan/expressions/column.rs","rank":45,"score":276143.66452859604},{"content":"/// Extract the values in `group_by_keys` arrow arrays into the target vector\n\n/// as GroupByScalar values\n\npub fn create_group_by_values(\n\n group_by_keys: &[ArrayRef],\n\n row: usize,\n\n vec: &mut SmallVec<[GroupByScalar; 2]>,\n\n) -> Result<()> {\n\n for (i, col) in group_by_keys.iter().enumerate() {\n\n vec[i] = create_group_by_value(col, row)?\n\n }\n\n Ok(())\n\n}\n\n\n\nasync fn compute_grouped_sorted_aggregate(\n\n mode: AggregateMode,\n\n schema: SchemaRef,\n\n group_expr: Vec<Arc<dyn PhysicalExpr>>,\n\n aggr_expr: Vec<Arc<dyn AggregateExpr>>,\n\n mut input: SendableRecordBatchStream,\n\n) -> ArrowResult<RecordBatch> {\n\n // the expressions to evaluate the batch, one vec of expressions per aggregation\n\n let aggregate_expressions =\n","file_path":"datafusion/src/physical_plan/hash_aggregate.rs","rank":46,"score":271915.3162133056},{"content":"/// Panics if arrays are of different types. Comparison is ascending, null first.\n\npub fn cmp_array_row_same_types(\n\n l: &ArrayRef,\n\n l_row: usize,\n\n r: &ArrayRef,\n\n r_row: usize,\n\n) -> Ordering {\n\n let l_null = l.is_null(l_row);\n\n let r_null = r.is_null(r_row);\n\n if l_null && r_null {\n\n return Ordering::Equal;\n\n }\n\n if l_null && !r_null {\n\n return Ordering::Less;\n\n }\n\n if !l_null && r_null {\n\n return Ordering::Greater;\n\n }\n\n\n\n macro_rules! cmp_row {\n\n ($l: expr, Float32Array, $($rest: tt)*) => {{\n","file_path":"datafusion/src/cube_ext/util.rs","rank":47,"score":271897.83156633005},{"content":"/// convert_tz SQL function\n\npub fn convert_tz(args: &[ArrayRef]) -> Result<ArrayRef> {\n\n let timestamps = &args[0]\n\n .as_any()\n\n .downcast_ref::<TimestampNanosecondArray>()\n\n .ok_or_else(|| {\n\n DataFusionError::Execution(\n\n \"Could not cast convert_tz timestamp input to TimestampNanosecondArray\"\n\n .to_string(),\n\n )\n\n })?;\n\n\n\n let shift = &args[1]\n\n .as_any()\n\n .downcast_ref::<StringArray>()\n\n .ok_or_else(|| {\n\n DataFusionError::Execution(\n\n \"Could not cast convert_tz shift input to StringArray\".to_string(),\n\n )\n\n })?;\n\n\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":48,"score":270821.7754734948},{"content":"pub fn assert_fields_eq(plan: &LogicalPlan, expected: Vec<&str>) {\n\n let actual: Vec<String> = plan\n\n .schema()\n\n .fields()\n\n .iter()\n\n .map(|f| f.name().clone())\n\n .collect();\n\n assert_eq!(actual, expected);\n\n}\n\n\n","file_path":"datafusion/src/test/mod.rs","rank":49,"score":270522.3567157234},{"content":"fn date_trunc_single(granularity: &str, value: i64) -> Result<i64> {\n\n let value = timestamp_ns_to_datetime(value).with_nanosecond(0);\n\n let value = match granularity {\n\n \"second\" => value,\n\n \"minute\" => value.and_then(|d| d.with_second(0)),\n\n \"hour\" => value\n\n .and_then(|d| d.with_second(0))\n\n .and_then(|d| d.with_minute(0)),\n\n \"day\" => value\n\n .and_then(|d| d.with_second(0))\n\n .and_then(|d| d.with_minute(0))\n\n .and_then(|d| d.with_hour(0)),\n\n \"week\" => value\n\n .and_then(|d| d.with_second(0))\n\n .and_then(|d| d.with_minute(0))\n\n .and_then(|d| d.with_hour(0))\n\n .map(|d| d - Duration::seconds(60 * 60 * 24 * d.weekday() as i64)),\n\n \"month\" => value\n\n .and_then(|d| d.with_second(0))\n\n .and_then(|d| d.with_minute(0))\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":50,"score":268348.96001933055},{"content":"pub fn decode_protobuf(bytes: &[u8]) -> Result<BallistaAction, BallistaError> {\n\n let mut buf = Cursor::new(bytes);\n\n\n\n protobuf::Action::decode(&mut buf)\n\n .map_err(|e| BallistaError::Internal(format!(\"{:?}\", e)))\n\n .and_then(|node| node.try_into())\n\n}\n\n\n\npub(crate) fn proto_error<S: Into<String>>(message: S) -> BallistaError {\n\n BallistaError::General(message.into())\n\n}\n\n\n\n#[macro_export]\n\nmacro_rules! convert_required {\n\n ($PB:expr) => {{\n\n if let Some(field) = $PB.as_ref() {\n\n field.try_into()\n\n } else {\n\n Err(proto_error(\"Missing required field in protobuf\"))\n\n }\n","file_path":"ballista/rust/core/src/serde/mod.rs","rank":51,"score":263317.66957165493},{"content":"/// Concatenates all but the first argument, with separators.\n\n/// The first argument is used as the separator string, and should not be NULL.\n\n/// Other NULL arguments are ignored.\n\npub fn concat_ws(sep: impl Into<String>, values: &[Expr]) -> Expr {\n\n let mut args = vec![lit(sep.into())];\n\n args.extend_from_slice(values);\n\n Expr::ScalarFunction {\n\n fun: functions::BuiltinScalarFunction::ConcatWithSeparator,\n\n args,\n\n }\n\n}\n\n\n","file_path":"datafusion/src/logical_plan/expr.rs","rank":52,"score":263200.44447907753},{"content":"fn extract_job_id_from_task_key(job_key: &str) -> Result<&str> {\n\n job_key.split('/').nth(4).ok_or_else(|| {\n\n BallistaError::Internal(format!(\"Unexpected task key: {}\", job_key))\n\n })\n\n}\n\n\n","file_path":"ballista/rust/scheduler/src/state/mod.rs","rank":53,"score":253998.8575662212},{"content":"/// Returns starting index of specified substring within string, or zero if it's not present. (Same as position(substring in string), but note the reversed argument order.)\n\n/// strpos('high', 'ig') = 2\n\npub fn strpos<T: ArrowPrimitiveType>(args: &[ArrayRef]) -> Result<ArrayRef>\n\nwhere\n\n T::Native: StringOffsetSizeTrait,\n\n{\n\n let string_array: &GenericStringArray<T::Native> = args[0]\n\n .as_any()\n\n .downcast_ref::<GenericStringArray<T::Native>>()\n\n .ok_or_else(|| {\n\n DataFusionError::Internal(\"could not cast string to StringArray\".to_string())\n\n })?;\n\n\n\n let substring_array: &GenericStringArray<T::Native> = args[1]\n\n .as_any()\n\n .downcast_ref::<GenericStringArray<T::Native>>()\n\n .ok_or_else(|| {\n\n DataFusionError::Internal(\n\n \"could not cast substring to StringArray\".to_string(),\n\n )\n\n })?;\n\n\n","file_path":"datafusion/src/physical_plan/unicode_expressions.rs","rank":54,"score":253360.44246469944},{"content":"/// Converts the number to its equivalent hexadecimal representation.\n\n/// to_hex(2147483647) = '7fffffff'\n\npub fn to_hex<T: ArrowPrimitiveType>(args: &[ArrayRef]) -> Result<ArrayRef>\n\nwhere\n\n T::Native: StringOffsetSizeTrait,\n\n{\n\n let integer_array = downcast_primitive_array_arg!(args[0], \"integer\", T);\n\n\n\n let result = integer_array\n\n .iter()\n\n .map(|integer| {\n\n integer.map(|integer| format!(\"{:x}\", integer.to_usize().unwrap()))\n\n })\n\n .collect::<GenericStringArray<i32>>();\n\n\n\n Ok(Arc::new(result) as ArrayRef)\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":55,"score":253348.96254012128},{"content":"/// Print the schema in a compact representation to `buf`\n\n///\n\n/// For example: `foo:Utf8` if `foo` can not be null, and\n\n/// `foo:Utf8;N` if `foo` is nullable.\n\n///\n\n/// ```\n\n/// use arrow::datatypes::{Field, Schema, DataType};\n\n/// # use datafusion::logical_plan::display_schema;\n\n/// let schema = Schema::new(vec![\n\n/// Field::new(\"id\", DataType::Int32, false),\n\n/// Field::new(\"first_name\", DataType::Utf8, true),\n\n/// ]);\n\n///\n\n/// assert_eq!(\n\n/// \"[id:Int32, first_name:Utf8;N]\",\n\n/// format!(\"{}\", display_schema(&schema))\n\n/// );\n\n/// ```\n\npub fn display_schema(schema: &Schema) -> impl fmt::Display + '_ {\n\n struct Wrapper<'a>(&'a Schema);\n\n\n\n impl<'a> fmt::Display for Wrapper<'a> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n write!(f, \"[\")?;\n\n for (idx, field) in self.0.fields().iter().enumerate() {\n\n if idx > 0 {\n\n write!(f, \", \")?;\n\n }\n\n let nullable_str = if field.is_nullable() { \";N\" } else { \"\" };\n\n write!(\n\n f,\n\n \"{}:{:?}{}\",\n\n field.name(),\n\n field.data_type(),\n\n nullable_str\n\n )?;\n\n }\n\n write!(f, \"]\")\n\n }\n\n }\n\n Wrapper(schema)\n\n}\n\n\n\n/// Logic related to creating DOT language graphs.\n","file_path":"datafusion/src/logical_plan/display.rs","rank":56,"score":252195.0010547214},{"content":"/// decorates a function to handle [`ScalarValue`]s by converting them to arrays before calling the function\n\n/// and vice-versa after evaluation.\n\npub fn make_scalar_function<F>(inner: F) -> ScalarFunctionImplementation\n\nwhere\n\n F: Fn(&[ArrayRef]) -> Result<ArrayRef> + Sync + Send + 'static,\n\n{\n\n Arc::new(move |args: &[ColumnarValue]| {\n\n // first, identify if any of the arguments is an Array. If yes, store its `len`,\n\n // as any scalar will need to be converted to an array of len `len`.\n\n let len = args\n\n .iter()\n\n .fold(Option::<usize>::None, |acc, arg| match arg {\n\n ColumnarValue::Scalar(_) => acc,\n\n ColumnarValue::Array(a) => Some(a.len()),\n\n });\n\n\n\n // to array\n\n let args = if let Some(len) = len {\n\n args.iter()\n\n .map(|arg| arg.clone().into_array(len))\n\n .collect::<Vec<ArrayRef>>()\n\n } else {\n","file_path":"datafusion/src/physical_plan/functions.rs","rank":57,"score":250720.13883627256},{"content":"/// Returns true if string starts with prefix.\n\n/// starts_with('alphabet', 'alph') = 't'\n\npub fn starts_with<T: StringOffsetSizeTrait>(args: &[ArrayRef]) -> Result<ArrayRef> {\n\n let string_array = downcast_string_arg!(args[0], \"string\", T);\n\n let prefix_array = downcast_string_arg!(args[1], \"prefix\", T);\n\n\n\n let result = string_array\n\n .iter()\n\n .zip(prefix_array.iter())\n\n .map(|(string, prefix)| match (string, prefix) {\n\n (Some(string), Some(prefix)) => Some(string.starts_with(prefix)),\n\n _ => None,\n\n })\n\n .collect::<BooleanArray>();\n\n\n\n Ok(Arc::new(result) as ArrayRef)\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":58,"score":250553.17486994766},{"content":"/// Returns number of characters in the string.\n\n/// character_length('josé') = 4\n\npub fn character_length<T: ArrowPrimitiveType>(args: &[ArrayRef]) -> Result<ArrayRef>\n\nwhere\n\n T::Native: StringOffsetSizeTrait,\n\n{\n\n let string_array: &GenericStringArray<T::Native> = args[0]\n\n .as_any()\n\n .downcast_ref::<GenericStringArray<T::Native>>()\n\n .ok_or_else(|| {\n\n DataFusionError::Internal(\"could not cast string to StringArray\".to_string())\n\n })?;\n\n\n\n let result = string_array\n\n .iter()\n\n .map(|string| {\n\n string.map(|string: &str| {\n\n T::Native::from_usize(string.graphemes(true).count()).expect(\n\n \"should not fail as graphemes.count will always return integer\",\n\n )\n\n })\n\n })\n\n .collect::<PrimitiveArray<T>>();\n\n\n\n Ok(Arc::new(result) as ArrayRef)\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/unicode_expressions.rs","rank":59,"score":250480.46137234906},{"content":"/// converts a pyarrow Scalar into a Rust Scalar\n\npub fn to_rust_scalar(ob: &PyAny) -> PyResult<ScalarValue> {\n\n let t = ob\n\n .getattr(\"__class__\")?\n\n .getattr(\"__name__\")?\n\n .extract::<&str>()?;\n\n\n\n let p = ob.call_method0(\"as_py\")?;\n\n\n\n Ok(match t {\n\n \"Int8Scalar\" => ScalarValue::Int8(Some(p.extract::<i8>()?)),\n\n \"Int16Scalar\" => ScalarValue::Int16(Some(p.extract::<i16>()?)),\n\n \"Int32Scalar\" => ScalarValue::Int32(Some(p.extract::<i32>()?)),\n\n \"Int64Scalar\" => ScalarValue::Int64(Some(p.extract::<i64>()?)),\n\n \"UInt8Scalar\" => ScalarValue::UInt8(Some(p.extract::<u8>()?)),\n\n \"UInt16Scalar\" => ScalarValue::UInt16(Some(p.extract::<u16>()?)),\n\n \"UInt32Scalar\" => ScalarValue::UInt32(Some(p.extract::<u32>()?)),\n\n \"UInt64Scalar\" => ScalarValue::UInt64(Some(p.extract::<u64>()?)),\n\n \"FloatScalar\" => ScalarValue::Float32(Some(p.extract::<f32>()?)),\n\n \"DoubleScalar\" => ScalarValue::Float64(Some(p.extract::<f64>()?)),\n\n \"BooleanScalar\" => ScalarValue::Boolean(Some(p.extract::<bool>()?)),\n","file_path":"python/src/to_rust.rs","rank":60,"score":249640.9891187648},{"content":"// coercion rules for equality operations. This is a superset of all numerical coercion rules.\n\npub fn eq_coercion(lhs_type: &DataType, rhs_type: &DataType) -> Option<DataType> {\n\n if lhs_type == rhs_type {\n\n // same type => equality is possible\n\n return Some(lhs_type.clone());\n\n }\n\n numerical_coercion(lhs_type, rhs_type)\n\n .or_else(|| eq_bool_coercion(lhs_type, rhs_type))\n\n .or_else(|| dictionary_coercion(lhs_type, rhs_type))\n\n .or_else(|| temporal_coercion(lhs_type, rhs_type))\n\n .or_else(|| string_implicit_cast(lhs_type, rhs_type))\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/expressions/coercion.rs","rank":61,"score":247965.47024009447},{"content":"/// extract a specific group from a string column, using a regular expression\n\npub fn regexp_match<T: StringOffsetSizeTrait>(args: &[ArrayRef]) -> Result<ArrayRef> {\n\n match args.len() {\n\n 2 => compute::regexp_match(downcast_string_arg!(args[0], \"string\", T), downcast_string_arg!(args[1], \"pattern\", T), None)\n\n .map_err(DataFusionError::ArrowError),\n\n 3 => compute::regexp_match(downcast_string_arg!(args[0], \"string\", T), downcast_string_arg!(args[1], \"pattern\", T), Some(downcast_string_arg!(args[1], \"flags\", T)))\n\n .map_err(DataFusionError::ArrowError),\n\n other => Err(DataFusionError::Internal(format!(\n\n \"regexp_match was called with {} arguments. It requires at least 2 and at most 3.\",\n\n other\n\n ))),\n\n }\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/regex_expressions.rs","rank":62,"score":247776.18988604023},{"content":"/// Visit all children of this plan, according to the order defined on `ExecutionPlanVisitor`.\n\n// Note that this would be really nice if it were a method on\n\n// ExecutionPlan, but it can not be because it takes a generic\n\n// parameter and `ExecutionPlan` is a trait\n\npub fn accept<V: ExecutionPlanVisitor>(\n\n plan: &dyn ExecutionPlan,\n\n visitor: &mut V,\n\n) -> std::result::Result<(), V::Error> {\n\n visitor.pre_visit(plan)?;\n\n for child in plan.children() {\n\n visit_execution_plan(child.as_ref(), visitor)?;\n\n }\n\n visitor.post_visit(plan)?;\n\n Ok(())\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/mod.rs","rank":63,"score":246700.46372810518},{"content":"/// # Errors\n\n/// This function errors when:\n\n/// * the number of arguments is not 1\n\n/// * the first argument is not castable to a `GenericStringArray`\n\nfn unary_binary_function<T, R, F>(\n\n args: &[&dyn Array],\n\n op: F,\n\n name: &str,\n\n) -> Result<BinaryArray>\n\nwhere\n\n R: AsRef<[u8]>,\n\n T: StringOffsetSizeTrait,\n\n F: Fn(&str) -> R,\n\n{\n\n if args.len() != 1 {\n\n return Err(DataFusionError::Internal(format!(\n\n \"{:?} args were supplied but {} takes exactly one argument\",\n\n args.len(),\n\n name,\n\n )));\n\n }\n\n\n\n let array = args[0]\n\n .as_any()\n\n .downcast_ref::<GenericStringArray<T>>()\n\n .ok_or_else(|| {\n\n DataFusionError::Internal(\"failed to downcast to string\".to_string())\n\n })?;\n\n\n\n // first map is the iterator, second is for the `Option<_>`\n\n Ok(array.iter().map(|x| x.map(|x| op(x))).collect())\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":64,"score":246306.5754166705},{"content":"/// some tests share a common table\n\npub fn test_table_scan() -> Result<LogicalPlan> {\n\n test_table_scan_with_name(\"test\")\n\n}\n\n\n","file_path":"datafusion/src/test/mod.rs","rank":65,"score":245576.21199123075},{"content":"/// returns the name of the state\n\npub fn format_state_name(name: &str, state_name: &str) -> String {\n\n format!(\"{}[{}]\", name, state_name)\n\n}\n\n\n\n/// Represents Sort operation for a column in a RecordBatch\n\n#[derive(Clone, Debug)]\n\npub struct PhysicalSortExpr {\n\n /// Physical expression representing the column to sort\n\n pub expr: Arc<dyn PhysicalExpr>,\n\n /// Option to specify how the given column should be sorted\n\n pub options: SortOptions,\n\n}\n\n\n\nimpl std::fmt::Display for PhysicalSortExpr {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n let opts_string = match (self.options.descending, self.options.nulls_first) {\n\n (true, true) => \"DESC\",\n\n (true, false) => \"DESC NULLS LAST\",\n\n (false, true) => \"ASC\",\n\n (false, false) => \"ASC NULLS LAST\",\n","file_path":"datafusion/src/physical_plan/expressions/mod.rs","rank":66,"score":243954.21990812384},{"content":"/// Create a column expression based on a qualified or unqualified column name\n\npub fn col(ident: &str) -> Expr {\n\n Expr::Column(ident.into())\n\n}\n\n\n","file_path":"datafusion/src/logical_plan/expr.rs","rank":67,"score":243931.1962003408},{"content":"fn register_aggregate_csv(ctx: &mut ExecutionContext) -> Result<()> {\n\n let testdata = datafusion::test_util::arrow_test_data();\n\n let schema = aggr_test_schema();\n\n ctx.register_csv(\n\n \"aggregate_test_100\",\n\n &format!(\"{}/csv/aggregate_test_100.csv\", testdata),\n\n CsvReadOptions::new().schema(&schema),\n\n )?;\n\n Ok(())\n\n}\n\n\n","file_path":"datafusion/tests/sql.rs","rank":68,"score":242540.83017196198},{"content":"fn eq_bool_coercion(l: &DataType, r: &DataType) -> Option<DataType> {\n\n if l == &DataType::Boolean || r == &DataType::Boolean {\n\n Some(DataType::Boolean)\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/expressions/coercion.rs","rank":69,"score":242065.8453518648},{"content":"/// Recursively calls `pre_visit` and `post_visit` for this node and\n\n/// all of its children, as described on [`ExecutionPlanVisitor`]\n\npub fn visit_execution_plan<V: ExecutionPlanVisitor>(\n\n plan: &dyn ExecutionPlan,\n\n visitor: &mut V,\n\n) -> std::result::Result<(), V::Error> {\n\n visitor.pre_visit(plan)?;\n\n for child in plan.children() {\n\n visit_execution_plan(child.as_ref(), visitor)?;\n\n }\n\n visitor.post_visit(plan)?;\n\n Ok(())\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/mod.rs","rank":70,"score":241281.71695120173},{"content":"fn register_aggregate_simple_csv(ctx: &mut ExecutionContext) -> Result<()> {\n\n // It's not possible to use aggregate_test_100, not enought similar values to test grouping on floats\n\n let schema = Arc::new(Schema::new(vec![\n\n Field::new(\"c1\", DataType::Float32, false),\n\n Field::new(\"c2\", DataType::Float64, false),\n\n Field::new(\"c3\", DataType::Boolean, false),\n\n ]));\n\n\n\n ctx.register_csv(\n\n \"aggregate_simple\",\n\n \"tests/aggregate_simple.csv\",\n\n CsvReadOptions::new().schema(&schema),\n\n )?;\n\n Ok(())\n\n}\n\n\n","file_path":"datafusion/tests/sql.rs","rank":71,"score":239778.70793450915},{"content":"fn create_batch(value: i32, num_rows: usize) -> Result<RecordBatch> {\n\n let mut builder = Int32Builder::new(num_rows);\n\n for _ in 0..num_rows {\n\n builder.append_value(value)?;\n\n }\n\n\n\n Ok(RecordBatch::try_new(\n\n Arc::new(Schema::new(vec![Field::new(\n\n \"flag\",\n\n DataType::Int32,\n\n false,\n\n )])),\n\n vec![Arc::new(builder.finish())],\n\n )?)\n\n}\n\n\n","file_path":"datafusion/tests/provider_filter_pushdown.rs","rank":72,"score":237903.9210339261},{"content":"/// Returns the data types that each argument must be coerced to match\n\n/// `signature`.\n\n///\n\n/// See the module level documentation for more detail on coercion.\n\npub fn data_types(\n\n current_types: &[DataType],\n\n signature: &Signature,\n\n) -> Result<Vec<DataType>> {\n\n if current_types.is_empty() {\n\n return Ok(vec![]);\n\n }\n\n let valid_types = get_valid_types(signature, current_types)?;\n\n\n\n if valid_types\n\n .iter()\n\n .any(|data_type| data_type == current_types)\n\n {\n\n return Ok(current_types.to_vec());\n\n }\n\n\n\n for valid_types in valid_types {\n\n if let Some(types) = maybe_data_types(&valid_types, current_types) {\n\n return Ok(types);\n\n }\n\n }\n\n\n\n // none possible -> Error\n\n Err(DataFusionError::Plan(format!(\n\n \"Coercion from {:?} to the signature {:?} failed.\",\n\n current_types, signature\n\n )))\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/type_coercion.rs","rank":73,"score":237489.2244775246},{"content":"/// Calls string_to_timestamp_nanos and converts the error type\n\nfn string_to_timestamp_nanos_shim(s: &str) -> Result<i64> {\n\n string_to_timestamp_nanos(s).map_err(|e| e.into())\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/datetime_expressions.rs","rank":74,"score":236969.44991153682},{"content":"pub fn get_tpch_schema(table: &str) -> Schema {\n\n // note that the schema intentionally uses signed integers so that any generated Parquet\n\n // files can also be used to benchmark tools that only support signed integers, such as\n\n // Apache Spark\n\n\n\n match table {\n\n \"part\" => Schema::new(vec![\n\n Field::new(\"p_partkey\", DataType::Int32, false),\n\n Field::new(\"p_name\", DataType::Utf8, false),\n\n Field::new(\"p_mfgr\", DataType::Utf8, false),\n\n Field::new(\"p_brand\", DataType::Utf8, false),\n\n Field::new(\"p_type\", DataType::Utf8, false),\n\n Field::new(\"p_size\", DataType::Int32, false),\n\n Field::new(\"p_container\", DataType::Utf8, false),\n\n Field::new(\"p_retailprice\", DataType::Float64, false),\n\n Field::new(\"p_comment\", DataType::Utf8, false),\n\n ]),\n\n\n\n \"supplier\" => Schema::new(vec![\n\n Field::new(\"s_suppkey\", DataType::Int32, false),\n","file_path":"ballista/rust/scheduler/src/test_utils.rs","rank":75,"score":235646.70777623507},{"content":"/// Create a physical expression for window function\n\npub fn create_window_expr(\n\n fun: &WindowFunction,\n\n name: String,\n\n args: &[Arc<dyn PhysicalExpr>],\n\n partition_by: &[Arc<dyn PhysicalExpr>],\n\n order_by: &[PhysicalSortExpr],\n\n window_frame: Option<WindowFrame>,\n\n input_schema: &Schema,\n\n) -> Result<Arc<dyn WindowExpr>> {\n\n Ok(match fun {\n\n WindowFunction::AggregateFunction(fun) => Arc::new(AggregateWindowExpr::new(\n\n aggregates::create_aggregate_expr(fun, false, args, input_schema, name)?,\n\n partition_by,\n\n order_by,\n\n window_frame,\n\n )),\n\n WindowFunction::BuiltInWindowFunction(fun) => Arc::new(BuiltInWindowExpr::new(\n\n fun.clone(),\n\n create_built_in_window_expr(fun, args, input_schema, name)?,\n\n partition_by,\n\n order_by,\n\n window_frame,\n\n )),\n\n })\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/windows/mod.rs","rank":76,"score":234624.19010937697},{"content":"/// Return record batch with i32 sequence\n\n///\n\n/// Columns are named\n\n/// \"i\" -> Int32Array\n\nfn make_int32_batch(start: i32, end: i32) -> RecordBatch {\n\n let schema = Arc::new(Schema::new(vec![Field::new(\"i\", DataType::Int32, true)]));\n\n let v: Vec<i32> = (start..end).collect();\n\n let array = Arc::new(Int32Array::from(v)) as ArrayRef;\n\n RecordBatch::try_new(schema, vec![array.clone()]).unwrap()\n\n}\n\n\n","file_path":"datafusion/tests/parquet_pruning.rs","rank":77,"score":233483.00525581356},{"content":"/// Returns `expressions` coerced to types compatible with\n\n/// `signature`, if possible.\n\n///\n\n/// See the module level documentation for more detail on coercion.\n\npub fn coerce(\n\n expressions: &[Arc<dyn PhysicalExpr>],\n\n schema: &Schema,\n\n signature: &Signature,\n\n) -> Result<Vec<Arc<dyn PhysicalExpr>>> {\n\n if expressions.is_empty() {\n\n return Ok(vec![]);\n\n }\n\n\n\n let current_types = expressions\n\n .iter()\n\n .map(|e| e.data_type(schema))\n\n .collect::<Result<Vec<_>>>()?;\n\n\n\n let new_types = data_types(¤t_types, signature)?;\n\n\n\n expressions\n\n .iter()\n\n .enumerate()\n\n .map(|(i, expr)| try_cast(expr.clone(), schema, new_types[i].clone()))\n\n .collect::<Result<Vec<_>>>()\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/type_coercion.rs","rank":78,"score":227832.43287421213},{"content":"/// Panics if scalars are of different types.\n\npub fn cmp_same_types(\n\n l: &ScalarValue,\n\n r: &ScalarValue,\n\n nulls_first: bool,\n\n asc: bool,\n\n) -> Ordering {\n\n match (l.is_null(), r.is_null()) {\n\n (true, true) => return Ordering::Equal,\n\n (true, false) => {\n\n return if nulls_first {\n\n Ordering::Less\n\n } else {\n\n Ordering::Greater\n\n }\n\n }\n\n (false, true) => {\n\n return if nulls_first {\n\n Ordering::Greater\n\n } else {\n\n Ordering::Less\n","file_path":"datafusion/src/cube_ext/util.rs","rank":79,"score":227826.64140918016},{"content":"/// Returns the character with the given code. chr(0) is disallowed because text data types cannot store that character.\n\n/// chr(65) = 'A'\n\npub fn chr(args: &[ArrayRef]) -> Result<ArrayRef> {\n\n let integer_array = downcast_arg!(args[0], \"integer\", Int64Array);\n\n\n\n // first map is the iterator, second is for the `Option<_>`\n\n let result = integer_array\n\n .iter()\n\n .map(|integer: Option<i64>| {\n\n integer\n\n .map(|integer| {\n\n if integer == 0 {\n\n Err(DataFusionError::Execution(\n\n \"null character not permitted.\".to_string(),\n\n ))\n\n } else {\n\n match core::char::from_u32(integer as u32) {\n\n Some(integer) => Ok(integer.to_string()),\n\n None => Err(DataFusionError::Execution(\n\n \"requested character too large for encoding.\".to_string(),\n\n )),\n\n }\n\n }\n\n })\n\n .transpose()\n\n })\n\n .collect::<Result<StringArray>>()?;\n\n\n\n Ok(Arc::new(result) as ArrayRef)\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":80,"score":227581.65310581296},{"content":"/// Returns all direct children `Expression`s of `expr`.\n\n/// E.g. if the expression is \"(a + 1) + 1\", it returns [\"a + 1\", \"1\"] (as Expr objects)\n\npub fn expr_sub_expressions(expr: &Expr) -> Result<Vec<Expr>> {\n\n match expr {\n\n Expr::BinaryExpr { left, right, .. } => {\n\n Ok(vec![left.as_ref().to_owned(), right.as_ref().to_owned()])\n\n }\n\n Expr::IsNull(e) => Ok(vec![e.as_ref().to_owned()]),\n\n Expr::IsNotNull(e) => Ok(vec![e.as_ref().to_owned()]),\n\n Expr::ScalarFunction { args, .. } => Ok(args.clone()),\n\n Expr::ScalarUDF { args, .. } => Ok(args.clone()),\n\n Expr::WindowFunction {\n\n args,\n\n partition_by,\n\n order_by,\n\n ..\n\n } => {\n\n let mut expr_list: Vec<Expr> = vec![];\n\n expr_list.extend(args.clone());\n\n expr_list.push(lit(WINDOW_PARTITION_MARKER));\n\n expr_list.extend(partition_by.clone());\n\n expr_list.push(lit(WINDOW_SORT_MARKER));\n","file_path":"datafusion/src/optimizer/utils.rs","rank":81,"score":225846.41804674314},{"content":"/// Concatenates all but the first argument, with separators. The first argument is used as the separator string, and should not be NULL. Other NULL arguments are ignored.\n\n/// concat_ws(',', 'abcde', 2, NULL, 22) = 'abcde,2,22'\n\npub fn concat_ws(args: &[ArrayRef]) -> Result<ArrayRef> {\n\n // downcast all arguments to strings\n\n let args = downcast_vec!(args, StringArray).collect::<Result<Vec<&StringArray>>>()?;\n\n\n\n // do not accept 0 or 1 arguments.\n\n if args.len() < 2 {\n\n return Err(DataFusionError::Internal(format!(\n\n \"concat_ws was called with {} arguments. It requires at least 2.\",\n\n args.len()\n\n )));\n\n }\n\n\n\n // first map is the iterator, second is for the `Option<_>`\n\n let result = args[0]\n\n .iter()\n\n .enumerate()\n\n .map(|(index, x)| {\n\n x.map(|sep: &str| {\n\n let mut owned_string: String = \"\".to_owned();\n\n for arg_index in 1..args.len() {\n","file_path":"datafusion/src/physical_plan/string_expressions.rs","rank":82,"score":225106.97911664023},{"content":"fn build_statistics_expr(expr_builder: &mut PruningExpressionBuilder) -> Result<Expr> {\n\n let statistics_expr =\n\n match expr_builder.op() {\n\n Operator::NotEq => {\n\n // column != literal => (min, max) = literal =>\n\n // !(min != literal && max != literal) ==>\n\n // min != literal || literal != max\n\n let min_column_expr = expr_builder.min_column_expr()?;\n\n let max_column_expr = expr_builder.max_column_expr()?;\n\n min_column_expr\n\n .not_eq(expr_builder.scalar_expr().clone())\n\n .or(expr_builder.scalar_expr().clone().not_eq(max_column_expr))\n\n }\n\n Operator::Eq => {\n\n // column = literal => (min, max) = literal => min <= literal && literal <= max\n\n // (column / 2) = 4 => (column_min / 2) <= 4 && 4 <= (column_max / 2)\n\n let min_column_expr = expr_builder.min_column_expr()?;\n\n let max_column_expr = expr_builder.max_column_expr()?;\n\n min_column_expr\n\n .lt_eq(expr_builder.scalar_expr().clone())\n","file_path":"datafusion/src/physical_optimizer/pruning.rs","rank":83,"score":224845.54705271753},{"content":"/// returns a new expression where the expressions in `expr` are replaced by the ones in\n\n/// `expressions`.\n\n/// This is used in conjunction with ``expr_expressions`` to re-write expressions.\n\npub fn rewrite_expression(expr: &Expr, expressions: &[Expr]) -> Result<Expr> {\n\n match expr {\n\n Expr::BinaryExpr { op, .. } => Ok(Expr::BinaryExpr {\n\n left: Box::new(expressions[0].clone()),\n\n op: *op,\n\n right: Box::new(expressions[1].clone()),\n\n }),\n\n Expr::IsNull(_) => Ok(Expr::IsNull(Box::new(expressions[0].clone()))),\n\n Expr::IsNotNull(_) => Ok(Expr::IsNotNull(Box::new(expressions[0].clone()))),\n\n Expr::ScalarFunction { fun, .. } => Ok(Expr::ScalarFunction {\n\n fun: fun.clone(),\n\n args: expressions.to_vec(),\n\n }),\n\n Expr::ScalarUDF { fun, .. } => Ok(Expr::ScalarUDF {\n\n fun: fun.clone(),\n\n args: expressions.to_vec(),\n\n }),\n\n Expr::WindowFunction {\n\n fun, window_frame, ..\n\n } => {\n","file_path":"datafusion/src/optimizer/utils.rs","rank":84,"score":221962.45165952452},{"content":"fn custom_sqrt(args: &[ColumnarValue]) -> Result<ColumnarValue> {\n\n let arg = &args[0];\n\n if let ColumnarValue::Array(v) = arg {\n\n let input = v\n\n .as_any()\n\n .downcast_ref::<Float64Array>()\n\n .expect(\"cast failed\");\n\n\n\n let array: Float64Array = input.iter().map(|v| v.map(|x| x.sqrt())).collect();\n\n Ok(ColumnarValue::Array(Arc::new(array)))\n\n } else {\n\n unimplemented!()\n\n }\n\n}\n\n\n\n#[tokio::test]\n\nasync fn csv_query_avg() -> Result<()> {\n\n let mut ctx = ExecutionContext::new();\n\n register_aggregate_csv(&mut ctx)?;\n\n let sql = \"SELECT avg(c12) FROM aggregate_test_100\";\n","file_path":"datafusion/tests/sql.rs","rank":85,"score":221783.90597410663},{"content":"pub fn lexcmp_array_rows<'a>(\n\n cols: impl Iterator<Item = &'a ArrayRef>,\n\n l_row: usize,\n\n r_row: usize,\n\n) -> Ordering {\n\n for c in cols {\n\n let o = cmp_array_row_same_types(c, l_row, c, r_row);\n\n if o != Ordering::Equal {\n\n return o;\n\n }\n\n }\n\n Ordering::Equal\n\n}\n","file_path":"datafusion/src/cube_ext/util.rs","rank":86,"score":220458.1776858169},{"content":"fn decode_protobuf<T: Message + Default>(bytes: &[u8]) -> Result<T> {\n\n T::decode(bytes).map_err(|e| {\n\n BallistaError::Internal(format!(\n\n \"Could not deserialize {}: {}\",\n\n type_name::<T>(),\n\n e\n\n ))\n\n })\n\n}\n\n\n","file_path":"ballista/rust/scheduler/src/state/mod.rs","rank":87,"score":218996.7187746701},{"content":"/// Returns the return type of a binary operator or an error when the binary operator cannot\n\n/// perform the computation between the argument's types, even after type coercion.\n\n///\n\n/// This function makes some assumptions about the underlying available computations.\n\npub fn binary_operator_data_type(\n\n lhs_type: &DataType,\n\n op: &Operator,\n\n rhs_type: &DataType,\n\n) -> Result<DataType> {\n\n // validate that it is possible to perform the operation on incoming types.\n\n // (or the return datatype cannot be infered)\n\n let common_type = common_binary_type(lhs_type, op, rhs_type)?;\n\n\n\n match op {\n\n // operators that return a boolean\n\n Operator::Eq\n\n | Operator::NotEq\n\n | Operator::And\n\n | Operator::Or\n\n | Operator::Like\n\n | Operator::NotLike\n\n | Operator::ILike\n\n | Operator::NotILike\n\n | Operator::Lt\n","file_path":"datafusion/src/physical_plan/expressions/binary.rs","rank":88,"score":218890.7397180245},{"content":"fn criterion_benchmark(c: &mut Criterion) {\n\n let partitions_len = 8;\n\n let array_len = 1024 * 1024;\n\n let batch_size = 8 * 1024;\n\n let ctx = create_context(partitions_len, array_len, batch_size).unwrap();\n\n\n\n c.bench_function(\"window empty over, aggregate functions\", |b| {\n\n b.iter(|| {\n\n query(\n\n ctx.clone(),\n\n \"SELECT \\\n\n MAX(f64) OVER (), \\\n\n MIN(f32) OVER (), \\\n\n SUM(u64_narrow) OVER () \\\n\n FROM t\",\n\n )\n\n })\n\n });\n\n\n\n c.bench_function(\"window empty over, built-in functions\", |b| {\n","file_path":"datafusion/benches/window_query_sql.rs","rank":89,"score":218884.29236605688},{"content":"fn optimize(plan: &LogicalPlan, mut state: State) -> Result<LogicalPlan> {\n\n match plan {\n\n LogicalPlan::Explain { .. } => {\n\n // push the optimization to the plan of this explain\n\n push_down(&state, plan)\n\n }\n\n LogicalPlan::Filter { input, predicate } => {\n\n let mut predicates = vec![];\n\n split_members(predicate, &mut predicates);\n\n\n\n // Predicates without referencing columns (WHERE FALSE, WHERE 1=1, etc.)\n\n let mut no_col_predicates = vec![];\n\n\n\n predicates\n\n .into_iter()\n\n .try_for_each::<_, Result<()>>(|predicate| {\n\n let mut columns: HashSet<Column> = HashSet::new();\n\n utils::expr_to_columns(predicate, &mut columns)?;\n\n if columns.is_empty() {\n\n no_col_predicates.push(predicate)\n","file_path":"datafusion/src/optimizer/filter_push_down.rs","rank":90,"score":218871.84976712946},{"content":"/// the signatures supported by the function `fun`.\n\npub fn signature(fun: &WindowFunction) -> Signature {\n\n match fun {\n\n WindowFunction::AggregateFunction(fun) => aggregates::signature(fun),\n\n WindowFunction::BuiltInWindowFunction(fun) => signature_for_built_in(fun),\n\n }\n\n}\n\n\n\n/// the signatures supported by the built-in window function `fun`.\n\npub(super) fn signature_for_built_in(fun: &BuiltInWindowFunction) -> Signature {\n\n // note: the physical expression must accept the type returned by this function or the execution panics.\n\n match fun {\n\n BuiltInWindowFunction::RowNumber\n\n | BuiltInWindowFunction::Rank\n\n | BuiltInWindowFunction::DenseRank\n\n | BuiltInWindowFunction::PercentRank\n\n | BuiltInWindowFunction::CumeDist => Signature::Any(0),\n\n BuiltInWindowFunction::Lag | BuiltInWindowFunction::Lead => {\n\n Signature::OneOf(vec![\n\n Signature::Any(1),\n\n Signature::Any(2),\n","file_path":"datafusion/src/physical_plan/window_functions.rs","rank":91,"score":217804.32525229102},{"content":"pub fn get_routes(scheduler_server: SchedulerServer) -> BoxedFilter<(impl Reply,)> {\n\n let routes = warp::path(\"state\")\n\n .and(with_data_server(scheduler_server))\n\n .and_then(handlers::scheduler_state);\n\n routes.boxed()\n\n}\n","file_path":"ballista/rust/scheduler/src/api/mod.rs","rank":92,"score":217079.55052341387},{"content":"/// Used for column names in schemas\n\npub fn physical_name(e: &Expr, input_schema: &DFSchema) -> Result<String> {\n\n match e {\n\n Expr::Column(c) => Ok(c.name.clone()),\n\n Expr::Alias(_, name) => Ok(name.clone()),\n\n Expr::ScalarVariable(variable_names) => Ok(variable_names.join(\".\")),\n\n Expr::Literal(value) => Ok(format!(\"{:?}\", value)),\n\n Expr::BinaryExpr { left, op, right } => {\n\n let left = physical_name(left, input_schema)?;\n\n let right = physical_name(right, input_schema)?;\n\n Ok(format!(\"{} {:?} {}\", left, op, right))\n\n }\n\n Expr::Case {\n\n expr,\n\n when_then_expr,\n\n else_expr,\n\n } => {\n\n let mut name = \"CASE \".to_string();\n\n if let Some(e) = expr {\n\n name += &format!(\"{:?} \", e);\n\n }\n","file_path":"datafusion/src/physical_plan/planner.rs","rank":93,"score":216922.79505555204},{"content":"/// Recursively call [`Column::normalize`] on all Column expressions\n\n/// in the `expr` expression tree.\n\npub fn normalize_col(expr: Expr, plan: &LogicalPlan) -> Result<Expr> {\n\n normalize_col_with_schemas(expr, &plan.all_schemas(), &plan.using_columns()?)\n\n}\n\n\n","file_path":"datafusion/src/logical_plan/expr.rs","rank":94,"score":216916.64891109645},{"content":"/// Return true if a value of type `type_from` can be coerced\n\n/// (losslessly converted) into a value of `type_to`\n\n///\n\n/// See the module level documentation for more detail on coercion.\n\npub fn can_coerce_from(type_into: &DataType, type_from: &DataType) -> bool {\n\n use self::DataType::*;\n\n match type_into {\n\n Int8 => matches!(type_from, Int8),\n\n Int16 => matches!(type_from, Int8 | Int16 | UInt8),\n\n Int32 => matches!(type_from, Int8 | Int16 | Int32 | UInt8 | UInt16),\n\n Int64 => matches!(\n\n type_from,\n\n Int8 | Int16 | Int32 | Int64 | UInt8 | UInt16 | UInt32\n\n ),\n\n UInt8 => matches!(type_from, UInt8),\n\n UInt16 => matches!(type_from, UInt8 | UInt16),\n\n UInt32 => matches!(type_from, UInt8 | UInt16 | UInt32),\n\n UInt64 => matches!(type_from, UInt8 | UInt16 | UInt32 | UInt64),\n\n Float32 => matches!(\n\n type_from,\n\n Int8 | Int16 | Int32 | Int64 | UInt8 | UInt16 | UInt32 | UInt64 | Float32\n\n ),\n\n Float64 => matches!(\n\n type_from,\n","file_path":"datafusion/src/physical_plan/type_coercion.rs","rank":95,"score":215942.85762053804},{"content":"/// Extract the value in `col[row]` from a dictionary a GroupByScalar\n\nfn dictionary_create_group_by_value<K: ArrowDictionaryKeyType>(\n\n col: &ArrayRef,\n\n row: usize,\n\n) -> Result<GroupByScalar> {\n\n let dict_col = col.as_any().downcast_ref::<DictionaryArray<K>>().unwrap();\n\n\n\n // look up the index in the values dictionary\n\n let keys_col = dict_col.keys();\n\n let values_index = keys_col.value(row).to_usize().ok_or_else(|| {\n\n DataFusionError::Internal(format!(\n\n \"Can not convert index to usize in dictionary of type creating group by value {:?}\",\n\n keys_col.data_type()\n\n ))\n\n })?;\n\n\n\n create_group_by_value(dict_col.values(), values_index)\n\n}\n\n\n\n/// Extract the value in `col[row]` as a GroupByScalar\n\npub(crate) fn create_group_by_value(col: &ArrayRef, row: usize) -> Result<GroupByScalar> {\n","file_path":"datafusion/src/physical_plan/hash_aggregate.rs","rank":96,"score":214329.75468675574},{"content":"#[inline]\n\npub fn unnormalize_cols(exprs: impl IntoIterator<Item = Expr>) -> Vec<Expr> {\n\n exprs.into_iter().map(unnormalize_col).collect()\n\n}\n\n\n","file_path":"datafusion/src/logical_plan/expr.rs","rank":97,"score":214245.57899277064},{"content":"fn encode_protobuf<T: Message + Default>(msg: &T) -> Result<Vec<u8>> {\n\n let mut value: Vec<u8> = Vec::with_capacity(msg.encoded_len());\n\n msg.encode(&mut value).map_err(|e| {\n\n BallistaError::Internal(format!(\n\n \"Could not serialize {}: {}\",\n\n type_name::<T>(),\n\n e\n\n ))\n\n })?;\n\n Ok(value)\n\n}\n\n\n\n#[cfg(all(test, feature = \"sled\"))]\n\nmod test {\n\n use std::sync::Arc;\n\n\n\n use ballista_core::serde::protobuf::{\n\n job_status, task_status, CompletedTask, FailedTask, JobStatus, PartitionId,\n\n QueuedJob, RunningJob, RunningTask, TaskStatus,\n\n };\n","file_path":"ballista/rust/scheduler/src/state/mod.rs","rank":98,"score":212977.80955505196},{"content":"// It's not possible to return &[u8], because trait in trait without short lifetime\n\nfn sha_process<D: SHA2Digest + Default>(input: &str) -> SHA2DigestOutput<D> {\n\n let mut digest = D::default();\n\n digest.update(&input);\n\n\n\n digest.finalize()\n\n}\n\n\n","file_path":"datafusion/src/physical_plan/crypto_expressions.rs","rank":99,"score":212753.53361634506}],"string":"[\n {\n \"content\": \"fn handle<F, R>(args: &[ColumnarValue], op: F, name: &str) -> Result<ColumnarValue>\\n\\nwhere\\n\\n R: AsRef<[u8]>,\\n\\n F: Fn(&str) -> R,\\n\\n{\\n\\n match &args[0] {\\n\\n ColumnarValue::Array(a) => match a.data_type() {\\n\\n DataType::Utf8 => {\\n\\n Ok(ColumnarValue::Array(Arc::new(unary_binary_function::<\\n\\n i32,\\n\\n _,\\n\\n _,\\n\\n >(\\n\\n &[a.as_ref()], op, name\\n\\n )?)))\\n\\n }\\n\\n DataType::LargeUtf8 => {\\n\\n Ok(ColumnarValue::Array(Arc::new(unary_binary_function::<\\n\\n i64,\\n\\n _,\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 0,\n \"score\": 418480.6843065396\n },\n {\n \"content\": \"fn handle<'a, F, R>(args: &'a [ColumnarValue], op: F, name: &str) -> Result<ColumnarValue>\\n\\nwhere\\n\\n R: AsRef<str>,\\n\\n F: Fn(&'a str) -> R,\\n\\n{\\n\\n match &args[0] {\\n\\n ColumnarValue::Array(a) => match a.data_type() {\\n\\n DataType::Utf8 => {\\n\\n Ok(ColumnarValue::Array(Arc::new(unary_string_function::<\\n\\n i32,\\n\\n i32,\\n\\n _,\\n\\n _,\\n\\n >(\\n\\n &[a.as_ref()], op, name\\n\\n )?)))\\n\\n }\\n\\n DataType::LargeUtf8 => {\\n\\n Ok(ColumnarValue::Array(Arc::new(unary_string_function::<\\n\\n i64,\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 1,\n \"score\": 409128.00970623724\n },\n {\n \"content\": \"/// Returns the datatype of the window function\\n\\npub fn return_type(fun: &WindowFunction, arg_types: &[DataType]) -> Result<DataType> {\\n\\n match fun {\\n\\n WindowFunction::AggregateFunction(fun) => aggregates::return_type(fun, arg_types),\\n\\n WindowFunction::BuiltInWindowFunction(fun) => {\\n\\n return_type_for_built_in(fun, arg_types)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Returns the datatype of the built-in window function\\n\\npub(super) fn return_type_for_built_in(\\n\\n fun: &BuiltInWindowFunction,\\n\\n arg_types: &[DataType],\\n\\n) -> Result<DataType> {\\n\\n // Note that this function *must* return the same type that the respective physical expression returns\\n\\n // or the execution panics.\\n\\n\\n\\n // verify that this is a valid set of data types for this function\\n\\n data_types(arg_types, &signature_for_built_in(fun))?;\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/window_functions.rs\",\n \"rank\": 2,\n \"score\": 375360.38169924164\n },\n {\n \"content\": \"/// Returns a cloned `Expr`, but any of the `Expr`'s in the tree may be\\n\\n/// replaced/customized by the replacement function.\\n\\n///\\n\\n/// The replacement function is called repeatedly with `Expr`, starting with\\n\\n/// the argument `expr`, then descending depth-first through its\\n\\n/// descendants. The function chooses to replace or keep (clone) each `Expr`.\\n\\n///\\n\\n/// The function's return type is `Result<Option<Expr>>>`, where:\\n\\n///\\n\\n/// * `Ok(Some(replacement_expr))`: A replacement `Expr` is provided; it is\\n\\n/// swapped in at the particular node in the tree. Any nested `Expr` are\\n\\n/// not subject to cloning/replacement.\\n\\n/// * `Ok(None)`: A replacement `Expr` is not provided. The `Expr` is\\n\\n/// recreated, with all of its nested `Expr`'s subject to\\n\\n/// cloning/replacement.\\n\\n/// * `Err(err)`: Any error returned by the function is returned as-is by\\n\\n/// `clone_with_replacement()`.\\n\\npub fn clone_with_replacement<F>(expr: &Expr, replacement_fn: &F) -> Result<Expr>\\n\\nwhere\\n\\n F: Fn(&Expr) -> Result<Option<Expr>>,\\n\\n{\\n\\n let replacement_opt = replacement_fn(expr)?;\\n\\n\\n\\n match replacement_opt {\\n\\n // If we were provided a replacement, use the replacement. Do not\\n\\n // descend further.\\n\\n Some(replacement) => Ok(replacement),\\n\\n // No replacement was provided, clone the node and recursively call\\n\\n // clone_with_replacement() on any nested expressions.\\n\\n None => match expr {\\n\\n Expr::AggregateFunction {\\n\\n fun,\\n\\n args,\\n\\n distinct,\\n\\n } => Ok(Expr::AggregateFunction {\\n\\n fun: fun.clone(),\\n\\n args: args\\n\",\n \"file_path\": \"datafusion/src/sql/utils.rs\",\n \"rank\": 3,\n \"score\": 371345.7518967459\n },\n {\n \"content\": \"#[allow(missing_docs)]\\n\\npub fn write_group_result_row(\\n\\n mode: AggregateMode,\\n\\n group_by_values: &[GroupByScalar],\\n\\n accumulator_set: &AccumulatorSet,\\n\\n key_fields: &[Field],\\n\\n key_columns: &mut Vec<Box<dyn ArrayBuilder>>,\\n\\n value_columns: &mut Vec<Box<dyn ArrayBuilder>>,\\n\\n) -> Result<()> {\\n\\n let add_key_columns = key_columns.is_empty();\\n\\n for i in 0..group_by_values.len() {\\n\\n match &group_by_values[i] {\\n\\n // Optimization to avoid allocation on conversion to ScalarValue.\\n\\n GroupByScalar::Utf8(str) => {\\n\\n if add_key_columns {\\n\\n key_columns.push(Box::new(StringBuilder::new(0)));\\n\\n }\\n\\n key_columns[i]\\n\\n .as_any_mut()\\n\\n .downcast_mut::<StringBuilder>()\\n\\n .unwrap()\\n\",\n \"file_path\": \"datafusion/src/physical_plan/hash_aggregate.rs\",\n \"rank\": 4,\n \"score\": 366401.78927313944\n },\n {\n \"content\": \"/// Propagates current span to blocking operation. See [spawn] for details.\\n\\npub fn spawn_blocking<F, R>(f: F) -> JoinHandle<R>\\n\\nwhere\\n\\n F: FnOnce() -> R + Send + 'static,\\n\\n R: Send + 'static,\\n\\n{\\n\\n if let Some(s) = new_subtask_span() {\\n\\n tokio::task::spawn_blocking(move || {\\n\\n let _p = s.parent; // ensure parent stays alive.\\n\\n s.child.in_scope(f)\\n\\n })\\n\\n } else {\\n\\n tokio::task::spawn_blocking(f)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/cube_ext/spawn.rs\",\n \"rank\": 5,\n \"score\": 351332.8371089396\n },\n {\n \"content\": \"/// Convert SQL data type to relational representation of data type\\n\\npub fn convert_data_type(sql: &SQLDataType) -> Result<DataType> {\\n\\n match sql {\\n\\n SQLDataType::Boolean => Ok(DataType::Boolean),\\n\\n SQLDataType::SmallInt => Ok(DataType::Int16),\\n\\n SQLDataType::Int => Ok(DataType::Int32),\\n\\n SQLDataType::BigInt => Ok(DataType::Int64),\\n\\n SQLDataType::Float(_) | SQLDataType::Real => Ok(DataType::Float64),\\n\\n SQLDataType::Double => Ok(DataType::Float64),\\n\\n SQLDataType::Char(_) | SQLDataType::Varchar(_) => Ok(DataType::Utf8),\\n\\n SQLDataType::Timestamp => Ok(DataType::Timestamp(TimeUnit::Nanosecond, None)),\\n\\n SQLDataType::Date => Ok(DataType::Date32),\\n\\n other => Err(DataFusionError::NotImplemented(format!(\\n\\n \\\"Unsupported SQL type {:?}\\\",\\n\\n other\\n\\n ))),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\",\n \"file_path\": \"datafusion/src/sql/planner.rs\",\n \"rank\": 6,\n \"score\": 336878.6714877247\n },\n {\n \"content\": \"/// function return type of an average\\n\\npub fn avg_return_type(arg_type: &DataType) -> Result<DataType> {\\n\\n match arg_type {\\n\\n DataType::Int8\\n\\n | DataType::Int16\\n\\n | DataType::Int32\\n\\n | DataType::Int64\\n\\n | DataType::UInt8\\n\\n | DataType::UInt16\\n\\n | DataType::UInt32\\n\\n | DataType::UInt64\\n\\n | DataType::Float32\\n\\n | DataType::Float64 => Ok(DataType::Float64),\\n\\n other => Err(DataFusionError::Plan(format!(\\n\\n \\\"AVG does not support {:?}\\\",\\n\\n other\\n\\n ))),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Avg {\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/average.rs\",\n \"rank\": 7,\n \"score\": 333590.1468000982\n },\n {\n \"content\": \"/// function return type of a sum\\n\\npub fn sum_return_type(arg_type: &DataType) -> Result<DataType> {\\n\\n match arg_type {\\n\\n DataType::Int8 | DataType::Int16 | DataType::Int32 | DataType::Int64 => {\\n\\n Ok(DataType::Int64)\\n\\n }\\n\\n DataType::Int64Decimal(scale) => Ok(DataType::Int64Decimal(*scale)),\\n\\n DataType::UInt8 | DataType::UInt16 | DataType::UInt32 | DataType::UInt64 => {\\n\\n Ok(DataType::UInt64)\\n\\n }\\n\\n DataType::Float32 => Ok(DataType::Float32),\\n\\n DataType::Float64 => Ok(DataType::Float64),\\n\\n other => Err(DataFusionError::Plan(format!(\\n\\n \\\"SUM does not support type \\\\\\\"{:?}\\\\\\\"\\\",\\n\\n other\\n\\n ))),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Sum {\\n\\n /// Create a new SUM aggregate function\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/sum.rs\",\n \"rank\": 8,\n \"score\": 333590.1468000982\n },\n {\n \"content\": \"/// rewrite a `Vec` of `Expr`s with the rewriter\\n\\nfn rewrite_vec<R>(v: Vec<Expr>, rewriter: &mut R) -> Result<Vec<Expr>>\\n\\nwhere\\n\\n R: ExprRewriter,\\n\\n{\\n\\n v.into_iter().map(|expr| expr.rewrite(rewriter)).collect()\\n\\n}\\n\\n\\n\\n/// Controls how the visitor recursion should proceed.\\n\\npub enum Recursion<V: ExpressionVisitor> {\\n\\n /// Attempt to visit all the children, recursively, of this expression.\\n\\n Continue(V),\\n\\n /// Do not visit the children of this expression, though the walk\\n\\n /// of parents of this expression will not be affected\\n\\n Stop(V),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/logical_plan/expr.rs\",\n \"rank\": 10,\n \"score\": 327806.6815817945\n },\n {\n \"content\": \"fn tuple_err<T, R>(value: (Result<T>, Result<R>)) -> Result<(T, R)> {\\n\\n match value {\\n\\n (Ok(e), Ok(e1)) => Ok((e, e1)),\\n\\n (Err(e), Ok(_)) => Err(e),\\n\\n (Ok(_), Err(e1)) => Err(e1),\\n\\n (Err(e), Err(_)) => Err(e),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::logical_plan::{DFField, DFSchema, DFSchemaRef};\\n\\n use crate::physical_plan::{csv::CsvReadOptions, expressions, Partitioning};\\n\\n use crate::scalar::ScalarValue;\\n\\n use crate::{\\n\\n logical_plan::{col, lit, sum, LogicalPlanBuilder},\\n\\n physical_plan::SendableRecordBatchStream,\\n\\n };\\n\\n use arrow::datatypes::{DataType, Field, SchemaRef};\\n\",\n \"file_path\": \"datafusion/src/physical_plan/planner.rs\",\n \"rank\": 11,\n \"score\": 324233.01660493\n },\n {\n \"content\": \"/// Returns the datatype of the scalar function\\n\\npub fn return_type(fun: &AggregateFunction, arg_types: &[DataType]) -> Result<DataType> {\\n\\n // Note that this function *must* return the same type that the respective physical expression returns\\n\\n // or the execution panics.\\n\\n\\n\\n // verify that this is a valid set of data types for this function\\n\\n data_types(arg_types, &signature(fun))?;\\n\\n\\n\\n match fun {\\n\\n AggregateFunction::Count => Ok(DataType::UInt64),\\n\\n AggregateFunction::Max | AggregateFunction::Min => Ok(arg_types[0].clone()),\\n\\n AggregateFunction::Sum => sum_return_type(&arg_types[0]),\\n\\n AggregateFunction::Avg => avg_return_type(&arg_types[0]),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/aggregates.rs\",\n \"rank\": 12,\n \"score\": 321970.2322467006\n },\n {\n \"content\": \"/// Recursively builds a list of files in a directory with a given extension\\n\\npub fn build_file_list(dir: &str, ext: &str) -> Result<Vec<String>> {\\n\\n let mut filenames: Vec<String> = Vec::new();\\n\\n build_file_list_recurse(dir, &mut filenames, ext)?;\\n\\n Ok(filenames)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/common.rs\",\n \"rank\": 13,\n \"score\": 308593.0411597548\n },\n {\n \"content\": \"pub fn ballista_error(message: &str) -> BallistaError {\\n\\n BallistaError::General(message.to_owned())\\n\\n}\\n\\n\\n\\nimpl From<String> for BallistaError {\\n\\n fn from(e: String) -> Self {\\n\\n BallistaError::General(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<ArrowError> for BallistaError {\\n\\n fn from(e: ArrowError) -> Self {\\n\\n BallistaError::ArrowError(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<parser::ParserError> for BallistaError {\\n\\n fn from(e: parser::ParserError) -> Self {\\n\\n BallistaError::SqlError(e)\\n\\n }\\n\",\n \"file_path\": \"ballista/rust/core/src/error.rs\",\n \"rank\": 14,\n \"score\": 306164.1734483945\n },\n {\n \"content\": \"/// some tests share a common table with different names\\n\\npub fn test_table_scan_with_name(name: &str) -> Result<LogicalPlan> {\\n\\n let schema = Schema::new(vec![\\n\\n Field::new(\\\"a\\\", DataType::UInt32, false),\\n\\n Field::new(\\\"b\\\", DataType::UInt32, false),\\n\\n Field::new(\\\"c\\\", DataType::UInt32, false),\\n\\n ]);\\n\\n LogicalPlanBuilder::scan_empty(Some(name), &schema, None)?.build()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/test/mod.rs\",\n \"rank\": 15,\n \"score\": 306080.56563583063\n },\n {\n \"content\": \"/// all tests share a common table\\n\\npub fn test_table_scan_with_alias(alias: &str) -> Result<LogicalPlan> {\\n\\n let schema = Schema::new(vec![\\n\\n Field::new(\\\"a\\\", DataType::UInt32, false),\\n\\n Field::new(\\\"b\\\", DataType::UInt32, false),\\n\\n Field::new(\\\"c\\\", DataType::UInt32, false),\\n\\n ]);\\n\\n LogicalPlanBuilder::scan_empty(Some(alias), &schema, None)?.build()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/test/mod.rs\",\n \"rank\": 16,\n \"score\": 306080.56563583063\n },\n {\n \"content\": \"fn data_type_id(id: &i32) -> Result<DataType, errors::DataFusionError> {\\n\\n // see https://github.com/apache/arrow/blob/3694794bdfd0677b95b8c95681e392512f1c9237/python/pyarrow/includes/libarrow.pxd\\n\\n // this is not ideal as it does not generalize for non-basic types\\n\\n // Find a way to get a unique name from the pyarrow.DataType\\n\\n Ok(match id {\\n\\n 1 => DataType::Boolean,\\n\\n 2 => DataType::UInt8,\\n\\n 3 => DataType::Int8,\\n\\n 4 => DataType::UInt16,\\n\\n 5 => DataType::Int16,\\n\\n 6 => DataType::UInt32,\\n\\n 7 => DataType::Int32,\\n\\n 8 => DataType::UInt64,\\n\\n 9 => DataType::Int64,\\n\\n 10 => DataType::Float16,\\n\\n 11 => DataType::Float32,\\n\\n 12 => DataType::Float64,\\n\\n 13 => DataType::Utf8,\\n\\n 14 => DataType::Binary,\\n\\n 34 => DataType::LargeUtf8,\\n\\n 35 => DataType::LargeBinary,\\n\\n other => {\\n\\n return Err(errors::DataFusionError::Common(format!(\\n\\n \\\"The type {} is not valid\\\",\\n\\n other\\n\\n )))\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"python/src/types.rs\",\n \"rank\": 17,\n \"score\": 302793.0540222621\n },\n {\n \"content\": \"pub fn datafusion_test_context(path: &str) -> Result<ExecutionContext> {\\n\\n let default_shuffle_partitions = 2;\\n\\n let config = ExecutionConfig::new().with_concurrency(default_shuffle_partitions);\\n\\n let mut ctx = ExecutionContext::with_config(config);\\n\\n for table in TPCH_TABLES {\\n\\n let schema = get_tpch_schema(table);\\n\\n let options = CsvReadOptions::new()\\n\\n .schema(&schema)\\n\\n .delimiter(b'|')\\n\\n .has_header(false)\\n\\n .file_extension(\\\".tbl\\\");\\n\\n let dir = format!(\\\"{}/{}\\\", path, table);\\n\\n ctx.register_csv(table, &dir, options)?;\\n\\n }\\n\\n Ok(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ballista/rust/scheduler/src/test_utils.rs\",\n \"rank\": 18,\n \"score\": 302784.7438203158\n },\n {\n \"content\": \"/// Returns a directory path for finding test data.\\n\\n///\\n\\n/// udf_env: name of an environment variable\\n\\n///\\n\\n/// submodule_dir: fallback path (relative to CARGO_MANIFEST_DIR)\\n\\n///\\n\\n/// Returns either:\\n\\n/// The path referred to in `udf_env` if that variable is set and refers to a directory\\n\\n/// The submodule_data directory relative to CARGO_MANIFEST_PATH\\n\\nfn get_data_dir(udf_env: &str, submodule_data: &str) -> Result<PathBuf, Box<dyn Error>> {\\n\\n // Try user defined env.\\n\\n if let Ok(dir) = env::var(udf_env) {\\n\\n let trimmed = dir.trim().to_string();\\n\\n if !trimmed.is_empty() {\\n\\n let pb = PathBuf::from(trimmed);\\n\\n if pb.is_dir() {\\n\\n return Ok(pb);\\n\\n } else {\\n\\n return Err(format!(\\n\\n \\\"the data dir `{}` defined by env {} not found\\\",\\n\\n pb.display().to_string(),\\n\\n udf_env\\n\\n )\\n\\n .into());\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n // The env is undefined or its value is trimmed to empty, let's try default dir.\\n\",\n \"file_path\": \"datafusion/src/test_util.rs\",\n \"rank\": 19,\n \"score\": 297438.9154651019\n },\n {\n \"content\": \"#[allow(clippy::boxed_local)]\\n\\nfn rewrite_boxed<R>(boxed_expr: Box<Expr>, rewriter: &mut R) -> Result<Box<Expr>>\\n\\nwhere\\n\\n R: ExprRewriter,\\n\\n{\\n\\n // TODO: It might be possible to avoid an allocation (the\\n\\n // Box::new) below by reusing the box.\\n\\n let expr: Expr = *boxed_expr;\\n\\n let rewritten_expr = expr.rewrite(rewriter)?;\\n\\n Ok(Box::new(rewritten_expr))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/logical_plan/expr.rs\",\n \"rank\": 20,\n \"score\": 296234.9473511569\n },\n {\n \"content\": \"/// Generated partitioned copy of a CSV file\\n\\npub fn create_partitioned_csv(filename: &str, partitions: usize) -> Result<String> {\\n\\n let testdata = crate::test_util::arrow_test_data();\\n\\n let path = format!(\\\"{}/csv/{}\\\", testdata, filename);\\n\\n\\n\\n let tmp_dir = TempDir::new()?;\\n\\n\\n\\n let mut writers = vec![];\\n\\n for i in 0..partitions {\\n\\n let filename = format!(\\\"partition-{}.csv\\\", i);\\n\\n let filename = tmp_dir.path().join(&filename);\\n\\n\\n\\n let writer = BufWriter::new(File::create(&filename).unwrap());\\n\\n writers.push(writer);\\n\\n }\\n\\n\\n\\n let f = File::open(&path)?;\\n\\n let f = BufReader::new(f);\\n\\n for (i, line) in f.lines().enumerate() {\\n\\n let line = line.unwrap();\\n\\n\\n\",\n \"file_path\": \"datafusion/src/test/mod.rs\",\n \"rank\": 21,\n \"score\": 294952.8930606079\n },\n {\n \"content\": \"/// put values in an array.\\n\\npub fn array(values: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n let arrays: Vec<&dyn Array> = values\\n\\n .iter()\\n\\n .map(|value| {\\n\\n if let ColumnarValue::Array(value) = value {\\n\\n Ok(value.as_ref())\\n\\n } else {\\n\\n Err(DataFusionError::NotImplemented(\\n\\n \\\"Array is not implemented for scalar values.\\\".to_string(),\\n\\n ))\\n\\n }\\n\\n })\\n\\n .collect::<Result<_>>()?;\\n\\n\\n\\n Ok(ColumnarValue::Array(array_array(&arrays)?))\\n\\n}\\n\\n\\n\\n/// Currently supported types by the array function.\\n\\n/// The order of these types correspond to the order on which coercion applies\\n\\n/// This should thus be from least informative to most informative\\n\",\n \"file_path\": \"datafusion/src/physical_plan/array_expressions.rs\",\n \"rank\": 22,\n \"score\": 294208.8706321672\n },\n {\n \"content\": \"pub fn produce_diagram(filename: &str, stages: &[Arc<ShuffleWriterExec>]) -> Result<()> {\\n\\n let write_file = File::create(filename)?;\\n\\n let mut w = BufWriter::new(&write_file);\\n\\n writeln!(w, \\\"digraph G {{\\\")?;\\n\\n\\n\\n // draw stages and entities\\n\\n for stage in stages {\\n\\n writeln!(w, \\\"\\\\tsubgraph cluster{} {{\\\", stage.stage_id())?;\\n\\n writeln!(w, \\\"\\\\t\\\\tlabel = \\\\\\\"Stage {}\\\\\\\";\\\", stage.stage_id())?;\\n\\n let mut id = AtomicUsize::new(0);\\n\\n build_exec_plan_diagram(\\n\\n &mut w,\\n\\n stage.children()[0].as_ref(),\\n\\n stage.stage_id(),\\n\\n &mut id,\\n\\n true,\\n\\n )?;\\n\\n writeln!(w, \\\"\\\\t}}\\\")?;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"ballista/rust/core/src/utils.rs\",\n \"rank\": 23,\n \"score\": 288470.1884757816\n },\n {\n \"content\": \"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\\n\\npub fn md5(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n match &args[0] {\\n\\n ColumnarValue::Array(a) => match a.data_type() {\\n\\n DataType::Utf8 => Ok(ColumnarValue::Array(Arc::new(md5_array::<i32>(&[\\n\\n a.as_ref()\\n\\n ])?))),\\n\\n DataType::LargeUtf8 => {\\n\\n Ok(ColumnarValue::Array(Arc::new(md5_array::<i64>(&[\\n\\n a.as_ref()\\n\\n ])?)))\\n\\n }\\n\\n other => Err(DataFusionError::Internal(format!(\\n\\n \\\"Unsupported data type {:?} for function md5\\\",\\n\\n other,\\n\\n ))),\\n\\n },\\n\\n ColumnarValue::Scalar(scalar) => match scalar {\\n\\n ScalarValue::Utf8(a) => {\\n\\n let result = a.as_ref().map(|x| md5_process(x));\\n\\n Ok(ColumnarValue::Scalar(ScalarValue::Utf8(result)))\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 25,\n \"score\": 287697.8275211335\n },\n {\n \"content\": \"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\\n\\npub fn sha512(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle(args, sha_process::<Sha512>, \\\"sha512\\\")\\n\\n}\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 26,\n \"score\": 287697.8275211335\n },\n {\n \"content\": \"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\\n\\npub fn sha384(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle(args, sha_process::<Sha384>, \\\"sha384\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 27,\n \"score\": 287697.8275211335\n },\n {\n \"content\": \"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\\n\\npub fn sha256(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle(args, sha_process::<Sha256>, \\\"sha256\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 28,\n \"score\": 287697.8275211335\n },\n {\n \"content\": \"/// crypto function that accepts Utf8 or LargeUtf8 and returns a [`ColumnarValue`]\\n\\npub fn sha224(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle(args, sha_process::<Sha224>, \\\"ssh224\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 29,\n \"score\": 287697.8275211335\n },\n {\n \"content\": \"/// Converts the string to all upper case.\\n\\n/// upper('tom') = 'TOM'\\n\\npub fn upper(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle(args, |string| string.to_ascii_uppercase(), \\\"upper\\\")\\n\\n}\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 30,\n \"score\": 287691.8817770411\n },\n {\n \"content\": \"/// Converts the string to all lower case.\\n\\n/// lower('TOM') = 'tom'\\n\\npub fn lower(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle(args, |string| string.to_ascii_lowercase(), \\\"lower\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 31,\n \"score\": 287691.8817770411\n },\n {\n \"content\": \"/// Concatenates the text representations of all the arguments. NULL arguments are ignored.\\n\\n/// concat('abcde', 2, NULL, 22) = 'abcde222'\\n\\npub fn concat(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n // do not accept 0 arguments.\\n\\n if args.is_empty() {\\n\\n return Err(DataFusionError::Internal(format!(\\n\\n \\\"concat was called with {} arguments. It requires at least 1.\\\",\\n\\n args.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n // first, decide whether to return a scalar or a vector.\\n\\n let mut return_array = args.iter().filter_map(|x| match x {\\n\\n ColumnarValue::Array(array) => Some(array.len()),\\n\\n _ => None,\\n\\n });\\n\\n if let Some(size) = return_array.next() {\\n\\n let result = (0..size)\\n\\n .map(|index| {\\n\\n let mut owned_string: String = \\\"\\\".to_owned();\\n\\n for arg in args {\\n\\n match arg {\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 32,\n \"score\": 287685.6398648054\n },\n {\n \"content\": \"/// to_timestamp SQL function\\n\\npub fn to_timestamp(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle::<TimestampNanosecondType, _, TimestampNanosecondType>(\\n\\n args,\\n\\n string_to_timestamp_nanos_shim,\\n\\n \\\"to_timestamp\\\",\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 33,\n \"score\": 287685.6398648054\n },\n {\n \"content\": \"/// random SQL function\\n\\npub fn random(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n let len: usize = match &args[0] {\\n\\n ColumnarValue::Array(array) => array.len(),\\n\\n _ => {\\n\\n return Err(DataFusionError::Internal(\\n\\n \\\"Expect random function to take no param\\\".to_string(),\\n\\n ))\\n\\n }\\n\\n };\\n\\n let mut rng = thread_rng();\\n\\n let values = iter::repeat_with(|| rng.gen_range(0.0..1.0)).take(len);\\n\\n let array = Float64Array::from_iter_values(values);\\n\\n Ok(ColumnarValue::Array(Arc::new(array)))\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\n\\n use super::*;\\n\\n use arrow::array::{Float64Array, NullArray};\\n\",\n \"file_path\": \"datafusion/src/physical_plan/math_expressions.rs\",\n \"rank\": 34,\n \"score\": 287685.6398648054\n },\n {\n \"content\": \"/// Recursively walk a list of expression trees, collecting the unique set of columns\\n\\n/// referenced in the expression\\n\\npub fn exprlist_to_columns(expr: &[Expr], accum: &mut HashSet<Column>) -> Result<()> {\\n\\n for e in expr {\\n\\n expr_to_columns(e, accum)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/optimizer/utils.rs\",\n \"rank\": 35,\n \"score\": 286960.2248272653\n },\n {\n \"content\": \"/// Recursively walk an expression tree, collecting the unique set of columns\\n\\n/// referenced in the expression\\n\\npub fn expr_to_columns(expr: &Expr, accum: &mut HashSet<Column>) -> Result<()> {\\n\\n expr.accept(ColumnNameVisitor { accum })?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/optimizer/utils.rs\",\n \"rank\": 36,\n \"score\": 286960.2248272653\n },\n {\n \"content\": \"/// Implements NULLIF(expr1, expr2)\\n\\n/// Args: 0 - left expr is any array\\n\\n/// 1 - if the left is equal to this expr2, then the result is NULL, otherwise left value is passed.\\n\\n///\\n\\npub fn nullif_func(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n if args.len() != 2 {\\n\\n return Err(DataFusionError::Internal(format!(\\n\\n \\\"{:?} args were supplied but NULLIF takes exactly two args\\\",\\n\\n args.len(),\\n\\n )));\\n\\n }\\n\\n\\n\\n let (lhs, rhs) = (&args[0], &args[1]);\\n\\n\\n\\n match (lhs, rhs) {\\n\\n (ColumnarValue::Array(lhs), ColumnarValue::Scalar(rhs)) => {\\n\\n let cond_array = binary_array_op_scalar!(lhs, rhs.clone(), eq).unwrap()?;\\n\\n\\n\\n let array = primitive_bool_array_op!(lhs, *cond_array, nullif)?;\\n\\n\\n\\n Ok(ColumnarValue::Array(array))\\n\\n }\\n\\n (ColumnarValue::Array(lhs), ColumnarValue::Array(rhs)) => {\\n\\n // Get args0 == args1 evaluated and produce a boolean array\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/nullif.rs\",\n \"rank\": 37,\n \"score\": 284532.514620138\n },\n {\n \"content\": \"/// to_timestamp_millis SQL function\\n\\npub fn to_timestamp_millis(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle::<TimestampMillisecondType, _, TimestampMillisecondType>(\\n\\n args,\\n\\n |s| string_to_timestamp_nanos_shim(s).map(|n| n / 1_000_000),\\n\\n \\\"to_timestamp_millis\\\",\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 38,\n \"score\": 284521.10630423814\n },\n {\n \"content\": \"/// to_timestamp_seconds SQL function\\n\\npub fn to_timestamp_seconds(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle::<TimestampSecondType, _, TimestampSecondType>(\\n\\n args,\\n\\n |s| string_to_timestamp_nanos_shim(s).map(|n| n / 1_000_000_000),\\n\\n \\\"to_timestamp_seconds\\\",\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 39,\n \"score\": 284521.10630423814\n },\n {\n \"content\": \"/// date_trunc SQL function\\n\\npub fn date_trunc(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n let (granularity, array) = (&args[0], &args[1]);\\n\\n\\n\\n let granularity =\\n\\n if let ColumnarValue::Scalar(ScalarValue::Utf8(Some(v))) = granularity {\\n\\n v\\n\\n } else {\\n\\n return Err(DataFusionError::Execution(\\n\\n \\\"Granularity of `date_trunc` must be non-null scalar Utf8\\\".to_string(),\\n\\n ));\\n\\n };\\n\\n\\n\\n let f = |x: Option<i64>| x.map(|x| date_trunc_single(granularity, x)).transpose();\\n\\n\\n\\n Ok(match array {\\n\\n ColumnarValue::Scalar(scalar) => {\\n\\n if let ScalarValue::TimestampNanosecond(v) = scalar {\\n\\n ColumnarValue::Scalar(ScalarValue::TimestampNanosecond((f)(*v)?))\\n\\n } else {\\n\\n return Err(DataFusionError::Execution(\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 40,\n \"score\": 284521.10630423814\n },\n {\n \"content\": \"/// DATE_PART SQL function\\n\\npub fn date_part(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n if args.len() != 2 {\\n\\n return Err(DataFusionError::Execution(\\n\\n \\\"Expected two arguments in DATE_PART\\\".to_string(),\\n\\n ));\\n\\n }\\n\\n let (date_part, array) = (&args[0], &args[1]);\\n\\n\\n\\n let date_part = if let ColumnarValue::Scalar(ScalarValue::Utf8(Some(v))) = date_part {\\n\\n v\\n\\n } else {\\n\\n return Err(DataFusionError::Execution(\\n\\n \\\"First argument of `DATE_PART` must be non-null scalar Utf8\\\".to_string(),\\n\\n ));\\n\\n };\\n\\n\\n\\n let is_scalar = matches!(array, ColumnarValue::Scalar(_));\\n\\n\\n\\n let array = match array {\\n\\n ColumnarValue::Array(array) => array.clone(),\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 41,\n \"score\": 284521.10630423814\n },\n {\n \"content\": \"/// to_timestamp_micros SQL function\\n\\npub fn to_timestamp_micros(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n handle::<TimestampMicrosecondType, _, TimestampMicrosecondType>(\\n\\n args,\\n\\n |s| string_to_timestamp_nanos_shim(s).map(|n| n / 1_000),\\n\\n \\\"to_timestamp_micros\\\",\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 42,\n \"score\": 284521.10630423814\n },\n {\n \"content\": \"/// Returns the datatype of the scalar function\\n\\npub fn return_type(\\n\\n fun: &BuiltinScalarFunction,\\n\\n arg_types: &[DataType],\\n\\n) -> Result<DataType> {\\n\\n // Note that this function *must* return the same type that the respective physical expression returns\\n\\n // or the execution panics.\\n\\n\\n\\n // verify that this is a valid set of data types for this function\\n\\n data_types(arg_types, &signature(fun))?;\\n\\n\\n\\n // the return type of the built in function.\\n\\n // Some built-in functions' return type depends on the incoming type.\\n\\n match fun {\\n\\n BuiltinScalarFunction::Array => Ok(DataType::FixedSizeList(\\n\\n Box::new(Field::new(\\\"item\\\", arg_types[0].clone(), true)),\\n\\n arg_types.len() as i32,\\n\\n )),\\n\\n BuiltinScalarFunction::Ascii => Ok(DataType::Int32),\\n\\n BuiltinScalarFunction::BitLength => utf8_to_int_type(&arg_types[0], \\\"bit_length\\\"),\\n\\n BuiltinScalarFunction::Btrim => utf8_to_str_type(&arg_types[0], \\\"btrim\\\"),\\n\",\n \"file_path\": \"datafusion/src/physical_plan/functions.rs\",\n \"rank\": 43,\n \"score\": 280040.382574402\n },\n {\n \"content\": \"/// Appends a sequence of [u8] bytes for the value in `col[row]` to\\n\\n/// `vec` to be used as a key into the hash map\\n\\nfn create_key_for_col(col: &ArrayRef, row: usize, vec: &mut KeyVec) -> Result<()> {\\n\\n match col.data_type() {\\n\\n DataType::Boolean => {\\n\\n let array = col.as_any().downcast_ref::<BooleanArray>().unwrap();\\n\\n vec.extend_from_slice(&[array.value(row) as u8]);\\n\\n }\\n\\n DataType::Float32 => {\\n\\n let array = col.as_any().downcast_ref::<Float32Array>().unwrap();\\n\\n vec.extend_from_slice(&array.value(row).to_le_bytes());\\n\\n }\\n\\n DataType::Float64 => {\\n\\n let array = col.as_any().downcast_ref::<Float64Array>().unwrap();\\n\\n vec.extend_from_slice(&array.value(row).to_le_bytes());\\n\\n }\\n\\n DataType::UInt8 => {\\n\\n let array = col.as_any().downcast_ref::<UInt8Array>().unwrap();\\n\\n vec.extend_from_slice(&array.value(row).to_le_bytes());\\n\\n }\\n\\n DataType::UInt16 => {\\n\\n let array = col.as_any().downcast_ref::<UInt16Array>().unwrap();\\n\",\n \"file_path\": \"datafusion/src/physical_plan/hash_aggregate.rs\",\n \"rank\": 44,\n \"score\": 276860.986116309\n },\n {\n \"content\": \"/// Create a column expression\\n\\npub fn col(name: &str, schema: &Schema) -> Result<Arc<dyn PhysicalExpr>> {\\n\\n Ok(Arc::new(Column::new_with_schema(name, schema)?))\\n\\n}\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/column.rs\",\n \"rank\": 45,\n \"score\": 276143.66452859604\n },\n {\n \"content\": \"/// Extract the values in `group_by_keys` arrow arrays into the target vector\\n\\n/// as GroupByScalar values\\n\\npub fn create_group_by_values(\\n\\n group_by_keys: &[ArrayRef],\\n\\n row: usize,\\n\\n vec: &mut SmallVec<[GroupByScalar; 2]>,\\n\\n) -> Result<()> {\\n\\n for (i, col) in group_by_keys.iter().enumerate() {\\n\\n vec[i] = create_group_by_value(col, row)?\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nasync fn compute_grouped_sorted_aggregate(\\n\\n mode: AggregateMode,\\n\\n schema: SchemaRef,\\n\\n group_expr: Vec<Arc<dyn PhysicalExpr>>,\\n\\n aggr_expr: Vec<Arc<dyn AggregateExpr>>,\\n\\n mut input: SendableRecordBatchStream,\\n\\n) -> ArrowResult<RecordBatch> {\\n\\n // the expressions to evaluate the batch, one vec of expressions per aggregation\\n\\n let aggregate_expressions =\\n\",\n \"file_path\": \"datafusion/src/physical_plan/hash_aggregate.rs\",\n \"rank\": 46,\n \"score\": 271915.3162133056\n },\n {\n \"content\": \"/// Panics if arrays are of different types. Comparison is ascending, null first.\\n\\npub fn cmp_array_row_same_types(\\n\\n l: &ArrayRef,\\n\\n l_row: usize,\\n\\n r: &ArrayRef,\\n\\n r_row: usize,\\n\\n) -> Ordering {\\n\\n let l_null = l.is_null(l_row);\\n\\n let r_null = r.is_null(r_row);\\n\\n if l_null && r_null {\\n\\n return Ordering::Equal;\\n\\n }\\n\\n if l_null && !r_null {\\n\\n return Ordering::Less;\\n\\n }\\n\\n if !l_null && r_null {\\n\\n return Ordering::Greater;\\n\\n }\\n\\n\\n\\n macro_rules! cmp_row {\\n\\n ($l: expr, Float32Array, $($rest: tt)*) => {{\\n\",\n \"file_path\": \"datafusion/src/cube_ext/util.rs\",\n \"rank\": 47,\n \"score\": 271897.83156633005\n },\n {\n \"content\": \"/// convert_tz SQL function\\n\\npub fn convert_tz(args: &[ArrayRef]) -> Result<ArrayRef> {\\n\\n let timestamps = &args[0]\\n\\n .as_any()\\n\\n .downcast_ref::<TimestampNanosecondArray>()\\n\\n .ok_or_else(|| {\\n\\n DataFusionError::Execution(\\n\\n \\\"Could not cast convert_tz timestamp input to TimestampNanosecondArray\\\"\\n\\n .to_string(),\\n\\n )\\n\\n })?;\\n\\n\\n\\n let shift = &args[1]\\n\\n .as_any()\\n\\n .downcast_ref::<StringArray>()\\n\\n .ok_or_else(|| {\\n\\n DataFusionError::Execution(\\n\\n \\\"Could not cast convert_tz shift input to StringArray\\\".to_string(),\\n\\n )\\n\\n })?;\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 48,\n \"score\": 270821.7754734948\n },\n {\n \"content\": \"pub fn assert_fields_eq(plan: &LogicalPlan, expected: Vec<&str>) {\\n\\n let actual: Vec<String> = plan\\n\\n .schema()\\n\\n .fields()\\n\\n .iter()\\n\\n .map(|f| f.name().clone())\\n\\n .collect();\\n\\n assert_eq!(actual, expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/test/mod.rs\",\n \"rank\": 49,\n \"score\": 270522.3567157234\n },\n {\n \"content\": \"fn date_trunc_single(granularity: &str, value: i64) -> Result<i64> {\\n\\n let value = timestamp_ns_to_datetime(value).with_nanosecond(0);\\n\\n let value = match granularity {\\n\\n \\\"second\\\" => value,\\n\\n \\\"minute\\\" => value.and_then(|d| d.with_second(0)),\\n\\n \\\"hour\\\" => value\\n\\n .and_then(|d| d.with_second(0))\\n\\n .and_then(|d| d.with_minute(0)),\\n\\n \\\"day\\\" => value\\n\\n .and_then(|d| d.with_second(0))\\n\\n .and_then(|d| d.with_minute(0))\\n\\n .and_then(|d| d.with_hour(0)),\\n\\n \\\"week\\\" => value\\n\\n .and_then(|d| d.with_second(0))\\n\\n .and_then(|d| d.with_minute(0))\\n\\n .and_then(|d| d.with_hour(0))\\n\\n .map(|d| d - Duration::seconds(60 * 60 * 24 * d.weekday() as i64)),\\n\\n \\\"month\\\" => value\\n\\n .and_then(|d| d.with_second(0))\\n\\n .and_then(|d| d.with_minute(0))\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 50,\n \"score\": 268348.96001933055\n },\n {\n \"content\": \"pub fn decode_protobuf(bytes: &[u8]) -> Result<BallistaAction, BallistaError> {\\n\\n let mut buf = Cursor::new(bytes);\\n\\n\\n\\n protobuf::Action::decode(&mut buf)\\n\\n .map_err(|e| BallistaError::Internal(format!(\\\"{:?}\\\", e)))\\n\\n .and_then(|node| node.try_into())\\n\\n}\\n\\n\\n\\npub(crate) fn proto_error<S: Into<String>>(message: S) -> BallistaError {\\n\\n BallistaError::General(message.into())\\n\\n}\\n\\n\\n\\n#[macro_export]\\n\\nmacro_rules! convert_required {\\n\\n ($PB:expr) => {{\\n\\n if let Some(field) = $PB.as_ref() {\\n\\n field.try_into()\\n\\n } else {\\n\\n Err(proto_error(\\\"Missing required field in protobuf\\\"))\\n\\n }\\n\",\n \"file_path\": \"ballista/rust/core/src/serde/mod.rs\",\n \"rank\": 51,\n \"score\": 263317.66957165493\n },\n {\n \"content\": \"/// Concatenates all but the first argument, with separators.\\n\\n/// The first argument is used as the separator string, and should not be NULL.\\n\\n/// Other NULL arguments are ignored.\\n\\npub fn concat_ws(sep: impl Into<String>, values: &[Expr]) -> Expr {\\n\\n let mut args = vec![lit(sep.into())];\\n\\n args.extend_from_slice(values);\\n\\n Expr::ScalarFunction {\\n\\n fun: functions::BuiltinScalarFunction::ConcatWithSeparator,\\n\\n args,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/logical_plan/expr.rs\",\n \"rank\": 52,\n \"score\": 263200.44447907753\n },\n {\n \"content\": \"fn extract_job_id_from_task_key(job_key: &str) -> Result<&str> {\\n\\n job_key.split('/').nth(4).ok_or_else(|| {\\n\\n BallistaError::Internal(format!(\\\"Unexpected task key: {}\\\", job_key))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ballista/rust/scheduler/src/state/mod.rs\",\n \"rank\": 53,\n \"score\": 253998.8575662212\n },\n {\n \"content\": \"/// Returns starting index of specified substring within string, or zero if it's not present. (Same as position(substring in string), but note the reversed argument order.)\\n\\n/// strpos('high', 'ig') = 2\\n\\npub fn strpos<T: ArrowPrimitiveType>(args: &[ArrayRef]) -> Result<ArrayRef>\\n\\nwhere\\n\\n T::Native: StringOffsetSizeTrait,\\n\\n{\\n\\n let string_array: &GenericStringArray<T::Native> = args[0]\\n\\n .as_any()\\n\\n .downcast_ref::<GenericStringArray<T::Native>>()\\n\\n .ok_or_else(|| {\\n\\n DataFusionError::Internal(\\\"could not cast string to StringArray\\\".to_string())\\n\\n })?;\\n\\n\\n\\n let substring_array: &GenericStringArray<T::Native> = args[1]\\n\\n .as_any()\\n\\n .downcast_ref::<GenericStringArray<T::Native>>()\\n\\n .ok_or_else(|| {\\n\\n DataFusionError::Internal(\\n\\n \\\"could not cast substring to StringArray\\\".to_string(),\\n\\n )\\n\\n })?;\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/unicode_expressions.rs\",\n \"rank\": 54,\n \"score\": 253360.44246469944\n },\n {\n \"content\": \"/// Converts the number to its equivalent hexadecimal representation.\\n\\n/// to_hex(2147483647) = '7fffffff'\\n\\npub fn to_hex<T: ArrowPrimitiveType>(args: &[ArrayRef]) -> Result<ArrayRef>\\n\\nwhere\\n\\n T::Native: StringOffsetSizeTrait,\\n\\n{\\n\\n let integer_array = downcast_primitive_array_arg!(args[0], \\\"integer\\\", T);\\n\\n\\n\\n let result = integer_array\\n\\n .iter()\\n\\n .map(|integer| {\\n\\n integer.map(|integer| format!(\\\"{:x}\\\", integer.to_usize().unwrap()))\\n\\n })\\n\\n .collect::<GenericStringArray<i32>>();\\n\\n\\n\\n Ok(Arc::new(result) as ArrayRef)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 55,\n \"score\": 253348.96254012128\n },\n {\n \"content\": \"/// Print the schema in a compact representation to `buf`\\n\\n///\\n\\n/// For example: `foo:Utf8` if `foo` can not be null, and\\n\\n/// `foo:Utf8;N` if `foo` is nullable.\\n\\n///\\n\\n/// ```\\n\\n/// use arrow::datatypes::{Field, Schema, DataType};\\n\\n/// # use datafusion::logical_plan::display_schema;\\n\\n/// let schema = Schema::new(vec![\\n\\n/// Field::new(\\\"id\\\", DataType::Int32, false),\\n\\n/// Field::new(\\\"first_name\\\", DataType::Utf8, true),\\n\\n/// ]);\\n\\n///\\n\\n/// assert_eq!(\\n\\n/// \\\"[id:Int32, first_name:Utf8;N]\\\",\\n\\n/// format!(\\\"{}\\\", display_schema(&schema))\\n\\n/// );\\n\\n/// ```\\n\\npub fn display_schema(schema: &Schema) -> impl fmt::Display + '_ {\\n\\n struct Wrapper<'a>(&'a Schema);\\n\\n\\n\\n impl<'a> fmt::Display for Wrapper<'a> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n write!(f, \\\"[\\\")?;\\n\\n for (idx, field) in self.0.fields().iter().enumerate() {\\n\\n if idx > 0 {\\n\\n write!(f, \\\", \\\")?;\\n\\n }\\n\\n let nullable_str = if field.is_nullable() { \\\";N\\\" } else { \\\"\\\" };\\n\\n write!(\\n\\n f,\\n\\n \\\"{}:{:?}{}\\\",\\n\\n field.name(),\\n\\n field.data_type(),\\n\\n nullable_str\\n\\n )?;\\n\\n }\\n\\n write!(f, \\\"]\\\")\\n\\n }\\n\\n }\\n\\n Wrapper(schema)\\n\\n}\\n\\n\\n\\n/// Logic related to creating DOT language graphs.\\n\",\n \"file_path\": \"datafusion/src/logical_plan/display.rs\",\n \"rank\": 56,\n \"score\": 252195.0010547214\n },\n {\n \"content\": \"/// decorates a function to handle [`ScalarValue`]s by converting them to arrays before calling the function\\n\\n/// and vice-versa after evaluation.\\n\\npub fn make_scalar_function<F>(inner: F) -> ScalarFunctionImplementation\\n\\nwhere\\n\\n F: Fn(&[ArrayRef]) -> Result<ArrayRef> + Sync + Send + 'static,\\n\\n{\\n\\n Arc::new(move |args: &[ColumnarValue]| {\\n\\n // first, identify if any of the arguments is an Array. If yes, store its `len`,\\n\\n // as any scalar will need to be converted to an array of len `len`.\\n\\n let len = args\\n\\n .iter()\\n\\n .fold(Option::<usize>::None, |acc, arg| match arg {\\n\\n ColumnarValue::Scalar(_) => acc,\\n\\n ColumnarValue::Array(a) => Some(a.len()),\\n\\n });\\n\\n\\n\\n // to array\\n\\n let args = if let Some(len) = len {\\n\\n args.iter()\\n\\n .map(|arg| arg.clone().into_array(len))\\n\\n .collect::<Vec<ArrayRef>>()\\n\\n } else {\\n\",\n \"file_path\": \"datafusion/src/physical_plan/functions.rs\",\n \"rank\": 57,\n \"score\": 250720.13883627256\n },\n {\n \"content\": \"/// Returns true if string starts with prefix.\\n\\n/// starts_with('alphabet', 'alph') = 't'\\n\\npub fn starts_with<T: StringOffsetSizeTrait>(args: &[ArrayRef]) -> Result<ArrayRef> {\\n\\n let string_array = downcast_string_arg!(args[0], \\\"string\\\", T);\\n\\n let prefix_array = downcast_string_arg!(args[1], \\\"prefix\\\", T);\\n\\n\\n\\n let result = string_array\\n\\n .iter()\\n\\n .zip(prefix_array.iter())\\n\\n .map(|(string, prefix)| match (string, prefix) {\\n\\n (Some(string), Some(prefix)) => Some(string.starts_with(prefix)),\\n\\n _ => None,\\n\\n })\\n\\n .collect::<BooleanArray>();\\n\\n\\n\\n Ok(Arc::new(result) as ArrayRef)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 58,\n \"score\": 250553.17486994766\n },\n {\n \"content\": \"/// Returns number of characters in the string.\\n\\n/// character_length('josé') = 4\\n\\npub fn character_length<T: ArrowPrimitiveType>(args: &[ArrayRef]) -> Result<ArrayRef>\\n\\nwhere\\n\\n T::Native: StringOffsetSizeTrait,\\n\\n{\\n\\n let string_array: &GenericStringArray<T::Native> = args[0]\\n\\n .as_any()\\n\\n .downcast_ref::<GenericStringArray<T::Native>>()\\n\\n .ok_or_else(|| {\\n\\n DataFusionError::Internal(\\\"could not cast string to StringArray\\\".to_string())\\n\\n })?;\\n\\n\\n\\n let result = string_array\\n\\n .iter()\\n\\n .map(|string| {\\n\\n string.map(|string: &str| {\\n\\n T::Native::from_usize(string.graphemes(true).count()).expect(\\n\\n \\\"should not fail as graphemes.count will always return integer\\\",\\n\\n )\\n\\n })\\n\\n })\\n\\n .collect::<PrimitiveArray<T>>();\\n\\n\\n\\n Ok(Arc::new(result) as ArrayRef)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/unicode_expressions.rs\",\n \"rank\": 59,\n \"score\": 250480.46137234906\n },\n {\n \"content\": \"/// converts a pyarrow Scalar into a Rust Scalar\\n\\npub fn to_rust_scalar(ob: &PyAny) -> PyResult<ScalarValue> {\\n\\n let t = ob\\n\\n .getattr(\\\"__class__\\\")?\\n\\n .getattr(\\\"__name__\\\")?\\n\\n .extract::<&str>()?;\\n\\n\\n\\n let p = ob.call_method0(\\\"as_py\\\")?;\\n\\n\\n\\n Ok(match t {\\n\\n \\\"Int8Scalar\\\" => ScalarValue::Int8(Some(p.extract::<i8>()?)),\\n\\n \\\"Int16Scalar\\\" => ScalarValue::Int16(Some(p.extract::<i16>()?)),\\n\\n \\\"Int32Scalar\\\" => ScalarValue::Int32(Some(p.extract::<i32>()?)),\\n\\n \\\"Int64Scalar\\\" => ScalarValue::Int64(Some(p.extract::<i64>()?)),\\n\\n \\\"UInt8Scalar\\\" => ScalarValue::UInt8(Some(p.extract::<u8>()?)),\\n\\n \\\"UInt16Scalar\\\" => ScalarValue::UInt16(Some(p.extract::<u16>()?)),\\n\\n \\\"UInt32Scalar\\\" => ScalarValue::UInt32(Some(p.extract::<u32>()?)),\\n\\n \\\"UInt64Scalar\\\" => ScalarValue::UInt64(Some(p.extract::<u64>()?)),\\n\\n \\\"FloatScalar\\\" => ScalarValue::Float32(Some(p.extract::<f32>()?)),\\n\\n \\\"DoubleScalar\\\" => ScalarValue::Float64(Some(p.extract::<f64>()?)),\\n\\n \\\"BooleanScalar\\\" => ScalarValue::Boolean(Some(p.extract::<bool>()?)),\\n\",\n \"file_path\": \"python/src/to_rust.rs\",\n \"rank\": 60,\n \"score\": 249640.9891187648\n },\n {\n \"content\": \"// coercion rules for equality operations. This is a superset of all numerical coercion rules.\\n\\npub fn eq_coercion(lhs_type: &DataType, rhs_type: &DataType) -> Option<DataType> {\\n\\n if lhs_type == rhs_type {\\n\\n // same type => equality is possible\\n\\n return Some(lhs_type.clone());\\n\\n }\\n\\n numerical_coercion(lhs_type, rhs_type)\\n\\n .or_else(|| eq_bool_coercion(lhs_type, rhs_type))\\n\\n .or_else(|| dictionary_coercion(lhs_type, rhs_type))\\n\\n .or_else(|| temporal_coercion(lhs_type, rhs_type))\\n\\n .or_else(|| string_implicit_cast(lhs_type, rhs_type))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/coercion.rs\",\n \"rank\": 61,\n \"score\": 247965.47024009447\n },\n {\n \"content\": \"/// extract a specific group from a string column, using a regular expression\\n\\npub fn regexp_match<T: StringOffsetSizeTrait>(args: &[ArrayRef]) -> Result<ArrayRef> {\\n\\n match args.len() {\\n\\n 2 => compute::regexp_match(downcast_string_arg!(args[0], \\\"string\\\", T), downcast_string_arg!(args[1], \\\"pattern\\\", T), None)\\n\\n .map_err(DataFusionError::ArrowError),\\n\\n 3 => compute::regexp_match(downcast_string_arg!(args[0], \\\"string\\\", T), downcast_string_arg!(args[1], \\\"pattern\\\", T), Some(downcast_string_arg!(args[1], \\\"flags\\\", T)))\\n\\n .map_err(DataFusionError::ArrowError),\\n\\n other => Err(DataFusionError::Internal(format!(\\n\\n \\\"regexp_match was called with {} arguments. It requires at least 2 and at most 3.\\\",\\n\\n other\\n\\n ))),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/regex_expressions.rs\",\n \"rank\": 62,\n \"score\": 247776.18988604023\n },\n {\n \"content\": \"/// Visit all children of this plan, according to the order defined on `ExecutionPlanVisitor`.\\n\\n// Note that this would be really nice if it were a method on\\n\\n// ExecutionPlan, but it can not be because it takes a generic\\n\\n// parameter and `ExecutionPlan` is a trait\\n\\npub fn accept<V: ExecutionPlanVisitor>(\\n\\n plan: &dyn ExecutionPlan,\\n\\n visitor: &mut V,\\n\\n) -> std::result::Result<(), V::Error> {\\n\\n visitor.pre_visit(plan)?;\\n\\n for child in plan.children() {\\n\\n visit_execution_plan(child.as_ref(), visitor)?;\\n\\n }\\n\\n visitor.post_visit(plan)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/mod.rs\",\n \"rank\": 63,\n \"score\": 246700.46372810518\n },\n {\n \"content\": \"/// # Errors\\n\\n/// This function errors when:\\n\\n/// * the number of arguments is not 1\\n\\n/// * the first argument is not castable to a `GenericStringArray`\\n\\nfn unary_binary_function<T, R, F>(\\n\\n args: &[&dyn Array],\\n\\n op: F,\\n\\n name: &str,\\n\\n) -> Result<BinaryArray>\\n\\nwhere\\n\\n R: AsRef<[u8]>,\\n\\n T: StringOffsetSizeTrait,\\n\\n F: Fn(&str) -> R,\\n\\n{\\n\\n if args.len() != 1 {\\n\\n return Err(DataFusionError::Internal(format!(\\n\\n \\\"{:?} args were supplied but {} takes exactly one argument\\\",\\n\\n args.len(),\\n\\n name,\\n\\n )));\\n\\n }\\n\\n\\n\\n let array = args[0]\\n\\n .as_any()\\n\\n .downcast_ref::<GenericStringArray<T>>()\\n\\n .ok_or_else(|| {\\n\\n DataFusionError::Internal(\\\"failed to downcast to string\\\".to_string())\\n\\n })?;\\n\\n\\n\\n // first map is the iterator, second is for the `Option<_>`\\n\\n Ok(array.iter().map(|x| x.map(|x| op(x))).collect())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 64,\n \"score\": 246306.5754166705\n },\n {\n \"content\": \"/// some tests share a common table\\n\\npub fn test_table_scan() -> Result<LogicalPlan> {\\n\\n test_table_scan_with_name(\\\"test\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/test/mod.rs\",\n \"rank\": 65,\n \"score\": 245576.21199123075\n },\n {\n \"content\": \"/// returns the name of the state\\n\\npub fn format_state_name(name: &str, state_name: &str) -> String {\\n\\n format!(\\\"{}[{}]\\\", name, state_name)\\n\\n}\\n\\n\\n\\n/// Represents Sort operation for a column in a RecordBatch\\n\\n#[derive(Clone, Debug)]\\n\\npub struct PhysicalSortExpr {\\n\\n /// Physical expression representing the column to sort\\n\\n pub expr: Arc<dyn PhysicalExpr>,\\n\\n /// Option to specify how the given column should be sorted\\n\\n pub options: SortOptions,\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for PhysicalSortExpr {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n let opts_string = match (self.options.descending, self.options.nulls_first) {\\n\\n (true, true) => \\\"DESC\\\",\\n\\n (true, false) => \\\"DESC NULLS LAST\\\",\\n\\n (false, true) => \\\"ASC\\\",\\n\\n (false, false) => \\\"ASC NULLS LAST\\\",\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/mod.rs\",\n \"rank\": 66,\n \"score\": 243954.21990812384\n },\n {\n \"content\": \"/// Create a column expression based on a qualified or unqualified column name\\n\\npub fn col(ident: &str) -> Expr {\\n\\n Expr::Column(ident.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/logical_plan/expr.rs\",\n \"rank\": 67,\n \"score\": 243931.1962003408\n },\n {\n \"content\": \"fn register_aggregate_csv(ctx: &mut ExecutionContext) -> Result<()> {\\n\\n let testdata = datafusion::test_util::arrow_test_data();\\n\\n let schema = aggr_test_schema();\\n\\n ctx.register_csv(\\n\\n \\\"aggregate_test_100\\\",\\n\\n &format!(\\\"{}/csv/aggregate_test_100.csv\\\", testdata),\\n\\n CsvReadOptions::new().schema(&schema),\\n\\n )?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/tests/sql.rs\",\n \"rank\": 68,\n \"score\": 242540.83017196198\n },\n {\n \"content\": \"fn eq_bool_coercion(l: &DataType, r: &DataType) -> Option<DataType> {\\n\\n if l == &DataType::Boolean || r == &DataType::Boolean {\\n\\n Some(DataType::Boolean)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/coercion.rs\",\n \"rank\": 69,\n \"score\": 242065.8453518648\n },\n {\n \"content\": \"/// Recursively calls `pre_visit` and `post_visit` for this node and\\n\\n/// all of its children, as described on [`ExecutionPlanVisitor`]\\n\\npub fn visit_execution_plan<V: ExecutionPlanVisitor>(\\n\\n plan: &dyn ExecutionPlan,\\n\\n visitor: &mut V,\\n\\n) -> std::result::Result<(), V::Error> {\\n\\n visitor.pre_visit(plan)?;\\n\\n for child in plan.children() {\\n\\n visit_execution_plan(child.as_ref(), visitor)?;\\n\\n }\\n\\n visitor.post_visit(plan)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/mod.rs\",\n \"rank\": 70,\n \"score\": 241281.71695120173\n },\n {\n \"content\": \"fn register_aggregate_simple_csv(ctx: &mut ExecutionContext) -> Result<()> {\\n\\n // It's not possible to use aggregate_test_100, not enought similar values to test grouping on floats\\n\\n let schema = Arc::new(Schema::new(vec![\\n\\n Field::new(\\\"c1\\\", DataType::Float32, false),\\n\\n Field::new(\\\"c2\\\", DataType::Float64, false),\\n\\n Field::new(\\\"c3\\\", DataType::Boolean, false),\\n\\n ]));\\n\\n\\n\\n ctx.register_csv(\\n\\n \\\"aggregate_simple\\\",\\n\\n \\\"tests/aggregate_simple.csv\\\",\\n\\n CsvReadOptions::new().schema(&schema),\\n\\n )?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/tests/sql.rs\",\n \"rank\": 71,\n \"score\": 239778.70793450915\n },\n {\n \"content\": \"fn create_batch(value: i32, num_rows: usize) -> Result<RecordBatch> {\\n\\n let mut builder = Int32Builder::new(num_rows);\\n\\n for _ in 0..num_rows {\\n\\n builder.append_value(value)?;\\n\\n }\\n\\n\\n\\n Ok(RecordBatch::try_new(\\n\\n Arc::new(Schema::new(vec![Field::new(\\n\\n \\\"flag\\\",\\n\\n DataType::Int32,\\n\\n false,\\n\\n )])),\\n\\n vec![Arc::new(builder.finish())],\\n\\n )?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/tests/provider_filter_pushdown.rs\",\n \"rank\": 72,\n \"score\": 237903.9210339261\n },\n {\n \"content\": \"/// Returns the data types that each argument must be coerced to match\\n\\n/// `signature`.\\n\\n///\\n\\n/// See the module level documentation for more detail on coercion.\\n\\npub fn data_types(\\n\\n current_types: &[DataType],\\n\\n signature: &Signature,\\n\\n) -> Result<Vec<DataType>> {\\n\\n if current_types.is_empty() {\\n\\n return Ok(vec![]);\\n\\n }\\n\\n let valid_types = get_valid_types(signature, current_types)?;\\n\\n\\n\\n if valid_types\\n\\n .iter()\\n\\n .any(|data_type| data_type == current_types)\\n\\n {\\n\\n return Ok(current_types.to_vec());\\n\\n }\\n\\n\\n\\n for valid_types in valid_types {\\n\\n if let Some(types) = maybe_data_types(&valid_types, current_types) {\\n\\n return Ok(types);\\n\\n }\\n\\n }\\n\\n\\n\\n // none possible -> Error\\n\\n Err(DataFusionError::Plan(format!(\\n\\n \\\"Coercion from {:?} to the signature {:?} failed.\\\",\\n\\n current_types, signature\\n\\n )))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/type_coercion.rs\",\n \"rank\": 73,\n \"score\": 237489.2244775246\n },\n {\n \"content\": \"/// Calls string_to_timestamp_nanos and converts the error type\\n\\nfn string_to_timestamp_nanos_shim(s: &str) -> Result<i64> {\\n\\n string_to_timestamp_nanos(s).map_err(|e| e.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/datetime_expressions.rs\",\n \"rank\": 74,\n \"score\": 236969.44991153682\n },\n {\n \"content\": \"pub fn get_tpch_schema(table: &str) -> Schema {\\n\\n // note that the schema intentionally uses signed integers so that any generated Parquet\\n\\n // files can also be used to benchmark tools that only support signed integers, such as\\n\\n // Apache Spark\\n\\n\\n\\n match table {\\n\\n \\\"part\\\" => Schema::new(vec![\\n\\n Field::new(\\\"p_partkey\\\", DataType::Int32, false),\\n\\n Field::new(\\\"p_name\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_mfgr\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_brand\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_type\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_size\\\", DataType::Int32, false),\\n\\n Field::new(\\\"p_container\\\", DataType::Utf8, false),\\n\\n Field::new(\\\"p_retailprice\\\", DataType::Float64, false),\\n\\n Field::new(\\\"p_comment\\\", DataType::Utf8, false),\\n\\n ]),\\n\\n\\n\\n \\\"supplier\\\" => Schema::new(vec![\\n\\n Field::new(\\\"s_suppkey\\\", DataType::Int32, false),\\n\",\n \"file_path\": \"ballista/rust/scheduler/src/test_utils.rs\",\n \"rank\": 75,\n \"score\": 235646.70777623507\n },\n {\n \"content\": \"/// Create a physical expression for window function\\n\\npub fn create_window_expr(\\n\\n fun: &WindowFunction,\\n\\n name: String,\\n\\n args: &[Arc<dyn PhysicalExpr>],\\n\\n partition_by: &[Arc<dyn PhysicalExpr>],\\n\\n order_by: &[PhysicalSortExpr],\\n\\n window_frame: Option<WindowFrame>,\\n\\n input_schema: &Schema,\\n\\n) -> Result<Arc<dyn WindowExpr>> {\\n\\n Ok(match fun {\\n\\n WindowFunction::AggregateFunction(fun) => Arc::new(AggregateWindowExpr::new(\\n\\n aggregates::create_aggregate_expr(fun, false, args, input_schema, name)?,\\n\\n partition_by,\\n\\n order_by,\\n\\n window_frame,\\n\\n )),\\n\\n WindowFunction::BuiltInWindowFunction(fun) => Arc::new(BuiltInWindowExpr::new(\\n\\n fun.clone(),\\n\\n create_built_in_window_expr(fun, args, input_schema, name)?,\\n\\n partition_by,\\n\\n order_by,\\n\\n window_frame,\\n\\n )),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/windows/mod.rs\",\n \"rank\": 76,\n \"score\": 234624.19010937697\n },\n {\n \"content\": \"/// Return record batch with i32 sequence\\n\\n///\\n\\n/// Columns are named\\n\\n/// \\\"i\\\" -> Int32Array\\n\\nfn make_int32_batch(start: i32, end: i32) -> RecordBatch {\\n\\n let schema = Arc::new(Schema::new(vec![Field::new(\\\"i\\\", DataType::Int32, true)]));\\n\\n let v: Vec<i32> = (start..end).collect();\\n\\n let array = Arc::new(Int32Array::from(v)) as ArrayRef;\\n\\n RecordBatch::try_new(schema, vec![array.clone()]).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/tests/parquet_pruning.rs\",\n \"rank\": 77,\n \"score\": 233483.00525581356\n },\n {\n \"content\": \"/// Returns `expressions` coerced to types compatible with\\n\\n/// `signature`, if possible.\\n\\n///\\n\\n/// See the module level documentation for more detail on coercion.\\n\\npub fn coerce(\\n\\n expressions: &[Arc<dyn PhysicalExpr>],\\n\\n schema: &Schema,\\n\\n signature: &Signature,\\n\\n) -> Result<Vec<Arc<dyn PhysicalExpr>>> {\\n\\n if expressions.is_empty() {\\n\\n return Ok(vec![]);\\n\\n }\\n\\n\\n\\n let current_types = expressions\\n\\n .iter()\\n\\n .map(|e| e.data_type(schema))\\n\\n .collect::<Result<Vec<_>>>()?;\\n\\n\\n\\n let new_types = data_types(¤t_types, signature)?;\\n\\n\\n\\n expressions\\n\\n .iter()\\n\\n .enumerate()\\n\\n .map(|(i, expr)| try_cast(expr.clone(), schema, new_types[i].clone()))\\n\\n .collect::<Result<Vec<_>>>()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/type_coercion.rs\",\n \"rank\": 78,\n \"score\": 227832.43287421213\n },\n {\n \"content\": \"/// Panics if scalars are of different types.\\n\\npub fn cmp_same_types(\\n\\n l: &ScalarValue,\\n\\n r: &ScalarValue,\\n\\n nulls_first: bool,\\n\\n asc: bool,\\n\\n) -> Ordering {\\n\\n match (l.is_null(), r.is_null()) {\\n\\n (true, true) => return Ordering::Equal,\\n\\n (true, false) => {\\n\\n return if nulls_first {\\n\\n Ordering::Less\\n\\n } else {\\n\\n Ordering::Greater\\n\\n }\\n\\n }\\n\\n (false, true) => {\\n\\n return if nulls_first {\\n\\n Ordering::Greater\\n\\n } else {\\n\\n Ordering::Less\\n\",\n \"file_path\": \"datafusion/src/cube_ext/util.rs\",\n \"rank\": 79,\n \"score\": 227826.64140918016\n },\n {\n \"content\": \"/// Returns the character with the given code. chr(0) is disallowed because text data types cannot store that character.\\n\\n/// chr(65) = 'A'\\n\\npub fn chr(args: &[ArrayRef]) -> Result<ArrayRef> {\\n\\n let integer_array = downcast_arg!(args[0], \\\"integer\\\", Int64Array);\\n\\n\\n\\n // first map is the iterator, second is for the `Option<_>`\\n\\n let result = integer_array\\n\\n .iter()\\n\\n .map(|integer: Option<i64>| {\\n\\n integer\\n\\n .map(|integer| {\\n\\n if integer == 0 {\\n\\n Err(DataFusionError::Execution(\\n\\n \\\"null character not permitted.\\\".to_string(),\\n\\n ))\\n\\n } else {\\n\\n match core::char::from_u32(integer as u32) {\\n\\n Some(integer) => Ok(integer.to_string()),\\n\\n None => Err(DataFusionError::Execution(\\n\\n \\\"requested character too large for encoding.\\\".to_string(),\\n\\n )),\\n\\n }\\n\\n }\\n\\n })\\n\\n .transpose()\\n\\n })\\n\\n .collect::<Result<StringArray>>()?;\\n\\n\\n\\n Ok(Arc::new(result) as ArrayRef)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 80,\n \"score\": 227581.65310581296\n },\n {\n \"content\": \"/// Returns all direct children `Expression`s of `expr`.\\n\\n/// E.g. if the expression is \\\"(a + 1) + 1\\\", it returns [\\\"a + 1\\\", \\\"1\\\"] (as Expr objects)\\n\\npub fn expr_sub_expressions(expr: &Expr) -> Result<Vec<Expr>> {\\n\\n match expr {\\n\\n Expr::BinaryExpr { left, right, .. } => {\\n\\n Ok(vec![left.as_ref().to_owned(), right.as_ref().to_owned()])\\n\\n }\\n\\n Expr::IsNull(e) => Ok(vec![e.as_ref().to_owned()]),\\n\\n Expr::IsNotNull(e) => Ok(vec![e.as_ref().to_owned()]),\\n\\n Expr::ScalarFunction { args, .. } => Ok(args.clone()),\\n\\n Expr::ScalarUDF { args, .. } => Ok(args.clone()),\\n\\n Expr::WindowFunction {\\n\\n args,\\n\\n partition_by,\\n\\n order_by,\\n\\n ..\\n\\n } => {\\n\\n let mut expr_list: Vec<Expr> = vec![];\\n\\n expr_list.extend(args.clone());\\n\\n expr_list.push(lit(WINDOW_PARTITION_MARKER));\\n\\n expr_list.extend(partition_by.clone());\\n\\n expr_list.push(lit(WINDOW_SORT_MARKER));\\n\",\n \"file_path\": \"datafusion/src/optimizer/utils.rs\",\n \"rank\": 81,\n \"score\": 225846.41804674314\n },\n {\n \"content\": \"/// Concatenates all but the first argument, with separators. The first argument is used as the separator string, and should not be NULL. Other NULL arguments are ignored.\\n\\n/// concat_ws(',', 'abcde', 2, NULL, 22) = 'abcde,2,22'\\n\\npub fn concat_ws(args: &[ArrayRef]) -> Result<ArrayRef> {\\n\\n // downcast all arguments to strings\\n\\n let args = downcast_vec!(args, StringArray).collect::<Result<Vec<&StringArray>>>()?;\\n\\n\\n\\n // do not accept 0 or 1 arguments.\\n\\n if args.len() < 2 {\\n\\n return Err(DataFusionError::Internal(format!(\\n\\n \\\"concat_ws was called with {} arguments. It requires at least 2.\\\",\\n\\n args.len()\\n\\n )));\\n\\n }\\n\\n\\n\\n // first map is the iterator, second is for the `Option<_>`\\n\\n let result = args[0]\\n\\n .iter()\\n\\n .enumerate()\\n\\n .map(|(index, x)| {\\n\\n x.map(|sep: &str| {\\n\\n let mut owned_string: String = \\\"\\\".to_owned();\\n\\n for arg_index in 1..args.len() {\\n\",\n \"file_path\": \"datafusion/src/physical_plan/string_expressions.rs\",\n \"rank\": 82,\n \"score\": 225106.97911664023\n },\n {\n \"content\": \"fn build_statistics_expr(expr_builder: &mut PruningExpressionBuilder) -> Result<Expr> {\\n\\n let statistics_expr =\\n\\n match expr_builder.op() {\\n\\n Operator::NotEq => {\\n\\n // column != literal => (min, max) = literal =>\\n\\n // !(min != literal && max != literal) ==>\\n\\n // min != literal || literal != max\\n\\n let min_column_expr = expr_builder.min_column_expr()?;\\n\\n let max_column_expr = expr_builder.max_column_expr()?;\\n\\n min_column_expr\\n\\n .not_eq(expr_builder.scalar_expr().clone())\\n\\n .or(expr_builder.scalar_expr().clone().not_eq(max_column_expr))\\n\\n }\\n\\n Operator::Eq => {\\n\\n // column = literal => (min, max) = literal => min <= literal && literal <= max\\n\\n // (column / 2) = 4 => (column_min / 2) <= 4 && 4 <= (column_max / 2)\\n\\n let min_column_expr = expr_builder.min_column_expr()?;\\n\\n let max_column_expr = expr_builder.max_column_expr()?;\\n\\n min_column_expr\\n\\n .lt_eq(expr_builder.scalar_expr().clone())\\n\",\n \"file_path\": \"datafusion/src/physical_optimizer/pruning.rs\",\n \"rank\": 83,\n \"score\": 224845.54705271753\n },\n {\n \"content\": \"/// returns a new expression where the expressions in `expr` are replaced by the ones in\\n\\n/// `expressions`.\\n\\n/// This is used in conjunction with ``expr_expressions`` to re-write expressions.\\n\\npub fn rewrite_expression(expr: &Expr, expressions: &[Expr]) -> Result<Expr> {\\n\\n match expr {\\n\\n Expr::BinaryExpr { op, .. } => Ok(Expr::BinaryExpr {\\n\\n left: Box::new(expressions[0].clone()),\\n\\n op: *op,\\n\\n right: Box::new(expressions[1].clone()),\\n\\n }),\\n\\n Expr::IsNull(_) => Ok(Expr::IsNull(Box::new(expressions[0].clone()))),\\n\\n Expr::IsNotNull(_) => Ok(Expr::IsNotNull(Box::new(expressions[0].clone()))),\\n\\n Expr::ScalarFunction { fun, .. } => Ok(Expr::ScalarFunction {\\n\\n fun: fun.clone(),\\n\\n args: expressions.to_vec(),\\n\\n }),\\n\\n Expr::ScalarUDF { fun, .. } => Ok(Expr::ScalarUDF {\\n\\n fun: fun.clone(),\\n\\n args: expressions.to_vec(),\\n\\n }),\\n\\n Expr::WindowFunction {\\n\\n fun, window_frame, ..\\n\\n } => {\\n\",\n \"file_path\": \"datafusion/src/optimizer/utils.rs\",\n \"rank\": 84,\n \"score\": 221962.45165952452\n },\n {\n \"content\": \"fn custom_sqrt(args: &[ColumnarValue]) -> Result<ColumnarValue> {\\n\\n let arg = &args[0];\\n\\n if let ColumnarValue::Array(v) = arg {\\n\\n let input = v\\n\\n .as_any()\\n\\n .downcast_ref::<Float64Array>()\\n\\n .expect(\\\"cast failed\\\");\\n\\n\\n\\n let array: Float64Array = input.iter().map(|v| v.map(|x| x.sqrt())).collect();\\n\\n Ok(ColumnarValue::Array(Arc::new(array)))\\n\\n } else {\\n\\n unimplemented!()\\n\\n }\\n\\n}\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn csv_query_avg() -> Result<()> {\\n\\n let mut ctx = ExecutionContext::new();\\n\\n register_aggregate_csv(&mut ctx)?;\\n\\n let sql = \\\"SELECT avg(c12) FROM aggregate_test_100\\\";\\n\",\n \"file_path\": \"datafusion/tests/sql.rs\",\n \"rank\": 85,\n \"score\": 221783.90597410663\n },\n {\n \"content\": \"pub fn lexcmp_array_rows<'a>(\\n\\n cols: impl Iterator<Item = &'a ArrayRef>,\\n\\n l_row: usize,\\n\\n r_row: usize,\\n\\n) -> Ordering {\\n\\n for c in cols {\\n\\n let o = cmp_array_row_same_types(c, l_row, c, r_row);\\n\\n if o != Ordering::Equal {\\n\\n return o;\\n\\n }\\n\\n }\\n\\n Ordering::Equal\\n\\n}\\n\",\n \"file_path\": \"datafusion/src/cube_ext/util.rs\",\n \"rank\": 86,\n \"score\": 220458.1776858169\n },\n {\n \"content\": \"fn decode_protobuf<T: Message + Default>(bytes: &[u8]) -> Result<T> {\\n\\n T::decode(bytes).map_err(|e| {\\n\\n BallistaError::Internal(format!(\\n\\n \\\"Could not deserialize {}: {}\\\",\\n\\n type_name::<T>(),\\n\\n e\\n\\n ))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ballista/rust/scheduler/src/state/mod.rs\",\n \"rank\": 87,\n \"score\": 218996.7187746701\n },\n {\n \"content\": \"/// Returns the return type of a binary operator or an error when the binary operator cannot\\n\\n/// perform the computation between the argument's types, even after type coercion.\\n\\n///\\n\\n/// This function makes some assumptions about the underlying available computations.\\n\\npub fn binary_operator_data_type(\\n\\n lhs_type: &DataType,\\n\\n op: &Operator,\\n\\n rhs_type: &DataType,\\n\\n) -> Result<DataType> {\\n\\n // validate that it is possible to perform the operation on incoming types.\\n\\n // (or the return datatype cannot be infered)\\n\\n let common_type = common_binary_type(lhs_type, op, rhs_type)?;\\n\\n\\n\\n match op {\\n\\n // operators that return a boolean\\n\\n Operator::Eq\\n\\n | Operator::NotEq\\n\\n | Operator::And\\n\\n | Operator::Or\\n\\n | Operator::Like\\n\\n | Operator::NotLike\\n\\n | Operator::ILike\\n\\n | Operator::NotILike\\n\\n | Operator::Lt\\n\",\n \"file_path\": \"datafusion/src/physical_plan/expressions/binary.rs\",\n \"rank\": 88,\n \"score\": 218890.7397180245\n },\n {\n \"content\": \"fn criterion_benchmark(c: &mut Criterion) {\\n\\n let partitions_len = 8;\\n\\n let array_len = 1024 * 1024;\\n\\n let batch_size = 8 * 1024;\\n\\n let ctx = create_context(partitions_len, array_len, batch_size).unwrap();\\n\\n\\n\\n c.bench_function(\\\"window empty over, aggregate functions\\\", |b| {\\n\\n b.iter(|| {\\n\\n query(\\n\\n ctx.clone(),\\n\\n \\\"SELECT \\\\\\n\\n MAX(f64) OVER (), \\\\\\n\\n MIN(f32) OVER (), \\\\\\n\\n SUM(u64_narrow) OVER () \\\\\\n\\n FROM t\\\",\\n\\n )\\n\\n })\\n\\n });\\n\\n\\n\\n c.bench_function(\\\"window empty over, built-in functions\\\", |b| {\\n\",\n \"file_path\": \"datafusion/benches/window_query_sql.rs\",\n \"rank\": 89,\n \"score\": 218884.29236605688\n },\n {\n \"content\": \"fn optimize(plan: &LogicalPlan, mut state: State) -> Result<LogicalPlan> {\\n\\n match plan {\\n\\n LogicalPlan::Explain { .. } => {\\n\\n // push the optimization to the plan of this explain\\n\\n push_down(&state, plan)\\n\\n }\\n\\n LogicalPlan::Filter { input, predicate } => {\\n\\n let mut predicates = vec![];\\n\\n split_members(predicate, &mut predicates);\\n\\n\\n\\n // Predicates without referencing columns (WHERE FALSE, WHERE 1=1, etc.)\\n\\n let mut no_col_predicates = vec![];\\n\\n\\n\\n predicates\\n\\n .into_iter()\\n\\n .try_for_each::<_, Result<()>>(|predicate| {\\n\\n let mut columns: HashSet<Column> = HashSet::new();\\n\\n utils::expr_to_columns(predicate, &mut columns)?;\\n\\n if columns.is_empty() {\\n\\n no_col_predicates.push(predicate)\\n\",\n \"file_path\": \"datafusion/src/optimizer/filter_push_down.rs\",\n \"rank\": 90,\n \"score\": 218871.84976712946\n },\n {\n \"content\": \"/// the signatures supported by the function `fun`.\\n\\npub fn signature(fun: &WindowFunction) -> Signature {\\n\\n match fun {\\n\\n WindowFunction::AggregateFunction(fun) => aggregates::signature(fun),\\n\\n WindowFunction::BuiltInWindowFunction(fun) => signature_for_built_in(fun),\\n\\n }\\n\\n}\\n\\n\\n\\n/// the signatures supported by the built-in window function `fun`.\\n\\npub(super) fn signature_for_built_in(fun: &BuiltInWindowFunction) -> Signature {\\n\\n // note: the physical expression must accept the type returned by this function or the execution panics.\\n\\n match fun {\\n\\n BuiltInWindowFunction::RowNumber\\n\\n | BuiltInWindowFunction::Rank\\n\\n | BuiltInWindowFunction::DenseRank\\n\\n | BuiltInWindowFunction::PercentRank\\n\\n | BuiltInWindowFunction::CumeDist => Signature::Any(0),\\n\\n BuiltInWindowFunction::Lag | BuiltInWindowFunction::Lead => {\\n\\n Signature::OneOf(vec![\\n\\n Signature::Any(1),\\n\\n Signature::Any(2),\\n\",\n \"file_path\": \"datafusion/src/physical_plan/window_functions.rs\",\n \"rank\": 91,\n \"score\": 217804.32525229102\n },\n {\n \"content\": \"pub fn get_routes(scheduler_server: SchedulerServer) -> BoxedFilter<(impl Reply,)> {\\n\\n let routes = warp::path(\\\"state\\\")\\n\\n .and(with_data_server(scheduler_server))\\n\\n .and_then(handlers::scheduler_state);\\n\\n routes.boxed()\\n\\n}\\n\",\n \"file_path\": \"ballista/rust/scheduler/src/api/mod.rs\",\n \"rank\": 92,\n \"score\": 217079.55052341387\n },\n {\n \"content\": \"/// Used for column names in schemas\\n\\npub fn physical_name(e: &Expr, input_schema: &DFSchema) -> Result<String> {\\n\\n match e {\\n\\n Expr::Column(c) => Ok(c.name.clone()),\\n\\n Expr::Alias(_, name) => Ok(name.clone()),\\n\\n Expr::ScalarVariable(variable_names) => Ok(variable_names.join(\\\".\\\")),\\n\\n Expr::Literal(value) => Ok(format!(\\\"{:?}\\\", value)),\\n\\n Expr::BinaryExpr { left, op, right } => {\\n\\n let left = physical_name(left, input_schema)?;\\n\\n let right = physical_name(right, input_schema)?;\\n\\n Ok(format!(\\\"{} {:?} {}\\\", left, op, right))\\n\\n }\\n\\n Expr::Case {\\n\\n expr,\\n\\n when_then_expr,\\n\\n else_expr,\\n\\n } => {\\n\\n let mut name = \\\"CASE \\\".to_string();\\n\\n if let Some(e) = expr {\\n\\n name += &format!(\\\"{:?} \\\", e);\\n\\n }\\n\",\n \"file_path\": \"datafusion/src/physical_plan/planner.rs\",\n \"rank\": 93,\n \"score\": 216922.79505555204\n },\n {\n \"content\": \"/// Recursively call [`Column::normalize`] on all Column expressions\\n\\n/// in the `expr` expression tree.\\n\\npub fn normalize_col(expr: Expr, plan: &LogicalPlan) -> Result<Expr> {\\n\\n normalize_col_with_schemas(expr, &plan.all_schemas(), &plan.using_columns()?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/logical_plan/expr.rs\",\n \"rank\": 94,\n \"score\": 216916.64891109645\n },\n {\n \"content\": \"/// Return true if a value of type `type_from` can be coerced\\n\\n/// (losslessly converted) into a value of `type_to`\\n\\n///\\n\\n/// See the module level documentation for more detail on coercion.\\n\\npub fn can_coerce_from(type_into: &DataType, type_from: &DataType) -> bool {\\n\\n use self::DataType::*;\\n\\n match type_into {\\n\\n Int8 => matches!(type_from, Int8),\\n\\n Int16 => matches!(type_from, Int8 | Int16 | UInt8),\\n\\n Int32 => matches!(type_from, Int8 | Int16 | Int32 | UInt8 | UInt16),\\n\\n Int64 => matches!(\\n\\n type_from,\\n\\n Int8 | Int16 | Int32 | Int64 | UInt8 | UInt16 | UInt32\\n\\n ),\\n\\n UInt8 => matches!(type_from, UInt8),\\n\\n UInt16 => matches!(type_from, UInt8 | UInt16),\\n\\n UInt32 => matches!(type_from, UInt8 | UInt16 | UInt32),\\n\\n UInt64 => matches!(type_from, UInt8 | UInt16 | UInt32 | UInt64),\\n\\n Float32 => matches!(\\n\\n type_from,\\n\\n Int8 | Int16 | Int32 | Int64 | UInt8 | UInt16 | UInt32 | UInt64 | Float32\\n\\n ),\\n\\n Float64 => matches!(\\n\\n type_from,\\n\",\n \"file_path\": \"datafusion/src/physical_plan/type_coercion.rs\",\n \"rank\": 95,\n \"score\": 215942.85762053804\n },\n {\n \"content\": \"/// Extract the value in `col[row]` from a dictionary a GroupByScalar\\n\\nfn dictionary_create_group_by_value<K: ArrowDictionaryKeyType>(\\n\\n col: &ArrayRef,\\n\\n row: usize,\\n\\n) -> Result<GroupByScalar> {\\n\\n let dict_col = col.as_any().downcast_ref::<DictionaryArray<K>>().unwrap();\\n\\n\\n\\n // look up the index in the values dictionary\\n\\n let keys_col = dict_col.keys();\\n\\n let values_index = keys_col.value(row).to_usize().ok_or_else(|| {\\n\\n DataFusionError::Internal(format!(\\n\\n \\\"Can not convert index to usize in dictionary of type creating group by value {:?}\\\",\\n\\n keys_col.data_type()\\n\\n ))\\n\\n })?;\\n\\n\\n\\n create_group_by_value(dict_col.values(), values_index)\\n\\n}\\n\\n\\n\\n/// Extract the value in `col[row]` as a GroupByScalar\\n\\npub(crate) fn create_group_by_value(col: &ArrayRef, row: usize) -> Result<GroupByScalar> {\\n\",\n \"file_path\": \"datafusion/src/physical_plan/hash_aggregate.rs\",\n \"rank\": 96,\n \"score\": 214329.75468675574\n },\n {\n \"content\": \"#[inline]\\n\\npub fn unnormalize_cols(exprs: impl IntoIterator<Item = Expr>) -> Vec<Expr> {\\n\\n exprs.into_iter().map(unnormalize_col).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/logical_plan/expr.rs\",\n \"rank\": 97,\n \"score\": 214245.57899277064\n },\n {\n \"content\": \"fn encode_protobuf<T: Message + Default>(msg: &T) -> Result<Vec<u8>> {\\n\\n let mut value: Vec<u8> = Vec::with_capacity(msg.encoded_len());\\n\\n msg.encode(&mut value).map_err(|e| {\\n\\n BallistaError::Internal(format!(\\n\\n \\\"Could not serialize {}: {}\\\",\\n\\n type_name::<T>(),\\n\\n e\\n\\n ))\\n\\n })?;\\n\\n Ok(value)\\n\\n}\\n\\n\\n\\n#[cfg(all(test, feature = \\\"sled\\\"))]\\n\\nmod test {\\n\\n use std::sync::Arc;\\n\\n\\n\\n use ballista_core::serde::protobuf::{\\n\\n job_status, task_status, CompletedTask, FailedTask, JobStatus, PartitionId,\\n\\n QueuedJob, RunningJob, RunningTask, TaskStatus,\\n\\n };\\n\",\n \"file_path\": \"ballista/rust/scheduler/src/state/mod.rs\",\n \"rank\": 98,\n \"score\": 212977.80955505196\n },\n {\n \"content\": \"// It's not possible to return &[u8], because trait in trait without short lifetime\\n\\nfn sha_process<D: SHA2Digest + Default>(input: &str) -> SHA2DigestOutput<D> {\\n\\n let mut digest = D::default();\\n\\n digest.update(&input);\\n\\n\\n\\n digest.finalize()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"datafusion/src/physical_plan/crypto_expressions.rs\",\n \"rank\": 99,\n \"score\": 212753.53361634506\n }\n]","isConversational":false}}},{"rowIdx":2982,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/runtime/thread/continuation.rs"},"repo_name":{"kind":"string","value":"jamesbornholt/shuttle"},"commit":{"kind":"string","value":"24ffc0aa2a2c30059c263ea7e5516f90af1c828b"},"file_code":{"kind":"string","value":"\n\n#![allow(deprecated)]\n\nuse crate::runtime::execution::ExecutionState;\nuse generator::{Generator, Gn};\nuse scoped_tls::scoped_thread_local;\nuse std::cell::{Cell, RefCell};\nuse std::collections::VecDeque;\nuse std::ops::Deref;\nuse std::ops::DerefMut;\nuse std::rc::Rc;\n\nscoped_thread_local! {\n pub(crate) static CONTINUATION_POOL: ContinuationPool\n}\n\npub(crate) struct Continuation {\n generator: Generator<'static, ContinuationInput, ContinuationOutput>,\n function: ContinuationFunction,\n state: ContinuationState,\n}\n\n#[allow(clippy::type_complexity)]\n#[derive(Clone)]\nstruct ContinuationFunction(Rc<Cell<Option<Box<dyn FnOnce() + Send>>>>);\n\nunsafe impl Send for ContinuationFunction {}\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\nenum ContinuationInput {\n Resume,\n Exit,\n}\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\nenum ContinuationOutput {\n Yielded,\n Finished,\n Exited,\n}\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\nenum ContinuationState {\n NotReady, \n Ready, \n Running, \n}\n\nimpl Continuation {\n pub fn new(stack_size: usize) -> Self {\n let function = ContinuationFunction(Rc::new(Cell::new(None)));\n\n let mut gen = {\n let function = function.clone();\n\n Gn::new_opt(stack_size, move || {\n loop {\n \n \n \n match generator::yield_(ContinuationOutput::Finished) {\n None | Some(ContinuationInput::Exit) => break,\n _ => (),\n }\n\n let f = function.0.take().expect(\"must have a function to run\");\n\n f();\n }\n\n ContinuationOutput::Exited\n })\n };\n\n \n let ret = gen.resume().unwrap();\n debug_assert_eq!(ret, ContinuationOutput::Finished);\n\n Self {\n generator: gen,\n function,\n state: ContinuationState::NotReady,\n }\n }\n\n \n \n pub fn initialize(&mut self, fun: Box<dyn FnOnce() + Send>) {\n debug_assert_eq!(\n self.state,\n ContinuationState::NotReady,\n \"shouldn't replace a function before it runs\"\n );\n\n let old = self.function.0.replace(Some(fun));\n debug_assert!(old.is_none(), \"shouldn't replace a function before it runs\");\n\n self.state = ContinuationState::Ready;\n }\n\n \n pub fn resume(&mut self) -> bool {\n debug_assert!(self.state == ContinuationState::Ready || self.state == ContinuationState::Running);\n\n let ret = self.resume_with_input(ContinuationInput::Resume);\n debug_assert_ne!(\n ret,\n ContinuationOutput::Exited,\n \"continuation should not exit if resumed from user code\"\n );\n\n ret == ContinuationOutput::Finished\n }\n\n fn resume_with_input(&mut self, input: ContinuationInput) -> ContinuationOutput {\n self.generator.set_para(input);\n let ret = self.generator.resume().unwrap();\n if ret == ContinuationOutput::Finished {\n self.state = ContinuationState::NotReady;\n }\n ret\n }\n\n \n \n \n \n fn reusable(&self) -> bool {\n self.state == ContinuationState::NotReady\n }\n}\n\nimpl Drop for Continuation {\n fn drop(&mut self) {\n \n \n \n \n \n if self.reusable() {\n let ret = self.resume_with_input(ContinuationInput::Exit);\n debug_assert_eq!(ret, ContinuationOutput::Exited);\n }\n }\n}\n\npub(crate) struct ContinuationPool {\n \n continuations: Rc<RefCell<VecDeque<Continuation>>>,\n}\n\nimpl ContinuationPool {\n pub fn new() -> Self {\n Self {\n continuations: Rc::new(RefCell::new(VecDeque::new())),\n }\n }\n\n \n pub fn acquire(stack_size: usize) -> PooledContinuation {\n if CONTINUATION_POOL.is_set() {\n CONTINUATION_POOL.with(|p| p.acquire_inner(stack_size))\n } else {\n let p = Self::new();\n p.acquire_inner(stack_size)\n }\n }\n\n fn acquire_inner(&self, stack_size: usize) -> PooledContinuation {\n \n \n let continuation = self\n .continuations\n .borrow_mut()\n .pop_front()\n .unwrap_or_else(move || Continuation::new(stack_size));\n\n PooledContinuation {\n continuation: Some(continuation),\n queue: self.continuations.clone(),\n }\n }\n}\n\nimpl Drop for ContinuationPool {\n fn drop(&mut self) {\n \n \n \n \n \n \n \n \n for c in self.continuations.borrow_mut().iter_mut() {\n c.state = ContinuationState::Running;\n }\n }\n}\n\npub(crate) struct PooledContinuation {\n continuation: Option<Continuation>,\n queue: Rc<RefCell<VecDeque<Continuation>>>,\n}\n\nimpl Drop for PooledContinuation {\n fn drop(&mut self) {\n let c = self.continuation.take().unwrap();\n if c.reusable() {\n self.queue.borrow_mut().push_back(c);\n }\n }\n}\n\nimpl Deref for PooledContinuation {\n type Target = Continuation;\n\n fn deref(&self) -> &Self::Target {\n self.continuation.as_ref().unwrap()\n }\n}\n\nimpl DerefMut for PooledContinuation {\n fn deref_mut(&mut self) -> &mut Self::Target {\n self.continuation.as_mut().unwrap()\n }\n}\n\nimpl std::fmt::Debug for PooledContinuation {\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\n f.debug_struct(\"PooledContinuation\").finish()\n }\n}\n\nunsafe impl Send for PooledContinuation {}\n\npub(crate) fn switch() {\n if ExecutionState::maybe_yield() {\n let r = generator::yield_(ContinuationOutput::Yielded).unwrap();\n assert!(matches!(r, ContinuationInput::Resume));\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use crate::Config;\n\n #[test]\n fn reusable_continuation_drop() {\n let pool = ContinuationPool::new();\n let config: Config = Default::default();\n\n let mut c = pool.acquire_inner(config.stack_size);\n c.initialize(Box::new(|| {\n let _ = 1 + 1;\n }));\n\n let r = c.resume();\n assert!(r, \"continuation only has one step\");\n\n drop(c);\n assert_eq!(\n pool.continuations.borrow().len(),\n 1,\n \"continuation should be reusable because the function finished\"\n );\n\n let mut c = pool.acquire_inner(config.stack_size);\n c.initialize(Box::new(|| {\n generator::yield_with(ContinuationOutput::Yielded);\n let _ = 1 + 1;\n }));\n\n let r = c.resume();\n assert!(!r, \"continuation yields once, shouldn't be finished yet\");\n\n drop(c);\n assert_eq!(\n pool.continuations.borrow().len(),\n 0,\n \"continuation should not be reusable because the function wasn't finished\"\n );\n\n let c = pool.acquire_inner(config.stack_size);\n\n \n drop(pool);\n drop(c);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\n#![allow(deprecated)]\n\nuse crate::runtime::execution::ExecutionState;\nuse generator::{Generator, Gn};\nuse scoped_tls::scoped_thread_local;\nuse std::cell::{Cell, RefCell};\nuse std::collections::VecDeque;\nuse std::ops::Deref;\nuse std::ops::DerefMut;\nuse std::rc::Rc;\n\nscoped_thread_local! {\n pub(crate) static CONTINUATION_POOL: ContinuationPool\n}\n\npub(crate) struct Continuation {\n generator: Generator<'static, ContinuationInput, ContinuationOutput>,\n function: ContinuationFunction,\n state: ContinuationState,\n}\n\n#[allow(clippy::type_complexity)]\n#[derive(Clone)]\nstruct ContinuationFunction(Rc<Cell<Option<Box<dyn FnOnce() + Send>>>>);\n\nunsafe impl Send for ContinuationFunction {}\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\nenum ContinuationInput {\n Resume,\n Exit,\n}\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\nenum ContinuationOutput {\n Yielded,\n Finished,\n Exited,\n}\n\n#[derive(Debug, PartialEq, Eq, Clone, Copy)]\nenum ContinuationState {\n NotReady, \n Ready, \n Running, \n}\n\nimpl Continuation {\n pub fn new(stack_size: usize) -> Self {\n let function = ContinuationFunction(Rc::new(Cell::new(None)));\n\n let mut gen = {\n let function = function.clone();\n\n Gn::new_opt(stack_size, move || {\n loop {\n \n \n \n match generator::yield_(ContinuationOutput::Finished) {\n None | Some(ContinuationInput::Exit) => break,\n _ => (),\n }\n\n let f = function.0.take().expect(\"must have a function to run\");\n\n f();\n }\n\n ContinuationOutput::Exited\n })\n };\n\n \n let ret = gen.resume().unwrap();\n debug_assert_eq!(ret, ContinuationOutput::Finished);\n\n Self {\n generator: gen,\n function,\n state: ContinuationState::NotReady,\n }\n }\n\n \n \n "},"suffix":{"kind":"string","value":"\n\n \n pub fn resume(&mut self) -> bool {\n debug_assert!(self.state == ContinuationState::Ready || self.state == ContinuationState::Running);\n\n let ret = self.resume_with_input(ContinuationInput::Resume);\n debug_assert_ne!(\n ret,\n ContinuationOutput::Exited,\n \"continuation should not exit if resumed from user code\"\n );\n\n ret == ContinuationOutput::Finished\n }\n\n fn resume_with_input(&mut self, input: ContinuationInput) -> ContinuationOutput {\n self.generator.set_para(input);\n let ret = self.generator.resume().unwrap();\n if ret == ContinuationOutput::Finished {\n self.state = ContinuationState::NotReady;\n }\n ret\n }\n\n \n \n \n \n fn reusable(&self) -> bool {\n self.state == ContinuationState::NotReady\n }\n}\n\nimpl Drop for Continuation {\n fn drop(&mut self) {\n \n \n \n \n \n if self.reusable() {\n let ret = self.resume_with_input(ContinuationInput::Exit);\n debug_assert_eq!(ret, ContinuationOutput::Exited);\n }\n }\n}\n\npub(crate) struct ContinuationPool {\n \n continuations: Rc<RefCell<VecDeque<Continuation>>>,\n}\n\nimpl ContinuationPool {\n pub fn new() -> Self {\n Self {\n continuations: Rc::new(RefCell::new(VecDeque::new())),\n }\n }\n\n \n pub fn acquire(stack_size: usize) -> PooledContinuation {\n if CONTINUATION_POOL.is_set() {\n CONTINUATION_POOL.with(|p| p.acquire_inner(stack_size))\n } else {\n let p = Self::new();\n p.acquire_inner(stack_size)\n }\n }\n\n fn acquire_inner(&self, stack_size: usize) -> PooledContinuation {\n \n \n let continuation = self\n .continuations\n .borrow_mut()\n .pop_front()\n .unwrap_or_else(move || Continuation::new(stack_size));\n\n PooledContinuation {\n continuation: Some(continuation),\n queue: self.continuations.clone(),\n }\n }\n}\n\nimpl Drop for ContinuationPool {\n fn drop(&mut self) {\n \n \n \n \n \n \n \n \n for c in self.continuations.borrow_mut().iter_mut() {\n c.state = ContinuationState::Running;\n }\n }\n}\n\npub(crate) struct PooledContinuation {\n continuation: Option<Continuation>,\n queue: Rc<RefCell<VecDeque<Continuation>>>,\n}\n\nimpl Drop for PooledContinuation {\n fn drop(&mut self) {\n let c = self.continuation.take().unwrap();\n if c.reusable() {\n self.queue.borrow_mut().push_back(c);\n }\n }\n}\n\nimpl Deref for PooledContinuation {\n type Target = Continuation;\n\n fn deref(&self) -> &Self::Target {\n self.continuation.as_ref().unwrap()\n }\n}\n\nimpl DerefMut for PooledContinuation {\n fn deref_mut(&mut self) -> &mut Self::Target {\n self.continuation.as_mut().unwrap()\n }\n}\n\nimpl std::fmt::Debug for PooledContinuation {\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\n f.debug_struct(\"PooledContinuation\").finish()\n }\n}\n\nunsafe impl Send for PooledContinuation {}\n\npub(crate) fn switch() {\n if ExecutionState::maybe_yield() {\n let r = generator::yield_(ContinuationOutput::Yielded).unwrap();\n assert!(matches!(r, ContinuationInput::Resume));\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use crate::Config;\n\n #[test]\n fn reusable_continuation_drop() {\n let pool = ContinuationPool::new();\n let config: Config = Default::default();\n\n let mut c = pool.acquire_inner(config.stack_size);\n c.initialize(Box::new(|| {\n let _ = 1 + 1;\n }));\n\n let r = c.resume();\n assert!(r, \"continuation only has one step\");\n\n drop(c);\n assert_eq!(\n pool.continuations.borrow().len(),\n 1,\n \"continuation should be reusable because the function finished\"\n );\n\n let mut c = pool.acquire_inner(config.stack_size);\n c.initialize(Box::new(|| {\n generator::yield_with(ContinuationOutput::Yielded);\n let _ = 1 + 1;\n }));\n\n let r = c.resume();\n assert!(!r, \"continuation yields once, shouldn't be finished yet\");\n\n drop(c);\n assert_eq!(\n pool.continuations.borrow().len(),\n 0,\n \"continuation should not be reusable because the function wasn't finished\"\n );\n\n let c = pool.acquire_inner(config.stack_size);\n\n \n drop(pool);\n drop(c);\n }\n}\n"},"middle":{"kind":"string","value":"pub fn initialize(&mut self, fun: Box<dyn FnOnce() + Send>) {\n debug_assert_eq!(\n self.state,\n ContinuationState::NotReady,\n \"shouldn't replace a function before it runs\"\n );\n\n let old = self.function.0.replace(Some(fun));\n debug_assert!(old.is_none(), \"shouldn't replace a function before it runs\");\n\n self.state = ContinuationState::Ready;\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"/// Run the given function under a randomized concurrency scheduler for some number of iterations.\n\n/// Each iteration will run a (potentially) different randomized schedule.\n\npub fn check_random<F>(f: F, iterations: usize)\n\nwhere\n\n F: Fn() + Send + Sync + 'static,\n\n{\n\n use crate::scheduler::RandomScheduler;\n\n\n\n let scheduler = RandomScheduler::new(iterations);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(f);\n\n}\n\n\n","file_path":"src/lib.rs","rank":0,"score":216016.19799572162},{"content":"#[track_caller]\n\npub fn check_clock(f: impl Fn(usize, u32) -> bool) {\n\n for (i, &c) in current::clock().iter().enumerate() {\n\n assert!(\n\n f(i, c),\n\n \"clock {:?} doesn't satisfy predicate at {}\",\n\n current::clock(),\n\n i\n\n );\n\n }\n\n}\n\n\n","file_path":"tests/basic/clocks.rs","rank":1,"score":215107.49940371205},{"content":"/// Run the given function under a PCT concurrency scheduler for some number of iterations at the\n\n/// given depth. Each iteration will run a (potentially) different randomized schedule.\n\npub fn check_pct<F>(f: F, iterations: usize, depth: usize)\n\nwhere\n\n F: Fn() + Send + Sync + 'static,\n\n{\n\n use crate::scheduler::PctScheduler;\n\n\n\n let scheduler = PctScheduler::new(depth, iterations);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(f);\n\n}\n\n\n","file_path":"src/lib.rs","rank":2,"score":213199.6153677763},{"content":"/// Run the given function under a depth-first-search scheduler until all interleavings have been\n\n/// explored (but if the max_iterations bound is provided, stop after that many iterations).\n\npub fn check_dfs<F>(f: F, max_iterations: Option<usize>)\n\nwhere\n\n F: Fn() + Send + Sync + 'static,\n\n{\n\n use crate::scheduler::DfsScheduler;\n\n\n\n let scheduler = DfsScheduler::new(max_iterations, false);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(f);\n\n}\n\n\n","file_path":"src/lib.rs","rank":3,"score":205098.37431829562},{"content":"#[doc(hidden)]\n\npub fn check<F>(f: F)\n\nwhere\n\n F: Fn() + Send + Sync + 'static,\n\n{\n\n use crate::scheduler::RoundRobinScheduler;\n\n\n\n let runner = Runner::new(RoundRobinScheduler::new(), Default::default());\n\n runner.run(f);\n\n}\n\n\n","file_path":"src/lib.rs","rank":5,"score":199701.09882888995},{"content":"// Same as `basic`, but with a static Once. Static synchronization primitives should be reset across\n\n// executions, so this test should work exactly the same way.\n\nfn basic_static<F>(num_threads: usize, checker: F)\n\nwhere\n\n F: FnOnce(Box<dyn Fn() + Send + Sync + 'static>),\n\n{\n\n static O: Once = Once::new();\n\n\n\n let initializer = Arc::new(std::sync::Mutex::new(HashSet::new()));\n\n let initializer_clone = Arc::clone(&initializer);\n\n\n\n checker(Box::new(move || {\n\n let counter = Arc::new(AtomicUsize::new(0));\n\n\n\n assert!(!O.is_completed());\n\n\n\n let threads = (0..num_threads)\n\n .map(|_| {\n\n let counter = Arc::clone(&counter);\n\n let initializer = Arc::clone(&initializer);\n\n thread::spawn(move || {\n\n O.call_once(|| {\n","file_path":"tests/basic/once.rs","rank":6,"score":187867.63988153174},{"content":"#[derive(Default)]\n\nstruct State {\n\n value: u64,\n\n}\n\n\n\nimpl State {\n\n fn foo(&self) -> bool {\n\n self.value > 0\n\n }\n\n\n\n fn bar(&self) -> u64 {\n\n self.value\n\n }\n\n\n\n fn update(&mut self) {\n\n self.value += 1;\n\n }\n\n}\n\n\n\n// #[tokio::main(worker_threads = 2)]\n\nasync fn main() {\n","file_path":"tests/demo/async_match_deadlock.rs","rank":7,"score":183223.8223299997},{"content":"/// Run the given function according to a given encoded schedule, usually produced as the output of\n\n/// a failing Shuttle test case.\n\n///\n\n/// This function allows deterministic replay of a failing schedule, as long as `f` contains no\n\n/// non-determinism other than that introduced by scheduling.\n\n///\n\n/// This is a convenience function for constructing a [`Runner`] that uses\n\n/// [`ReplayScheduler::new_from_encoded`](scheduler::ReplayScheduler::new_from_encoded).\n\npub fn replay<F>(f: F, encoded_schedule: &str)\n\nwhere\n\n F: Fn() + Send + Sync + 'static,\n\n{\n\n use crate::scheduler::ReplayScheduler;\n\n\n\n let scheduler = ReplayScheduler::new_from_encoded(encoded_schedule);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(f);\n\n}\n\n\n","file_path":"src/lib.rs","rank":8,"score":182047.56347491243},{"content":"/// Run a future to completion on the current thread.\n\npub fn block_on<F: Future>(future: F) -> F::Output {\n\n let mut future = Box::pin(future);\n\n let waker = ExecutionState::with(|state| state.current_mut().waker());\n\n let cx = &mut Context::from_waker(&waker);\n\n\n\n thread::switch();\n\n\n\n loop {\n\n match future.as_mut().poll(cx) {\n\n Poll::Ready(result) => break result,\n\n Poll::Pending => {\n\n ExecutionState::with(|state| state.current_mut().sleep_unless_woken());\n\n }\n\n }\n\n\n\n thread::switch();\n\n }\n\n}\n\n\n\n/// Yields execution back to the scheduler.\n","file_path":"src/future/mod.rs","rank":9,"score":178798.82577829357},{"content":"/// Run the given function according to a schedule saved in the given file, usually produced as the\n\n/// output of a failing Shuttle test case.\n\n///\n\n/// This function allows deterministic replay of a failing schedule, as long as `f` contains no\n\n/// non-determinism other than that introduced by scheduling.\n\n///\n\n/// This is a convenience function for constructing a [`Runner`] that uses\n\n/// [`ReplayScheduler::new_from_file`](scheduler::ReplayScheduler::new_from_file).\n\npub fn replay_from_file<F, P>(f: F, path: P)\n\nwhere\n\n F: Fn() + Send + Sync + 'static,\n\n P: AsRef<std::path::Path>,\n\n{\n\n use crate::scheduler::ReplayScheduler;\n\n\n\n let scheduler = ReplayScheduler::new_from_file(path).expect(\"could not load schedule from file\");\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(f);\n\n}\n\n\n\n/// Declare a new thread local storage key of type [`LocalKey`](crate::thread::LocalKey).\n\n#[macro_export]\n\nmacro_rules! thread_local {\n\n // empty (base case for the recursion)\n\n () => {};\n\n\n\n // process multiple declarations with a const initializer\n\n ($(#[$attr:meta])* $vis:vis static $name:ident: $t:ty = const { $init:expr }; $($rest:tt)*) => (\n","file_path":"src/lib.rs","rank":10,"score":175772.37021943793},{"content":"/// Spawn a new thread, returning a JoinHandle for it.\n\n///\n\n/// The join handle can be used (via the `join` method) to block until the child thread has\n\n/// finished.\n\npub fn spawn<F, T>(f: F) -> JoinHandle<T>\n\nwhere\n\n F: FnOnce() -> T,\n\n F: Send + 'static,\n\n T: Send + 'static,\n\n{\n\n spawn_named(f, None, None)\n\n}\n\n\n","file_path":"src/thread.rs","rank":11,"score":175768.94993804678},{"content":"/// A toy benchmark that runs a bunch of threads that just increment a counter\n\nfn counter_sync(scheduler: impl Scheduler + 'static) {\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(|| {\n\n let counter = Arc::new(AtomicUsize::new(0usize));\n\n\n\n let tasks: Vec<_> = (0..NUM_TASKS)\n\n .map(|_| {\n\n let counter = Arc::clone(&counter);\n\n thread::spawn(move || {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n })\n\n })\n\n .collect();\n\n\n\n for t in tasks {\n\n t.join().unwrap();\n\n }\n\n });\n\n}\n\n\n","file_path":"benches/counter.rs","rank":12,"score":167782.976498603},{"content":"/// A toy benchmark that runs a bunch of tasks that just increment a counter\n\nfn counter_async(scheduler: impl Scheduler + 'static) {\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(|| {\n\n let counter = Arc::new(AtomicUsize::new(0usize));\n\n\n\n let tasks: Vec<_> = (0..NUM_TASKS)\n\n .map(|_| {\n\n let counter = Arc::clone(&counter);\n\n future::spawn(async move {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n })\n\n })\n\n .collect();\n\n\n\n future::block_on(async move {\n\n for t in tasks {\n\n t.await.unwrap();\n\n }\n\n });\n\n });\n\n}\n\n\n","file_path":"benches/counter.rs","rank":13,"score":167782.976498603},{"content":"pub fn bounded_buffer_benchmark(c: &mut Criterion) {\n\n let mut g = c.benchmark_group(\"buffer\");\n\n g.throughput(Throughput::Elements(ITERATIONS as u64));\n\n\n\n g.bench_function(\"pct\", |b| {\n\n b.iter(|| {\n\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\n\n bounded_buffer_check(scheduler);\n\n });\n\n });\n\n\n\n g.bench_function(\"random\", |b| {\n\n b.iter(|| {\n\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\n\n bounded_buffer_check(scheduler);\n\n });\n\n });\n\n}\n\n\n\ncriterion_group!(benches, bounded_buffer_benchmark);\n\ncriterion_main!(benches);\n","file_path":"benches/buffer.rs","rank":14,"score":167219.9786317374},{"content":"pub fn basic_lock_benchmark(c: &mut Criterion) {\n\n const ITERATIONS: usize = 1000;\n\n\n\n let mut g = c.benchmark_group(\"lock\");\n\n g.throughput(Throughput::Elements(ITERATIONS as u64));\n\n\n\n g.bench_function(\"pct\", |b| {\n\n b.iter(|| {\n\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\n\n basic_lock_check(scheduler);\n\n });\n\n });\n\n\n\n g.bench_function(\"random\", |b| {\n\n b.iter(|| {\n\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\n\n basic_lock_check(scheduler);\n\n });\n\n });\n\n}\n\n\n\ncriterion_group!(benches, basic_lock_benchmark);\n\ncriterion_main!(benches);\n","file_path":"benches/lock.rs","rank":15,"score":167219.9786317374},{"content":"pub fn counter_async_benchmark(c: &mut Criterion) {\n\n let mut g = c.benchmark_group(\"counter async\");\n\n g.throughput(Throughput::Elements(ITERATIONS as u64));\n\n\n\n g.bench_function(\"pct\", |b| {\n\n b.iter(|| {\n\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\n\n counter_async(scheduler);\n\n });\n\n });\n\n\n\n g.bench_function(\"random\", |b| {\n\n b.iter(|| {\n\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\n\n counter_async(scheduler);\n\n });\n\n });\n\n}\n\n\n","file_path":"benches/counter.rs","rank":16,"score":167219.9786317374},{"content":"pub fn counter_sync_benchmark(c: &mut Criterion) {\n\n let mut g = c.benchmark_group(\"counter sync\");\n\n g.throughput(Throughput::Elements(ITERATIONS as u64));\n\n\n\n g.bench_function(\"pct\", |b| {\n\n b.iter(|| {\n\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\n\n counter_sync(scheduler);\n\n });\n\n });\n\n\n\n g.bench_function(\"random\", |b| {\n\n b.iter(|| {\n\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\n\n counter_sync(scheduler);\n\n });\n\n });\n\n}\n\n\n\ncriterion_group!(benches, counter_async_benchmark, counter_sync_benchmark);\n\ncriterion_main!(benches);\n","file_path":"benches/counter.rs","rank":17,"score":167219.9786317374},{"content":"/// Spawn a new async task that the executor will run to completion.\n\npub fn spawn<T, F>(fut: F) -> JoinHandle<T>\n\nwhere\n\n F: Future<Output = T> + Send + 'static,\n\n T: Send + 'static,\n\n{\n\n let result = std::sync::Arc::new(std::sync::Mutex::new(None));\n\n let stack_size = ExecutionState::with(|s| s.config.stack_size);\n\n let task_id = ExecutionState::spawn_future(Wrapper::new(fut, std::sync::Arc::clone(&result)), stack_size, None);\n\n\n\n thread::switch();\n\n\n\n JoinHandle { task_id, result }\n\n}\n\n\n\n/// An owned permission to join on an async task (await its termination).\n\n#[derive(Debug)]\n\npub struct JoinHandle<T> {\n\n task_id: TaskId,\n\n result: std::sync::Arc<std::sync::Mutex<Option<Result<T, JoinError>>>>,\n\n}\n","file_path":"src/future/mod.rs","rank":18,"score":164752.05945511174},{"content":"/// A simple benchmark that just runs 3 threads incrementing a lock a bunch of times. This is a\n\n/// stress test of our `Execution` logic, since the threads spend basically all their time taking\n\n/// and dropping the lock.\n\nfn basic_lock_check(scheduler: impl Scheduler + 'static) {\n\n const INNER_ITERATIONS: usize = 200;\n\n\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(|| {\n\n let lock = Arc::new(Mutex::new(0usize));\n\n\n\n let thds: Vec<_> = (0..3)\n\n .map(|_| {\n\n let lock = Arc::clone(&lock);\n\n thread::spawn(move || {\n\n for _ in 0..INNER_ITERATIONS {\n\n *lock.lock().unwrap() += 1;\n\n }\n\n })\n\n })\n\n .collect();\n\n\n\n for thd in thds {\n\n thd.join().unwrap();\n\n }\n\n });\n\n}\n\n\n","file_path":"benches/lock.rs","rank":19,"score":164639.88805100537},{"content":"/// An implementation of a bounded concurrent queue, minus the actual queue part. Producers wait\n\n/// until there's space in the queue, and then put their object in. Consumers wait until the queue\n\n/// is non-empty, and then consume something from the queue.\n\nfn bounded_buffer_check(scheduler: impl Scheduler + 'static) {\n\n let runner = Runner::new(scheduler, Default::default());\n\n\n\n runner.run(move || {\n\n let lock = Arc::new(Mutex::new(()));\n\n let has_space = Arc::new(Condvar::new()); // count < MAX_QUEUE_SIZE\n\n let has_elements = Arc::new(Condvar::new()); // count > 0\n\n let count = Arc::new(AtomicUsize::new(0));\n\n\n\n let consumers = (0..NUM_CONSUMERS)\n\n .map(|_| {\n\n let lock = Arc::clone(&lock);\n\n let has_space = Arc::clone(&has_space);\n\n let has_elements = Arc::clone(&has_elements);\n\n let count = Arc::clone(&count);\n\n thread::spawn(move || {\n\n let events = NUM_EVENTS / NUM_CONSUMERS;\n\n for _ in 0..events {\n\n let mut guard = lock.lock().unwrap();\n\n while count.load(Ordering::SeqCst) == 0 {\n","file_path":"benches/buffer.rs","rank":20,"score":164635.8705409352},{"content":"/// Emits a machine instruction to signal the processor that it is running in a busy-wait spin-loop\n\n/// (“spin lock”).\n\npub fn spin_loop() {\n\n // Probably not necessary, but let's emit it just in case\n\n std::hint::spin_loop();\n\n\n\n thread::yield_now();\n\n}\n","file_path":"src/hint.rs","rank":21,"score":164511.2509518337},{"content":"/// Cooperatively gives up a timeslice to the Shuttle scheduler.\n\n///\n\n/// Some Shuttle schedulers use this as a hint to deprioritize the current thread in order for other\n\n/// threads to make progress (e.g., in a spin loop).\n\npub fn yield_now() {\n\n let waker = ExecutionState::with(|state| state.current().waker());\n\n waker.wake_by_ref();\n\n ExecutionState::request_yield();\n\n thread::switch();\n\n}\n\n\n","file_path":"src/thread.rs","rank":22,"score":164466.11647148358},{"content":"// Check that PCT correctly deprioritizes a yielding thread. If it wasn't, there would be some\n\n// iteration of this test where the yielding thread has the highest priority and so the others\n\n// never make progress.\n\nfn yield_spin_loop(use_yield: bool) {\n\n const NUM_THREADS: usize = 4;\n\n\n\n let scheduler = PctScheduler::new(1, 100);\n\n let mut config = Config::new();\n\n config.max_steps = MaxSteps::FailAfter(50);\n\n let runner = Runner::new(scheduler, config);\n\n runner.run(move || {\n\n let count = Arc::new(AtomicUsize::new(0usize));\n\n\n\n let _thds = (0..NUM_THREADS)\n\n .map(|_| {\n\n let count = count.clone();\n\n thread::spawn(move || {\n\n count.fetch_add(1, Ordering::SeqCst);\n\n })\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n while count.load(Ordering::SeqCst) < NUM_THREADS {\n\n if use_yield {\n\n thread::yield_now();\n\n } else {\n\n thread::sleep(Duration::from_millis(1));\n\n }\n\n }\n\n });\n\n}\n\n\n","file_path":"tests/basic/pct.rs","rank":23,"score":162676.62419345533},{"content":"// Check that PCT correctly deprioritizes a yielding task. If it wasn't, there would be some\n\n// iteration of this test where the yielding task has the highest priority and so the others\n\n// never make progress.\n\nfn yield_spin_loop(use_yield: bool) {\n\n const NUM_TASKS: usize = 4;\n\n\n\n let scheduler = PctScheduler::new(1, 100);\n\n let mut config = Config::new();\n\n config.max_steps = MaxSteps::FailAfter(50);\n\n let runner = Runner::new(scheduler, config);\n\n runner.run(move || {\n\n let count = Arc::new(AtomicUsize::new(0usize));\n\n\n\n let _thds = (0..NUM_TASKS)\n\n .map(|_| {\n\n let count = count.clone();\n\n future::spawn(async move {\n\n count.fetch_add(1, Ordering::SeqCst);\n\n })\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n future::block_on(async move {\n","file_path":"tests/future/pct.rs","rank":24,"score":162676.62419345533},{"content":"pub fn me() -> usize {\n\n usize::from(thread::current().id())\n\n}\n\n\n","file_path":"tests/basic/clocks.rs","rank":25,"score":159896.0817271629},{"content":"fn basic<F>(num_threads: usize, checker: F)\n\nwhere\n\n F: FnOnce(Box<dyn Fn() + Send + Sync + 'static>),\n\n{\n\n let initializer = Arc::new(std::sync::Mutex::new(HashSet::new()));\n\n let initializer_clone = Arc::clone(&initializer);\n\n\n\n checker(Box::new(move || {\n\n let once = Arc::new(Once::new());\n\n let counter = Arc::new(AtomicUsize::new(0));\n\n\n\n assert!(!once.is_completed());\n\n\n\n let threads = (0..num_threads)\n\n .map(|_| {\n\n let once = Arc::clone(&once);\n\n let counter = Arc::clone(&counter);\n\n let initializer = Arc::clone(&initializer);\n\n thread::spawn(move || {\n\n once.call_once(|| {\n","file_path":"tests/basic/once.rs","rank":27,"score":157611.60702462928},{"content":"/// The number of context switches that happened so far in the current Shuttle execution.\n\n///\n\n/// Note that this is the number of *possible* context switches, i.e., including times when the\n\n/// scheduler decided to continue with the same task. This means the result can be used as a\n\n/// timestamp for atomic actions during an execution.\n\n///\n\n/// Panics if called outside of a Shuttle execution.\n\npub fn context_switches() -> usize {\n\n ExecutionState::context_switches()\n\n}\n\n\n","file_path":"src/current.rs","rank":30,"score":156095.12946452567},{"content":"/// Validate that we see every permutation of message orderings at the receiver of the mpsc channel\n\nfn mpsc_stream_permutations<Tx, Rx, F>(num_tasks: usize, creator: F)\n\nwhere\n\n F: Fn() -> (Tx, Rx) + Send + Sync + 'static,\n\n Tx: Sink<usize> + Clone + Unpin + Send + 'static,\n\n Tx::Error: std::fmt::Debug,\n\n Rx: Stream<Item = usize> + Send + 'static,\n\n{\n\n let permutations = std::sync::Arc::new(std::sync::Mutex::new(HashSet::new()));\n\n let permutations_clone = permutations.clone();\n\n\n\n check_dfs(\n\n move || {\n\n let (tx, rx) = creator();\n\n\n\n for i in 0..num_tasks {\n\n let mut tx = tx.clone();\n\n future::spawn(async move {\n\n tx.send(i).await.expect(\"send should succeed\");\n\n });\n\n }\n","file_path":"tests/future/channel.rs","rank":31,"score":140084.93028915502},{"content":"fn mpsc_stream_sum<Tx, Rx, F>(num_tasks: usize, creator: F)\n\nwhere\n\n F: Fn() -> (Tx, Rx),\n\n Tx: Sink<usize> + Clone + Unpin + Send + 'static,\n\n Tx::Error: std::fmt::Debug,\n\n Rx: Stream<Item = usize> + Send + 'static,\n\n{\n\n let (tx, rx) = creator();\n\n\n\n for i in 0..num_tasks {\n\n let mut tx = tx.clone();\n\n future::spawn(async move {\n\n tx.send(i).await.expect(\"send should succeed\");\n\n });\n\n }\n\n\n\n // A channel's stream terminates when all senders are dropped. Every task has its own clone of\n\n // the sender, so we need to drop the original one.\n\n drop(tx);\n\n\n\n future::block_on(async move {\n\n let stream = rx.fold(0, |acc, x| async move { acc + x });\n\n let result = stream.await;\n\n assert_eq!(result, num_tasks * (num_tasks - 1) / 2);\n\n })\n\n}\n\n\n","file_path":"tests/future/channel.rs","rank":32,"score":140084.93028915502},{"content":"// We wrap a task returning a value inside a wrapper task that returns (). The wrapper\n\n// contains a mutex-wrapped field that stores the value where it can be passed to a task\n\n// waiting on the join handle.\n\nstruct Wrapper<T, F> {\n\n future: Pin<Box<F>>,\n\n result: std::sync::Arc<std::sync::Mutex<Option<Result<T, JoinError>>>>,\n\n}\n\n\n\nimpl<T, F> Wrapper<T, F>\n\nwhere\n\n F: Future<Output = T> + Send + 'static,\n\n{\n\n fn new(future: F, result: std::sync::Arc<std::sync::Mutex<Option<Result<T, JoinError>>>>) -> Self {\n\n Self {\n\n future: Box::pin(future),\n\n result,\n\n }\n\n }\n\n}\n\n\n\nimpl<T, F> Future for Wrapper<T, F>\n\nwhere\n\n F: Future<Output = T> + Send + 'static,\n","file_path":"src/future/mod.rs","rank":33,"score":132908.5325031607},{"content":"fn spawn_named<F, T>(f: F, name: Option<String>, stack_size: Option<usize>) -> JoinHandle<T>\n\nwhere\n\n F: FnOnce() -> T,\n\n F: Send + 'static,\n\n T: Send + 'static,\n\n{\n\n // TODO Check if it's worth avoiding the call to `ExecutionState::config()` if we're going\n\n // TODO to use an existing continuation from the pool.\n\n let stack_size = stack_size.unwrap_or_else(|| ExecutionState::with(|s| s.config.stack_size));\n\n let result = std::sync::Arc::new(std::sync::Mutex::new(None));\n\n let task_id = {\n\n let result = std::sync::Arc::clone(&result);\n\n let f = move || thread_fn(f, result);\n\n ExecutionState::spawn_thread(f, stack_size, name.clone(), None)\n\n };\n\n\n\n thread::switch();\n\n\n\n let thread = Thread {\n\n id: ThreadId { task_id },\n","file_path":"src/thread.rs","rank":34,"score":131180.93124127015},{"content":"fn two_workers<F>(signal_thread: F)\n\nwhere\n\n F: Fn(Arc<Condvar>),\n\n{\n\n let lock = Arc::new(Mutex::new(false));\n\n let cond = Arc::new(Condvar::new());\n\n\n\n for _ in 0..2 {\n\n let lock = Arc::clone(&lock);\n\n let cond = Arc::clone(&cond);\n\n thread::spawn(move || {\n\n let mut guard = lock.lock().unwrap();\n\n while !*guard {\n\n guard = cond.wait(guard).unwrap();\n\n }\n\n });\n\n }\n\n\n\n *lock.lock().unwrap() = true;\n\n signal_thread(cond);\n\n}\n\n\n","file_path":"tests/basic/condvar.rs","rank":35,"score":129572.96240833172},{"content":"/// Blocks unless or until the current thread's token is made available.\n\npub fn park() {\n\n let switch = ExecutionState::with(|s| s.current_mut().park());\n\n\n\n // We only need to context switch if the park token was unavailable. If it was available, then\n\n // any execution reachable by context switching here would also be reachable by having not\n\n // chosen this thread at the last context switch, because the park state of a thread is only\n\n // observable by the thread itself.\n\n if switch {\n\n thread::switch();\n\n }\n\n}\n\n\n","file_path":"src/thread.rs","rank":36,"score":128380.01295140595},{"content":"#[test]\n\nfn yield_spin_loop_fair() {\n\n yield_spin_loop(true);\n\n}\n\n\n","file_path":"tests/basic/pct.rs","rank":37,"score":127813.61471537196},{"content":"#[test]\n\n#[should_panic(expected = \"exceeded max_steps bound\")]\n\nfn yield_spin_loop_unfair() {\n\n yield_spin_loop(false);\n\n}\n\n\n\n#[test]\n\n#[should_panic(expected = \"null dereference\")]\n","file_path":"tests/basic/pct.rs","rank":38,"score":127813.61471537196},{"content":"#[test]\n\nfn yield_spin_loop_fair() {\n\n yield_spin_loop(true);\n\n}\n\n\n","file_path":"tests/future/pct.rs","rank":39,"score":127813.61471537196},{"content":"#[test]\n\nfn yield_loop_three_threads() {\n\n let iterations = Arc::new(AtomicUsize::new(0));\n\n\n\n {\n\n let counter = Arc::clone(&iterations);\n\n let scheduler = DfsScheduler::new(None, false);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(move || {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n\n\n thread::spawn(|| {\n\n for _ in 0..3 {\n\n thread::yield_now();\n\n }\n\n });\n\n\n\n thread::spawn(|| {\n\n for _ in 0..3 {\n\n thread::yield_now();\n\n }\n","file_path":"tests/basic/dfs.rs","rank":40,"score":127813.61471537196},{"content":"#[test]\n\nfn yield_loop_one_thread() {\n\n let iterations = Arc::new(AtomicUsize::new(0));\n\n\n\n {\n\n let counter = Arc::clone(&iterations);\n\n let scheduler = DfsScheduler::new(None, false);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(move || {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n\n\n thread::spawn(|| {\n\n for _ in 0..4 {\n\n thread::yield_now();\n\n }\n\n });\n\n\n\n // no-op\n\n });\n\n }\n\n\n\n // 6 places we can run thread 0: before thread 1 starts, before each of the 4 yields, or last\n\n assert_eq!(iterations.load(Ordering::SeqCst), 6);\n\n}\n\n\n","file_path":"tests/basic/dfs.rs","rank":41,"score":127813.61471537196},{"content":"#[test]\n\n#[should_panic(expected = \"exceeded max_steps bound\")]\n\nfn yield_spin_loop_unfair() {\n\n yield_spin_loop(false);\n\n}\n","file_path":"tests/future/pct.rs","rank":42,"score":127813.61471537196},{"content":"#[test]\n\nfn yield_loop_two_threads() {\n\n let iterations = Arc::new(AtomicUsize::new(0));\n\n\n\n {\n\n let counter = Arc::clone(&iterations);\n\n let scheduler = DfsScheduler::new(None, false);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(move || {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n\n\n thread::spawn(|| {\n\n for _ in 0..4 {\n\n thread::yield_now();\n\n }\n\n });\n\n\n\n for _ in 0..4 {\n\n thread::yield_now();\n\n }\n\n });\n\n }\n\n\n\n // 2 threads, 5 operations each (thread start + 4 yields)\n\n // 2*5 choose 5 = 252\n\n assert_eq!(iterations.load(Ordering::SeqCst), 252);\n\n}\n\n\n","file_path":"tests/basic/dfs.rs","rank":43,"score":127813.61471537196},{"content":"#[test]\n\nfn yield_loop_max_depth() {\n\n let iterations = Arc::new(AtomicUsize::new(0));\n\n\n\n {\n\n let counter = Arc::clone(&iterations);\n\n let scheduler = DfsScheduler::new(None, false);\n\n let runner = Runner::new(scheduler, max_steps(20));\n\n runner.run(move || {\n\n for _ in 0..100 {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n thread::yield_now();\n\n }\n\n });\n\n }\n\n\n\n assert_eq!(iterations.load(Ordering::SeqCst), 20);\n\n}\n","file_path":"tests/basic/dfs.rs","rank":44,"score":127813.61471537196},{"content":"#[test]\n\nfn yield_loop_two_threads_bounded() {\n\n let iterations = Arc::new(AtomicUsize::new(0));\n\n\n\n {\n\n let counter = Arc::clone(&iterations);\n\n let scheduler = DfsScheduler::new(Some(100), false);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(move || {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n\n\n thread::spawn(|| {\n\n for _ in 0..4 {\n\n thread::yield_now();\n\n }\n\n });\n\n\n\n for _ in 0..4 {\n\n thread::yield_now();\n\n }\n\n });\n\n }\n\n\n\n assert_eq!(iterations.load(Ordering::SeqCst), 100);\n\n}\n\n\n","file_path":"tests/basic/dfs.rs","rank":45,"score":124470.36923469327},{"content":"/// Get a handle to the thread that invokes it\n\npub fn current() -> Thread {\n\n let (task_id, name) = ExecutionState::with(|s| {\n\n let me = s.current();\n\n (me.id(), me.name())\n\n });\n\n\n\n Thread {\n\n id: ThreadId { task_id },\n\n name,\n\n }\n\n}\n\n\n","file_path":"src/thread.rs","rank":46,"score":121197.74968958407},{"content":"// Note: `panic_iteration` is 1-indexed because \"iterations\" is a count\n\nfn iterations_test(run_iterations: usize, panic_iteration: usize) {\n\n let metrics = MetricsSubscriber::new();\n\n let _guard = tracing::subscriber::set_default(metrics.clone());\n\n\n\n let iterations = Arc::new(AtomicUsize::new(0));\n\n\n\n let result = catch_unwind(AssertUnwindSafe(|| {\n\n check_random(\n\n move || {\n\n iterations.fetch_add(1, Ordering::SeqCst);\n\n if iterations.load(Ordering::SeqCst) >= panic_iteration {\n\n panic!(\"expected panic\");\n\n }\n\n\n\n thread::spawn(move || {\n\n thread::yield_now();\n\n });\n\n },\n\n run_iterations,\n\n );\n\n }));\n\n\n\n assert_eq!(result.is_err(), panic_iteration <= run_iterations);\n\n assert_eq!(\n\n metrics.iterations.load(Ordering::SeqCst),\n\n run_iterations.min(panic_iteration)\n\n );\n\n}\n\n\n","file_path":"tests/basic/metrics.rs","rank":47,"score":120322.91002671179},{"content":"/// Get the current thread's vector clock\n\npub fn clock() -> VectorClock {\n\n crate::runtime::execution::ExecutionState::with(|state| {\n\n let me = state.current();\n\n state.get_clock(me.id()).clone()\n\n })\n\n}\n\n\n","file_path":"src/current.rs","rank":48,"score":118690.54312345074},{"content":"/// Create a bounded channel\n\npub fn sync_channel<T>(bound: usize) -> (SyncSender<T>, Receiver<T>) {\n\n let channel = Arc::new(Channel::new(Some(bound)));\n\n let sender = SyncSender {\n\n inner: Arc::clone(&channel),\n\n };\n\n let receiver = Receiver {\n\n inner: Arc::clone(&channel),\n\n };\n\n (sender, receiver)\n\n}\n\n\n","file_path":"src/sync/mpsc.rs","rank":49,"score":116785.33456698933},{"content":"/// Validates that schedule replay works by running a test, expecting it to fail, and then parsing\n\n/// and replaying the failing schedule from its output.\n\nfn check_replay_roundtrip<F, S>(test_func: F, scheduler: S)\n\nwhere\n\n F: Fn() + Send + Sync + RefUnwindSafe + 'static,\n\n S: Scheduler + UnwindSafe + 'static,\n\n{\n\n let test_func = Arc::new(test_func);\n\n\n\n // Run the test that should fail and capture the schedule it prints\n\n let result = {\n\n let test_func = test_func.clone();\n\n panic::catch_unwind(move || {\n\n let mut config = Config::new();\n\n config.failure_persistence = FailurePersistence::Print;\n\n let runner = Runner::new(scheduler, config);\n\n runner.run(move || test_func())\n\n })\n\n .expect_err(\"test should panic\")\n\n };\n\n let output = result.downcast::<String>().unwrap();\n\n let schedule = parse_schedule::from_stdout(&output).expect(\"output should contain a schedule\");\n","file_path":"tests/mod.rs","rank":50,"score":115938.28720515197},{"content":"/// A `Once` cell can either be `Running`, in which case a `Mutex` mediates racing threads trying to\n\n/// invoke `call_once`, or `Complete` once an initializer has completed, in which case the `Mutex`\n\n/// is no longer necessary.\n\nenum OnceInitState {\n\n Running(Rc<Mutex<bool>>),\n\n Complete(VectorClock),\n\n}\n\n\n\nimpl std::fmt::Debug for OnceInitState {\n\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\n\n match self {\n\n Self::Running(_) => write!(f, \"Running\"),\n\n Self::Complete(_) => write!(f, \"Complete\"),\n\n }\n\n }\n\n}\n\n\n\nimpl Once {\n\n /// Creates a new `Once` value.\n\n pub const fn new() -> Self {\n\n Self { _dummy: 0 }\n\n }\n\n\n","file_path":"src/sync/once.rs","rank":51,"score":115803.5958937145},{"content":"/// Puts the current thread to sleep for at least the specified amount of time.\n\n// Note that Shuttle does not model time, so this behaves just like a context switch.\n\npub fn sleep(_dur: Duration) {\n\n thread::switch();\n\n}\n\n\n","file_path":"src/thread.rs","rank":52,"score":114922.65814816294},{"content":"/// Validates that schedule replay works by running a test, expecting it to fail, and then parsing\n\n/// and replaying the failing schedule from its output.\n\nfn check_replay_roundtrip_file<F, S>(test_func: F, scheduler: S)\n\nwhere\n\n F: Fn() + Send + Sync + RefUnwindSafe + 'static,\n\n S: Scheduler + UnwindSafe + 'static,\n\n{\n\n let tempdir = tempfile::tempdir().expect(\"could not create tempdir\");\n\n let test_func = Arc::new(test_func);\n\n\n\n // Run the test that should fail and capture the schedule it prints\n\n let result = {\n\n let test_func = test_func.clone();\n\n let tempdir_path = tempdir.path().to_path_buf();\n\n panic::catch_unwind(move || {\n\n let mut config = Config::new();\n\n config.failure_persistence = FailurePersistence::File(Some(tempdir_path));\n\n let runner = Runner::new(scheduler, config);\n\n runner.run(move || test_func())\n\n })\n\n .expect_err(\"test should panic\")\n\n };\n","file_path":"tests/mod.rs","rank":53,"score":114357.45825928399},{"content":"#[derive(Debug)]\n\nstruct BarrierState {\n\n bound: usize,\n\n leader: Option<TaskId>,\n\n waiters: HashSet<TaskId>,\n\n clock: VectorClock,\n\n}\n\n\n\n#[derive(Debug)]\n\n/// A barrier enables multiple threads to synchronize the beginning of some computation.\n\npub struct Barrier {\n\n state: Rc<RefCell<BarrierState>>,\n\n}\n\n\n\nimpl Barrier {\n\n /// Creates a new barrier that can block a given number of threads.\n\n /// A barrier will block n-1 threads which call `wait()` and then wake up all threads\n\n /// at once when the nth thread calls `wait()`.\n\n pub fn new(n: usize) -> Self {\n\n let state = BarrierState {\n\n bound: n,\n","file_path":"src/sync/barrier.rs","rank":54,"score":112772.83493415231},{"content":"#[derive(Debug)]\n\nstruct CondvarState {\n\n waiters: HashMap<TaskId, CondvarWaitStatus>,\n\n next_epoch: usize,\n\n}\n\n\n\n// For tracking causal dependencies, we record the clock C of the thread that does the notify.\n\n// When a thread is unblocked, its clock is updated by C.\n","file_path":"src/sync/condvar.rs","rank":55,"score":112772.83493415231},{"content":"#[derive(Debug)]\n\nstruct MutexState {\n\n holder: Option<TaskId>,\n\n waiters: TaskSet,\n\n clock: VectorClock,\n\n}\n\n\n\nimpl<T> Mutex<T> {\n\n /// Creates a new mutex in an unlocked state ready for use.\n\n pub fn new(value: T) -> Self {\n\n let state = MutexState {\n\n holder: None,\n\n waiters: TaskSet::new(),\n\n clock: VectorClock::new(),\n\n };\n\n\n\n Self {\n\n inner: std::sync::Mutex::new(value),\n\n state: Rc::new(RefCell::new(state)),\n\n }\n\n }\n","file_path":"src/sync/mutex.rs","rank":56,"score":112772.83493415231},{"content":"/// Blocks unless or until the current thread's token is made available or the specified duration\n\n/// has been reached (may wake spuriously).\n\n///\n\n/// Note that Shuttle does not module time, so this behaves identically to `park`. It cannot\n\n/// spuriously wake.\n\npub fn park_timeout(_dur: Duration) {\n\n park();\n\n}\n\n\n\n/// Thread factory, which can be used in order to configure the properties of a new thread.\n\n#[derive(Debug, Default)]\n\npub struct Builder {\n\n name: Option<String>,\n\n stack_size: Option<usize>,\n\n}\n\n\n\nimpl Builder {\n\n /// Generates the base configuration for spawning a thread, from which configuration methods can be chained.\n\n pub fn new() -> Self {\n\n Self {\n\n name: None,\n\n stack_size: None,\n\n }\n\n }\n\n\n","file_path":"src/thread.rs","rank":57,"score":112578.55161610793},{"content":"/// Retrieve the thread-local random number generator, seeded by the system. Intended to be used in\n\n/// method chaining style, e.g. `thread_rng().gen::<i32>()`, or cached locally, e.g.\n\n/// `let mut rng = thread_rng();`.\n\npub fn thread_rng() -> rngs::ThreadRng {\n\n rngs::ThreadRng\n\n}\n\n\n\npub use rand::{Rng, RngCore};\n","file_path":"src/rand.rs","rank":58,"score":110397.7609842945},{"content":"#[derive(Debug, Clone)]\n\nenum PanicHookState {\n\n Disarmed,\n\n Armed(Config),\n\n Persisted(String),\n\n}\n\n\n\nthread_local! {\n\n static PANIC_HOOK: Mutex<PanicHookState> = Mutex::new(PanicHookState::Disarmed);\n\n}\n\n\n\n/// A guard that disarms the panic hook when dropped\n\n#[derive(Debug)]\n\n#[non_exhaustive]\n\npub struct PanicHookGuard;\n\n\n\nimpl Drop for PanicHookGuard {\n\n fn drop(&mut self) {\n\n PANIC_HOOK.with(|lock| *lock.lock().unwrap() = PanicHookState::Disarmed);\n\n }\n\n}\n\n\n\n/// Set up a panic hook that will try to print the current schedule to stderr so that the failure\n\n/// can be replayed. Returns a guard that will disarm the panic hook when dropped.\n\n///\n\n/// See the module documentation for more details on how this method fits into the failure reporting\n\n/// story.\n","file_path":"src/runtime/failure.rs","rank":59,"score":110394.43633523706},{"content":"/// An atomic fence, like the standard library's [std::sync::atomic::fence].\n\npub fn fence(order: Ordering) {\n\n if order == Ordering::Relaxed {\n\n panic!(\"there is no such thing as a relaxed fence\");\n\n }\n\n\n\n maybe_warn_about_ordering(order);\n\n\n\n // SeqCst fences are no-ops in our execution model\n\n}\n\n\n\n// We can just reuse the standard library's compiler fence, as they have no visible run-time\n\n// behavior and so we need neither insert yieldpoints nor warn about non-SeqCst orderings.\n\npub use std::sync::atomic::compiler_fence;\n\n\n\n/// Base type for atomic implementations. This type handles generating the right interleavings for\n\n/// all atomics. The interesting stuff is in `load`, `store`, `swap`, and `fetch_update`; all other\n\n/// atomic operations are implemented in terms of those four primitives.\n","file_path":"src/sync/atomic/mod.rs","rank":60,"score":110382.13137396771},{"content":"#[derive(Debug)]\n\nstruct RwLockState {\n\n holder: RwLockHolder,\n\n waiting_readers: TaskSet,\n\n waiting_writers: TaskSet,\n\n clock: VectorClock,\n\n}\n\n\n","file_path":"src/sync/rwlock.rs","rank":61,"score":110164.2490269967},{"content":"/// Like [`shuttle::future::yield_now`] but doesn't request a yield from the scheduler\n\nstruct UnfairYieldNow {\n\n yielded: bool,\n\n}\n\n\n\nimpl Future for UnfairYieldNow {\n\n type Output = ();\n\n\n\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<()> {\n\n if self.yielded {\n\n return Poll::Ready(());\n\n }\n\n\n\n self.yielded = true;\n\n cx.waker().wake_by_ref();\n\n Poll::Pending\n\n }\n\n}\n\n\n","file_path":"tests/future/pct.rs","rank":62,"score":110105.11889129721},{"content":"// Note: The channels in std::sync::mpsc only support a single Receiver (which cannot be\n\n// cloned). The state below admits a more general use case, where multiple Senders\n\n// and Receivers can share a single channel.\n\nstruct ChannelState<T> {\n\n messages: SmallVec<[TimestampedValue<T>; MAX_INLINE_MESSAGES]>, // messages in the channel\n\n receiver_clock: Option<SmallVec<[VectorClock; MAX_INLINE_MESSAGES]>>, // receiver vector clocks for bounded case\n\n known_senders: usize, // number of senders referencing this channel\n\n known_receivers: usize, // number or receivers referencing this channel\n\n waiting_senders: SmallVec<[TaskId; DEFAULT_INLINE_TASKS]>, // list of currently blocked senders\n\n waiting_receivers: SmallVec<[TaskId; DEFAULT_INLINE_TASKS]>, // list of currently blocked receivers\n\n}\n\n\n\nimpl<T> Debug for ChannelState<T> {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n write!(f, \"Channel {{ \")?;\n\n write!(f, \"num_messages: {} \", self.messages.len())?;\n\n write!(\n\n f,\n\n \"known_senders {} known_receivers {} \",\n\n self.known_senders, self.known_receivers\n\n )?;\n\n write!(f, \"waiting_senders: [{:?}] \", self.waiting_senders)?;\n\n write!(f, \"waiting_receivers: [{:?}] \", self.waiting_receivers)?;\n","file_path":"src/sync/mpsc.rs","rank":63,"score":106784.6822691902},{"content":"/// Gets the clock for the thread with the given task ID\n\npub fn clock_for(task_id: TaskId) -> VectorClock {\n\n ExecutionState::with(|state| state.get_clock(task_id).clone())\n\n}\n","file_path":"src/current.rs","rank":64,"score":103175.42546128752},{"content":"struct Inner<T: Copy> {\n\n buffer: Box<[T]>,\n\n buffer_size: usize,\n\n put_at: usize,\n\n take_at: usize,\n\n occupied: usize,\n\n}\n\n\n\nimpl<T: Copy + Default> BoundedBuffer<T> {\n\n fn new(buffer_size: usize) -> Self {\n\n let inner = Inner {\n\n buffer: vec![T::default(); buffer_size].into_boxed_slice(),\n\n buffer_size,\n\n put_at: 0,\n\n take_at: 0,\n\n occupied: 0,\n\n };\n\n\n\n BoundedBuffer {\n\n inner: Arc::new(Mutex::new(inner)),\n","file_path":"tests/demo/bounded_buffer.rs","rank":65,"score":101587.6976276476},{"content":"#[test]\n\n#[should_panic(expected = \"tried to acquire a RwLock it already holds\")]\n\nfn async_match_deadlock() {\n\n shuttle::check_random(|| tokio::block_on(main()), 1000)\n\n}\n\n\n","file_path":"tests/demo/async_match_deadlock.rs","rank":66,"score":100318.01564079786},{"content":"#[must_use = \"the panic hook will be disarmed when the returned guard is dropped\"]\n\npub fn init_panic_hook(config: Config) -> PanicHookGuard {\n\n static INIT: Once = Once::new();\n\n INIT.call_once(|| {\n\n let original_hook = panic::take_hook();\n\n panic::set_hook(Box::new(move |panic_info| {\n\n let state = PANIC_HOOK.with(|lock| std::mem::replace(&mut *lock.lock().unwrap(), PanicHookState::Disarmed));\n\n // The hook is armed if this is the first time it's fired\n\n if let PanicHookState::Armed(config) = state {\n\n // We might not be able to get the info we need (e.g., if we panic while borrowing\n\n // ExecutionState)\n\n if let Some((name, schedule)) = ExecutionState::failure_info() {\n\n persist_task_failure(&schedule, name, &config, true);\n\n }\n\n }\n\n original_hook(panic_info);\n\n }));\n\n });\n\n\n\n PANIC_HOOK.with(|lock| *lock.lock().unwrap() = PanicHookState::Armed(config));\n\n\n\n PanicHookGuard\n\n}\n","file_path":"src/runtime/failure.rs","rank":67,"score":99625.48179473815},{"content":"#[derive(Clone)]\n\nstruct BoundedBuffer<T: Copy> {\n\n inner: Arc<Mutex<Inner<T>>>,\n\n cond: Arc<Condvar>,\n\n}\n\n\n","file_path":"tests/demo/bounded_buffer.rs","rank":68,"score":99305.78526485854},{"content":"#[test]\n\nfn shared_static() {\n\n static O: Once = Once::new();\n\n\n\n let counter = Arc::new(AtomicUsize::new(0));\n\n let mut total_executions = 0;\n\n\n\n // Try a bunch of times to provoke the race\n\n for _ in 0..50 {\n\n #[allow(clippy::needless_collect)] // https://github.com/rust-lang/rust-clippy/issues/7207\n\n let threads = (0..3)\n\n .map(|_| {\n\n let counter = Arc::clone(&counter);\n\n std::thread::spawn(move || {\n\n let scheduler = DfsScheduler::new(None, false);\n\n let runner = Runner::new(scheduler, Default::default());\n\n runner.run(move || {\n\n let thds = (0..2)\n\n .map(|_| {\n\n let counter = Arc::clone(&counter);\n\n thread::spawn(move || {\n","file_path":"tests/basic/once.rs","rank":69,"score":99157.03620501544},{"content":"#[test]\n\n#[should_panic(expected = \"tried to acquire a RwLock it already holds\")]\n\nfn async_match_deadlock_replay() {\n\n // Deterministically replay a deadlocking execution so we can, for example, single-step through\n\n // it in a debugger.\n\n shuttle::replay(|| tokio::block_on(main()), \"91010cbbc0daf8c5a5a9b162a08a08\")\n\n}\n","file_path":"tests/demo/async_match_deadlock.rs","rank":70,"score":98392.50950929451},{"content":"/// Create an unbounded channel\n\npub fn channel<T>() -> (Sender<T>, Receiver<T>) {\n\n let channel = Arc::new(Channel::new(None));\n\n let sender = Sender {\n\n inner: Arc::clone(&channel),\n\n };\n\n let receiver = Receiver {\n\n inner: Arc::clone(&channel),\n\n };\n\n (sender, receiver)\n\n}\n\n\n","file_path":"src/sync/mpsc.rs","rank":71,"score":98017.22713579392},{"content":"#[test]\n\nfn wake_after_finish() {\n\n #[derive(Clone)]\n\n struct Future1 {\n\n // We don't care about interleaving this lock; just using it to share the waker across tasks\n\n waker: std::sync::Arc<std::sync::Mutex<Option<Waker>>>,\n\n }\n\n\n\n impl Future1 {\n\n fn new() -> Self {\n\n Self {\n\n waker: std::sync::Arc::new(std::sync::Mutex::new(None)),\n\n }\n\n }\n\n }\n\n\n\n impl Future for Future1 {\n\n type Output = ();\n\n\n\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\n\n *self.waker.lock().unwrap() = Some(cx.waker().clone());\n","file_path":"tests/future/waker.rs","rank":72,"score":96515.00689101793},{"content":"#[test]\n\nfn basic_static_dfs() {\n\n basic_static(2, |f| check_dfs(f, None));\n\n}\n\n\n","file_path":"tests/basic/once.rs","rank":73,"score":96461.80704410918},{"content":"#[test]\n\nfn basic_static_pct() {\n\n basic_static(10, |f| check_pct(f, 1000, 3));\n\n}\n\n\n\n// Test that multiple Once cells race for initialization independently\n","file_path":"tests/basic/once.rs","rank":74,"score":96461.80704410918},{"content":"#[test]\n\nfn unlock_yields() {\n\n let observed_values = Arc::new(std::sync::Mutex::new(HashSet::new()));\n\n let observed_values_clone = Arc::clone(&observed_values);\n\n\n\n check_dfs(\n\n move || {\n\n let lock = Arc::new(Mutex::new(0usize));\n\n\n\n let add_thread = {\n\n let lock = Arc::clone(&lock);\n\n thread::spawn(move || {\n\n *lock.lock().unwrap() += 1;\n\n *lock.lock().unwrap() += 1;\n\n })\n\n };\n\n let mul_thread = {\n\n let lock = Arc::clone(&lock);\n\n thread::spawn(move || {\n\n *lock.lock().unwrap() *= 2;\n\n })\n","file_path":"tests/basic/mutex.rs","rank":75,"score":96387.63555196143},{"content":"#[test]\n\nfn async_yield() {\n\n check_dfs(\n\n || {\n\n let v = future::block_on(async {\n\n future::yield_now().await;\n\n 42u32\n\n });\n\n assert_eq!(v, 42u32);\n\n },\n\n None,\n\n )\n\n}\n\n\n","file_path":"tests/future/basic.rs","rank":76,"score":96387.63555196143},{"content":"// Slightly generalized version of barrier test from std::sync\n\nfn barrier_test(n: usize, c: usize) {\n\n let barrier = Arc::new(Barrier::new(c));\n\n let (tx, rx) = channel();\n\n\n\n let handles = (0..n - 1)\n\n .map(|_| {\n\n let barrier = Arc::clone(&barrier);\n\n let tx = tx.clone();\n\n thread::spawn(move || {\n\n tx.send(barrier.wait().is_leader()).unwrap();\n\n })\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n // At this point, all spawned threads should be blocked,\n\n // so we shouldn't get anything from the port\n\n // TODO uncomment this line after we add support for try_recv()\n\n // assert!(matches!(rx.try_recv(), Err(TryRecvError::Empty)));\n\n\n\n let mut leader_found = barrier.wait().is_leader();\n","file_path":"tests/basic/barrier.rs","rank":77,"score":95663.33579704384},{"content":"#[test]\n\nfn max_steps_none() {\n\n let counter = Arc::new(AtomicUsize::new(0));\n\n let counter_clone = Arc::clone(&counter);\n\n\n\n let mut config = Config::new();\n\n config.max_steps = MaxSteps::None;\n\n\n\n let scheduler = RandomScheduler::new(10);\n\n let runner = Runner::new(scheduler, config);\n\n runner.run(move || {\n\n for _ in 0..100 {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n thread::yield_now();\n\n }\n\n });\n\n\n\n assert_eq!(counter_clone.load(Ordering::SeqCst), 100 * 10);\n\n}\n\n\n","file_path":"tests/basic/execution.rs","rank":78,"score":93991.23635285269},{"content":"#[test]\n\nfn replay_persist_none() {\n\n let result = panic::catch_unwind(|| {\n\n let scheduler = PctScheduler::new(2, 100);\n\n let mut config = Config::new();\n\n config.failure_persistence = FailurePersistence::None;\n\n let runner = Runner::new(scheduler, config);\n\n runner.run(concurrent_increment_buggy);\n\n })\n\n .expect_err(\"test should panic\");\n\n let output = result.downcast::<String>().unwrap();\n\n assert!(output.contains(\"counter is wrong\"));\n\n // All our current failure persistence modes print the word \"schedule\", so check that's missing\n\n assert!(!output.contains(\"schedule\"));\n\n}\n","file_path":"tests/basic/replay.rs","rank":79,"score":93991.23635285269},{"content":"#[test]\n\nfn iterations_without_running() {\n\n let metrics = MetricsSubscriber::new();\n\n\n\n {\n\n let _guard = tracing::subscriber::set_default(metrics.clone());\n\n let scheduler = RandomScheduler::new(10);\n\n let _runner = Runner::new(scheduler, Default::default());\n\n }\n\n\n\n assert_eq!(metrics.iterations.load(Ordering::SeqCst), 0);\n\n}\n","file_path":"tests/basic/metrics.rs","rank":80,"score":93991.23635285269},{"content":"#[test]\n\nfn async_thread_yield() {\n\n // This tests if thread::yield_now can be called from within an async block\n\n check_dfs(\n\n || {\n\n future::spawn(async move {\n\n thread::yield_now();\n\n });\n\n future::spawn(async move {});\n\n },\n\n None,\n\n )\n\n}\n\n\n","file_path":"tests/future/basic.rs","rank":81,"score":93876.12599249977},{"content":"#[test]\n\nfn thread_yield_point() {\n\n let success = Arc::new(AtomicU8::new(0));\n\n let success_clone = Arc::clone(&success);\n\n\n\n // We want to see executions that include both threads running first, otherwise we have\n\n // messed up the yieldpoints around spawn.\n\n check_random(\n\n move || {\n\n let flag = Arc::new(AtomicBool::new(false));\n\n let flag_clone = Arc::clone(&flag);\n\n\n\n thread::spawn(move || {\n\n flag_clone.store(true, Ordering::SeqCst);\n\n });\n\n\n\n if flag.load(Ordering::SeqCst) {\n\n success.fetch_or(0x1, Ordering::SeqCst);\n\n } else {\n\n success.fetch_or(0x2, Ordering::SeqCst);\n\n }\n\n },\n\n 100,\n\n );\n\n\n\n assert_eq!(success_clone.load(Ordering::SeqCst), 0x3);\n\n}\n\n\n","file_path":"tests/basic/thread.rs","rank":82,"score":93876.12599249977},{"content":"#[test]\n\nfn max_steps_continue() {\n\n let counter = Arc::new(AtomicUsize::new(0));\n\n let counter_clone = Arc::clone(&counter);\n\n\n\n let mut config = Config::new();\n\n config.max_steps = MaxSteps::ContinueAfter(50);\n\n\n\n let scheduler = RandomScheduler::new(10);\n\n let runner = Runner::new(scheduler, config);\n\n runner.run(move || {\n\n for _ in 0..100 {\n\n counter.fetch_add(1, Ordering::SeqCst);\n\n thread::yield_now();\n\n }\n\n });\n\n\n\n assert_eq!(counter_clone.load(Ordering::SeqCst), 50 * 10);\n\n}\n\n\n","file_path":"tests/basic/execution.rs","rank":83,"score":93868.920613374},{"content":"#[test]\n\nfn wake_self_on_join_handle() {\n\n check_dfs(\n\n || {\n\n let yielder = future::spawn(async move {\n\n future::yield_now().await;\n\n });\n\n\n\n struct Timeout<F: Future> {\n\n inner: Pin<Box<F>>,\n\n counter: u8,\n\n }\n\n\n\n impl<F> Future for Timeout<F>\n\n where\n\n F: Future,\n\n {\n\n type Output = ();\n\n\n\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\n\n if self.counter == 0 {\n","file_path":"tests/future/basic.rs","rank":84,"score":91647.08190364644},{"content":"#[test]\n\nfn mpsc_send_from_outside_runtime() {\n\n check_dfs(\n\n || {\n\n let (tx1, rx1) = channel::<()>();\n\n let (tx2, rx2) = channel::<i32>();\n\n let t1 = thread::spawn(move || {\n\n tx1.send(()).unwrap();\n\n for _ in 0..7 {\n\n assert_eq!(rx2.recv().unwrap(), 1);\n\n }\n\n });\n\n rx1.recv().unwrap();\n\n let t2 = thread::spawn(move || {\n\n for _ in 0..7 {\n\n tx2.send(1).unwrap();\n\n }\n\n });\n\n t1.join().expect(\"thread panicked\");\n\n t2.join().expect(\"thread panicked\");\n\n },\n\n None,\n\n );\n\n}\n\n\n\n// From libstd test suite\n","file_path":"tests/basic/mpsc.rs","rank":85,"score":91639.36264003182},{"content":"#[test]\n\nfn drop_shuttle_yield_future() {\n\n let orderings = Arc::new(AtomicUsize::new(0));\n\n let async_accesses = Arc::new(AtomicUsize::new(0));\n\n let post_yield_accesses = Arc::new(AtomicUsize::new(0));\n\n let orderings_clone = orderings.clone();\n\n let async_accesses_clone = async_accesses.clone();\n\n let post_yield_accesses_clone = post_yield_accesses.clone();\n\n\n\n check_dfs(\n\n move || {\n\n orderings.fetch_add(1, Ordering::SeqCst);\n\n let async_accesses = async_accesses.clone();\n\n let post_yield_accesses = post_yield_accesses.clone();\n\n future::spawn(async move {\n\n async_accesses.fetch_add(1, Ordering::SeqCst);\n\n future::yield_now().await;\n\n post_yield_accesses.fetch_add(1, Ordering::SeqCst);\n\n });\n\n },\n\n None,\n","file_path":"tests/future/basic.rs","rank":86,"score":91527.99638755377},{"content":"// Barrier\n\nfn clock_barrier(n: usize) {\n\n // This test checks that threads waiting on a barrier inherit the clocks from all the other participants in the barrier.\n\n //\n\n // The test creates a barrier with bound n and creates n threads (including the main thread).\n\n // Each thread initially checks that its clock is nonzero only for the main thread, and then waits on the barrier.\n\n // When it exits the barrier, each thread checks that its current clock is nonzero for all threads.\n\n // For sanity checking, we also spawn a dummy thread and check that its clock entry is always 0.\n\n let barrier = Arc::new(Barrier::new(n));\n\n\n\n // Create dummy thread (should have id 1)\n\n thread::spawn(|| {\n\n assert_eq!(me(), 1usize);\n\n });\n\n\n\n let _thds = (0..n - 1)\n\n .map(|_| {\n\n let barrier = Arc::clone(&barrier);\n\n thread::spawn(move || {\n\n check_clock(|i, c| (c > 0) == (i == 0));\n\n barrier.wait();\n","file_path":"tests/basic/clocks.rs","rank":87,"score":89997.88623622448},{"content":"#[test]\n\nfn max_steps_early_exit_scheduler() {\n\n use shuttle::scheduler::{Schedule, Scheduler, TaskId};\n\n\n\n #[derive(Debug)]\n\n struct EarlyExitScheduler {\n\n iterations: usize,\n\n max_iterations: usize,\n\n steps: usize,\n\n max_steps: usize,\n\n }\n\n\n\n impl EarlyExitScheduler {\n\n fn new(max_iterations: usize, max_steps: usize) -> Self {\n\n Self {\n\n iterations: 0,\n\n max_iterations,\n\n steps: 0,\n\n max_steps,\n\n }\n\n }\n","file_path":"tests/basic/execution.rs","rank":88,"score":89443.1406689577},{"content":"// RWLocks\n\nfn clock_rwlock(num_writers: usize, num_readers: usize) {\n\n // This test checks that when a thread acquires a RwLock, it inherits the clocks of writers that\n\n // accessed the lock before it. It's the same as `clock_mutex`, except that readers don't update\n\n // the set S, and aren't required to appear in the clock for future lock holders.\n\n //\n\n // TODO this test is pretty weak. Testing readers is hard because they race with each other; for\n\n // example, a reader might see the clock update from another reader before that reader has a\n\n // chance to update the set S. Causality is also pretty fuzzy for readers (see the TODOs in the\n\n // RwLock implementation). So we don't test very much about them here.\n\n let set = Arc::new(std::sync::Mutex::new(HashSet::from([0])));\n\n let lock = Arc::new(RwLock::new(()));\n\n\n\n // Create dummy thread (should have id 1)\n\n thread::spawn(|| {\n\n assert_eq!(me(), 1usize);\n\n });\n\n\n\n // Spawn the writers\n\n let _thds = (0..num_writers)\n\n .map(|_| {\n","file_path":"tests/basic/clocks.rs","rank":89,"score":88153.0555282512},{"content":"// Based on Fig 1(b) from the PCT paper. We model NULL pointer dereference with an Option unwrap.\n\nfn figure1b(num_threads: usize) {\n\n assert!(num_threads >= 2);\n\n\n\n let x1 = Arc::new(Mutex::new(Some(1)));\n\n let x2 = Arc::clone(&x1);\n\n\n\n // Optionally, spawn a bunch of threads that add scheduling choice points, each taking 5 steps\n\n for _ in 0..num_threads - 2 {\n\n thread::spawn(|| {\n\n for _ in 0..5 {\n\n thread::sleep(Duration::from_millis(1));\n\n }\n\n });\n\n }\n\n\n\n // Main worker threads take 10 steps each\n\n thread::spawn(move || {\n\n for _ in 0..5 {\n\n thread::sleep(Duration::from_millis(1));\n\n }\n","file_path":"tests/basic/pct.rs","rank":90,"score":87651.87593781405},{"content":"fn clock_once(num_threads: usize) {\n\n let once = Arc::new(Once::new());\n\n let init = Arc::new(std::sync::atomic::AtomicUsize::new(0));\n\n\n\n let threads = (0..num_threads)\n\n .map(|_| {\n\n let once = Arc::clone(&once);\n\n let init = Arc::clone(&init);\n\n thread::spawn(move || {\n\n check_clock(|i, c| (c > 0) == (i == 0));\n\n once.call_once(|| init.store(me(), std::sync::atomic::Ordering::SeqCst));\n\n let who_inited = init.load(std::sync::atomic::Ordering::SeqCst);\n\n // should have inhaled the clock of the thread that inited the Once, but might also\n\n // have inhaled the clocks of threads that we were racing with for initialization\n\n check_clock(|i, c| !(i == who_inited || i == 0 || i == me()) || c > 0);\n\n })\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n for thd in threads {\n\n thd.join().unwrap();\n\n }\n\n}\n\n\n","file_path":"tests/basic/clocks.rs","rank":91,"score":87651.87593781405},{"content":"fn reader(buffer: BoundedBuffer<usize>, iterations: usize) {\n\n for _ in 0..iterations {\n\n let _ = buffer.take();\n\n }\n\n}\n\n\n","file_path":"tests/demo/bounded_buffer.rs","rank":92,"score":87095.66055913802},{"content":"fn writer(buffer: BoundedBuffer<usize>, iterations: usize) {\n\n for i in 0..iterations {\n\n buffer.put(i);\n\n }\n\n}\n\n\n\n/// We’ll now write a small test driver program, which Coyote can use to find the bug.\n\n///\n\n/// The first test you write might look like this. Here we setup two tasks. First is a reader\n\n/// calling Take and the other is a Writer calling Put.\n\n///\n\n/// Clearly, we have to Put the same number of items as we Take.\n\n///\n\n/// Otherwise, there will be a trivial deadlock waiting for more items.\n\n///\n\n/// We have matched both in this test with 10 iterations of each Put and Take. We find no deadlock\n\n/// when we run the test above, despite Coyote systematically exploring different possible\n\n/// interleavings between the Put and Take calls.\n","file_path":"tests/demo/bounded_buffer.rs","rank":93,"score":87095.66055913802},{"content":"fn max_steps(n: usize) -> Config {\n\n let mut config = Config::new();\n\n config.max_steps = MaxSteps::ContinueAfter(n);\n\n config\n\n}\n\n\n","file_path":"tests/basic/dfs.rs","rank":94,"score":86207.57777658677},{"content":"fn clock_mutex(num_threads: usize) {\n\n // This test checks that when a thread acquires a lock, it inherits the vector clocks of\n\n // threads that accessed the lock before it.\n\n //\n\n // Test: create a mutex-protected set, initialized with 0 (the id of the main thread)\n\n // and spawn N threads where each thread does the following:\n\n // (1) check that its own initial vector clock only has nonzero for the creator (thread 0)\n\n // this checks that when a thread is created, it only inherits the clock of the spawner\n\n // (2) lock the set and add its own thread id to it; let the resulting set be S\n\n // (3) read its own clock again, call this C\n\n // (4) check that the only nonzero entries in C are for the threads in S\n\n // For sanity checking, we also spawn an initial dummy thread (with id 1) and ensure that its\n\n // clock is always 0.\n\n let mut set = HashSet::new();\n\n set.insert(0);\n\n let set = Arc::new(Mutex::new(set));\n\n\n\n // Create dummy thread (should have id 1)\n\n thread::spawn(|| {\n\n assert_eq!(me(), 1usize);\n","file_path":"tests/basic/clocks.rs","rank":95,"score":85453.6718727536},{"content":"// Threads\n\nfn clock_threads(num_threads: usize) {\n\n // Use an AtomicBool to create a synchronization point so a thread's clock is incremented.\n\n let flag = Arc::new(AtomicBool::new(false));\n\n let handles = (1..num_threads + 1)\n\n .map(|k| {\n\n let flag = Arc::clone(&flag);\n\n thread::spawn(move || {\n\n assert_eq!(me(), k);\n\n check_clock(|i, c| (c > 0) == (i == 0));\n\n assert!(!flag.load(Ordering::SeqCst));\n\n check_clock(|i, c| (c > 0) == (i == 0) || (i == k));\n\n k\n\n })\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n // As each thread joins, we get knowledge of its vector clock.\n\n for handle in handles {\n\n let k = handle.join().unwrap();\n\n check_clock(move |i, c| (c > 0) == (i <= k));\n\n }\n\n}\n\n\n","file_path":"tests/basic/clocks.rs","rank":96,"score":85453.6718727536},{"content":"fn mpsc_senders_with_blocking_inner(num_senders: usize, channel_size: usize) {\n\n assert!(num_senders >= channel_size);\n\n let num_receives = num_senders - channel_size;\n\n let (tx, rx) = sync_channel::<usize>(channel_size);\n\n let senders = (0..num_senders)\n\n .map(move |i| {\n\n let tx = tx.clone();\n\n thread::spawn(move || {\n\n tx.send(i).unwrap();\n\n })\n\n })\n\n .collect::<Vec<_>>();\n\n\n\n // Receive enough messages to ensure no sender will block\n\n for _ in 0..num_receives {\n\n rx.recv().unwrap();\n\n }\n\n for sender in senders {\n\n sender.join().unwrap();\n\n }\n\n}\n\n\n","file_path":"tests/basic/mpsc.rs","rank":97,"score":84918.07556080859},{"content":"fn clock_condvar_notify_one(num_notifiers: usize, num_waiters: usize) {\n\n let lock = Arc::new(Mutex::new(0usize));\n\n let cond = Arc::new(Condvar::new());\n\n\n\n for _ in 0..num_notifiers {\n\n let lock = Arc::clone(&lock);\n\n let cond = Arc::clone(&cond);\n\n thread::spawn(move || {\n\n assert!(me() <= num_notifiers);\n\n *lock.lock().unwrap() = me();\n\n cond.notify_one();\n\n });\n\n }\n\n\n\n for _ in 0..num_waiters {\n\n let lock = Arc::clone(&lock);\n\n let cond = Arc::clone(&cond);\n\n thread::spawn(move || {\n\n let mut guard = lock.lock().unwrap();\n\n while *guard == 0 {\n\n check_clock(|i, c| !(i >= 1 && i <= num_notifiers) || (c == 0)); // no notifier has gone yet\n\n guard = cond.wait(guard).unwrap();\n\n }\n\n // Note that since all the threads touch the lock, any of them may have preceded this thread.\n\n // But we know for sure that the thread that unblocked us should causally precede us.\n\n check_clock(|i, c| (i != *guard) || (c > 0));\n\n });\n\n }\n\n}\n\n\n","file_path":"tests/basic/clocks.rs","rank":98,"score":84918.07556080859},{"content":"fn clock_condvar_notify_all(num_waiters: usize) {\n\n let lock = Arc::new(Mutex::new(0usize));\n\n let cond = Arc::new(Condvar::new());\n\n\n\n {\n\n let lock = Arc::clone(&lock);\n\n let cond = Arc::clone(&cond);\n\n thread::spawn(move || {\n\n assert_eq!(me(), 1);\n\n *lock.lock().unwrap() = me();\n\n cond.notify_all();\n\n });\n\n }\n\n\n\n for _ in 0..num_waiters {\n\n let lock = Arc::clone(&lock);\n\n let cond = Arc::clone(&cond);\n\n thread::spawn(move || {\n\n let mut guard = lock.lock().unwrap();\n\n while *guard == 0 {\n\n check_clock(|i, c| (i != 1) || (c == 0)); // notifier hasn't been scheduled\n\n guard = cond.wait(guard).unwrap();\n\n }\n\n // Note that since all the threads touch the lock, any of them may have preceded this thread.\n\n // But we know for sure that the thread that unblocked us should causally precede us.\n\n check_clock(|i, c| (i != *guard) || (c > 0));\n\n });\n\n }\n\n}\n\n\n","file_path":"tests/basic/clocks.rs","rank":99,"score":83389.73222433131}],"string":"[\n {\n \"content\": \"/// Run the given function under a randomized concurrency scheduler for some number of iterations.\\n\\n/// Each iteration will run a (potentially) different randomized schedule.\\n\\npub fn check_random<F>(f: F, iterations: usize)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + 'static,\\n\\n{\\n\\n use crate::scheduler::RandomScheduler;\\n\\n\\n\\n let scheduler = RandomScheduler::new(iterations);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 0,\n \"score\": 216016.19799572162\n },\n {\n \"content\": \"#[track_caller]\\n\\npub fn check_clock(f: impl Fn(usize, u32) -> bool) {\\n\\n for (i, &c) in current::clock().iter().enumerate() {\\n\\n assert!(\\n\\n f(i, c),\\n\\n \\\"clock {:?} doesn't satisfy predicate at {}\\\",\\n\\n current::clock(),\\n\\n i\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 1,\n \"score\": 215107.49940371205\n },\n {\n \"content\": \"/// Run the given function under a PCT concurrency scheduler for some number of iterations at the\\n\\n/// given depth. Each iteration will run a (potentially) different randomized schedule.\\n\\npub fn check_pct<F>(f: F, iterations: usize, depth: usize)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + 'static,\\n\\n{\\n\\n use crate::scheduler::PctScheduler;\\n\\n\\n\\n let scheduler = PctScheduler::new(depth, iterations);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 2,\n \"score\": 213199.6153677763\n },\n {\n \"content\": \"/// Run the given function under a depth-first-search scheduler until all interleavings have been\\n\\n/// explored (but if the max_iterations bound is provided, stop after that many iterations).\\n\\npub fn check_dfs<F>(f: F, max_iterations: Option<usize>)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + 'static,\\n\\n{\\n\\n use crate::scheduler::DfsScheduler;\\n\\n\\n\\n let scheduler = DfsScheduler::new(max_iterations, false);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 3,\n \"score\": 205098.37431829562\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub fn check<F>(f: F)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + 'static,\\n\\n{\\n\\n use crate::scheduler::RoundRobinScheduler;\\n\\n\\n\\n let runner = Runner::new(RoundRobinScheduler::new(), Default::default());\\n\\n runner.run(f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 5,\n \"score\": 199701.09882888995\n },\n {\n \"content\": \"// Same as `basic`, but with a static Once. Static synchronization primitives should be reset across\\n\\n// executions, so this test should work exactly the same way.\\n\\nfn basic_static<F>(num_threads: usize, checker: F)\\n\\nwhere\\n\\n F: FnOnce(Box<dyn Fn() + Send + Sync + 'static>),\\n\\n{\\n\\n static O: Once = Once::new();\\n\\n\\n\\n let initializer = Arc::new(std::sync::Mutex::new(HashSet::new()));\\n\\n let initializer_clone = Arc::clone(&initializer);\\n\\n\\n\\n checker(Box::new(move || {\\n\\n let counter = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n assert!(!O.is_completed());\\n\\n\\n\\n let threads = (0..num_threads)\\n\\n .map(|_| {\\n\\n let counter = Arc::clone(&counter);\\n\\n let initializer = Arc::clone(&initializer);\\n\\n thread::spawn(move || {\\n\\n O.call_once(|| {\\n\",\n \"file_path\": \"tests/basic/once.rs\",\n \"rank\": 6,\n \"score\": 187867.63988153174\n },\n {\n \"content\": \"#[derive(Default)]\\n\\nstruct State {\\n\\n value: u64,\\n\\n}\\n\\n\\n\\nimpl State {\\n\\n fn foo(&self) -> bool {\\n\\n self.value > 0\\n\\n }\\n\\n\\n\\n fn bar(&self) -> u64 {\\n\\n self.value\\n\\n }\\n\\n\\n\\n fn update(&mut self) {\\n\\n self.value += 1;\\n\\n }\\n\\n}\\n\\n\\n\\n// #[tokio::main(worker_threads = 2)]\\n\\nasync fn main() {\\n\",\n \"file_path\": \"tests/demo/async_match_deadlock.rs\",\n \"rank\": 7,\n \"score\": 183223.8223299997\n },\n {\n \"content\": \"/// Run the given function according to a given encoded schedule, usually produced as the output of\\n\\n/// a failing Shuttle test case.\\n\\n///\\n\\n/// This function allows deterministic replay of a failing schedule, as long as `f` contains no\\n\\n/// non-determinism other than that introduced by scheduling.\\n\\n///\\n\\n/// This is a convenience function for constructing a [`Runner`] that uses\\n\\n/// [`ReplayScheduler::new_from_encoded`](scheduler::ReplayScheduler::new_from_encoded).\\n\\npub fn replay<F>(f: F, encoded_schedule: &str)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + 'static,\\n\\n{\\n\\n use crate::scheduler::ReplayScheduler;\\n\\n\\n\\n let scheduler = ReplayScheduler::new_from_encoded(encoded_schedule);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(f);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 8,\n \"score\": 182047.56347491243\n },\n {\n \"content\": \"/// Run a future to completion on the current thread.\\n\\npub fn block_on<F: Future>(future: F) -> F::Output {\\n\\n let mut future = Box::pin(future);\\n\\n let waker = ExecutionState::with(|state| state.current_mut().waker());\\n\\n let cx = &mut Context::from_waker(&waker);\\n\\n\\n\\n thread::switch();\\n\\n\\n\\n loop {\\n\\n match future.as_mut().poll(cx) {\\n\\n Poll::Ready(result) => break result,\\n\\n Poll::Pending => {\\n\\n ExecutionState::with(|state| state.current_mut().sleep_unless_woken());\\n\\n }\\n\\n }\\n\\n\\n\\n thread::switch();\\n\\n }\\n\\n}\\n\\n\\n\\n/// Yields execution back to the scheduler.\\n\",\n \"file_path\": \"src/future/mod.rs\",\n \"rank\": 9,\n \"score\": 178798.82577829357\n },\n {\n \"content\": \"/// Run the given function according to a schedule saved in the given file, usually produced as the\\n\\n/// output of a failing Shuttle test case.\\n\\n///\\n\\n/// This function allows deterministic replay of a failing schedule, as long as `f` contains no\\n\\n/// non-determinism other than that introduced by scheduling.\\n\\n///\\n\\n/// This is a convenience function for constructing a [`Runner`] that uses\\n\\n/// [`ReplayScheduler::new_from_file`](scheduler::ReplayScheduler::new_from_file).\\n\\npub fn replay_from_file<F, P>(f: F, path: P)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + 'static,\\n\\n P: AsRef<std::path::Path>,\\n\\n{\\n\\n use crate::scheduler::ReplayScheduler;\\n\\n\\n\\n let scheduler = ReplayScheduler::new_from_file(path).expect(\\\"could not load schedule from file\\\");\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(f);\\n\\n}\\n\\n\\n\\n/// Declare a new thread local storage key of type [`LocalKey`](crate::thread::LocalKey).\\n\\n#[macro_export]\\n\\nmacro_rules! thread_local {\\n\\n // empty (base case for the recursion)\\n\\n () => {};\\n\\n\\n\\n // process multiple declarations with a const initializer\\n\\n ($(#[$attr:meta])* $vis:vis static $name:ident: $t:ty = const { $init:expr }; $($rest:tt)*) => (\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 10,\n \"score\": 175772.37021943793\n },\n {\n \"content\": \"/// Spawn a new thread, returning a JoinHandle for it.\\n\\n///\\n\\n/// The join handle can be used (via the `join` method) to block until the child thread has\\n\\n/// finished.\\n\\npub fn spawn<F, T>(f: F) -> JoinHandle<T>\\n\\nwhere\\n\\n F: FnOnce() -> T,\\n\\n F: Send + 'static,\\n\\n T: Send + 'static,\\n\\n{\\n\\n spawn_named(f, None, None)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/thread.rs\",\n \"rank\": 11,\n \"score\": 175768.94993804678\n },\n {\n \"content\": \"/// A toy benchmark that runs a bunch of threads that just increment a counter\\n\\nfn counter_sync(scheduler: impl Scheduler + 'static) {\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(|| {\\n\\n let counter = Arc::new(AtomicUsize::new(0usize));\\n\\n\\n\\n let tasks: Vec<_> = (0..NUM_TASKS)\\n\\n .map(|_| {\\n\\n let counter = Arc::clone(&counter);\\n\\n thread::spawn(move || {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n })\\n\\n })\\n\\n .collect();\\n\\n\\n\\n for t in tasks {\\n\\n t.join().unwrap();\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/counter.rs\",\n \"rank\": 12,\n \"score\": 167782.976498603\n },\n {\n \"content\": \"/// A toy benchmark that runs a bunch of tasks that just increment a counter\\n\\nfn counter_async(scheduler: impl Scheduler + 'static) {\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(|| {\\n\\n let counter = Arc::new(AtomicUsize::new(0usize));\\n\\n\\n\\n let tasks: Vec<_> = (0..NUM_TASKS)\\n\\n .map(|_| {\\n\\n let counter = Arc::clone(&counter);\\n\\n future::spawn(async move {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n })\\n\\n })\\n\\n .collect();\\n\\n\\n\\n future::block_on(async move {\\n\\n for t in tasks {\\n\\n t.await.unwrap();\\n\\n }\\n\\n });\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/counter.rs\",\n \"rank\": 13,\n \"score\": 167782.976498603\n },\n {\n \"content\": \"pub fn bounded_buffer_benchmark(c: &mut Criterion) {\\n\\n let mut g = c.benchmark_group(\\\"buffer\\\");\\n\\n g.throughput(Throughput::Elements(ITERATIONS as u64));\\n\\n\\n\\n g.bench_function(\\\"pct\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\\n\\n bounded_buffer_check(scheduler);\\n\\n });\\n\\n });\\n\\n\\n\\n g.bench_function(\\\"random\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\\n\\n bounded_buffer_check(scheduler);\\n\\n });\\n\\n });\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, bounded_buffer_benchmark);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"benches/buffer.rs\",\n \"rank\": 14,\n \"score\": 167219.9786317374\n },\n {\n \"content\": \"pub fn basic_lock_benchmark(c: &mut Criterion) {\\n\\n const ITERATIONS: usize = 1000;\\n\\n\\n\\n let mut g = c.benchmark_group(\\\"lock\\\");\\n\\n g.throughput(Throughput::Elements(ITERATIONS as u64));\\n\\n\\n\\n g.bench_function(\\\"pct\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\\n\\n basic_lock_check(scheduler);\\n\\n });\\n\\n });\\n\\n\\n\\n g.bench_function(\\\"random\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\\n\\n basic_lock_check(scheduler);\\n\\n });\\n\\n });\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, basic_lock_benchmark);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"benches/lock.rs\",\n \"rank\": 15,\n \"score\": 167219.9786317374\n },\n {\n \"content\": \"pub fn counter_async_benchmark(c: &mut Criterion) {\\n\\n let mut g = c.benchmark_group(\\\"counter async\\\");\\n\\n g.throughput(Throughput::Elements(ITERATIONS as u64));\\n\\n\\n\\n g.bench_function(\\\"pct\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\\n\\n counter_async(scheduler);\\n\\n });\\n\\n });\\n\\n\\n\\n g.bench_function(\\\"random\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\\n\\n counter_async(scheduler);\\n\\n });\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/counter.rs\",\n \"rank\": 16,\n \"score\": 167219.9786317374\n },\n {\n \"content\": \"pub fn counter_sync_benchmark(c: &mut Criterion) {\\n\\n let mut g = c.benchmark_group(\\\"counter sync\\\");\\n\\n g.throughput(Throughput::Elements(ITERATIONS as u64));\\n\\n\\n\\n g.bench_function(\\\"pct\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = PctScheduler::new_from_seed(0x12345678, 2, ITERATIONS);\\n\\n counter_sync(scheduler);\\n\\n });\\n\\n });\\n\\n\\n\\n g.bench_function(\\\"random\\\", |b| {\\n\\n b.iter(|| {\\n\\n let scheduler = RandomScheduler::new_from_seed(0x12345678, ITERATIONS);\\n\\n counter_sync(scheduler);\\n\\n });\\n\\n });\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, counter_async_benchmark, counter_sync_benchmark);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"benches/counter.rs\",\n \"rank\": 17,\n \"score\": 167219.9786317374\n },\n {\n \"content\": \"/// Spawn a new async task that the executor will run to completion.\\n\\npub fn spawn<T, F>(fut: F) -> JoinHandle<T>\\n\\nwhere\\n\\n F: Future<Output = T> + Send + 'static,\\n\\n T: Send + 'static,\\n\\n{\\n\\n let result = std::sync::Arc::new(std::sync::Mutex::new(None));\\n\\n let stack_size = ExecutionState::with(|s| s.config.stack_size);\\n\\n let task_id = ExecutionState::spawn_future(Wrapper::new(fut, std::sync::Arc::clone(&result)), stack_size, None);\\n\\n\\n\\n thread::switch();\\n\\n\\n\\n JoinHandle { task_id, result }\\n\\n}\\n\\n\\n\\n/// An owned permission to join on an async task (await its termination).\\n\\n#[derive(Debug)]\\n\\npub struct JoinHandle<T> {\\n\\n task_id: TaskId,\\n\\n result: std::sync::Arc<std::sync::Mutex<Option<Result<T, JoinError>>>>,\\n\\n}\\n\",\n \"file_path\": \"src/future/mod.rs\",\n \"rank\": 18,\n \"score\": 164752.05945511174\n },\n {\n \"content\": \"/// A simple benchmark that just runs 3 threads incrementing a lock a bunch of times. This is a\\n\\n/// stress test of our `Execution` logic, since the threads spend basically all their time taking\\n\\n/// and dropping the lock.\\n\\nfn basic_lock_check(scheduler: impl Scheduler + 'static) {\\n\\n const INNER_ITERATIONS: usize = 200;\\n\\n\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(|| {\\n\\n let lock = Arc::new(Mutex::new(0usize));\\n\\n\\n\\n let thds: Vec<_> = (0..3)\\n\\n .map(|_| {\\n\\n let lock = Arc::clone(&lock);\\n\\n thread::spawn(move || {\\n\\n for _ in 0..INNER_ITERATIONS {\\n\\n *lock.lock().unwrap() += 1;\\n\\n }\\n\\n })\\n\\n })\\n\\n .collect();\\n\\n\\n\\n for thd in thds {\\n\\n thd.join().unwrap();\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/lock.rs\",\n \"rank\": 19,\n \"score\": 164639.88805100537\n },\n {\n \"content\": \"/// An implementation of a bounded concurrent queue, minus the actual queue part. Producers wait\\n\\n/// until there's space in the queue, and then put their object in. Consumers wait until the queue\\n\\n/// is non-empty, and then consume something from the queue.\\n\\nfn bounded_buffer_check(scheduler: impl Scheduler + 'static) {\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n\\n\\n runner.run(move || {\\n\\n let lock = Arc::new(Mutex::new(()));\\n\\n let has_space = Arc::new(Condvar::new()); // count < MAX_QUEUE_SIZE\\n\\n let has_elements = Arc::new(Condvar::new()); // count > 0\\n\\n let count = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n let consumers = (0..NUM_CONSUMERS)\\n\\n .map(|_| {\\n\\n let lock = Arc::clone(&lock);\\n\\n let has_space = Arc::clone(&has_space);\\n\\n let has_elements = Arc::clone(&has_elements);\\n\\n let count = Arc::clone(&count);\\n\\n thread::spawn(move || {\\n\\n let events = NUM_EVENTS / NUM_CONSUMERS;\\n\\n for _ in 0..events {\\n\\n let mut guard = lock.lock().unwrap();\\n\\n while count.load(Ordering::SeqCst) == 0 {\\n\",\n \"file_path\": \"benches/buffer.rs\",\n \"rank\": 20,\n \"score\": 164635.8705409352\n },\n {\n \"content\": \"/// Emits a machine instruction to signal the processor that it is running in a busy-wait spin-loop\\n\\n/// (“spin lock”).\\n\\npub fn spin_loop() {\\n\\n // Probably not necessary, but let's emit it just in case\\n\\n std::hint::spin_loop();\\n\\n\\n\\n thread::yield_now();\\n\\n}\\n\",\n \"file_path\": \"src/hint.rs\",\n \"rank\": 21,\n \"score\": 164511.2509518337\n },\n {\n \"content\": \"/// Cooperatively gives up a timeslice to the Shuttle scheduler.\\n\\n///\\n\\n/// Some Shuttle schedulers use this as a hint to deprioritize the current thread in order for other\\n\\n/// threads to make progress (e.g., in a spin loop).\\n\\npub fn yield_now() {\\n\\n let waker = ExecutionState::with(|state| state.current().waker());\\n\\n waker.wake_by_ref();\\n\\n ExecutionState::request_yield();\\n\\n thread::switch();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/thread.rs\",\n \"rank\": 22,\n \"score\": 164466.11647148358\n },\n {\n \"content\": \"// Check that PCT correctly deprioritizes a yielding thread. If it wasn't, there would be some\\n\\n// iteration of this test where the yielding thread has the highest priority and so the others\\n\\n// never make progress.\\n\\nfn yield_spin_loop(use_yield: bool) {\\n\\n const NUM_THREADS: usize = 4;\\n\\n\\n\\n let scheduler = PctScheduler::new(1, 100);\\n\\n let mut config = Config::new();\\n\\n config.max_steps = MaxSteps::FailAfter(50);\\n\\n let runner = Runner::new(scheduler, config);\\n\\n runner.run(move || {\\n\\n let count = Arc::new(AtomicUsize::new(0usize));\\n\\n\\n\\n let _thds = (0..NUM_THREADS)\\n\\n .map(|_| {\\n\\n let count = count.clone();\\n\\n thread::spawn(move || {\\n\\n count.fetch_add(1, Ordering::SeqCst);\\n\\n })\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n while count.load(Ordering::SeqCst) < NUM_THREADS {\\n\\n if use_yield {\\n\\n thread::yield_now();\\n\\n } else {\\n\\n thread::sleep(Duration::from_millis(1));\\n\\n }\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/pct.rs\",\n \"rank\": 23,\n \"score\": 162676.62419345533\n },\n {\n \"content\": \"// Check that PCT correctly deprioritizes a yielding task. If it wasn't, there would be some\\n\\n// iteration of this test where the yielding task has the highest priority and so the others\\n\\n// never make progress.\\n\\nfn yield_spin_loop(use_yield: bool) {\\n\\n const NUM_TASKS: usize = 4;\\n\\n\\n\\n let scheduler = PctScheduler::new(1, 100);\\n\\n let mut config = Config::new();\\n\\n config.max_steps = MaxSteps::FailAfter(50);\\n\\n let runner = Runner::new(scheduler, config);\\n\\n runner.run(move || {\\n\\n let count = Arc::new(AtomicUsize::new(0usize));\\n\\n\\n\\n let _thds = (0..NUM_TASKS)\\n\\n .map(|_| {\\n\\n let count = count.clone();\\n\\n future::spawn(async move {\\n\\n count.fetch_add(1, Ordering::SeqCst);\\n\\n })\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n future::block_on(async move {\\n\",\n \"file_path\": \"tests/future/pct.rs\",\n \"rank\": 24,\n \"score\": 162676.62419345533\n },\n {\n \"content\": \"pub fn me() -> usize {\\n\\n usize::from(thread::current().id())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 25,\n \"score\": 159896.0817271629\n },\n {\n \"content\": \"fn basic<F>(num_threads: usize, checker: F)\\n\\nwhere\\n\\n F: FnOnce(Box<dyn Fn() + Send + Sync + 'static>),\\n\\n{\\n\\n let initializer = Arc::new(std::sync::Mutex::new(HashSet::new()));\\n\\n let initializer_clone = Arc::clone(&initializer);\\n\\n\\n\\n checker(Box::new(move || {\\n\\n let once = Arc::new(Once::new());\\n\\n let counter = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n assert!(!once.is_completed());\\n\\n\\n\\n let threads = (0..num_threads)\\n\\n .map(|_| {\\n\\n let once = Arc::clone(&once);\\n\\n let counter = Arc::clone(&counter);\\n\\n let initializer = Arc::clone(&initializer);\\n\\n thread::spawn(move || {\\n\\n once.call_once(|| {\\n\",\n \"file_path\": \"tests/basic/once.rs\",\n \"rank\": 27,\n \"score\": 157611.60702462928\n },\n {\n \"content\": \"/// The number of context switches that happened so far in the current Shuttle execution.\\n\\n///\\n\\n/// Note that this is the number of *possible* context switches, i.e., including times when the\\n\\n/// scheduler decided to continue with the same task. This means the result can be used as a\\n\\n/// timestamp for atomic actions during an execution.\\n\\n///\\n\\n/// Panics if called outside of a Shuttle execution.\\n\\npub fn context_switches() -> usize {\\n\\n ExecutionState::context_switches()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/current.rs\",\n \"rank\": 30,\n \"score\": 156095.12946452567\n },\n {\n \"content\": \"/// Validate that we see every permutation of message orderings at the receiver of the mpsc channel\\n\\nfn mpsc_stream_permutations<Tx, Rx, F>(num_tasks: usize, creator: F)\\n\\nwhere\\n\\n F: Fn() -> (Tx, Rx) + Send + Sync + 'static,\\n\\n Tx: Sink<usize> + Clone + Unpin + Send + 'static,\\n\\n Tx::Error: std::fmt::Debug,\\n\\n Rx: Stream<Item = usize> + Send + 'static,\\n\\n{\\n\\n let permutations = std::sync::Arc::new(std::sync::Mutex::new(HashSet::new()));\\n\\n let permutations_clone = permutations.clone();\\n\\n\\n\\n check_dfs(\\n\\n move || {\\n\\n let (tx, rx) = creator();\\n\\n\\n\\n for i in 0..num_tasks {\\n\\n let mut tx = tx.clone();\\n\\n future::spawn(async move {\\n\\n tx.send(i).await.expect(\\\"send should succeed\\\");\\n\\n });\\n\\n }\\n\",\n \"file_path\": \"tests/future/channel.rs\",\n \"rank\": 31,\n \"score\": 140084.93028915502\n },\n {\n \"content\": \"fn mpsc_stream_sum<Tx, Rx, F>(num_tasks: usize, creator: F)\\n\\nwhere\\n\\n F: Fn() -> (Tx, Rx),\\n\\n Tx: Sink<usize> + Clone + Unpin + Send + 'static,\\n\\n Tx::Error: std::fmt::Debug,\\n\\n Rx: Stream<Item = usize> + Send + 'static,\\n\\n{\\n\\n let (tx, rx) = creator();\\n\\n\\n\\n for i in 0..num_tasks {\\n\\n let mut tx = tx.clone();\\n\\n future::spawn(async move {\\n\\n tx.send(i).await.expect(\\\"send should succeed\\\");\\n\\n });\\n\\n }\\n\\n\\n\\n // A channel's stream terminates when all senders are dropped. Every task has its own clone of\\n\\n // the sender, so we need to drop the original one.\\n\\n drop(tx);\\n\\n\\n\\n future::block_on(async move {\\n\\n let stream = rx.fold(0, |acc, x| async move { acc + x });\\n\\n let result = stream.await;\\n\\n assert_eq!(result, num_tasks * (num_tasks - 1) / 2);\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/future/channel.rs\",\n \"rank\": 32,\n \"score\": 140084.93028915502\n },\n {\n \"content\": \"// We wrap a task returning a value inside a wrapper task that returns (). The wrapper\\n\\n// contains a mutex-wrapped field that stores the value where it can be passed to a task\\n\\n// waiting on the join handle.\\n\\nstruct Wrapper<T, F> {\\n\\n future: Pin<Box<F>>,\\n\\n result: std::sync::Arc<std::sync::Mutex<Option<Result<T, JoinError>>>>,\\n\\n}\\n\\n\\n\\nimpl<T, F> Wrapper<T, F>\\n\\nwhere\\n\\n F: Future<Output = T> + Send + 'static,\\n\\n{\\n\\n fn new(future: F, result: std::sync::Arc<std::sync::Mutex<Option<Result<T, JoinError>>>>) -> Self {\\n\\n Self {\\n\\n future: Box::pin(future),\\n\\n result,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, F> Future for Wrapper<T, F>\\n\\nwhere\\n\\n F: Future<Output = T> + Send + 'static,\\n\",\n \"file_path\": \"src/future/mod.rs\",\n \"rank\": 33,\n \"score\": 132908.5325031607\n },\n {\n \"content\": \"fn spawn_named<F, T>(f: F, name: Option<String>, stack_size: Option<usize>) -> JoinHandle<T>\\n\\nwhere\\n\\n F: FnOnce() -> T,\\n\\n F: Send + 'static,\\n\\n T: Send + 'static,\\n\\n{\\n\\n // TODO Check if it's worth avoiding the call to `ExecutionState::config()` if we're going\\n\\n // TODO to use an existing continuation from the pool.\\n\\n let stack_size = stack_size.unwrap_or_else(|| ExecutionState::with(|s| s.config.stack_size));\\n\\n let result = std::sync::Arc::new(std::sync::Mutex::new(None));\\n\\n let task_id = {\\n\\n let result = std::sync::Arc::clone(&result);\\n\\n let f = move || thread_fn(f, result);\\n\\n ExecutionState::spawn_thread(f, stack_size, name.clone(), None)\\n\\n };\\n\\n\\n\\n thread::switch();\\n\\n\\n\\n let thread = Thread {\\n\\n id: ThreadId { task_id },\\n\",\n \"file_path\": \"src/thread.rs\",\n \"rank\": 34,\n \"score\": 131180.93124127015\n },\n {\n \"content\": \"fn two_workers<F>(signal_thread: F)\\n\\nwhere\\n\\n F: Fn(Arc<Condvar>),\\n\\n{\\n\\n let lock = Arc::new(Mutex::new(false));\\n\\n let cond = Arc::new(Condvar::new());\\n\\n\\n\\n for _ in 0..2 {\\n\\n let lock = Arc::clone(&lock);\\n\\n let cond = Arc::clone(&cond);\\n\\n thread::spawn(move || {\\n\\n let mut guard = lock.lock().unwrap();\\n\\n while !*guard {\\n\\n guard = cond.wait(guard).unwrap();\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n *lock.lock().unwrap() = true;\\n\\n signal_thread(cond);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/condvar.rs\",\n \"rank\": 35,\n \"score\": 129572.96240833172\n },\n {\n \"content\": \"/// Blocks unless or until the current thread's token is made available.\\n\\npub fn park() {\\n\\n let switch = ExecutionState::with(|s| s.current_mut().park());\\n\\n\\n\\n // We only need to context switch if the park token was unavailable. If it was available, then\\n\\n // any execution reachable by context switching here would also be reachable by having not\\n\\n // chosen this thread at the last context switch, because the park state of a thread is only\\n\\n // observable by the thread itself.\\n\\n if switch {\\n\\n thread::switch();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/thread.rs\",\n \"rank\": 36,\n \"score\": 128380.01295140595\n },\n {\n \"content\": \"#[test]\\n\\nfn yield_spin_loop_fair() {\\n\\n yield_spin_loop(true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/pct.rs\",\n \"rank\": 37,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"exceeded max_steps bound\\\")]\\n\\nfn yield_spin_loop_unfair() {\\n\\n yield_spin_loop(false);\\n\\n}\\n\\n\\n\\n#[test]\\n\\n#[should_panic(expected = \\\"null dereference\\\")]\\n\",\n \"file_path\": \"tests/basic/pct.rs\",\n \"rank\": 38,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\nfn yield_spin_loop_fair() {\\n\\n yield_spin_loop(true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/future/pct.rs\",\n \"rank\": 39,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\nfn yield_loop_three_threads() {\\n\\n let iterations = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n {\\n\\n let counter = Arc::clone(&iterations);\\n\\n let scheduler = DfsScheduler::new(None, false);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(move || {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n\\n\\n thread::spawn(|| {\\n\\n for _ in 0..3 {\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n\\n\\n thread::spawn(|| {\\n\\n for _ in 0..3 {\\n\\n thread::yield_now();\\n\\n }\\n\",\n \"file_path\": \"tests/basic/dfs.rs\",\n \"rank\": 40,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\nfn yield_loop_one_thread() {\\n\\n let iterations = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n {\\n\\n let counter = Arc::clone(&iterations);\\n\\n let scheduler = DfsScheduler::new(None, false);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(move || {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n\\n\\n thread::spawn(|| {\\n\\n for _ in 0..4 {\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n\\n\\n // no-op\\n\\n });\\n\\n }\\n\\n\\n\\n // 6 places we can run thread 0: before thread 1 starts, before each of the 4 yields, or last\\n\\n assert_eq!(iterations.load(Ordering::SeqCst), 6);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/dfs.rs\",\n \"rank\": 41,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"exceeded max_steps bound\\\")]\\n\\nfn yield_spin_loop_unfair() {\\n\\n yield_spin_loop(false);\\n\\n}\\n\",\n \"file_path\": \"tests/future/pct.rs\",\n \"rank\": 42,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\nfn yield_loop_two_threads() {\\n\\n let iterations = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n {\\n\\n let counter = Arc::clone(&iterations);\\n\\n let scheduler = DfsScheduler::new(None, false);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(move || {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n\\n\\n thread::spawn(|| {\\n\\n for _ in 0..4 {\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n\\n\\n for _ in 0..4 {\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n // 2 threads, 5 operations each (thread start + 4 yields)\\n\\n // 2*5 choose 5 = 252\\n\\n assert_eq!(iterations.load(Ordering::SeqCst), 252);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/dfs.rs\",\n \"rank\": 43,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\nfn yield_loop_max_depth() {\\n\\n let iterations = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n {\\n\\n let counter = Arc::clone(&iterations);\\n\\n let scheduler = DfsScheduler::new(None, false);\\n\\n let runner = Runner::new(scheduler, max_steps(20));\\n\\n runner.run(move || {\\n\\n for _ in 0..100 {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n assert_eq!(iterations.load(Ordering::SeqCst), 20);\\n\\n}\\n\",\n \"file_path\": \"tests/basic/dfs.rs\",\n \"rank\": 44,\n \"score\": 127813.61471537196\n },\n {\n \"content\": \"#[test]\\n\\nfn yield_loop_two_threads_bounded() {\\n\\n let iterations = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n {\\n\\n let counter = Arc::clone(&iterations);\\n\\n let scheduler = DfsScheduler::new(Some(100), false);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(move || {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n\\n\\n thread::spawn(|| {\\n\\n for _ in 0..4 {\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n\\n\\n for _ in 0..4 {\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n assert_eq!(iterations.load(Ordering::SeqCst), 100);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/dfs.rs\",\n \"rank\": 45,\n \"score\": 124470.36923469327\n },\n {\n \"content\": \"/// Get a handle to the thread that invokes it\\n\\npub fn current() -> Thread {\\n\\n let (task_id, name) = ExecutionState::with(|s| {\\n\\n let me = s.current();\\n\\n (me.id(), me.name())\\n\\n });\\n\\n\\n\\n Thread {\\n\\n id: ThreadId { task_id },\\n\\n name,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/thread.rs\",\n \"rank\": 46,\n \"score\": 121197.74968958407\n },\n {\n \"content\": \"// Note: `panic_iteration` is 1-indexed because \\\"iterations\\\" is a count\\n\\nfn iterations_test(run_iterations: usize, panic_iteration: usize) {\\n\\n let metrics = MetricsSubscriber::new();\\n\\n let _guard = tracing::subscriber::set_default(metrics.clone());\\n\\n\\n\\n let iterations = Arc::new(AtomicUsize::new(0));\\n\\n\\n\\n let result = catch_unwind(AssertUnwindSafe(|| {\\n\\n check_random(\\n\\n move || {\\n\\n iterations.fetch_add(1, Ordering::SeqCst);\\n\\n if iterations.load(Ordering::SeqCst) >= panic_iteration {\\n\\n panic!(\\\"expected panic\\\");\\n\\n }\\n\\n\\n\\n thread::spawn(move || {\\n\\n thread::yield_now();\\n\\n });\\n\\n },\\n\\n run_iterations,\\n\\n );\\n\\n }));\\n\\n\\n\\n assert_eq!(result.is_err(), panic_iteration <= run_iterations);\\n\\n assert_eq!(\\n\\n metrics.iterations.load(Ordering::SeqCst),\\n\\n run_iterations.min(panic_iteration)\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/metrics.rs\",\n \"rank\": 47,\n \"score\": 120322.91002671179\n },\n {\n \"content\": \"/// Get the current thread's vector clock\\n\\npub fn clock() -> VectorClock {\\n\\n crate::runtime::execution::ExecutionState::with(|state| {\\n\\n let me = state.current();\\n\\n state.get_clock(me.id()).clone()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/current.rs\",\n \"rank\": 48,\n \"score\": 118690.54312345074\n },\n {\n \"content\": \"/// Create a bounded channel\\n\\npub fn sync_channel<T>(bound: usize) -> (SyncSender<T>, Receiver<T>) {\\n\\n let channel = Arc::new(Channel::new(Some(bound)));\\n\\n let sender = SyncSender {\\n\\n inner: Arc::clone(&channel),\\n\\n };\\n\\n let receiver = Receiver {\\n\\n inner: Arc::clone(&channel),\\n\\n };\\n\\n (sender, receiver)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/mpsc.rs\",\n \"rank\": 49,\n \"score\": 116785.33456698933\n },\n {\n \"content\": \"/// Validates that schedule replay works by running a test, expecting it to fail, and then parsing\\n\\n/// and replaying the failing schedule from its output.\\n\\nfn check_replay_roundtrip<F, S>(test_func: F, scheduler: S)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + RefUnwindSafe + 'static,\\n\\n S: Scheduler + UnwindSafe + 'static,\\n\\n{\\n\\n let test_func = Arc::new(test_func);\\n\\n\\n\\n // Run the test that should fail and capture the schedule it prints\\n\\n let result = {\\n\\n let test_func = test_func.clone();\\n\\n panic::catch_unwind(move || {\\n\\n let mut config = Config::new();\\n\\n config.failure_persistence = FailurePersistence::Print;\\n\\n let runner = Runner::new(scheduler, config);\\n\\n runner.run(move || test_func())\\n\\n })\\n\\n .expect_err(\\\"test should panic\\\")\\n\\n };\\n\\n let output = result.downcast::<String>().unwrap();\\n\\n let schedule = parse_schedule::from_stdout(&output).expect(\\\"output should contain a schedule\\\");\\n\",\n \"file_path\": \"tests/mod.rs\",\n \"rank\": 50,\n \"score\": 115938.28720515197\n },\n {\n \"content\": \"/// A `Once` cell can either be `Running`, in which case a `Mutex` mediates racing threads trying to\\n\\n/// invoke `call_once`, or `Complete` once an initializer has completed, in which case the `Mutex`\\n\\n/// is no longer necessary.\\n\\nenum OnceInitState {\\n\\n Running(Rc<Mutex<bool>>),\\n\\n Complete(VectorClock),\\n\\n}\\n\\n\\n\\nimpl std::fmt::Debug for OnceInitState {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {\\n\\n match self {\\n\\n Self::Running(_) => write!(f, \\\"Running\\\"),\\n\\n Self::Complete(_) => write!(f, \\\"Complete\\\"),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Once {\\n\\n /// Creates a new `Once` value.\\n\\n pub const fn new() -> Self {\\n\\n Self { _dummy: 0 }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/sync/once.rs\",\n \"rank\": 51,\n \"score\": 115803.5958937145\n },\n {\n \"content\": \"/// Puts the current thread to sleep for at least the specified amount of time.\\n\\n// Note that Shuttle does not model time, so this behaves just like a context switch.\\n\\npub fn sleep(_dur: Duration) {\\n\\n thread::switch();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/thread.rs\",\n \"rank\": 52,\n \"score\": 114922.65814816294\n },\n {\n \"content\": \"/// Validates that schedule replay works by running a test, expecting it to fail, and then parsing\\n\\n/// and replaying the failing schedule from its output.\\n\\nfn check_replay_roundtrip_file<F, S>(test_func: F, scheduler: S)\\n\\nwhere\\n\\n F: Fn() + Send + Sync + RefUnwindSafe + 'static,\\n\\n S: Scheduler + UnwindSafe + 'static,\\n\\n{\\n\\n let tempdir = tempfile::tempdir().expect(\\\"could not create tempdir\\\");\\n\\n let test_func = Arc::new(test_func);\\n\\n\\n\\n // Run the test that should fail and capture the schedule it prints\\n\\n let result = {\\n\\n let test_func = test_func.clone();\\n\\n let tempdir_path = tempdir.path().to_path_buf();\\n\\n panic::catch_unwind(move || {\\n\\n let mut config = Config::new();\\n\\n config.failure_persistence = FailurePersistence::File(Some(tempdir_path));\\n\\n let runner = Runner::new(scheduler, config);\\n\\n runner.run(move || test_func())\\n\\n })\\n\\n .expect_err(\\\"test should panic\\\")\\n\\n };\\n\",\n \"file_path\": \"tests/mod.rs\",\n \"rank\": 53,\n \"score\": 114357.45825928399\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct BarrierState {\\n\\n bound: usize,\\n\\n leader: Option<TaskId>,\\n\\n waiters: HashSet<TaskId>,\\n\\n clock: VectorClock,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\n/// A barrier enables multiple threads to synchronize the beginning of some computation.\\n\\npub struct Barrier {\\n\\n state: Rc<RefCell<BarrierState>>,\\n\\n}\\n\\n\\n\\nimpl Barrier {\\n\\n /// Creates a new barrier that can block a given number of threads.\\n\\n /// A barrier will block n-1 threads which call `wait()` and then wake up all threads\\n\\n /// at once when the nth thread calls `wait()`.\\n\\n pub fn new(n: usize) -> Self {\\n\\n let state = BarrierState {\\n\\n bound: n,\\n\",\n \"file_path\": \"src/sync/barrier.rs\",\n \"rank\": 54,\n \"score\": 112772.83493415231\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct CondvarState {\\n\\n waiters: HashMap<TaskId, CondvarWaitStatus>,\\n\\n next_epoch: usize,\\n\\n}\\n\\n\\n\\n// For tracking causal dependencies, we record the clock C of the thread that does the notify.\\n\\n// When a thread is unblocked, its clock is updated by C.\\n\",\n \"file_path\": \"src/sync/condvar.rs\",\n \"rank\": 55,\n \"score\": 112772.83493415231\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct MutexState {\\n\\n holder: Option<TaskId>,\\n\\n waiters: TaskSet,\\n\\n clock: VectorClock,\\n\\n}\\n\\n\\n\\nimpl<T> Mutex<T> {\\n\\n /// Creates a new mutex in an unlocked state ready for use.\\n\\n pub fn new(value: T) -> Self {\\n\\n let state = MutexState {\\n\\n holder: None,\\n\\n waiters: TaskSet::new(),\\n\\n clock: VectorClock::new(),\\n\\n };\\n\\n\\n\\n Self {\\n\\n inner: std::sync::Mutex::new(value),\\n\\n state: Rc::new(RefCell::new(state)),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/sync/mutex.rs\",\n \"rank\": 56,\n \"score\": 112772.83493415231\n },\n {\n \"content\": \"/// Blocks unless or until the current thread's token is made available or the specified duration\\n\\n/// has been reached (may wake spuriously).\\n\\n///\\n\\n/// Note that Shuttle does not module time, so this behaves identically to `park`. It cannot\\n\\n/// spuriously wake.\\n\\npub fn park_timeout(_dur: Duration) {\\n\\n park();\\n\\n}\\n\\n\\n\\n/// Thread factory, which can be used in order to configure the properties of a new thread.\\n\\n#[derive(Debug, Default)]\\n\\npub struct Builder {\\n\\n name: Option<String>,\\n\\n stack_size: Option<usize>,\\n\\n}\\n\\n\\n\\nimpl Builder {\\n\\n /// Generates the base configuration for spawning a thread, from which configuration methods can be chained.\\n\\n pub fn new() -> Self {\\n\\n Self {\\n\\n name: None,\\n\\n stack_size: None,\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/thread.rs\",\n \"rank\": 57,\n \"score\": 112578.55161610793\n },\n {\n \"content\": \"/// Retrieve the thread-local random number generator, seeded by the system. Intended to be used in\\n\\n/// method chaining style, e.g. `thread_rng().gen::<i32>()`, or cached locally, e.g.\\n\\n/// `let mut rng = thread_rng();`.\\n\\npub fn thread_rng() -> rngs::ThreadRng {\\n\\n rngs::ThreadRng\\n\\n}\\n\\n\\n\\npub use rand::{Rng, RngCore};\\n\",\n \"file_path\": \"src/rand.rs\",\n \"rank\": 58,\n \"score\": 110397.7609842945\n },\n {\n \"content\": \"#[derive(Debug, Clone)]\\n\\nenum PanicHookState {\\n\\n Disarmed,\\n\\n Armed(Config),\\n\\n Persisted(String),\\n\\n}\\n\\n\\n\\nthread_local! {\\n\\n static PANIC_HOOK: Mutex<PanicHookState> = Mutex::new(PanicHookState::Disarmed);\\n\\n}\\n\\n\\n\\n/// A guard that disarms the panic hook when dropped\\n\\n#[derive(Debug)]\\n\\n#[non_exhaustive]\\n\\npub struct PanicHookGuard;\\n\\n\\n\\nimpl Drop for PanicHookGuard {\\n\\n fn drop(&mut self) {\\n\\n PANIC_HOOK.with(|lock| *lock.lock().unwrap() = PanicHookState::Disarmed);\\n\\n }\\n\\n}\\n\\n\\n\\n/// Set up a panic hook that will try to print the current schedule to stderr so that the failure\\n\\n/// can be replayed. Returns a guard that will disarm the panic hook when dropped.\\n\\n///\\n\\n/// See the module documentation for more details on how this method fits into the failure reporting\\n\\n/// story.\\n\",\n \"file_path\": \"src/runtime/failure.rs\",\n \"rank\": 59,\n \"score\": 110394.43633523706\n },\n {\n \"content\": \"/// An atomic fence, like the standard library's [std::sync::atomic::fence].\\n\\npub fn fence(order: Ordering) {\\n\\n if order == Ordering::Relaxed {\\n\\n panic!(\\\"there is no such thing as a relaxed fence\\\");\\n\\n }\\n\\n\\n\\n maybe_warn_about_ordering(order);\\n\\n\\n\\n // SeqCst fences are no-ops in our execution model\\n\\n}\\n\\n\\n\\n// We can just reuse the standard library's compiler fence, as they have no visible run-time\\n\\n// behavior and so we need neither insert yieldpoints nor warn about non-SeqCst orderings.\\n\\npub use std::sync::atomic::compiler_fence;\\n\\n\\n\\n/// Base type for atomic implementations. This type handles generating the right interleavings for\\n\\n/// all atomics. The interesting stuff is in `load`, `store`, `swap`, and `fetch_update`; all other\\n\\n/// atomic operations are implemented in terms of those four primitives.\\n\",\n \"file_path\": \"src/sync/atomic/mod.rs\",\n \"rank\": 60,\n \"score\": 110382.13137396771\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct RwLockState {\\n\\n holder: RwLockHolder,\\n\\n waiting_readers: TaskSet,\\n\\n waiting_writers: TaskSet,\\n\\n clock: VectorClock,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/rwlock.rs\",\n \"rank\": 61,\n \"score\": 110164.2490269967\n },\n {\n \"content\": \"/// Like [`shuttle::future::yield_now`] but doesn't request a yield from the scheduler\\n\\nstruct UnfairYieldNow {\\n\\n yielded: bool,\\n\\n}\\n\\n\\n\\nimpl Future for UnfairYieldNow {\\n\\n type Output = ();\\n\\n\\n\\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<()> {\\n\\n if self.yielded {\\n\\n return Poll::Ready(());\\n\\n }\\n\\n\\n\\n self.yielded = true;\\n\\n cx.waker().wake_by_ref();\\n\\n Poll::Pending\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/future/pct.rs\",\n \"rank\": 62,\n \"score\": 110105.11889129721\n },\n {\n \"content\": \"// Note: The channels in std::sync::mpsc only support a single Receiver (which cannot be\\n\\n// cloned). The state below admits a more general use case, where multiple Senders\\n\\n// and Receivers can share a single channel.\\n\\nstruct ChannelState<T> {\\n\\n messages: SmallVec<[TimestampedValue<T>; MAX_INLINE_MESSAGES]>, // messages in the channel\\n\\n receiver_clock: Option<SmallVec<[VectorClock; MAX_INLINE_MESSAGES]>>, // receiver vector clocks for bounded case\\n\\n known_senders: usize, // number of senders referencing this channel\\n\\n known_receivers: usize, // number or receivers referencing this channel\\n\\n waiting_senders: SmallVec<[TaskId; DEFAULT_INLINE_TASKS]>, // list of currently blocked senders\\n\\n waiting_receivers: SmallVec<[TaskId; DEFAULT_INLINE_TASKS]>, // list of currently blocked receivers\\n\\n}\\n\\n\\n\\nimpl<T> Debug for ChannelState<T> {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n write!(f, \\\"Channel {{ \\\")?;\\n\\n write!(f, \\\"num_messages: {} \\\", self.messages.len())?;\\n\\n write!(\\n\\n f,\\n\\n \\\"known_senders {} known_receivers {} \\\",\\n\\n self.known_senders, self.known_receivers\\n\\n )?;\\n\\n write!(f, \\\"waiting_senders: [{:?}] \\\", self.waiting_senders)?;\\n\\n write!(f, \\\"waiting_receivers: [{:?}] \\\", self.waiting_receivers)?;\\n\",\n \"file_path\": \"src/sync/mpsc.rs\",\n \"rank\": 63,\n \"score\": 106784.6822691902\n },\n {\n \"content\": \"/// Gets the clock for the thread with the given task ID\\n\\npub fn clock_for(task_id: TaskId) -> VectorClock {\\n\\n ExecutionState::with(|state| state.get_clock(task_id).clone())\\n\\n}\\n\",\n \"file_path\": \"src/current.rs\",\n \"rank\": 64,\n \"score\": 103175.42546128752\n },\n {\n \"content\": \"struct Inner<T: Copy> {\\n\\n buffer: Box<[T]>,\\n\\n buffer_size: usize,\\n\\n put_at: usize,\\n\\n take_at: usize,\\n\\n occupied: usize,\\n\\n}\\n\\n\\n\\nimpl<T: Copy + Default> BoundedBuffer<T> {\\n\\n fn new(buffer_size: usize) -> Self {\\n\\n let inner = Inner {\\n\\n buffer: vec![T::default(); buffer_size].into_boxed_slice(),\\n\\n buffer_size,\\n\\n put_at: 0,\\n\\n take_at: 0,\\n\\n occupied: 0,\\n\\n };\\n\\n\\n\\n BoundedBuffer {\\n\\n inner: Arc::new(Mutex::new(inner)),\\n\",\n \"file_path\": \"tests/demo/bounded_buffer.rs\",\n \"rank\": 65,\n \"score\": 101587.6976276476\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"tried to acquire a RwLock it already holds\\\")]\\n\\nfn async_match_deadlock() {\\n\\n shuttle::check_random(|| tokio::block_on(main()), 1000)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/demo/async_match_deadlock.rs\",\n \"rank\": 66,\n \"score\": 100318.01564079786\n },\n {\n \"content\": \"#[must_use = \\\"the panic hook will be disarmed when the returned guard is dropped\\\"]\\n\\npub fn init_panic_hook(config: Config) -> PanicHookGuard {\\n\\n static INIT: Once = Once::new();\\n\\n INIT.call_once(|| {\\n\\n let original_hook = panic::take_hook();\\n\\n panic::set_hook(Box::new(move |panic_info| {\\n\\n let state = PANIC_HOOK.with(|lock| std::mem::replace(&mut *lock.lock().unwrap(), PanicHookState::Disarmed));\\n\\n // The hook is armed if this is the first time it's fired\\n\\n if let PanicHookState::Armed(config) = state {\\n\\n // We might not be able to get the info we need (e.g., if we panic while borrowing\\n\\n // ExecutionState)\\n\\n if let Some((name, schedule)) = ExecutionState::failure_info() {\\n\\n persist_task_failure(&schedule, name, &config, true);\\n\\n }\\n\\n }\\n\\n original_hook(panic_info);\\n\\n }));\\n\\n });\\n\\n\\n\\n PANIC_HOOK.with(|lock| *lock.lock().unwrap() = PanicHookState::Armed(config));\\n\\n\\n\\n PanicHookGuard\\n\\n}\\n\",\n \"file_path\": \"src/runtime/failure.rs\",\n \"rank\": 67,\n \"score\": 99625.48179473815\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct BoundedBuffer<T: Copy> {\\n\\n inner: Arc<Mutex<Inner<T>>>,\\n\\n cond: Arc<Condvar>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/demo/bounded_buffer.rs\",\n \"rank\": 68,\n \"score\": 99305.78526485854\n },\n {\n \"content\": \"#[test]\\n\\nfn shared_static() {\\n\\n static O: Once = Once::new();\\n\\n\\n\\n let counter = Arc::new(AtomicUsize::new(0));\\n\\n let mut total_executions = 0;\\n\\n\\n\\n // Try a bunch of times to provoke the race\\n\\n for _ in 0..50 {\\n\\n #[allow(clippy::needless_collect)] // https://github.com/rust-lang/rust-clippy/issues/7207\\n\\n let threads = (0..3)\\n\\n .map(|_| {\\n\\n let counter = Arc::clone(&counter);\\n\\n std::thread::spawn(move || {\\n\\n let scheduler = DfsScheduler::new(None, false);\\n\\n let runner = Runner::new(scheduler, Default::default());\\n\\n runner.run(move || {\\n\\n let thds = (0..2)\\n\\n .map(|_| {\\n\\n let counter = Arc::clone(&counter);\\n\\n thread::spawn(move || {\\n\",\n \"file_path\": \"tests/basic/once.rs\",\n \"rank\": 69,\n \"score\": 99157.03620501544\n },\n {\n \"content\": \"#[test]\\n\\n#[should_panic(expected = \\\"tried to acquire a RwLock it already holds\\\")]\\n\\nfn async_match_deadlock_replay() {\\n\\n // Deterministically replay a deadlocking execution so we can, for example, single-step through\\n\\n // it in a debugger.\\n\\n shuttle::replay(|| tokio::block_on(main()), \\\"91010cbbc0daf8c5a5a9b162a08a08\\\")\\n\\n}\\n\",\n \"file_path\": \"tests/demo/async_match_deadlock.rs\",\n \"rank\": 70,\n \"score\": 98392.50950929451\n },\n {\n \"content\": \"/// Create an unbounded channel\\n\\npub fn channel<T>() -> (Sender<T>, Receiver<T>) {\\n\\n let channel = Arc::new(Channel::new(None));\\n\\n let sender = Sender {\\n\\n inner: Arc::clone(&channel),\\n\\n };\\n\\n let receiver = Receiver {\\n\\n inner: Arc::clone(&channel),\\n\\n };\\n\\n (sender, receiver)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sync/mpsc.rs\",\n \"rank\": 71,\n \"score\": 98017.22713579392\n },\n {\n \"content\": \"#[test]\\n\\nfn wake_after_finish() {\\n\\n #[derive(Clone)]\\n\\n struct Future1 {\\n\\n // We don't care about interleaving this lock; just using it to share the waker across tasks\\n\\n waker: std::sync::Arc<std::sync::Mutex<Option<Waker>>>,\\n\\n }\\n\\n\\n\\n impl Future1 {\\n\\n fn new() -> Self {\\n\\n Self {\\n\\n waker: std::sync::Arc::new(std::sync::Mutex::new(None)),\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n impl Future for Future1 {\\n\\n type Output = ();\\n\\n\\n\\n fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\\n\\n *self.waker.lock().unwrap() = Some(cx.waker().clone());\\n\",\n \"file_path\": \"tests/future/waker.rs\",\n \"rank\": 72,\n \"score\": 96515.00689101793\n },\n {\n \"content\": \"#[test]\\n\\nfn basic_static_dfs() {\\n\\n basic_static(2, |f| check_dfs(f, None));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/once.rs\",\n \"rank\": 73,\n \"score\": 96461.80704410918\n },\n {\n \"content\": \"#[test]\\n\\nfn basic_static_pct() {\\n\\n basic_static(10, |f| check_pct(f, 1000, 3));\\n\\n}\\n\\n\\n\\n// Test that multiple Once cells race for initialization independently\\n\",\n \"file_path\": \"tests/basic/once.rs\",\n \"rank\": 74,\n \"score\": 96461.80704410918\n },\n {\n \"content\": \"#[test]\\n\\nfn unlock_yields() {\\n\\n let observed_values = Arc::new(std::sync::Mutex::new(HashSet::new()));\\n\\n let observed_values_clone = Arc::clone(&observed_values);\\n\\n\\n\\n check_dfs(\\n\\n move || {\\n\\n let lock = Arc::new(Mutex::new(0usize));\\n\\n\\n\\n let add_thread = {\\n\\n let lock = Arc::clone(&lock);\\n\\n thread::spawn(move || {\\n\\n *lock.lock().unwrap() += 1;\\n\\n *lock.lock().unwrap() += 1;\\n\\n })\\n\\n };\\n\\n let mul_thread = {\\n\\n let lock = Arc::clone(&lock);\\n\\n thread::spawn(move || {\\n\\n *lock.lock().unwrap() *= 2;\\n\\n })\\n\",\n \"file_path\": \"tests/basic/mutex.rs\",\n \"rank\": 75,\n \"score\": 96387.63555196143\n },\n {\n \"content\": \"#[test]\\n\\nfn async_yield() {\\n\\n check_dfs(\\n\\n || {\\n\\n let v = future::block_on(async {\\n\\n future::yield_now().await;\\n\\n 42u32\\n\\n });\\n\\n assert_eq!(v, 42u32);\\n\\n },\\n\\n None,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/future/basic.rs\",\n \"rank\": 76,\n \"score\": 96387.63555196143\n },\n {\n \"content\": \"// Slightly generalized version of barrier test from std::sync\\n\\nfn barrier_test(n: usize, c: usize) {\\n\\n let barrier = Arc::new(Barrier::new(c));\\n\\n let (tx, rx) = channel();\\n\\n\\n\\n let handles = (0..n - 1)\\n\\n .map(|_| {\\n\\n let barrier = Arc::clone(&barrier);\\n\\n let tx = tx.clone();\\n\\n thread::spawn(move || {\\n\\n tx.send(barrier.wait().is_leader()).unwrap();\\n\\n })\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n // At this point, all spawned threads should be blocked,\\n\\n // so we shouldn't get anything from the port\\n\\n // TODO uncomment this line after we add support for try_recv()\\n\\n // assert!(matches!(rx.try_recv(), Err(TryRecvError::Empty)));\\n\\n\\n\\n let mut leader_found = barrier.wait().is_leader();\\n\",\n \"file_path\": \"tests/basic/barrier.rs\",\n \"rank\": 77,\n \"score\": 95663.33579704384\n },\n {\n \"content\": \"#[test]\\n\\nfn max_steps_none() {\\n\\n let counter = Arc::new(AtomicUsize::new(0));\\n\\n let counter_clone = Arc::clone(&counter);\\n\\n\\n\\n let mut config = Config::new();\\n\\n config.max_steps = MaxSteps::None;\\n\\n\\n\\n let scheduler = RandomScheduler::new(10);\\n\\n let runner = Runner::new(scheduler, config);\\n\\n runner.run(move || {\\n\\n for _ in 0..100 {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n\\n\\n assert_eq!(counter_clone.load(Ordering::SeqCst), 100 * 10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/execution.rs\",\n \"rank\": 78,\n \"score\": 93991.23635285269\n },\n {\n \"content\": \"#[test]\\n\\nfn replay_persist_none() {\\n\\n let result = panic::catch_unwind(|| {\\n\\n let scheduler = PctScheduler::new(2, 100);\\n\\n let mut config = Config::new();\\n\\n config.failure_persistence = FailurePersistence::None;\\n\\n let runner = Runner::new(scheduler, config);\\n\\n runner.run(concurrent_increment_buggy);\\n\\n })\\n\\n .expect_err(\\\"test should panic\\\");\\n\\n let output = result.downcast::<String>().unwrap();\\n\\n assert!(output.contains(\\\"counter is wrong\\\"));\\n\\n // All our current failure persistence modes print the word \\\"schedule\\\", so check that's missing\\n\\n assert!(!output.contains(\\\"schedule\\\"));\\n\\n}\\n\",\n \"file_path\": \"tests/basic/replay.rs\",\n \"rank\": 79,\n \"score\": 93991.23635285269\n },\n {\n \"content\": \"#[test]\\n\\nfn iterations_without_running() {\\n\\n let metrics = MetricsSubscriber::new();\\n\\n\\n\\n {\\n\\n let _guard = tracing::subscriber::set_default(metrics.clone());\\n\\n let scheduler = RandomScheduler::new(10);\\n\\n let _runner = Runner::new(scheduler, Default::default());\\n\\n }\\n\\n\\n\\n assert_eq!(metrics.iterations.load(Ordering::SeqCst), 0);\\n\\n}\\n\",\n \"file_path\": \"tests/basic/metrics.rs\",\n \"rank\": 80,\n \"score\": 93991.23635285269\n },\n {\n \"content\": \"#[test]\\n\\nfn async_thread_yield() {\\n\\n // This tests if thread::yield_now can be called from within an async block\\n\\n check_dfs(\\n\\n || {\\n\\n future::spawn(async move {\\n\\n thread::yield_now();\\n\\n });\\n\\n future::spawn(async move {});\\n\\n },\\n\\n None,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/future/basic.rs\",\n \"rank\": 81,\n \"score\": 93876.12599249977\n },\n {\n \"content\": \"#[test]\\n\\nfn thread_yield_point() {\\n\\n let success = Arc::new(AtomicU8::new(0));\\n\\n let success_clone = Arc::clone(&success);\\n\\n\\n\\n // We want to see executions that include both threads running first, otherwise we have\\n\\n // messed up the yieldpoints around spawn.\\n\\n check_random(\\n\\n move || {\\n\\n let flag = Arc::new(AtomicBool::new(false));\\n\\n let flag_clone = Arc::clone(&flag);\\n\\n\\n\\n thread::spawn(move || {\\n\\n flag_clone.store(true, Ordering::SeqCst);\\n\\n });\\n\\n\\n\\n if flag.load(Ordering::SeqCst) {\\n\\n success.fetch_or(0x1, Ordering::SeqCst);\\n\\n } else {\\n\\n success.fetch_or(0x2, Ordering::SeqCst);\\n\\n }\\n\\n },\\n\\n 100,\\n\\n );\\n\\n\\n\\n assert_eq!(success_clone.load(Ordering::SeqCst), 0x3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/thread.rs\",\n \"rank\": 82,\n \"score\": 93876.12599249977\n },\n {\n \"content\": \"#[test]\\n\\nfn max_steps_continue() {\\n\\n let counter = Arc::new(AtomicUsize::new(0));\\n\\n let counter_clone = Arc::clone(&counter);\\n\\n\\n\\n let mut config = Config::new();\\n\\n config.max_steps = MaxSteps::ContinueAfter(50);\\n\\n\\n\\n let scheduler = RandomScheduler::new(10);\\n\\n let runner = Runner::new(scheduler, config);\\n\\n runner.run(move || {\\n\\n for _ in 0..100 {\\n\\n counter.fetch_add(1, Ordering::SeqCst);\\n\\n thread::yield_now();\\n\\n }\\n\\n });\\n\\n\\n\\n assert_eq!(counter_clone.load(Ordering::SeqCst), 50 * 10);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/execution.rs\",\n \"rank\": 83,\n \"score\": 93868.920613374\n },\n {\n \"content\": \"#[test]\\n\\nfn wake_self_on_join_handle() {\\n\\n check_dfs(\\n\\n || {\\n\\n let yielder = future::spawn(async move {\\n\\n future::yield_now().await;\\n\\n });\\n\\n\\n\\n struct Timeout<F: Future> {\\n\\n inner: Pin<Box<F>>,\\n\\n counter: u8,\\n\\n }\\n\\n\\n\\n impl<F> Future for Timeout<F>\\n\\n where\\n\\n F: Future,\\n\\n {\\n\\n type Output = ();\\n\\n\\n\\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {\\n\\n if self.counter == 0 {\\n\",\n \"file_path\": \"tests/future/basic.rs\",\n \"rank\": 84,\n \"score\": 91647.08190364644\n },\n {\n \"content\": \"#[test]\\n\\nfn mpsc_send_from_outside_runtime() {\\n\\n check_dfs(\\n\\n || {\\n\\n let (tx1, rx1) = channel::<()>();\\n\\n let (tx2, rx2) = channel::<i32>();\\n\\n let t1 = thread::spawn(move || {\\n\\n tx1.send(()).unwrap();\\n\\n for _ in 0..7 {\\n\\n assert_eq!(rx2.recv().unwrap(), 1);\\n\\n }\\n\\n });\\n\\n rx1.recv().unwrap();\\n\\n let t2 = thread::spawn(move || {\\n\\n for _ in 0..7 {\\n\\n tx2.send(1).unwrap();\\n\\n }\\n\\n });\\n\\n t1.join().expect(\\\"thread panicked\\\");\\n\\n t2.join().expect(\\\"thread panicked\\\");\\n\\n },\\n\\n None,\\n\\n );\\n\\n}\\n\\n\\n\\n// From libstd test suite\\n\",\n \"file_path\": \"tests/basic/mpsc.rs\",\n \"rank\": 85,\n \"score\": 91639.36264003182\n },\n {\n \"content\": \"#[test]\\n\\nfn drop_shuttle_yield_future() {\\n\\n let orderings = Arc::new(AtomicUsize::new(0));\\n\\n let async_accesses = Arc::new(AtomicUsize::new(0));\\n\\n let post_yield_accesses = Arc::new(AtomicUsize::new(0));\\n\\n let orderings_clone = orderings.clone();\\n\\n let async_accesses_clone = async_accesses.clone();\\n\\n let post_yield_accesses_clone = post_yield_accesses.clone();\\n\\n\\n\\n check_dfs(\\n\\n move || {\\n\\n orderings.fetch_add(1, Ordering::SeqCst);\\n\\n let async_accesses = async_accesses.clone();\\n\\n let post_yield_accesses = post_yield_accesses.clone();\\n\\n future::spawn(async move {\\n\\n async_accesses.fetch_add(1, Ordering::SeqCst);\\n\\n future::yield_now().await;\\n\\n post_yield_accesses.fetch_add(1, Ordering::SeqCst);\\n\\n });\\n\\n },\\n\\n None,\\n\",\n \"file_path\": \"tests/future/basic.rs\",\n \"rank\": 86,\n \"score\": 91527.99638755377\n },\n {\n \"content\": \"// Barrier\\n\\nfn clock_barrier(n: usize) {\\n\\n // This test checks that threads waiting on a barrier inherit the clocks from all the other participants in the barrier.\\n\\n //\\n\\n // The test creates a barrier with bound n and creates n threads (including the main thread).\\n\\n // Each thread initially checks that its clock is nonzero only for the main thread, and then waits on the barrier.\\n\\n // When it exits the barrier, each thread checks that its current clock is nonzero for all threads.\\n\\n // For sanity checking, we also spawn a dummy thread and check that its clock entry is always 0.\\n\\n let barrier = Arc::new(Barrier::new(n));\\n\\n\\n\\n // Create dummy thread (should have id 1)\\n\\n thread::spawn(|| {\\n\\n assert_eq!(me(), 1usize);\\n\\n });\\n\\n\\n\\n let _thds = (0..n - 1)\\n\\n .map(|_| {\\n\\n let barrier = Arc::clone(&barrier);\\n\\n thread::spawn(move || {\\n\\n check_clock(|i, c| (c > 0) == (i == 0));\\n\\n barrier.wait();\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 87,\n \"score\": 89997.88623622448\n },\n {\n \"content\": \"#[test]\\n\\nfn max_steps_early_exit_scheduler() {\\n\\n use shuttle::scheduler::{Schedule, Scheduler, TaskId};\\n\\n\\n\\n #[derive(Debug)]\\n\\n struct EarlyExitScheduler {\\n\\n iterations: usize,\\n\\n max_iterations: usize,\\n\\n steps: usize,\\n\\n max_steps: usize,\\n\\n }\\n\\n\\n\\n impl EarlyExitScheduler {\\n\\n fn new(max_iterations: usize, max_steps: usize) -> Self {\\n\\n Self {\\n\\n iterations: 0,\\n\\n max_iterations,\\n\\n steps: 0,\\n\\n max_steps,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"tests/basic/execution.rs\",\n \"rank\": 88,\n \"score\": 89443.1406689577\n },\n {\n \"content\": \"// RWLocks\\n\\nfn clock_rwlock(num_writers: usize, num_readers: usize) {\\n\\n // This test checks that when a thread acquires a RwLock, it inherits the clocks of writers that\\n\\n // accessed the lock before it. It's the same as `clock_mutex`, except that readers don't update\\n\\n // the set S, and aren't required to appear in the clock for future lock holders.\\n\\n //\\n\\n // TODO this test is pretty weak. Testing readers is hard because they race with each other; for\\n\\n // example, a reader might see the clock update from another reader before that reader has a\\n\\n // chance to update the set S. Causality is also pretty fuzzy for readers (see the TODOs in the\\n\\n // RwLock implementation). So we don't test very much about them here.\\n\\n let set = Arc::new(std::sync::Mutex::new(HashSet::from([0])));\\n\\n let lock = Arc::new(RwLock::new(()));\\n\\n\\n\\n // Create dummy thread (should have id 1)\\n\\n thread::spawn(|| {\\n\\n assert_eq!(me(), 1usize);\\n\\n });\\n\\n\\n\\n // Spawn the writers\\n\\n let _thds = (0..num_writers)\\n\\n .map(|_| {\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 89,\n \"score\": 88153.0555282512\n },\n {\n \"content\": \"// Based on Fig 1(b) from the PCT paper. We model NULL pointer dereference with an Option unwrap.\\n\\nfn figure1b(num_threads: usize) {\\n\\n assert!(num_threads >= 2);\\n\\n\\n\\n let x1 = Arc::new(Mutex::new(Some(1)));\\n\\n let x2 = Arc::clone(&x1);\\n\\n\\n\\n // Optionally, spawn a bunch of threads that add scheduling choice points, each taking 5 steps\\n\\n for _ in 0..num_threads - 2 {\\n\\n thread::spawn(|| {\\n\\n for _ in 0..5 {\\n\\n thread::sleep(Duration::from_millis(1));\\n\\n }\\n\\n });\\n\\n }\\n\\n\\n\\n // Main worker threads take 10 steps each\\n\\n thread::spawn(move || {\\n\\n for _ in 0..5 {\\n\\n thread::sleep(Duration::from_millis(1));\\n\\n }\\n\",\n \"file_path\": \"tests/basic/pct.rs\",\n \"rank\": 90,\n \"score\": 87651.87593781405\n },\n {\n \"content\": \"fn clock_once(num_threads: usize) {\\n\\n let once = Arc::new(Once::new());\\n\\n let init = Arc::new(std::sync::atomic::AtomicUsize::new(0));\\n\\n\\n\\n let threads = (0..num_threads)\\n\\n .map(|_| {\\n\\n let once = Arc::clone(&once);\\n\\n let init = Arc::clone(&init);\\n\\n thread::spawn(move || {\\n\\n check_clock(|i, c| (c > 0) == (i == 0));\\n\\n once.call_once(|| init.store(me(), std::sync::atomic::Ordering::SeqCst));\\n\\n let who_inited = init.load(std::sync::atomic::Ordering::SeqCst);\\n\\n // should have inhaled the clock of the thread that inited the Once, but might also\\n\\n // have inhaled the clocks of threads that we were racing with for initialization\\n\\n check_clock(|i, c| !(i == who_inited || i == 0 || i == me()) || c > 0);\\n\\n })\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n for thd in threads {\\n\\n thd.join().unwrap();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 91,\n \"score\": 87651.87593781405\n },\n {\n \"content\": \"fn reader(buffer: BoundedBuffer<usize>, iterations: usize) {\\n\\n for _ in 0..iterations {\\n\\n let _ = buffer.take();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/demo/bounded_buffer.rs\",\n \"rank\": 92,\n \"score\": 87095.66055913802\n },\n {\n \"content\": \"fn writer(buffer: BoundedBuffer<usize>, iterations: usize) {\\n\\n for i in 0..iterations {\\n\\n buffer.put(i);\\n\\n }\\n\\n}\\n\\n\\n\\n/// We’ll now write a small test driver program, which Coyote can use to find the bug.\\n\\n///\\n\\n/// The first test you write might look like this. Here we setup two tasks. First is a reader\\n\\n/// calling Take and the other is a Writer calling Put.\\n\\n///\\n\\n/// Clearly, we have to Put the same number of items as we Take.\\n\\n///\\n\\n/// Otherwise, there will be a trivial deadlock waiting for more items.\\n\\n///\\n\\n/// We have matched both in this test with 10 iterations of each Put and Take. We find no deadlock\\n\\n/// when we run the test above, despite Coyote systematically exploring different possible\\n\\n/// interleavings between the Put and Take calls.\\n\",\n \"file_path\": \"tests/demo/bounded_buffer.rs\",\n \"rank\": 93,\n \"score\": 87095.66055913802\n },\n {\n \"content\": \"fn max_steps(n: usize) -> Config {\\n\\n let mut config = Config::new();\\n\\n config.max_steps = MaxSteps::ContinueAfter(n);\\n\\n config\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/dfs.rs\",\n \"rank\": 94,\n \"score\": 86207.57777658677\n },\n {\n \"content\": \"fn clock_mutex(num_threads: usize) {\\n\\n // This test checks that when a thread acquires a lock, it inherits the vector clocks of\\n\\n // threads that accessed the lock before it.\\n\\n //\\n\\n // Test: create a mutex-protected set, initialized with 0 (the id of the main thread)\\n\\n // and spawn N threads where each thread does the following:\\n\\n // (1) check that its own initial vector clock only has nonzero for the creator (thread 0)\\n\\n // this checks that when a thread is created, it only inherits the clock of the spawner\\n\\n // (2) lock the set and add its own thread id to it; let the resulting set be S\\n\\n // (3) read its own clock again, call this C\\n\\n // (4) check that the only nonzero entries in C are for the threads in S\\n\\n // For sanity checking, we also spawn an initial dummy thread (with id 1) and ensure that its\\n\\n // clock is always 0.\\n\\n let mut set = HashSet::new();\\n\\n set.insert(0);\\n\\n let set = Arc::new(Mutex::new(set));\\n\\n\\n\\n // Create dummy thread (should have id 1)\\n\\n thread::spawn(|| {\\n\\n assert_eq!(me(), 1usize);\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 95,\n \"score\": 85453.6718727536\n },\n {\n \"content\": \"// Threads\\n\\nfn clock_threads(num_threads: usize) {\\n\\n // Use an AtomicBool to create a synchronization point so a thread's clock is incremented.\\n\\n let flag = Arc::new(AtomicBool::new(false));\\n\\n let handles = (1..num_threads + 1)\\n\\n .map(|k| {\\n\\n let flag = Arc::clone(&flag);\\n\\n thread::spawn(move || {\\n\\n assert_eq!(me(), k);\\n\\n check_clock(|i, c| (c > 0) == (i == 0));\\n\\n assert!(!flag.load(Ordering::SeqCst));\\n\\n check_clock(|i, c| (c > 0) == (i == 0) || (i == k));\\n\\n k\\n\\n })\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n // As each thread joins, we get knowledge of its vector clock.\\n\\n for handle in handles {\\n\\n let k = handle.join().unwrap();\\n\\n check_clock(move |i, c| (c > 0) == (i <= k));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 96,\n \"score\": 85453.6718727536\n },\n {\n \"content\": \"fn mpsc_senders_with_blocking_inner(num_senders: usize, channel_size: usize) {\\n\\n assert!(num_senders >= channel_size);\\n\\n let num_receives = num_senders - channel_size;\\n\\n let (tx, rx) = sync_channel::<usize>(channel_size);\\n\\n let senders = (0..num_senders)\\n\\n .map(move |i| {\\n\\n let tx = tx.clone();\\n\\n thread::spawn(move || {\\n\\n tx.send(i).unwrap();\\n\\n })\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n\\n\\n // Receive enough messages to ensure no sender will block\\n\\n for _ in 0..num_receives {\\n\\n rx.recv().unwrap();\\n\\n }\\n\\n for sender in senders {\\n\\n sender.join().unwrap();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/mpsc.rs\",\n \"rank\": 97,\n \"score\": 84918.07556080859\n },\n {\n \"content\": \"fn clock_condvar_notify_one(num_notifiers: usize, num_waiters: usize) {\\n\\n let lock = Arc::new(Mutex::new(0usize));\\n\\n let cond = Arc::new(Condvar::new());\\n\\n\\n\\n for _ in 0..num_notifiers {\\n\\n let lock = Arc::clone(&lock);\\n\\n let cond = Arc::clone(&cond);\\n\\n thread::spawn(move || {\\n\\n assert!(me() <= num_notifiers);\\n\\n *lock.lock().unwrap() = me();\\n\\n cond.notify_one();\\n\\n });\\n\\n }\\n\\n\\n\\n for _ in 0..num_waiters {\\n\\n let lock = Arc::clone(&lock);\\n\\n let cond = Arc::clone(&cond);\\n\\n thread::spawn(move || {\\n\\n let mut guard = lock.lock().unwrap();\\n\\n while *guard == 0 {\\n\\n check_clock(|i, c| !(i >= 1 && i <= num_notifiers) || (c == 0)); // no notifier has gone yet\\n\\n guard = cond.wait(guard).unwrap();\\n\\n }\\n\\n // Note that since all the threads touch the lock, any of them may have preceded this thread.\\n\\n // But we know for sure that the thread that unblocked us should causally precede us.\\n\\n check_clock(|i, c| (i != *guard) || (c > 0));\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 98,\n \"score\": 84918.07556080859\n },\n {\n \"content\": \"fn clock_condvar_notify_all(num_waiters: usize) {\\n\\n let lock = Arc::new(Mutex::new(0usize));\\n\\n let cond = Arc::new(Condvar::new());\\n\\n\\n\\n {\\n\\n let lock = Arc::clone(&lock);\\n\\n let cond = Arc::clone(&cond);\\n\\n thread::spawn(move || {\\n\\n assert_eq!(me(), 1);\\n\\n *lock.lock().unwrap() = me();\\n\\n cond.notify_all();\\n\\n });\\n\\n }\\n\\n\\n\\n for _ in 0..num_waiters {\\n\\n let lock = Arc::clone(&lock);\\n\\n let cond = Arc::clone(&cond);\\n\\n thread::spawn(move || {\\n\\n let mut guard = lock.lock().unwrap();\\n\\n while *guard == 0 {\\n\\n check_clock(|i, c| (i != 1) || (c == 0)); // notifier hasn't been scheduled\\n\\n guard = cond.wait(guard).unwrap();\\n\\n }\\n\\n // Note that since all the threads touch the lock, any of them may have preceded this thread.\\n\\n // But we know for sure that the thread that unblocked us should causally precede us.\\n\\n check_clock(|i, c| (i != *guard) || (c > 0));\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/basic/clocks.rs\",\n \"rank\": 99,\n \"score\": 83389.73222433131\n }\n]","isConversational":false}}},{"rowIdx":2983,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"fyrox-sound/src/dsp/filters.rs"},"repo_name":{"kind":"string","value":"Libertus-Lab/Fyrox"},"commit":{"kind":"string","value":"c925304f42744659fd3a6be5c4a1a8609556033a"},"file_code":{"kind":"string","value":"\n\nuse crate::dsp::DelayLine;\nuse fyrox_core::{\n inspect::{Inspect, PropertyInfo},\n visitor::{Visit, VisitResult, Visitor},\n};\n\n#[derive(Debug, Clone, Visit)]\npub struct OnePole {\n a0: f32,\n b1: f32,\n last: f32,\n}\n\nimpl Default for OnePole {\n fn default() -> Self {\n Self {\n a0: 1.0,\n b1: 0.0,\n last: 0.0,\n }\n }\n}\n\nfn get_b1(fc: f32) -> f32 {\n (-2.0 * std::f32::consts::PI * fc.min(1.0).max(0.0)).exp()\n}\n\nimpl OnePole {\n \n pub fn new(fc: f32) -> Self {\n let b1 = get_b1(fc);\n Self {\n b1,\n a0: 1.0 - b1,\n last: 0.0,\n }\n }\n\n \n pub fn set_fc(&mut self, fc: f32) {\n self.b1 = get_b1(fc);\n self.a0 = 1.0 - self.b1;\n }\n\n \n pub fn set_pole(&mut self, pole: f32) {\n self.b1 = pole.min(1.0).max(0.0);\n self.a0 = 1.0 - self.b1;\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let result = sample * self.a0 + self.last * self.b1;\n self.last = result;\n result\n }\n}\n\n#[derive(Debug, Clone, Visit)]\npub struct LpfComb {\n low_pass: OnePole,\n delay_line: DelayLine,\n feedback: f32,\n}\n\nimpl Default for LpfComb {\n fn default() -> Self {\n Self {\n low_pass: Default::default(),\n delay_line: Default::default(),\n feedback: 0.0,\n }\n }\n}\n\nimpl LpfComb {\n \n pub fn new(len: usize, fc: f32, feedback: f32) -> Self {\n Self {\n low_pass: OnePole::new(fc),\n delay_line: DelayLine::new(len),\n feedback,\n }\n }\n\n \n pub fn set_feedback(&mut self, feedback: f32) {\n self.feedback = feedback;\n }\n\n \n pub fn feedback(&self) -> f32 {\n self.feedback\n }\n\n \n pub fn set_fc(&mut self, fc: f32) {\n self.low_pass.set_fc(fc)\n }\n\n \n pub fn len(&self) -> usize {\n self.delay_line.len()\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let result = sample + self.feedback * self.low_pass.feed(self.delay_line.last());\n self.delay_line.feed(result);\n result\n }\n}\n\n#[derive(Debug, Clone, Visit)]\npub struct AllPass {\n delay_line: DelayLine,\n gain: f32,\n}\n\nimpl Default for AllPass {\n fn default() -> Self {\n Self {\n delay_line: Default::default(),\n gain: 1.0,\n }\n }\n}\n\nimpl AllPass {\n \n pub fn new(len: usize, gain: f32) -> Self {\n Self {\n delay_line: DelayLine::new(len),\n gain,\n }\n }\n\n \n pub fn set_gain(&mut self, gain: f32) {\n self.gain = gain;\n }\n\n \n pub fn len(&self) -> usize {\n self.delay_line.len()\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let delay_line_output = self.delay_line.last();\n let am_arm = -self.gain * delay_line_output;\n let sum_left = sample + am_arm;\n let b0_arm = sum_left * self.gain;\n self.delay_line.feed(sum_left);\n delay_line_output + b0_arm\n }\n}\n\npub enum BiquadKind {\n \n LowPass,\n\n \n HighPass,\n\n \n BandPass,\n\n \n AllPass,\n\n \n \n LowShelf,\n\n \n \n HighShelf,\n}\n\n#[derive(Clone, Debug, Inspect, Visit)]\npub struct Biquad {\n \n pub b0: f32,\n \n pub b1: f32,\n \n pub b2: f32,\n \n pub a1: f32,\n \n pub a2: f32,\n #[inspect(skip)]\n prev1: f32,\n #[inspect(skip)]\n prev2: f32,\n}\n\nimpl Biquad {\n \n \n \n \n \n pub fn new(kind: BiquadKind, fc: f32, gain: f32, quality: f32) -> Self {\n let mut filter = Self::default();\n\n filter.tune(kind, fc, gain, quality);\n\n filter\n }\n\n \n pub fn from_coefficients(b0: f32, b1: f32, b2: f32, a1: f32, a2: f32) -> Self {\n Self {\n b0,\n b1,\n b2,\n a1,\n a2,\n prev1: 0.0,\n prev2: 0.0,\n }\n }\n\n \n \n \n \n \n \n pub fn tune(&mut self, kind: BiquadKind, fc: f32, gain: f32, quality: f32) {\n let w0 = 2.0 * std::f32::consts::PI * fc;\n let w0_cos = w0.cos();\n let w0_sin = w0.sin();\n let alpha = w0_sin / (2.0 * quality);\n\n let (b0, b1, b2, a0, a1, a2) = match kind {\n BiquadKind::LowPass => {\n let b0 = (1.0 - w0_cos) / 2.0;\n let b1 = 1.0 - w0_cos;\n let b2 = b0;\n let a0 = 1.0 + alpha;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::HighPass => {\n let b0 = (1.0 + w0_cos) / 2.0;\n let b1 = -(1.0 + w0_cos);\n let b2 = b0;\n let a0 = 1.0 + alpha;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::BandPass => {\n let b0 = w0_sin / 2.0;\n let b1 = 0.0;\n let b2 = -b0;\n let a0 = 1.0 + alpha;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::AllPass => {\n let b0 = 1.0 - alpha;\n let b1 = -2.0 * w0_cos;\n let b2 = 1.0 + alpha;\n let a0 = b2;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::LowShelf => {\n let sq = 2.0 * gain.sqrt() * alpha;\n let b0 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos + sq);\n let b1 = 2.0 * gain * ((gain - 1.0) - (gain + 1.0) * w0_cos);\n let b2 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos - sq);\n let a0 = (gain + 1.0) + (gain - 1.0) * w0_cos + sq;\n let a1 = -2.0 * ((gain - 1.0) + (gain + 1.0) * w0_cos);\n let a2 = (gain + 1.0) + (gain - 1.0) * w0_cos - sq;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::HighShelf => {\n let sq = 2.0 * gain.sqrt() * alpha;\n let b0 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos + sq);\n let b1 = -2.0 * gain * ((gain - 1.0) + (gain + 1.0) * w0_cos);\n let b2 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos - sq);\n let a0 = (gain + 1.0) - (gain - 1.0) * w0_cos + sq;\n let a1 = 2.0 * ((gain - 1.0) - (gain + 1.0) * w0_cos);\n let a2 = (gain + 1.0) - (gain - 1.0) * w0_cos - sq;\n (b0, b1, b2, a0, a1, a2)\n }\n };\n\n self.b0 = b0 / a0;\n self.b1 = b1 / a0;\n self.b2 = b2 / a0;\n self.a1 = a1 / a0;\n self.a2 = a2 / a0;\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let result = sample * self.b0 + self.prev1;\n self.prev1 = sample * self.b1 - result * self.a1 + self.prev2;\n self.prev2 = sample * self.b2 - result * self.a2;\n result\n }\n}\n\nimpl Default for Biquad {\n fn default() -> Self {\n Self {\n b0: 1.0,\n b1: 0.0,\n b2: 0.0,\n a1: 0.0,\n a2: 0.0,\n prev1: 0.0,\n prev2: 0.0,\n }\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::dsp::DelayLine;\nuse fyrox_core::{\n inspect::{Inspect, PropertyInfo},\n visitor::{Visit, VisitResult, Visitor},\n};\n\n#[derive(Debug, Clone, Visit)]\npub struct OnePole {\n a0: f32,\n b1: f32,\n last: f32,\n}\n\nimpl Default for OnePole {\n fn default() -> Self {\n Self {\n a0: 1.0,\n b1: 0.0,\n last: 0.0,\n }\n }\n}\n\nfn get_b1(fc: f32) -> f32 {\n (-2.0 * std::f32::consts::PI * fc.min(1.0).max(0.0)).exp()\n}\n\nimpl OnePole {\n \n pub fn new(fc: f32) -> Self {\n let b1 = get_b1(fc);\n Self {\n b1,\n a0: 1.0 - b1,\n last: 0.0,\n }\n }\n\n \n pub fn set_fc(&mut self, fc: f32) {\n self.b1 = get_b1(fc);\n self.a0 = 1.0 - self.b1;\n }\n\n \n pub fn set_pole(&mut self, pole: f32) {\n self.b1 = pole.min(1.0).max(0.0);\n self.a0 = 1.0 - self.b1;\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let result = sample * self.a0 + self.last * self.b1;\n self.last = result;\n result\n }\n}\n\n#[derive(Debug, Clone, Visit)]\npub struct LpfComb {\n low_pass: OnePole,\n delay_line: DelayLine,\n feedback: f32,\n}\n\nimpl Default for LpfComb {\n fn default() -> Self {\n Self {\n low_pass: Default::default(),\n delay_line: Default::default(),\n feedback: 0.0,\n }\n }\n}\n\nimpl LpfComb {\n \n pub fn new(len: usize, fc: f32, feedback: f32) -> Self {\n Self {\n low_pass: OnePole::new(fc),\n delay_line: DelayLine::new(len),\n feedback,\n }\n }\n\n \n pub fn set_feedback(&mut self, feedback: f32) {\n self.feedback = feedback;\n }\n\n \n pub fn feedback(&self) -> f32 {\n self.feedback\n }\n\n \n pub fn set_fc(&mut self, fc: f32) {\n self.low_pass.set_fc(fc)\n }\n\n \n pub fn len(&self) -> usize {\n self.delay_line.len()\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let result = sample + self.feedback * self.low_pass.feed(self.delay_line.last());\n self.delay_line.feed(result);\n result\n }\n}\n\n#[derive(Debug, Clone, Visit)]\npub struct AllPass {\n delay_line: DelayLine,\n gain: f32,\n}\n\nimpl Default for AllPass {\n fn default() -> Self {\n Self {\n delay_line: Default::default(),\n gain: 1.0,\n }\n }\n}\n\nimpl AllPass {\n \n pub fn new(len: usize, gain: f32) -> Self {\n Self {\n delay_line: DelayLine::new(len),\n gain,\n }\n }\n\n \n pub fn set_gain(&mut self, gain: f32) {\n self.gain = gain;\n }\n\n \n pub fn len(&self) -> usize {\n self.delay_line.len()\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let delay_line_output = self.delay_line.last();\n let am_arm = -self.gain * delay_line_output;\n let sum_left = sample + am_arm;\n let b0_arm = sum_left * self.gain;\n self.delay_line.feed(sum_left);\n delay_line_output + b0_arm\n }\n}\n\npub enum BiquadKind {\n \n LowPass,\n\n \n HighPass,\n\n \n BandPass,\n\n \n AllPass,\n\n \n \n LowShelf,\n\n \n \n HighShelf,\n}\n\n#[derive(Clone, Debug, Inspect, Visit)]\npub struct Biquad {\n \n pub b0: f32,\n \n pub b1: f32,\n \n pub b2: f32,\n \n pub a1: f32,\n \n pub a2: f32,\n #[inspect(skip)]\n prev1: f32,\n #[inspect(skip)]\n prev2: f32,\n}\n\nimpl Biquad {\n \n \n \n \n \n pub fn new(kind: BiquadKind, fc: f32, gain: f32, quality: f32) -> Self {\n let mut filter = Self::default();\n\n filter.tune(kind, fc, gain, quality);\n\n filter\n }\n\n \n pub fn from_coefficients(b0: f32, b1: f32, b2: f32, a1: f32, a2: f32) -> Self {\n Self {\n b0,\n b1,\n b2,\n a1,\n a2,\n prev1: 0.0,\n prev2: 0.0,\n }\n }\n\n \n \n \n \n \n \n pub fn tune(&mut self, kind: BiquadKind, fc: f32, gain: f32, quality: f32) {\n let w0 = 2.0 * std::f32::consts::PI * fc;\n let w0_cos = w0.cos();\n let w0_sin = w0.sin();\n let alpha = w0_sin / (2.0 * quality);\n\n let (b0, b1, b2, a0, a1, a2) = match kind {\n BiquadKind::LowPass => {\n let b0 = (1.0 - w0_cos) / 2.0;\n let b1 = 1.0 - w0_cos;\n let b2 = b0;\n let a0 = 1.0 + alpha;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::HighPass => {\n let b0 = (1.0 + w0_cos) / 2.0;\n let b1 = -(1.0 + w0_cos);\n let b2 = b0;\n let a0 = 1.0 + alpha;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::BandPass => {\n let b0 = w0_sin / 2.0;\n let b1 = 0.0;\n let b2 = -b0;\n let a0 = 1.0 + alpha;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::AllPass => {\n let b0 = 1.0 - alpha;\n let b1 = -2.0 * w0_cos;\n let b2 = 1.0 + alpha;\n let a0 = b2;\n let a1 = -2.0 * w0_cos;\n let a2 = 1.0 - alpha;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::LowShelf => {\n let sq = 2.0 * gain.sqrt() * alpha;\n let b0 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos + sq);\n let b1 = 2.0 * gain * ((gain - 1.0) - (gain + 1.0) * w0_cos);\n let b2 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos - sq);\n let a0 = (gain + 1.0) + (gain - 1.0) * w0_cos + sq;\n let a1 = -2.0 * ((gain - 1.0) + (gain + 1.0) * w0_cos);\n let a2 = (gain + 1.0) + (gain - 1.0) * w0_cos - sq;\n (b0, b1, b2, a0, a1, a2)\n }\n BiquadKind::HighShelf => {\n let sq = 2.0 * gain.sqrt() * alpha;\n let b0 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos + sq);\n let b1 = -2.0 * gain * ((gain - 1.0) + (gain + 1.0) * w0_cos);\n let b2 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos - sq);\n let a0 = (gain + 1.0) - (gain - 1.0) * w0_cos + sq;\n let a1 = 2.0 * ((gain - 1.0) - (gain + 1.0) * w0_cos);\n let a2 = (gain + 1.0) - (gain - 1.0) * w0_cos - sq;\n (b0, b1, b2, a0, a1, a2)\n }\n };\n\n self.b0 = b0 / a0;\n self.b1 = b1 / a0;\n self.b2 = b2 / a0;\n self.a1 = a1 / a0;\n self.a2 = a2 / a0;\n }\n\n \n pub fn feed(&mut self, sample: f32) -> f32 {\n let result = sample * self.b0 + self.prev1;\n self.prev1 = sample * self.b1 - result * self.a1 + self.prev2;\n self.prev2 = sample * self.b2 - result * self.a2;\n result\n }\n}\n\nimpl Default for Biquad {\n "},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"fn default() -> Self {\n Self {\n b0: 1.0,\n b1: 0.0,\n b2: 0.0,\n a1: 0.0,\n a2: 0.0,\n prev1: 0.0,\n prev2: 0.0,\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"fn write_node(name: &str, node: &mut Node, visitor: &mut Visitor) -> VisitResult {\n\n let mut region = visitor.enter_region(name)?;\n\n\n\n let mut id = node.id();\n\n id.visit(\"TypeUuid\", &mut region)?;\n\n\n\n node.visit(\"NodeData\", &mut region)?;\n\n\n\n Ok(())\n\n}\n\n\n\nimpl Visit for NodeContainer {\n\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\n\n let mut region = visitor.enter_region(name)?;\n\n\n\n let mut is_some = if self.is_some() { 1u8 } else { 0u8 };\n\n is_some.visit(\"IsSome\", &mut region)?;\n\n\n\n if is_some != 0 {\n\n if region.is_reading() {\n","file_path":"src/scene/node/container.rs","rank":1,"score":293204.8694213878},{"content":"#[inline]\n\npub fn wrapf(mut n: f32, mut min_limit: f32, mut max_limit: f32) -> f32 {\n\n if n >= min_limit && n <= max_limit {\n\n return n;\n\n }\n\n\n\n if max_limit == 0.0 && min_limit == 0.0 {\n\n return 0.0;\n\n }\n\n\n\n max_limit -= min_limit;\n\n\n\n let offset = min_limit;\n\n min_limit = 0.0;\n\n n -= offset;\n\n\n\n let num_of_max = (n / max_limit).abs().floor();\n\n\n\n if n >= max_limit {\n\n n -= num_of_max * max_limit;\n\n } else if n < min_limit {\n\n n += (num_of_max + 1.0) * max_limit;\n\n }\n\n\n\n n + offset\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":2,"score":283810.21516115195},{"content":"fn read_node(name: &str, visitor: &mut Visitor) -> Result<Node, VisitError> {\n\n let node = {\n\n // Handle legacy nodes.\n\n let mut kind_id = 0u8;\n\n if kind_id.visit(\"KindId\", visitor).is_ok() {\n\n let mut node = match kind_id {\n\n 0 => Node::new(Pivot::default()),\n\n 1 => {\n\n let mut region = visitor.enter_region(name)?;\n\n\n\n let mut light_id = 0u32;\n\n light_id.visit(\"KindId\", &mut region)?;\n\n\n\n let mut light_node = match light_id {\n\n 0 => Node::new(SpotLight::default()),\n\n 1 => Node::new(PointLight::default()),\n\n 2 => Node::new(DirectionalLight::default()),\n\n _ => {\n\n return Err(VisitError::User(format!(\n\n \"Invalid legacy light kind {}\",\n","file_path":"src/scene/node/container.rs","rank":3,"score":277158.78388240293},{"content":"/// Creates new window using specified window function.\n\n/// <https://en.wikipedia.org/wiki/Window_function>\n\npub fn make_window<W: Fn(usize, usize) -> f32>(sample_count: usize, func: W) -> Vec<f32> {\n\n (0..sample_count).map(|i| func(i, sample_count)).collect()\n\n}\n","file_path":"fyrox-sound/src/dsp/mod.rs","rank":4,"score":268456.1095306186},{"content":"/// Calculates single coefficient of Hamming window.\n\n/// <https://en.wikipedia.org/wiki/Window_function#Hamming_window>\n\npub fn hamming_window(i: usize, sample_count: usize) -> f32 {\n\n 0.54 - 0.46 * (2.0 * std::f32::consts::PI * i as f32 / (sample_count - 1) as f32).cos()\n\n}\n\n\n","file_path":"fyrox-sound/src/dsp/mod.rs","rank":5,"score":263448.77280674374},{"content":"/// Calculates single coefficient of Hann window.\n\n/// <https://en.wikipedia.org/wiki/Hann_function>\n\npub fn hann_window(i: usize, sample_count: usize) -> f32 {\n\n 0.5 - 0.5 * (2.0 * std::f32::consts::PI * i as f32 / (sample_count - 1) as f32).cos()\n\n}\n\n\n","file_path":"fyrox-sound/src/dsp/mod.rs","rank":6,"score":263448.77280674374},{"content":"/// Saves given `data` and overwrites `data_default` with the saved data.\n\n///\n\n/// Test the equality after running this method!\n\npub fn save_load<T: Visit>(test_name: &str, data: &mut T, data_default: &mut T) {\n\n // Locate output path\n\n let (bin, txt) = {\n\n let manifest_dir = env::var(\"CARGO_MANIFEST_DIR\").unwrap();\n\n let root = PathBuf::from(manifest_dir).join(\"test_output\");\n\n let _ = std::fs::create_dir(&root);\n\n (\n\n root.join(format!(\"{}.bin\", test_name)),\n\n root.join(format!(\"{}.txt\", test_name)),\n\n )\n\n };\n\n\n\n // Save `data`\n\n {\n\n let mut visitor = Visitor::new();\n\n data.visit(\"Data\", &mut visitor).unwrap();\n\n\n\n visitor.save_binary(&bin).unwrap();\n\n let mut file = File::create(&txt).unwrap();\n\n file.write_all(visitor.save_text().as_bytes()).unwrap();\n","file_path":"fyrox-core-derive/tests/it/visit.rs","rank":7,"score":256202.01616297854},{"content":"///\n\n/// Triangulates specified polygon.\n\n///\n\npub fn triangulate(vertices: &[Vector3<f32>], out_triangles: &mut Vec<[usize; 3]>) {\n\n out_triangles.clear();\n\n if vertices.len() == 3 {\n\n // Triangulating a triangle?\n\n out_triangles.push([0, 1, 2]);\n\n } else if vertices.len() == 4 {\n\n // Special case for quadrilaterals (much faster than generic)\n\n let mut start_vertex = 0;\n\n for i in 0..4 {\n\n let v = vertices[i];\n\n let v0 = vertices[(i + 3) % 4];\n\n if let Some(left) = (v0 - v).try_normalize(f32::EPSILON) {\n\n let v1 = vertices[(i + 2) % 4];\n\n if let Some(diag) = (v1 - v).try_normalize(f32::EPSILON) {\n\n let v2 = vertices[(i + 1) % 4];\n\n if let Some(right) = (v2 - v).try_normalize(f32::EPSILON) {\n\n // Check for concave vertex\n\n let angle = left.dot(&diag).acos() + right.dot(&diag).acos();\n\n if angle > std::f32::consts::PI {\n\n start_vertex = i;\n","file_path":"fyrox-core/src/math/triangulator.rs","rank":8,"score":250683.66110117562},{"content":"/// A trait for user-defined actions for behavior tree.\n\npub trait Behavior<'a>: Visit + Default + PartialEq + Debug {\n\n /// A context in which the behavior will be performed.\n\n type Context;\n\n\n\n /// A function that will be called each frame depending on\n\n /// the current execution path of the behavior tree it belongs\n\n /// to.\n\n fn tick(&mut self, context: &mut Self::Context) -> Status;\n\n}\n\n\n\n/// Root node of the tree.\n\n#[derive(Debug, PartialEq, Visit)]\n\npub struct RootNode<B> {\n\n child: Handle<BehaviorNode<B>>,\n\n}\n\n\n\nimpl<B> Default for RootNode<B> {\n\n fn default() -> Self {\n\n Self {\n\n child: Default::default(),\n","file_path":"src/utils/behavior/mod.rs","rank":9,"score":247866.86060288685},{"content":"pub trait BaseScript: Visit + Inspect + Send + Debug + 'static {\n\n fn clone_box(&self) -> Box<dyn ScriptTrait>;\n\n}\n\n\n\nimpl<T> BaseScript for T\n\nwhere\n\n T: Clone + ScriptTrait,\n\n{\n\n fn clone_box(&self) -> Box<dyn ScriptTrait> {\n\n Box::new(self.clone())\n\n }\n\n}\n\n\n\npub struct ScriptContext<'a, 'b, 'c> {\n\n pub dt: f32,\n\n pub plugin: &'a mut dyn Plugin,\n\n pub node: &'b mut Node,\n\n pub handle: Handle<Node>,\n\n pub scene: &'c mut Scene,\n\n pub resource_manager: &'a ResourceManager,\n\n}\n\n\n","file_path":"src/script/mod.rs","rank":10,"score":247816.1315096252},{"content":"pub trait InspectableEnum: Debug + Inspect + 'static {}\n\n\n\nimpl<T: Debug + Inspect + 'static> InspectableEnum for T {}\n\n\n\n#[derive(Debug, Clone, PartialEq)]\n\npub enum EnumPropertyEditorMessage {\n\n Variant(usize),\n\n PropertyChanged(PropertyChanged),\n\n}\n\n\n\nimpl EnumPropertyEditorMessage {\n\n define_constructor!(EnumPropertyEditorMessage:Variant => fn variant(usize), layout: false);\n\n define_constructor!(EnumPropertyEditorMessage:PropertyChanged => fn property_changed(PropertyChanged), layout: false);\n\n}\n\n\n\npub struct EnumPropertyEditor<T: InspectableEnum> {\n\n widget: Widget,\n\n variant_selector: Handle<UiNode>,\n\n inspector: Handle<UiNode>,\n\n definition: EnumPropertyEditorDefinition<T>,\n","file_path":"fyrox-ui/src/inspector/editors/enumeration.rs","rank":11,"score":245756.0458513006},{"content":"/// A trait for resource data.\n\npub trait ResourceData: 'static + Default + Debug + Visit + Send {\n\n /// Returns path of resource data.\n\n fn path(&self) -> Cow<Path>;\n\n\n\n /// Sets new path to resource data.\n\n fn set_path(&mut self, path: PathBuf);\n\n}\n\n\n","file_path":"fyrox-resource/src/lib.rs","rank":12,"score":242951.79310065665},{"content":"pub fn fix_shadows_distance(mut quality: QualitySettings) -> QualitySettings {\n\n // Scale distance because game world has different scale.\n\n quality.spot_shadows_distance *= 2.0;\n\n quality.point_shadows_distance *= 2.0;\n\n quality\n\n}\n","file_path":"examples/shared/mod.rs","rank":13,"score":240081.4173366913},{"content":"/// Creates `Inspect` trait impl and field prop keys\n\npub fn create_inspect_impl<'f>(\n\n ty_args: &args::TypeArgs,\n\n field_args: impl Iterator<Item = &'f args::FieldArgs>,\n\n impl_body: TokenStream2,\n\n) -> TokenStream2 {\n\n let prop_keys_impl = prop_keys::prop_keys_impl(ty_args);\n\n let trait_impl = self::inspect_trait_impl(ty_args, field_args, impl_body);\n\n\n\n quote! {\n\n #prop_keys_impl\n\n #trait_impl\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils.rs","rank":14,"score":234920.55887460534},{"content":"pub fn create_impl(\n\n ty_args: &args::TypeArgs,\n\n field_args: impl Iterator<Item = args::FieldArgs>,\n\n impl_body: TokenStream2,\n\n) -> TokenStream2 {\n\n let ty_ident = &ty_args.ident;\n\n let generics = self::create_impl_generics(&ty_args.generics, field_args);\n\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\n\n\n\n quote! {\n\n impl #impl_generics Visit for #ty_ident #ty_generics #where_clause {\n\n fn visit(\n\n &mut self,\n\n name: &str,\n\n visitor: &mut Visitor,\n\n ) -> VisitResult {\n\n #impl_body\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/src/visit/utils.rs","rank":15,"score":231837.27319743088},{"content":"pub fn make_scene_file_filter() -> Filter {\n\n Filter::new(|p: &Path| {\n\n if let Some(ext) = p.extension() {\n\n ext.to_string_lossy().as_ref() == \"rgs\"\n\n } else {\n\n p.is_dir()\n\n }\n\n })\n\n}\n\n\n","file_path":"editor/src/lib.rs","rank":16,"score":230971.45420339616},{"content":"#[inline]\n\npub fn get_polygon_normal(polygon: &[Vector3<f32>]) -> Result<Vector3<f32>, &'static str> {\n\n let mut normal = Vector3::default();\n\n\n\n for (i, current) in polygon.iter().enumerate() {\n\n let next = polygon[(i + 1) % polygon.len()];\n\n normal.x += (current.y - next.y) * (current.z + next.z);\n\n normal.y += (current.z - next.z) * (current.x + next.x);\n\n normal.z += (current.x - next.x) * (current.y + next.y);\n\n }\n\n\n\n normal\n\n .try_normalize(f32::EPSILON)\n\n .ok_or(\"Unable to get normal of degenerated polygon!\")\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":17,"score":229370.0246755001},{"content":"fn get_last_sample(buffer: &StreamingBuffer) -> (f32, f32) {\n\n let len = buffer.samples.len();\n\n if len == 0 {\n\n return (0.0, 0.0);\n\n }\n\n if buffer.channel_count == 2 {\n\n (buffer.samples[len - 2], buffer.samples[len - 1])\n\n } else {\n\n (buffer.samples[len - 1], buffer.samples[len - 1])\n\n }\n\n}\n\n\n\nimpl Drop for SoundSource {\n\n fn drop(&mut self) {\n\n if let Some(buffer) = self.buffer.as_ref() {\n\n let mut buffer = buffer.data_ref();\n\n if let SoundBufferState::Streaming(ref mut streaming) = *buffer {\n\n streaming.use_count = streaming.use_count.saturating_sub(1);\n\n }\n\n }\n","file_path":"fyrox-sound/src/source.rs","rank":18,"score":227664.0683318552},{"content":"#[inline(always)]\n\npub fn lerpf(a: f32, b: f32, t: f32) -> f32 {\n\n a + (b - a) * t\n\n}\n\n\n\n// https://en.wikipedia.org/wiki/Cubic_Hermite_spline\n","file_path":"fyrox-core/src/math/mod.rs","rank":19,"score":224444.15203210956},{"content":"#[inline]\n\npub fn ieee_remainder(x: f32, y: f32) -> f32 {\n\n x - (x / y).round() * y\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":20,"score":223211.73295744258},{"content":"/// impl `Visit` for `struct`\n\nfn impl_visit_struct(\n\n ty_args: &args::TypeArgs,\n\n field_args: &ast::Fields<args::FieldArgs>,\n\n) -> TokenStream2 {\n\n let visit_fn_body = if field_args.style == ast::Style::Unit {\n\n quote! { Ok(()) }\n\n } else {\n\n // `field.visit(..);` parts\n\n let field_visits =\n\n utils::create_field_visits(None, field_args.fields.iter(), field_args.style);\n\n\n\n quote! {\n\n let mut region = visitor.enter_region(name)?;\n\n #(self.#field_visits)*\n\n Ok(())\n\n }\n\n };\n\n\n\n utils::create_impl(ty_args, field_args.iter().cloned(), visit_fn_body)\n\n}\n\n\n","file_path":"fyrox-core-derive/src/visit.rs","rank":21,"score":222142.21923848335},{"content":"pub fn make_default_anchor(ctx: &mut BuildContext, row: usize, column: usize) -> Handle<UiNode> {\n\n let default_anchor_size = 30.0;\n\n BorderBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(default_anchor_size)\n\n .with_height(default_anchor_size)\n\n .with_visibility(false)\n\n .on_row(row)\n\n .on_column(column)\n\n .with_draw_on_top(true)\n\n .with_background(Brush::Solid(DEFAULT_ANCHOR_COLOR)),\n\n )\n\n .build(ctx)\n\n}\n\n\n\nimpl TileBuilder {\n\n pub fn new(widget_builder: WidgetBuilder) -> Self {\n\n Self {\n\n widget_builder,\n\n content: TileContent::Empty,\n","file_path":"fyrox-ui/src/dock.rs","rank":22,"score":220647.68326847837},{"content":"#[inline]\n\npub fn round_to_step(x: f32, step: f32) -> f32 {\n\n x - ieee_remainder(x, step)\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":23,"score":219713.83351770398},{"content":"#[inline]\n\npub fn wrap_angle(angle: f32) -> f32 {\n\n let two_pi = 2.0 * std::f32::consts::PI;\n\n\n\n if angle > 0.0 {\n\n angle % two_pi\n\n } else {\n\n (angle + two_pi) % two_pi\n\n }\n\n}\n\n\n\n/// There are two versions of remainder, the standard `%` operator which does `x - (x/y).trunc()*y` and IEEE remainder which does `x - (x/y).round()*y`.\n","file_path":"fyrox-core/src/math/mod.rs","rank":24,"score":219410.84163344247},{"content":"#[inline]\n\npub fn barycentric_is_inside(bary: (f32, f32, f32)) -> bool {\n\n (bary.0 >= 0.0) && (bary.1 >= 0.0) && (bary.0 + bary.1 < 1.0)\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":25,"score":216400.82258233652},{"content":"pub fn enum_prop_ident(\n\n variant_args: &args::VariantArgs,\n\n nth: usize,\n\n field: &args::FieldArgs,\n\n) -> Ident {\n\n let variant_ident = &variant_args.ident;\n\n let field_ident = self::field_ident(&variant_args.fields, nth, field);\n\n\n\n let ident = format!(\"{}_{}\", variant_ident, field_ident).to_case(Case::UpperSnake);\n\n syn::parse_str(&ident).unwrap()\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils/prop_keys.rs","rank":26,"score":216069.58946626307},{"content":"pub fn create_ui(ui: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\n\n let debug_text;\n\n let progress_bar;\n\n let progress_text;\n\n let root = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(screen_size.x)\n\n .with_height(screen_size.y)\n\n .with_child({\n\n debug_text = TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0))\n\n .with_wrap(WrapMode::Word)\n\n .build(ui);\n\n debug_text\n\n })\n\n .with_child({\n\n progress_bar =\n\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ui);\n\n progress_bar\n\n })\n\n .with_child({\n","file_path":"examples/shared/mod.rs","rank":27,"score":215598.0793855338},{"content":"pub fn gen_inspect_fn_body(\n\n field_prefix: FieldPrefix,\n\n field_args: &ast::Fields<args::FieldArgs>,\n\n) -> TokenStream2 {\n\n // `inspect` function body, consisting of a sequence of quotes\n\n let mut quotes = Vec::new();\n\n\n\n let props = field_args\n\n .fields\n\n .iter()\n\n // enumerate first, and then filter!\n\n .enumerate()\n\n .filter(|(_i, f)| !f.skip)\n\n .map(|(i, field)| self::quote_field_prop(&field_prefix, i, field, field_args.style));\n\n\n\n quotes.push(quote! {\n\n let mut props = Vec::new();\n\n #(props.push(#props);)*\n\n });\n\n\n\n // concatenate the quotes\n\n quote! {\n\n #(#quotes)*\n\n props\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils.rs","rank":28,"score":211950.22943305332},{"content":"#[inline]\n\npub fn solve_quadratic(a: f32, b: f32, c: f32) -> Option<[f32; 2]> {\n\n let discriminant = b * b - 4.0 * a * c;\n\n if discriminant < 0.0 {\n\n // No real roots\n\n None\n\n } else {\n\n // Dont care if quadratic equation has only one root (discriminant == 0), this is edge-case\n\n // which requires additional branching instructions which is not good for branch-predictor in CPU.\n\n let _2a = 2.0 * a;\n\n let discr_root = discriminant.sqrt();\n\n let r1 = (-b + discr_root) / _2a;\n\n let r2 = (-b - discr_root) / _2a;\n\n Some([r1, r2])\n\n }\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":29,"score":211255.65715689037},{"content":"// impl `#[derive(Visit)]` for `struct` or `enum`\n\npub fn impl_visit(ast: DeriveInput) -> TokenStream2 {\n\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\n\n match &ty_args.data {\n\n ast::Data::Struct(ref field_args) => self::impl_visit_struct(&ty_args, field_args),\n\n ast::Data::Enum(ref variants) => self::impl_visit_enum(&ty_args, variants),\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/src/visit.rs","rank":30,"score":210793.8850863793},{"content":"pub fn impl_inspect(ast: DeriveInput) -> TokenStream2 {\n\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\n\n match &ty_args.data {\n\n ast::Data::Struct(ref field_args) => self::impl_inspect_struct(&ty_args, field_args),\n\n ast::Data::Enum(ref variant_args) => self::impl_inspect_enum(&ty_args, variant_args),\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect.rs","rank":31,"score":210755.6453713467},{"content":"pub trait Visit {\n\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult;\n\n}\n\n\n\nimpl Default for Visitor {\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n\nimpl Visitor {\n\n const MAGIC: &'static str = \"RG3D\";\n\n\n\n pub fn new() -> Self {\n\n let mut nodes = Pool::new();\n\n let root = nodes.spawn(Node::new(\"__ROOT__\", Handle::NONE));\n\n Self {\n\n nodes,\n\n rc_map: FxHashMap::default(),\n\n arc_map: FxHashMap::default(),\n","file_path":"fyrox-core/src/visitor.rs","rank":32,"score":209185.7760263767},{"content":"pub fn read_ascii<R>(reader: &mut R) -> Result<FbxDocument, FbxError>\n\nwhere\n\n R: Read + Seek,\n\n{\n\n let mut nodes: Pool<FbxNode> = Pool::new();\n\n let root_handle = nodes.spawn(FbxNode {\n\n name: String::from(\"__ROOT__\"),\n\n children: Vec::new(),\n\n parent: Handle::NONE,\n\n attributes: Vec::new(),\n\n });\n\n let mut parent_handle: Handle<FbxNode> = root_handle;\n\n let mut node_handle: Handle<FbxNode> = Handle::NONE;\n\n let mut buffer: Vec<u8> = Vec::new();\n\n let mut name: Vec<u8> = Vec::new();\n\n let mut value: Vec<u8> = Vec::new();\n\n\n\n let buf_len = reader.seek(SeekFrom::End(0))?;\n\n reader.seek(SeekFrom::Start(0))?;\n\n\n","file_path":"src/resource/fbx/document/ascii.rs","rank":33,"score":208348.75453148456},{"content":"pub fn read_binary<R>(file: &mut R) -> Result<FbxDocument, FbxError>\n\nwhere\n\n R: Read + Seek,\n\n{\n\n let total_length = file.seek(SeekFrom::End(0))?;\n\n file.seek(SeekFrom::Start(0))?;\n\n\n\n // Ignore all stuff until version.\n\n let mut temp = [0; 23];\n\n file.read_exact(&mut temp)?;\n\n\n\n // Verify version.\n\n let version = file.read_u32::<LittleEndian>()? as i32;\n\n\n\n // Anything else should be supported.\n\n if version < 7100 {\n\n return Err(FbxError::UnsupportedVersion(version));\n\n }\n\n\n\n let mut nodes = Pool::new();\n","file_path":"src/resource/fbx/document/binary.rs","rank":34,"score":208348.75453148456},{"content":"#[allow(clippy::cast_ref_to_mut)] // See SAFETY block below\n\npub fn serialize_script(script: &Script) -> Result<Vec<u8>, VisitError> {\n\n let mut visitor = Visitor::new();\n\n\n\n let mut script_type_uuid = script.id();\n\n script_type_uuid.visit(\"TypeUuid\", &mut visitor)?;\n\n\n\n // SAFETY: It is guaranteed that visitor will **not** modify internal state of the object\n\n // if it is in \"write\" mode (serialization mode).\n\n let script = unsafe { &mut *(script as *const _ as *mut Script) };\n\n script.visit(\"ScriptData\", &mut visitor)?;\n\n\n\n visitor.save_binary_to_vec()\n\n}\n\n\n","file_path":"src/scene/base.rs","rank":35,"score":207777.4256531689},{"content":"#[inline]\n\npub fn cubicf(p0: f32, p1: f32, t: f32, m0: f32, m1: f32) -> f32 {\n\n let t2 = t * t;\n\n let t3 = t2 * t;\n\n let scale = (p1 - p0).abs();\n\n\n\n (2.0 * t3 - 3.0 * t2 + 1.0) * p0\n\n + (t3 - 2.0 * t2 + t) * m0 * scale\n\n + (-2.0 * t3 + 3.0 * t2) * p1\n\n + (t3 - t2) * m1 * scale\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":36,"score":207649.49374144006},{"content":"fn filtered_out(filter: &mut Option<Filter>, path: &Path) -> bool {\n\n match filter.as_mut() {\n\n Some(filter) => !filter.0.borrow_mut().deref_mut().lock().unwrap()(path),\n\n None => false,\n\n }\n\n}\n\n\n","file_path":"fyrox-ui/src/file_browser.rs","rank":37,"score":206466.23598739374},{"content":"#[inline]\n\npub fn spherical_to_cartesian(azimuth: f32, elevation: f32, radius: f32) -> Vector3<f32> {\n\n let x = radius * elevation.sin() * azimuth.sin();\n\n let y = radius * elevation.cos();\n\n let z = -radius * elevation.sin() * azimuth.cos();\n\n Vector3::new(x, y, z)\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":38,"score":205744.58054224588},{"content":"#[inline]\n\npub fn inf_sup_cubicf(p0: f32, p1: f32, m0: f32, m1: f32) -> (f32, f32) {\n\n // Find two `t`s where derivative of cubicf is zero - these will be\n\n // extreme points of the spline. Then get the values at those `t`s\n\n let d = -(9.0 * p0 * p0 + 6.0 * p0 * (-3.0 * p1 + m1 + m0) + 9.0 * p1 * p1\n\n - 6.0 * p1 * (m1 + m0)\n\n + m1 * m1\n\n + m1 * m0\n\n + m0 * m0)\n\n .sqrt();\n\n let k = 3.0 * (2.0 * p0 - 2.0 * p1 + m1 + m0);\n\n let v = 3.0 * p0 - 3.0 * p1 + m1 + 2.0 * m0;\n\n let t0 = (-d + v) / k;\n\n let t1 = (d + v) / k;\n\n (cubicf(p0, p1, t0, m0, m1), cubicf(p0, p1, t1, m0, m1))\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":39,"score":205566.97124877863},{"content":"#[inline]\n\npub fn cubicf_derivative(p0: f32, p1: f32, t: f32, m0: f32, m1: f32) -> f32 {\n\n let t2 = t * t;\n\n let scale = (p1 - p0).abs();\n\n\n\n (6.0 * t2 - 6.0 * t) * p0\n\n + (3.0 * t2 - 4.0 * t + 1.0) * m0 * scale\n\n + (6.0 * t - 6.0 * t2) * p1\n\n + (3.0 * t2 - 2.0 * t) * m1 * scale\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":40,"score":205281.4038514658},{"content":"#[inline]\n\npub fn triangle_area(a: Vector3<f32>, b: Vector3<f32>, c: Vector3<f32>) -> f32 {\n\n (b - a).cross(&(c - a)).norm() * 0.5\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":41,"score":202449.4499076433},{"content":"/// Serializes Option<Script> using given serializer.\n\npub fn visit_opt_script(\n\n name: &str,\n\n script: &mut Option<Script>,\n\n visitor: &mut Visitor,\n\n) -> VisitResult {\n\n let mut region = visitor.enter_region(name)?;\n\n\n\n let mut script_type_uuid = script.as_ref().map(|s| s.id()).unwrap_or_default();\n\n script_type_uuid.visit(\"TypeUuid\", &mut region)?;\n\n\n\n if region.is_reading() {\n\n *script = if script_type_uuid.is_nil() {\n\n None\n\n } else {\n\n let serialization_context = region\n\n .environment\n\n .as_ref()\n\n .and_then(|e| e.downcast_ref::<SerializationContext>())\n\n .expect(\"Visitor environment must contain serialization context!\");\n\n\n","file_path":"src/scene/base.rs","rank":42,"score":199499.37533775062},{"content":"#[derive(Debug, Clone, Default, PartialEq, Visit)]\n\nstruct TupleStruct(f32, u32);\n\n\n","file_path":"fyrox-core-derive/tests/it/visit/basic.rs","rank":43,"score":198911.28309263694},{"content":"#[inline]\n\npub fn vector_to_quat(vec: Vector3<f32>) -> UnitQuaternion<f32> {\n\n let dot = vec.normalize().dot(&Vector3::y());\n\n\n\n if dot.abs() > 1.0 - 10.0 * f32::EPSILON {\n\n // Handle singularity when vector is collinear with Y axis.\n\n UnitQuaternion::from_axis_angle(&Vector3::x_axis(), -dot.signum() * 90.0f32.to_radians())\n\n } else {\n\n UnitQuaternion::face_towards(&vec, &Vector3::y())\n\n }\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":44,"score":198269.56064836675},{"content":"/// `<prefix>field.visit(\"name\", visitor);`\n\npub fn create_field_visits<'a>(\n\n // None or `f` when bindings tuple variants. NOTE: We can't use `prefix: Ident`\n\n prefix: Option<Ident>,\n\n fields: impl Iterator<Item = &'a args::FieldArgs>,\n\n field_style: ast::Style,\n\n) -> Vec<TokenStream2> {\n\n if field_style == ast::Style::Unit {\n\n // `Unit` (struct/enum variant) has no field to visit.\n\n // We won't even enter this region:\n\n return vec![];\n\n }\n\n\n\n let visit_args = fields\n\n .filter(|field| !field.skip)\n\n .enumerate()\n\n .map(|(field_index, field)| {\n\n let (ident, name) = match field_style {\n\n // `NamedFields { a: f32, .. }`\n\n ast::Style::Struct => {\n\n let ident = field.ident.as_ref().unwrap_or_else(|| unreachable!());\n","file_path":"fyrox-core-derive/src/visit/utils.rs","rank":45,"score":194658.2991414101},{"content":"/// A main trait for any scene graph node.\n\npub trait NodeTrait: BaseNodeTrait + Inspect + Visit {\n\n /// Allows a node to provide access to inner components.\n\n fn query_component_ref(&self, type_id: TypeId) -> Option<&dyn Any>;\n\n\n\n /// Allows a node to provide access to inner components.\n\n fn query_component_mut(&mut self, type_id: TypeId) -> Option<&mut dyn Any>;\n\n\n\n /// Returns axis-aligned bounding box in **local space** of the node.\n\n fn local_bounding_box(&self) -> AxisAlignedBoundingBox;\n\n\n\n /// Returns axis-aligned bounding box in **world space** of the node.\n\n ///\n\n /// # Important notes\n\n ///\n\n /// World bounding box will become valid **only** after first `update` call of the parent scene.\n\n /// It is because to calculate world bounding box we must get world transform first, but it\n\n /// can be calculated with a knowledge of parent world transform, so node on its own cannot know\n\n /// its world bounding box without additional information.\n\n fn world_bounding_box(&self) -> AxisAlignedBoundingBox;\n\n\n","file_path":"src/scene/node/mod.rs","rank":46,"score":193008.23399084838},{"content":"#[inline]\n\npub fn get_farthest_point(points: &[Vector3<f32>], dir: Vector3<f32>) -> Vector3<f32> {\n\n let mut n_farthest = 0;\n\n let mut max_dot = -f32::MAX;\n\n for (i, point) in points.iter().enumerate() {\n\n let dot = dir.dot(point);\n\n if dot > max_dot {\n\n n_farthest = i;\n\n max_dot = dot\n\n }\n\n }\n\n points[n_farthest]\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":47,"score":192869.47372493875},{"content":"pub fn print() -> Result<String, fmt::Error> {\n\n #[cfg(feature = \"enable_profiler\")]\n\n {\n\n let mut buffer = String::new();\n\n PROFILER.lock().unwrap().print(&mut buffer)?;\n\n Ok(buffer)\n\n }\n\n\n\n #[cfg(not(feature = \"enable_profiler\"))]\n\n {\n\n Ok(\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\".to_owned())\n\n }\n\n}\n\n\n","file_path":"fyrox-core/src/profiler.rs","rank":48,"score":191466.30590384756},{"content":"pub fn struct_prop_key_name(nth: usize, field: &args::FieldArgs) -> String {\n\n field.name.clone().unwrap_or_else(|| {\n\n let field_ident = match &field.ident {\n\n Some(ident) => quote!(#ident),\n\n None => {\n\n let nth_field = Index::from(nth);\n\n quote!(#nth_field)\n\n }\n\n };\n\n\n\n field_ident.to_string()\n\n })\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils/prop_keys.rs","rank":49,"score":190337.71696416056},{"content":"#[inline]\n\npub fn get_signed_triangle_area(v1: Vector2<f32>, v2: Vector2<f32>, v3: Vector2<f32>) -> f32 {\n\n 0.5 * (v1.x * (v3.y - v2.y) + v2.x * (v1.y - v3.y) + v3.x * (v2.y - v1.y))\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":50,"score":189878.0912711945},{"content":"#[inline]\n\npub fn m4x4_approx_eq(a: &Matrix4<f32>, b: &Matrix4<f32>) -> bool {\n\n a.iter()\n\n .zip(b.iter())\n\n .all(|(a, b)| (*a - *b).abs() <= 0.001)\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use crate::algebra::Vector2;\n\n use crate::math::Rect;\n\n use crate::math::SmoothAngle;\n\n\n\n #[test]\n\n fn ray_rect_intersection() {\n\n let rect = Rect::new(0.0, 0.0, 10.0, 10.0);\n\n\n\n // Edge-case: Horizontal ray.\n\n assert!(super::ray_rect_intersection(\n\n rect,\n\n Vector2::new(-1.0, 5.0),\n","file_path":"fyrox-core/src/math/mod.rs","rank":51,"score":189860.37194676365},{"content":"#[proc_macro_derive(Visit, attributes(visit))]\n\npub fn visit(input: TokenStream) -> TokenStream {\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n TokenStream::from(visit::impl_visit(ast))\n\n}\n\n\n\n/// Implements `Inspect` trait\n\n///\n\n/// User has to import `Inspect` and `PropertyInfo` to use this macro.\n","file_path":"fyrox-core-derive/src/lib.rs","rank":52,"score":189580.17783873732},{"content":"#[proc_macro_derive(Inspect, attributes(inspect))]\n\npub fn inspect(input: TokenStream) -> TokenStream {\n\n let ast = parse_macro_input!(input as DeriveInput);\n\n TokenStream::from(inspect::impl_inspect(ast))\n\n}\n","file_path":"fyrox-core-derive/src/lib.rs","rank":53,"score":189579.61307213537},{"content":"/// A value of a property.\n\npub trait PropertyValue: Any + Debug {\n\n /// Casts `self` to a `&dyn Any`\n\n fn as_any(&self) -> &dyn Any;\n\n}\n\n\n\nimpl<T: Debug + 'static> PropertyValue for T {\n\n fn as_any(&self) -> &dyn Any {\n\n self\n\n }\n\n}\n\n\n\n/// An error that can occur during \"type casting\"\n\n#[derive(Debug)]\n\npub enum CastError {\n\n /// Given type does not match expected.\n\n TypeMismatch {\n\n /// A name of the property.\n\n property_name: String,\n\n\n\n /// Expected type identifier.\n","file_path":"fyrox-core/src/inspect.rs","rank":54,"score":186919.8168902071},{"content":"pub fn print_hot_path() -> Result<String, fmt::Error> {\n\n #[cfg(feature = \"enable_profiler\")]\n\n {\n\n let mut buffer = String::new();\n\n PROFILER.lock().unwrap().print_hot_path(&mut buffer)?;\n\n Ok(buffer)\n\n }\n\n\n\n #[cfg(not(feature = \"enable_profiler\"))]\n\n {\n\n Ok(\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\".to_owned())\n\n }\n\n}\n\n\n","file_path":"fyrox-core/src/profiler.rs","rank":55,"score":183865.8734392247},{"content":"/// A trait for resource import options. It provides generic functionality shared over all types of import options.\n\npub trait ImportOptions: Serialize + DeserializeOwned + Default + Clone {\n\n /// Saves import options into a specified file.\n\n fn save(&self, path: &Path) -> bool {\n\n if let Ok(file) = File::create(path) {\n\n if ron::ser::to_writer_pretty(file, self, PrettyConfig::default()).is_ok() {\n\n return true;\n\n }\n\n }\n\n false\n\n }\n\n}\n\n\n\n/// Tries to load import settings for a resource. It is not part of ImportOptions trait because\n\n/// `async fn` is not yet supported for traits.\n\npub async fn try_get_import_settings<T>(resource_path: &Path) -> Option<T>\n\nwhere\n\n T: ImportOptions,\n\n{\n\n let settings_path = append_extension(resource_path, \"options\");\n\n\n","file_path":"src/engine/resource_manager/options.rs","rank":56,"score":183707.58079692227},{"content":"#[test]\n\nfn inspect_default() {\n\n #[derive(Debug, Default, Inspect)]\n\n pub struct Data {\n\n the_field: String,\n\n another_field: f32,\n\n }\n\n\n\n let data = Data::default();\n\n\n\n let expected = vec![\n\n PropertyInfo {\n\n owner_type_id: TypeId::of::<Data>(),\n\n name: \"the_field\",\n\n display_name: \"The Field\",\n\n value: &data.the_field,\n\n ..default_prop()\n\n },\n\n PropertyInfo {\n\n owner_type_id: TypeId::of::<Data>(),\n\n name: \"another_field\",\n\n display_name: \"Another Field\",\n\n value: &data.another_field,\n\n ..default_prop()\n\n },\n\n ];\n\n\n\n assert_eq!(data.properties(), expected);\n\n}\n\n\n","file_path":"fyrox-core-derive/tests/it/inspect.rs","rank":57,"score":183675.52874505208},{"content":"#[test]\n\nfn inspect_enum() {\n\n #[derive(Debug, Inspect)]\n\n pub struct NonCopy {\n\n inner: u32,\n\n }\n\n\n\n #[derive(Debug, Inspect)]\n\n pub enum Data {\n\n Named { x: u32, y: u32, z: NonCopy },\n\n Tuple(f32, f32),\n\n Unit,\n\n }\n\n\n\n let data = Data::Named {\n\n x: 0,\n\n y: 1,\n\n z: NonCopy { inner: 10 },\n\n };\n\n\n\n assert_eq!(\n","file_path":"fyrox-core-derive/tests/it/inspect.rs","rank":58,"score":183654.55169878746},{"content":"#[test]\n\nfn inspect_struct() {\n\n #[derive(Debug, Default, Inspect)]\n\n struct Tuple(f32, f32);\n\n\n\n let x = Tuple::default();\n\n assert_eq!(\n\n x.properties(),\n\n vec![\n\n PropertyInfo {\n\n owner_type_id: TypeId::of::<Tuple>(),\n\n name: \"0\",\n\n display_name: \"0\",\n\n value: &x.0,\n\n ..default_prop()\n\n },\n\n PropertyInfo {\n\n owner_type_id: TypeId::of::<Tuple>(),\n\n name: \"1\",\n\n display_name: \"1\",\n\n value: &x.1,\n","file_path":"fyrox-core-derive/tests/it/inspect.rs","rank":59,"score":183578.6087412699},{"content":"#[inline]\n\npub fn is_point_inside_triangle(p: &Vector3<f32>, vertices: &[Vector3<f32>; 3]) -> bool {\n\n let ba = vertices[1] - vertices[0];\n\n let ca = vertices[2] - vertices[0];\n\n let vp = *p - vertices[0];\n\n\n\n let ba_dot_ba = ba.dot(&ba);\n\n let ca_dot_ba = ca.dot(&ba);\n\n let ca_dot_ca = ca.dot(&ca);\n\n\n\n let dot02 = ca.dot(&vp);\n\n let dot12 = ba.dot(&vp);\n\n\n\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\n\n\n\n // Calculate barycentric coordinates\n\n let u = (ba_dot_ba * dot02 - ca_dot_ba * dot12) * inv_denom;\n\n let v = (ca_dot_ca * dot12 - ca_dot_ba * dot02) * inv_denom;\n\n\n\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":60,"score":183235.011580481},{"content":"fn default_prop() -> PropertyInfo<'static> {\n\n PropertyInfo {\n\n owner_type_id: TypeId::of::<()>(),\n\n name: \"\",\n\n display_name: \"\",\n\n value: &(),\n\n read_only: false,\n\n min_value: None,\n\n max_value: None,\n\n step: None,\n\n precision: None,\n\n description: \"\".to_string(),\n\n is_modified: false,\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/tests/it/inspect.rs","rank":61,"score":181073.74793693214},{"content":"fn arrange_dims(dims: &mut [GridDimension], final_size: f32) {\n\n let mut preset_width = 0.0;\n\n for dim in dims.iter() {\n\n if dim.size_mode == SizeMode::Auto || dim.size_mode == SizeMode::Strict {\n\n preset_width += dim.actual_size;\n\n }\n\n }\n\n\n\n let stretch_count = count_stretch_dims(dims);\n\n let avg_size = if stretch_count > 0 {\n\n (final_size - preset_width) / stretch_count as f32\n\n } else {\n\n 0.0\n\n };\n\n\n\n let mut location = 0.0;\n\n for dim in dims.iter_mut() {\n\n dim.location = location;\n\n location += match dim.size_mode {\n\n SizeMode::Strict | SizeMode::Auto => dim.actual_size,\n","file_path":"fyrox-ui/src/grid.rs","rank":62,"score":180921.4862426449},{"content":"pub fn check(err_code: c_int) -> Result<(), SoundError> {\n\n if err_code < 0 {\n\n Err(SoundError::FailedToInitializeDevice(err_code_to_string(\n\n err_code,\n\n )))\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl AlsaSoundDevice {\n\n pub fn new<F: FnMut(&mut [(f32, f32)]) + Send + 'static>(\n\n buffer_len_bytes: u32,\n\n callback: F,\n\n ) -> Result<Self, SoundError> {\n\n unsafe {\n\n let name = CString::new(\"default\").unwrap();\n\n // 16-bit stereo is 4 bytes, so frame count is bufferHalfSize / 4\n\n let frame_count = buffer_len_bytes / 4;\n\n let mut playback_device = std::ptr::null_mut();\n","file_path":"fyrox-sound/src/device/alsa.rs","rank":63,"score":180414.61506380164},{"content":"#[inline]\n\n#[allow(clippy::useless_let_if_seq)]\n\npub fn classify_plane(normal: Vector3<f32>) -> PlaneClass {\n\n let mut longest = 0.0f32;\n\n let mut class = PlaneClass::XY;\n\n\n\n if normal.x.abs() > longest {\n\n longest = normal.x.abs();\n\n class = PlaneClass::YZ;\n\n }\n\n\n\n if normal.y.abs() > longest {\n\n longest = normal.y.abs();\n\n class = PlaneClass::XZ;\n\n }\n\n\n\n if normal.z.abs() > longest {\n\n class = PlaneClass::XY;\n\n }\n\n\n\n class\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":64,"score":180124.71445008303},{"content":"/// A trait that allows you to \"look inside\" an object that implements it. It is used for lightweight\n\n/// runtime read-only reflection. The most common use case for it is various editors.\n\n///\n\n/// It is not advised to manually implement this trait. You should use `#[derive(Inspect)]` whenever\n\n/// possible.\n\n///\n\n/// ## `#[derive(Inspect)]`\n\n///\n\n/// The proc macro reduces amount of boilerplate code to the minimum and significantly reduces a\n\n/// change of error.\n\n///\n\n/// ### Supported attributes\n\n///\n\n/// - `#[inspect(name = \"new_field_name\")]` - override field name.\n\n/// - `#[inspect(display_name = \"Human-readable Name\")]` - override display name.\n\n/// - `#[inspect(group = \"Group Name\")]` - override group name.\n\n/// - `#[inspect(expand)]` - extends the list of properties in case of composition, in other words it\n\n/// \"flattens\" and exposes the properties of an inner object. Useful when you have a structure that\n\n/// has some fields that are complex objects that implements `Inspect` too.\n\npub trait Inspect {\n\n /// Returns information about \"public\" properties.\n\n fn properties(&self) -> Vec<PropertyInfo<'_>>;\n\n}\n\n\n\nimpl<T: Inspect> Inspect for Option<T> {\n\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\n\n match self {\n\n Some(v) => v.properties(),\n\n None => vec![],\n\n }\n\n }\n\n}\n\n\n\nimpl<T: Inspect> Inspect for Box<T> {\n\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\n\n (**self).properties()\n\n }\n\n}\n\n\n","file_path":"fyrox-core/src/inspect.rs","rank":65,"score":177007.93701480556},{"content":"pub fn cascade_size(base_size: usize, cascade: usize) -> usize {\n\n match cascade {\n\n 0 => base_size,\n\n 1 => (base_size / 2).max(1),\n\n 2 => (base_size / 4).max(1),\n\n _ => unreachable!(),\n\n }\n\n}\n\n\n","file_path":"src/renderer/shadow/mod.rs","rank":66,"score":175553.20216718857},{"content":"pub fn set_mesh_diffuse_color(mesh: &mut Mesh, color: Color) {\n\n for surface in mesh.surfaces() {\n\n surface\n\n .material()\n\n .lock()\n\n .set_property(\n\n &ImmutableString::new(\"diffuseColor\"),\n\n PropertyValue::Color(color),\n\n )\n\n .unwrap();\n\n }\n\n}\n\n\n","file_path":"editor/src/lib.rs","rank":67,"score":175273.34533649788},{"content":"pub fn make_button(ctx: &mut BuildContext, arrow: ArrowDirection, row: usize) -> Handle<UiNode> {\n\n ButtonBuilder::new(\n\n WidgetBuilder::new()\n\n .with_margin(Thickness::right(1.0))\n\n .on_row(row),\n\n )\n\n .with_back(\n\n DecoratorBuilder::new(BorderBuilder::new(\n\n WidgetBuilder::new().with_foreground(Brush::Solid(Color::opaque(90, 90, 90))),\n\n ))\n\n .with_normal_brush(Brush::Solid(Color::opaque(60, 60, 60)))\n\n .with_hover_brush(Brush::Solid(Color::opaque(80, 80, 80)))\n\n .with_pressed_brush(Brush::Solid(Color::opaque(80, 118, 178)))\n\n .build(ctx),\n\n )\n\n .with_content(make_arrow(ctx, arrow, 6.0))\n\n .build(ctx)\n\n}\n\n\n\nimpl<T: NumericType> NumericUpDownBuilder<T> {\n","file_path":"fyrox-ui/src/numeric.rs","rank":68,"score":174917.34905506263},{"content":"#[inline]\n\npub fn get_closest_point<P: PositionProvider>(points: &[P], point: Vector3<f32>) -> Option<usize> {\n\n let mut closest_sqr_distance = f32::MAX;\n\n let mut closest_index = None;\n\n for (i, vertex) in points.iter().enumerate() {\n\n let sqr_distance = (vertex.position() - point).norm_squared();\n\n if sqr_distance < closest_sqr_distance {\n\n closest_sqr_distance = sqr_distance;\n\n closest_index = Some(i);\n\n }\n\n }\n\n closest_index\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":69,"score":174876.42682181182},{"content":"fn calculate_decay(len: usize, sample_rate: u32, decay_time: Duration) -> f32 {\n\n let time_len = len as f32 / sample_rate as f32;\n\n // Asymptotically goes to 1.0 by exponential law\n\n DB60.powf(time_len / decay_time.as_secs_f32())\n\n}\n\n\n\nimpl ChannelReverb {\n\n /// Filter lengths given in samples\n\n const COMB_LENGTHS: [usize; 8] = [1557, 1617, 1491, 1422, 1277, 1356, 1188, 1116];\n\n const ALLPASS_LENGTHS: [usize; 4] = [225, 556, 441, 341];\n\n\n\n fn new(stereo_spread: u32, fc: f32, feedback: f32) -> Self {\n\n Self {\n\n fc,\n\n stereo_spread,\n\n sample_rate: DESIGN_SAMPLE_RATE,\n\n lp_fb_comb_filters: Self::COMB_LENGTHS\n\n .iter()\n\n .map(|len| LpfComb::new(*len + stereo_spread as usize, fc, feedback))\n\n .collect(),\n","file_path":"fyrox-sound/src/effects/reverb.rs","rank":70,"score":174433.3389550181},{"content":"pub fn enum_prop_key_name(nth: usize, field: &args::FieldArgs, v: &args::VariantArgs) -> String {\n\n field.name.clone().unwrap_or_else(|| {\n\n let field_ident = match &field.ident {\n\n Some(ident) => quote!(#ident),\n\n None => {\n\n let nth_field = Index::from(nth);\n\n quote!(#nth_field)\n\n }\n\n };\n\n\n\n format!(\"{}.{}\", v.ident, field_ident)\n\n })\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils/prop_keys.rs","rank":71,"score":173301.9339828051},{"content":"pub fn send_sync_message(ui: &UserInterface, mut msg: UiMessage) {\n\n msg.flags = MSG_SYNC_FLAG;\n\n ui.send_message(msg);\n\n}\n\n\n","file_path":"editor/src/lib.rs","rank":72,"score":172027.9563960628},{"content":"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\n\n let debug_text;\n\n let progress_bar;\n\n let progress_text;\n\n let root = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(screen_size.x)\n\n .with_height(screen_size.y)\n\n .with_child({\n\n debug_text =\n\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\n\n debug_text\n\n })\n\n .with_child({\n\n progress_bar =\n\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ctx);\n\n progress_bar\n\n })\n\n .with_child({\n\n progress_text = TextBuilder::new(\n","file_path":"examples/async.rs","rank":73,"score":171668.41956772836},{"content":"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\n\n let debug_text;\n\n let progress_bar;\n\n let progress_text;\n\n let cancel;\n\n let progress_grid;\n\n let root = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_width(screen_size.x)\n\n .with_height(screen_size.y)\n\n .with_child({\n\n debug_text =\n\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\n\n debug_text\n\n })\n\n .with_child({\n\n progress_grid = GridBuilder::new(\n\n WidgetBuilder::new()\n\n .with_visibility(!Path::new(LIGHTMAP_SCENE_PATH).exists())\n\n .on_column(1)\n","file_path":"examples/lightmap.rs","rank":74,"score":171668.41956772836},{"content":"/// `impl Inspect`\n\nfn inspect_trait_impl<'f>(\n\n ty_args: &args::TypeArgs,\n\n field_args: impl Iterator<Item = &'f args::FieldArgs>,\n\n impl_body: TokenStream2,\n\n) -> TokenStream2 {\n\n let ty_ident = &ty_args.ident;\n\n let generics = self::impl_inspect_generics(&ty_args.generics, field_args);\n\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\n\n\n\n quote! {\n\n impl #impl_generics Inspect for #ty_ident #ty_generics #where_clause {\n\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\n\n #impl_body\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils.rs","rank":75,"score":170941.83122578816},{"content":"/// Creates `Generic` for `impl Inspect` block\n\n///\n\n/// TODO: Add `where Field: Inspect` boundaries to support inspectable types with generics\n\nfn impl_inspect_generics<'a>(\n\n generics: &Generics,\n\n _field_args: impl Iterator<Item = &'a args::FieldArgs>,\n\n) -> Generics {\n\n generics.clone()\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils.rs","rank":76,"score":170941.69954393286},{"content":"/// https://en.wikipedia.org/wiki/Smoothstep\n\nfn smoothstep(edge0: f32, edge1: f32, x: f32) -> f32 {\n\n let k = ((x - edge0) / (edge1 - edge0)).max(0.0).min(1.0);\n\n k * k * (3.0 - 2.0 * k)\n\n}\n\n\n","file_path":"src/utils/lightmap.rs","rank":77,"score":170756.00760839568},{"content":"pub fn struct_prop_ident(ty_args: &args::TypeArgs, nth: usize, field: &args::FieldArgs) -> Ident {\n\n let fields = match &ty_args.data {\n\n ast::Data::Struct(xs) => xs,\n\n _ => unreachable!(),\n\n };\n\n let field_ident = self::field_ident(fields, nth, field);\n\n\n\n let ident = field_ident.to_case(Case::UpperSnake);\n\n syn::parse_str(&ident).unwrap()\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils/prop_keys.rs","rank":78,"score":170057.6079615977},{"content":"/// `pub const [VARIANT_]FIELD: &'static str = \"key\";`\n\npub fn prop_keys_impl(ty_args: &args::TypeArgs) -> TokenStream2 {\n\n let ty_ident = &ty_args.ident;\n\n let (impl_generics, ty_generics, where_clause) = ty_args.generics.split_for_impl();\n\n\n\n let prop_keys = self::quote_prop_keys(ty_args);\n\n\n\n quote! {\n\n /// Property key constants\n\n impl #impl_generics #ty_ident #ty_generics #where_clause {\n\n #prop_keys\n\n }\n\n }\n\n}\n\n\n","file_path":"fyrox-core-derive/src/inspect/utils/prop_keys.rs","rank":79,"score":169362.216572196},{"content":"pub fn make_status_enum_editor_definition() -> EnumPropertyEditorDefinition<Status> {\n\n EnumPropertyEditorDefinition {\n\n variant_generator: |i| match i {\n\n 0 => Status::Stopped,\n\n 1 => Status::Playing,\n\n 2 => Status::Paused,\n\n _ => unreachable!(),\n\n },\n\n index_generator: |v| *v as usize,\n\n names_generator: || {\n\n vec![\n\n \"Stopped\".to_string(),\n\n \"Playing\".to_string(),\n\n \"Paused\".to_string(),\n\n ]\n\n },\n\n }\n\n}\n\n\n","file_path":"editor/src/inspector/editors/mod.rs","rank":80,"score":169293.58221961837},{"content":"pub fn make_save_file_selector(ctx: &mut BuildContext) -> Handle<UiNode> {\n\n FileSelectorBuilder::new(\n\n WindowBuilder::new(WidgetBuilder::new().with_width(300.0).with_height(400.0))\n\n .with_title(WindowTitle::Text(\"Save Scene As\".into()))\n\n .open(false),\n\n )\n\n .with_mode(FileBrowserMode::Save {\n\n default_file_name: PathBuf::from(\"unnamed.rgs\"),\n\n })\n\n .with_path(\"./\")\n\n .with_filter(make_scene_file_filter())\n\n .build(ctx)\n\n}\n\n\n\npub enum Mode {\n\n Edit,\n\n Play {\n\n // Play mode scene.\n\n scene: Handle<Scene>,\n\n // List of scenes that existed before entering play mode.\n","file_path":"editor/src/lib.rs","rank":81,"score":168969.78040602052},{"content":"fn stepf(p0: f32, p1: f32, t: f32) -> f32 {\n\n if t.eq(&1.0) {\n\n p1\n\n } else {\n\n p0\n\n }\n\n}\n\n\n\n#[derive(Visit, Clone, Debug, PartialEq)]\n\npub enum CurveKeyKind {\n\n Constant,\n\n Linear,\n\n Cubic {\n\n /// A `tan(angle)` of left tangent.\n\n left_tangent: f32,\n\n /// A `tan(angle)` of right tangent.\n\n right_tangent: f32,\n\n },\n\n}\n\n\n","file_path":"fyrox-core/src/curve.rs","rank":82,"score":168505.10573211557},{"content":"#[inline]\n\npub fn quat_from_euler<T: SimdRealField + RealField + Copy + Clone>(\n\n euler_radians: Vector3<T>,\n\n order: RotationOrder,\n\n) -> UnitQuaternion<T> {\n\n let qx = UnitQuaternion::from_axis_angle(&Vector3::x_axis(), euler_radians.x);\n\n let qy = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), euler_radians.y);\n\n let qz = UnitQuaternion::from_axis_angle(&Vector3::z_axis(), euler_radians.z);\n\n match order {\n\n RotationOrder::XYZ => qz * qy * qx,\n\n RotationOrder::XZY => qy * qz * qx,\n\n RotationOrder::YZX => qx * qz * qy,\n\n RotationOrder::YXZ => qz * qx * qy,\n\n RotationOrder::ZXY => qy * qx * qz,\n\n RotationOrder::ZYX => qx * qy * qz,\n\n }\n\n}\n\n\n","file_path":"fyrox-core/src/math/mod.rs","rank":83,"score":166354.93018932937},{"content":"fn create_float_view(ctx: &mut BuildContext, value: f32) -> Handle<UiNode> {\n\n NumericUpDownBuilder::new(WidgetBuilder::new().with_height(24.0))\n\n .with_value(value)\n\n .build(ctx)\n\n}\n\n\n","file_path":"editor/src/material.rs","rank":84,"score":165359.94638727698},{"content":"/// Calculates distance attenuation for a point using given distance to the point and\n\n/// radius of a light.\n\nfn distance_attenuation(distance: f32, sqr_radius: f32) -> f32 {\n\n let attenuation = (1.0 - distance * distance / sqr_radius).max(0.0).min(1.0);\n\n attenuation * attenuation\n\n}\n\n\n","file_path":"src/utils/lightmap.rs","rank":85,"score":165269.06429607308},{"content":"fn round_to_step(x: f32, step: f32) -> f32 {\n\n x - x % step\n\n}\n\n\n\nimpl CurveEditor {\n\n fn update_matrices(&self) {\n\n let vp = Vector2::new(self.view_position.x, -self.view_position.y);\n\n self.view_matrix.set(\n\n Matrix3::new_nonuniform_scaling_wrt_point(\n\n &Vector2::new(self.zoom, self.zoom),\n\n &Point2::from(self.actual_size().scale(0.5)),\n\n ) * Matrix3::new_translation(&vp),\n\n );\n\n\n\n let screen_bounds = self.screen_bounds();\n\n self.screen_matrix.set(\n\n Matrix3::new_translation(&screen_bounds.position)\n\n // Flip Y because in math origin is in lower left corner.\n\n * Matrix3::new_translation(&Vector2::new(0.0, screen_bounds.h()))\n\n * Matrix3::new_nonuniform_scaling(&Vector2::new(1.0, -1.0))\n","file_path":"fyrox-ui/src/curve/mod.rs","rank":86,"score":165263.3817046283},{"content":"pub fn make_arrow_primitives(orientation: ArrowDirection, size: f32) -> Vec<Primitive> {\n\n vec![match orientation {\n\n ArrowDirection::Top => Primitive::Triangle {\n\n points: [\n\n Vector2::new(size * 0.5, 0.0),\n\n Vector2::new(size, size),\n\n Vector2::new(0.0, size),\n\n ],\n\n },\n\n ArrowDirection::Bottom => Primitive::Triangle {\n\n points: [\n\n Vector2::new(0.0, 0.0),\n\n Vector2::new(size, 0.0),\n\n Vector2::new(size * 0.5, size),\n\n ],\n\n },\n\n ArrowDirection::Right => Primitive::Triangle {\n\n points: [\n\n Vector2::new(0.0, 0.0),\n\n Vector2::new(size, size * 0.5),\n","file_path":"fyrox-ui/src/utils.rs","rank":87,"score":164654.38030701096},{"content":"/// A samples generator.\n\n///\n\n/// # Notes\n\n///\n\n/// Iterator implementation (the `next()` method) must produce samples in interleaved format, this\n\n/// means that samples emitted by the method should be in `LRLRLR..` order, where `L` and `R` are\n\n/// samples from left and right channels respectively. The sound engine supports both mono and\n\n/// stereo sample sources.\n\npub trait RawStreamingDataSource: Iterator<Item = f32> + Send + Sync + Debug {\n\n /// Should return sample rate of the source.\n\n fn sample_rate(&self) -> usize;\n\n\n\n /// Should return total channel count.\n\n fn channel_count(&self) -> usize;\n\n\n\n /// Tells whether the provider should restart.\n\n fn rewind(&mut self) -> Result<(), SoundError> {\n\n Ok(())\n\n }\n\n\n\n /// Allows you to start playback from given duration.\n\n fn time_seek(&mut self, _duration: Duration) {}\n\n\n\n /// Returns total duration of data. Can be `None` if internal decoder does not supports seeking.\n\n fn duration(&self) -> Option<Duration> {\n\n None\n\n }\n\n}\n","file_path":"fyrox-sound/src/buffer/mod.rs","rank":88,"score":164545.13312724064},{"content":"#[test]\n\nfn complex_enum() {\n\n let mut data = ComplexEnum::Tuple(100, 200);\n\n let mut data_default = ComplexEnum::UnitVariant;\n\n\n\n super::save_load(\"complex_enum\", &mut data, &mut data_default);\n\n\n\n assert_eq!(data, data_default);\n\n}\n\n\n","file_path":"fyrox-core-derive/tests/it/visit/basic.rs","rank":89,"score":164284.18039235426},{"content":"#[test]\n\nfn generic_enum() {\n\n #[derive(Debug)]\n\n struct NotVisit;\n\n\n\n #[allow(warnings)]\n\n let mut not_compile = GenericEnum::Tuple(1, vec![NotVisit]);\n\n\n\n // Compile error because `Generics<NotVisit> is not `Visit`:\n\n // let mut visitor = Visitor::new();\n\n // not_compile.visit(\"Data\", &mut visitor).unwrap();\n\n\n\n let mut data = GenericEnum::Tuple(1, vec![100u32]);\n\n let mut data_default = GenericEnum::UnitVariant;\n\n\n\n super::save_load(\"generic_enum\", &mut data, &mut data_default);\n\n\n\n assert_eq!(data, data_default);\n\n}\n","file_path":"fyrox-core-derive/tests/it/visit/basic.rs","rank":90,"score":164284.18039235426},{"content":"#[test]\n\nfn plain_enum() {\n\n let mut data = PlainEnum::C;\n\n let mut data_default = PlainEnum::A;\n\n\n\n super::save_load(\"plain_enum\", &mut data, &mut data_default);\n\n\n\n assert_eq!(data, data_default);\n\n}\n\n\n","file_path":"fyrox-core-derive/tests/it/visit/basic.rs","rank":91,"score":164284.18039235426},{"content":"#[test]\n\nfn unit_struct() {\n\n let mut data = UnitStruct;\n\n let mut data_default = UnitStruct;\n\n\n\n // non seuse.. but anyways,\n\n // `Visit` is implemented `UnitStruct;` as empty code block `{}`\n\n super::save_load(\"unit_struct\", &mut data, &mut data_default);\n\n\n\n assert_eq!(data, data_default);\n\n}\n\n\n","file_path":"fyrox-core-derive/tests/it/visit/basic.rs","rank":92,"score":164210.9819747652},{"content":"#[test]\n\nfn tuple_struct() {\n\n let mut data = TupleStruct(10.0, 20);\n\n let mut data_default = TupleStruct(0.0, 0);\n\n\n\n super::save_load(\"tuple_struct\", &mut data, &mut data_default);\n\n\n\n assert_eq!(data, data_default);\n\n}\n\n\n","file_path":"fyrox-core-derive/tests/it/visit/basic.rs","rank":93,"score":164210.9819747652},{"content":"fn heuristic(a: Vector3<f32>, b: Vector3<f32>) -> f32 {\n\n (a - b).norm_squared()\n\n}\n\n\n\nimpl Default for PathFinder {\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n\nimpl PositionProvider for PathVertex {\n\n fn position(&self) -> Vector3<f32> {\n\n self.position\n\n }\n\n}\n\n\n\n/// Path search can be interrupted by errors, this enum stores all possible\n\n/// kinds of errors.\n\n#[derive(Clone, Debug, thiserror::Error)]\n\npub enum PathError {\n","file_path":"src/utils/astar.rs","rank":94,"score":163964.4815468832},{"content":"fn read_string<R>(file: &mut R) -> Result<FbxAttribute, FbxError>\n\nwhere\n\n R: Read,\n\n{\n\n let length = file.read_u32::<LittleEndian>()? as usize;\n\n let mut raw_string = vec![Default::default(); length];\n\n file.read_exact(raw_string.as_mut_slice())?;\n\n // Find null terminator. It is required because for some reason some strings\n\n // have additional data after null terminator like this: Omni004\\x0\\x1Model, but\n\n // length still more than position of null terminator.\n\n if let Some(null_terminator_pos) = raw_string.iter().position(|c| *c == 0) {\n\n raw_string.truncate(null_terminator_pos);\n\n }\n\n let string = String::from_utf8(raw_string)?;\n\n Ok(FbxAttribute::String(string))\n\n}\n\n\n\nconst VERSION_7500: i32 = 7500;\n\nconst VERSION_7500_NULLREC_SIZE: usize = 25; // in bytes\n\nconst NORMAL_NULLREC_SIZE: usize = 13; // in bytes\n\n\n","file_path":"src/resource/fbx/document/binary.rs","rank":95,"score":162730.3168023643},{"content":"fn distance_scale_factor(fov: f32) -> f32 {\n\n fov.tan() * 0.1\n\n}\n\n\n\n/// Helper enum to be able to access interaction modes in array directly.\n\n#[derive(Copy, Clone, PartialOrd, PartialEq, Hash, Debug)]\n\n#[repr(usize)]\n\npub enum InteractionModeKind {\n\n Select = 0,\n\n Move = 1,\n\n Scale = 2,\n\n Rotate = 3,\n\n Navmesh = 4,\n\n Terrain = 5,\n\n}\n","file_path":"editor/src/interaction/mod.rs","rank":96,"score":161548.8063743718},{"content":"fn create_impl_generics(\n\n generics: &Generics,\n\n field_args: impl Iterator<Item = args::FieldArgs>,\n\n) -> Generics {\n\n let mut generics = generics.clone();\n\n\n\n // Add where clause for every visited field\n\n generics.make_where_clause().predicates.extend(\n\n field_args\n\n .filter(|f| !f.skip)\n\n .map(|f| f.ty)\n\n .map::<WherePredicate, _>(|ty| parse_quote! { #ty: Visit }),\n\n );\n\n\n\n generics\n\n}\n\n\n","file_path":"fyrox-core-derive/src/visit/utils.rs","rank":97,"score":159794.54306873365},{"content":"pub fn make_property_margin(layer_index: usize) -> Thickness {\n\n let mut margin = HEADER_MARGIN;\n\n margin.left += 10.0 + layer_index as f32 * 10.0;\n\n margin\n\n}\n\n\n","file_path":"fyrox-ui/src/inspector/mod.rs","rank":98,"score":159132.58594986683},{"content":"fn create_vec2_view(ctx: &mut BuildContext, value: Vector2<f32>) -> Handle<UiNode> {\n\n Vec2EditorBuilder::new(WidgetBuilder::new().with_height(24.0))\n\n .with_value(value)\n\n .build(ctx)\n\n}\n\n\n","file_path":"editor/src/material.rs","rank":99,"score":158687.28931239547}],"string":"[\n {\n \"content\": \"fn write_node(name: &str, node: &mut Node, visitor: &mut Visitor) -> VisitResult {\\n\\n let mut region = visitor.enter_region(name)?;\\n\\n\\n\\n let mut id = node.id();\\n\\n id.visit(\\\"TypeUuid\\\", &mut region)?;\\n\\n\\n\\n node.visit(\\\"NodeData\\\", &mut region)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\\nimpl Visit for NodeContainer {\\n\\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult {\\n\\n let mut region = visitor.enter_region(name)?;\\n\\n\\n\\n let mut is_some = if self.is_some() { 1u8 } else { 0u8 };\\n\\n is_some.visit(\\\"IsSome\\\", &mut region)?;\\n\\n\\n\\n if is_some != 0 {\\n\\n if region.is_reading() {\\n\",\n \"file_path\": \"src/scene/node/container.rs\",\n \"rank\": 1,\n \"score\": 293204.8694213878\n },\n {\n \"content\": \"#[inline]\\n\\npub fn wrapf(mut n: f32, mut min_limit: f32, mut max_limit: f32) -> f32 {\\n\\n if n >= min_limit && n <= max_limit {\\n\\n return n;\\n\\n }\\n\\n\\n\\n if max_limit == 0.0 && min_limit == 0.0 {\\n\\n return 0.0;\\n\\n }\\n\\n\\n\\n max_limit -= min_limit;\\n\\n\\n\\n let offset = min_limit;\\n\\n min_limit = 0.0;\\n\\n n -= offset;\\n\\n\\n\\n let num_of_max = (n / max_limit).abs().floor();\\n\\n\\n\\n if n >= max_limit {\\n\\n n -= num_of_max * max_limit;\\n\\n } else if n < min_limit {\\n\\n n += (num_of_max + 1.0) * max_limit;\\n\\n }\\n\\n\\n\\n n + offset\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 2,\n \"score\": 283810.21516115195\n },\n {\n \"content\": \"fn read_node(name: &str, visitor: &mut Visitor) -> Result<Node, VisitError> {\\n\\n let node = {\\n\\n // Handle legacy nodes.\\n\\n let mut kind_id = 0u8;\\n\\n if kind_id.visit(\\\"KindId\\\", visitor).is_ok() {\\n\\n let mut node = match kind_id {\\n\\n 0 => Node::new(Pivot::default()),\\n\\n 1 => {\\n\\n let mut region = visitor.enter_region(name)?;\\n\\n\\n\\n let mut light_id = 0u32;\\n\\n light_id.visit(\\\"KindId\\\", &mut region)?;\\n\\n\\n\\n let mut light_node = match light_id {\\n\\n 0 => Node::new(SpotLight::default()),\\n\\n 1 => Node::new(PointLight::default()),\\n\\n 2 => Node::new(DirectionalLight::default()),\\n\\n _ => {\\n\\n return Err(VisitError::User(format!(\\n\\n \\\"Invalid legacy light kind {}\\\",\\n\",\n \"file_path\": \"src/scene/node/container.rs\",\n \"rank\": 3,\n \"score\": 277158.78388240293\n },\n {\n \"content\": \"/// Creates new window using specified window function.\\n\\n/// <https://en.wikipedia.org/wiki/Window_function>\\n\\npub fn make_window<W: Fn(usize, usize) -> f32>(sample_count: usize, func: W) -> Vec<f32> {\\n\\n (0..sample_count).map(|i| func(i, sample_count)).collect()\\n\\n}\\n\",\n \"file_path\": \"fyrox-sound/src/dsp/mod.rs\",\n \"rank\": 4,\n \"score\": 268456.1095306186\n },\n {\n \"content\": \"/// Calculates single coefficient of Hamming window.\\n\\n/// <https://en.wikipedia.org/wiki/Window_function#Hamming_window>\\n\\npub fn hamming_window(i: usize, sample_count: usize) -> f32 {\\n\\n 0.54 - 0.46 * (2.0 * std::f32::consts::PI * i as f32 / (sample_count - 1) as f32).cos()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-sound/src/dsp/mod.rs\",\n \"rank\": 5,\n \"score\": 263448.77280674374\n },\n {\n \"content\": \"/// Calculates single coefficient of Hann window.\\n\\n/// <https://en.wikipedia.org/wiki/Hann_function>\\n\\npub fn hann_window(i: usize, sample_count: usize) -> f32 {\\n\\n 0.5 - 0.5 * (2.0 * std::f32::consts::PI * i as f32 / (sample_count - 1) as f32).cos()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-sound/src/dsp/mod.rs\",\n \"rank\": 6,\n \"score\": 263448.77280674374\n },\n {\n \"content\": \"/// Saves given `data` and overwrites `data_default` with the saved data.\\n\\n///\\n\\n/// Test the equality after running this method!\\n\\npub fn save_load<T: Visit>(test_name: &str, data: &mut T, data_default: &mut T) {\\n\\n // Locate output path\\n\\n let (bin, txt) = {\\n\\n let manifest_dir = env::var(\\\"CARGO_MANIFEST_DIR\\\").unwrap();\\n\\n let root = PathBuf::from(manifest_dir).join(\\\"test_output\\\");\\n\\n let _ = std::fs::create_dir(&root);\\n\\n (\\n\\n root.join(format!(\\\"{}.bin\\\", test_name)),\\n\\n root.join(format!(\\\"{}.txt\\\", test_name)),\\n\\n )\\n\\n };\\n\\n\\n\\n // Save `data`\\n\\n {\\n\\n let mut visitor = Visitor::new();\\n\\n data.visit(\\\"Data\\\", &mut visitor).unwrap();\\n\\n\\n\\n visitor.save_binary(&bin).unwrap();\\n\\n let mut file = File::create(&txt).unwrap();\\n\\n file.write_all(visitor.save_text().as_bytes()).unwrap();\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/visit.rs\",\n \"rank\": 7,\n \"score\": 256202.01616297854\n },\n {\n \"content\": \"///\\n\\n/// Triangulates specified polygon.\\n\\n///\\n\\npub fn triangulate(vertices: &[Vector3<f32>], out_triangles: &mut Vec<[usize; 3]>) {\\n\\n out_triangles.clear();\\n\\n if vertices.len() == 3 {\\n\\n // Triangulating a triangle?\\n\\n out_triangles.push([0, 1, 2]);\\n\\n } else if vertices.len() == 4 {\\n\\n // Special case for quadrilaterals (much faster than generic)\\n\\n let mut start_vertex = 0;\\n\\n for i in 0..4 {\\n\\n let v = vertices[i];\\n\\n let v0 = vertices[(i + 3) % 4];\\n\\n if let Some(left) = (v0 - v).try_normalize(f32::EPSILON) {\\n\\n let v1 = vertices[(i + 2) % 4];\\n\\n if let Some(diag) = (v1 - v).try_normalize(f32::EPSILON) {\\n\\n let v2 = vertices[(i + 1) % 4];\\n\\n if let Some(right) = (v2 - v).try_normalize(f32::EPSILON) {\\n\\n // Check for concave vertex\\n\\n let angle = left.dot(&diag).acos() + right.dot(&diag).acos();\\n\\n if angle > std::f32::consts::PI {\\n\\n start_vertex = i;\\n\",\n \"file_path\": \"fyrox-core/src/math/triangulator.rs\",\n \"rank\": 8,\n \"score\": 250683.66110117562\n },\n {\n \"content\": \"/// A trait for user-defined actions for behavior tree.\\n\\npub trait Behavior<'a>: Visit + Default + PartialEq + Debug {\\n\\n /// A context in which the behavior will be performed.\\n\\n type Context;\\n\\n\\n\\n /// A function that will be called each frame depending on\\n\\n /// the current execution path of the behavior tree it belongs\\n\\n /// to.\\n\\n fn tick(&mut self, context: &mut Self::Context) -> Status;\\n\\n}\\n\\n\\n\\n/// Root node of the tree.\\n\\n#[derive(Debug, PartialEq, Visit)]\\n\\npub struct RootNode<B> {\\n\\n child: Handle<BehaviorNode<B>>,\\n\\n}\\n\\n\\n\\nimpl<B> Default for RootNode<B> {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n child: Default::default(),\\n\",\n \"file_path\": \"src/utils/behavior/mod.rs\",\n \"rank\": 9,\n \"score\": 247866.86060288685\n },\n {\n \"content\": \"pub trait BaseScript: Visit + Inspect + Send + Debug + 'static {\\n\\n fn clone_box(&self) -> Box<dyn ScriptTrait>;\\n\\n}\\n\\n\\n\\nimpl<T> BaseScript for T\\n\\nwhere\\n\\n T: Clone + ScriptTrait,\\n\\n{\\n\\n fn clone_box(&self) -> Box<dyn ScriptTrait> {\\n\\n Box::new(self.clone())\\n\\n }\\n\\n}\\n\\n\\n\\npub struct ScriptContext<'a, 'b, 'c> {\\n\\n pub dt: f32,\\n\\n pub plugin: &'a mut dyn Plugin,\\n\\n pub node: &'b mut Node,\\n\\n pub handle: Handle<Node>,\\n\\n pub scene: &'c mut Scene,\\n\\n pub resource_manager: &'a ResourceManager,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/script/mod.rs\",\n \"rank\": 10,\n \"score\": 247816.1315096252\n },\n {\n \"content\": \"pub trait InspectableEnum: Debug + Inspect + 'static {}\\n\\n\\n\\nimpl<T: Debug + Inspect + 'static> InspectableEnum for T {}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub enum EnumPropertyEditorMessage {\\n\\n Variant(usize),\\n\\n PropertyChanged(PropertyChanged),\\n\\n}\\n\\n\\n\\nimpl EnumPropertyEditorMessage {\\n\\n define_constructor!(EnumPropertyEditorMessage:Variant => fn variant(usize), layout: false);\\n\\n define_constructor!(EnumPropertyEditorMessage:PropertyChanged => fn property_changed(PropertyChanged), layout: false);\\n\\n}\\n\\n\\n\\npub struct EnumPropertyEditor<T: InspectableEnum> {\\n\\n widget: Widget,\\n\\n variant_selector: Handle<UiNode>,\\n\\n inspector: Handle<UiNode>,\\n\\n definition: EnumPropertyEditorDefinition<T>,\\n\",\n \"file_path\": \"fyrox-ui/src/inspector/editors/enumeration.rs\",\n \"rank\": 11,\n \"score\": 245756.0458513006\n },\n {\n \"content\": \"/// A trait for resource data.\\n\\npub trait ResourceData: 'static + Default + Debug + Visit + Send {\\n\\n /// Returns path of resource data.\\n\\n fn path(&self) -> Cow<Path>;\\n\\n\\n\\n /// Sets new path to resource data.\\n\\n fn set_path(&mut self, path: PathBuf);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-resource/src/lib.rs\",\n \"rank\": 12,\n \"score\": 242951.79310065665\n },\n {\n \"content\": \"pub fn fix_shadows_distance(mut quality: QualitySettings) -> QualitySettings {\\n\\n // Scale distance because game world has different scale.\\n\\n quality.spot_shadows_distance *= 2.0;\\n\\n quality.point_shadows_distance *= 2.0;\\n\\n quality\\n\\n}\\n\",\n \"file_path\": \"examples/shared/mod.rs\",\n \"rank\": 13,\n \"score\": 240081.4173366913\n },\n {\n \"content\": \"/// Creates `Inspect` trait impl and field prop keys\\n\\npub fn create_inspect_impl<'f>(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: impl Iterator<Item = &'f args::FieldArgs>,\\n\\n impl_body: TokenStream2,\\n\\n) -> TokenStream2 {\\n\\n let prop_keys_impl = prop_keys::prop_keys_impl(ty_args);\\n\\n let trait_impl = self::inspect_trait_impl(ty_args, field_args, impl_body);\\n\\n\\n\\n quote! {\\n\\n #prop_keys_impl\\n\\n #trait_impl\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils.rs\",\n \"rank\": 14,\n \"score\": 234920.55887460534\n },\n {\n \"content\": \"pub fn create_impl(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: impl Iterator<Item = args::FieldArgs>,\\n\\n impl_body: TokenStream2,\\n\\n) -> TokenStream2 {\\n\\n let ty_ident = &ty_args.ident;\\n\\n let generics = self::create_impl_generics(&ty_args.generics, field_args);\\n\\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\\n\\n\\n\\n quote! {\\n\\n impl #impl_generics Visit for #ty_ident #ty_generics #where_clause {\\n\\n fn visit(\\n\\n &mut self,\\n\\n name: &str,\\n\\n visitor: &mut Visitor,\\n\\n ) -> VisitResult {\\n\\n #impl_body\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/visit/utils.rs\",\n \"rank\": 15,\n \"score\": 231837.27319743088\n },\n {\n \"content\": \"pub fn make_scene_file_filter() -> Filter {\\n\\n Filter::new(|p: &Path| {\\n\\n if let Some(ext) = p.extension() {\\n\\n ext.to_string_lossy().as_ref() == \\\"rgs\\\"\\n\\n } else {\\n\\n p.is_dir()\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"editor/src/lib.rs\",\n \"rank\": 16,\n \"score\": 230971.45420339616\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_polygon_normal(polygon: &[Vector3<f32>]) -> Result<Vector3<f32>, &'static str> {\\n\\n let mut normal = Vector3::default();\\n\\n\\n\\n for (i, current) in polygon.iter().enumerate() {\\n\\n let next = polygon[(i + 1) % polygon.len()];\\n\\n normal.x += (current.y - next.y) * (current.z + next.z);\\n\\n normal.y += (current.z - next.z) * (current.x + next.x);\\n\\n normal.z += (current.x - next.x) * (current.y + next.y);\\n\\n }\\n\\n\\n\\n normal\\n\\n .try_normalize(f32::EPSILON)\\n\\n .ok_or(\\\"Unable to get normal of degenerated polygon!\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 17,\n \"score\": 229370.0246755001\n },\n {\n \"content\": \"fn get_last_sample(buffer: &StreamingBuffer) -> (f32, f32) {\\n\\n let len = buffer.samples.len();\\n\\n if len == 0 {\\n\\n return (0.0, 0.0);\\n\\n }\\n\\n if buffer.channel_count == 2 {\\n\\n (buffer.samples[len - 2], buffer.samples[len - 1])\\n\\n } else {\\n\\n (buffer.samples[len - 1], buffer.samples[len - 1])\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for SoundSource {\\n\\n fn drop(&mut self) {\\n\\n if let Some(buffer) = self.buffer.as_ref() {\\n\\n let mut buffer = buffer.data_ref();\\n\\n if let SoundBufferState::Streaming(ref mut streaming) = *buffer {\\n\\n streaming.use_count = streaming.use_count.saturating_sub(1);\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"fyrox-sound/src/source.rs\",\n \"rank\": 18,\n \"score\": 227664.0683318552\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn lerpf(a: f32, b: f32, t: f32) -> f32 {\\n\\n a + (b - a) * t\\n\\n}\\n\\n\\n\\n// https://en.wikipedia.org/wiki/Cubic_Hermite_spline\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 19,\n \"score\": 224444.15203210956\n },\n {\n \"content\": \"#[inline]\\n\\npub fn ieee_remainder(x: f32, y: f32) -> f32 {\\n\\n x - (x / y).round() * y\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 20,\n \"score\": 223211.73295744258\n },\n {\n \"content\": \"/// impl `Visit` for `struct`\\n\\nfn impl_visit_struct(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: &ast::Fields<args::FieldArgs>,\\n\\n) -> TokenStream2 {\\n\\n let visit_fn_body = if field_args.style == ast::Style::Unit {\\n\\n quote! { Ok(()) }\\n\\n } else {\\n\\n // `field.visit(..);` parts\\n\\n let field_visits =\\n\\n utils::create_field_visits(None, field_args.fields.iter(), field_args.style);\\n\\n\\n\\n quote! {\\n\\n let mut region = visitor.enter_region(name)?;\\n\\n #(self.#field_visits)*\\n\\n Ok(())\\n\\n }\\n\\n };\\n\\n\\n\\n utils::create_impl(ty_args, field_args.iter().cloned(), visit_fn_body)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/visit.rs\",\n \"rank\": 21,\n \"score\": 222142.21923848335\n },\n {\n \"content\": \"pub fn make_default_anchor(ctx: &mut BuildContext, row: usize, column: usize) -> Handle<UiNode> {\\n\\n let default_anchor_size = 30.0;\\n\\n BorderBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(default_anchor_size)\\n\\n .with_height(default_anchor_size)\\n\\n .with_visibility(false)\\n\\n .on_row(row)\\n\\n .on_column(column)\\n\\n .with_draw_on_top(true)\\n\\n .with_background(Brush::Solid(DEFAULT_ANCHOR_COLOR)),\\n\\n )\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\\nimpl TileBuilder {\\n\\n pub fn new(widget_builder: WidgetBuilder) -> Self {\\n\\n Self {\\n\\n widget_builder,\\n\\n content: TileContent::Empty,\\n\",\n \"file_path\": \"fyrox-ui/src/dock.rs\",\n \"rank\": 22,\n \"score\": 220647.68326847837\n },\n {\n \"content\": \"#[inline]\\n\\npub fn round_to_step(x: f32, step: f32) -> f32 {\\n\\n x - ieee_remainder(x, step)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 23,\n \"score\": 219713.83351770398\n },\n {\n \"content\": \"#[inline]\\n\\npub fn wrap_angle(angle: f32) -> f32 {\\n\\n let two_pi = 2.0 * std::f32::consts::PI;\\n\\n\\n\\n if angle > 0.0 {\\n\\n angle % two_pi\\n\\n } else {\\n\\n (angle + two_pi) % two_pi\\n\\n }\\n\\n}\\n\\n\\n\\n/// There are two versions of remainder, the standard `%` operator which does `x - (x/y).trunc()*y` and IEEE remainder which does `x - (x/y).round()*y`.\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 24,\n \"score\": 219410.84163344247\n },\n {\n \"content\": \"#[inline]\\n\\npub fn barycentric_is_inside(bary: (f32, f32, f32)) -> bool {\\n\\n (bary.0 >= 0.0) && (bary.1 >= 0.0) && (bary.0 + bary.1 < 1.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 25,\n \"score\": 216400.82258233652\n },\n {\n \"content\": \"pub fn enum_prop_ident(\\n\\n variant_args: &args::VariantArgs,\\n\\n nth: usize,\\n\\n field: &args::FieldArgs,\\n\\n) -> Ident {\\n\\n let variant_ident = &variant_args.ident;\\n\\n let field_ident = self::field_ident(&variant_args.fields, nth, field);\\n\\n\\n\\n let ident = format!(\\\"{}_{}\\\", variant_ident, field_ident).to_case(Case::UpperSnake);\\n\\n syn::parse_str(&ident).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils/prop_keys.rs\",\n \"rank\": 26,\n \"score\": 216069.58946626307\n },\n {\n \"content\": \"pub fn create_ui(ui: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\\n\\n let debug_text;\\n\\n let progress_bar;\\n\\n let progress_text;\\n\\n let root = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(screen_size.x)\\n\\n .with_height(screen_size.y)\\n\\n .with_child({\\n\\n debug_text = TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0))\\n\\n .with_wrap(WrapMode::Word)\\n\\n .build(ui);\\n\\n debug_text\\n\\n })\\n\\n .with_child({\\n\\n progress_bar =\\n\\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ui);\\n\\n progress_bar\\n\\n })\\n\\n .with_child({\\n\",\n \"file_path\": \"examples/shared/mod.rs\",\n \"rank\": 27,\n \"score\": 215598.0793855338\n },\n {\n \"content\": \"pub fn gen_inspect_fn_body(\\n\\n field_prefix: FieldPrefix,\\n\\n field_args: &ast::Fields<args::FieldArgs>,\\n\\n) -> TokenStream2 {\\n\\n // `inspect` function body, consisting of a sequence of quotes\\n\\n let mut quotes = Vec::new();\\n\\n\\n\\n let props = field_args\\n\\n .fields\\n\\n .iter()\\n\\n // enumerate first, and then filter!\\n\\n .enumerate()\\n\\n .filter(|(_i, f)| !f.skip)\\n\\n .map(|(i, field)| self::quote_field_prop(&field_prefix, i, field, field_args.style));\\n\\n\\n\\n quotes.push(quote! {\\n\\n let mut props = Vec::new();\\n\\n #(props.push(#props);)*\\n\\n });\\n\\n\\n\\n // concatenate the quotes\\n\\n quote! {\\n\\n #(#quotes)*\\n\\n props\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils.rs\",\n \"rank\": 28,\n \"score\": 211950.22943305332\n },\n {\n \"content\": \"#[inline]\\n\\npub fn solve_quadratic(a: f32, b: f32, c: f32) -> Option<[f32; 2]> {\\n\\n let discriminant = b * b - 4.0 * a * c;\\n\\n if discriminant < 0.0 {\\n\\n // No real roots\\n\\n None\\n\\n } else {\\n\\n // Dont care if quadratic equation has only one root (discriminant == 0), this is edge-case\\n\\n // which requires additional branching instructions which is not good for branch-predictor in CPU.\\n\\n let _2a = 2.0 * a;\\n\\n let discr_root = discriminant.sqrt();\\n\\n let r1 = (-b + discr_root) / _2a;\\n\\n let r2 = (-b - discr_root) / _2a;\\n\\n Some([r1, r2])\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 29,\n \"score\": 211255.65715689037\n },\n {\n \"content\": \"// impl `#[derive(Visit)]` for `struct` or `enum`\\n\\npub fn impl_visit(ast: DeriveInput) -> TokenStream2 {\\n\\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\\n\\n match &ty_args.data {\\n\\n ast::Data::Struct(ref field_args) => self::impl_visit_struct(&ty_args, field_args),\\n\\n ast::Data::Enum(ref variants) => self::impl_visit_enum(&ty_args, variants),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/visit.rs\",\n \"rank\": 30,\n \"score\": 210793.8850863793\n },\n {\n \"content\": \"pub fn impl_inspect(ast: DeriveInput) -> TokenStream2 {\\n\\n let ty_args = args::TypeArgs::from_derive_input(&ast).unwrap();\\n\\n match &ty_args.data {\\n\\n ast::Data::Struct(ref field_args) => self::impl_inspect_struct(&ty_args, field_args),\\n\\n ast::Data::Enum(ref variant_args) => self::impl_inspect_enum(&ty_args, variant_args),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect.rs\",\n \"rank\": 31,\n \"score\": 210755.6453713467\n },\n {\n \"content\": \"pub trait Visit {\\n\\n fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult;\\n\\n}\\n\\n\\n\\nimpl Default for Visitor {\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Visitor {\\n\\n const MAGIC: &'static str = \\\"RG3D\\\";\\n\\n\\n\\n pub fn new() -> Self {\\n\\n let mut nodes = Pool::new();\\n\\n let root = nodes.spawn(Node::new(\\\"__ROOT__\\\", Handle::NONE));\\n\\n Self {\\n\\n nodes,\\n\\n rc_map: FxHashMap::default(),\\n\\n arc_map: FxHashMap::default(),\\n\",\n \"file_path\": \"fyrox-core/src/visitor.rs\",\n \"rank\": 32,\n \"score\": 209185.7760263767\n },\n {\n \"content\": \"pub fn read_ascii<R>(reader: &mut R) -> Result<FbxDocument, FbxError>\\n\\nwhere\\n\\n R: Read + Seek,\\n\\n{\\n\\n let mut nodes: Pool<FbxNode> = Pool::new();\\n\\n let root_handle = nodes.spawn(FbxNode {\\n\\n name: String::from(\\\"__ROOT__\\\"),\\n\\n children: Vec::new(),\\n\\n parent: Handle::NONE,\\n\\n attributes: Vec::new(),\\n\\n });\\n\\n let mut parent_handle: Handle<FbxNode> = root_handle;\\n\\n let mut node_handle: Handle<FbxNode> = Handle::NONE;\\n\\n let mut buffer: Vec<u8> = Vec::new();\\n\\n let mut name: Vec<u8> = Vec::new();\\n\\n let mut value: Vec<u8> = Vec::new();\\n\\n\\n\\n let buf_len = reader.seek(SeekFrom::End(0))?;\\n\\n reader.seek(SeekFrom::Start(0))?;\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/document/ascii.rs\",\n \"rank\": 33,\n \"score\": 208348.75453148456\n },\n {\n \"content\": \"pub fn read_binary<R>(file: &mut R) -> Result<FbxDocument, FbxError>\\n\\nwhere\\n\\n R: Read + Seek,\\n\\n{\\n\\n let total_length = file.seek(SeekFrom::End(0))?;\\n\\n file.seek(SeekFrom::Start(0))?;\\n\\n\\n\\n // Ignore all stuff until version.\\n\\n let mut temp = [0; 23];\\n\\n file.read_exact(&mut temp)?;\\n\\n\\n\\n // Verify version.\\n\\n let version = file.read_u32::<LittleEndian>()? as i32;\\n\\n\\n\\n // Anything else should be supported.\\n\\n if version < 7100 {\\n\\n return Err(FbxError::UnsupportedVersion(version));\\n\\n }\\n\\n\\n\\n let mut nodes = Pool::new();\\n\",\n \"file_path\": \"src/resource/fbx/document/binary.rs\",\n \"rank\": 34,\n \"score\": 208348.75453148456\n },\n {\n \"content\": \"#[allow(clippy::cast_ref_to_mut)] // See SAFETY block below\\n\\npub fn serialize_script(script: &Script) -> Result<Vec<u8>, VisitError> {\\n\\n let mut visitor = Visitor::new();\\n\\n\\n\\n let mut script_type_uuid = script.id();\\n\\n script_type_uuid.visit(\\\"TypeUuid\\\", &mut visitor)?;\\n\\n\\n\\n // SAFETY: It is guaranteed that visitor will **not** modify internal state of the object\\n\\n // if it is in \\\"write\\\" mode (serialization mode).\\n\\n let script = unsafe { &mut *(script as *const _ as *mut Script) };\\n\\n script.visit(\\\"ScriptData\\\", &mut visitor)?;\\n\\n\\n\\n visitor.save_binary_to_vec()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/scene/base.rs\",\n \"rank\": 35,\n \"score\": 207777.4256531689\n },\n {\n \"content\": \"#[inline]\\n\\npub fn cubicf(p0: f32, p1: f32, t: f32, m0: f32, m1: f32) -> f32 {\\n\\n let t2 = t * t;\\n\\n let t3 = t2 * t;\\n\\n let scale = (p1 - p0).abs();\\n\\n\\n\\n (2.0 * t3 - 3.0 * t2 + 1.0) * p0\\n\\n + (t3 - 2.0 * t2 + t) * m0 * scale\\n\\n + (-2.0 * t3 + 3.0 * t2) * p1\\n\\n + (t3 - t2) * m1 * scale\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 36,\n \"score\": 207649.49374144006\n },\n {\n \"content\": \"fn filtered_out(filter: &mut Option<Filter>, path: &Path) -> bool {\\n\\n match filter.as_mut() {\\n\\n Some(filter) => !filter.0.borrow_mut().deref_mut().lock().unwrap()(path),\\n\\n None => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-ui/src/file_browser.rs\",\n \"rank\": 37,\n \"score\": 206466.23598739374\n },\n {\n \"content\": \"#[inline]\\n\\npub fn spherical_to_cartesian(azimuth: f32, elevation: f32, radius: f32) -> Vector3<f32> {\\n\\n let x = radius * elevation.sin() * azimuth.sin();\\n\\n let y = radius * elevation.cos();\\n\\n let z = -radius * elevation.sin() * azimuth.cos();\\n\\n Vector3::new(x, y, z)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 38,\n \"score\": 205744.58054224588\n },\n {\n \"content\": \"#[inline]\\n\\npub fn inf_sup_cubicf(p0: f32, p1: f32, m0: f32, m1: f32) -> (f32, f32) {\\n\\n // Find two `t`s where derivative of cubicf is zero - these will be\\n\\n // extreme points of the spline. Then get the values at those `t`s\\n\\n let d = -(9.0 * p0 * p0 + 6.0 * p0 * (-3.0 * p1 + m1 + m0) + 9.0 * p1 * p1\\n\\n - 6.0 * p1 * (m1 + m0)\\n\\n + m1 * m1\\n\\n + m1 * m0\\n\\n + m0 * m0)\\n\\n .sqrt();\\n\\n let k = 3.0 * (2.0 * p0 - 2.0 * p1 + m1 + m0);\\n\\n let v = 3.0 * p0 - 3.0 * p1 + m1 + 2.0 * m0;\\n\\n let t0 = (-d + v) / k;\\n\\n let t1 = (d + v) / k;\\n\\n (cubicf(p0, p1, t0, m0, m1), cubicf(p0, p1, t1, m0, m1))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 39,\n \"score\": 205566.97124877863\n },\n {\n \"content\": \"#[inline]\\n\\npub fn cubicf_derivative(p0: f32, p1: f32, t: f32, m0: f32, m1: f32) -> f32 {\\n\\n let t2 = t * t;\\n\\n let scale = (p1 - p0).abs();\\n\\n\\n\\n (6.0 * t2 - 6.0 * t) * p0\\n\\n + (3.0 * t2 - 4.0 * t + 1.0) * m0 * scale\\n\\n + (6.0 * t - 6.0 * t2) * p1\\n\\n + (3.0 * t2 - 2.0 * t) * m1 * scale\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 40,\n \"score\": 205281.4038514658\n },\n {\n \"content\": \"#[inline]\\n\\npub fn triangle_area(a: Vector3<f32>, b: Vector3<f32>, c: Vector3<f32>) -> f32 {\\n\\n (b - a).cross(&(c - a)).norm() * 0.5\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 41,\n \"score\": 202449.4499076433\n },\n {\n \"content\": \"/// Serializes Option<Script> using given serializer.\\n\\npub fn visit_opt_script(\\n\\n name: &str,\\n\\n script: &mut Option<Script>,\\n\\n visitor: &mut Visitor,\\n\\n) -> VisitResult {\\n\\n let mut region = visitor.enter_region(name)?;\\n\\n\\n\\n let mut script_type_uuid = script.as_ref().map(|s| s.id()).unwrap_or_default();\\n\\n script_type_uuid.visit(\\\"TypeUuid\\\", &mut region)?;\\n\\n\\n\\n if region.is_reading() {\\n\\n *script = if script_type_uuid.is_nil() {\\n\\n None\\n\\n } else {\\n\\n let serialization_context = region\\n\\n .environment\\n\\n .as_ref()\\n\\n .and_then(|e| e.downcast_ref::<SerializationContext>())\\n\\n .expect(\\\"Visitor environment must contain serialization context!\\\");\\n\\n\\n\",\n \"file_path\": \"src/scene/base.rs\",\n \"rank\": 42,\n \"score\": 199499.37533775062\n },\n {\n \"content\": \"#[derive(Debug, Clone, Default, PartialEq, Visit)]\\n\\nstruct TupleStruct(f32, u32);\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/visit/basic.rs\",\n \"rank\": 43,\n \"score\": 198911.28309263694\n },\n {\n \"content\": \"#[inline]\\n\\npub fn vector_to_quat(vec: Vector3<f32>) -> UnitQuaternion<f32> {\\n\\n let dot = vec.normalize().dot(&Vector3::y());\\n\\n\\n\\n if dot.abs() > 1.0 - 10.0 * f32::EPSILON {\\n\\n // Handle singularity when vector is collinear with Y axis.\\n\\n UnitQuaternion::from_axis_angle(&Vector3::x_axis(), -dot.signum() * 90.0f32.to_radians())\\n\\n } else {\\n\\n UnitQuaternion::face_towards(&vec, &Vector3::y())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 44,\n \"score\": 198269.56064836675\n },\n {\n \"content\": \"/// `<prefix>field.visit(\\\"name\\\", visitor);`\\n\\npub fn create_field_visits<'a>(\\n\\n // None or `f` when bindings tuple variants. NOTE: We can't use `prefix: Ident`\\n\\n prefix: Option<Ident>,\\n\\n fields: impl Iterator<Item = &'a args::FieldArgs>,\\n\\n field_style: ast::Style,\\n\\n) -> Vec<TokenStream2> {\\n\\n if field_style == ast::Style::Unit {\\n\\n // `Unit` (struct/enum variant) has no field to visit.\\n\\n // We won't even enter this region:\\n\\n return vec![];\\n\\n }\\n\\n\\n\\n let visit_args = fields\\n\\n .filter(|field| !field.skip)\\n\\n .enumerate()\\n\\n .map(|(field_index, field)| {\\n\\n let (ident, name) = match field_style {\\n\\n // `NamedFields { a: f32, .. }`\\n\\n ast::Style::Struct => {\\n\\n let ident = field.ident.as_ref().unwrap_or_else(|| unreachable!());\\n\",\n \"file_path\": \"fyrox-core-derive/src/visit/utils.rs\",\n \"rank\": 45,\n \"score\": 194658.2991414101\n },\n {\n \"content\": \"/// A main trait for any scene graph node.\\n\\npub trait NodeTrait: BaseNodeTrait + Inspect + Visit {\\n\\n /// Allows a node to provide access to inner components.\\n\\n fn query_component_ref(&self, type_id: TypeId) -> Option<&dyn Any>;\\n\\n\\n\\n /// Allows a node to provide access to inner components.\\n\\n fn query_component_mut(&mut self, type_id: TypeId) -> Option<&mut dyn Any>;\\n\\n\\n\\n /// Returns axis-aligned bounding box in **local space** of the node.\\n\\n fn local_bounding_box(&self) -> AxisAlignedBoundingBox;\\n\\n\\n\\n /// Returns axis-aligned bounding box in **world space** of the node.\\n\\n ///\\n\\n /// # Important notes\\n\\n ///\\n\\n /// World bounding box will become valid **only** after first `update` call of the parent scene.\\n\\n /// It is because to calculate world bounding box we must get world transform first, but it\\n\\n /// can be calculated with a knowledge of parent world transform, so node on its own cannot know\\n\\n /// its world bounding box without additional information.\\n\\n fn world_bounding_box(&self) -> AxisAlignedBoundingBox;\\n\\n\\n\",\n \"file_path\": \"src/scene/node/mod.rs\",\n \"rank\": 46,\n \"score\": 193008.23399084838\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_farthest_point(points: &[Vector3<f32>], dir: Vector3<f32>) -> Vector3<f32> {\\n\\n let mut n_farthest = 0;\\n\\n let mut max_dot = -f32::MAX;\\n\\n for (i, point) in points.iter().enumerate() {\\n\\n let dot = dir.dot(point);\\n\\n if dot > max_dot {\\n\\n n_farthest = i;\\n\\n max_dot = dot\\n\\n }\\n\\n }\\n\\n points[n_farthest]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 47,\n \"score\": 192869.47372493875\n },\n {\n \"content\": \"pub fn print() -> Result<String, fmt::Error> {\\n\\n #[cfg(feature = \\\"enable_profiler\\\")]\\n\\n {\\n\\n let mut buffer = String::new();\\n\\n PROFILER.lock().unwrap().print(&mut buffer)?;\\n\\n Ok(buffer)\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\n {\\n\\n Ok(\\\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\\\".to_owned())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/profiler.rs\",\n \"rank\": 48,\n \"score\": 191466.30590384756\n },\n {\n \"content\": \"pub fn struct_prop_key_name(nth: usize, field: &args::FieldArgs) -> String {\\n\\n field.name.clone().unwrap_or_else(|| {\\n\\n let field_ident = match &field.ident {\\n\\n Some(ident) => quote!(#ident),\\n\\n None => {\\n\\n let nth_field = Index::from(nth);\\n\\n quote!(#nth_field)\\n\\n }\\n\\n };\\n\\n\\n\\n field_ident.to_string()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils/prop_keys.rs\",\n \"rank\": 49,\n \"score\": 190337.71696416056\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_signed_triangle_area(v1: Vector2<f32>, v2: Vector2<f32>, v3: Vector2<f32>) -> f32 {\\n\\n 0.5 * (v1.x * (v3.y - v2.y) + v2.x * (v1.y - v3.y) + v3.x * (v2.y - v1.y))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 50,\n \"score\": 189878.0912711945\n },\n {\n \"content\": \"#[inline]\\n\\npub fn m4x4_approx_eq(a: &Matrix4<f32>, b: &Matrix4<f32>) -> bool {\\n\\n a.iter()\\n\\n .zip(b.iter())\\n\\n .all(|(a, b)| (*a - *b).abs() <= 0.001)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use crate::algebra::Vector2;\\n\\n use crate::math::Rect;\\n\\n use crate::math::SmoothAngle;\\n\\n\\n\\n #[test]\\n\\n fn ray_rect_intersection() {\\n\\n let rect = Rect::new(0.0, 0.0, 10.0, 10.0);\\n\\n\\n\\n // Edge-case: Horizontal ray.\\n\\n assert!(super::ray_rect_intersection(\\n\\n rect,\\n\\n Vector2::new(-1.0, 5.0),\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 51,\n \"score\": 189860.37194676365\n },\n {\n \"content\": \"#[proc_macro_derive(Visit, attributes(visit))]\\n\\npub fn visit(input: TokenStream) -> TokenStream {\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n TokenStream::from(visit::impl_visit(ast))\\n\\n}\\n\\n\\n\\n/// Implements `Inspect` trait\\n\\n///\\n\\n/// User has to import `Inspect` and `PropertyInfo` to use this macro.\\n\",\n \"file_path\": \"fyrox-core-derive/src/lib.rs\",\n \"rank\": 52,\n \"score\": 189580.17783873732\n },\n {\n \"content\": \"#[proc_macro_derive(Inspect, attributes(inspect))]\\n\\npub fn inspect(input: TokenStream) -> TokenStream {\\n\\n let ast = parse_macro_input!(input as DeriveInput);\\n\\n TokenStream::from(inspect::impl_inspect(ast))\\n\\n}\\n\",\n \"file_path\": \"fyrox-core-derive/src/lib.rs\",\n \"rank\": 53,\n \"score\": 189579.61307213537\n },\n {\n \"content\": \"/// A value of a property.\\n\\npub trait PropertyValue: Any + Debug {\\n\\n /// Casts `self` to a `&dyn Any`\\n\\n fn as_any(&self) -> &dyn Any;\\n\\n}\\n\\n\\n\\nimpl<T: Debug + 'static> PropertyValue for T {\\n\\n fn as_any(&self) -> &dyn Any {\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\n/// An error that can occur during \\\"type casting\\\"\\n\\n#[derive(Debug)]\\n\\npub enum CastError {\\n\\n /// Given type does not match expected.\\n\\n TypeMismatch {\\n\\n /// A name of the property.\\n\\n property_name: String,\\n\\n\\n\\n /// Expected type identifier.\\n\",\n \"file_path\": \"fyrox-core/src/inspect.rs\",\n \"rank\": 54,\n \"score\": 186919.8168902071\n },\n {\n \"content\": \"pub fn print_hot_path() -> Result<String, fmt::Error> {\\n\\n #[cfg(feature = \\\"enable_profiler\\\")]\\n\\n {\\n\\n let mut buffer = String::new();\\n\\n PROFILER.lock().unwrap().print_hot_path(&mut buffer)?;\\n\\n Ok(buffer)\\n\\n }\\n\\n\\n\\n #[cfg(not(feature = \\\"enable_profiler\\\"))]\\n\\n {\\n\\n Ok(\\\"Performance profiling results are not available, because feature 'enable_profiler' wasn't defined!\\\".to_owned())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/profiler.rs\",\n \"rank\": 55,\n \"score\": 183865.8734392247\n },\n {\n \"content\": \"/// A trait for resource import options. It provides generic functionality shared over all types of import options.\\n\\npub trait ImportOptions: Serialize + DeserializeOwned + Default + Clone {\\n\\n /// Saves import options into a specified file.\\n\\n fn save(&self, path: &Path) -> bool {\\n\\n if let Ok(file) = File::create(path) {\\n\\n if ron::ser::to_writer_pretty(file, self, PrettyConfig::default()).is_ok() {\\n\\n return true;\\n\\n }\\n\\n }\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\\n/// Tries to load import settings for a resource. It is not part of ImportOptions trait because\\n\\n/// `async fn` is not yet supported for traits.\\n\\npub async fn try_get_import_settings<T>(resource_path: &Path) -> Option<T>\\n\\nwhere\\n\\n T: ImportOptions,\\n\\n{\\n\\n let settings_path = append_extension(resource_path, \\\"options\\\");\\n\\n\\n\",\n \"file_path\": \"src/engine/resource_manager/options.rs\",\n \"rank\": 56,\n \"score\": 183707.58079692227\n },\n {\n \"content\": \"#[test]\\n\\nfn inspect_default() {\\n\\n #[derive(Debug, Default, Inspect)]\\n\\n pub struct Data {\\n\\n the_field: String,\\n\\n another_field: f32,\\n\\n }\\n\\n\\n\\n let data = Data::default();\\n\\n\\n\\n let expected = vec![\\n\\n PropertyInfo {\\n\\n owner_type_id: TypeId::of::<Data>(),\\n\\n name: \\\"the_field\\\",\\n\\n display_name: \\\"The Field\\\",\\n\\n value: &data.the_field,\\n\\n ..default_prop()\\n\\n },\\n\\n PropertyInfo {\\n\\n owner_type_id: TypeId::of::<Data>(),\\n\\n name: \\\"another_field\\\",\\n\\n display_name: \\\"Another Field\\\",\\n\\n value: &data.another_field,\\n\\n ..default_prop()\\n\\n },\\n\\n ];\\n\\n\\n\\n assert_eq!(data.properties(), expected);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/inspect.rs\",\n \"rank\": 57,\n \"score\": 183675.52874505208\n },\n {\n \"content\": \"#[test]\\n\\nfn inspect_enum() {\\n\\n #[derive(Debug, Inspect)]\\n\\n pub struct NonCopy {\\n\\n inner: u32,\\n\\n }\\n\\n\\n\\n #[derive(Debug, Inspect)]\\n\\n pub enum Data {\\n\\n Named { x: u32, y: u32, z: NonCopy },\\n\\n Tuple(f32, f32),\\n\\n Unit,\\n\\n }\\n\\n\\n\\n let data = Data::Named {\\n\\n x: 0,\\n\\n y: 1,\\n\\n z: NonCopy { inner: 10 },\\n\\n };\\n\\n\\n\\n assert_eq!(\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/inspect.rs\",\n \"rank\": 58,\n \"score\": 183654.55169878746\n },\n {\n \"content\": \"#[test]\\n\\nfn inspect_struct() {\\n\\n #[derive(Debug, Default, Inspect)]\\n\\n struct Tuple(f32, f32);\\n\\n\\n\\n let x = Tuple::default();\\n\\n assert_eq!(\\n\\n x.properties(),\\n\\n vec![\\n\\n PropertyInfo {\\n\\n owner_type_id: TypeId::of::<Tuple>(),\\n\\n name: \\\"0\\\",\\n\\n display_name: \\\"0\\\",\\n\\n value: &x.0,\\n\\n ..default_prop()\\n\\n },\\n\\n PropertyInfo {\\n\\n owner_type_id: TypeId::of::<Tuple>(),\\n\\n name: \\\"1\\\",\\n\\n display_name: \\\"1\\\",\\n\\n value: &x.1,\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/inspect.rs\",\n \"rank\": 59,\n \"score\": 183578.6087412699\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_point_inside_triangle(p: &Vector3<f32>, vertices: &[Vector3<f32>; 3]) -> bool {\\n\\n let ba = vertices[1] - vertices[0];\\n\\n let ca = vertices[2] - vertices[0];\\n\\n let vp = *p - vertices[0];\\n\\n\\n\\n let ba_dot_ba = ba.dot(&ba);\\n\\n let ca_dot_ba = ca.dot(&ba);\\n\\n let ca_dot_ca = ca.dot(&ca);\\n\\n\\n\\n let dot02 = ca.dot(&vp);\\n\\n let dot12 = ba.dot(&vp);\\n\\n\\n\\n let inv_denom = 1.0 / (ca_dot_ca * ba_dot_ba - ca_dot_ba.powi(2));\\n\\n\\n\\n // Calculate barycentric coordinates\\n\\n let u = (ba_dot_ba * dot02 - ca_dot_ba * dot12) * inv_denom;\\n\\n let v = (ca_dot_ca * dot12 - ca_dot_ba * dot02) * inv_denom;\\n\\n\\n\\n (u >= 0.0) && (v >= 0.0) && (u + v < 1.0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 60,\n \"score\": 183235.011580481\n },\n {\n \"content\": \"fn default_prop() -> PropertyInfo<'static> {\\n\\n PropertyInfo {\\n\\n owner_type_id: TypeId::of::<()>(),\\n\\n name: \\\"\\\",\\n\\n display_name: \\\"\\\",\\n\\n value: &(),\\n\\n read_only: false,\\n\\n min_value: None,\\n\\n max_value: None,\\n\\n step: None,\\n\\n precision: None,\\n\\n description: \\\"\\\".to_string(),\\n\\n is_modified: false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/inspect.rs\",\n \"rank\": 61,\n \"score\": 181073.74793693214\n },\n {\n \"content\": \"fn arrange_dims(dims: &mut [GridDimension], final_size: f32) {\\n\\n let mut preset_width = 0.0;\\n\\n for dim in dims.iter() {\\n\\n if dim.size_mode == SizeMode::Auto || dim.size_mode == SizeMode::Strict {\\n\\n preset_width += dim.actual_size;\\n\\n }\\n\\n }\\n\\n\\n\\n let stretch_count = count_stretch_dims(dims);\\n\\n let avg_size = if stretch_count > 0 {\\n\\n (final_size - preset_width) / stretch_count as f32\\n\\n } else {\\n\\n 0.0\\n\\n };\\n\\n\\n\\n let mut location = 0.0;\\n\\n for dim in dims.iter_mut() {\\n\\n dim.location = location;\\n\\n location += match dim.size_mode {\\n\\n SizeMode::Strict | SizeMode::Auto => dim.actual_size,\\n\",\n \"file_path\": \"fyrox-ui/src/grid.rs\",\n \"rank\": 62,\n \"score\": 180921.4862426449\n },\n {\n \"content\": \"pub fn check(err_code: c_int) -> Result<(), SoundError> {\\n\\n if err_code < 0 {\\n\\n Err(SoundError::FailedToInitializeDevice(err_code_to_string(\\n\\n err_code,\\n\\n )))\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AlsaSoundDevice {\\n\\n pub fn new<F: FnMut(&mut [(f32, f32)]) + Send + 'static>(\\n\\n buffer_len_bytes: u32,\\n\\n callback: F,\\n\\n ) -> Result<Self, SoundError> {\\n\\n unsafe {\\n\\n let name = CString::new(\\\"default\\\").unwrap();\\n\\n // 16-bit stereo is 4 bytes, so frame count is bufferHalfSize / 4\\n\\n let frame_count = buffer_len_bytes / 4;\\n\\n let mut playback_device = std::ptr::null_mut();\\n\",\n \"file_path\": \"fyrox-sound/src/device/alsa.rs\",\n \"rank\": 63,\n \"score\": 180414.61506380164\n },\n {\n \"content\": \"#[inline]\\n\\n#[allow(clippy::useless_let_if_seq)]\\n\\npub fn classify_plane(normal: Vector3<f32>) -> PlaneClass {\\n\\n let mut longest = 0.0f32;\\n\\n let mut class = PlaneClass::XY;\\n\\n\\n\\n if normal.x.abs() > longest {\\n\\n longest = normal.x.abs();\\n\\n class = PlaneClass::YZ;\\n\\n }\\n\\n\\n\\n if normal.y.abs() > longest {\\n\\n longest = normal.y.abs();\\n\\n class = PlaneClass::XZ;\\n\\n }\\n\\n\\n\\n if normal.z.abs() > longest {\\n\\n class = PlaneClass::XY;\\n\\n }\\n\\n\\n\\n class\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 64,\n \"score\": 180124.71445008303\n },\n {\n \"content\": \"/// A trait that allows you to \\\"look inside\\\" an object that implements it. It is used for lightweight\\n\\n/// runtime read-only reflection. The most common use case for it is various editors.\\n\\n///\\n\\n/// It is not advised to manually implement this trait. You should use `#[derive(Inspect)]` whenever\\n\\n/// possible.\\n\\n///\\n\\n/// ## `#[derive(Inspect)]`\\n\\n///\\n\\n/// The proc macro reduces amount of boilerplate code to the minimum and significantly reduces a\\n\\n/// change of error.\\n\\n///\\n\\n/// ### Supported attributes\\n\\n///\\n\\n/// - `#[inspect(name = \\\"new_field_name\\\")]` - override field name.\\n\\n/// - `#[inspect(display_name = \\\"Human-readable Name\\\")]` - override display name.\\n\\n/// - `#[inspect(group = \\\"Group Name\\\")]` - override group name.\\n\\n/// - `#[inspect(expand)]` - extends the list of properties in case of composition, in other words it\\n\\n/// \\\"flattens\\\" and exposes the properties of an inner object. Useful when you have a structure that\\n\\n/// has some fields that are complex objects that implements `Inspect` too.\\n\\npub trait Inspect {\\n\\n /// Returns information about \\\"public\\\" properties.\\n\\n fn properties(&self) -> Vec<PropertyInfo<'_>>;\\n\\n}\\n\\n\\n\\nimpl<T: Inspect> Inspect for Option<T> {\\n\\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\\n\\n match self {\\n\\n Some(v) => v.properties(),\\n\\n None => vec![],\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Inspect> Inspect for Box<T> {\\n\\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\\n\\n (**self).properties()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/inspect.rs\",\n \"rank\": 65,\n \"score\": 177007.93701480556\n },\n {\n \"content\": \"pub fn cascade_size(base_size: usize, cascade: usize) -> usize {\\n\\n match cascade {\\n\\n 0 => base_size,\\n\\n 1 => (base_size / 2).max(1),\\n\\n 2 => (base_size / 4).max(1),\\n\\n _ => unreachable!(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/renderer/shadow/mod.rs\",\n \"rank\": 66,\n \"score\": 175553.20216718857\n },\n {\n \"content\": \"pub fn set_mesh_diffuse_color(mesh: &mut Mesh, color: Color) {\\n\\n for surface in mesh.surfaces() {\\n\\n surface\\n\\n .material()\\n\\n .lock()\\n\\n .set_property(\\n\\n &ImmutableString::new(\\\"diffuseColor\\\"),\\n\\n PropertyValue::Color(color),\\n\\n )\\n\\n .unwrap();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"editor/src/lib.rs\",\n \"rank\": 67,\n \"score\": 175273.34533649788\n },\n {\n \"content\": \"pub fn make_button(ctx: &mut BuildContext, arrow: ArrowDirection, row: usize) -> Handle<UiNode> {\\n\\n ButtonBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_margin(Thickness::right(1.0))\\n\\n .on_row(row),\\n\\n )\\n\\n .with_back(\\n\\n DecoratorBuilder::new(BorderBuilder::new(\\n\\n WidgetBuilder::new().with_foreground(Brush::Solid(Color::opaque(90, 90, 90))),\\n\\n ))\\n\\n .with_normal_brush(Brush::Solid(Color::opaque(60, 60, 60)))\\n\\n .with_hover_brush(Brush::Solid(Color::opaque(80, 80, 80)))\\n\\n .with_pressed_brush(Brush::Solid(Color::opaque(80, 118, 178)))\\n\\n .build(ctx),\\n\\n )\\n\\n .with_content(make_arrow(ctx, arrow, 6.0))\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\\nimpl<T: NumericType> NumericUpDownBuilder<T> {\\n\",\n \"file_path\": \"fyrox-ui/src/numeric.rs\",\n \"rank\": 68,\n \"score\": 174917.34905506263\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_closest_point<P: PositionProvider>(points: &[P], point: Vector3<f32>) -> Option<usize> {\\n\\n let mut closest_sqr_distance = f32::MAX;\\n\\n let mut closest_index = None;\\n\\n for (i, vertex) in points.iter().enumerate() {\\n\\n let sqr_distance = (vertex.position() - point).norm_squared();\\n\\n if sqr_distance < closest_sqr_distance {\\n\\n closest_sqr_distance = sqr_distance;\\n\\n closest_index = Some(i);\\n\\n }\\n\\n }\\n\\n closest_index\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 69,\n \"score\": 174876.42682181182\n },\n {\n \"content\": \"fn calculate_decay(len: usize, sample_rate: u32, decay_time: Duration) -> f32 {\\n\\n let time_len = len as f32 / sample_rate as f32;\\n\\n // Asymptotically goes to 1.0 by exponential law\\n\\n DB60.powf(time_len / decay_time.as_secs_f32())\\n\\n}\\n\\n\\n\\nimpl ChannelReverb {\\n\\n /// Filter lengths given in samples\\n\\n const COMB_LENGTHS: [usize; 8] = [1557, 1617, 1491, 1422, 1277, 1356, 1188, 1116];\\n\\n const ALLPASS_LENGTHS: [usize; 4] = [225, 556, 441, 341];\\n\\n\\n\\n fn new(stereo_spread: u32, fc: f32, feedback: f32) -> Self {\\n\\n Self {\\n\\n fc,\\n\\n stereo_spread,\\n\\n sample_rate: DESIGN_SAMPLE_RATE,\\n\\n lp_fb_comb_filters: Self::COMB_LENGTHS\\n\\n .iter()\\n\\n .map(|len| LpfComb::new(*len + stereo_spread as usize, fc, feedback))\\n\\n .collect(),\\n\",\n \"file_path\": \"fyrox-sound/src/effects/reverb.rs\",\n \"rank\": 70,\n \"score\": 174433.3389550181\n },\n {\n \"content\": \"pub fn enum_prop_key_name(nth: usize, field: &args::FieldArgs, v: &args::VariantArgs) -> String {\\n\\n field.name.clone().unwrap_or_else(|| {\\n\\n let field_ident = match &field.ident {\\n\\n Some(ident) => quote!(#ident),\\n\\n None => {\\n\\n let nth_field = Index::from(nth);\\n\\n quote!(#nth_field)\\n\\n }\\n\\n };\\n\\n\\n\\n format!(\\\"{}.{}\\\", v.ident, field_ident)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils/prop_keys.rs\",\n \"rank\": 71,\n \"score\": 173301.9339828051\n },\n {\n \"content\": \"pub fn send_sync_message(ui: &UserInterface, mut msg: UiMessage) {\\n\\n msg.flags = MSG_SYNC_FLAG;\\n\\n ui.send_message(msg);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"editor/src/lib.rs\",\n \"rank\": 72,\n \"score\": 172027.9563960628\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\\n\\n let debug_text;\\n\\n let progress_bar;\\n\\n let progress_text;\\n\\n let root = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(screen_size.x)\\n\\n .with_height(screen_size.y)\\n\\n .with_child({\\n\\n debug_text =\\n\\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\\n\\n debug_text\\n\\n })\\n\\n .with_child({\\n\\n progress_bar =\\n\\n ProgressBarBuilder::new(WidgetBuilder::new().on_row(1).on_column(1)).build(ctx);\\n\\n progress_bar\\n\\n })\\n\\n .with_child({\\n\\n progress_text = TextBuilder::new(\\n\",\n \"file_path\": \"examples/async.rs\",\n \"rank\": 73,\n \"score\": 171668.41956772836\n },\n {\n \"content\": \"fn create_ui(ctx: &mut BuildContext, screen_size: Vector2<f32>) -> Interface {\\n\\n let debug_text;\\n\\n let progress_bar;\\n\\n let progress_text;\\n\\n let cancel;\\n\\n let progress_grid;\\n\\n let root = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_width(screen_size.x)\\n\\n .with_height(screen_size.y)\\n\\n .with_child({\\n\\n debug_text =\\n\\n TextBuilder::new(WidgetBuilder::new().on_row(0).on_column(0)).build(ctx);\\n\\n debug_text\\n\\n })\\n\\n .with_child({\\n\\n progress_grid = GridBuilder::new(\\n\\n WidgetBuilder::new()\\n\\n .with_visibility(!Path::new(LIGHTMAP_SCENE_PATH).exists())\\n\\n .on_column(1)\\n\",\n \"file_path\": \"examples/lightmap.rs\",\n \"rank\": 74,\n \"score\": 171668.41956772836\n },\n {\n \"content\": \"/// `impl Inspect`\\n\\nfn inspect_trait_impl<'f>(\\n\\n ty_args: &args::TypeArgs,\\n\\n field_args: impl Iterator<Item = &'f args::FieldArgs>,\\n\\n impl_body: TokenStream2,\\n\\n) -> TokenStream2 {\\n\\n let ty_ident = &ty_args.ident;\\n\\n let generics = self::impl_inspect_generics(&ty_args.generics, field_args);\\n\\n let (impl_generics, ty_generics, where_clause) = generics.split_for_impl();\\n\\n\\n\\n quote! {\\n\\n impl #impl_generics Inspect for #ty_ident #ty_generics #where_clause {\\n\\n fn properties(&self) -> Vec<PropertyInfo<'_>> {\\n\\n #impl_body\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils.rs\",\n \"rank\": 75,\n \"score\": 170941.83122578816\n },\n {\n \"content\": \"/// Creates `Generic` for `impl Inspect` block\\n\\n///\\n\\n/// TODO: Add `where Field: Inspect` boundaries to support inspectable types with generics\\n\\nfn impl_inspect_generics<'a>(\\n\\n generics: &Generics,\\n\\n _field_args: impl Iterator<Item = &'a args::FieldArgs>,\\n\\n) -> Generics {\\n\\n generics.clone()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils.rs\",\n \"rank\": 76,\n \"score\": 170941.69954393286\n },\n {\n \"content\": \"/// https://en.wikipedia.org/wiki/Smoothstep\\n\\nfn smoothstep(edge0: f32, edge1: f32, x: f32) -> f32 {\\n\\n let k = ((x - edge0) / (edge1 - edge0)).max(0.0).min(1.0);\\n\\n k * k * (3.0 - 2.0 * k)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/lightmap.rs\",\n \"rank\": 77,\n \"score\": 170756.00760839568\n },\n {\n \"content\": \"pub fn struct_prop_ident(ty_args: &args::TypeArgs, nth: usize, field: &args::FieldArgs) -> Ident {\\n\\n let fields = match &ty_args.data {\\n\\n ast::Data::Struct(xs) => xs,\\n\\n _ => unreachable!(),\\n\\n };\\n\\n let field_ident = self::field_ident(fields, nth, field);\\n\\n\\n\\n let ident = field_ident.to_case(Case::UpperSnake);\\n\\n syn::parse_str(&ident).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils/prop_keys.rs\",\n \"rank\": 78,\n \"score\": 170057.6079615977\n },\n {\n \"content\": \"/// `pub const [VARIANT_]FIELD: &'static str = \\\"key\\\";`\\n\\npub fn prop_keys_impl(ty_args: &args::TypeArgs) -> TokenStream2 {\\n\\n let ty_ident = &ty_args.ident;\\n\\n let (impl_generics, ty_generics, where_clause) = ty_args.generics.split_for_impl();\\n\\n\\n\\n let prop_keys = self::quote_prop_keys(ty_args);\\n\\n\\n\\n quote! {\\n\\n /// Property key constants\\n\\n impl #impl_generics #ty_ident #ty_generics #where_clause {\\n\\n #prop_keys\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/inspect/utils/prop_keys.rs\",\n \"rank\": 79,\n \"score\": 169362.216572196\n },\n {\n \"content\": \"pub fn make_status_enum_editor_definition() -> EnumPropertyEditorDefinition<Status> {\\n\\n EnumPropertyEditorDefinition {\\n\\n variant_generator: |i| match i {\\n\\n 0 => Status::Stopped,\\n\\n 1 => Status::Playing,\\n\\n 2 => Status::Paused,\\n\\n _ => unreachable!(),\\n\\n },\\n\\n index_generator: |v| *v as usize,\\n\\n names_generator: || {\\n\\n vec![\\n\\n \\\"Stopped\\\".to_string(),\\n\\n \\\"Playing\\\".to_string(),\\n\\n \\\"Paused\\\".to_string(),\\n\\n ]\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"editor/src/inspector/editors/mod.rs\",\n \"rank\": 80,\n \"score\": 169293.58221961837\n },\n {\n \"content\": \"pub fn make_save_file_selector(ctx: &mut BuildContext) -> Handle<UiNode> {\\n\\n FileSelectorBuilder::new(\\n\\n WindowBuilder::new(WidgetBuilder::new().with_width(300.0).with_height(400.0))\\n\\n .with_title(WindowTitle::Text(\\\"Save Scene As\\\".into()))\\n\\n .open(false),\\n\\n )\\n\\n .with_mode(FileBrowserMode::Save {\\n\\n default_file_name: PathBuf::from(\\\"unnamed.rgs\\\"),\\n\\n })\\n\\n .with_path(\\\"./\\\")\\n\\n .with_filter(make_scene_file_filter())\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\\npub enum Mode {\\n\\n Edit,\\n\\n Play {\\n\\n // Play mode scene.\\n\\n scene: Handle<Scene>,\\n\\n // List of scenes that existed before entering play mode.\\n\",\n \"file_path\": \"editor/src/lib.rs\",\n \"rank\": 81,\n \"score\": 168969.78040602052\n },\n {\n \"content\": \"fn stepf(p0: f32, p1: f32, t: f32) -> f32 {\\n\\n if t.eq(&1.0) {\\n\\n p1\\n\\n } else {\\n\\n p0\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Visit, Clone, Debug, PartialEq)]\\n\\npub enum CurveKeyKind {\\n\\n Constant,\\n\\n Linear,\\n\\n Cubic {\\n\\n /// A `tan(angle)` of left tangent.\\n\\n left_tangent: f32,\\n\\n /// A `tan(angle)` of right tangent.\\n\\n right_tangent: f32,\\n\\n },\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/curve.rs\",\n \"rank\": 82,\n \"score\": 168505.10573211557\n },\n {\n \"content\": \"#[inline]\\n\\npub fn quat_from_euler<T: SimdRealField + RealField + Copy + Clone>(\\n\\n euler_radians: Vector3<T>,\\n\\n order: RotationOrder,\\n\\n) -> UnitQuaternion<T> {\\n\\n let qx = UnitQuaternion::from_axis_angle(&Vector3::x_axis(), euler_radians.x);\\n\\n let qy = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), euler_radians.y);\\n\\n let qz = UnitQuaternion::from_axis_angle(&Vector3::z_axis(), euler_radians.z);\\n\\n match order {\\n\\n RotationOrder::XYZ => qz * qy * qx,\\n\\n RotationOrder::XZY => qy * qz * qx,\\n\\n RotationOrder::YZX => qx * qz * qy,\\n\\n RotationOrder::YXZ => qz * qx * qy,\\n\\n RotationOrder::ZXY => qy * qx * qz,\\n\\n RotationOrder::ZYX => qx * qy * qz,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core/src/math/mod.rs\",\n \"rank\": 83,\n \"score\": 166354.93018932937\n },\n {\n \"content\": \"fn create_float_view(ctx: &mut BuildContext, value: f32) -> Handle<UiNode> {\\n\\n NumericUpDownBuilder::new(WidgetBuilder::new().with_height(24.0))\\n\\n .with_value(value)\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"editor/src/material.rs\",\n \"rank\": 84,\n \"score\": 165359.94638727698\n },\n {\n \"content\": \"/// Calculates distance attenuation for a point using given distance to the point and\\n\\n/// radius of a light.\\n\\nfn distance_attenuation(distance: f32, sqr_radius: f32) -> f32 {\\n\\n let attenuation = (1.0 - distance * distance / sqr_radius).max(0.0).min(1.0);\\n\\n attenuation * attenuation\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils/lightmap.rs\",\n \"rank\": 85,\n \"score\": 165269.06429607308\n },\n {\n \"content\": \"fn round_to_step(x: f32, step: f32) -> f32 {\\n\\n x - x % step\\n\\n}\\n\\n\\n\\nimpl CurveEditor {\\n\\n fn update_matrices(&self) {\\n\\n let vp = Vector2::new(self.view_position.x, -self.view_position.y);\\n\\n self.view_matrix.set(\\n\\n Matrix3::new_nonuniform_scaling_wrt_point(\\n\\n &Vector2::new(self.zoom, self.zoom),\\n\\n &Point2::from(self.actual_size().scale(0.5)),\\n\\n ) * Matrix3::new_translation(&vp),\\n\\n );\\n\\n\\n\\n let screen_bounds = self.screen_bounds();\\n\\n self.screen_matrix.set(\\n\\n Matrix3::new_translation(&screen_bounds.position)\\n\\n // Flip Y because in math origin is in lower left corner.\\n\\n * Matrix3::new_translation(&Vector2::new(0.0, screen_bounds.h()))\\n\\n * Matrix3::new_nonuniform_scaling(&Vector2::new(1.0, -1.0))\\n\",\n \"file_path\": \"fyrox-ui/src/curve/mod.rs\",\n \"rank\": 86,\n \"score\": 165263.3817046283\n },\n {\n \"content\": \"pub fn make_arrow_primitives(orientation: ArrowDirection, size: f32) -> Vec<Primitive> {\\n\\n vec![match orientation {\\n\\n ArrowDirection::Top => Primitive::Triangle {\\n\\n points: [\\n\\n Vector2::new(size * 0.5, 0.0),\\n\\n Vector2::new(size, size),\\n\\n Vector2::new(0.0, size),\\n\\n ],\\n\\n },\\n\\n ArrowDirection::Bottom => Primitive::Triangle {\\n\\n points: [\\n\\n Vector2::new(0.0, 0.0),\\n\\n Vector2::new(size, 0.0),\\n\\n Vector2::new(size * 0.5, size),\\n\\n ],\\n\\n },\\n\\n ArrowDirection::Right => Primitive::Triangle {\\n\\n points: [\\n\\n Vector2::new(0.0, 0.0),\\n\\n Vector2::new(size, size * 0.5),\\n\",\n \"file_path\": \"fyrox-ui/src/utils.rs\",\n \"rank\": 87,\n \"score\": 164654.38030701096\n },\n {\n \"content\": \"/// A samples generator.\\n\\n///\\n\\n/// # Notes\\n\\n///\\n\\n/// Iterator implementation (the `next()` method) must produce samples in interleaved format, this\\n\\n/// means that samples emitted by the method should be in `LRLRLR..` order, where `L` and `R` are\\n\\n/// samples from left and right channels respectively. The sound engine supports both mono and\\n\\n/// stereo sample sources.\\n\\npub trait RawStreamingDataSource: Iterator<Item = f32> + Send + Sync + Debug {\\n\\n /// Should return sample rate of the source.\\n\\n fn sample_rate(&self) -> usize;\\n\\n\\n\\n /// Should return total channel count.\\n\\n fn channel_count(&self) -> usize;\\n\\n\\n\\n /// Tells whether the provider should restart.\\n\\n fn rewind(&mut self) -> Result<(), SoundError> {\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// Allows you to start playback from given duration.\\n\\n fn time_seek(&mut self, _duration: Duration) {}\\n\\n\\n\\n /// Returns total duration of data. Can be `None` if internal decoder does not supports seeking.\\n\\n fn duration(&self) -> Option<Duration> {\\n\\n None\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"fyrox-sound/src/buffer/mod.rs\",\n \"rank\": 88,\n \"score\": 164545.13312724064\n },\n {\n \"content\": \"#[test]\\n\\nfn complex_enum() {\\n\\n let mut data = ComplexEnum::Tuple(100, 200);\\n\\n let mut data_default = ComplexEnum::UnitVariant;\\n\\n\\n\\n super::save_load(\\\"complex_enum\\\", &mut data, &mut data_default);\\n\\n\\n\\n assert_eq!(data, data_default);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/visit/basic.rs\",\n \"rank\": 89,\n \"score\": 164284.18039235426\n },\n {\n \"content\": \"#[test]\\n\\nfn generic_enum() {\\n\\n #[derive(Debug)]\\n\\n struct NotVisit;\\n\\n\\n\\n #[allow(warnings)]\\n\\n let mut not_compile = GenericEnum::Tuple(1, vec![NotVisit]);\\n\\n\\n\\n // Compile error because `Generics<NotVisit> is not `Visit`:\\n\\n // let mut visitor = Visitor::new();\\n\\n // not_compile.visit(\\\"Data\\\", &mut visitor).unwrap();\\n\\n\\n\\n let mut data = GenericEnum::Tuple(1, vec![100u32]);\\n\\n let mut data_default = GenericEnum::UnitVariant;\\n\\n\\n\\n super::save_load(\\\"generic_enum\\\", &mut data, &mut data_default);\\n\\n\\n\\n assert_eq!(data, data_default);\\n\\n}\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/visit/basic.rs\",\n \"rank\": 90,\n \"score\": 164284.18039235426\n },\n {\n \"content\": \"#[test]\\n\\nfn plain_enum() {\\n\\n let mut data = PlainEnum::C;\\n\\n let mut data_default = PlainEnum::A;\\n\\n\\n\\n super::save_load(\\\"plain_enum\\\", &mut data, &mut data_default);\\n\\n\\n\\n assert_eq!(data, data_default);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/visit/basic.rs\",\n \"rank\": 91,\n \"score\": 164284.18039235426\n },\n {\n \"content\": \"#[test]\\n\\nfn unit_struct() {\\n\\n let mut data = UnitStruct;\\n\\n let mut data_default = UnitStruct;\\n\\n\\n\\n // non seuse.. but anyways,\\n\\n // `Visit` is implemented `UnitStruct;` as empty code block `{}`\\n\\n super::save_load(\\\"unit_struct\\\", &mut data, &mut data_default);\\n\\n\\n\\n assert_eq!(data, data_default);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/visit/basic.rs\",\n \"rank\": 92,\n \"score\": 164210.9819747652\n },\n {\n \"content\": \"#[test]\\n\\nfn tuple_struct() {\\n\\n let mut data = TupleStruct(10.0, 20);\\n\\n let mut data_default = TupleStruct(0.0, 0);\\n\\n\\n\\n super::save_load(\\\"tuple_struct\\\", &mut data, &mut data_default);\\n\\n\\n\\n assert_eq!(data, data_default);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/tests/it/visit/basic.rs\",\n \"rank\": 93,\n \"score\": 164210.9819747652\n },\n {\n \"content\": \"fn heuristic(a: Vector3<f32>, b: Vector3<f32>) -> f32 {\\n\\n (a - b).norm_squared()\\n\\n}\\n\\n\\n\\nimpl Default for PathFinder {\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PositionProvider for PathVertex {\\n\\n fn position(&self) -> Vector3<f32> {\\n\\n self.position\\n\\n }\\n\\n}\\n\\n\\n\\n/// Path search can be interrupted by errors, this enum stores all possible\\n\\n/// kinds of errors.\\n\\n#[derive(Clone, Debug, thiserror::Error)]\\n\\npub enum PathError {\\n\",\n \"file_path\": \"src/utils/astar.rs\",\n \"rank\": 94,\n \"score\": 163964.4815468832\n },\n {\n \"content\": \"fn read_string<R>(file: &mut R) -> Result<FbxAttribute, FbxError>\\n\\nwhere\\n\\n R: Read,\\n\\n{\\n\\n let length = file.read_u32::<LittleEndian>()? as usize;\\n\\n let mut raw_string = vec![Default::default(); length];\\n\\n file.read_exact(raw_string.as_mut_slice())?;\\n\\n // Find null terminator. It is required because for some reason some strings\\n\\n // have additional data after null terminator like this: Omni004\\\\x0\\\\x1Model, but\\n\\n // length still more than position of null terminator.\\n\\n if let Some(null_terminator_pos) = raw_string.iter().position(|c| *c == 0) {\\n\\n raw_string.truncate(null_terminator_pos);\\n\\n }\\n\\n let string = String::from_utf8(raw_string)?;\\n\\n Ok(FbxAttribute::String(string))\\n\\n}\\n\\n\\n\\nconst VERSION_7500: i32 = 7500;\\n\\nconst VERSION_7500_NULLREC_SIZE: usize = 25; // in bytes\\n\\nconst NORMAL_NULLREC_SIZE: usize = 13; // in bytes\\n\\n\\n\",\n \"file_path\": \"src/resource/fbx/document/binary.rs\",\n \"rank\": 95,\n \"score\": 162730.3168023643\n },\n {\n \"content\": \"fn distance_scale_factor(fov: f32) -> f32 {\\n\\n fov.tan() * 0.1\\n\\n}\\n\\n\\n\\n/// Helper enum to be able to access interaction modes in array directly.\\n\\n#[derive(Copy, Clone, PartialOrd, PartialEq, Hash, Debug)]\\n\\n#[repr(usize)]\\n\\npub enum InteractionModeKind {\\n\\n Select = 0,\\n\\n Move = 1,\\n\\n Scale = 2,\\n\\n Rotate = 3,\\n\\n Navmesh = 4,\\n\\n Terrain = 5,\\n\\n}\\n\",\n \"file_path\": \"editor/src/interaction/mod.rs\",\n \"rank\": 96,\n \"score\": 161548.8063743718\n },\n {\n \"content\": \"fn create_impl_generics(\\n\\n generics: &Generics,\\n\\n field_args: impl Iterator<Item = args::FieldArgs>,\\n\\n) -> Generics {\\n\\n let mut generics = generics.clone();\\n\\n\\n\\n // Add where clause for every visited field\\n\\n generics.make_where_clause().predicates.extend(\\n\\n field_args\\n\\n .filter(|f| !f.skip)\\n\\n .map(|f| f.ty)\\n\\n .map::<WherePredicate, _>(|ty| parse_quote! { #ty: Visit }),\\n\\n );\\n\\n\\n\\n generics\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-core-derive/src/visit/utils.rs\",\n \"rank\": 97,\n \"score\": 159794.54306873365\n },\n {\n \"content\": \"pub fn make_property_margin(layer_index: usize) -> Thickness {\\n\\n let mut margin = HEADER_MARGIN;\\n\\n margin.left += 10.0 + layer_index as f32 * 10.0;\\n\\n margin\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fyrox-ui/src/inspector/mod.rs\",\n \"rank\": 98,\n \"score\": 159132.58594986683\n },\n {\n \"content\": \"fn create_vec2_view(ctx: &mut BuildContext, value: Vector2<f32>) -> Handle<UiNode> {\\n\\n Vec2EditorBuilder::new(WidgetBuilder::new().with_height(24.0))\\n\\n .with_value(value)\\n\\n .build(ctx)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"editor/src/material.rs\",\n \"rank\": 99,\n \"score\": 158687.28931239547\n }\n]","isConversational":false}}},{"rowIdx":2984,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"vm-bindings/build_support/builder.rs"},"repo_name":{"kind":"string","value":"feenkcom/gtoolkit-vm"},"commit":{"kind":"string","value":"0647fe53203d614d776cb5af4f228cddc4a5f29d"},"file_code":{"kind":"string","value":"use file_matcher::{FileNamed, OneEntry, OneEntryCopier};\nuse std::fmt::Debug;\nuse std::path::{Path, PathBuf};\nuse std::{env, fmt, fs};\n\nconst VM_CLIENT_VMMAKER_VM_VAR: &str = \"VM_CLIENT_VMMAKER\";\nconst VM_CLIENT_VMMAKER_IMAGE_VAR: &str = \"VM_CLIENT_VMMAKER_IMAGE\";\n\npub trait Builder: Debug {\n fn is_compiled(&self) -> bool {\n self.vm_binary().exists()\n }\n\n fn profile(&self) -> String {\n std::env::var(\"PROFILE\").unwrap()\n }\n\n fn is_debug(&self) -> bool {\n self.profile() == \"debug\"\n }\n\n fn ensure_build_tools(&self) {}\n\n fn vmmaker_vm(&self) -> Option<PathBuf> {\n std::env::var(VM_CLIENT_VMMAKER_VM_VAR).map_or(None, |path| {\n let path = Path::new(&path);\n if path.exists() {\n Some(path.to_path_buf())\n } else {\n panic!(\n \"Specified {} does not exist: {}\",\n VM_CLIENT_VMMAKER_VM_VAR,\n path.display()\n );\n }\n })\n }\n\n fn vmmaker_image(&self) -> Option<PathBuf> {\n std::env::var(VM_CLIENT_VMMAKER_IMAGE_VAR).map_or(None, |path| {\n let path = Path::new(&path);\n if path.exists() {\n Some(path.to_path_buf())\n } else {\n panic!(\n \"Specified {} does not exist: {}\",\n VM_CLIENT_VMMAKER_IMAGE_VAR,\n path.display()\n );\n }\n })\n }\n\n fn output_directory(&self) -> PathBuf {\n Path::new(env::var(\"OUT_DIR\").unwrap().as_str()).to_path_buf()\n }\n\n \n \n fn vm_binary(&self) -> PathBuf;\n\n fn vm_sources_directory(&self) -> PathBuf {\n std::env::current_dir()\n .unwrap()\n .parent()\n .unwrap()\n .to_path_buf()\n .join(\"opensmalltalk-vm\")\n }\n\n fn compiled_libraries_directory(&self) -> PathBuf;\n\n fn exported_libraries_directory(&self) -> PathBuf {\n let target = std::env::var(\"CARGO_TARGET\");\n let mut path = PathBuf::new()\n .join(\"..\")\n .join(std::env::var(\"CARGO_TARGET_DIR\").unwrap_or(\"target\".to_string()));\n\n if let Ok(target) = target {\n path = path.join(target);\n }\n\n path.join(self.profile()).join(\"shared_libraries\")\n }\n\n fn compile_sources(&self);\n\n fn squeak_include_directory(&self) -> PathBuf {\n self.vm_sources_directory()\n .join(\"extracted\")\n .join(\"vm\")\n .join(\"include\")\n }\n\n fn common_include_directory(&self) -> PathBuf {\n self.squeak_include_directory().join(\"common\")\n }\n\n fn platform_include_directory(&self) -> PathBuf;\n\n fn generated_config_directory(&self) -> PathBuf {\n self.output_directory()\n .join(\"build\")\n .join(\"build\")\n .join(\"include\")\n .join(\"pharovm\")\n }\n\n fn generated_include_directory(&self) -> PathBuf {\n self.output_directory()\n .join(\"build\")\n .join(\"generated\")\n .join(\"64\")\n .join(\"vm\")\n .join(\"include\")\n }\n\n fn generate_bindings(&self) {\n let include_dir = self.vm_sources_directory().join(\"include\");\n\n let generated_vm_include_dir = self.generated_include_directory();\n assert!(\n generated_vm_include_dir.exists(),\n \"Generated vm include directory must exist: {:?}\",\n generated_vm_include_dir.display()\n );\n\n let generated_config_directory = self.generated_config_directory();\n assert!(\n generated_config_directory.exists(),\n \"Generated config.h directory must exist: {:?}\",\n generated_config_directory.display()\n );\n\n let bindings = bindgen::Builder::default()\n .whitelist_function(\"vm_.*\")\n .whitelist_function(\"free\")\n .header(\n include_dir\n .join(\"pharovm\")\n .join(\"pharoClient.h\")\n .display()\n .to_string(),\n )\n .clang_arg(format!(\"-I{}\", &include_dir.display()))\n .clang_arg(format!(\"-I{}\", &include_dir.join(\"pharovm\").display()))\n .clang_arg(format!(\"-I{}\", generated_config_directory.display()))\n .clang_arg(format!(\"-I{}\", generated_vm_include_dir.display()))\n .clang_arg(format!(\"-I{}\", self.common_include_directory().display()))\n .clang_arg(format!(\"-I{}\", self.platform_include_directory().display()))\n .clang_arg(\"-DLSB_FIRST=1\")\n \n \n .parse_callbacks(Box::new(bindgen::CargoCallbacks))\n \n .generate()\n \n .expect(\"Unable to generate bindings\");\n\n \n bindings\n .write_to_file(self.output_directory().join(\"bindings.rs\"))\n .expect(\"Couldn't write bindings!\");\n }\n\n fn link_libraries(&self);\n\n fn export_shared_libraries(&self) {\n if !self.exported_libraries_directory().exists() {\n fs::create_dir_all(self.exported_libraries_directory()).unwrap();\n }\n\n for shared_library in self.shared_libraries_to_export() {\n let target = self.exported_libraries_directory();\n match shared_library.copy(&target) {\n Ok(_) => {}\n Err(error) => {\n panic!(\n \"Could not copy {:?} to {} due to {}\",\n &shared_library,\n &target.display(),\n error\n )\n }\n }\n }\n }\n\n fn shared_libraries_to_export(&self) -> Vec<OneEntry>;\n\n fn print_directories(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n f.debug_map()\n .entry(&\"is_compiled\".to_string(), &self.is_compiled())\n .entry(\n &\"output_directory\".to_string(),\n &self.output_directory().display(),\n )\n .entry(&\"vm_binary\".to_string(), &self.vm_binary().display())\n .entry(\n &\"vm_sources_directory\".to_string(),\n &self.vm_sources_directory().display(),\n )\n .entry(\n &\"compiled_libraries_directory\".to_string(),\n &self.compiled_libraries_directory().display(),\n )\n .entry(\n &\"exported_libraries_directory\".to_string(),\n &self.exported_libraries_directory().display(),\n )\n .finish()\n }\n\n fn boxed(self) -> Box<dyn Builder>;\n\n fn filenames_from_libdir(&self, filenames: Vec<&str>, libdir: PathBuf) -> Vec<OneEntry> {\n filenames\n .into_iter()\n .map(FileNamed::exact)\n .map(|each| each.within(&libdir))\n .collect()\n }\n}\n"},"prefix":{"kind":"string","value":"use file_matcher::{FileNamed, OneEntry, OneEntryCopier};\nuse std::fmt::Debug;\nuse std::path::{Path, PathBuf};\nuse std::{env, fmt, fs};\n\nconst VM_CLIENT_VMMAKER_VM_VAR: &str = \"VM_CLIENT_VMMAKER\";\nconst VM_CLIENT_VMMAKER_IMAGE_VAR: &str = \"VM_CLIENT_VMMAKER_IMAGE\";\n\npub trait Builder: Debug {\n fn is_compiled(&self) -> bool {\n self.vm_binary().exists()\n }\n\n fn profile(&self) -> String {\n std::env::var(\"PROFILE\").un"},"suffix":{"kind":"string","value":"(), &self.is_compiled())\n .entry(\n &\"output_directory\".to_string(),\n &self.output_directory().display(),\n )\n .entry(&\"vm_binary\".to_string(), &self.vm_binary().display())\n .entry(\n &\"vm_sources_directory\".to_string(),\n &self.vm_sources_directory().display(),\n )\n .entry(\n &\"compiled_libraries_directory\".to_string(),\n &self.compiled_libraries_directory().display(),\n )\n .entry(\n &\"exported_libraries_directory\".to_string(),\n &self.exported_libraries_directory().display(),\n )\n .finish()\n }\n\n fn boxed(self) -> Box<dyn Builder>;\n\n fn filenames_from_libdir(&self, filenames: Vec<&str>, libdir: PathBuf) -> Vec<OneEntry> {\n filenames\n .into_iter()\n .map(FileNamed::exact)\n .map(|each| each.within(&libdir))\n .collect()\n }\n}\n"},"middle":{"kind":"string","value":"wrap()\n }\n\n fn is_debug(&self) -> bool {\n self.profile() == \"debug\"\n }\n\n fn ensure_build_tools(&self) {}\n\n fn vmmaker_vm(&self) -> Option<PathBuf> {\n std::env::var(VM_CLIENT_VMMAKER_VM_VAR).map_or(None, |path| {\n let path = Path::new(&path);\n if path.exists() {\n Some(path.to_path_buf())\n } else {\n panic!(\n \"Specified {} does not exist: {}\",\n VM_CLIENT_VMMAKER_VM_VAR,\n path.display()\n );\n }\n })\n }\n\n fn vmmaker_image(&self) -> Option<PathBuf> {\n std::env::var(VM_CLIENT_VMMAKER_IMAGE_VAR).map_or(None, |path| {\n let path = Path::new(&path);\n if path.exists() {\n Some(path.to_path_buf())\n } else {\n panic!(\n \"Specified {} does not exist: {}\",\n VM_CLIENT_VMMAKER_IMAGE_VAR,\n path.display()\n );\n }\n })\n }\n\n fn output_directory(&self) -> PathBuf {\n Path::new(env::var(\"OUT_DIR\").unwrap().as_str()).to_path_buf()\n }\n\n \n \n fn vm_binary(&self) -> PathBuf;\n\n fn vm_sources_directory(&self) -> PathBuf {\n std::env::current_dir()\n .unwrap()\n .parent()\n .unwrap()\n .to_path_buf()\n .join(\"opensmalltalk-vm\")\n }\n\n fn compiled_libraries_directory(&self) -> PathBuf;\n\n fn exported_libraries_directory(&self) -> PathBuf {\n let target = std::env::var(\"CARGO_TARGET\");\n let mut path = PathBuf::new()\n .join(\"..\")\n .join(std::env::var(\"CARGO_TARGET_DIR\").unwrap_or(\"target\".to_string()));\n\n if let Ok(target) = target {\n path = path.join(target);\n }\n\n path.join(self.profile()).join(\"shared_libraries\")\n }\n\n fn compile_sources(&self);\n\n fn squeak_include_directory(&self) -> PathBuf {\n self.vm_sources_directory()\n .join(\"extracted\")\n .join(\"vm\")\n .join(\"include\")\n }\n\n fn common_include_directory(&self) -> PathBuf {\n self.squeak_include_directory().join(\"common\")\n }\n\n fn platform_include_directory(&self) -> PathBuf;\n\n fn generated_config_directory(&self) -> PathBuf {\n self.output_directory()\n .join(\"build\")\n .join(\"build\")\n .join(\"include\")\n .join(\"pharovm\")\n }\n\n fn generated_include_directory(&self) -> PathBuf {\n self.output_directory()\n .join(\"build\")\n .join(\"generated\")\n .join(\"64\")\n .join(\"vm\")\n .join(\"include\")\n }\n\n fn generate_bindings(&self) {\n let include_dir = self.vm_sources_directory().join(\"include\");\n\n let generated_vm_include_dir = self.generated_include_directory();\n assert!(\n generated_vm_include_dir.exists(),\n \"Generated vm include directory must exist: {:?}\",\n generated_vm_include_dir.display()\n );\n\n let generated_config_directory = self.generated_config_directory();\n assert!(\n generated_config_directory.exists(),\n \"Generated config.h directory must exist: {:?}\",\n generated_config_directory.display()\n );\n\n let bindings = bindgen::Builder::default()\n .whitelist_function(\"vm_.*\")\n .whitelist_function(\"free\")\n .header(\n include_dir\n .join(\"pharovm\")\n .join(\"pharoClient.h\")\n .display()\n .to_string(),\n )\n .clang_arg(format!(\"-I{}\", &include_dir.display()))\n .clang_arg(format!(\"-I{}\", &include_dir.join(\"pharovm\").display()))\n .clang_arg(format!(\"-I{}\", generated_config_directory.display()))\n .clang_arg(format!(\"-I{}\", generated_vm_include_dir.display()))\n .clang_arg(format!(\"-I{}\", self.common_include_directory().display()))\n .clang_arg(format!(\"-I{}\", self.platform_include_directory().display()))\n .clang_arg(\"-DLSB_FIRST=1\")\n \n \n .parse_callbacks(Box::new(bindgen::CargoCallbacks))\n \n .generate()\n \n .expect(\"Unable to generate bindings\");\n\n \n bindings\n .write_to_file(self.output_directory().join(\"bindings.rs\"))\n .expect(\"Couldn't write bindings!\");\n }\n\n fn link_libraries(&self);\n\n fn export_shared_libraries(&self) {\n if !self.exported_libraries_directory().exists() {\n fs::create_dir_all(self.exported_libraries_directory()).unwrap();\n }\n\n for shared_library in self.shared_libraries_to_export() {\n let target = self.exported_libraries_directory();\n match shared_library.copy(&target) {\n Ok(_) => {}\n Err(error) => {\n panic!(\n \"Could not copy {:?} to {} due to {}\",\n &shared_library,\n &target.display(),\n error\n )\n }\n }\n }\n }\n\n fn shared_libraries_to_export(&self) -> Vec<OneEntry>;\n\n fn print_directories(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n f.debug_map()\n .entry(&\"is_compiled\".to_string"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#[no_mangle]\n\npub fn gtoolkit_vm_is_on_worker_thread(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) -> bool {\n\n gt_vm_ptr.with(|| false, |gt_vm| gt_vm.is_on_worker_thread())\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":1,"score":118262.39327501913},{"content":"#[allow(dead_code)]\n\npub fn validate_user_image_file(image_name: Option<&str>) -> Option<PathBuf> {\n\n if let Some(image_file_name) = image_name {\n\n let image_path = PathBuf::new().join(image_file_name);\n\n if image_path.exists() {\n\n return Some(image_path);\n\n }\n\n }\n\n None\n\n}\n","file_path":"vm-client/src/image_finder.rs","rank":2,"score":103549.68257431456},{"content":"#[no_mangle]\n\npub fn gtoolkit_vm_wake_up(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) {\n\n gt_vm_ptr.with_not_null(|gt_vm| gt_vm.wake_up());\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":3,"score":92200.60872267836},{"content":"#[no_mangle]\n\npub fn gtoolkit_vm_minor_version(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) -> usize {\n\n gt_vm_ptr.with(|| 0, |gt_vm| gt_vm.minor_version())\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":4,"score":86941.03756800925},{"content":"#[no_mangle]\n\npub fn gtoolkit_vm_major_version(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) -> usize {\n\n gt_vm_ptr.with(|| 0, |gt_vm| gt_vm.major_version())\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":5,"score":86941.03756800925},{"content":"#[cfg(all(not(target_os = \"macos\"),))]\n\npub fn executable_working_directory() -> Result<PathBuf> {\n\n // working_directory/bin/executable\n\n let mut app_dir = std::env::current_exe()?;\n\n\n\n // working_directory/bin/\n\n app_dir = app_dir\n\n .parent()\n\n .ok_or_else(|| ApplicationError::NoParentDirectory(app_dir.clone()))?\n\n .to_path_buf();\n\n\n\n // working_directory/\n\n app_dir = app_dir\n\n .parent()\n\n .ok_or_else(|| ApplicationError::NoParentDirectory(app_dir.clone()))?\n\n .to_path_buf();\n\n\n\n Ok(app_dir)\n\n}\n","file_path":"vm-client/src/working_directory.rs","rank":6,"score":85496.70761932316},{"content":"/// Implements Hash for the native type so that the wrapper type\n\n/// can derive it from.\n\npub trait NativeHash {\n\n fn hash<H: Hasher>(&self, state: &mut H);\n\n}\n\n\n\n/// Wraps a native type that can be represented and used in Rust memory.\n\n///\n\n/// This type requires the trait `NativeDrop` to be implemented.\n\n#[repr(transparent)]\n\npub struct Handle<N: NativeDrop>(\n\n N,\n\n // `*const` is needed to suppress automatic Send and Sync derivation, which happens when the\n\n // underlying type generated by bindgen is Send and Sync.\n\n PhantomData<*const ()>,\n\n);\n\n\n\nimpl<N: NativeDrop> AsRef<Handle<N>> for Handle<N> {\n\n fn as_ref(&self) -> &Self {\n\n &self\n\n }\n\n}\n","file_path":"vm-bindings/src/prelude.rs","rank":7,"score":85203.65425648226},{"content":"/// Tag the type to automatically implement get() and set() functions\n\n/// for all Index & IndexMut implementation for that type.\n\npub trait IndexSet {}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":8,"score":85203.65425648226},{"content":"/// Clone for bindings types we can not implement Clone for.\n\npub trait NativeClone {\n\n fn clone(&self) -> Self;\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":9,"score":85203.65425648226},{"content":"/// Implements Drop for native types we can not implement Drop for.\n\npub trait NativeDrop {\n\n fn drop(&mut self);\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":10,"score":85203.65425648226},{"content":"/// Tag the type to automatically implement get() functions for\n\n/// all Index implementations.\n\npub trait IndexGet {}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":11,"score":85203.65425648226},{"content":"pub fn app_main() {\n\n let (sender, receiver) = channel();\n\n\n\n\n\n\n\n unsafe {\n\n let interpreter: VirtualMachine = unsafe { *sqGetInterpreterProxy() };\n\n\n\n let mut gt_vm = GTVM.lock().unwrap();\n\n *gt_vm = Some(GToolkitVM::new(sender, transmute(&receiver), interpreter));\n\n };\n\n\n\n // create a vector of zero terminated strings\n\n let mut args = std::env::args()\n\n .map(|arg| CString::new(arg).unwrap())\n\n .collect::<Vec<CString>>();\n\n\n\n // convert the strings to raw pointers\n\n let mut c_args = args\n\n .iter()\n","file_path":"experimental/src/lib.rs","rank":12,"score":85071.00427791136},{"content":"/// Even though some types may have value semantics, equality\n\n/// comparison may need to be customized.\n\npub trait NativePartialEq {\n\n fn eq(&self, rhs: &Self) -> bool;\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":13,"score":83344.73602411397},{"content":"pub trait GToolkitVMPointer {\n\n fn with<DefaultBlock, Block, Return>(&self, default: DefaultBlock, block: Block) -> Return\n\n where\n\n DefaultBlock: FnOnce() -> Return,\n\n Block: FnOnce(>oolkitVM) -> Return;\n\n\n\n fn with_not_null<Block>(&self, block: Block)\n\n where\n\n Block: FnOnce(>oolkitVM);\n\n}\n\n\n\nimpl GToolkitVMPointer for *const Mutex<Option<GToolkitVM>> {\n\n fn with<DefaultBlock, Block, Return>(&self, default: DefaultBlock, block: Block) -> Return\n\n where\n\n DefaultBlock: FnOnce() -> Return,\n\n Block: FnOnce(>oolkitVM) -> Return,\n\n {\n\n if self.is_null() {\n\n return default();\n\n }\n","file_path":"experimental/src/vm.rs","rank":14,"score":83344.73602411397},{"content":"/// Trait that enables access to a native representation of a wrapper type.\n\npub trait NativeAccess<N> {\n\n /// Provides shared access to the native type of the wrapper.\n\n fn native(&self) -> &N;\n\n\n\n /// Provides exclusive access to the native type of the wrapper.\n\n fn native_mut(&mut self) -> &mut N;\n\n\n\n // Returns a ptr to the native mutable value.\n\n unsafe fn native_mut_force(&self) -> *mut N {\n\n self.native() as *const N as *mut N\n\n }\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":15,"score":80155.88934508777},{"content":"/// Declares a base class for a native type.\n\npub trait NativeBase<Base> {\n\n fn base(&self) -> &Base {\n\n unsafe { &*(self as *const Self as *const Base) }\n\n }\n\n\n\n fn base_mut(&mut self) -> &mut Base {\n\n unsafe { &mut *(self as *mut Self as *mut Base) }\n\n }\n\n}\n\n\n\npub struct Sendable<H: ConditionallySend>(H);\n\nunsafe impl<H: ConditionallySend> Send for Sendable<H> {}\n\n\n\nimpl<H: ConditionallySend> Sendable<H> {\n\n pub fn unwrap(self) -> H {\n\n self.0\n\n }\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":16,"score":80152.55054440322},{"content":"pub trait ConditionallySend: Sized {\n\n /// Returns `true` if the handle can be sent to another thread.\n\n fn can_send(&self) -> bool;\n\n /// Wrap the handle in a type that can be sent to another thread and unwrapped there.\n\n ///\n\n /// Guaranteed to succeed of can_send() returns `true`.\n\n fn wrap_send(self) -> Result<Sendable<Self>, Self>;\n\n}\n\n\n\n/// Functions that are (supposedly) _safer_ variants of the ones Rust provides.\n\npub(crate) mod safer {\n\n use core::slice;\n\n use std::ptr;\n\n\n\n /// Invokes [slice::from_raw_parts] with the `ptr` only when `len` != 0, otherwise passes\n\n /// `ptr::NonNull::dangling()` as recommended.\n\n ///\n\n /// Panics if `len` != 0 and `ptr` is `null`.\n\n pub unsafe fn from_raw_parts<'a, T>(ptr: *const T, len: usize) -> &'a [T] {\n\n let ptr = if len == 0 {\n","file_path":"vm-bindings/src/prelude.rs","rank":17,"score":80152.55054440322},{"content":"pub fn try_find_image_file_in_directory(path: PathBuf) -> Option<PathBuf> {\n\n let files = fs::read_dir(&path).unwrap();\n\n let image_files: Vec<PathBuf> = files\n\n .filter_map(Result::ok)\n\n .filter(|d| {\n\n if let Some(e) = d.path().extension() {\n\n e == \"image\"\n\n } else {\n\n false\n\n }\n\n })\n\n .map(|d| d.path().to_path_buf())\n\n .collect();\n\n\n\n match image_files.len() {\n\n 1 => Some(image_files[0].clone()),\n\n _ => None,\n\n }\n\n}\n\n\n","file_path":"vm-client/src/image_finder.rs","rank":18,"score":79673.88713165271},{"content":"#[no_mangle]\n\npub fn gtoolkit_vm_get_receiver_signaller(\n\n gt_vm_ptr: *const Mutex<Option<GToolkitVM>>,\n\n thunk_ret_ptr: &mut *const c_void\n\n) -> unsafe extern \"C\" fn(*const c_void) {\n\n *thunk_ret_ptr = gt_vm_ptr as *const c_void;\n\n gt_vm_ptr.with(\n\n || gtoolkit_null_receiver_signaller as unsafe extern \"C\" fn(*const c_void),\n\n |gt_vm| gtoolkit_receiver_signaller as unsafe extern \"C\" fn(*const c_void)\n\n )\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":19,"score":79512.59502286835},{"content":"#[no_mangle]\n\npub fn gtoolkit_vm_main_thread_callout(\n\n gt_vm_ptr: *const Mutex<Option<GToolkitVM>>,\n\n cif: *mut ffi_cif,\n\n func: *mut c_void,\n\n args: *mut c_void,\n\n result: *mut c_void,\n\n semaphore: sqInt,\n\n) {\n\n gt_vm_ptr.with_not_null(|gt_vm| {\n\n gt_vm.call(GToolkitCallout {\n\n cif,\n\n func: CodePtr(func),\n\n args: Some(args as *mut *mut c_void),\n\n result: Some(result),\n\n semaphore,\n\n })\n\n });\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":20,"score":79512.59502286835},{"content":"#[no_mangle]\n\npub fn gtoolkit_vm_get_semaphore_signaller(\n\n gt_vm_ptr: *const Mutex<Option<GToolkitVM>>,\n\n thunk_ret_ptr: &mut *const c_void\n\n) -> unsafe extern \"C\" fn(usize, *const c_void) {\n\n *thunk_ret_ptr = gt_vm_ptr as *const c_void;\n\n gt_vm_ptr.with(\n\n || gtoolkit_null_semaphore_signaller as unsafe extern \"C\" fn(usize, *const c_void),\n\n |gt_vm| gt_vm.get_semaphore_signaller(),\n\n )\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":21,"score":79512.59502286835},{"content":"#[no_mangle]\n\npub fn primitiveGetAddressOfGToolkitVM() {\n\n unsafe {\n\n let gtvm_raw = unsafe { Arc::into_raw(GTVM.clone()) };\n\n\n\n let gt_lock = GTVM.lock().unwrap();\n\n let gt = gt_lock.as_ref().unwrap();\n\n\n\n let mut stack_pointer = gt.get_stack_pointer();\n\n\n\n let external_address = gt.new_external_address_from_pointer(gtvm_raw);\n\n\n\n *stack_pointer = external_address.into_native();\n\n }\n\n}\n\n\n","file_path":"experimental/src/lib.rs","rank":22,"score":77905.19631997513},{"content":"#[allow(dead_code)]\n\npub fn pick_image_with_dialog(default_path: Option<PathBuf>) -> Option<PathBuf> {\n\n let mut dialog = dialog();\n\n let mut dialog_ref = &mut dialog;\n\n if let Some(ref default_path) = default_path {\n\n dialog_ref = dialog_ref.default_path(default_path);\n\n }\n\n dialog_ref = dialog_ref.filter(\"image\");\n\n\n\n let result = dialog_ref.open().unwrap_or_else(|e| {\n\n panic!(\"{}\", e);\n\n });\n\n\n\n match result {\n\n Response::Okay(file_name) => {\n\n let file_path = PathBuf::new().join(file_name);\n\n if file_path.exists() {\n\n Some(file_path)\n\n } else {\n\n None\n\n }\n\n }\n\n _ => None,\n\n }\n\n}\n\n\n","file_path":"vm-client/src/image_finder.rs","rank":23,"score":77113.60105693713},{"content":"#[no_mangle]\n\npub fn primitiveMainThreadCalloutGToolkitVM() {\n\n unsafe {\n\n let gt_lock = GTVM.lock().unwrap();\n\n let gt = gt_lock.as_ref().unwrap();\n\n\n\n let external_function_oop = gt.stack_object_value(StackOffset::from_native_c(\n\n TFPrimitiveCallout::ExternalFunction as sqInt,\n\n ));\n\n let external_function = gt.get_handler(external_function_oop);\n\n\n\n let cif_oop = gt.object_field_at(\n\n external_function_oop,\n\n ObjectFieldIndex::from_native_c(TFExternalFunction::Definition as sqInt),\n\n );\n\n\n\n let cif_ptr = gt.get_handler(cif_oop) as *mut ffi_cif;\n\n let cif: &ffi_cif = transmute(cif_ptr);\n\n\n\n let semaphore_index = gt.stack_integer_value(StackOffset::from_native_c(\n\n TFPrimitiveCallout::SemaphoreIndex as sqInt,\n","file_path":"experimental/src/lib.rs","rank":24,"score":76400.83599547249},{"content":"#[no_mangle]\n\npub fn primitiveExtractReturnValueGToolkitVM() {\n\n unsafe {\n\n let gt_lock = GTVM.lock().unwrap();\n\n let gt = gt_lock.as_ref().unwrap();\n\n\n\n let callout_address_oop = gt.stack_object_value(StackOffset::from_native_c(\n\n TFPrimitiveReturnValue::CalloutAddress as sqInt,\n\n ));\n\n let callout_address = gt.read_address(callout_address_oop) as *mut GToolkitCallout;\n\n\n\n let mut callout = Box::from_raw(callout_address);\n\n\n\n if callout.result.is_some() {\n\n let return_holder = callout.result.unwrap();\n\n\n\n gt.marshall_and_push_return_value_of_type_popping(\n\n return_holder,\n\n callout.return_type(),\n\n 2, // one for the argument + one for the receiver\n\n );\n","file_path":"experimental/src/lib.rs","rank":25,"score":76400.83599547249},{"content":"#[allow(dead_code)]\n\npub fn search_image_file_within_directories(directories: Vec<PathBuf>) -> Option<PathBuf> {\n\n for directory in directories {\n\n if let Some(image) = try_find_image_file_in_directory(directory) {\n\n return Some(image);\n\n }\n\n }\n\n None\n\n}\n\n\n","file_path":"vm-client/src/image_finder.rs","rank":26,"score":76116.11437664709},{"content":"/// Try to change the working directory back to the original location\n\npub fn un_translocate() -> Result<()> {\n\n let translocation = MacTranslocation::new()?;\n\n if let Some(original_location) = translocation.original_location()? {\n\n std::env::set_current_dir(\n\n original_location\n\n .parent()\n\n .ok_or_else(|| ApplicationError::NoParentDirectory(original_location.clone()))?,\n\n )?;\n\n }\n\n Ok(())\n\n}\n\n\n\npub struct MacTranslocation {\n\n library: Library,\n\n}\n\n\n\nimpl MacTranslocation {\n\n pub fn new() -> Result<Self> {\n\n unsafe {\n\n let security_lib =\n","file_path":"vm-client/src/platform/mac/translocation.rs","rank":27,"score":74889.5535426516},{"content":"pub trait IndexSetter<I, O: Copy> {\n\n fn set(&mut self, index: I, value: O) -> &mut Self;\n\n}\n\n\n\nimpl<T, I, O: Copy> IndexSetter<I, O> for T\n\nwhere\n\n T: IndexMut<I, Output = O> + IndexSet,\n\n{\n\n fn set(&mut self, index: I, value: O) -> &mut Self {\n\n self[index] = value;\n\n self\n\n }\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":28,"score":73597.61857461008},{"content":"pub trait IndexGetter<I, O: Copy> {\n\n fn get(&self, index: I) -> O;\n\n}\n\n\n\nimpl<T, I, O: Copy> IndexGetter<I, O> for T\n\nwhere\n\n T: Index<I, Output = O> + IndexGet,\n\n{\n\n fn get(&self, index: I) -> O {\n\n self[index]\n\n }\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":29,"score":73597.61857461008},{"content":"/// Trait to use native types that as a rust type\n\n/// _inplace_ with the same size and field layout.\n\npub trait NativeTransmutable<NT: Sized>: Sized {\n\n /// Provides access to the native value through a\n\n /// transmuted reference to the Rust value.\n\n fn native(&self) -> &NT {\n\n unsafe { transmute_ref(self) }\n\n }\n\n\n\n /// Provides mutable access to the native value through a\n\n /// transmuted reference to the Rust value.\n\n fn native_mut(&mut self) -> &mut NT {\n\n unsafe { transmute_ref_mut(self) }\n\n }\n\n\n\n /// Copies the native value to an equivalent Rust value.\n\n ///\n\n /// The `_c` suffix is to remind callers that functions that return a native value from a C++\n\n /// ABI can't be used. For example, C++ member functions must be wrapped in a extern \"C\" function.\n\n fn from_native_c(nt: NT) -> Self {\n\n let r = unsafe { mem::transmute_copy::<NT, Self>(&nt) };\n\n // don't drop, the Rust type takes over.\n","file_path":"vm-bindings/src/prelude.rs","rank":30,"score":71986.92291484107},{"content":"///\n\n/// Possible parameters\n\n/// - VM_CLIENT_VMMAKER to use a specific VM to run a VM Maker image\n\nfn main() {\n\n let builder = match std::env::consts::OS {\n\n \"linux\" => LinuxBuilder::default().boxed(),\n\n \"macos\" => MacBuilder::default().boxed(),\n\n \"windows\" => WindowsBuilder::default().boxed(),\n\n _ => {\n\n panic!(\"The platform you're compiling for is not supported\");\n\n }\n\n };\n\n\n\n println!(\"About to build a vm using {:?}\", &builder);\n\n builder.ensure_build_tools();\n\n\n\n builder.compile_sources();\n\n\n\n if !builder.is_compiled() {\n\n panic!(\"Failed to compile {:?}\", builder.vm_binary().display())\n\n }\n\n\n\n builder.link_libraries();\n\n builder.generate_bindings();\n\n builder.export_shared_libraries();\n\n}\n","file_path":"vm-bindings/build.rs","rank":31,"score":47975.1304016979},{"content":"fn main() {\n\n app_main()\n\n}\n","file_path":"experimental/src/main.rs","rank":32,"score":47972.165901496075},{"content":"fn main() {\n\n match std::env::var(\"VM_CLIENT_EMBED_RESOURCES\") {\n\n Ok(resources) => {\n\n for resource in resources.split(\",\") {\n\n embed_resource::compile(resource);\n\n println!(\"cargo:rerun-if-changed={}\", resource);\n\n }\n\n }\n\n Err(_) => {}\n\n }\n\n}\n","file_path":"vm-client/build.rs","rank":33,"score":47972.165901496075},{"content":"fn main() {\n\n if let Err(error) = run() {\n\n let error: Box<dyn std::error::Error> = Box::new(error);\n\n let user_facing_error: UserFacingError = error.into();\n\n user_facing_error.print_and_exit();\n\n }\n\n}\n","file_path":"vm-client/src/main.rs","rank":34,"score":46804.18557467917},{"content":"fn main() {\n\n let matches = App::new(\"Virtual Machine\")\n\n .version(\"1.0\")\n\n .author(\"feenk gmbh. <contact@feenk.com>\")\n\n .setting(AppSettings::AllowExternalSubcommands)\n\n .setting(AppSettings::ColoredHelp)\n\n .arg(\n\n Arg::new(\"image\")\n\n .value_name(\"image\")\n\n .index(1)\n\n .required(true)\n\n .about(\"A path to an image file to run\"),\n\n )\n\n .arg(\n\n Arg::new(\"interactive\")\n\n .long(\"interactive\")\n\n .about(\"Start image in the interactive (UI) mode\"),\n\n )\n\n .get_matches();\n\n\n","file_path":"vm-client/src/main_cli.rs","rank":35,"score":45725.36405143606},{"content":"fn run() -> Result<()> {\n\n // we should read options and canonicalize the image path before changing current directory\n\n let mut options: AppOptions = AppOptions::parse();\n\n options.canonicalize()?;\n\n\n\n #[cfg(target_os = \"macos\")]\n\n if let Err(error) = platform::mac::translocation::un_translocate() {\n\n error!(\"Failed to un-translocate the app due to {}\", error);\n\n }\n\n\n\n let application = Application::new(options)?;\n\n application.start()?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"vm-client/src/main.rs","rank":36,"score":43725.3581640106},{"content":"use crate::build_support::Builder;\n\n\n\nuse file_matcher::OneEntry;\n\nuse std::fmt;\n\nuse std::fmt::{Debug, Formatter};\n\nuse std::path::PathBuf;\n\n\n\n#[derive(Default, Clone)]\n\npub struct LinuxBuilder;\n\n\n\nimpl Debug for LinuxBuilder {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n self.print_directories(f)\n\n }\n\n}\n\n\n\nimpl Builder for LinuxBuilder {\n\n fn vm_binary(&self) -> PathBuf {\n\n self.compiled_libraries_directory()\n\n .join(\"libPharoVMCore.so\")\n","file_path":"vm-bindings/build_support/linux.rs","rank":48,"score":14.53324544924781},{"content":"use crate::build_support::Builder;\n\n\n\nuse file_matcher::OneEntry;\n\nuse std::fmt;\n\nuse std::fmt::{Debug, Formatter};\n\nuse std::path::PathBuf;\n\n\n\n#[derive(Default, Clone)]\n\npub struct MacBuilder;\n\n\n\nimpl Debug for MacBuilder {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n self.print_directories(f)\n\n }\n\n}\n\n\n\nimpl Builder for MacBuilder {\n\n fn vm_binary(&self) -> PathBuf {\n\n self.compiled_libraries_directory()\n\n .join(\"libPharoVMCore.dylib\")\n","file_path":"vm-bindings/build_support/mac.rs","rank":49,"score":14.44993252893391},{"content":"use crate::build_support::Builder;\n\nuse file_matcher::{FileNamed, OneEntry};\n\nuse std::fmt;\n\nuse std::fmt::{Debug, Formatter};\n\nuse std::path::{Path, PathBuf};\n\nuse std::process::Command;\n\nuse titlecase::titlecase;\n\n\n\n#[derive(Default, Clone)]\n\npub struct WindowsBuilder {}\n\n\n\nimpl Debug for WindowsBuilder {\n\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\n\n self.print_directories(f)\n\n }\n\n}\n\n\n\nimpl WindowsBuilder {\n\n fn pthreads_directory(&self) -> PathBuf {\n\n self.output_directory().join(\"pthreads\")\n","file_path":"vm-bindings/build_support/windows.rs","rank":50,"score":14.206576320637982},{"content":"mod builder;\n\npub use builder::Builder;\n\n\n\nmod linux;\n\nmod mac;\n\nmod windows;\n\n\n\npub use linux::LinuxBuilder;\n\npub use mac::MacBuilder;\n\npub use windows::WindowsBuilder;\n","file_path":"vm-bindings/build_support/mod.rs","rank":51,"score":11.730431658216018},{"content":" None\n\n }\n\n }\n\n}\n\n\n\npub(crate) trait IfBoolSome {\n\n fn if_true_some<V>(self, v: V) -> Option<V>;\n\n fn if_false_some<V>(self, v: V) -> Option<V>;\n\n fn if_true_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V>;\n\n fn if_false_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V>;\n\n}\n\n\n\nimpl IfBoolSome for bool {\n\n fn if_true_some<V>(self, v: V) -> Option<V> {\n\n self.into_option().and(Some(v))\n\n }\n\n\n\n fn if_false_some<V>(self, v: V) -> Option<V> {\n\n (!self).if_true_some(v)\n\n }\n","file_path":"vm-bindings/src/prelude.rs","rank":52,"score":9.676471785680036},{"content":"use crate::bindings::{\n\n vm_parameters_destroy, vm_parameters_parse, VMParameterVector as NativeVMParameterVector,\n\n VMParameters as NativeVMParameters,\n\n};\n\nuse crate::parameter_vector::{ImageParameters, VirtualMachineParameters};\n\nuse crate::prelude::{Handle, NativeAccess, NativeDrop};\n\nuse std::ffi::{CStr, CString};\n\nuse std::fmt;\n\nuse std::mem::forget;\n\nuse std::os::raw::{c_char, c_void};\n\n\n\npub type VMParameters = Handle<NativeVMParameters>;\n\n\n\nimpl NativeDrop for NativeVMParameters {\n\n fn drop(&mut self) {\n\n unsafe {\n\n vm_parameters_destroy(self);\n\n }\n\n }\n\n}\n","file_path":"vm-bindings/src/parameters.rs","rank":53,"score":8.940896088065458},{"content":"\n\n pub fn arguments(&self) -> Vec<String> {\n\n let args_ptr = self.native().processArgv as *mut *mut c_char;\n\n let args_length = self.native().processArgc as usize;\n\n\n\n let arg_ptrs: Vec<*mut c_char> =\n\n unsafe { Vec::from_raw_parts(args_ptr, args_length, args_length) };\n\n let arguments: Vec<String> = arg_ptrs\n\n .iter()\n\n .map(|each| unsafe { CStr::from_ptr(*each).to_string_lossy().into_owned() })\n\n .collect();\n\n\n\n std::mem::forget(arg_ptrs);\n\n arguments\n\n }\n\n\n\n pub fn has_arguments(&self) -> bool {\n\n self.native().processArgc > 0\n\n }\n\n\n","file_path":"vm-bindings/src/parameters.rs","rank":54,"score":8.338797389708354},{"content":"\n\n pub fn eden_size(&self) -> usize {\n\n self.native().edenSize as usize\n\n }\n\n\n\n pub fn image_parameters(&self) -> &ImageParameters {\n\n ImageParameters::borrow_from_native(&self.native().imageParameters)\n\n }\n\n\n\n pub fn virtual_machine_parameters(&self) -> &VirtualMachineParameters {\n\n VirtualMachineParameters::borrow_from_native(&self.native().imageParameters)\n\n }\n\n}\n\n\n\nimpl fmt::Debug for VMParameters {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n f.debug_struct(\"VMParameters\")\n\n .field(\"image_file_name\", &self.image_file_name())\n\n .field(\"arguments\", &self.arguments())\n\n .field(\"is_default_image\", &self.is_default_image())\n","file_path":"vm-bindings/src/parameters.rs","rank":55,"score":8.185986932457476},{"content":" use std::ffi::OsString;\n\n use std::os::windows::ffi::{OsStrExt, OsStringExt};\n\n\n\n let mut path = path.as_ref().to_path_buf().into_os_string();\n\n\n\n let wchars = path\n\n .encode_wide()\n\n .map(|wchar| {\n\n if wchar == b'\\\\' as u16 {\n\n '/' as u16\n\n } else {\n\n wchar\n\n }\n\n })\n\n .collect::<Vec<_>>();\n\n path = OsString::from_wide(&wchars);\n\n PathBuf::from(path)\n\n }\n\n #[cfg(not(windows))]\n\n {\n","file_path":"vm-bindings/build_support/windows.rs","rank":56,"score":8.016696847023802},{"content":"\n\n let c_str: &CStr = unsafe { CStr::from_ptr(self.native().imageFileName) };\n\n let str_slice: &str = c_str.to_str().unwrap();\n\n str_slice.to_owned()\n\n }\n\n\n\n pub fn set_image_file_name<P: Into<String>>(&mut self, file_name: P) {\n\n let new_image_name: String = file_name.into();\n\n\n\n if self.image_file_name() == new_image_name {\n\n return;\n\n }\n\n\n\n let previous_file_name = self.native().imageFileName as *mut c_void;\n\n unsafe { crate::bindings::free(previous_file_name) };\n\n\n\n let c_str = CString::new(new_image_name).unwrap();\n\n self.native_mut().imageFileName = c_str.into_raw();\n\n self.native_mut().isDefaultImage = false;\n\n }\n","file_path":"vm-bindings/src/parameters.rs","rank":57,"score":7.812180188406414},{"content":" let previous_args = previous_arg_ptrs\n\n .iter()\n\n .map(|each| unsafe { CString::from_raw(*each) })\n\n .collect::<Vec<CString>>();\n\n\n\n drop(previous_args);\n\n drop(previous_arg_ptrs);\n\n }\n\n\n\n self.native_mut().processArgv = args_ptr;\n\n self.native_mut().processArgc = args_length;\n\n }\n\n\n\n pub fn is_default_image(&self) -> bool {\n\n self.native().isDefaultImage\n\n }\n\n\n\n pub fn is_default_image_found(&self) -> bool {\n\n self.native().defaultImageFound\n\n }\n","file_path":"vm-bindings/src/parameters.rs","rank":58,"score":7.643179845912693},{"content":" fn construct(construct: impl FnOnce(*mut NT)) -> Self {\n\n Self::try_construct(|i| {\n\n construct(i);\n\n true\n\n })\n\n .unwrap()\n\n }\n\n\n\n fn try_construct(construct: impl FnOnce(*mut NT) -> bool) -> Option<Self> {\n\n self::try_construct(construct).map(Self::from_native_c)\n\n }\n\n}\n\n\n\npub(crate) trait NativeTransmutableSliceAccess<NT: Sized> {\n\n fn native(&self) -> &[NT];\n\n fn native_mut(&mut self) -> &mut [NT];\n\n}\n\n\n\nimpl<NT, ElementT> NativeTransmutableSliceAccess<NT> for [ElementT]\n\nwhere\n","file_path":"vm-bindings/src/prelude.rs","rank":59,"score":7.591846208244408},{"content":"use crate::{ApplicationError, Result};\n\nuse clap::{AppSettings, Clap};\n\nuse std::path::{Path, PathBuf};\n\n\n\n#[derive(Clap, Clone, Debug)]\n\n#[clap(version = \"1.0\", author = \"feenk gmbh <contact@feenk.com>\")]\n\n#[clap(setting = AppSettings::ColoredHelp)]\n\npub struct AppOptions {\n\n /// A path to a custom Pharo .image to use instead of automatically detecting one\n\n #[clap(long, parse(from_os_str))]\n\n image: Option<PathBuf>,\n\n}\n\n\n\nimpl AppOptions {\n\n pub fn canonicalize(&mut self) -> Result<()> {\n\n if let Some(ref image) = self.image {\n\n if !image.exists() {\n\n return ApplicationError::ImageFileDoesNotExist(image.clone()).into();\n\n }\n\n self.image = Some(to_absolute::canonicalize(image)?);\n\n }\n\n Ok(())\n\n }\n\n\n\n pub fn image(&self) -> Option<&Path> {\n\n self.image.as_ref().map(|image| image.as_path())\n\n }\n\n}\n","file_path":"vm-client/src/application_options.rs","rank":60,"score":7.579784528965964},{"content":" let mut parameters = VMParameters::from_args(vm_args);\n\n parameters.set_image_file_name(self.image.as_os_str().to_str().unwrap().to_owned());\n\n parameters.set_is_interactive_session(true);\n\n\n\n VM::start(parameters).unwrap();\n\n Ok(())\n\n }\n\n\n\n pub fn executable_name(&self) -> Result<String> {\n\n let executable_path = self.executable_path()?;\n\n let executable_name = executable_path\n\n .file_name()\n\n .ok_or_else(|| ApplicationError::FailedToGetFileName(executable_path.clone()))?;\n\n let executable_name = executable_name.to_str().ok_or_else(|| {\n\n ApplicationError::FailedToConvertOsString(executable_name.to_os_string())\n\n })?;\n\n Ok(executable_name.to_string())\n\n }\n\n\n\n pub fn executable_path(&self) -> Result<PathBuf> {\n","file_path":"vm-client/src/application.rs","rank":61,"score":7.473186109399805},{"content":"use crate::bindings::{\n\n firstIndexableField, getHandler, instantiateClassindexableSize, isVMRunOnWorkerThread,\n\n readAddress, signalSemaphoreWithIndex, sqInt, usqInt, BytesPerWord, VirtualMachine,\n\n};\n\n\n\nuse std::sync::mpsc::{Sender, Receiver, RecvError};\n\n\n\nuse crate::cointerp::{\n\n instantiateClassindexableSizeisPinned, marshallAndPushReturnValueFromofTypepoping,\n\n marshallArgumentFromatIndexintoofTypewithSize, numSlotsOf,\n\n};\n\nuse crate::prelude::NativeTransmutable;\n\nuse libc::c_char;\n\nuse libc::c_int;\n\nuse libffi::low::{ffi_cif, ffi_type, CodePtr};\n\n\n\nuse std::intrinsics::transmute;\n\nuse std::os::raw::c_void;\n\nuse std::sync::{Arc, Mutex};\n\nuse std::fmt::Debug;\n\n\n\n#[derive(Debug)]\n\npub struct GToolkitVM {\n\n sender: Sender<GToolkitVMRequest>,\n\n receiver: &'static Receiver<GToolkitVMRequest>,\n\n interpreter: VirtualMachine,\n\n}\n\n\n","file_path":"experimental/src/vm.rs","rank":62,"score":7.2979503047799215},{"content":"use std::ffi::OsString;\n\nuse std::path::PathBuf;\n\nuse thiserror::Error;\n\n\n\npub type Result<T> = core::result::Result<T, ApplicationError>;\n\n\n\n#[derive(Error, Debug)]\n\npub enum ApplicationError {\n\n #[error(\"Input/Output error\")]\n\n IoError(#[from] std::io::Error),\n\n #[cfg(target_os = \"macos\")]\n\n #[error(\"Failed to load the library\")]\n\n LibLoadingError(#[from] libloading::Error),\n\n #[error(\"Failed to canonicalize a path\")]\n\n CanonicalizationError(#[from] to_absolute::Error),\n\n #[error(\"Failed to detect if the executable is translocated\")]\n\n FailedToDetectIfTranslocated,\n\n #[error(\"Failed to detect the original translocated path\")]\n\n FailedToDetectOriginalTranslocatedPath,\n\n #[error(\"Failed to open terminal\")]\n","file_path":"vm-client/src/error.rs","rank":63,"score":7.117065901206686},{"content":"use nfd2::{dialog, Response};\n\nuse std::fs;\n\nuse std::path::PathBuf;\n\n\n","file_path":"vm-client/src/image_finder.rs","rank":64,"score":7.116893635940901},{"content":" let mut bool_is_translocated = false;\n\n\n\n if is_translocated_fn(\n\n url,\n\n &mut bool_is_translocated as *mut _,\n\n std::ptr::null_mut(),\n\n ) {\n\n } else {\n\n return Err(ApplicationError::FailedToDetectIfTranslocated);\n\n }\n\n Ok(bool_is_translocated)\n\n }\n\n }\n\n\n\n pub fn original_location(&self) -> Result<Option<PathBuf>> {\n\n unsafe {\n\n let original_path_fn: Symbol<\n\n unsafe extern \"C\" fn(CFURLRef, *mut CFErrorRef) -> CFURLRef,\n\n > = match self.library.get(b\"SecTranslocateCreateOriginalPathForURL\") {\n\n Ok(func) => func,\n","file_path":"vm-client/src/platform/mac/translocation.rs","rank":65,"score":7.0137316362942235},{"content":"#[macro_use]\n\nextern crate lazy_static;\n\n\n\npub mod bindings;\n\npub mod cointerp;\n\npub mod prelude;\n\npub mod vm;\n\n\n\nuse std::ffi::CString;\n\n\n\nuse libc::c_char;\n\nuse libc::c_int;\n\nuse libffi::low::{ffi_cif, ffi_type, CodePtr};\n\n\n\nuse crate::bindings::{\n\n calloc, checkedLongAtput, firstIndexableField, free, instantiateClassindexableSize,\n\n isVMRunOnWorkerThread, loadModuleHandle, malloc, memcpy, methodArgumentCount,\n\n signalSemaphoreWithIndex, sqGetInterpreterProxy, sqInt, stackObjectValue, usqInt,\n\n vm_main_with_parameters, vm_parameters_parse, vm_run_interpreter, BytesPerWord,\n\n VMParameterVector, VirtualMachine, TRUE,\n","file_path":"experimental/src/lib.rs","rank":66,"score":6.918152678530301},{"content":" }\n\n\n\n /// Converts a pointer to a mutable native value into a pointer to the mutable Rust value.\n\n #[allow(unused)]\n\n pub(crate) fn from_native_ptr_mut(np: *mut N) -> *mut Self {\n\n np as _\n\n }\n\n\n\n /// Constructs a C++ object in place by calling a\n\n /// function that expects a pointer that points to\n\n /// uninitialized memory of the native type.\n\n pub(crate) fn construct(construct: impl FnOnce(*mut N)) -> Self {\n\n Self::try_construct(|i| {\n\n construct(i);\n\n true\n\n })\n\n .unwrap()\n\n }\n\n\n\n pub(crate) fn try_construct(construct: impl FnOnce(*mut N) -> bool) -> Option<Self> {\n","file_path":"vm-bindings/src/prelude.rs","rank":67,"score":6.842626127212889},{"content":"use std::path::{Path, PathBuf};\n\n\n\nuse vm_bindings::{VMParameters, VM};\n\n\n\nuse crate::image_finder::{pick_image_with_dialog, search_image_file_within_directories};\n\nuse crate::working_directory::executable_working_directory;\n\nuse crate::AppOptions;\n\nuse crate::{ApplicationError, Result};\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Application {\n\n options: AppOptions,\n\n working_directory: PathBuf,\n\n image: PathBuf,\n\n}\n\n\n\nimpl Application {\n\n pub fn new(options: AppOptions) -> Result<Self> {\n\n let mut image = options.image().map(|image| image.to_path_buf());\n\n if image.is_none() {\n","file_path":"vm-client/src/application.rs","rank":68,"score":6.838919998154634},{"content":"mod bindings;\n\nmod parameter_vector;\n\nmod parameters;\n\nmod prelude;\n\nmod vm;\n\n\n\npub use parameters::VMParameters;\n\npub use vm::VM;\n","file_path":"vm-bindings/src/lib.rs","rank":69,"score":6.565824578021897},{"content":" ptr::NonNull::new(ptr).map(Self)\n\n }\n\n\n\n pub(crate) fn into_ptr(self) -> *mut N {\n\n let p = self.0.as_ptr();\n\n mem::forget(self);\n\n p\n\n }\n\n}\n\n\n\n/// A trait that consumes self and converts it to a ptr to the native type.\n\npub(crate) trait IntoPtr<N> {\n\n fn into_ptr(self) -> *mut N;\n\n}\n\n\n\n/// A trait that consumes self and converts it to a ptr to the native type or null.\n\npub(crate) trait IntoPtrOrNull<N> {\n\n fn into_ptr_or_null(self) -> *mut N;\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":70,"score":6.551185333087829},{"content":"use crate::bindings::VMParameterVector as NativeVMParameterVector;\n\nuse crate::prelude::{transmute_ref, NativeAccess};\n\nuse std::ffi::CStr;\n\n\n\n#[repr(transparent)]\n\npub struct VirtualMachineParameters(NativeVMParameterVector);\n\n\n\nimpl NativeAccess<NativeVMParameterVector> for VirtualMachineParameters {\n\n fn native(&self) -> &NativeVMParameterVector {\n\n &self.0\n\n }\n\n\n\n fn native_mut(&mut self) -> &mut NativeVMParameterVector {\n\n &mut self.0\n\n }\n\n}\n\n\n\nimpl VirtualMachineParameters {\n\n pub fn len(&self) -> usize {\n\n self.native().count as usize\n","file_path":"vm-bindings/src/parameter_vector.rs","rank":71,"score":6.412048478162866},{"content":" .parent()\n\n .ok_or_else(|| ApplicationError::NoParentDirectory(image.clone()))?\n\n .to_path_buf();\n\n\n\n Ok(Self {\n\n options,\n\n working_directory,\n\n image,\n\n })\n\n }\n\n\n\n pub fn start(&self) -> Result<()> {\n\n std::env::set_current_dir(self.working_directory.as_path())?;\n\n\n\n let executable_path = std::env::current_exe()?;\n\n\n\n let mut vm_args: Vec<String> = vec![];\n\n vm_args.push(executable_path.as_os_str().to_str().unwrap().to_owned());\n\n vm_args.push(self.image.as_os_str().to_str().unwrap().to_owned());\n\n\n","file_path":"vm-client/src/application.rs","rank":72,"score":6.373046432397253},{"content":"// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\n// SOFTWARE.\n\n\n\n// See https://github.com/rust-skia/rust-skia\n\n// Licence https://github.com/rust-skia/rust-skia/blob/master/LICENSE\n\n#![allow(dead_code)]\n\n\n\nuse std::hash::{Hash, Hasher};\n\nuse std::mem::MaybeUninit;\n\nuse std::ops::{Deref, DerefMut, Index, IndexMut};\n\nuse std::{mem, ptr, slice};\n\n// Re-export TryFrom / TryInto to make them available in all modules that use prelude::*.\n\npub use std::convert::{TryFrom, TryInto};\n\nuse std::marker::PhantomData;\n\n\n\n/// Swiss army knife to convert any reference into any other.\n\npub(crate) unsafe fn transmute_ref<FromT, ToT>(from: &FromT) -> &ToT {\n\n // TODO: can we do this statically for all instantiations of transmute_ref?\n\n debug_assert_eq!(mem::size_of::<FromT>(), mem::size_of::<ToT>());\n\n &*(from as *const FromT as *const ToT)\n","file_path":"vm-bindings/src/prelude.rs","rank":73,"score":6.363357406346259},{"content":"}\n\n\n\nimpl<N: NativeDrop> ReplaceWith<Handle<N>> for N {\n\n fn replace_with(&mut self, other: Handle<N>) -> Handle<N> {\n\n other.replace_native(self)\n\n }\n\n}\n\n\n\n/// Constructs a C++ object in place by calling a lambda that is meant to initialize\n\n/// the pointer to the Rust memory provided as a pointer.\n\npub(crate) fn construct<N>(construct: impl FnOnce(*mut N)) -> N {\n\n try_construct(|i| {\n\n construct(i);\n\n true\n\n })\n\n .unwrap()\n\n}\n\n\n\npub(crate) fn try_construct<N>(construct: impl FnOnce(*mut N) -> bool) -> Option<N> {\n\n let mut instance = MaybeUninit::uninit();\n","file_path":"vm-bindings/src/prelude.rs","rank":74,"score":6.325061687981472},{"content":" }\n\n }\n\n\n\n pub fn as_vec(&self) -> Vec<String> {\n\n self.iter().collect()\n\n }\n\n\n\n pub(crate) fn borrow_from_native(native: &NativeVMParameterVector) -> &Self {\n\n unsafe { transmute_ref(native) }\n\n }\n\n}\n\n\n\npub struct ParametersVectorIterator<'a> {\n\n vector: &'a NativeVMParameterVector,\n\n index: usize,\n\n}\n\n\n\nimpl<'a> Iterator for ParametersVectorIterator<'a> {\n\n type Item = String;\n\n fn next(&mut self) -> Option<String> {\n","file_path":"vm-bindings/src/parameter_vector.rs","rank":75,"score":6.290588231557357},{"content":"#![windows_subsystem = \"windows\"]\n\n\n\nextern crate dirs;\n\nextern crate nfd2;\n\nextern crate thiserror;\n\nextern crate vm_bindings;\n\n#[macro_use]\n\nextern crate log;\n\n\n\nmod error;\n\nmod image_finder;\n\n\n\nmod application;\n\nmod application_options;\n\nmod platform;\n\nmod working_directory;\n\n\n\nuse clap::Clap;\n\n\n\nuse user_error::{UserFacingError, UFE};\n\n\n\npub use crate::application::Application;\n\npub use crate::application_options::AppOptions;\n\npub use crate::error::*;\n\n\n","file_path":"vm-client/src/main.rs","rank":76,"score":6.273934776635405},{"content":" Library::new(\"/System/Library/Frameworks/Security.framework/Security\")?;\n\n Ok(Self {\n\n library: security_lib,\n\n })\n\n }\n\n }\n\n\n\n pub fn is_translocated(&self) -> Result<bool> {\n\n unsafe {\n\n let is_translocated_fn: Symbol<\n\n unsafe extern \"C\" fn(CFURLRef, *mut bool, *mut CFErrorRef) -> bool,\n\n > = match self.library.get(b\"SecTranslocateIsTranslocatedURL\") {\n\n Ok(func) => func,\n\n Err(_) => {\n\n return Ok(false);\n\n }\n\n };\n\n\n\n let bundle = CFBundleGetMainBundle();\n\n let url = CFBundleCopyBundleURL(bundle);\n","file_path":"vm-client/src/platform/mac/translocation.rs","rank":77,"score":6.168321896013727},{"content":"use crate::bindings::vm_main_with_parameters;\n\nuse crate::prelude::NativeAccess;\n\nuse crate::VMParameters;\n\nuse std::error::Error;\n\n\n\npub struct VM {}\n\n\n\nimpl VM {\n\n pub fn start(mut parameters: VMParameters) -> Result<(), Box<dyn Error>> {\n\n unsafe {\n\n vm_main_with_parameters(parameters.native_mut());\n\n }\n\n\n\n Ok(())\n\n }\n\n}\n","file_path":"vm-bindings/src/vm.rs","rank":78,"score":6.149296125447023},{"content":" if self.index < self.vector.count as usize {\n\n let slice = unsafe {\n\n std::slice::from_raw_parts_mut(self.vector.parameters, self.vector.count as usize)\n\n };\n\n let chars = unsafe { CStr::from_ptr(slice[self.index]) };\n\n let string = String::from(chars.to_string_lossy());\n\n self.index += 1;\n\n Some(string)\n\n } else {\n\n None\n\n }\n\n }\n\n}\n","file_path":"vm-bindings/src/parameter_vector.rs","rank":79,"score":6.051763449085561},{"content":"#![cfg(target_os = \"macos\")]\n\n\n\nuse crate::error::ApplicationError;\n\nuse crate::Result;\n\nuse core_foundation::base::{Boolean, CFIndex};\n\nuse core_foundation::bundle::{CFBundleCopyBundleURL, CFBundleGetMainBundle};\n\nuse core_foundation::error::CFErrorRef;\n\nuse core_foundation::url::{CFURLGetFileSystemRepresentation, CFURLRef};\n\nuse libc::{c_char, strlen, PATH_MAX};\n\nuse libloading::{Library, Symbol};\n\nuse std::path::PathBuf;\n\n\n\n#[cfg(unix)]\n\nuse std::ffi::OsStr;\n\n#[cfg(unix)]\n\nuse std::os::unix::ffi::OsStrExt;\n\n\n\n/// Try to change the working directory back to the original location\n","file_path":"vm-client/src/platform/mac/translocation.rs","rank":80,"score":5.850766977340543},{"content":"\n\n pub fn is_interactive_session(&self) -> bool {\n\n self.native().isInteractiveSession\n\n }\n\n\n\n pub fn set_is_interactive_session(&mut self, is_interactive_session: bool) {\n\n self.native_mut().isInteractiveSession = is_interactive_session;\n\n }\n\n\n\n pub fn max_stack_frames_to_print(&self) -> usize {\n\n self.native().maxStackFramesToPrint as usize\n\n }\n\n\n\n pub fn max_old_space_size(&self) -> usize {\n\n self.native().maxOldSpaceSize as usize\n\n }\n\n\n\n pub fn max_code_size(&self) -> usize {\n\n self.native().maxCodeSize as usize\n\n }\n","file_path":"vm-bindings/src/parameters.rs","rank":81,"score":5.835081883621386},{"content":"\n\n fn if_true_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V> {\n\n self.into_option().map(|()| f())\n\n }\n\n\n\n fn if_false_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V> {\n\n (!self).into_option().map(|()| f())\n\n }\n\n}\n\n\n\n/// Trait that enables access to a native representation of a wrapper type.\n","file_path":"vm-bindings/src/prelude.rs","rank":82,"score":5.8251219762315385},{"content":"}\n\n\n\npub(crate) unsafe fn transmute_ref_mut<FromT, ToT>(from: &mut FromT) -> &mut ToT {\n\n // TODO: can we do this statically for all instantiations of transmute_ref_mut?\n\n debug_assert_eq!(mem::size_of::<FromT>(), mem::size_of::<ToT>());\n\n &mut *(from as *mut FromT as *mut ToT)\n\n}\n\n\n\npub(crate) trait IntoOption {\n\n type Target;\n\n fn into_option(self) -> Option<Self::Target>;\n\n}\n\n\n\nimpl<T> IntoOption for *const T {\n\n type Target = *const T;\n\n\n\n fn into_option(self) -> Option<Self::Target> {\n\n if !self.is_null() {\n\n Some(self)\n\n } else {\n","file_path":"vm-bindings/src/prelude.rs","rank":83,"score":5.779191617124769},{"content":" println!(\"GT woke up\");\n\n }\n\n }\n\n }\n\n\n\n}\n\n\n\n#[repr(C)]\n\n#[derive(Debug, Copy, Clone)]\n\npub struct GToolkitCallout {\n\n pub(crate) cif: *mut ffi_cif,\n\n pub(crate) func: CodePtr,\n\n pub(crate) args: Option<*mut *mut c_void>,\n\n pub(crate) result: Option<*mut c_void>,\n\n pub(crate) semaphore: sqInt,\n\n}\n\n\n\nimpl GToolkitCallout {\n\n pub fn call(&self) {\n\n unsafe {\n","file_path":"experimental/src/vm.rs","rank":84,"score":5.500881477030909},{"content":" unsafe {\n\n vm_parameters_parse(\n\n default_parameters.native().processArgc,\n\n default_parameters.native().processArgv,\n\n default_parameters.native_mut(),\n\n )\n\n };\n\n }\n\n\n\n default_parameters\n\n }\n\n\n\n pub fn from_env_args() -> Self {\n\n Self::from_args(std::env::args().collect())\n\n }\n\n\n\n pub fn image_file_name(&self) -> String {\n\n if self.native().imageFileName.is_null() {\n\n return \"\".to_string();\n\n }\n","file_path":"vm-bindings/src/parameters.rs","rank":85,"score":5.402262085225537},{"content":"\n\nimpl VMParameters {\n\n pub fn from_args<P: AsRef<str>>(arguments: Vec<P>) -> Self {\n\n let vars = std::env::vars()\n\n .map(|arg| CString::new(format!(\"{}={}\", arg.0, arg.1)).unwrap())\n\n .collect::<Vec<CString>>();\n\n\n\n let mut c_vars = vars\n\n .iter()\n\n .map(|arg| arg.as_ptr())\n\n .collect::<Vec<*const c_char>>();\n\n\n\n let mut default_parameters = Self::default();\n\n default_parameters.set_arguments(arguments);\n\n default_parameters.native_mut().environmentVector = c_vars.as_mut_ptr();\n\n\n\n forget(vars);\n\n forget(c_vars);\n\n\n\n if default_parameters.has_arguments() {\n","file_path":"vm-bindings/src/parameters.rs","rank":86,"score":5.374439404128891},{"content":" }\n\n}\n\n\n\nunsafe impl Send for GToolkitVM {}\n\nunsafe impl Sync for GToolkitVM {}\n\n\n\n#[derive(Copy, Clone, Debug)]\n\n#[repr(transparent)]\n\npub struct ObjectPointer(sqInt);\n\nimpl NativeTransmutable<sqInt> for ObjectPointer {}\n\n\n\n#[derive(Copy, Clone, Debug)]\n\n#[repr(transparent)]\n\npub struct ObjectFieldIndex(sqInt);\n\nimpl NativeTransmutable<sqInt> for ObjectFieldIndex {}\n\n\n\n#[derive(Copy, Clone, Debug)]\n\n#[repr(transparent)]\n\npub struct StackOffset(sqInt);\n\nimpl NativeTransmutable<sqInt> for StackOffset {}\n","file_path":"experimental/src/vm.rs","rank":87,"score":5.371101044609237},{"content":" }\n\n\n\n pub fn iter(&self) -> ParametersVectorIterator {\n\n ParametersVectorIterator {\n\n vector: self.native(),\n\n index: 0,\n\n }\n\n }\n\n\n\n pub fn as_vec(&self) -> Vec<String> {\n\n self.iter().collect()\n\n }\n\n\n\n pub(crate) fn borrow_from_native(native: &NativeVMParameterVector) -> &Self {\n\n unsafe { transmute_ref(native) }\n\n }\n\n}\n\n\n\n#[repr(transparent)]\n\npub struct ImageParameters(NativeVMParameterVector);\n","file_path":"vm-bindings/src/parameter_vector.rs","rank":88,"score":5.317171756574295},{"content":" pub fn set_arguments<P: AsRef<str>>(&mut self, arguments: Vec<P>) {\n\n // create a vector of zero terminated strings\n\n let mut args = arguments\n\n .iter()\n\n .map(|each| each.as_ref().to_string())\n\n .map(|each| CString::into_raw(CString::new(each).unwrap()))\n\n .collect::<Vec<*mut c_char>>();\n\n\n\n args.shrink_to_fit();\n\n\n\n let args_ptr = args.as_ptr() as *mut *const c_char;\n\n let args_length = args.len() as i32;\n\n std::mem::forget(args);\n\n\n\n if !self.native().processArgv.is_null() {\n\n let previous_ptr = self.native().processArgv as *mut *mut c_char;\n\n let previous_length = self.native().processArgc as usize;\n\n\n\n let previous_arg_ptrs: Vec<*mut c_char> =\n\n unsafe { Vec::from_raw_parts(previous_ptr, previous_length, previous_length) };\n","file_path":"vm-bindings/src/parameters.rs","rank":89,"score":5.316552229126902},{"content":" pub unsafe fn release(self) -> H {\n\n self.0\n\n }\n\n}\n\n\n\npub(crate) trait BorrowsFrom: Sized {\n\n fn borrows<D: ?Sized>(self, _dep: &D) -> Borrows<Self>;\n\n}\n\n\n\nimpl<T: Sized> BorrowsFrom for T {\n\n fn borrows<D: ?Sized>(self, _dep: &D) -> Borrows<Self> {\n\n Borrows(self, PhantomData)\n\n }\n\n}\n\n\n","file_path":"vm-bindings/src/prelude.rs","rank":90,"score":5.074311112392075},{"content":" let executable = std::env::args()\n\n .next()\n\n .ok_or_else(|| ApplicationError::NoExecutableInArguments)?;\n\n Ok(PathBuf::from(executable))\n\n }\n\n\n\n pub fn working_directory(&self) -> &Path {\n\n self.working_directory.as_path()\n\n }\n\n\n\n pub fn process_arguments(&self) -> Vec<String> {\n\n std::env::args().collect()\n\n }\n\n}\n","file_path":"vm-client/src/application.rs","rank":91,"score":5.05731699929757},{"content":" }\n\n }\n\n\n\n pub fn is_on_worker_thread(&self) -> bool {\n\n unsafe { isVMRunOnWorkerThread() != 0 }\n\n }\n\n\n\n pub fn send(&self, request: GToolkitVMRequest) {\n\n self.sender.send(request);\n\n }\n\n\n\n pub fn call(&self, callout: GToolkitCallout) {\n\n println!(\"Requesting callout {:?}\", &callout);\n\n self.send(GToolkitVMRequest::Call(callout));\n\n }\n\n\n\n pub fn wake_up(&self) {\n\n println!(\"Sending wake up\");\n\n self.send(GToolkitVMRequest::WakeUp);\n\n }\n","file_path":"experimental/src/vm.rs","rank":92,"score":5.0532462263455145},{"content":"}\n\n\n\npub(crate) trait NativePointerOrNullMut2<N> {\n\n fn native_ptr_or_null_mut(&mut self) -> *mut N;\n\n}\n\n\n\npub(crate) trait NativePointerOrNull2<N> {\n\n fn native_ptr_or_null(&self) -> *const N;\n\n}\n\n\n\nimpl<H, N> NativePointerOrNull2<N> for Option<&H>\n\nwhere\n\n H: NativeTransmutable<N>,\n\n{\n\n fn native_ptr_or_null(&self) -> *const N {\n\n match self {\n\n Some(handle) => handle.native(),\n\n None => ptr::null(),\n\n }\n\n }\n","file_path":"vm-bindings/src/prelude.rs","rank":93,"score":5.0294010009850245},{"content":"use crate::bindings::{sqInt, usqInt};\n\nuse libffi::low::ffi_type;\n\n\n\nextern \"C\" {\n\n pub fn numSlotsOf(oop: sqInt) -> sqInt;\n\n}\n\n\n\nextern \"C\" {\n\n pub fn marshallArgumentFromatIndexintoofTypewithSize(\n\n argumentsArrayOop: sqInt,\n\n i: sqInt,\n\n argHolder: sqInt,\n\n argType: sqInt,\n\n argTypeSize: sqInt,\n\n );\n\n}\n\n\n\nextern \"C\" {\n\n pub fn marshallAndPushReturnValueFromofTypepoping(\n\n returnHolder: sqInt,\n","file_path":"experimental/src/cointerp.rs","rank":94,"score":4.969066492488202},{"content":"extern crate bindgen;\n\nextern crate cmake;\n\nextern crate file_matcher;\n\nextern crate fs_extra;\n\nextern crate titlecase;\n\nextern crate which;\n\n\n\nmod build_support;\n\nuse build_support::*;\n\n\n\n///\n\n/// Possible parameters\n\n/// - VM_CLIENT_VMMAKER to use a specific VM to run a VM Maker image\n","file_path":"vm-bindings/build.rs","rank":95,"score":4.965120106879324},{"content":"/// A trait that supports retrieving a pointer from an Option<Handle<Native>>.\n\n/// Returns a null pointer if the Option is None.\n\npub(crate) trait NativePointerOrNull<N> {\n\n fn native_ptr_or_null(&self) -> *const N;\n\n unsafe fn native_ptr_or_null_mut_force(&self) -> *mut N;\n\n}\n\n\n\npub(crate) trait NativePointerOrNullMut<N> {\n\n fn native_ptr_or_null_mut(&mut self) -> *mut N;\n\n}\n\n\n\nimpl<H, N> NativePointerOrNull<N> for Option<&H>\n\nwhere\n\n H: NativeAccess<N>,\n\n{\n\n fn native_ptr_or_null(&self) -> *const N {\n\n match self {\n\n Some(handle) => handle.native(),\n\n None => ptr::null(),\n\n }\n","file_path":"vm-bindings/src/prelude.rs","rank":96,"score":4.841823397658942},{"content":" let image_path = match validate_user_image_file(matches.value_of(\"image\")) {\n\n None => {\n\n eprintln!(\"Could not find an .image file\");\n\n return;\n\n }\n\n Some(path) => path,\n\n };\n\n\n\n let mut vm_args: Vec<String> = vec![];\n\n vm_args.push(std::env::args().collect::<Vec<String>>()[0].to_owned());\n\n vm_args.push(image_path.as_os_str().to_str().unwrap().to_owned());\n\n\n\n if let Some((external, sub_m)) = matches.subcommand() {\n\n vm_args.push(external.to_owned());\n\n if let Some(values) = sub_m.values_of(\"\") {\n\n for each in values {\n\n vm_args.push(each.to_owned());\n\n }\n\n }\n\n }\n\n\n\n let mut parameters = VMParameters::from_args(vm_args);\n\n parameters.set_image_file_name(image_path.as_os_str().to_str().unwrap().to_owned());\n\n parameters.set_is_interactive_session(matches.is_present(\"interactive\"));\n\n\n\n VM::start(parameters).unwrap();\n\n}\n","file_path":"vm-client/src/main_cli.rs","rank":97,"score":4.81677438282408},{"content":" fn clone(&self) -> Self {\n\n Self::from_native_c(self.0.clone())\n\n }\n\n}\n\n\n\nimpl<N: NativeDrop + NativePartialEq> PartialEq for Handle<N> {\n\n fn eq(&self, rhs: &Self) -> bool {\n\n self.native().eq(rhs.native())\n\n }\n\n}\n\n\n\nimpl<N: NativeDrop + NativeHash> Hash for Handle<N> {\n\n fn hash<H: Hasher>(&self, state: &mut H) {\n\n self.native().hash(state);\n\n }\n\n}\n\n\n\npub(crate) trait NativeSliceAccess<N: NativeDrop> {\n\n fn native(&self) -> &[N];\n\n fn native_mut(&mut self) -> &mut [N];\n","file_path":"vm-bindings/src/prelude.rs","rank":98,"score":4.756807946374478},{"content":"\n\n pub fn instantiate_indexable_class_of_size(\n\n &self,\n\n class: ObjectPointer,\n\n size: usize,\n\n is_pinned: bool,\n\n ) -> ObjectPointer {\n\n let oop = unsafe {\n\n instantiateClassindexableSizeisPinned(\n\n class.into_native(),\n\n size as usqInt,\n\n is_pinned as sqInt,\n\n )\n\n };\n\n\n\n ObjectPointer::from_native_c(oop)\n\n }\n\n\n\n pub fn new_external_address(&self) -> ObjectPointer {\n\n let external_address_class = self.class_external_address();\n","file_path":"experimental/src/vm.rs","rank":99,"score":4.561465331129403}],"string":"[\n {\n \"content\": \"#[no_mangle]\\n\\npub fn gtoolkit_vm_is_on_worker_thread(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) -> bool {\\n\\n gt_vm_ptr.with(|| false, |gt_vm| gt_vm.is_on_worker_thread())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 1,\n \"score\": 118262.39327501913\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn validate_user_image_file(image_name: Option<&str>) -> Option<PathBuf> {\\n\\n if let Some(image_file_name) = image_name {\\n\\n let image_path = PathBuf::new().join(image_file_name);\\n\\n if image_path.exists() {\\n\\n return Some(image_path);\\n\\n }\\n\\n }\\n\\n None\\n\\n}\\n\",\n \"file_path\": \"vm-client/src/image_finder.rs\",\n \"rank\": 2,\n \"score\": 103549.68257431456\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn gtoolkit_vm_wake_up(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) {\\n\\n gt_vm_ptr.with_not_null(|gt_vm| gt_vm.wake_up());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 3,\n \"score\": 92200.60872267836\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn gtoolkit_vm_minor_version(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) -> usize {\\n\\n gt_vm_ptr.with(|| 0, |gt_vm| gt_vm.minor_version())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 4,\n \"score\": 86941.03756800925\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn gtoolkit_vm_major_version(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) -> usize {\\n\\n gt_vm_ptr.with(|| 0, |gt_vm| gt_vm.major_version())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 5,\n \"score\": 86941.03756800925\n },\n {\n \"content\": \"#[cfg(all(not(target_os = \\\"macos\\\"),))]\\n\\npub fn executable_working_directory() -> Result<PathBuf> {\\n\\n // working_directory/bin/executable\\n\\n let mut app_dir = std::env::current_exe()?;\\n\\n\\n\\n // working_directory/bin/\\n\\n app_dir = app_dir\\n\\n .parent()\\n\\n .ok_or_else(|| ApplicationError::NoParentDirectory(app_dir.clone()))?\\n\\n .to_path_buf();\\n\\n\\n\\n // working_directory/\\n\\n app_dir = app_dir\\n\\n .parent()\\n\\n .ok_or_else(|| ApplicationError::NoParentDirectory(app_dir.clone()))?\\n\\n .to_path_buf();\\n\\n\\n\\n Ok(app_dir)\\n\\n}\\n\",\n \"file_path\": \"vm-client/src/working_directory.rs\",\n \"rank\": 6,\n \"score\": 85496.70761932316\n },\n {\n \"content\": \"/// Implements Hash for the native type so that the wrapper type\\n\\n/// can derive it from.\\n\\npub trait NativeHash {\\n\\n fn hash<H: Hasher>(&self, state: &mut H);\\n\\n}\\n\\n\\n\\n/// Wraps a native type that can be represented and used in Rust memory.\\n\\n///\\n\\n/// This type requires the trait `NativeDrop` to be implemented.\\n\\n#[repr(transparent)]\\n\\npub struct Handle<N: NativeDrop>(\\n\\n N,\\n\\n // `*const` is needed to suppress automatic Send and Sync derivation, which happens when the\\n\\n // underlying type generated by bindgen is Send and Sync.\\n\\n PhantomData<*const ()>,\\n\\n);\\n\\n\\n\\nimpl<N: NativeDrop> AsRef<Handle<N>> for Handle<N> {\\n\\n fn as_ref(&self) -> &Self {\\n\\n &self\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 7,\n \"score\": 85203.65425648226\n },\n {\n \"content\": \"/// Tag the type to automatically implement get() and set() functions\\n\\n/// for all Index & IndexMut implementation for that type.\\n\\npub trait IndexSet {}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 8,\n \"score\": 85203.65425648226\n },\n {\n \"content\": \"/// Clone for bindings types we can not implement Clone for.\\n\\npub trait NativeClone {\\n\\n fn clone(&self) -> Self;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 9,\n \"score\": 85203.65425648226\n },\n {\n \"content\": \"/// Implements Drop for native types we can not implement Drop for.\\n\\npub trait NativeDrop {\\n\\n fn drop(&mut self);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 10,\n \"score\": 85203.65425648226\n },\n {\n \"content\": \"/// Tag the type to automatically implement get() functions for\\n\\n/// all Index implementations.\\n\\npub trait IndexGet {}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 11,\n \"score\": 85203.65425648226\n },\n {\n \"content\": \"pub fn app_main() {\\n\\n let (sender, receiver) = channel();\\n\\n\\n\\n\\n\\n\\n\\n unsafe {\\n\\n let interpreter: VirtualMachine = unsafe { *sqGetInterpreterProxy() };\\n\\n\\n\\n let mut gt_vm = GTVM.lock().unwrap();\\n\\n *gt_vm = Some(GToolkitVM::new(sender, transmute(&receiver), interpreter));\\n\\n };\\n\\n\\n\\n // create a vector of zero terminated strings\\n\\n let mut args = std::env::args()\\n\\n .map(|arg| CString::new(arg).unwrap())\\n\\n .collect::<Vec<CString>>();\\n\\n\\n\\n // convert the strings to raw pointers\\n\\n let mut c_args = args\\n\\n .iter()\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 12,\n \"score\": 85071.00427791136\n },\n {\n \"content\": \"/// Even though some types may have value semantics, equality\\n\\n/// comparison may need to be customized.\\n\\npub trait NativePartialEq {\\n\\n fn eq(&self, rhs: &Self) -> bool;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 13,\n \"score\": 83344.73602411397\n },\n {\n \"content\": \"pub trait GToolkitVMPointer {\\n\\n fn with<DefaultBlock, Block, Return>(&self, default: DefaultBlock, block: Block) -> Return\\n\\n where\\n\\n DefaultBlock: FnOnce() -> Return,\\n\\n Block: FnOnce(>oolkitVM) -> Return;\\n\\n\\n\\n fn with_not_null<Block>(&self, block: Block)\\n\\n where\\n\\n Block: FnOnce(>oolkitVM);\\n\\n}\\n\\n\\n\\nimpl GToolkitVMPointer for *const Mutex<Option<GToolkitVM>> {\\n\\n fn with<DefaultBlock, Block, Return>(&self, default: DefaultBlock, block: Block) -> Return\\n\\n where\\n\\n DefaultBlock: FnOnce() -> Return,\\n\\n Block: FnOnce(>oolkitVM) -> Return,\\n\\n {\\n\\n if self.is_null() {\\n\\n return default();\\n\\n }\\n\",\n \"file_path\": \"experimental/src/vm.rs\",\n \"rank\": 14,\n \"score\": 83344.73602411397\n },\n {\n \"content\": \"/// Trait that enables access to a native representation of a wrapper type.\\n\\npub trait NativeAccess<N> {\\n\\n /// Provides shared access to the native type of the wrapper.\\n\\n fn native(&self) -> &N;\\n\\n\\n\\n /// Provides exclusive access to the native type of the wrapper.\\n\\n fn native_mut(&mut self) -> &mut N;\\n\\n\\n\\n // Returns a ptr to the native mutable value.\\n\\n unsafe fn native_mut_force(&self) -> *mut N {\\n\\n self.native() as *const N as *mut N\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 15,\n \"score\": 80155.88934508777\n },\n {\n \"content\": \"/// Declares a base class for a native type.\\n\\npub trait NativeBase<Base> {\\n\\n fn base(&self) -> &Base {\\n\\n unsafe { &*(self as *const Self as *const Base) }\\n\\n }\\n\\n\\n\\n fn base_mut(&mut self) -> &mut Base {\\n\\n unsafe { &mut *(self as *mut Self as *mut Base) }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct Sendable<H: ConditionallySend>(H);\\n\\nunsafe impl<H: ConditionallySend> Send for Sendable<H> {}\\n\\n\\n\\nimpl<H: ConditionallySend> Sendable<H> {\\n\\n pub fn unwrap(self) -> H {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 16,\n \"score\": 80152.55054440322\n },\n {\n \"content\": \"pub trait ConditionallySend: Sized {\\n\\n /// Returns `true` if the handle can be sent to another thread.\\n\\n fn can_send(&self) -> bool;\\n\\n /// Wrap the handle in a type that can be sent to another thread and unwrapped there.\\n\\n ///\\n\\n /// Guaranteed to succeed of can_send() returns `true`.\\n\\n fn wrap_send(self) -> Result<Sendable<Self>, Self>;\\n\\n}\\n\\n\\n\\n/// Functions that are (supposedly) _safer_ variants of the ones Rust provides.\\n\\npub(crate) mod safer {\\n\\n use core::slice;\\n\\n use std::ptr;\\n\\n\\n\\n /// Invokes [slice::from_raw_parts] with the `ptr` only when `len` != 0, otherwise passes\\n\\n /// `ptr::NonNull::dangling()` as recommended.\\n\\n ///\\n\\n /// Panics if `len` != 0 and `ptr` is `null`.\\n\\n pub unsafe fn from_raw_parts<'a, T>(ptr: *const T, len: usize) -> &'a [T] {\\n\\n let ptr = if len == 0 {\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 17,\n \"score\": 80152.55054440322\n },\n {\n \"content\": \"pub fn try_find_image_file_in_directory(path: PathBuf) -> Option<PathBuf> {\\n\\n let files = fs::read_dir(&path).unwrap();\\n\\n let image_files: Vec<PathBuf> = files\\n\\n .filter_map(Result::ok)\\n\\n .filter(|d| {\\n\\n if let Some(e) = d.path().extension() {\\n\\n e == \\\"image\\\"\\n\\n } else {\\n\\n false\\n\\n }\\n\\n })\\n\\n .map(|d| d.path().to_path_buf())\\n\\n .collect();\\n\\n\\n\\n match image_files.len() {\\n\\n 1 => Some(image_files[0].clone()),\\n\\n _ => None,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-client/src/image_finder.rs\",\n \"rank\": 18,\n \"score\": 79673.88713165271\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn gtoolkit_vm_get_receiver_signaller(\\n\\n gt_vm_ptr: *const Mutex<Option<GToolkitVM>>,\\n\\n thunk_ret_ptr: &mut *const c_void\\n\\n) -> unsafe extern \\\"C\\\" fn(*const c_void) {\\n\\n *thunk_ret_ptr = gt_vm_ptr as *const c_void;\\n\\n gt_vm_ptr.with(\\n\\n || gtoolkit_null_receiver_signaller as unsafe extern \\\"C\\\" fn(*const c_void),\\n\\n |gt_vm| gtoolkit_receiver_signaller as unsafe extern \\\"C\\\" fn(*const c_void)\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 19,\n \"score\": 79512.59502286835\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn gtoolkit_vm_main_thread_callout(\\n\\n gt_vm_ptr: *const Mutex<Option<GToolkitVM>>,\\n\\n cif: *mut ffi_cif,\\n\\n func: *mut c_void,\\n\\n args: *mut c_void,\\n\\n result: *mut c_void,\\n\\n semaphore: sqInt,\\n\\n) {\\n\\n gt_vm_ptr.with_not_null(|gt_vm| {\\n\\n gt_vm.call(GToolkitCallout {\\n\\n cif,\\n\\n func: CodePtr(func),\\n\\n args: Some(args as *mut *mut c_void),\\n\\n result: Some(result),\\n\\n semaphore,\\n\\n })\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 20,\n \"score\": 79512.59502286835\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn gtoolkit_vm_get_semaphore_signaller(\\n\\n gt_vm_ptr: *const Mutex<Option<GToolkitVM>>,\\n\\n thunk_ret_ptr: &mut *const c_void\\n\\n) -> unsafe extern \\\"C\\\" fn(usize, *const c_void) {\\n\\n *thunk_ret_ptr = gt_vm_ptr as *const c_void;\\n\\n gt_vm_ptr.with(\\n\\n || gtoolkit_null_semaphore_signaller as unsafe extern \\\"C\\\" fn(usize, *const c_void),\\n\\n |gt_vm| gt_vm.get_semaphore_signaller(),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 21,\n \"score\": 79512.59502286835\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn primitiveGetAddressOfGToolkitVM() {\\n\\n unsafe {\\n\\n let gtvm_raw = unsafe { Arc::into_raw(GTVM.clone()) };\\n\\n\\n\\n let gt_lock = GTVM.lock().unwrap();\\n\\n let gt = gt_lock.as_ref().unwrap();\\n\\n\\n\\n let mut stack_pointer = gt.get_stack_pointer();\\n\\n\\n\\n let external_address = gt.new_external_address_from_pointer(gtvm_raw);\\n\\n\\n\\n *stack_pointer = external_address.into_native();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 22,\n \"score\": 77905.19631997513\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn pick_image_with_dialog(default_path: Option<PathBuf>) -> Option<PathBuf> {\\n\\n let mut dialog = dialog();\\n\\n let mut dialog_ref = &mut dialog;\\n\\n if let Some(ref default_path) = default_path {\\n\\n dialog_ref = dialog_ref.default_path(default_path);\\n\\n }\\n\\n dialog_ref = dialog_ref.filter(\\\"image\\\");\\n\\n\\n\\n let result = dialog_ref.open().unwrap_or_else(|e| {\\n\\n panic!(\\\"{}\\\", e);\\n\\n });\\n\\n\\n\\n match result {\\n\\n Response::Okay(file_name) => {\\n\\n let file_path = PathBuf::new().join(file_name);\\n\\n if file_path.exists() {\\n\\n Some(file_path)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n _ => None,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-client/src/image_finder.rs\",\n \"rank\": 23,\n \"score\": 77113.60105693713\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn primitiveMainThreadCalloutGToolkitVM() {\\n\\n unsafe {\\n\\n let gt_lock = GTVM.lock().unwrap();\\n\\n let gt = gt_lock.as_ref().unwrap();\\n\\n\\n\\n let external_function_oop = gt.stack_object_value(StackOffset::from_native_c(\\n\\n TFPrimitiveCallout::ExternalFunction as sqInt,\\n\\n ));\\n\\n let external_function = gt.get_handler(external_function_oop);\\n\\n\\n\\n let cif_oop = gt.object_field_at(\\n\\n external_function_oop,\\n\\n ObjectFieldIndex::from_native_c(TFExternalFunction::Definition as sqInt),\\n\\n );\\n\\n\\n\\n let cif_ptr = gt.get_handler(cif_oop) as *mut ffi_cif;\\n\\n let cif: &ffi_cif = transmute(cif_ptr);\\n\\n\\n\\n let semaphore_index = gt.stack_integer_value(StackOffset::from_native_c(\\n\\n TFPrimitiveCallout::SemaphoreIndex as sqInt,\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 24,\n \"score\": 76400.83599547249\n },\n {\n \"content\": \"#[no_mangle]\\n\\npub fn primitiveExtractReturnValueGToolkitVM() {\\n\\n unsafe {\\n\\n let gt_lock = GTVM.lock().unwrap();\\n\\n let gt = gt_lock.as_ref().unwrap();\\n\\n\\n\\n let callout_address_oop = gt.stack_object_value(StackOffset::from_native_c(\\n\\n TFPrimitiveReturnValue::CalloutAddress as sqInt,\\n\\n ));\\n\\n let callout_address = gt.read_address(callout_address_oop) as *mut GToolkitCallout;\\n\\n\\n\\n let mut callout = Box::from_raw(callout_address);\\n\\n\\n\\n if callout.result.is_some() {\\n\\n let return_holder = callout.result.unwrap();\\n\\n\\n\\n gt.marshall_and_push_return_value_of_type_popping(\\n\\n return_holder,\\n\\n callout.return_type(),\\n\\n 2, // one for the argument + one for the receiver\\n\\n );\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 25,\n \"score\": 76400.83599547249\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn search_image_file_within_directories(directories: Vec<PathBuf>) -> Option<PathBuf> {\\n\\n for directory in directories {\\n\\n if let Some(image) = try_find_image_file_in_directory(directory) {\\n\\n return Some(image);\\n\\n }\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-client/src/image_finder.rs\",\n \"rank\": 26,\n \"score\": 76116.11437664709\n },\n {\n \"content\": \"/// Try to change the working directory back to the original location\\n\\npub fn un_translocate() -> Result<()> {\\n\\n let translocation = MacTranslocation::new()?;\\n\\n if let Some(original_location) = translocation.original_location()? {\\n\\n std::env::set_current_dir(\\n\\n original_location\\n\\n .parent()\\n\\n .ok_or_else(|| ApplicationError::NoParentDirectory(original_location.clone()))?,\\n\\n )?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\npub struct MacTranslocation {\\n\\n library: Library,\\n\\n}\\n\\n\\n\\nimpl MacTranslocation {\\n\\n pub fn new() -> Result<Self> {\\n\\n unsafe {\\n\\n let security_lib =\\n\",\n \"file_path\": \"vm-client/src/platform/mac/translocation.rs\",\n \"rank\": 27,\n \"score\": 74889.5535426516\n },\n {\n \"content\": \"pub trait IndexSetter<I, O: Copy> {\\n\\n fn set(&mut self, index: I, value: O) -> &mut Self;\\n\\n}\\n\\n\\n\\nimpl<T, I, O: Copy> IndexSetter<I, O> for T\\n\\nwhere\\n\\n T: IndexMut<I, Output = O> + IndexSet,\\n\\n{\\n\\n fn set(&mut self, index: I, value: O) -> &mut Self {\\n\\n self[index] = value;\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 28,\n \"score\": 73597.61857461008\n },\n {\n \"content\": \"pub trait IndexGetter<I, O: Copy> {\\n\\n fn get(&self, index: I) -> O;\\n\\n}\\n\\n\\n\\nimpl<T, I, O: Copy> IndexGetter<I, O> for T\\n\\nwhere\\n\\n T: Index<I, Output = O> + IndexGet,\\n\\n{\\n\\n fn get(&self, index: I) -> O {\\n\\n self[index]\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 29,\n \"score\": 73597.61857461008\n },\n {\n \"content\": \"/// Trait to use native types that as a rust type\\n\\n/// _inplace_ with the same size and field layout.\\n\\npub trait NativeTransmutable<NT: Sized>: Sized {\\n\\n /// Provides access to the native value through a\\n\\n /// transmuted reference to the Rust value.\\n\\n fn native(&self) -> &NT {\\n\\n unsafe { transmute_ref(self) }\\n\\n }\\n\\n\\n\\n /// Provides mutable access to the native value through a\\n\\n /// transmuted reference to the Rust value.\\n\\n fn native_mut(&mut self) -> &mut NT {\\n\\n unsafe { transmute_ref_mut(self) }\\n\\n }\\n\\n\\n\\n /// Copies the native value to an equivalent Rust value.\\n\\n ///\\n\\n /// The `_c` suffix is to remind callers that functions that return a native value from a C++\\n\\n /// ABI can't be used. For example, C++ member functions must be wrapped in a extern \\\"C\\\" function.\\n\\n fn from_native_c(nt: NT) -> Self {\\n\\n let r = unsafe { mem::transmute_copy::<NT, Self>(&nt) };\\n\\n // don't drop, the Rust type takes over.\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 30,\n \"score\": 71986.92291484107\n },\n {\n \"content\": \"///\\n\\n/// Possible parameters\\n\\n/// - VM_CLIENT_VMMAKER to use a specific VM to run a VM Maker image\\n\\nfn main() {\\n\\n let builder = match std::env::consts::OS {\\n\\n \\\"linux\\\" => LinuxBuilder::default().boxed(),\\n\\n \\\"macos\\\" => MacBuilder::default().boxed(),\\n\\n \\\"windows\\\" => WindowsBuilder::default().boxed(),\\n\\n _ => {\\n\\n panic!(\\\"The platform you're compiling for is not supported\\\");\\n\\n }\\n\\n };\\n\\n\\n\\n println!(\\\"About to build a vm using {:?}\\\", &builder);\\n\\n builder.ensure_build_tools();\\n\\n\\n\\n builder.compile_sources();\\n\\n\\n\\n if !builder.is_compiled() {\\n\\n panic!(\\\"Failed to compile {:?}\\\", builder.vm_binary().display())\\n\\n }\\n\\n\\n\\n builder.link_libraries();\\n\\n builder.generate_bindings();\\n\\n builder.export_shared_libraries();\\n\\n}\\n\",\n \"file_path\": \"vm-bindings/build.rs\",\n \"rank\": 31,\n \"score\": 47975.1304016979\n },\n {\n \"content\": \"fn main() {\\n\\n app_main()\\n\\n}\\n\",\n \"file_path\": \"experimental/src/main.rs\",\n \"rank\": 32,\n \"score\": 47972.165901496075\n },\n {\n \"content\": \"fn main() {\\n\\n match std::env::var(\\\"VM_CLIENT_EMBED_RESOURCES\\\") {\\n\\n Ok(resources) => {\\n\\n for resource in resources.split(\\\",\\\") {\\n\\n embed_resource::compile(resource);\\n\\n println!(\\\"cargo:rerun-if-changed={}\\\", resource);\\n\\n }\\n\\n }\\n\\n Err(_) => {}\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-client/build.rs\",\n \"rank\": 33,\n \"score\": 47972.165901496075\n },\n {\n \"content\": \"fn main() {\\n\\n if let Err(error) = run() {\\n\\n let error: Box<dyn std::error::Error> = Box::new(error);\\n\\n let user_facing_error: UserFacingError = error.into();\\n\\n user_facing_error.print_and_exit();\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-client/src/main.rs\",\n \"rank\": 34,\n \"score\": 46804.18557467917\n },\n {\n \"content\": \"fn main() {\\n\\n let matches = App::new(\\\"Virtual Machine\\\")\\n\\n .version(\\\"1.0\\\")\\n\\n .author(\\\"feenk gmbh. <contact@feenk.com>\\\")\\n\\n .setting(AppSettings::AllowExternalSubcommands)\\n\\n .setting(AppSettings::ColoredHelp)\\n\\n .arg(\\n\\n Arg::new(\\\"image\\\")\\n\\n .value_name(\\\"image\\\")\\n\\n .index(1)\\n\\n .required(true)\\n\\n .about(\\\"A path to an image file to run\\\"),\\n\\n )\\n\\n .arg(\\n\\n Arg::new(\\\"interactive\\\")\\n\\n .long(\\\"interactive\\\")\\n\\n .about(\\\"Start image in the interactive (UI) mode\\\"),\\n\\n )\\n\\n .get_matches();\\n\\n\\n\",\n \"file_path\": \"vm-client/src/main_cli.rs\",\n \"rank\": 35,\n \"score\": 45725.36405143606\n },\n {\n \"content\": \"fn run() -> Result<()> {\\n\\n // we should read options and canonicalize the image path before changing current directory\\n\\n let mut options: AppOptions = AppOptions::parse();\\n\\n options.canonicalize()?;\\n\\n\\n\\n #[cfg(target_os = \\\"macos\\\")]\\n\\n if let Err(error) = platform::mac::translocation::un_translocate() {\\n\\n error!(\\\"Failed to un-translocate the app due to {}\\\", error);\\n\\n }\\n\\n\\n\\n let application = Application::new(options)?;\\n\\n application.start()?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-client/src/main.rs\",\n \"rank\": 36,\n \"score\": 43725.3581640106\n },\n {\n \"content\": \"use crate::build_support::Builder;\\n\\n\\n\\nuse file_matcher::OneEntry;\\n\\nuse std::fmt;\\n\\nuse std::fmt::{Debug, Formatter};\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct LinuxBuilder;\\n\\n\\n\\nimpl Debug for LinuxBuilder {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n self.print_directories(f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Builder for LinuxBuilder {\\n\\n fn vm_binary(&self) -> PathBuf {\\n\\n self.compiled_libraries_directory()\\n\\n .join(\\\"libPharoVMCore.so\\\")\\n\",\n \"file_path\": \"vm-bindings/build_support/linux.rs\",\n \"rank\": 48,\n \"score\": 14.53324544924781\n },\n {\n \"content\": \"use crate::build_support::Builder;\\n\\n\\n\\nuse file_matcher::OneEntry;\\n\\nuse std::fmt;\\n\\nuse std::fmt::{Debug, Formatter};\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct MacBuilder;\\n\\n\\n\\nimpl Debug for MacBuilder {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n self.print_directories(f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Builder for MacBuilder {\\n\\n fn vm_binary(&self) -> PathBuf {\\n\\n self.compiled_libraries_directory()\\n\\n .join(\\\"libPharoVMCore.dylib\\\")\\n\",\n \"file_path\": \"vm-bindings/build_support/mac.rs\",\n \"rank\": 49,\n \"score\": 14.44993252893391\n },\n {\n \"content\": \"use crate::build_support::Builder;\\n\\nuse file_matcher::{FileNamed, OneEntry};\\n\\nuse std::fmt;\\n\\nuse std::fmt::{Debug, Formatter};\\n\\nuse std::path::{Path, PathBuf};\\n\\nuse std::process::Command;\\n\\nuse titlecase::titlecase;\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct WindowsBuilder {}\\n\\n\\n\\nimpl Debug for WindowsBuilder {\\n\\n fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {\\n\\n self.print_directories(f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl WindowsBuilder {\\n\\n fn pthreads_directory(&self) -> PathBuf {\\n\\n self.output_directory().join(\\\"pthreads\\\")\\n\",\n \"file_path\": \"vm-bindings/build_support/windows.rs\",\n \"rank\": 50,\n \"score\": 14.206576320637982\n },\n {\n \"content\": \"mod builder;\\n\\npub use builder::Builder;\\n\\n\\n\\nmod linux;\\n\\nmod mac;\\n\\nmod windows;\\n\\n\\n\\npub use linux::LinuxBuilder;\\n\\npub use mac::MacBuilder;\\n\\npub use windows::WindowsBuilder;\\n\",\n \"file_path\": \"vm-bindings/build_support/mod.rs\",\n \"rank\": 51,\n \"score\": 11.730431658216018\n },\n {\n \"content\": \" None\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) trait IfBoolSome {\\n\\n fn if_true_some<V>(self, v: V) -> Option<V>;\\n\\n fn if_false_some<V>(self, v: V) -> Option<V>;\\n\\n fn if_true_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V>;\\n\\n fn if_false_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V>;\\n\\n}\\n\\n\\n\\nimpl IfBoolSome for bool {\\n\\n fn if_true_some<V>(self, v: V) -> Option<V> {\\n\\n self.into_option().and(Some(v))\\n\\n }\\n\\n\\n\\n fn if_false_some<V>(self, v: V) -> Option<V> {\\n\\n (!self).if_true_some(v)\\n\\n }\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 52,\n \"score\": 9.676471785680036\n },\n {\n \"content\": \"use crate::bindings::{\\n\\n vm_parameters_destroy, vm_parameters_parse, VMParameterVector as NativeVMParameterVector,\\n\\n VMParameters as NativeVMParameters,\\n\\n};\\n\\nuse crate::parameter_vector::{ImageParameters, VirtualMachineParameters};\\n\\nuse crate::prelude::{Handle, NativeAccess, NativeDrop};\\n\\nuse std::ffi::{CStr, CString};\\n\\nuse std::fmt;\\n\\nuse std::mem::forget;\\n\\nuse std::os::raw::{c_char, c_void};\\n\\n\\n\\npub type VMParameters = Handle<NativeVMParameters>;\\n\\n\\n\\nimpl NativeDrop for NativeVMParameters {\\n\\n fn drop(&mut self) {\\n\\n unsafe {\\n\\n vm_parameters_destroy(self);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 53,\n \"score\": 8.940896088065458\n },\n {\n \"content\": \"\\n\\n pub fn arguments(&self) -> Vec<String> {\\n\\n let args_ptr = self.native().processArgv as *mut *mut c_char;\\n\\n let args_length = self.native().processArgc as usize;\\n\\n\\n\\n let arg_ptrs: Vec<*mut c_char> =\\n\\n unsafe { Vec::from_raw_parts(args_ptr, args_length, args_length) };\\n\\n let arguments: Vec<String> = arg_ptrs\\n\\n .iter()\\n\\n .map(|each| unsafe { CStr::from_ptr(*each).to_string_lossy().into_owned() })\\n\\n .collect();\\n\\n\\n\\n std::mem::forget(arg_ptrs);\\n\\n arguments\\n\\n }\\n\\n\\n\\n pub fn has_arguments(&self) -> bool {\\n\\n self.native().processArgc > 0\\n\\n }\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 54,\n \"score\": 8.338797389708354\n },\n {\n \"content\": \"\\n\\n pub fn eden_size(&self) -> usize {\\n\\n self.native().edenSize as usize\\n\\n }\\n\\n\\n\\n pub fn image_parameters(&self) -> &ImageParameters {\\n\\n ImageParameters::borrow_from_native(&self.native().imageParameters)\\n\\n }\\n\\n\\n\\n pub fn virtual_machine_parameters(&self) -> &VirtualMachineParameters {\\n\\n VirtualMachineParameters::borrow_from_native(&self.native().imageParameters)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for VMParameters {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n f.debug_struct(\\\"VMParameters\\\")\\n\\n .field(\\\"image_file_name\\\", &self.image_file_name())\\n\\n .field(\\\"arguments\\\", &self.arguments())\\n\\n .field(\\\"is_default_image\\\", &self.is_default_image())\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 55,\n \"score\": 8.185986932457476\n },\n {\n \"content\": \" use std::ffi::OsString;\\n\\n use std::os::windows::ffi::{OsStrExt, OsStringExt};\\n\\n\\n\\n let mut path = path.as_ref().to_path_buf().into_os_string();\\n\\n\\n\\n let wchars = path\\n\\n .encode_wide()\\n\\n .map(|wchar| {\\n\\n if wchar == b'\\\\\\\\' as u16 {\\n\\n '/' as u16\\n\\n } else {\\n\\n wchar\\n\\n }\\n\\n })\\n\\n .collect::<Vec<_>>();\\n\\n path = OsString::from_wide(&wchars);\\n\\n PathBuf::from(path)\\n\\n }\\n\\n #[cfg(not(windows))]\\n\\n {\\n\",\n \"file_path\": \"vm-bindings/build_support/windows.rs\",\n \"rank\": 56,\n \"score\": 8.016696847023802\n },\n {\n \"content\": \"\\n\\n let c_str: &CStr = unsafe { CStr::from_ptr(self.native().imageFileName) };\\n\\n let str_slice: &str = c_str.to_str().unwrap();\\n\\n str_slice.to_owned()\\n\\n }\\n\\n\\n\\n pub fn set_image_file_name<P: Into<String>>(&mut self, file_name: P) {\\n\\n let new_image_name: String = file_name.into();\\n\\n\\n\\n if self.image_file_name() == new_image_name {\\n\\n return;\\n\\n }\\n\\n\\n\\n let previous_file_name = self.native().imageFileName as *mut c_void;\\n\\n unsafe { crate::bindings::free(previous_file_name) };\\n\\n\\n\\n let c_str = CString::new(new_image_name).unwrap();\\n\\n self.native_mut().imageFileName = c_str.into_raw();\\n\\n self.native_mut().isDefaultImage = false;\\n\\n }\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 57,\n \"score\": 7.812180188406414\n },\n {\n \"content\": \" let previous_args = previous_arg_ptrs\\n\\n .iter()\\n\\n .map(|each| unsafe { CString::from_raw(*each) })\\n\\n .collect::<Vec<CString>>();\\n\\n\\n\\n drop(previous_args);\\n\\n drop(previous_arg_ptrs);\\n\\n }\\n\\n\\n\\n self.native_mut().processArgv = args_ptr;\\n\\n self.native_mut().processArgc = args_length;\\n\\n }\\n\\n\\n\\n pub fn is_default_image(&self) -> bool {\\n\\n self.native().isDefaultImage\\n\\n }\\n\\n\\n\\n pub fn is_default_image_found(&self) -> bool {\\n\\n self.native().defaultImageFound\\n\\n }\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 58,\n \"score\": 7.643179845912693\n },\n {\n \"content\": \" fn construct(construct: impl FnOnce(*mut NT)) -> Self {\\n\\n Self::try_construct(|i| {\\n\\n construct(i);\\n\\n true\\n\\n })\\n\\n .unwrap()\\n\\n }\\n\\n\\n\\n fn try_construct(construct: impl FnOnce(*mut NT) -> bool) -> Option<Self> {\\n\\n self::try_construct(construct).map(Self::from_native_c)\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) trait NativeTransmutableSliceAccess<NT: Sized> {\\n\\n fn native(&self) -> &[NT];\\n\\n fn native_mut(&mut self) -> &mut [NT];\\n\\n}\\n\\n\\n\\nimpl<NT, ElementT> NativeTransmutableSliceAccess<NT> for [ElementT]\\n\\nwhere\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 59,\n \"score\": 7.591846208244408\n },\n {\n \"content\": \"use crate::{ApplicationError, Result};\\n\\nuse clap::{AppSettings, Clap};\\n\\nuse std::path::{Path, PathBuf};\\n\\n\\n\\n#[derive(Clap, Clone, Debug)]\\n\\n#[clap(version = \\\"1.0\\\", author = \\\"feenk gmbh <contact@feenk.com>\\\")]\\n\\n#[clap(setting = AppSettings::ColoredHelp)]\\n\\npub struct AppOptions {\\n\\n /// A path to a custom Pharo .image to use instead of automatically detecting one\\n\\n #[clap(long, parse(from_os_str))]\\n\\n image: Option<PathBuf>,\\n\\n}\\n\\n\\n\\nimpl AppOptions {\\n\\n pub fn canonicalize(&mut self) -> Result<()> {\\n\\n if let Some(ref image) = self.image {\\n\\n if !image.exists() {\\n\\n return ApplicationError::ImageFileDoesNotExist(image.clone()).into();\\n\\n }\\n\\n self.image = Some(to_absolute::canonicalize(image)?);\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn image(&self) -> Option<&Path> {\\n\\n self.image.as_ref().map(|image| image.as_path())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-client/src/application_options.rs\",\n \"rank\": 60,\n \"score\": 7.579784528965964\n },\n {\n \"content\": \" let mut parameters = VMParameters::from_args(vm_args);\\n\\n parameters.set_image_file_name(self.image.as_os_str().to_str().unwrap().to_owned());\\n\\n parameters.set_is_interactive_session(true);\\n\\n\\n\\n VM::start(parameters).unwrap();\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn executable_name(&self) -> Result<String> {\\n\\n let executable_path = self.executable_path()?;\\n\\n let executable_name = executable_path\\n\\n .file_name()\\n\\n .ok_or_else(|| ApplicationError::FailedToGetFileName(executable_path.clone()))?;\\n\\n let executable_name = executable_name.to_str().ok_or_else(|| {\\n\\n ApplicationError::FailedToConvertOsString(executable_name.to_os_string())\\n\\n })?;\\n\\n Ok(executable_name.to_string())\\n\\n }\\n\\n\\n\\n pub fn executable_path(&self) -> Result<PathBuf> {\\n\",\n \"file_path\": \"vm-client/src/application.rs\",\n \"rank\": 61,\n \"score\": 7.473186109399805\n },\n {\n \"content\": \"use crate::bindings::{\\n\\n firstIndexableField, getHandler, instantiateClassindexableSize, isVMRunOnWorkerThread,\\n\\n readAddress, signalSemaphoreWithIndex, sqInt, usqInt, BytesPerWord, VirtualMachine,\\n\\n};\\n\\n\\n\\nuse std::sync::mpsc::{Sender, Receiver, RecvError};\\n\\n\\n\\nuse crate::cointerp::{\\n\\n instantiateClassindexableSizeisPinned, marshallAndPushReturnValueFromofTypepoping,\\n\\n marshallArgumentFromatIndexintoofTypewithSize, numSlotsOf,\\n\\n};\\n\\nuse crate::prelude::NativeTransmutable;\\n\\nuse libc::c_char;\\n\\nuse libc::c_int;\\n\\nuse libffi::low::{ffi_cif, ffi_type, CodePtr};\\n\\n\\n\\nuse std::intrinsics::transmute;\\n\\nuse std::os::raw::c_void;\\n\\nuse std::sync::{Arc, Mutex};\\n\\nuse std::fmt::Debug;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct GToolkitVM {\\n\\n sender: Sender<GToolkitVMRequest>,\\n\\n receiver: &'static Receiver<GToolkitVMRequest>,\\n\\n interpreter: VirtualMachine,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"experimental/src/vm.rs\",\n \"rank\": 62,\n \"score\": 7.2979503047799215\n },\n {\n \"content\": \"use std::ffi::OsString;\\n\\nuse std::path::PathBuf;\\n\\nuse thiserror::Error;\\n\\n\\n\\npub type Result<T> = core::result::Result<T, ApplicationError>;\\n\\n\\n\\n#[derive(Error, Debug)]\\n\\npub enum ApplicationError {\\n\\n #[error(\\\"Input/Output error\\\")]\\n\\n IoError(#[from] std::io::Error),\\n\\n #[cfg(target_os = \\\"macos\\\")]\\n\\n #[error(\\\"Failed to load the library\\\")]\\n\\n LibLoadingError(#[from] libloading::Error),\\n\\n #[error(\\\"Failed to canonicalize a path\\\")]\\n\\n CanonicalizationError(#[from] to_absolute::Error),\\n\\n #[error(\\\"Failed to detect if the executable is translocated\\\")]\\n\\n FailedToDetectIfTranslocated,\\n\\n #[error(\\\"Failed to detect the original translocated path\\\")]\\n\\n FailedToDetectOriginalTranslocatedPath,\\n\\n #[error(\\\"Failed to open terminal\\\")]\\n\",\n \"file_path\": \"vm-client/src/error.rs\",\n \"rank\": 63,\n \"score\": 7.117065901206686\n },\n {\n \"content\": \"use nfd2::{dialog, Response};\\n\\nuse std::fs;\\n\\nuse std::path::PathBuf;\\n\\n\\n\",\n \"file_path\": \"vm-client/src/image_finder.rs\",\n \"rank\": 64,\n \"score\": 7.116893635940901\n },\n {\n \"content\": \" let mut bool_is_translocated = false;\\n\\n\\n\\n if is_translocated_fn(\\n\\n url,\\n\\n &mut bool_is_translocated as *mut _,\\n\\n std::ptr::null_mut(),\\n\\n ) {\\n\\n } else {\\n\\n return Err(ApplicationError::FailedToDetectIfTranslocated);\\n\\n }\\n\\n Ok(bool_is_translocated)\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn original_location(&self) -> Result<Option<PathBuf>> {\\n\\n unsafe {\\n\\n let original_path_fn: Symbol<\\n\\n unsafe extern \\\"C\\\" fn(CFURLRef, *mut CFErrorRef) -> CFURLRef,\\n\\n > = match self.library.get(b\\\"SecTranslocateCreateOriginalPathForURL\\\") {\\n\\n Ok(func) => func,\\n\",\n \"file_path\": \"vm-client/src/platform/mac/translocation.rs\",\n \"rank\": 65,\n \"score\": 7.0137316362942235\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate lazy_static;\\n\\n\\n\\npub mod bindings;\\n\\npub mod cointerp;\\n\\npub mod prelude;\\n\\npub mod vm;\\n\\n\\n\\nuse std::ffi::CString;\\n\\n\\n\\nuse libc::c_char;\\n\\nuse libc::c_int;\\n\\nuse libffi::low::{ffi_cif, ffi_type, CodePtr};\\n\\n\\n\\nuse crate::bindings::{\\n\\n calloc, checkedLongAtput, firstIndexableField, free, instantiateClassindexableSize,\\n\\n isVMRunOnWorkerThread, loadModuleHandle, malloc, memcpy, methodArgumentCount,\\n\\n signalSemaphoreWithIndex, sqGetInterpreterProxy, sqInt, stackObjectValue, usqInt,\\n\\n vm_main_with_parameters, vm_parameters_parse, vm_run_interpreter, BytesPerWord,\\n\\n VMParameterVector, VirtualMachine, TRUE,\\n\",\n \"file_path\": \"experimental/src/lib.rs\",\n \"rank\": 66,\n \"score\": 6.918152678530301\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Converts a pointer to a mutable native value into a pointer to the mutable Rust value.\\n\\n #[allow(unused)]\\n\\n pub(crate) fn from_native_ptr_mut(np: *mut N) -> *mut Self {\\n\\n np as _\\n\\n }\\n\\n\\n\\n /// Constructs a C++ object in place by calling a\\n\\n /// function that expects a pointer that points to\\n\\n /// uninitialized memory of the native type.\\n\\n pub(crate) fn construct(construct: impl FnOnce(*mut N)) -> Self {\\n\\n Self::try_construct(|i| {\\n\\n construct(i);\\n\\n true\\n\\n })\\n\\n .unwrap()\\n\\n }\\n\\n\\n\\n pub(crate) fn try_construct(construct: impl FnOnce(*mut N) -> bool) -> Option<Self> {\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 67,\n \"score\": 6.842626127212889\n },\n {\n \"content\": \"use std::path::{Path, PathBuf};\\n\\n\\n\\nuse vm_bindings::{VMParameters, VM};\\n\\n\\n\\nuse crate::image_finder::{pick_image_with_dialog, search_image_file_within_directories};\\n\\nuse crate::working_directory::executable_working_directory;\\n\\nuse crate::AppOptions;\\n\\nuse crate::{ApplicationError, Result};\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Application {\\n\\n options: AppOptions,\\n\\n working_directory: PathBuf,\\n\\n image: PathBuf,\\n\\n}\\n\\n\\n\\nimpl Application {\\n\\n pub fn new(options: AppOptions) -> Result<Self> {\\n\\n let mut image = options.image().map(|image| image.to_path_buf());\\n\\n if image.is_none() {\\n\",\n \"file_path\": \"vm-client/src/application.rs\",\n \"rank\": 68,\n \"score\": 6.838919998154634\n },\n {\n \"content\": \"mod bindings;\\n\\nmod parameter_vector;\\n\\nmod parameters;\\n\\nmod prelude;\\n\\nmod vm;\\n\\n\\n\\npub use parameters::VMParameters;\\n\\npub use vm::VM;\\n\",\n \"file_path\": \"vm-bindings/src/lib.rs\",\n \"rank\": 69,\n \"score\": 6.565824578021897\n },\n {\n \"content\": \" ptr::NonNull::new(ptr).map(Self)\\n\\n }\\n\\n\\n\\n pub(crate) fn into_ptr(self) -> *mut N {\\n\\n let p = self.0.as_ptr();\\n\\n mem::forget(self);\\n\\n p\\n\\n }\\n\\n}\\n\\n\\n\\n/// A trait that consumes self and converts it to a ptr to the native type.\\n\\npub(crate) trait IntoPtr<N> {\\n\\n fn into_ptr(self) -> *mut N;\\n\\n}\\n\\n\\n\\n/// A trait that consumes self and converts it to a ptr to the native type or null.\\n\\npub(crate) trait IntoPtrOrNull<N> {\\n\\n fn into_ptr_or_null(self) -> *mut N;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 70,\n \"score\": 6.551185333087829\n },\n {\n \"content\": \"use crate::bindings::VMParameterVector as NativeVMParameterVector;\\n\\nuse crate::prelude::{transmute_ref, NativeAccess};\\n\\nuse std::ffi::CStr;\\n\\n\\n\\n#[repr(transparent)]\\n\\npub struct VirtualMachineParameters(NativeVMParameterVector);\\n\\n\\n\\nimpl NativeAccess<NativeVMParameterVector> for VirtualMachineParameters {\\n\\n fn native(&self) -> &NativeVMParameterVector {\\n\\n &self.0\\n\\n }\\n\\n\\n\\n fn native_mut(&mut self) -> &mut NativeVMParameterVector {\\n\\n &mut self.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl VirtualMachineParameters {\\n\\n pub fn len(&self) -> usize {\\n\\n self.native().count as usize\\n\",\n \"file_path\": \"vm-bindings/src/parameter_vector.rs\",\n \"rank\": 71,\n \"score\": 6.412048478162866\n },\n {\n \"content\": \" .parent()\\n\\n .ok_or_else(|| ApplicationError::NoParentDirectory(image.clone()))?\\n\\n .to_path_buf();\\n\\n\\n\\n Ok(Self {\\n\\n options,\\n\\n working_directory,\\n\\n image,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn start(&self) -> Result<()> {\\n\\n std::env::set_current_dir(self.working_directory.as_path())?;\\n\\n\\n\\n let executable_path = std::env::current_exe()?;\\n\\n\\n\\n let mut vm_args: Vec<String> = vec![];\\n\\n vm_args.push(executable_path.as_os_str().to_str().unwrap().to_owned());\\n\\n vm_args.push(self.image.as_os_str().to_str().unwrap().to_owned());\\n\\n\\n\",\n \"file_path\": \"vm-client/src/application.rs\",\n \"rank\": 72,\n \"score\": 6.373046432397253\n },\n {\n \"content\": \"// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\\n\\n// SOFTWARE.\\n\\n\\n\\n// See https://github.com/rust-skia/rust-skia\\n\\n// Licence https://github.com/rust-skia/rust-skia/blob/master/LICENSE\\n\\n#![allow(dead_code)]\\n\\n\\n\\nuse std::hash::{Hash, Hasher};\\n\\nuse std::mem::MaybeUninit;\\n\\nuse std::ops::{Deref, DerefMut, Index, IndexMut};\\n\\nuse std::{mem, ptr, slice};\\n\\n// Re-export TryFrom / TryInto to make them available in all modules that use prelude::*.\\n\\npub use std::convert::{TryFrom, TryInto};\\n\\nuse std::marker::PhantomData;\\n\\n\\n\\n/// Swiss army knife to convert any reference into any other.\\n\\npub(crate) unsafe fn transmute_ref<FromT, ToT>(from: &FromT) -> &ToT {\\n\\n // TODO: can we do this statically for all instantiations of transmute_ref?\\n\\n debug_assert_eq!(mem::size_of::<FromT>(), mem::size_of::<ToT>());\\n\\n &*(from as *const FromT as *const ToT)\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 73,\n \"score\": 6.363357406346259\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<N: NativeDrop> ReplaceWith<Handle<N>> for N {\\n\\n fn replace_with(&mut self, other: Handle<N>) -> Handle<N> {\\n\\n other.replace_native(self)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Constructs a C++ object in place by calling a lambda that is meant to initialize\\n\\n/// the pointer to the Rust memory provided as a pointer.\\n\\npub(crate) fn construct<N>(construct: impl FnOnce(*mut N)) -> N {\\n\\n try_construct(|i| {\\n\\n construct(i);\\n\\n true\\n\\n })\\n\\n .unwrap()\\n\\n}\\n\\n\\n\\npub(crate) fn try_construct<N>(construct: impl FnOnce(*mut N) -> bool) -> Option<N> {\\n\\n let mut instance = MaybeUninit::uninit();\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 74,\n \"score\": 6.325061687981472\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn as_vec(&self) -> Vec<String> {\\n\\n self.iter().collect()\\n\\n }\\n\\n\\n\\n pub(crate) fn borrow_from_native(native: &NativeVMParameterVector) -> &Self {\\n\\n unsafe { transmute_ref(native) }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct ParametersVectorIterator<'a> {\\n\\n vector: &'a NativeVMParameterVector,\\n\\n index: usize,\\n\\n}\\n\\n\\n\\nimpl<'a> Iterator for ParametersVectorIterator<'a> {\\n\\n type Item = String;\\n\\n fn next(&mut self) -> Option<String> {\\n\",\n \"file_path\": \"vm-bindings/src/parameter_vector.rs\",\n \"rank\": 75,\n \"score\": 6.290588231557357\n },\n {\n \"content\": \"#![windows_subsystem = \\\"windows\\\"]\\n\\n\\n\\nextern crate dirs;\\n\\nextern crate nfd2;\\n\\nextern crate thiserror;\\n\\nextern crate vm_bindings;\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nmod error;\\n\\nmod image_finder;\\n\\n\\n\\nmod application;\\n\\nmod application_options;\\n\\nmod platform;\\n\\nmod working_directory;\\n\\n\\n\\nuse clap::Clap;\\n\\n\\n\\nuse user_error::{UserFacingError, UFE};\\n\\n\\n\\npub use crate::application::Application;\\n\\npub use crate::application_options::AppOptions;\\n\\npub use crate::error::*;\\n\\n\\n\",\n \"file_path\": \"vm-client/src/main.rs\",\n \"rank\": 76,\n \"score\": 6.273934776635405\n },\n {\n \"content\": \" Library::new(\\\"/System/Library/Frameworks/Security.framework/Security\\\")?;\\n\\n Ok(Self {\\n\\n library: security_lib,\\n\\n })\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn is_translocated(&self) -> Result<bool> {\\n\\n unsafe {\\n\\n let is_translocated_fn: Symbol<\\n\\n unsafe extern \\\"C\\\" fn(CFURLRef, *mut bool, *mut CFErrorRef) -> bool,\\n\\n > = match self.library.get(b\\\"SecTranslocateIsTranslocatedURL\\\") {\\n\\n Ok(func) => func,\\n\\n Err(_) => {\\n\\n return Ok(false);\\n\\n }\\n\\n };\\n\\n\\n\\n let bundle = CFBundleGetMainBundle();\\n\\n let url = CFBundleCopyBundleURL(bundle);\\n\",\n \"file_path\": \"vm-client/src/platform/mac/translocation.rs\",\n \"rank\": 77,\n \"score\": 6.168321896013727\n },\n {\n \"content\": \"use crate::bindings::vm_main_with_parameters;\\n\\nuse crate::prelude::NativeAccess;\\n\\nuse crate::VMParameters;\\n\\nuse std::error::Error;\\n\\n\\n\\npub struct VM {}\\n\\n\\n\\nimpl VM {\\n\\n pub fn start(mut parameters: VMParameters) -> Result<(), Box<dyn Error>> {\\n\\n unsafe {\\n\\n vm_main_with_parameters(parameters.native_mut());\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-bindings/src/vm.rs\",\n \"rank\": 78,\n \"score\": 6.149296125447023\n },\n {\n \"content\": \" if self.index < self.vector.count as usize {\\n\\n let slice = unsafe {\\n\\n std::slice::from_raw_parts_mut(self.vector.parameters, self.vector.count as usize)\\n\\n };\\n\\n let chars = unsafe { CStr::from_ptr(slice[self.index]) };\\n\\n let string = String::from(chars.to_string_lossy());\\n\\n self.index += 1;\\n\\n Some(string)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-bindings/src/parameter_vector.rs\",\n \"rank\": 79,\n \"score\": 6.051763449085561\n },\n {\n \"content\": \"#![cfg(target_os = \\\"macos\\\")]\\n\\n\\n\\nuse crate::error::ApplicationError;\\n\\nuse crate::Result;\\n\\nuse core_foundation::base::{Boolean, CFIndex};\\n\\nuse core_foundation::bundle::{CFBundleCopyBundleURL, CFBundleGetMainBundle};\\n\\nuse core_foundation::error::CFErrorRef;\\n\\nuse core_foundation::url::{CFURLGetFileSystemRepresentation, CFURLRef};\\n\\nuse libc::{c_char, strlen, PATH_MAX};\\n\\nuse libloading::{Library, Symbol};\\n\\nuse std::path::PathBuf;\\n\\n\\n\\n#[cfg(unix)]\\n\\nuse std::ffi::OsStr;\\n\\n#[cfg(unix)]\\n\\nuse std::os::unix::ffi::OsStrExt;\\n\\n\\n\\n/// Try to change the working directory back to the original location\\n\",\n \"file_path\": \"vm-client/src/platform/mac/translocation.rs\",\n \"rank\": 80,\n \"score\": 5.850766977340543\n },\n {\n \"content\": \"\\n\\n pub fn is_interactive_session(&self) -> bool {\\n\\n self.native().isInteractiveSession\\n\\n }\\n\\n\\n\\n pub fn set_is_interactive_session(&mut self, is_interactive_session: bool) {\\n\\n self.native_mut().isInteractiveSession = is_interactive_session;\\n\\n }\\n\\n\\n\\n pub fn max_stack_frames_to_print(&self) -> usize {\\n\\n self.native().maxStackFramesToPrint as usize\\n\\n }\\n\\n\\n\\n pub fn max_old_space_size(&self) -> usize {\\n\\n self.native().maxOldSpaceSize as usize\\n\\n }\\n\\n\\n\\n pub fn max_code_size(&self) -> usize {\\n\\n self.native().maxCodeSize as usize\\n\\n }\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 81,\n \"score\": 5.835081883621386\n },\n {\n \"content\": \"\\n\\n fn if_true_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V> {\\n\\n self.into_option().map(|()| f())\\n\\n }\\n\\n\\n\\n fn if_false_then_some<V>(self, f: impl FnOnce() -> V) -> Option<V> {\\n\\n (!self).into_option().map(|()| f())\\n\\n }\\n\\n}\\n\\n\\n\\n/// Trait that enables access to a native representation of a wrapper type.\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 82,\n \"score\": 5.8251219762315385\n },\n {\n \"content\": \"}\\n\\n\\n\\npub(crate) unsafe fn transmute_ref_mut<FromT, ToT>(from: &mut FromT) -> &mut ToT {\\n\\n // TODO: can we do this statically for all instantiations of transmute_ref_mut?\\n\\n debug_assert_eq!(mem::size_of::<FromT>(), mem::size_of::<ToT>());\\n\\n &mut *(from as *mut FromT as *mut ToT)\\n\\n}\\n\\n\\n\\npub(crate) trait IntoOption {\\n\\n type Target;\\n\\n fn into_option(self) -> Option<Self::Target>;\\n\\n}\\n\\n\\n\\nimpl<T> IntoOption for *const T {\\n\\n type Target = *const T;\\n\\n\\n\\n fn into_option(self) -> Option<Self::Target> {\\n\\n if !self.is_null() {\\n\\n Some(self)\\n\\n } else {\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 83,\n \"score\": 5.779191617124769\n },\n {\n \"content\": \" println!(\\\"GT woke up\\\");\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n}\\n\\n\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct GToolkitCallout {\\n\\n pub(crate) cif: *mut ffi_cif,\\n\\n pub(crate) func: CodePtr,\\n\\n pub(crate) args: Option<*mut *mut c_void>,\\n\\n pub(crate) result: Option<*mut c_void>,\\n\\n pub(crate) semaphore: sqInt,\\n\\n}\\n\\n\\n\\nimpl GToolkitCallout {\\n\\n pub fn call(&self) {\\n\\n unsafe {\\n\",\n \"file_path\": \"experimental/src/vm.rs\",\n \"rank\": 84,\n \"score\": 5.500881477030909\n },\n {\n \"content\": \" unsafe {\\n\\n vm_parameters_parse(\\n\\n default_parameters.native().processArgc,\\n\\n default_parameters.native().processArgv,\\n\\n default_parameters.native_mut(),\\n\\n )\\n\\n };\\n\\n }\\n\\n\\n\\n default_parameters\\n\\n }\\n\\n\\n\\n pub fn from_env_args() -> Self {\\n\\n Self::from_args(std::env::args().collect())\\n\\n }\\n\\n\\n\\n pub fn image_file_name(&self) -> String {\\n\\n if self.native().imageFileName.is_null() {\\n\\n return \\\"\\\".to_string();\\n\\n }\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 85,\n \"score\": 5.402262085225537\n },\n {\n \"content\": \"\\n\\nimpl VMParameters {\\n\\n pub fn from_args<P: AsRef<str>>(arguments: Vec<P>) -> Self {\\n\\n let vars = std::env::vars()\\n\\n .map(|arg| CString::new(format!(\\\"{}={}\\\", arg.0, arg.1)).unwrap())\\n\\n .collect::<Vec<CString>>();\\n\\n\\n\\n let mut c_vars = vars\\n\\n .iter()\\n\\n .map(|arg| arg.as_ptr())\\n\\n .collect::<Vec<*const c_char>>();\\n\\n\\n\\n let mut default_parameters = Self::default();\\n\\n default_parameters.set_arguments(arguments);\\n\\n default_parameters.native_mut().environmentVector = c_vars.as_mut_ptr();\\n\\n\\n\\n forget(vars);\\n\\n forget(c_vars);\\n\\n\\n\\n if default_parameters.has_arguments() {\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 86,\n \"score\": 5.374439404128891\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nunsafe impl Send for GToolkitVM {}\\n\\nunsafe impl Sync for GToolkitVM {}\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\\n#[repr(transparent)]\\n\\npub struct ObjectPointer(sqInt);\\n\\nimpl NativeTransmutable<sqInt> for ObjectPointer {}\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\\n#[repr(transparent)]\\n\\npub struct ObjectFieldIndex(sqInt);\\n\\nimpl NativeTransmutable<sqInt> for ObjectFieldIndex {}\\n\\n\\n\\n#[derive(Copy, Clone, Debug)]\\n\\n#[repr(transparent)]\\n\\npub struct StackOffset(sqInt);\\n\\nimpl NativeTransmutable<sqInt> for StackOffset {}\\n\",\n \"file_path\": \"experimental/src/vm.rs\",\n \"rank\": 87,\n \"score\": 5.371101044609237\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn iter(&self) -> ParametersVectorIterator {\\n\\n ParametersVectorIterator {\\n\\n vector: self.native(),\\n\\n index: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn as_vec(&self) -> Vec<String> {\\n\\n self.iter().collect()\\n\\n }\\n\\n\\n\\n pub(crate) fn borrow_from_native(native: &NativeVMParameterVector) -> &Self {\\n\\n unsafe { transmute_ref(native) }\\n\\n }\\n\\n}\\n\\n\\n\\n#[repr(transparent)]\\n\\npub struct ImageParameters(NativeVMParameterVector);\\n\",\n \"file_path\": \"vm-bindings/src/parameter_vector.rs\",\n \"rank\": 88,\n \"score\": 5.317171756574295\n },\n {\n \"content\": \" pub fn set_arguments<P: AsRef<str>>(&mut self, arguments: Vec<P>) {\\n\\n // create a vector of zero terminated strings\\n\\n let mut args = arguments\\n\\n .iter()\\n\\n .map(|each| each.as_ref().to_string())\\n\\n .map(|each| CString::into_raw(CString::new(each).unwrap()))\\n\\n .collect::<Vec<*mut c_char>>();\\n\\n\\n\\n args.shrink_to_fit();\\n\\n\\n\\n let args_ptr = args.as_ptr() as *mut *const c_char;\\n\\n let args_length = args.len() as i32;\\n\\n std::mem::forget(args);\\n\\n\\n\\n if !self.native().processArgv.is_null() {\\n\\n let previous_ptr = self.native().processArgv as *mut *mut c_char;\\n\\n let previous_length = self.native().processArgc as usize;\\n\\n\\n\\n let previous_arg_ptrs: Vec<*mut c_char> =\\n\\n unsafe { Vec::from_raw_parts(previous_ptr, previous_length, previous_length) };\\n\",\n \"file_path\": \"vm-bindings/src/parameters.rs\",\n \"rank\": 89,\n \"score\": 5.316552229126902\n },\n {\n \"content\": \" pub unsafe fn release(self) -> H {\\n\\n self.0\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) trait BorrowsFrom: Sized {\\n\\n fn borrows<D: ?Sized>(self, _dep: &D) -> Borrows<Self>;\\n\\n}\\n\\n\\n\\nimpl<T: Sized> BorrowsFrom for T {\\n\\n fn borrows<D: ?Sized>(self, _dep: &D) -> Borrows<Self> {\\n\\n Borrows(self, PhantomData)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 90,\n \"score\": 5.074311112392075\n },\n {\n \"content\": \" let executable = std::env::args()\\n\\n .next()\\n\\n .ok_or_else(|| ApplicationError::NoExecutableInArguments)?;\\n\\n Ok(PathBuf::from(executable))\\n\\n }\\n\\n\\n\\n pub fn working_directory(&self) -> &Path {\\n\\n self.working_directory.as_path()\\n\\n }\\n\\n\\n\\n pub fn process_arguments(&self) -> Vec<String> {\\n\\n std::env::args().collect()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm-client/src/application.rs\",\n \"rank\": 91,\n \"score\": 5.05731699929757\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn is_on_worker_thread(&self) -> bool {\\n\\n unsafe { isVMRunOnWorkerThread() != 0 }\\n\\n }\\n\\n\\n\\n pub fn send(&self, request: GToolkitVMRequest) {\\n\\n self.sender.send(request);\\n\\n }\\n\\n\\n\\n pub fn call(&self, callout: GToolkitCallout) {\\n\\n println!(\\\"Requesting callout {:?}\\\", &callout);\\n\\n self.send(GToolkitVMRequest::Call(callout));\\n\\n }\\n\\n\\n\\n pub fn wake_up(&self) {\\n\\n println!(\\\"Sending wake up\\\");\\n\\n self.send(GToolkitVMRequest::WakeUp);\\n\\n }\\n\",\n \"file_path\": \"experimental/src/vm.rs\",\n \"rank\": 92,\n \"score\": 5.0532462263455145\n },\n {\n \"content\": \"}\\n\\n\\n\\npub(crate) trait NativePointerOrNullMut2<N> {\\n\\n fn native_ptr_or_null_mut(&mut self) -> *mut N;\\n\\n}\\n\\n\\n\\npub(crate) trait NativePointerOrNull2<N> {\\n\\n fn native_ptr_or_null(&self) -> *const N;\\n\\n}\\n\\n\\n\\nimpl<H, N> NativePointerOrNull2<N> for Option<&H>\\n\\nwhere\\n\\n H: NativeTransmutable<N>,\\n\\n{\\n\\n fn native_ptr_or_null(&self) -> *const N {\\n\\n match self {\\n\\n Some(handle) => handle.native(),\\n\\n None => ptr::null(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 93,\n \"score\": 5.0294010009850245\n },\n {\n \"content\": \"use crate::bindings::{sqInt, usqInt};\\n\\nuse libffi::low::ffi_type;\\n\\n\\n\\nextern \\\"C\\\" {\\n\\n pub fn numSlotsOf(oop: sqInt) -> sqInt;\\n\\n}\\n\\n\\n\\nextern \\\"C\\\" {\\n\\n pub fn marshallArgumentFromatIndexintoofTypewithSize(\\n\\n argumentsArrayOop: sqInt,\\n\\n i: sqInt,\\n\\n argHolder: sqInt,\\n\\n argType: sqInt,\\n\\n argTypeSize: sqInt,\\n\\n );\\n\\n}\\n\\n\\n\\nextern \\\"C\\\" {\\n\\n pub fn marshallAndPushReturnValueFromofTypepoping(\\n\\n returnHolder: sqInt,\\n\",\n \"file_path\": \"experimental/src/cointerp.rs\",\n \"rank\": 94,\n \"score\": 4.969066492488202\n },\n {\n \"content\": \"extern crate bindgen;\\n\\nextern crate cmake;\\n\\nextern crate file_matcher;\\n\\nextern crate fs_extra;\\n\\nextern crate titlecase;\\n\\nextern crate which;\\n\\n\\n\\nmod build_support;\\n\\nuse build_support::*;\\n\\n\\n\\n///\\n\\n/// Possible parameters\\n\\n/// - VM_CLIENT_VMMAKER to use a specific VM to run a VM Maker image\\n\",\n \"file_path\": \"vm-bindings/build.rs\",\n \"rank\": 95,\n \"score\": 4.965120106879324\n },\n {\n \"content\": \"/// A trait that supports retrieving a pointer from an Option<Handle<Native>>.\\n\\n/// Returns a null pointer if the Option is None.\\n\\npub(crate) trait NativePointerOrNull<N> {\\n\\n fn native_ptr_or_null(&self) -> *const N;\\n\\n unsafe fn native_ptr_or_null_mut_force(&self) -> *mut N;\\n\\n}\\n\\n\\n\\npub(crate) trait NativePointerOrNullMut<N> {\\n\\n fn native_ptr_or_null_mut(&mut self) -> *mut N;\\n\\n}\\n\\n\\n\\nimpl<H, N> NativePointerOrNull<N> for Option<&H>\\n\\nwhere\\n\\n H: NativeAccess<N>,\\n\\n{\\n\\n fn native_ptr_or_null(&self) -> *const N {\\n\\n match self {\\n\\n Some(handle) => handle.native(),\\n\\n None => ptr::null(),\\n\\n }\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 96,\n \"score\": 4.841823397658942\n },\n {\n \"content\": \" let image_path = match validate_user_image_file(matches.value_of(\\\"image\\\")) {\\n\\n None => {\\n\\n eprintln!(\\\"Could not find an .image file\\\");\\n\\n return;\\n\\n }\\n\\n Some(path) => path,\\n\\n };\\n\\n\\n\\n let mut vm_args: Vec<String> = vec![];\\n\\n vm_args.push(std::env::args().collect::<Vec<String>>()[0].to_owned());\\n\\n vm_args.push(image_path.as_os_str().to_str().unwrap().to_owned());\\n\\n\\n\\n if let Some((external, sub_m)) = matches.subcommand() {\\n\\n vm_args.push(external.to_owned());\\n\\n if let Some(values) = sub_m.values_of(\\\"\\\") {\\n\\n for each in values {\\n\\n vm_args.push(each.to_owned());\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n let mut parameters = VMParameters::from_args(vm_args);\\n\\n parameters.set_image_file_name(image_path.as_os_str().to_str().unwrap().to_owned());\\n\\n parameters.set_is_interactive_session(matches.is_present(\\\"interactive\\\"));\\n\\n\\n\\n VM::start(parameters).unwrap();\\n\\n}\\n\",\n \"file_path\": \"vm-client/src/main_cli.rs\",\n \"rank\": 97,\n \"score\": 4.81677438282408\n },\n {\n \"content\": \" fn clone(&self) -> Self {\\n\\n Self::from_native_c(self.0.clone())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N: NativeDrop + NativePartialEq> PartialEq for Handle<N> {\\n\\n fn eq(&self, rhs: &Self) -> bool {\\n\\n self.native().eq(rhs.native())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N: NativeDrop + NativeHash> Hash for Handle<N> {\\n\\n fn hash<H: Hasher>(&self, state: &mut H) {\\n\\n self.native().hash(state);\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) trait NativeSliceAccess<N: NativeDrop> {\\n\\n fn native(&self) -> &[N];\\n\\n fn native_mut(&mut self) -> &mut [N];\\n\",\n \"file_path\": \"vm-bindings/src/prelude.rs\",\n \"rank\": 98,\n \"score\": 4.756807946374478\n },\n {\n \"content\": \"\\n\\n pub fn instantiate_indexable_class_of_size(\\n\\n &self,\\n\\n class: ObjectPointer,\\n\\n size: usize,\\n\\n is_pinned: bool,\\n\\n ) -> ObjectPointer {\\n\\n let oop = unsafe {\\n\\n instantiateClassindexableSizeisPinned(\\n\\n class.into_native(),\\n\\n size as usqInt,\\n\\n is_pinned as sqInt,\\n\\n )\\n\\n };\\n\\n\\n\\n ObjectPointer::from_native_c(oop)\\n\\n }\\n\\n\\n\\n pub fn new_external_address(&self) -> ObjectPointer {\\n\\n let external_address_class = self.class_external_address();\\n\",\n \"file_path\": \"experimental/src/vm.rs\",\n \"rank\": 99,\n \"score\": 4.561465331129403\n }\n]","isConversational":false}}},{"rowIdx":2985,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/mock.rs"},"repo_name":{"kind":"string","value":"fossabot/client-rust"},"commit":{"kind":"string","value":"4540c1cdfa9a4d17ac15a1242daf32ef53a17133"},"file_code":{"kind":"string","value":"\n\nuse crate::{\n pd::{PdClient, PdRpcClient, RetryClient},\n request::DispatchHook,\n Config, Error, Key, Result, Timestamp,\n};\nuse fail::fail_point;\nuse futures::future::{ready, BoxFuture, FutureExt};\nuse grpcio::CallOption;\nuse kvproto::{errorpb, kvrpcpb, metapb, tikvpb::TikvClient};\nuse std::{future::Future, sync::Arc, time::Duration};\nuse tikv_client_store::{HasError, KvClient, KvConnect, Region, RegionId, Store};\n\npub async fn pd_rpc_client() -> PdRpcClient<MockKvConnect, MockCluster> {\n let config = Config::default();\n PdRpcClient::new(\n &config,\n |_, _| MockKvConnect,\n |e, sm| {\n futures::future::ok(RetryClient::new_with_cluster(\n e,\n sm,\n config.timeout,\n MockCluster,\n ))\n },\n )\n .await\n .unwrap()\n}\n\n#[derive(Clone, Eq, PartialEq, Debug)]\npub struct MockKvClient {\n addr: String,\n}\n\npub struct MockKvConnect;\n\npub struct MockCluster;\n\npub struct MockPdClient;\n\nimpl KvClient for MockKvClient {\n fn dispatch<Resp, RpcFuture>(\n &self,\n _request_name: &'static str,\n _fut: grpcio::Result<RpcFuture>,\n ) -> BoxFuture<'static, Result<Resp>>\n where\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\n Resp: HasError + Sized + Clone + Send + 'static,\n RpcFuture: Send + 'static,\n {\n unimplemented!()\n }\n\n fn get_rpc_client(&self) -> Arc<TikvClient> {\n unimplemented!()\n }\n}\n\nimpl KvConnect for MockKvConnect {\n type KvClient = MockKvClient;\n\n fn connect(&self, address: &str) -> Result<Self::KvClient> {\n Ok(MockKvClient {\n addr: address.to_owned(),\n })\n }\n}\n\nimpl MockPdClient {\n pub fn region1() -> Region {\n let mut region = Region::default();\n region.region.id = 1;\n region.region.set_start_key(vec![0]);\n region.region.set_end_key(vec![10]);\n\n let mut leader = metapb::Peer::default();\n leader.store_id = 41;\n region.leader = Some(leader);\n\n region\n }\n\n pub fn region2() -> Region {\n let mut region = Region::default();\n region.region.id = 2;\n region.region.set_start_key(vec![10]);\n region.region.set_end_key(vec![250, 250]);\n\n let mut leader = metapb::Peer::default();\n leader.store_id = 42;\n region.leader = Some(leader);\n\n region\n }\n}\n\nimpl PdClient for MockPdClient {\n type KvClient = MockKvClient;\n\n fn map_region_to_store(\n self: Arc<Self>,\n region: Region,\n ) -> BoxFuture<'static, Result<Store<Self::KvClient>>> {\n Box::pin(ready(Ok(Store::new(\n region,\n MockKvClient {\n addr: String::new(),\n },\n Duration::from_secs(60),\n ))))\n }\n\n fn region_for_key(&self, key: &Key) -> BoxFuture<'static, Result<Region>> {\n let bytes: &[_] = key.into();\n let region = if bytes.is_empty() || bytes[0] < 10 {\n Self::region1()\n } else {\n Self::region2()\n };\n\n Box::pin(ready(Ok(region)))\n }\n\n fn region_for_id(&self, id: RegionId) -> BoxFuture<'static, Result<Region>> {\n let result = match id {\n 1 => Ok(Self::region1()),\n 2 => Ok(Self::region2()),\n _ => Err(Error::region_not_found(id)),\n };\n\n Box::pin(ready(result))\n }\n\n fn get_timestamp(self: Arc<Self>) -> BoxFuture<'static, Result<Timestamp>> {\n unimplemented!()\n }\n}\n\nimpl DispatchHook for kvrpcpb::ResolveLockRequest {\n fn dispatch_hook(\n &self,\n _opt: CallOption,\n ) -> Option<BoxFuture<'static, Result<kvrpcpb::ResolveLockResponse>>> {\n fail_point!(\"region-error\", |_| {\n let mut resp = kvrpcpb::ResolveLockResponse::default();\n resp.region_error = Some(errorpb::Error::default());\n Some(ready(Ok(resp)).boxed())\n });\n Some(ready(Ok(kvrpcpb::ResolveLockResponse::default())).boxed())\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::{\n pd::{PdClient, PdRpcClient, RetryClient},\n request::DispatchHook,\n Config, Error, Key, Result, Timestamp,\n};\nuse fail::fail_point;\nuse futures::future::{ready, BoxFuture, FutureExt};\nuse grpcio::CallOption;\nuse kvproto::{errorpb, kvrpcpb, metapb, tikvpb::TikvClient};\nuse std::{future::Future, sync::Arc, time::Duration};\nuse tikv_client_store::{HasError, KvClient, KvConnect, Region, RegionId, Store};\n\npub async fn pd_rpc_client() -> PdRpcClient<MockKvConnect, MockCluster> {\n let config = Config::default();\n PdRpcClient::new(\n &config,\n |_, _| MockKvConnect,\n |e, sm| {\n futures::future::ok(RetryClient::new_with_cluster(\n e,\n sm,\n config.timeout,\n MockCluster,\n ))\n },\n )\n .await\n .unwrap()\n}\n\n#[derive(Clone, Eq, PartialEq, Debug)]\npub struct MockKvClient {\n addr: String,\n}\n\npub struct MockKvConnect;\n\npub struct MockCluster;\n\npub struct MockPdClient;\n\nimpl KvClient for MockKvClient {\n fn dispatch<Resp, RpcFuture>(\n &self,\n _request_name: &'st"},"suffix":{"kind":"string","value":" _ => Err(Error::region_not_found(id)),\n };\n\n Box::pin(ready(result))\n }\n\n fn get_timestamp(self: Arc<Self>) -> BoxFuture<'static, Result<Timestamp>> {\n unimplemented!()\n }\n}\n\nimpl DispatchHook for kvrpcpb::ResolveLockRequest {\n fn dispatch_hook(\n &self,\n _opt: CallOption,\n ) -> Option<BoxFuture<'static, Result<kvrpcpb::ResolveLockResponse>>> {\n fail_point!(\"region-error\", |_| {\n let mut resp = kvrpcpb::ResolveLockResponse::default();\n resp.region_error = Some(errorpb::Error::default());\n Some(ready(Ok(resp)).boxed())\n });\n Some(ready(Ok(kvrpcpb::ResolveLockResponse::default())).boxed())\n }\n}\n"},"middle":{"kind":"string","value":"atic str,\n _fut: grpcio::Result<RpcFuture>,\n ) -> BoxFuture<'static, Result<Resp>>\n where\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\n Resp: HasError + Sized + Clone + Send + 'static,\n RpcFuture: Send + 'static,\n {\n unimplemented!()\n }\n\n fn get_rpc_client(&self) -> Arc<TikvClient> {\n unimplemented!()\n }\n}\n\nimpl KvConnect for MockKvConnect {\n type KvClient = MockKvClient;\n\n fn connect(&self, address: &str) -> Result<Self::KvClient> {\n Ok(MockKvClient {\n addr: address.to_owned(),\n })\n }\n}\n\nimpl MockPdClient {\n pub fn region1() -> Region {\n let mut region = Region::default();\n region.region.id = 1;\n region.region.set_start_key(vec![0]);\n region.region.set_end_key(vec![10]);\n\n let mut leader = metapb::Peer::default();\n leader.store_id = 41;\n region.leader = Some(leader);\n\n region\n }\n\n pub fn region2() -> Region {\n let mut region = Region::default();\n region.region.id = 2;\n region.region.set_start_key(vec![10]);\n region.region.set_end_key(vec![250, 250]);\n\n let mut leader = metapb::Peer::default();\n leader.store_id = 42;\n region.leader = Some(leader);\n\n region\n }\n}\n\nimpl PdClient for MockPdClient {\n type KvClient = MockKvClient;\n\n fn map_region_to_store(\n self: Arc<Self>,\n region: Region,\n ) -> BoxFuture<'static, Result<Store<Self::KvClient>>> {\n Box::pin(ready(Ok(Store::new(\n region,\n MockKvClient {\n addr: String::new(),\n },\n Duration::from_secs(60),\n ))))\n }\n\n fn region_for_key(&self, key: &Key) -> BoxFuture<'static, Result<Region>> {\n let bytes: &[_] = key.into();\n let region = if bytes.is_empty() || bytes[0] < 10 {\n Self::region1()\n } else {\n Self::region2()\n };\n\n Box::pin(ready(Ok(region)))\n }\n\n fn region_for_id(&self, id: RegionId) -> BoxFuture<'static, Result<Region>> {\n let result = match id {\n 1 => Ok(Self::region1()),\n 2 => Ok(Self::region2()),\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn new_mvcc_get_request(key: impl Into<Key>, timestamp: Timestamp) -> kvrpcpb::GetRequest {\n\n let mut req = kvrpcpb::GetRequest::default();\n\n req.set_key(key.into().into());\n\n req.set_version(timestamp.version());\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::BatchGetRequest {\n\n type Result = Vec<KvPair>;\n\n type RpcResponse = kvrpcpb::BatchGetResponse;\n\n type KeyData = Vec<Key>;\n\n const REQUEST_NAME: &'static str = \"kv_batch_get\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_batch_get_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(&self, keys: Self::KeyData, store: &Store<KvC>) -> Self {\n\n let mut req = self.request_from_store(store);\n\n req.set_keys(keys.into_iter().map(Into::into).collect());\n\n req.set_version(self.version);\n\n\n\n req\n","file_path":"src/transaction/requests.rs","rank":0,"score":260098.61649734195},{"content":"fn extract_errors(error_iter: impl Iterator<Item = Option<kvrpcpb::KeyError>>) -> Option<Error> {\n\n let errors: Vec<Error> = error_iter.flatten().map(Into::into).collect();\n\n if errors.is_empty() {\n\n None\n\n } else if errors.len() == 1 {\n\n Some(errors.into_iter().next().unwrap())\n\n } else {\n\n Some(Error::multiple_errors(errors))\n\n }\n\n}\n","file_path":"tikv-client-store/src/errors.rs","rank":1,"score":216581.07915234807},{"content":"pub fn new_cleanup_request(key: impl Into<Key>, start_version: u64) -> kvrpcpb::CleanupRequest {\n\n let mut req = kvrpcpb::CleanupRequest::default();\n\n req.set_key(key.into().into());\n\n req.set_start_version(start_version);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::PrewriteRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::PrewriteResponse;\n\n type KeyData = Vec<kvrpcpb::Mutation>;\n\n const REQUEST_NAME: &'static str = \"kv_prewrite\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_prewrite_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(\n\n &self,\n\n mutations: Self::KeyData,\n\n store: &Store<KvC>,\n\n ) -> Self {\n","file_path":"src/transaction/requests.rs","rank":2,"score":204042.57826495828},{"content":"pub fn pd_addrs() -> Vec<String> {\n\n var(ENV_PD_ADDRS)\n\n .expect(&format!(\"Expected {}:\", ENV_PD_ADDRS))\n\n .split(\",\")\n\n .map(From::from)\n\n .collect()\n\n}\n\n*/\n","file_path":"src/proptests/mod.rs","rank":3,"score":175032.26189665328},{"content":"pub fn store_stream_for_key<KeyData, PdC>(\n\n key_data: KeyData,\n\n pd_client: Arc<PdC>,\n\n) -> BoxStream<'static, Result<(KeyData, Store<PdC::KvClient>)>>\n\nwhere\n\n KeyData: AsRef<Key> + Send + 'static,\n\n PdC: PdClient,\n\n{\n\n pd_client\n\n .store_for_key(key_data.as_ref())\n\n .map_ok(move |store| (key_data, store))\n\n .into_stream()\n\n .boxed()\n\n}\n\n\n","file_path":"src/request.rs","rank":4,"score":156882.96163810973},{"content":"pub fn store_stream_for_keys<KeyData, IntoKey, I, PdC>(\n\n key_data: I,\n\n pd_client: Arc<PdC>,\n\n) -> BoxStream<'static, Result<(Vec<KeyData>, Store<PdC::KvClient>)>>\n\nwhere\n\n KeyData: AsRef<Key> + Send + Sync + 'static,\n\n IntoKey: Into<KeyData> + 'static,\n\n I: IntoIterator<Item = IntoKey>,\n\n I::IntoIter: Send + Sync + 'static,\n\n PdC: PdClient,\n\n{\n\n pd_client\n\n .clone()\n\n .group_keys_by_region(key_data.into_iter().map(Into::into))\n\n .and_then(move |(region_id, key)| {\n\n pd_client\n\n .clone()\n\n .store_for_id(region_id)\n\n .map_ok(move |store| (key, store))\n\n })\n\n .boxed()\n\n}\n\n\n","file_path":"src/request.rs","rank":5,"score":154802.94968153807},{"content":"pub trait HasRegionError {\n\n fn region_error(&mut self) -> Option<Error>;\n\n}\n\n\n","file_path":"tikv-client-store/src/errors.rs","rank":6,"score":150951.52425535006},{"content":"pub trait HasError: HasRegionError {\n\n fn error(&mut self) -> Option<Error>;\n\n}\n\n\n\nmacro_rules! has_region_error {\n\n ($type:ty) => {\n\n impl HasRegionError for $type {\n\n fn region_error(&mut self) -> Option<Error> {\n\n if self.has_region_error() {\n\n Some(self.take_region_error().into())\n\n } else {\n\n None\n\n }\n\n }\n\n }\n\n };\n\n}\n\n\n\nhas_region_error!(kvrpcpb::GetResponse);\n\nhas_region_error!(kvrpcpb::ScanResponse);\n","file_path":"tikv-client-store/src/errors.rs","rank":7,"score":150775.58786043568},{"content":"fn pd_addrs() -> Vec<String> {\n\n env::var(ENV_PD_ADDRS)\n\n .expect(&format!(\"Expected {}:\", ENV_PD_ADDRS))\n\n .split(\",\")\n\n .map(From::from)\n\n .collect()\n\n}\n","file_path":"tests/integration_tests.rs","rank":8,"score":135692.97672929495},{"content":"pub fn get_tag_from_thread_name() -> Option<String> {\n\n thread::current()\n\n .name()\n\n .and_then(|name| name.split(\"::\").skip(1).last())\n\n .map(From::from)\n\n}\n\n\n\n/// Convert Duration to seconds.\n","file_path":"tikv-client-common/src/util.rs","rank":9,"score":133105.05496380126},{"content":"pub fn arb_batch<T: core::fmt::Debug>(\n\n single_strategy: impl Strategy<Value = T>,\n\n max_batch_size: impl Into<Option<usize>>,\n\n) -> impl Strategy<Value = Vec<T>> {\n\n let max_batch_size = max_batch_size.into().unwrap_or(PROPTEST_BATCH_SIZE_MAX);\n\n proptest::collection::vec(single_strategy, 0..max_batch_size)\n\n}\n\n\n","file_path":"src/proptests/mod.rs","rank":10,"score":131747.3568874893},{"content":"pub fn store_stream_for_range<PdC: PdClient>(\n\n range: BoundRange,\n\n pd_client: Arc<PdC>,\n\n) -> BoxStream<'static, Result<((Key, Key), Store<PdC::KvClient>)>> {\n\n pd_client\n\n .stores_for_range(range)\n\n .map_ok(move |store| {\n\n // FIXME should be bounded by self.range\n\n let range = store.region.range();\n\n (range, store)\n\n })\n\n .into_stream()\n\n .boxed()\n\n}\n\n\n","file_path":"src/request.rs","rank":11,"score":117572.34931375597},{"content":"pub fn store_stream_for_ranges<PdC: PdClient>(\n\n ranges: Vec<BoundRange>,\n\n pd_client: Arc<PdC>,\n\n) -> BoxStream<'static, Result<(Vec<BoundRange>, Store<PdC::KvClient>)>> {\n\n pd_client\n\n .clone()\n\n .group_ranges_by_region(ranges)\n\n .and_then(move |(region_id, range)| {\n\n pd_client\n\n .clone()\n\n .store_for_id(region_id)\n\n .map_ok(move |store| (range, store))\n\n })\n\n .into_stream()\n\n .boxed()\n\n}\n\n\n","file_path":"src/request.rs","rank":12,"score":117572.34931375597},{"content":"pub fn stream_fn<S, T, A, F, E>(initial_state: S, mut func: F) -> LoopFn<A, F>\n\nwhere\n\n F: FnMut(S) -> A,\n\n A: Future<Output = Result<Option<(S, T)>, E>>,\n\n{\n\n LoopFn {\n\n future: func(initial_state),\n\n func,\n\n }\n\n}\n\n\n\nimpl<S, T, A, F, E> Stream for LoopFn<A, F>\n\nwhere\n\n F: FnMut(S) -> A,\n\n A: Future<Output = Result<Option<(S, T)>, E>>,\n\n{\n\n type Item = Result<T, E>;\n\n fn poll_next(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {\n\n unsafe {\n\n let this = Pin::get_unchecked_mut(self);\n","file_path":"tikv-client-common/src/compat.rs","rank":13,"score":109543.58324741272},{"content":"type GrpcResult<T> = std::result::Result<T, grpcio::Error>;\n\n\n","file_path":"tikv-client-pd/src/cluster.rs","rank":14,"score":106418.63234670997},{"content":"pub trait KvClient {\n\n fn dispatch<Resp, RpcFuture>(\n\n &self,\n\n request_name: &'static str,\n\n fut: ::grpcio::Result<RpcFuture>,\n\n ) -> BoxFuture<'static, Result<Resp>>\n\n where\n\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\n\n Resp: HasError + Sized + Clone + Send + 'static,\n\n RpcFuture: Send + 'static;\n\n\n\n fn get_rpc_client(&self) -> Arc<TikvClient>;\n\n}\n\n\n\n/// This client handles requests for a single TiKV node. It converts the data\n\n/// types and abstractions of the client program into the grpc data types.\n\n#[derive(new, Clone)]\n\npub struct KvRpcClient {\n\n pub rpc_client: Arc<TikvClient>,\n\n}\n","file_path":"tikv-client-store/src/lib.rs","rank":15,"score":102651.26076965961},{"content":"pub fn new_prewrite_request(\n\n mutations: Vec<kvrpcpb::Mutation>,\n\n primary_lock: Key,\n\n start_version: u64,\n\n lock_ttl: u64,\n\n) -> kvrpcpb::PrewriteRequest {\n\n let mut req = kvrpcpb::PrewriteRequest::default();\n\n req.set_mutations(mutations);\n\n req.set_primary_lock(primary_lock.into());\n\n req.set_start_version(start_version);\n\n req.set_lock_ttl(lock_ttl);\n\n // TODO: Lite resolve lock is currently disabled\n\n req.set_txn_size(std::u64::MAX);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::CommitRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::CommitResponse;\n","file_path":"src/transaction/requests.rs","rank":16,"score":99519.3054609654},{"content":"pub fn new_commit_request(\n\n keys: Vec<Key>,\n\n start_version: u64,\n\n commit_version: u64,\n\n) -> kvrpcpb::CommitRequest {\n\n let mut req = kvrpcpb::CommitRequest::default();\n\n req.set_keys(keys.into_iter().map(Into::into).collect());\n\n req.set_start_version(start_version);\n\n req.set_commit_version(commit_version);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::BatchRollbackRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::BatchRollbackResponse;\n\n type KeyData = Vec<Vec<u8>>;\n\n const REQUEST_NAME: &'static str = \"kv_batch_rollback\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_batch_rollback_async_opt;\n\n\n","file_path":"src/transaction/requests.rs","rank":17,"score":99519.3054609654},{"content":"fn convert_to_bound_key<K: Into<Key>>(b: Bound<K>) -> Bound<Key> {\n\n match b {\n\n Bound::Included(k) => Bound::Included(k.into()),\n\n Bound::Excluded(k) => Bound::Excluded(k.into()),\n\n Bound::Unbounded => Bound::Unbounded,\n\n }\n\n}\n","file_path":"tikv-client-common/src/kv/bound_range.rs","rank":18,"score":98677.8716817233},{"content":"pub fn new_raw_scan_request(\n\n range: impl Into<BoundRange>,\n\n limit: u32,\n\n key_only: bool,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawScanRequest {\n\n let (start_key, end_key) = range.into().into_keys();\n\n let mut req = kvrpcpb::RawScanRequest::default();\n\n req.set_start_key(start_key.into());\n\n req.set_end_key(end_key.unwrap_or_default().into());\n\n req.set_limit(limit);\n\n req.set_key_only(key_only);\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawBatchScanRequest {\n\n type Result = Vec<KvPair>;\n\n type RpcResponse = kvrpcpb::RawBatchScanResponse;\n","file_path":"src/raw/requests.rs","rank":19,"score":97471.57530574285},{"content":"pub fn new_raw_put_request(\n\n key: impl Into<Key>,\n\n value: impl Into<Value>,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawPutRequest {\n\n let mut req = kvrpcpb::RawPutRequest::default();\n\n req.set_key(key.into().into());\n\n req.set_value(value.into());\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawBatchPutRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::RawBatchPutResponse;\n\n type KeyData = Vec<KvPair>;\n\n const REQUEST_NAME: &'static str = \"raw_batch_put\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_batch_put_async_opt;\n\n\n","file_path":"src/raw/requests.rs","rank":20,"score":97471.57530574285},{"content":"pub fn new_raw_get_request(\n\n key: impl Into<Key>,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawGetRequest {\n\n let mut req = kvrpcpb::RawGetRequest::default();\n\n req.set_key(key.into().into());\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawBatchGetRequest {\n\n type Result = Vec<KvPair>;\n\n type RpcResponse = kvrpcpb::RawBatchGetResponse;\n\n type KeyData = Vec<Key>;\n\n const REQUEST_NAME: &'static str = \"raw_batch_get\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_batch_get_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(&self, keys: Self::KeyData, store: &Store<KvC>) -> Self {\n\n let mut req = self.request_from_store(store);\n","file_path":"src/raw/requests.rs","rank":21,"score":97471.57530574285},{"content":"pub fn new_batch_rollback_request(\n\n keys: Vec<Key>,\n\n start_version: u64,\n\n) -> kvrpcpb::BatchRollbackRequest {\n\n let mut req = kvrpcpb::BatchRollbackRequest::default();\n\n req.set_keys(keys.into_iter().map(Into::into).collect());\n\n req.set_start_version(start_version);\n\n\n\n req\n\n}\n\n\n\nimpl HasLocks for kvrpcpb::CommitResponse {}\n\nimpl HasLocks for kvrpcpb::CleanupResponse {}\n\nimpl HasLocks for kvrpcpb::BatchRollbackResponse {}\n\nimpl HasLocks for kvrpcpb::ResolveLockResponse {}\n","file_path":"src/transaction/requests.rs","rank":22,"score":97471.57530574285},{"content":"pub fn new_raw_delete_request(\n\n key: impl Into<Key>,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawDeleteRequest {\n\n let mut req = kvrpcpb::RawDeleteRequest::default();\n\n req.set_key(key.into().into());\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawBatchDeleteRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::RawBatchDeleteResponse;\n\n type KeyData = Vec<Key>;\n\n const REQUEST_NAME: &'static str = \"raw_batch_delete\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_batch_delete_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(&self, keys: Self::KeyData, store: &Store<KvC>) -> Self {\n\n let mut req = self.request_from_store(store);\n","file_path":"src/raw/requests.rs","rank":23,"score":97471.57530574285},{"content":"pub fn new_mvcc_scan_request(\n\n range: impl Into<BoundRange>,\n\n timestamp: Timestamp,\n\n limit: u32,\n\n key_only: bool,\n\n) -> kvrpcpb::ScanRequest {\n\n let (start_key, end_key) = range.into().into_keys();\n\n let mut req = kvrpcpb::ScanRequest::default();\n\n req.set_start_key(start_key.into());\n\n req.set_end_key(end_key.unwrap_or_default().into());\n\n req.set_limit(limit);\n\n req.set_key_only(key_only);\n\n req.set_version(timestamp.version());\n\n req\n\n}\n\n\n\nimpl HasLocks for kvrpcpb::ScanResponse {\n\n fn take_locks(&mut self) -> Vec<kvrpcpb::LockInfo> {\n\n self.pairs\n\n .iter_mut()\n","file_path":"src/transaction/requests.rs","rank":24,"score":97471.57530574285},{"content":"pub fn new_resolve_lock_request(\n\n context: kvrpcpb::Context,\n\n start_version: u64,\n\n commit_version: u64,\n\n) -> kvrpcpb::ResolveLockRequest {\n\n let mut req = kvrpcpb::ResolveLockRequest::default();\n\n req.set_context(context);\n\n req.set_start_version(start_version);\n\n req.set_commit_version(commit_version);\n\n\n\n req\n\n}\n\n\n\n// TODO: Add lite resolve lock (resolve specified locks only)\n\n\n\nimpl KvRequest for kvrpcpb::CleanupRequest {\n\n /// Commit version if the key is committed, 0 otherwise.\n\n type Result = u64;\n\n type RpcResponse = kvrpcpb::CleanupResponse;\n\n type KeyData = Key;\n","file_path":"src/transaction/requests.rs","rank":25,"score":97471.57530574285},{"content":"pub fn new_raw_batch_scan_request(\n\n ranges: impl IntoIterator<Item = impl Into<BoundRange>>,\n\n each_limit: u32,\n\n key_only: bool,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawBatchScanRequest {\n\n let mut req = kvrpcpb::RawBatchScanRequest::default();\n\n req.set_ranges(ranges.into_iter().map(Into::into).map(Into::into).collect());\n\n req.set_each_limit(each_limit);\n\n req.set_key_only(key_only);\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nmacro_rules! impl_raw_rpc_request {\n\n ($name: ident) => {\n\n impl RawRpcRequest for kvrpcpb::$name {\n\n fn set_cf(&mut self, cf: String) {\n\n self.set_cf(cf);\n","file_path":"src/raw/requests.rs","rank":26,"score":95551.57547472473},{"content":"pub fn new_raw_batch_delete_request(\n\n keys: impl IntoIterator<Item = impl Into<Key>>,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawBatchDeleteRequest {\n\n let mut req = kvrpcpb::RawBatchDeleteRequest::default();\n\n req.set_keys(keys.into_iter().map(Into::into).map(Into::into).collect());\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawDeleteRangeRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::RawDeleteRangeResponse;\n\n type KeyData = (Key, Key);\n\n const REQUEST_NAME: &'static str = \"raw_delete_range\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_delete_range_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(\n\n &self,\n","file_path":"src/raw/requests.rs","rank":27,"score":95551.57547472473},{"content":"pub fn new_raw_batch_get_request(\n\n keys: impl IntoIterator<Item = impl Into<Key>>,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawBatchGetRequest {\n\n let mut req = kvrpcpb::RawBatchGetRequest::default();\n\n req.set_keys(keys.into_iter().map(Into::into).map(Into::into).collect());\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawPutRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::RawPutResponse;\n\n type KeyData = KvPair;\n\n const REQUEST_NAME: &'static str = \"raw_put\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_put_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(&self, key: Self::KeyData, store: &Store<KvC>) -> Self {\n\n let mut req = self.request_from_store(store);\n","file_path":"src/raw/requests.rs","rank":28,"score":95551.57547472473},{"content":"pub fn new_raw_batch_put_request(\n\n pairs: impl IntoIterator<Item = impl Into<KvPair>>,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawBatchPutRequest {\n\n let mut req = kvrpcpb::RawBatchPutRequest::default();\n\n req.set_pairs(pairs.into_iter().map(Into::into).map(Into::into).collect());\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawDeleteRequest {\n\n type Result = ();\n\n type RpcResponse = kvrpcpb::RawDeleteResponse;\n\n type KeyData = Key;\n\n const REQUEST_NAME: &'static str = \"raw_delete\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_delete_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(&self, key: Self::KeyData, store: &Store<KvC>) -> Self {\n\n let mut req = self.request_from_store(store);\n","file_path":"src/raw/requests.rs","rank":29,"score":95551.57547472473},{"content":"pub fn new_raw_delete_range_request(\n\n range: impl Into<BoundRange>,\n\n cf: Option<ColumnFamily>,\n\n) -> kvrpcpb::RawDeleteRangeRequest {\n\n let (start_key, end_key) = range.into().into_keys();\n\n let mut req = kvrpcpb::RawDeleteRangeRequest::default();\n\n req.set_start_key(start_key.into());\n\n req.set_end_key(end_key.unwrap_or_default().into());\n\n req.maybe_set_cf(cf);\n\n\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::RawScanRequest {\n\n type Result = Vec<KvPair>;\n\n type RpcResponse = kvrpcpb::RawScanResponse;\n\n type KeyData = (Key, Key);\n\n const REQUEST_NAME: &'static str = \"raw_scan\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_scan_async_opt;\n\n\n","file_path":"src/raw/requests.rs","rank":30,"score":95551.57547472473},{"content":"pub fn new_mvcc_get_batch_request(\n\n keys: Vec<Key>,\n\n timestamp: Timestamp,\n\n) -> kvrpcpb::BatchGetRequest {\n\n let mut req = kvrpcpb::BatchGetRequest::default();\n\n req.set_keys(keys.into_iter().map(Into::into).collect());\n\n req.set_version(timestamp.version());\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::ScanRequest {\n\n type Result = Vec<KvPair>;\n\n type RpcResponse = kvrpcpb::ScanResponse;\n\n type KeyData = (Key, Key);\n\n const REQUEST_NAME: &'static str = \"kv_scan\";\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_scan_async_opt;\n\n\n\n fn make_rpc_request<KvC: KvClient>(\n\n &self,\n\n (start_key, end_key): Self::KeyData,\n","file_path":"src/transaction/requests.rs","rank":31,"score":95551.57547472473},{"content":"fn allocate_timestamps(\n\n resp: &TsoResponse,\n\n pending_requests: &mut VecDeque<RequestGroup>,\n\n) -> Result<()> {\n\n // PD returns the timestamp with the biggest logical value. We can send back timestamps\n\n // whose logical value is from `logical - count + 1` to `logical` using the senders\n\n // in `pending`.\n\n let tail_ts = resp\n\n .timestamp\n\n .as_ref()\n\n .ok_or_else(|| Error::internal_error(\"No timestamp in TsoResponse\"))?;\n\n\n\n let mut offset = resp.count;\n\n if let Some(RequestGroup {\n\n tso_request,\n\n requests,\n\n }) = pending_requests.pop_front()\n\n {\n\n if tso_request.count != offset {\n\n return Err(Error::internal_error(\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":32,"score":94280.08148720067},{"content":"pub fn start_mock_pd_server() -> Server {\n\n let env = Arc::new(Environment::new(1));\n\n let mut server = ServerBuilder::new(env)\n\n .register_service(create_pd(MockPd::new()))\n\n .bind(\"localhost\", MOCK_PD_PORT)\n\n .build()\n\n .unwrap();\n\n server.start();\n\n server\n\n}\n\n\n\nimpl Pd for MockPd {\n\n fn get_members(\n\n &mut self,\n\n ctx: ::grpcio::RpcContext,\n\n req: GetMembersRequest,\n\n sink: ::grpcio::UnarySink<GetMembersResponse>,\n\n ) {\n\n let member = Member {\n\n name: \"mock tikv\".to_owned(),\n","file_path":"mock-tikv/src/pd.rs","rank":33,"score":90902.7359119496},{"content":"pub fn start_mock_tikv_server() -> Server {\n\n let env = Arc::new(Environment::new(1));\n\n let mut server = ServerBuilder::new(env)\n\n .register_service(create_tikv(MockTikv::new(KvStore::new())))\n\n .bind(\"localhost\", MOCK_TIKV_PORT)\n\n .build()\n\n .unwrap();\n\n server.start();\n\n server\n\n}\n\n\n\n#[derive(Debug, Clone, new)]\n\npub struct MockTikv {\n\n inner: KvStore,\n\n}\n\n\n\nimpl Tikv for MockTikv {\n\n fn kv_get(\n\n &mut self,\n\n _ctx: grpcio::RpcContext,\n","file_path":"mock-tikv/src/server.rs","rank":34,"score":90902.7359119496},{"content":"struct HexRepr<'a>(pub &'a [u8]);\n\n\n\nimpl<'a> fmt::Display for HexRepr<'a> {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n for byte in self.0 {\n\n write!(f, \"{:02X}\", byte)?;\n\n }\n\n Ok(())\n\n }\n\n}\n","file_path":"tikv-client-common/src/kv/mod.rs","rank":35,"score":90602.0883311353},{"content":"struct RequestGroup {\n\n tso_request: TsoRequest,\n\n requests: Vec<TimestampRequest>,\n\n}\n\n\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":36,"score":90322.98639560648},{"content":"fn region_from_response(\n\n resp: pdpb::GetRegionResponse,\n\n err: impl FnOnce() -> Error,\n\n) -> Result<Region> {\n\n let region = resp.region.ok_or_else(err)?;\n\n Ok(Region::new(region, resp.leader))\n\n}\n\n\n\n// A node-like thing that can be connected to.\n","file_path":"src/pd/retry.rs","rank":37,"score":89316.14073356931},{"content":"pub trait TimestampExt {\n\n fn version(&self) -> u64;\n\n fn from_version(version: u64) -> Self;\n\n}\n\n\n\nimpl TimestampExt for Timestamp {\n\n fn version(&self) -> u64 {\n\n ((self.physical << PHYSICAL_SHIFT_BITS) + self.logical)\n\n .try_into()\n\n .expect(\"Overflow converting timestamp to version\")\n\n }\n\n\n\n fn from_version(version: u64) -> Self {\n\n let version = version as i64;\n\n Self {\n\n physical: version >> PHYSICAL_SHIFT_BITS,\n\n logical: version & LOGICAL_MASK,\n\n }\n\n }\n\n}\n","file_path":"tikv-client-common/src/timestamp.rs","rank":38,"score":88786.24944477205},{"content":"#[inline]\n\npub fn duration_to_sec(d: Duration) -> f64 {\n\n let nanos = f64::from(d.subsec_nanos());\n\n // In most cases, we can't have so large Duration, so here just panic if overflow now.\n\n d.as_secs() as f64 + (nanos / 1_000_000_000.0)\n\n}\n","file_path":"tikv-client-common/src/util.rs","rank":39,"score":86380.16820263525},{"content":"struct TsoRequestStream<'a> {\n\n cluster_id: u64,\n\n request_rx: Pin<&'a mut mpsc::Receiver<oneshot::Sender<Timestamp>>>,\n\n pending_requests: Rc<RefCell<VecDeque<RequestGroup>>>,\n\n self_waker: Rc<AtomicWaker>,\n\n}\n\n\n\nimpl<'a> Stream for TsoRequestStream<'a> {\n\n type Item = (TsoRequest, WriteFlags);\n\n\n\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {\n\n let pending_requests = self.pending_requests.clone();\n\n let mut pending_requests = pending_requests.borrow_mut();\n\n let mut requests = Vec::new();\n\n\n\n while requests.len() < MAX_BATCH_SIZE && pending_requests.len() < MAX_PENDING_COUNT {\n\n match self.request_rx.as_mut().poll_next(cx) {\n\n Poll::Ready(Some(sender)) => {\n\n requests.push(sender);\n\n }\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":40,"score":86026.98876324628},{"content":"#[allow(dead_code)]\n\npub fn observe_tso_batch(batch_size: usize) {\n\n PD_TSO_BATCH_SIZE_HISTOGRAM.observe(batch_size as f64);\n\n}\n\n\n\nlazy_static! {\n\n static ref TIKV_REQUEST_DURATION_HISTOGRAM_VEC: HistogramVec = register_histogram_vec!(\n\n \"tikv_request_duration_seconds\",\n\n \"Bucketed histogram of TiKV requests duration\",\n\n &[\"type\"]\n\n )\n\n .unwrap();\n\n static ref TIKV_REQUEST_COUNTER_VEC: IntCounterVec = register_int_counter_vec!(\n\n \"tikv_request_total\",\n\n \"Total number of requests sent to TiKV\",\n\n &[\"type\"]\n\n )\n\n .unwrap();\n\n static ref TIKV_FAILED_REQUEST_DURATION_HISTOGRAM_VEC: HistogramVec = register_histogram_vec!(\n\n \"tikv_failed_request_duration_seconds\",\n\n \"Bucketed histogram of failed TiKV requests duration\",\n","file_path":"tikv-client-common/src/stats.rs","rank":41,"score":85176.4086178349},{"content":"/// A trait for connecting to TiKV stores.\n\npub trait KvConnect: Sized + Send + Sync + 'static {\n\n type KvClient: KvClient + Clone + Send + Sync + 'static;\n\n\n\n fn connect(&self, address: &str) -> Result<Self::KvClient>;\n\n}\n\n\n\npub type RpcFnType<Req, Resp> =\n\n for<'a, 'b> fn(\n\n &'a TikvClient,\n\n &'b Req,\n\n CallOption,\n\n )\n\n -> std::result::Result<::grpcio::ClientUnaryReceiver<Resp>, ::grpcio::Error>;\n\n\n\n#[derive(new, Clone)]\n\npub struct TikvConnect {\n\n env: Arc<Environment>,\n\n security_mgr: Arc<SecurityManager>,\n\n}\n\n\n\nimpl KvConnect for TikvConnect {\n\n type KvClient = KvRpcClient;\n\n\n\n fn connect(&self, address: &str) -> Result<KvRpcClient> {\n\n self.security_mgr\n\n .connect(self.env.clone(), address, TikvClient::new)\n\n .map(|c| KvRpcClient::new(Arc::new(c)))\n\n }\n\n}\n\n\n","file_path":"tikv-client-store/src/lib.rs","rank":42,"score":85131.43852800652},{"content":"pub fn parse_args(app_name: &str) -> CommandArgs {\n\n let matches = App::new(app_name)\n\n .version(crate_version!())\n\n .author(\"The TiKV Project Authors\")\n\n .arg(\n\n Arg::with_name(\"pd\")\n\n .long(\"pd\")\n\n .aliases(&[\"pd-endpoint\", \"pd-endpoints\"])\n\n .value_name(\"PD_URL\")\n\n .help(\"Sets PD endpoints\")\n\n .long_help(\"Sets PD endpoints. Uses `,` to separate multiple PDs\")\n\n .takes_value(true)\n\n .multiple(true)\n\n .value_delimiter(\",\")\n\n .required(true),\n\n )\n\n // A cyclic dependency between CA, cert and key is made\n\n // to ensure that no security options are missing.\n\n .arg(\n\n Arg::with_name(\"ca\")\n","file_path":"examples/common/mod.rs","rank":43,"score":84682.22115557893},{"content":"fn check_pem_file(tag: &str, path: &Path) -> Result<File> {\n\n File::open(path)\n\n .map_err(|e| internal_err!(\"failed to open {} to load {}: {:?}\", path.display(), tag, e))\n\n}\n\n\n","file_path":"tikv-client-common/src/security.rs","rank":44,"score":81781.14182236612},{"content":"pub fn pd_stats(cmd: &'static str) -> RequestStats {\n\n RequestStats::new(\n\n cmd,\n\n &PD_REQUEST_DURATION_HISTOGRAM_VEC,\n\n &PD_REQUEST_COUNTER_VEC,\n\n &PD_FAILED_REQUEST_DURATION_HISTOGRAM_VEC,\n\n &PD_FAILED_REQUEST_COUNTER_VEC,\n\n )\n\n}\n\n\n","file_path":"tikv-client-common/src/stats.rs","rank":45,"score":79741.78107838113},{"content":"pub fn tikv_stats(cmd: &'static str) -> RequestStats {\n\n RequestStats::new(\n\n cmd,\n\n &TIKV_REQUEST_DURATION_HISTOGRAM_VEC,\n\n &TIKV_REQUEST_COUNTER_VEC,\n\n &TIKV_FAILED_REQUEST_DURATION_HISTOGRAM_VEC,\n\n &TIKV_FAILED_REQUEST_COUNTER_VEC,\n\n )\n\n}\n\n\n","file_path":"tikv-client-common/src/stats.rs","rank":46,"score":79741.78107838113},{"content":"fn load_pem_file(tag: &str, path: &Path) -> Result<Vec<u8>> {\n\n let mut file = check_pem_file(tag, path)?;\n\n let mut key = vec![];\n\n file.read_to_end(&mut key)\n\n .map_err(|e| {\n\n internal_err!(\n\n \"failed to load {} from path {}: {:?}\",\n\n tag,\n\n path.display(),\n\n e\n\n )\n\n })\n\n .map(|_| key)\n\n}\n\n\n\n#[derive(Default)]\n\npub struct SecurityManager {\n\n ca: Vec<u8>,\n\n cert: Vec<u8>,\n\n key: PathBuf,\n","file_path":"tikv-client-common/src/security.rs","rank":47,"score":78727.69657090389},{"content":"use derive_new::new;\n\nuse kvproto::{kvrpcpb, metapb};\n\nuse tikv_client_common::{Error, Key, Result};\n\n\n\npub type RegionId = u64;\n\npub type StoreId = u64;\n\n\n\n#[derive(Eq, PartialEq, Hash, Clone, Default, Debug)]\n\npub struct RegionVerId {\n\n pub id: RegionId,\n\n pub conf_ver: u64,\n\n pub ver: u64,\n\n}\n\n\n\n#[derive(new, Clone, Default, Debug, PartialEq)]\n\npub struct Region {\n\n pub region: metapb::Region,\n\n pub leader: Option<metapb::Peer>,\n\n}\n\n\n","file_path":"tikv-client-store/src/region.rs","rank":48,"score":68925.14310325815},{"content":"impl Region {\n\n #[allow(dead_code)]\n\n pub fn switch_peer(&mut self, _to: StoreId) -> Result<()> {\n\n unimplemented!()\n\n }\n\n\n\n pub fn contains(&self, key: &Key) -> bool {\n\n let key: &[u8] = key.into();\n\n let start_key = self.region.get_start_key();\n\n let end_key = self.region.get_end_key();\n\n key >= start_key && (key < end_key || end_key.is_empty())\n\n }\n\n\n\n pub fn context(&self) -> Result<kvrpcpb::Context> {\n\n self.leader\n\n .as_ref()\n\n .ok_or_else(|| Error::leader_not_found(self.region.get_id()))\n\n .map(|l| {\n\n let mut ctx = kvrpcpb::Context::default();\n\n ctx.set_region_id(self.region.get_id());\n","file_path":"tikv-client-store/src/region.rs","rank":49,"score":68915.23865356245},{"content":" let region = &self.region;\n\n let epoch = region.get_region_epoch();\n\n RegionVerId {\n\n id: region.get_id(),\n\n conf_ver: epoch.get_conf_ver(),\n\n ver: epoch.get_version(),\n\n }\n\n }\n\n\n\n pub fn id(&self) -> RegionId {\n\n self.region.get_id()\n\n }\n\n\n\n pub fn get_store_id(&self) -> Result<StoreId> {\n\n self.leader\n\n .as_ref()\n\n .cloned()\n\n .ok_or_else(|| Error::leader_not_found(self.id()))\n\n .map(|s| s.get_store_id())\n\n }\n\n}\n","file_path":"tikv-client-store/src/region.rs","rank":50,"score":68906.37553538021},{"content":" ctx.set_region_epoch(Clone::clone(self.region.get_region_epoch()));\n\n ctx.set_peer(Clone::clone(l));\n\n ctx\n\n })\n\n }\n\n\n\n pub fn start_key(&self) -> Key {\n\n self.region.get_start_key().to_vec().into()\n\n }\n\n\n\n pub fn end_key(&self) -> Key {\n\n self.region.get_end_key().to_vec().into()\n\n }\n\n\n\n pub fn range(&self) -> (Key, Key) {\n\n (self.start_key(), self.end_key())\n\n }\n\n\n\n #[allow(dead_code)]\n\n pub fn ver_id(&self) -> RegionVerId {\n","file_path":"tikv-client-store/src/region.rs","rank":51,"score":68902.38752767966},{"content":"macro_rules! has_key_error {\n\n ($type:ty) => {\n\n impl HasError for $type {\n\n fn error(&mut self) -> Option<Error> {\n\n if self.has_error() {\n\n Some(self.take_error().into())\n\n } else {\n\n None\n\n }\n\n }\n\n }\n\n };\n\n}\n\n\n\nhas_key_error!(kvrpcpb::GetResponse);\n\nhas_key_error!(kvrpcpb::CommitResponse);\n\nhas_key_error!(kvrpcpb::BatchRollbackResponse);\n\nhas_key_error!(kvrpcpb::CleanupResponse);\n\nhas_key_error!(kvrpcpb::ScanLockResponse);\n\nhas_key_error!(kvrpcpb::ResolveLockResponse);\n","file_path":"tikv-client-store/src/errors.rs","rank":52,"score":68729.74380596535},{"content":"has_region_error!(kvrpcpb::PrewriteResponse);\n\nhas_region_error!(kvrpcpb::CommitResponse);\n\nhas_region_error!(kvrpcpb::ImportResponse);\n\nhas_region_error!(kvrpcpb::BatchRollbackResponse);\n\nhas_region_error!(kvrpcpb::CleanupResponse);\n\nhas_region_error!(kvrpcpb::BatchGetResponse);\n\nhas_region_error!(kvrpcpb::ScanLockResponse);\n\nhas_region_error!(kvrpcpb::ResolveLockResponse);\n\nhas_region_error!(kvrpcpb::GcResponse);\n\nhas_region_error!(kvrpcpb::RawGetResponse);\n\nhas_region_error!(kvrpcpb::RawBatchGetResponse);\n\nhas_region_error!(kvrpcpb::RawPutResponse);\n\nhas_region_error!(kvrpcpb::RawBatchPutResponse);\n\nhas_region_error!(kvrpcpb::RawDeleteResponse);\n\nhas_region_error!(kvrpcpb::RawBatchDeleteResponse);\n\nhas_region_error!(kvrpcpb::DeleteRangeResponse);\n\nhas_region_error!(kvrpcpb::RawDeleteRangeResponse);\n\nhas_region_error!(kvrpcpb::RawScanResponse);\n\nhas_region_error!(kvrpcpb::RawBatchScanResponse);\n\n\n","file_path":"tikv-client-store/src/errors.rs","rank":53,"score":68727.87369215695},{"content":"has_key_error!(kvrpcpb::GcResponse);\n\n\n\nmacro_rules! has_str_error {\n\n ($type:ty) => {\n\n impl HasError for $type {\n\n fn error(&mut self) -> Option<Error> {\n\n if self.get_error().is_empty() {\n\n None\n\n } else {\n\n Some(Error::kv_error(self.take_error()))\n\n }\n\n }\n\n }\n\n };\n\n}\n\n\n\nhas_str_error!(kvrpcpb::RawGetResponse);\n\nhas_str_error!(kvrpcpb::RawPutResponse);\n\nhas_str_error!(kvrpcpb::RawBatchPutResponse);\n\nhas_str_error!(kvrpcpb::RawDeleteResponse);\n","file_path":"tikv-client-store/src/errors.rs","rank":54,"score":68727.52064475758},{"content":"has_str_error!(kvrpcpb::RawBatchDeleteResponse);\n\nhas_str_error!(kvrpcpb::RawDeleteRangeResponse);\n\nhas_str_error!(kvrpcpb::ImportResponse);\n\nhas_str_error!(kvrpcpb::DeleteRangeResponse);\n\n\n\nimpl HasError for kvrpcpb::ScanResponse {\n\n fn error(&mut self) -> Option<Error> {\n\n extract_errors(self.pairs.iter_mut().map(|pair| pair.error.take()))\n\n }\n\n}\n\n\n\nimpl HasError for kvrpcpb::BatchGetResponse {\n\n fn error(&mut self) -> Option<Error> {\n\n extract_errors(self.pairs.iter_mut().map(|pair| pair.error.take()))\n\n }\n\n}\n\n\n\nimpl HasError for kvrpcpb::RawBatchGetResponse {\n\n fn error(&mut self) -> Option<Error> {\n\n extract_errors(self.pairs.iter_mut().map(|pair| pair.error.take()))\n","file_path":"tikv-client-store/src/errors.rs","rank":55,"score":68725.90623259556},{"content":" }\n\n}\n\n\n\nimpl HasError for kvrpcpb::RawScanResponse {\n\n fn error(&mut self) -> Option<Error> {\n\n extract_errors(self.kvs.iter_mut().map(|pair| pair.error.take()))\n\n }\n\n}\n\n\n\nimpl HasError for kvrpcpb::RawBatchScanResponse {\n\n fn error(&mut self) -> Option<Error> {\n\n extract_errors(self.kvs.iter_mut().map(|pair| pair.error.take()))\n\n }\n\n}\n\n\n\nimpl HasError for kvrpcpb::PrewriteResponse {\n\n fn error(&mut self) -> Option<Error> {\n\n extract_errors(self.take_errors().into_iter().map(Some))\n\n }\n\n}\n\n\n","file_path":"tikv-client-store/src/errors.rs","rank":56,"score":68725.8060185347},{"content":"// Copyright 2019 TiKV Project Authors. Licensed under Apache-2.0.\n\n\n\nuse kvproto::kvrpcpb;\n\nuse tikv_client_common::Error;\n\n\n","file_path":"tikv-client-store/src/errors.rs","rank":57,"score":68724.27503032933},{"content":"type TimestampRequest = oneshot::Sender<Timestamp>;\n\n\n\n/// The timestamp oracle (TSO) which provides monotonically increasing timestamps.\n\n#[derive(Clone)]\n\npub(crate) struct TimestampOracle {\n\n /// The transmitter of a bounded channel which transports requests of getting a single\n\n /// timestamp to the TSO working thread. A bounded channel is used to prevent using\n\n /// too much memory unexpectedly.\n\n /// In the working thread, the `TimestampRequest`, which is actually a one channel sender,\n\n /// is used to send back the timestamp result.\n\n request_tx: mpsc::Sender<TimestampRequest>,\n\n}\n\n\n\nimpl TimestampOracle {\n\n pub(crate) fn new(cluster_id: u64, pd_client: &PdClient) -> Result<TimestampOracle> {\n\n let (request_tx, request_rx) = mpsc::channel(MAX_BATCH_SIZE);\n\n // FIXME: use tso_opt\n\n let (rpc_sender, rpc_receiver) = pd_client.tso()?;\n\n\n\n // Start a background thread to handle TSO requests and responses\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":58,"score":64617.97704410757},{"content":"#[derive(new)]\n\nstruct TwoPhaseCommitter {\n\n mutations: Vec<kvrpcpb::Mutation>,\n\n start_version: u64,\n\n bg_worker: ThreadPool,\n\n rpc: Arc<PdRpcClient>,\n\n #[new(default)]\n\n committed: bool,\n\n #[new(default)]\n\n undetermined: bool,\n\n}\n\n\n\nimpl TwoPhaseCommitter {\n\n async fn commit(mut self) -> Result<()> {\n\n if self.mutations.is_empty() {\n\n self.committed = true;\n\n return Ok(());\n\n }\n\n self.prewrite().await?;\n\n match self.commit_primary().await {\n\n Ok(commit_version) => {\n","file_path":"src/transaction/transaction.rs","rank":59,"score":59239.78138709422},{"content":"pub trait HasLocks {\n\n fn take_locks(&mut self) -> Vec<kvrpcpb::LockInfo> {\n\n Vec::new()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::mock::MockPdClient;\n\n\n\n use futures::executor;\n\n\n\n #[test]\n\n fn test_resolve_lock_with_retry() {\n\n // Test resolve lock within retry limit\n\n fail::cfg(\"region-error\", \"9*return\").unwrap();\n\n let client = Arc::new(MockPdClient);\n\n let key: Key = vec![1].into();\n\n let region1 = MockPdClient::region1();\n","file_path":"src/transaction/lock.rs","rank":60,"score":51114.87470686478},{"content":"/// Permits easy mocking of rpc calls.\n\npub trait DispatchHook: KvRequest {\n\n fn dispatch_hook(\n\n &self,\n\n _opt: CallOption,\n\n ) -> Option<BoxFuture<'static, Result<Self::RpcResponse>>> {\n\n None\n\n }\n\n}\n\n\n\nimpl<T: KvRequest> DispatchHook for T {\n\n #[cfg(test)]\n\n default fn dispatch_hook(\n\n &self,\n\n _opt: CallOption,\n\n ) -> Option<BoxFuture<'static, Result<Self::RpcResponse>>> {\n\n None\n\n }\n\n}\n\n\n","file_path":"src/request.rs","rank":61,"score":47497.25452811817},{"content":"pub trait KvRpcRequest: Default {\n\n fn set_context(&mut self, context: kvrpcpb::Context);\n\n}\n\n\n\nmacro_rules! impl_kv_rpc_request {\n\n ($name: ident) => {\n\n impl KvRpcRequest for kvrpcpb::$name {\n\n fn set_context(&mut self, context: kvrpcpb::Context) {\n\n self.set_context(context);\n\n }\n\n }\n\n };\n\n}\n\n\n\nimpl_kv_rpc_request!(RawGetRequest);\n\nimpl_kv_rpc_request!(RawBatchGetRequest);\n\nimpl_kv_rpc_request!(RawPutRequest);\n\nimpl_kv_rpc_request!(RawBatchPutRequest);\n\nimpl_kv_rpc_request!(RawDeleteRequest);\n\nimpl_kv_rpc_request!(RawBatchDeleteRequest);\n","file_path":"src/request.rs","rank":62,"score":47497.25452811817},{"content":"/// An extension crate to make using our combinator functions more ergonomic.\n\npub trait ClientFutureExt {\n\n /// This function is similar to `map_ok` combinator. Provide a function which\n\n /// is applied after the `self` future is resolved, only if that future\n\n /// resolves to `Ok`. Similar to `Result::and_then`, the supplied function\n\n /// must return a Result (c.f., `map_ok`, which returns the underlying type,\n\n /// `T`).\n\n ///\n\n /// Note that unlike `and_then`, the supplied function returns a resolved\n\n /// value, not a closure.\n\n fn ok_and_then<U, T, F, E>(self, func: F) -> OkAndThen<Self, F>\n\n where\n\n F: FnMut(U) -> Result<T, E>,\n\n Self: Future<Output = Result<U, E>> + Sized,\n\n {\n\n OkAndThen { future: self, func }\n\n }\n\n}\n\n\n\nimpl<T: TryFuture> ClientFutureExt for T {}\n","file_path":"tikv-client-common/src/compat.rs","rank":63,"score":46879.25444292762},{"content":"/// A convenience trait for converting ranges of borrowed types into a `BoundRange`.\n\npub trait ToOwnedRange {\n\n /// Transform a borrowed range of some form into an owned `BoundRange`.\n\n fn to_owned(self) -> BoundRange;\n\n}\n\n\n\nimpl<T: Into<Key> + Borrow<U>, U: ToOwned<Owned = T> + ?Sized> ToOwnedRange for Range<&U> {\n\n fn to_owned(self) -> BoundRange {\n\n From::from(Range {\n\n start: self.start.to_owned(),\n\n end: self.end.to_owned(),\n\n })\n\n }\n\n}\n\n\n\nimpl<T: Into<Key> + Borrow<U>, U: ToOwned<Owned = T> + ?Sized> ToOwnedRange for RangeFrom<&U> {\n\n fn to_owned(self) -> BoundRange {\n\n From::from(RangeFrom {\n\n start: self.start.to_owned(),\n\n })\n\n }\n","file_path":"tikv-client-common/src/kv/bound_range.rs","rank":64,"score":45970.808582868696},{"content":"pub trait Backoff: Clone + Send + 'static {\n\n // Returns the delay period for next retry. If the maximum retry count is hit returns None.\n\n fn next_delay_duration(&mut self) -> Option<Duration>;\n\n}\n\n\n\n// Exponential backoff means that the retry delay should multiply a constant\n\n// after each attempt, up to a maximum value. After each attempt, the new retry\n\n// delay should be:\n\n//\n\n// new_delay = min(max_delay, base_delay * 2 ** attempts)\n\n#[derive(Clone)]\n\npub struct NoJitterBackoff {\n\n current_attempts: u32,\n\n max_attempts: u32,\n\n current_delay_ms: u64,\n\n max_delay_ms: u64,\n\n}\n\n\n\nimpl NoJitterBackoff {\n\n pub const fn new(base_delay_ms: u64, max_delay_ms: u64, max_attempts: u32) -> Self {\n","file_path":"src/backoff.rs","rank":65,"score":45343.79078038966},{"content":"pub trait PdClient: Send + Sync + 'static {\n\n type KvClient: KvClient + Send + Sync + 'static;\n\n\n\n fn map_region_to_store(\n\n self: Arc<Self>,\n\n region: Region,\n\n ) -> BoxFuture<'static, Result<Store<Self::KvClient>>>;\n\n\n\n fn region_for_key(&self, key: &Key) -> BoxFuture<'static, Result<Region>>;\n\n\n\n fn region_for_id(&self, id: RegionId) -> BoxFuture<'static, Result<Region>>;\n\n\n\n fn get_timestamp(self: Arc<Self>) -> BoxFuture<'static, Result<Timestamp>>;\n\n\n\n fn store_for_key(\n\n self: Arc<Self>,\n\n key: &Key,\n\n ) -> BoxFuture<'static, Result<Store<Self::KvClient>>> {\n\n self.region_for_key(key)\n\n .and_then(move |region| self.map_region_to_store(region))\n","file_path":"src/pd/client.rs","rank":66,"score":43363.145863591104},{"content":"use crate::Region;\n\nuse std::time::Duration;\n\n\n\npub struct StoreBuilder {\n\n pub region: Region,\n\n pub address: String,\n\n pub timeout: Duration,\n\n}\n\n\n\nimpl StoreBuilder {\n\n pub fn new(region: Region, address: String, timeout: Duration) -> StoreBuilder {\n\n StoreBuilder {\n\n region,\n\n address,\n\n timeout,\n\n }\n\n }\n\n}\n","file_path":"tikv-client-store/src/store_builder.rs","rank":67,"score":42534.182666794455},{"content":"pub trait KvRequest: Sync + Send + 'static + Sized {\n\n type Result;\n\n type RpcResponse: HasError + HasLocks + Clone + Send + 'static;\n\n /// A single `KvRequest` can be divided into a number of RPC requests because the keys span\n\n /// several regions or a single RPC request is too large. Most of the fields in these requests\n\n /// share the same content while `KeyData`, which contains keys (and associated data if any),\n\n /// is the part which differs among the requests.\n\n type KeyData;\n\n const REQUEST_NAME: &'static str;\n\n const RPC_FN: RpcFnType<Self, Self::RpcResponse>;\n\n\n\n fn execute(self, pd_client: Arc<impl PdClient>) -> BoxFuture<'static, Result<Self::Result>> {\n\n Self::reduce(\n\n self.response_stream(pd_client)\n\n .and_then(|mut response| match response.error() {\n\n Some(e) => future::err(e),\n\n None => future::ok(response),\n\n })\n\n .map_ok(Self::map_result)\n\n .boxed(),\n","file_path":"src/request.rs","rank":68,"score":42493.18326849167},{"content":"// Copyright 2020 TiKV Project Authors. Licensed under Apache-2.0.\n\n\n\nuse kvproto::kvrpcpb::KvPair;\n\nuse std::{\n\n collections::HashMap,\n\n sync::{Arc, RwLock},\n\n};\n\n\n\n#[derive(Debug, Clone)]\n\npub struct KvStore {\n\n data: Arc<RwLock<HashMap<Vec<u8>, Vec<u8>>>>,\n\n}\n\n\n\nimpl Default for KvStore {\n\n fn default() -> Self {\n\n Self::new()\n\n }\n\n}\n\n\n\nimpl KvStore {\n","file_path":"mock-tikv/src/store.rs","rank":69,"score":35570.94635045846},{"content":" pub fn new() -> KvStore {\n\n KvStore {\n\n data: Arc::new(RwLock::new(HashMap::new())),\n\n }\n\n }\n\n\n\n pub fn raw_get(&self, key: &[u8]) -> Option<Vec<u8>> {\n\n let data = self.data.read().unwrap();\n\n data.get(key).map(|v| v.to_vec())\n\n }\n\n\n\n pub fn raw_batch_get(&self, keys: Vec<Vec<u8>>) -> Vec<KvPair> {\n\n let data = self.data.read().unwrap();\n\n keys.into_iter()\n\n .filter_map(|key| {\n\n if data.contains_key(&key) {\n\n let mut pair = KvPair::default();\n\n pair.set_value(data.get(&key).unwrap().to_vec());\n\n pair.set_key(key);\n\n Some(pair)\n","file_path":"mock-tikv/src/store.rs","rank":70,"score":35562.906283851924},{"content":"\n\n pub fn raw_delete(&self, key: &[u8]) {\n\n let mut data = self.data.write().unwrap();\n\n data.remove(key);\n\n }\n\n\n\n pub fn raw_batch_delete(&self, keys: Vec<Vec<u8>>) {\n\n let mut data = self.data.write().unwrap();\n\n keys.iter().for_each(|k| {\n\n data.remove(k);\n\n });\n\n }\n\n}\n","file_path":"mock-tikv/src/store.rs","rank":71,"score":35560.06255857689},{"content":" } else {\n\n None\n\n }\n\n })\n\n .collect()\n\n }\n\n\n\n pub fn raw_put(&self, key: Vec<u8>, value: Vec<u8>) {\n\n let mut data = self.data.write().unwrap();\n\n data.insert(key, value);\n\n }\n\n\n\n pub fn raw_batch_put(&self, pairs: Vec<KvPair>) {\n\n let mut data = self.data.write().unwrap();\n\n data.extend(\n\n pairs\n\n .into_iter()\n\n .map(|mut pair| (pair.take_key(), pair.take_value())),\n\n );\n\n }\n","file_path":"mock-tikv/src/store.rs","rank":72,"score":35558.89555866763},{"content":" /// ```rust\n\n /// # use tikv_client_common::Config;\n\n /// let config = Config::new(vec![\"192.168.0.100:2379\", \"192.168.0.101:2379\"])\n\n /// .with_security(\"root.ca\", \"internal.cert\", \"internal.key\");\n\n /// ```\n\n pub fn with_security(\n\n mut self,\n\n ca_path: impl Into<PathBuf>,\n\n cert_path: impl Into<PathBuf>,\n\n key_path: impl Into<PathBuf>,\n\n ) -> Self {\n\n self.ca_path = Some(ca_path.into());\n\n self.cert_path = Some(cert_path.into());\n\n self.key_path = Some(key_path.into());\n\n self\n\n }\n\n\n\n pub fn timeout(mut self, timeout: Duration) -> Self {\n\n self.timeout = timeout;\n\n self\n\n }\n\n}\n","file_path":"tikv-client-common/src/config.rs","rank":73,"score":34672.651249354894},{"content":" /// ```rust\n\n /// # use tikv_client_common::Config;\n\n /// let config = Config::new(vec![\"192.168.0.100:2379\", \"192.168.0.101:2379\"]);\n\n /// ```\n\n pub fn new(pd_endpoints: impl IntoIterator<Item = impl Into<String>>) -> Self {\n\n Config {\n\n pd_endpoints: pd_endpoints.into_iter().map(Into::into).collect(),\n\n ca_path: None,\n\n cert_path: None,\n\n key_path: None,\n\n timeout: DEFAULT_REQUEST_TIMEOUT,\n\n }\n\n }\n\n\n\n /// Set the certificate authority, certificate, and key locations for the\n\n /// [`Config`](Config).\n\n ///\n\n /// By default, TiKV connections do not utilize transport layer security. Enable it by setting\n\n /// these values.\n\n ///\n","file_path":"tikv-client-common/src/config.rs","rank":74,"score":34672.353015558365},{"content":"/// TiKV does not currently offer encrypted storage (or encryption-at-rest).\n\n#[derive(Clone, Debug, Default, Serialize, Deserialize, PartialEq)]\n\n#[serde(default)]\n\n#[serde(rename_all = \"kebab-case\")]\n\npub struct Config {\n\n pub pd_endpoints: Vec<String>,\n\n pub ca_path: Option<PathBuf>,\n\n pub cert_path: Option<PathBuf>,\n\n pub key_path: Option<PathBuf>,\n\n pub timeout: Duration,\n\n}\n\n\n\nconst DEFAULT_REQUEST_TIMEOUT: Duration = Duration::from_secs(2);\n\n\n\nimpl Config {\n\n /// Create a new [`Config`](Config) which coordinates with the given PD endpoints.\n\n ///\n\n /// It's important to **include more than one PD endpoint** (include all, if possible!)\n\n /// This helps avoid having a *single point of failure*.\n\n ///\n","file_path":"tikv-client-common/src/config.rs","rank":75,"score":34670.542461642624},{"content":"// Copyright 2019 TiKV Project Authors. Licensed under Apache-2.0.\n\n\n\nuse serde_derive::{Deserialize, Serialize};\n\nuse std::{path::PathBuf, time::Duration};\n\n\n\n/// The configuration for either a `raw::Client` or a `transaction::Client`.\n\n///\n\n/// Because TiKV is managed by a [PD](https://github.com/pingcap/pd/) cluster, the endpoints for PD\n\n/// must be provided, **not** the TiKV nodes.\n\n///\n\n/// It's important to **include more than one PD endpoint** (include all, if possible!)\n\n/// This helps avoid having a *single point of failure*.\n\n///\n\n/// By default, this client will use an insecure connection over instead of one protected by\n\n/// Transport Layer Security (TLS). Your deployment may have chosen to rely on security measures\n\n/// such as a private network, or a VPN layer to provid secure transmission.\n\n///\n\n/// To use a TLS secured connection, use the `with_security` function to set the required\n\n/// parameters.\n\n///\n","file_path":"tikv-client-common/src/config.rs","rank":76,"score":34655.29126296659},{"content":" thread::spawn(move || {\n\n block_on(run_tso(\n\n cluster_id,\n\n rpc_sender.sink_err_into(),\n\n rpc_receiver.err_into(),\n\n request_rx,\n\n ))\n\n });\n\n\n\n Ok(TimestampOracle { request_tx })\n\n }\n\n\n\n pub(crate) async fn get_timestamp(mut self) -> Result<Timestamp> {\n\n let (request, response) = oneshot::channel();\n\n self.request_tx\n\n .send(request)\n\n .await\n\n .map_err(|_| Error::internal_error(\"TimestampRequest channel is closed\"))?;\n\n Ok(response.await?)\n\n }\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":77,"score":34512.8433806994},{"content":"}\n\n\n\nasync fn run_tso(\n\n cluster_id: u64,\n\n mut rpc_sender: impl Sink<(TsoRequest, WriteFlags), Error = Error> + Unpin,\n\n mut rpc_receiver: impl Stream<Item = Result<TsoResponse>> + Unpin,\n\n request_rx: mpsc::Receiver<TimestampRequest>,\n\n) {\n\n // The `TimestampRequest`s which are waiting for the responses from the PD server\n\n let pending_requests = Rc::new(RefCell::new(VecDeque::with_capacity(MAX_PENDING_COUNT)));\n\n\n\n // When there are too many pending requests, the `send_request` future will refuse to fetch\n\n // more requests from the bounded channel. This waker is used to wake up the sending future\n\n // if the queue containing pending requests is no longer full.\n\n let sending_future_waker = Rc::new(AtomicWaker::new());\n\n\n\n pin_mut!(request_rx);\n\n let mut request_stream = TsoRequestStream {\n\n cluster_id,\n\n request_rx,\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":78,"score":34505.11457451827},{"content":"//! A timestamp returned from the timestamp oracle.\n\n//!\n\n//! The version used in transactions can be converted from a timestamp.\n\n//! The lower 18 (PHYSICAL_SHIFT_BITS) bits are the logical part of the timestamp.\n\n//! The higher bits of the version are the physical part of the timestamp.\n\n\n\npub use kvproto::pdpb::Timestamp;\n\nuse std::convert::TryInto;\n\n\n\nconst PHYSICAL_SHIFT_BITS: i64 = 18;\n\nconst LOGICAL_MASK: i64 = (1 << PHYSICAL_SHIFT_BITS) - 1;\n\n\n","file_path":"tikv-client-common/src/timestamp.rs","rank":79,"score":34502.53874850417},{"content":"use grpcio::WriteFlags;\n\nuse kvproto::pdpb::*;\n\nuse std::{cell::RefCell, collections::VecDeque, pin::Pin, rc::Rc, thread};\n\nuse tikv_client_common::{Error, Result};\n\n\n\n/// It is an empirical value.\n\nconst MAX_BATCH_SIZE: usize = 64;\n\n\n\n/// TODO: This value should be adjustable.\n\nconst MAX_PENDING_COUNT: usize = 1 << 16;\n\n\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":80,"score":34500.87057917636},{"content":" \"PD gives different number of timestamps than expected\",\n\n ));\n\n }\n\n\n\n for request in requests {\n\n offset -= 1;\n\n let ts = Timestamp {\n\n physical: tail_ts.physical,\n\n logical: tail_ts.logical - offset as i64,\n\n };\n\n let _ = request.send(ts);\n\n }\n\n } else {\n\n return Err(Error::internal_error(\n\n \"PD gives more TsoResponse than expected\",\n\n ));\n\n };\n\n Ok(())\n\n}\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":81,"score":34498.69343359164},{"content":" pending_requests: pending_requests.clone(),\n\n self_waker: sending_future_waker.clone(),\n\n }\n\n .map(Ok);\n\n\n\n let send_requests = rpc_sender.send_all(&mut request_stream);\n\n\n\n let receive_and_handle_responses = async move {\n\n while let Some(Ok(resp)) = rpc_receiver.next().await {\n\n let mut pending_requests = pending_requests.borrow_mut();\n\n\n\n // Wake up the sending future blocked by too many pending requests as we are consuming\n\n // some of them here.\n\n if pending_requests.len() == MAX_PENDING_COUNT {\n\n sending_future_waker.wake();\n\n }\n\n\n\n allocate_timestamps(&resp, &mut pending_requests)?;\n\n }\n\n // TODO: distinguish between unexpected stream termination and expected end of test\n\n info!(\"TSO stream terminated\");\n\n Ok(())\n\n };\n\n\n\n let (send_res, recv_res): (_, Result<()>) = join!(send_requests, receive_and_handle_responses);\n\n info!(\"TSO send termination: {:?}\", send_res);\n\n info!(\"TSO receive termination: {:?}\", recv_res);\n\n}\n\n\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":82,"score":34498.46254140279},{"content":"// Copyright 2019 TiKV Project Authors. Licensed under Apache-2.0.\n\n\n\n//! This module is the low-level mechanisms for getting timestamps from a PD\n\n//! cluster. It should be used via the `get_timestamp` API in `PdClient`.\n\n//!\n\n//! Once a `TimestampOracle` is created, there will be two futures running in a background working\n\n//! thread created automatically. The `get_timestamp` method creates a oneshot channel whose\n\n//! transmitter is served as a `TimestampRequest`. `TimestampRequest`s are sent to the working\n\n//! thread through a bounded multi-producer, single-consumer channel. Every time the first future\n\n//! is polled, it tries to exhaust the channel to get as many requests as possible and sends a\n\n//! single `TsoRequest` to the PD server. The other future receives `TsoResponse`s from the PD\n\n//! server and allocates timestamps for the requests.\n\n\n\nuse futures::{\n\n channel::{mpsc, oneshot},\n\n executor::block_on,\n\n join, pin_mut,\n\n prelude::*,\n\n task::{AtomicWaker, Context, Poll},\n\n};\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":83,"score":34498.0636444723},{"content":" Poll::Ready(None) => return Poll::Ready(None),\n\n Poll::Pending => break,\n\n }\n\n }\n\n\n\n if !requests.is_empty() {\n\n let req = TsoRequest {\n\n header: Some(RequestHeader {\n\n cluster_id: self.cluster_id,\n\n }),\n\n count: requests.len() as u32,\n\n };\n\n\n\n let request_group = RequestGroup {\n\n tso_request: req.clone(),\n\n requests,\n\n };\n\n pending_requests.push_back(request_group);\n\n\n\n let write_flags = WriteFlags::default().buffer_hint(false);\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":84,"score":34490.68755660072},{"content":" Poll::Ready(Some((req, write_flags)))\n\n } else {\n\n // Set the waker to the context, then the stream can be waked up after the pending queue\n\n // is no longer full.\n\n self.self_waker.register(cx.waker());\n\n Poll::Pending\n\n }\n\n }\n\n}\n\n\n","file_path":"tikv-client-pd/src/timestamp.rs","rank":85,"score":34490.68755660072},{"content":"impl Display for Error {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n Display::fmt(&self.inner, f)\n\n }\n\n}\n\n\n\nimpl Error {\n\n pub fn kind(&self) -> &ErrorKind {\n\n self.inner.get_context()\n\n }\n\n\n\n #[allow(dead_code)]\n\n pub fn unimplemented() -> Self {\n\n Error::from(ErrorKind::Unimplemented)\n\n }\n\n\n\n pub fn region_for_key_not_found(key: Vec<u8>) -> Self {\n\n Error::from(ErrorKind::RegionForKeyNotFound { key })\n\n }\n\n\n","file_path":"tikv-client-common/src/errors.rs","rank":86,"score":34458.337937577344},{"content":"\n\nimpl From<std::io::Error> for Error {\n\n fn from(err: std::io::Error) -> Self {\n\n Error::from(ErrorKind::Io(err))\n\n }\n\n}\n\n\n\nimpl From<grpcio::Error> for Error {\n\n fn from(err: grpcio::Error) -> Self {\n\n Error::from(ErrorKind::Grpc(err))\n\n }\n\n}\n\n\n\nimpl From<futures::channel::oneshot::Canceled> for Error {\n\n fn from(err: futures::channel::oneshot::Canceled) -> Self {\n\n Error::from(ErrorKind::Canceled(err))\n\n }\n\n}\n\n\n\nimpl From<kvproto::kvrpcpb::KeyError> for Error {\n\n fn from(err: kvproto::kvrpcpb::KeyError) -> Self {\n\n Error::from(ErrorKind::KeyError(err))\n\n }\n\n}\n\n\n\n/// A result holding an [`Error`](Error).\n\npub type Result<T> = result::Result<T, Error>;\n","file_path":"tikv-client-common/src/errors.rs","rank":87,"score":34457.75886736263},{"content":" pub fn region_error(error: kvproto::errorpb::Error) -> Self {\n\n Error::from(ErrorKind::RegionError(error))\n\n }\n\n\n\n pub fn region_not_found(region_id: u64) -> Self {\n\n Error::from(ErrorKind::RegionNotFound { region_id })\n\n }\n\n\n\n pub fn leader_not_found(region_id: u64) -> Self {\n\n Error::from(ErrorKind::LeaderNotFound { region_id })\n\n }\n\n\n\n pub fn invalid_key_range() -> Self {\n\n Error::from(ErrorKind::InvalidKeyRange)\n\n }\n\n\n\n pub fn max_scan_limit_exceeded(limit: u32, max_limit: u32) -> Self {\n\n Error::from(ErrorKind::MaxScanLimitExceeded { limit, max_limit })\n\n }\n\n\n","file_path":"tikv-client-common/src/errors.rs","rank":88,"score":34453.00611841118},{"content":" pub fn kv_error(message: String) -> Self {\n\n Error::from(ErrorKind::KvError { message })\n\n }\n\n\n\n pub fn internal_error(message: impl Into<String>) -> Self {\n\n Error::from(ErrorKind::InternalError {\n\n message: message.into(),\n\n })\n\n }\n\n\n\n pub fn multiple_errors(errors: Vec<Error>) -> Self {\n\n Error::from(ErrorKind::MultipleErrors(errors))\n\n }\n\n\n\n pub fn undetermined_error(error: Error) -> Self {\n\n Error::from(ErrorKind::UndeterminedError(error))\n\n }\n\n}\n\n\n\nimpl From<errorpb::Error> for Error {\n","file_path":"tikv-client-common/src/errors.rs","rank":89,"score":34452.61207711862},{"content":"// Copyright 2018 TiKV Project Authors. Licensed under Apache-2.0.\n\n\n\nuse failure::{Backtrace, Context, Fail};\n\nuse kvproto::errorpb;\n\nuse std::{\n\n fmt::{self, Display},\n\n result,\n\n};\n\n\n\n#[derive(Debug)]\n\npub struct Error {\n\n inner: Box<Context<ErrorKind>>,\n\n}\n\n\n\n/// An error originating from the TiKV client or dependencies.\n\n#[derive(Debug, Fail)]\n\n#[allow(clippy::large_enum_variant)]\n\npub enum ErrorKind {\n\n /// Wraps a `std::io::Error`.\n\n #[fail(display = \"IO error: {}\", _0)]\n","file_path":"tikv-client-common/src/errors.rs","rank":90,"score":34449.84167060134},{"content":" #[fail(display = \"Leader of region {} is not found\", region_id)]\n\n LeaderNotFound { region_id: u64 },\n\n /// Whether the transaction is committed or not is undetermined\n\n #[fail(display = \"Whether the transaction is committed or not is undetermined\")]\n\n UndeterminedError(#[fail(cause)] Error),\n\n /// Invalid key range to scan. Only left bounded intervals are supported.\n\n #[fail(display = \"Only left bounded intervals are supported\")]\n\n InvalidKeyRange,\n\n /// Cannot set an empty value\n\n #[fail(display = \"Cannot set an empty value\")]\n\n EmptyValue,\n\n /// Scan limit exceeds the maximum\n\n #[fail(display = \"Limit {} exceeds max scan limit {}\", limit, max_limit)]\n\n MaxScanLimitExceeded { limit: u32, max_limit: u32 },\n\n /// Wraps `kvproto::kvrpcpb::KeyError`\n\n #[fail(display = \"{:?}\", _0)]\n\n KeyError(kvproto::kvrpcpb::KeyError),\n\n /// A string error returned by TiKV server\n\n #[fail(display = \"Kv error. {}\", message)]\n\n KvError { message: String },\n","file_path":"tikv-client-common/src/errors.rs","rank":91,"score":34448.91598828679},{"content":" Io(#[fail(cause)] std::io::Error),\n\n /// Wraps a `grpcio::Error`.\n\n #[fail(display = \"gRPC error: {}\", _0)]\n\n Grpc(#[fail(cause)] grpcio::Error),\n\n /// Represents that a futures oneshot channel was cancelled.\n\n #[fail(display = \"A futures oneshot channel was canceled. {}\", _0)]\n\n Canceled(#[fail(cause)] futures::channel::oneshot::Canceled),\n\n /// Feature is not implemented.\n\n #[fail(display = \"Unimplemented feature\")]\n\n Unimplemented,\n\n /// No region is found for the given key.\n\n #[fail(display = \"Region is not found for key: {:?}\", key)]\n\n RegionForKeyNotFound { key: Vec<u8> },\n\n /// Errors caused by changed region information\n\n #[fail(display = \"Region error: {:?}\", _0)]\n\n RegionError(kvproto::errorpb::Error),\n\n /// No region is found for the given id.\n\n #[fail(display = \"Region {} is not found\", region_id)]\n\n RegionNotFound { region_id: u64 },\n\n /// No region is found for the given id.\n","file_path":"tikv-client-common/src/errors.rs","rank":92,"score":34444.9159081805},{"content":" fn from(e: errorpb::Error) -> Error {\n\n Error::region_error(e)\n\n }\n\n}\n\n\n\nimpl From<ErrorKind> for Error {\n\n fn from(kind: ErrorKind) -> Error {\n\n Error {\n\n inner: Box::new(Context::new(kind)),\n\n }\n\n }\n\n}\n\n\n\nimpl From<Context<ErrorKind>> for Error {\n\n fn from(inner: Context<ErrorKind>) -> Error {\n\n Error {\n\n inner: Box::new(inner),\n\n }\n\n }\n\n}\n","file_path":"tikv-client-common/src/errors.rs","rank":93,"score":34443.698342288815},{"content":" #[fail(display = \"{}\", message)]\n\n InternalError { message: String },\n\n /// Multiple errors\n\n #[fail(display = \"Multiple errors: {:?}\", _0)]\n\n MultipleErrors(Vec<Error>),\n\n /// Invalid ColumnFamily\n\n #[fail(display = \"Unsupported column family {}\", _0)]\n\n ColumnFamilyError(String),\n\n}\n\n\n\nimpl Fail for Error {\n\n fn cause(&self) -> Option<&dyn Fail> {\n\n self.inner.cause()\n\n }\n\n\n\n fn backtrace(&self) -> Option<&Backtrace> {\n\n self.inner.backtrace()\n\n }\n\n}\n\n\n","file_path":"tikv-client-common/src/errors.rs","rank":94,"score":34443.11916554209},{"content":"// Copyright 2018 TiKV Project Authors. Licensed under Apache-2.0.\n\n\n\n#[macro_use]\n\nextern crate log;\n\n\n\nmod errors;\n\npub mod region;\n\nmod store_builder;\n\n\n\npub use crate::errors::{HasError, HasRegionError};\n\n#[doc(inline)]\n\npub use crate::region::{Region, RegionId, RegionVerId, StoreId};\n\n#[doc(inline)]\n\npub use crate::store_builder::StoreBuilder;\n\npub use kvproto::tikvpb::TikvClient;\n\n\n\nuse derive_new::new;\n\nuse futures::{future::BoxFuture, prelude::*};\n\nuse grpcio::{CallOption, Environment};\n\nuse std::{sync::Arc, time::Duration};\n\nuse tikv_client_common::{security::SecurityManager, stats::tikv_stats, ErrorKind, Result};\n\n\n\n/// A trait for connecting to TiKV stores.\n","file_path":"tikv-client-store/src/lib.rs","rank":95,"score":34308.33699809596},{"content":"#[derive(new)]\n\npub struct Store<Client: KvClient> {\n\n pub region: Region,\n\n pub client: Client,\n\n timeout: Duration,\n\n}\n\n\n\nimpl<Client: KvClient> Store<Client> {\n\n pub fn from_builder<T>(builder: StoreBuilder, connect: Arc<T>) -> Result<Store<Client>>\n\n where\n\n Client: KvClient + Clone + Send + Sync + 'static,\n\n T: KvConnect<KvClient = Client>,\n\n {\n\n info!(\"connect to tikv endpoint: {:?}\", &builder.address);\n\n let client = connect.connect(builder.address.as_str())?;\n\n Ok(Store::new(builder.region, client, builder.timeout))\n\n }\n\n\n\n pub fn call_options(&self) -> CallOption {\n\n CallOption::default().timeout(self.timeout)\n","file_path":"tikv-client-store/src/lib.rs","rank":96,"score":34297.667611530036},{"content":" }\n\n\n\n pub fn dispatch<Resp, RpcFuture>(\n\n &self,\n\n request_name: &'static str,\n\n fut: ::grpcio::Result<RpcFuture>,\n\n ) -> BoxFuture<'static, Result<Resp>>\n\n where\n\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\n\n Resp: HasError + Sized + Clone + Send + 'static,\n\n RpcFuture: Send + 'static,\n\n {\n\n self.client.dispatch(request_name, fut)\n\n }\n\n}\n\n\n\nasync fn map_errors_and_trace<Resp, RpcFuture>(\n\n request_name: &'static str,\n\n fut: ::grpcio::Result<RpcFuture>,\n\n) -> Result<Resp>\n","file_path":"tikv-client-store/src/lib.rs","rank":97,"score":34294.218261570255},{"content":"where\n\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\n\n Resp: HasError + Sized + Clone + Send + 'static,\n\n{\n\n let res = match fut {\n\n Ok(f) => f.await,\n\n Err(e) => Err(e),\n\n };\n\n\n\n let context = tikv_stats(request_name);\n\n context.done(res.map_err(|e| ErrorKind::Grpc(e).into()))\n\n}\n","file_path":"tikv-client-store/src/lib.rs","rank":98,"score":34292.10278563741},{"content":"\n\nimpl KvClient for KvRpcClient {\n\n fn dispatch<Resp, RpcFuture>(\n\n &self,\n\n request_name: &'static str,\n\n fut: ::grpcio::Result<RpcFuture>,\n\n ) -> BoxFuture<'static, Result<Resp>>\n\n where\n\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\n\n Resp: HasError + Sized + Clone + Send + 'static,\n\n RpcFuture: Send + 'static,\n\n {\n\n map_errors_and_trace(request_name, fut).boxed()\n\n }\n\n\n\n fn get_rpc_client(&self) -> Arc<TikvClient> {\n\n self.rpc_client.clone()\n\n }\n\n}\n\n\n","file_path":"tikv-client-store/src/lib.rs","rank":99,"score":34291.5111316441}],"string":"[\n {\n \"content\": \"pub fn new_mvcc_get_request(key: impl Into<Key>, timestamp: Timestamp) -> kvrpcpb::GetRequest {\\n\\n let mut req = kvrpcpb::GetRequest::default();\\n\\n req.set_key(key.into().into());\\n\\n req.set_version(timestamp.version());\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::BatchGetRequest {\\n\\n type Result = Vec<KvPair>;\\n\\n type RpcResponse = kvrpcpb::BatchGetResponse;\\n\\n type KeyData = Vec<Key>;\\n\\n const REQUEST_NAME: &'static str = \\\"kv_batch_get\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_batch_get_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(&self, keys: Self::KeyData, store: &Store<KvC>) -> Self {\\n\\n let mut req = self.request_from_store(store);\\n\\n req.set_keys(keys.into_iter().map(Into::into).collect());\\n\\n req.set_version(self.version);\\n\\n\\n\\n req\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 0,\n \"score\": 260098.61649734195\n },\n {\n \"content\": \"fn extract_errors(error_iter: impl Iterator<Item = Option<kvrpcpb::KeyError>>) -> Option<Error> {\\n\\n let errors: Vec<Error> = error_iter.flatten().map(Into::into).collect();\\n\\n if errors.is_empty() {\\n\\n None\\n\\n } else if errors.len() == 1 {\\n\\n Some(errors.into_iter().next().unwrap())\\n\\n } else {\\n\\n Some(Error::multiple_errors(errors))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 1,\n \"score\": 216581.07915234807\n },\n {\n \"content\": \"pub fn new_cleanup_request(key: impl Into<Key>, start_version: u64) -> kvrpcpb::CleanupRequest {\\n\\n let mut req = kvrpcpb::CleanupRequest::default();\\n\\n req.set_key(key.into().into());\\n\\n req.set_start_version(start_version);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::PrewriteRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::PrewriteResponse;\\n\\n type KeyData = Vec<kvrpcpb::Mutation>;\\n\\n const REQUEST_NAME: &'static str = \\\"kv_prewrite\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_prewrite_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(\\n\\n &self,\\n\\n mutations: Self::KeyData,\\n\\n store: &Store<KvC>,\\n\\n ) -> Self {\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 2,\n \"score\": 204042.57826495828\n },\n {\n \"content\": \"pub fn pd_addrs() -> Vec<String> {\\n\\n var(ENV_PD_ADDRS)\\n\\n .expect(&format!(\\\"Expected {}:\\\", ENV_PD_ADDRS))\\n\\n .split(\\\",\\\")\\n\\n .map(From::from)\\n\\n .collect()\\n\\n}\\n\\n*/\\n\",\n \"file_path\": \"src/proptests/mod.rs\",\n \"rank\": 3,\n \"score\": 175032.26189665328\n },\n {\n \"content\": \"pub fn store_stream_for_key<KeyData, PdC>(\\n\\n key_data: KeyData,\\n\\n pd_client: Arc<PdC>,\\n\\n) -> BoxStream<'static, Result<(KeyData, Store<PdC::KvClient>)>>\\n\\nwhere\\n\\n KeyData: AsRef<Key> + Send + 'static,\\n\\n PdC: PdClient,\\n\\n{\\n\\n pd_client\\n\\n .store_for_key(key_data.as_ref())\\n\\n .map_ok(move |store| (key_data, store))\\n\\n .into_stream()\\n\\n .boxed()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 4,\n \"score\": 156882.96163810973\n },\n {\n \"content\": \"pub fn store_stream_for_keys<KeyData, IntoKey, I, PdC>(\\n\\n key_data: I,\\n\\n pd_client: Arc<PdC>,\\n\\n) -> BoxStream<'static, Result<(Vec<KeyData>, Store<PdC::KvClient>)>>\\n\\nwhere\\n\\n KeyData: AsRef<Key> + Send + Sync + 'static,\\n\\n IntoKey: Into<KeyData> + 'static,\\n\\n I: IntoIterator<Item = IntoKey>,\\n\\n I::IntoIter: Send + Sync + 'static,\\n\\n PdC: PdClient,\\n\\n{\\n\\n pd_client\\n\\n .clone()\\n\\n .group_keys_by_region(key_data.into_iter().map(Into::into))\\n\\n .and_then(move |(region_id, key)| {\\n\\n pd_client\\n\\n .clone()\\n\\n .store_for_id(region_id)\\n\\n .map_ok(move |store| (key, store))\\n\\n })\\n\\n .boxed()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 5,\n \"score\": 154802.94968153807\n },\n {\n \"content\": \"pub trait HasRegionError {\\n\\n fn region_error(&mut self) -> Option<Error>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 6,\n \"score\": 150951.52425535006\n },\n {\n \"content\": \"pub trait HasError: HasRegionError {\\n\\n fn error(&mut self) -> Option<Error>;\\n\\n}\\n\\n\\n\\nmacro_rules! has_region_error {\\n\\n ($type:ty) => {\\n\\n impl HasRegionError for $type {\\n\\n fn region_error(&mut self) -> Option<Error> {\\n\\n if self.has_region_error() {\\n\\n Some(self.take_region_error().into())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nhas_region_error!(kvrpcpb::GetResponse);\\n\\nhas_region_error!(kvrpcpb::ScanResponse);\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 7,\n \"score\": 150775.58786043568\n },\n {\n \"content\": \"fn pd_addrs() -> Vec<String> {\\n\\n env::var(ENV_PD_ADDRS)\\n\\n .expect(&format!(\\\"Expected {}:\\\", ENV_PD_ADDRS))\\n\\n .split(\\\",\\\")\\n\\n .map(From::from)\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 8,\n \"score\": 135692.97672929495\n },\n {\n \"content\": \"pub fn get_tag_from_thread_name() -> Option<String> {\\n\\n thread::current()\\n\\n .name()\\n\\n .and_then(|name| name.split(\\\"::\\\").skip(1).last())\\n\\n .map(From::from)\\n\\n}\\n\\n\\n\\n/// Convert Duration to seconds.\\n\",\n \"file_path\": \"tikv-client-common/src/util.rs\",\n \"rank\": 9,\n \"score\": 133105.05496380126\n },\n {\n \"content\": \"pub fn arb_batch<T: core::fmt::Debug>(\\n\\n single_strategy: impl Strategy<Value = T>,\\n\\n max_batch_size: impl Into<Option<usize>>,\\n\\n) -> impl Strategy<Value = Vec<T>> {\\n\\n let max_batch_size = max_batch_size.into().unwrap_or(PROPTEST_BATCH_SIZE_MAX);\\n\\n proptest::collection::vec(single_strategy, 0..max_batch_size)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/proptests/mod.rs\",\n \"rank\": 10,\n \"score\": 131747.3568874893\n },\n {\n \"content\": \"pub fn store_stream_for_range<PdC: PdClient>(\\n\\n range: BoundRange,\\n\\n pd_client: Arc<PdC>,\\n\\n) -> BoxStream<'static, Result<((Key, Key), Store<PdC::KvClient>)>> {\\n\\n pd_client\\n\\n .stores_for_range(range)\\n\\n .map_ok(move |store| {\\n\\n // FIXME should be bounded by self.range\\n\\n let range = store.region.range();\\n\\n (range, store)\\n\\n })\\n\\n .into_stream()\\n\\n .boxed()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 11,\n \"score\": 117572.34931375597\n },\n {\n \"content\": \"pub fn store_stream_for_ranges<PdC: PdClient>(\\n\\n ranges: Vec<BoundRange>,\\n\\n pd_client: Arc<PdC>,\\n\\n) -> BoxStream<'static, Result<(Vec<BoundRange>, Store<PdC::KvClient>)>> {\\n\\n pd_client\\n\\n .clone()\\n\\n .group_ranges_by_region(ranges)\\n\\n .and_then(move |(region_id, range)| {\\n\\n pd_client\\n\\n .clone()\\n\\n .store_for_id(region_id)\\n\\n .map_ok(move |store| (range, store))\\n\\n })\\n\\n .into_stream()\\n\\n .boxed()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 12,\n \"score\": 117572.34931375597\n },\n {\n \"content\": \"pub fn stream_fn<S, T, A, F, E>(initial_state: S, mut func: F) -> LoopFn<A, F>\\n\\nwhere\\n\\n F: FnMut(S) -> A,\\n\\n A: Future<Output = Result<Option<(S, T)>, E>>,\\n\\n{\\n\\n LoopFn {\\n\\n future: func(initial_state),\\n\\n func,\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S, T, A, F, E> Stream for LoopFn<A, F>\\n\\nwhere\\n\\n F: FnMut(S) -> A,\\n\\n A: Future<Output = Result<Option<(S, T)>, E>>,\\n\\n{\\n\\n type Item = Result<T, E>;\\n\\n fn poll_next(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {\\n\\n unsafe {\\n\\n let this = Pin::get_unchecked_mut(self);\\n\",\n \"file_path\": \"tikv-client-common/src/compat.rs\",\n \"rank\": 13,\n \"score\": 109543.58324741272\n },\n {\n \"content\": \"type GrpcResult<T> = std::result::Result<T, grpcio::Error>;\\n\\n\\n\",\n \"file_path\": \"tikv-client-pd/src/cluster.rs\",\n \"rank\": 14,\n \"score\": 106418.63234670997\n },\n {\n \"content\": \"pub trait KvClient {\\n\\n fn dispatch<Resp, RpcFuture>(\\n\\n &self,\\n\\n request_name: &'static str,\\n\\n fut: ::grpcio::Result<RpcFuture>,\\n\\n ) -> BoxFuture<'static, Result<Resp>>\\n\\n where\\n\\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\\n\\n Resp: HasError + Sized + Clone + Send + 'static,\\n\\n RpcFuture: Send + 'static;\\n\\n\\n\\n fn get_rpc_client(&self) -> Arc<TikvClient>;\\n\\n}\\n\\n\\n\\n/// This client handles requests for a single TiKV node. It converts the data\\n\\n/// types and abstractions of the client program into the grpc data types.\\n\\n#[derive(new, Clone)]\\n\\npub struct KvRpcClient {\\n\\n pub rpc_client: Arc<TikvClient>,\\n\\n}\\n\",\n \"file_path\": \"tikv-client-store/src/lib.rs\",\n \"rank\": 15,\n \"score\": 102651.26076965961\n },\n {\n \"content\": \"pub fn new_prewrite_request(\\n\\n mutations: Vec<kvrpcpb::Mutation>,\\n\\n primary_lock: Key,\\n\\n start_version: u64,\\n\\n lock_ttl: u64,\\n\\n) -> kvrpcpb::PrewriteRequest {\\n\\n let mut req = kvrpcpb::PrewriteRequest::default();\\n\\n req.set_mutations(mutations);\\n\\n req.set_primary_lock(primary_lock.into());\\n\\n req.set_start_version(start_version);\\n\\n req.set_lock_ttl(lock_ttl);\\n\\n // TODO: Lite resolve lock is currently disabled\\n\\n req.set_txn_size(std::u64::MAX);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::CommitRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::CommitResponse;\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 16,\n \"score\": 99519.3054609654\n },\n {\n \"content\": \"pub fn new_commit_request(\\n\\n keys: Vec<Key>,\\n\\n start_version: u64,\\n\\n commit_version: u64,\\n\\n) -> kvrpcpb::CommitRequest {\\n\\n let mut req = kvrpcpb::CommitRequest::default();\\n\\n req.set_keys(keys.into_iter().map(Into::into).collect());\\n\\n req.set_start_version(start_version);\\n\\n req.set_commit_version(commit_version);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::BatchRollbackRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::BatchRollbackResponse;\\n\\n type KeyData = Vec<Vec<u8>>;\\n\\n const REQUEST_NAME: &'static str = \\\"kv_batch_rollback\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_batch_rollback_async_opt;\\n\\n\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 17,\n \"score\": 99519.3054609654\n },\n {\n \"content\": \"fn convert_to_bound_key<K: Into<Key>>(b: Bound<K>) -> Bound<Key> {\\n\\n match b {\\n\\n Bound::Included(k) => Bound::Included(k.into()),\\n\\n Bound::Excluded(k) => Bound::Excluded(k.into()),\\n\\n Bound::Unbounded => Bound::Unbounded,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-common/src/kv/bound_range.rs\",\n \"rank\": 18,\n \"score\": 98677.8716817233\n },\n {\n \"content\": \"pub fn new_raw_scan_request(\\n\\n range: impl Into<BoundRange>,\\n\\n limit: u32,\\n\\n key_only: bool,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawScanRequest {\\n\\n let (start_key, end_key) = range.into().into_keys();\\n\\n let mut req = kvrpcpb::RawScanRequest::default();\\n\\n req.set_start_key(start_key.into());\\n\\n req.set_end_key(end_key.unwrap_or_default().into());\\n\\n req.set_limit(limit);\\n\\n req.set_key_only(key_only);\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawBatchScanRequest {\\n\\n type Result = Vec<KvPair>;\\n\\n type RpcResponse = kvrpcpb::RawBatchScanResponse;\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 19,\n \"score\": 97471.57530574285\n },\n {\n \"content\": \"pub fn new_raw_put_request(\\n\\n key: impl Into<Key>,\\n\\n value: impl Into<Value>,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawPutRequest {\\n\\n let mut req = kvrpcpb::RawPutRequest::default();\\n\\n req.set_key(key.into().into());\\n\\n req.set_value(value.into());\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawBatchPutRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::RawBatchPutResponse;\\n\\n type KeyData = Vec<KvPair>;\\n\\n const REQUEST_NAME: &'static str = \\\"raw_batch_put\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_batch_put_async_opt;\\n\\n\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 20,\n \"score\": 97471.57530574285\n },\n {\n \"content\": \"pub fn new_raw_get_request(\\n\\n key: impl Into<Key>,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawGetRequest {\\n\\n let mut req = kvrpcpb::RawGetRequest::default();\\n\\n req.set_key(key.into().into());\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawBatchGetRequest {\\n\\n type Result = Vec<KvPair>;\\n\\n type RpcResponse = kvrpcpb::RawBatchGetResponse;\\n\\n type KeyData = Vec<Key>;\\n\\n const REQUEST_NAME: &'static str = \\\"raw_batch_get\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_batch_get_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(&self, keys: Self::KeyData, store: &Store<KvC>) -> Self {\\n\\n let mut req = self.request_from_store(store);\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 21,\n \"score\": 97471.57530574285\n },\n {\n \"content\": \"pub fn new_batch_rollback_request(\\n\\n keys: Vec<Key>,\\n\\n start_version: u64,\\n\\n) -> kvrpcpb::BatchRollbackRequest {\\n\\n let mut req = kvrpcpb::BatchRollbackRequest::default();\\n\\n req.set_keys(keys.into_iter().map(Into::into).collect());\\n\\n req.set_start_version(start_version);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl HasLocks for kvrpcpb::CommitResponse {}\\n\\nimpl HasLocks for kvrpcpb::CleanupResponse {}\\n\\nimpl HasLocks for kvrpcpb::BatchRollbackResponse {}\\n\\nimpl HasLocks for kvrpcpb::ResolveLockResponse {}\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 22,\n \"score\": 97471.57530574285\n },\n {\n \"content\": \"pub fn new_raw_delete_request(\\n\\n key: impl Into<Key>,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawDeleteRequest {\\n\\n let mut req = kvrpcpb::RawDeleteRequest::default();\\n\\n req.set_key(key.into().into());\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawBatchDeleteRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::RawBatchDeleteResponse;\\n\\n type KeyData = Vec<Key>;\\n\\n const REQUEST_NAME: &'static str = \\\"raw_batch_delete\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_batch_delete_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(&self, keys: Self::KeyData, store: &Store<KvC>) -> Self {\\n\\n let mut req = self.request_from_store(store);\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 23,\n \"score\": 97471.57530574285\n },\n {\n \"content\": \"pub fn new_mvcc_scan_request(\\n\\n range: impl Into<BoundRange>,\\n\\n timestamp: Timestamp,\\n\\n limit: u32,\\n\\n key_only: bool,\\n\\n) -> kvrpcpb::ScanRequest {\\n\\n let (start_key, end_key) = range.into().into_keys();\\n\\n let mut req = kvrpcpb::ScanRequest::default();\\n\\n req.set_start_key(start_key.into());\\n\\n req.set_end_key(end_key.unwrap_or_default().into());\\n\\n req.set_limit(limit);\\n\\n req.set_key_only(key_only);\\n\\n req.set_version(timestamp.version());\\n\\n req\\n\\n}\\n\\n\\n\\nimpl HasLocks for kvrpcpb::ScanResponse {\\n\\n fn take_locks(&mut self) -> Vec<kvrpcpb::LockInfo> {\\n\\n self.pairs\\n\\n .iter_mut()\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 24,\n \"score\": 97471.57530574285\n },\n {\n \"content\": \"pub fn new_resolve_lock_request(\\n\\n context: kvrpcpb::Context,\\n\\n start_version: u64,\\n\\n commit_version: u64,\\n\\n) -> kvrpcpb::ResolveLockRequest {\\n\\n let mut req = kvrpcpb::ResolveLockRequest::default();\\n\\n req.set_context(context);\\n\\n req.set_start_version(start_version);\\n\\n req.set_commit_version(commit_version);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\n// TODO: Add lite resolve lock (resolve specified locks only)\\n\\n\\n\\nimpl KvRequest for kvrpcpb::CleanupRequest {\\n\\n /// Commit version if the key is committed, 0 otherwise.\\n\\n type Result = u64;\\n\\n type RpcResponse = kvrpcpb::CleanupResponse;\\n\\n type KeyData = Key;\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 25,\n \"score\": 97471.57530574285\n },\n {\n \"content\": \"pub fn new_raw_batch_scan_request(\\n\\n ranges: impl IntoIterator<Item = impl Into<BoundRange>>,\\n\\n each_limit: u32,\\n\\n key_only: bool,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawBatchScanRequest {\\n\\n let mut req = kvrpcpb::RawBatchScanRequest::default();\\n\\n req.set_ranges(ranges.into_iter().map(Into::into).map(Into::into).collect());\\n\\n req.set_each_limit(each_limit);\\n\\n req.set_key_only(key_only);\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nmacro_rules! impl_raw_rpc_request {\\n\\n ($name: ident) => {\\n\\n impl RawRpcRequest for kvrpcpb::$name {\\n\\n fn set_cf(&mut self, cf: String) {\\n\\n self.set_cf(cf);\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 26,\n \"score\": 95551.57547472473\n },\n {\n \"content\": \"pub fn new_raw_batch_delete_request(\\n\\n keys: impl IntoIterator<Item = impl Into<Key>>,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawBatchDeleteRequest {\\n\\n let mut req = kvrpcpb::RawBatchDeleteRequest::default();\\n\\n req.set_keys(keys.into_iter().map(Into::into).map(Into::into).collect());\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawDeleteRangeRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::RawDeleteRangeResponse;\\n\\n type KeyData = (Key, Key);\\n\\n const REQUEST_NAME: &'static str = \\\"raw_delete_range\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_delete_range_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(\\n\\n &self,\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 27,\n \"score\": 95551.57547472473\n },\n {\n \"content\": \"pub fn new_raw_batch_get_request(\\n\\n keys: impl IntoIterator<Item = impl Into<Key>>,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawBatchGetRequest {\\n\\n let mut req = kvrpcpb::RawBatchGetRequest::default();\\n\\n req.set_keys(keys.into_iter().map(Into::into).map(Into::into).collect());\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawPutRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::RawPutResponse;\\n\\n type KeyData = KvPair;\\n\\n const REQUEST_NAME: &'static str = \\\"raw_put\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_put_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(&self, key: Self::KeyData, store: &Store<KvC>) -> Self {\\n\\n let mut req = self.request_from_store(store);\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 28,\n \"score\": 95551.57547472473\n },\n {\n \"content\": \"pub fn new_raw_batch_put_request(\\n\\n pairs: impl IntoIterator<Item = impl Into<KvPair>>,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawBatchPutRequest {\\n\\n let mut req = kvrpcpb::RawBatchPutRequest::default();\\n\\n req.set_pairs(pairs.into_iter().map(Into::into).map(Into::into).collect());\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawDeleteRequest {\\n\\n type Result = ();\\n\\n type RpcResponse = kvrpcpb::RawDeleteResponse;\\n\\n type KeyData = Key;\\n\\n const REQUEST_NAME: &'static str = \\\"raw_delete\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_delete_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(&self, key: Self::KeyData, store: &Store<KvC>) -> Self {\\n\\n let mut req = self.request_from_store(store);\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 29,\n \"score\": 95551.57547472473\n },\n {\n \"content\": \"pub fn new_raw_delete_range_request(\\n\\n range: impl Into<BoundRange>,\\n\\n cf: Option<ColumnFamily>,\\n\\n) -> kvrpcpb::RawDeleteRangeRequest {\\n\\n let (start_key, end_key) = range.into().into_keys();\\n\\n let mut req = kvrpcpb::RawDeleteRangeRequest::default();\\n\\n req.set_start_key(start_key.into());\\n\\n req.set_end_key(end_key.unwrap_or_default().into());\\n\\n req.maybe_set_cf(cf);\\n\\n\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::RawScanRequest {\\n\\n type Result = Vec<KvPair>;\\n\\n type RpcResponse = kvrpcpb::RawScanResponse;\\n\\n type KeyData = (Key, Key);\\n\\n const REQUEST_NAME: &'static str = \\\"raw_scan\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::raw_scan_async_opt;\\n\\n\\n\",\n \"file_path\": \"src/raw/requests.rs\",\n \"rank\": 30,\n \"score\": 95551.57547472473\n },\n {\n \"content\": \"pub fn new_mvcc_get_batch_request(\\n\\n keys: Vec<Key>,\\n\\n timestamp: Timestamp,\\n\\n) -> kvrpcpb::BatchGetRequest {\\n\\n let mut req = kvrpcpb::BatchGetRequest::default();\\n\\n req.set_keys(keys.into_iter().map(Into::into).collect());\\n\\n req.set_version(timestamp.version());\\n\\n req\\n\\n}\\n\\n\\n\\nimpl KvRequest for kvrpcpb::ScanRequest {\\n\\n type Result = Vec<KvPair>;\\n\\n type RpcResponse = kvrpcpb::ScanResponse;\\n\\n type KeyData = (Key, Key);\\n\\n const REQUEST_NAME: &'static str = \\\"kv_scan\\\";\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse> = TikvClient::kv_scan_async_opt;\\n\\n\\n\\n fn make_rpc_request<KvC: KvClient>(\\n\\n &self,\\n\\n (start_key, end_key): Self::KeyData,\\n\",\n \"file_path\": \"src/transaction/requests.rs\",\n \"rank\": 31,\n \"score\": 95551.57547472473\n },\n {\n \"content\": \"fn allocate_timestamps(\\n\\n resp: &TsoResponse,\\n\\n pending_requests: &mut VecDeque<RequestGroup>,\\n\\n) -> Result<()> {\\n\\n // PD returns the timestamp with the biggest logical value. We can send back timestamps\\n\\n // whose logical value is from `logical - count + 1` to `logical` using the senders\\n\\n // in `pending`.\\n\\n let tail_ts = resp\\n\\n .timestamp\\n\\n .as_ref()\\n\\n .ok_or_else(|| Error::internal_error(\\\"No timestamp in TsoResponse\\\"))?;\\n\\n\\n\\n let mut offset = resp.count;\\n\\n if let Some(RequestGroup {\\n\\n tso_request,\\n\\n requests,\\n\\n }) = pending_requests.pop_front()\\n\\n {\\n\\n if tso_request.count != offset {\\n\\n return Err(Error::internal_error(\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 32,\n \"score\": 94280.08148720067\n },\n {\n \"content\": \"pub fn start_mock_pd_server() -> Server {\\n\\n let env = Arc::new(Environment::new(1));\\n\\n let mut server = ServerBuilder::new(env)\\n\\n .register_service(create_pd(MockPd::new()))\\n\\n .bind(\\\"localhost\\\", MOCK_PD_PORT)\\n\\n .build()\\n\\n .unwrap();\\n\\n server.start();\\n\\n server\\n\\n}\\n\\n\\n\\nimpl Pd for MockPd {\\n\\n fn get_members(\\n\\n &mut self,\\n\\n ctx: ::grpcio::RpcContext,\\n\\n req: GetMembersRequest,\\n\\n sink: ::grpcio::UnarySink<GetMembersResponse>,\\n\\n ) {\\n\\n let member = Member {\\n\\n name: \\\"mock tikv\\\".to_owned(),\\n\",\n \"file_path\": \"mock-tikv/src/pd.rs\",\n \"rank\": 33,\n \"score\": 90902.7359119496\n },\n {\n \"content\": \"pub fn start_mock_tikv_server() -> Server {\\n\\n let env = Arc::new(Environment::new(1));\\n\\n let mut server = ServerBuilder::new(env)\\n\\n .register_service(create_tikv(MockTikv::new(KvStore::new())))\\n\\n .bind(\\\"localhost\\\", MOCK_TIKV_PORT)\\n\\n .build()\\n\\n .unwrap();\\n\\n server.start();\\n\\n server\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, new)]\\n\\npub struct MockTikv {\\n\\n inner: KvStore,\\n\\n}\\n\\n\\n\\nimpl Tikv for MockTikv {\\n\\n fn kv_get(\\n\\n &mut self,\\n\\n _ctx: grpcio::RpcContext,\\n\",\n \"file_path\": \"mock-tikv/src/server.rs\",\n \"rank\": 34,\n \"score\": 90902.7359119496\n },\n {\n \"content\": \"struct HexRepr<'a>(pub &'a [u8]);\\n\\n\\n\\nimpl<'a> fmt::Display for HexRepr<'a> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n for byte in self.0 {\\n\\n write!(f, \\\"{:02X}\\\", byte)?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-common/src/kv/mod.rs\",\n \"rank\": 35,\n \"score\": 90602.0883311353\n },\n {\n \"content\": \"struct RequestGroup {\\n\\n tso_request: TsoRequest,\\n\\n requests: Vec<TimestampRequest>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 36,\n \"score\": 90322.98639560648\n },\n {\n \"content\": \"fn region_from_response(\\n\\n resp: pdpb::GetRegionResponse,\\n\\n err: impl FnOnce() -> Error,\\n\\n) -> Result<Region> {\\n\\n let region = resp.region.ok_or_else(err)?;\\n\\n Ok(Region::new(region, resp.leader))\\n\\n}\\n\\n\\n\\n// A node-like thing that can be connected to.\\n\",\n \"file_path\": \"src/pd/retry.rs\",\n \"rank\": 37,\n \"score\": 89316.14073356931\n },\n {\n \"content\": \"pub trait TimestampExt {\\n\\n fn version(&self) -> u64;\\n\\n fn from_version(version: u64) -> Self;\\n\\n}\\n\\n\\n\\nimpl TimestampExt for Timestamp {\\n\\n fn version(&self) -> u64 {\\n\\n ((self.physical << PHYSICAL_SHIFT_BITS) + self.logical)\\n\\n .try_into()\\n\\n .expect(\\\"Overflow converting timestamp to version\\\")\\n\\n }\\n\\n\\n\\n fn from_version(version: u64) -> Self {\\n\\n let version = version as i64;\\n\\n Self {\\n\\n physical: version >> PHYSICAL_SHIFT_BITS,\\n\\n logical: version & LOGICAL_MASK,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-common/src/timestamp.rs\",\n \"rank\": 38,\n \"score\": 88786.24944477205\n },\n {\n \"content\": \"#[inline]\\n\\npub fn duration_to_sec(d: Duration) -> f64 {\\n\\n let nanos = f64::from(d.subsec_nanos());\\n\\n // In most cases, we can't have so large Duration, so here just panic if overflow now.\\n\\n d.as_secs() as f64 + (nanos / 1_000_000_000.0)\\n\\n}\\n\",\n \"file_path\": \"tikv-client-common/src/util.rs\",\n \"rank\": 39,\n \"score\": 86380.16820263525\n },\n {\n \"content\": \"struct TsoRequestStream<'a> {\\n\\n cluster_id: u64,\\n\\n request_rx: Pin<&'a mut mpsc::Receiver<oneshot::Sender<Timestamp>>>,\\n\\n pending_requests: Rc<RefCell<VecDeque<RequestGroup>>>,\\n\\n self_waker: Rc<AtomicWaker>,\\n\\n}\\n\\n\\n\\nimpl<'a> Stream for TsoRequestStream<'a> {\\n\\n type Item = (TsoRequest, WriteFlags);\\n\\n\\n\\n fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {\\n\\n let pending_requests = self.pending_requests.clone();\\n\\n let mut pending_requests = pending_requests.borrow_mut();\\n\\n let mut requests = Vec::new();\\n\\n\\n\\n while requests.len() < MAX_BATCH_SIZE && pending_requests.len() < MAX_PENDING_COUNT {\\n\\n match self.request_rx.as_mut().poll_next(cx) {\\n\\n Poll::Ready(Some(sender)) => {\\n\\n requests.push(sender);\\n\\n }\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 40,\n \"score\": 86026.98876324628\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn observe_tso_batch(batch_size: usize) {\\n\\n PD_TSO_BATCH_SIZE_HISTOGRAM.observe(batch_size as f64);\\n\\n}\\n\\n\\n\\nlazy_static! {\\n\\n static ref TIKV_REQUEST_DURATION_HISTOGRAM_VEC: HistogramVec = register_histogram_vec!(\\n\\n \\\"tikv_request_duration_seconds\\\",\\n\\n \\\"Bucketed histogram of TiKV requests duration\\\",\\n\\n &[\\\"type\\\"]\\n\\n )\\n\\n .unwrap();\\n\\n static ref TIKV_REQUEST_COUNTER_VEC: IntCounterVec = register_int_counter_vec!(\\n\\n \\\"tikv_request_total\\\",\\n\\n \\\"Total number of requests sent to TiKV\\\",\\n\\n &[\\\"type\\\"]\\n\\n )\\n\\n .unwrap();\\n\\n static ref TIKV_FAILED_REQUEST_DURATION_HISTOGRAM_VEC: HistogramVec = register_histogram_vec!(\\n\\n \\\"tikv_failed_request_duration_seconds\\\",\\n\\n \\\"Bucketed histogram of failed TiKV requests duration\\\",\\n\",\n \"file_path\": \"tikv-client-common/src/stats.rs\",\n \"rank\": 41,\n \"score\": 85176.4086178349\n },\n {\n \"content\": \"/// A trait for connecting to TiKV stores.\\n\\npub trait KvConnect: Sized + Send + Sync + 'static {\\n\\n type KvClient: KvClient + Clone + Send + Sync + 'static;\\n\\n\\n\\n fn connect(&self, address: &str) -> Result<Self::KvClient>;\\n\\n}\\n\\n\\n\\npub type RpcFnType<Req, Resp> =\\n\\n for<'a, 'b> fn(\\n\\n &'a TikvClient,\\n\\n &'b Req,\\n\\n CallOption,\\n\\n )\\n\\n -> std::result::Result<::grpcio::ClientUnaryReceiver<Resp>, ::grpcio::Error>;\\n\\n\\n\\n#[derive(new, Clone)]\\n\\npub struct TikvConnect {\\n\\n env: Arc<Environment>,\\n\\n security_mgr: Arc<SecurityManager>,\\n\\n}\\n\\n\\n\\nimpl KvConnect for TikvConnect {\\n\\n type KvClient = KvRpcClient;\\n\\n\\n\\n fn connect(&self, address: &str) -> Result<KvRpcClient> {\\n\\n self.security_mgr\\n\\n .connect(self.env.clone(), address, TikvClient::new)\\n\\n .map(|c| KvRpcClient::new(Arc::new(c)))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-store/src/lib.rs\",\n \"rank\": 42,\n \"score\": 85131.43852800652\n },\n {\n \"content\": \"pub fn parse_args(app_name: &str) -> CommandArgs {\\n\\n let matches = App::new(app_name)\\n\\n .version(crate_version!())\\n\\n .author(\\\"The TiKV Project Authors\\\")\\n\\n .arg(\\n\\n Arg::with_name(\\\"pd\\\")\\n\\n .long(\\\"pd\\\")\\n\\n .aliases(&[\\\"pd-endpoint\\\", \\\"pd-endpoints\\\"])\\n\\n .value_name(\\\"PD_URL\\\")\\n\\n .help(\\\"Sets PD endpoints\\\")\\n\\n .long_help(\\\"Sets PD endpoints. Uses `,` to separate multiple PDs\\\")\\n\\n .takes_value(true)\\n\\n .multiple(true)\\n\\n .value_delimiter(\\\",\\\")\\n\\n .required(true),\\n\\n )\\n\\n // A cyclic dependency between CA, cert and key is made\\n\\n // to ensure that no security options are missing.\\n\\n .arg(\\n\\n Arg::with_name(\\\"ca\\\")\\n\",\n \"file_path\": \"examples/common/mod.rs\",\n \"rank\": 43,\n \"score\": 84682.22115557893\n },\n {\n \"content\": \"fn check_pem_file(tag: &str, path: &Path) -> Result<File> {\\n\\n File::open(path)\\n\\n .map_err(|e| internal_err!(\\\"failed to open {} to load {}: {:?}\\\", path.display(), tag, e))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-common/src/security.rs\",\n \"rank\": 44,\n \"score\": 81781.14182236612\n },\n {\n \"content\": \"pub fn pd_stats(cmd: &'static str) -> RequestStats {\\n\\n RequestStats::new(\\n\\n cmd,\\n\\n &PD_REQUEST_DURATION_HISTOGRAM_VEC,\\n\\n &PD_REQUEST_COUNTER_VEC,\\n\\n &PD_FAILED_REQUEST_DURATION_HISTOGRAM_VEC,\\n\\n &PD_FAILED_REQUEST_COUNTER_VEC,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-common/src/stats.rs\",\n \"rank\": 45,\n \"score\": 79741.78107838113\n },\n {\n \"content\": \"pub fn tikv_stats(cmd: &'static str) -> RequestStats {\\n\\n RequestStats::new(\\n\\n cmd,\\n\\n &TIKV_REQUEST_DURATION_HISTOGRAM_VEC,\\n\\n &TIKV_REQUEST_COUNTER_VEC,\\n\\n &TIKV_FAILED_REQUEST_DURATION_HISTOGRAM_VEC,\\n\\n &TIKV_FAILED_REQUEST_COUNTER_VEC,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-common/src/stats.rs\",\n \"rank\": 46,\n \"score\": 79741.78107838113\n },\n {\n \"content\": \"fn load_pem_file(tag: &str, path: &Path) -> Result<Vec<u8>> {\\n\\n let mut file = check_pem_file(tag, path)?;\\n\\n let mut key = vec![];\\n\\n file.read_to_end(&mut key)\\n\\n .map_err(|e| {\\n\\n internal_err!(\\n\\n \\\"failed to load {} from path {}: {:?}\\\",\\n\\n tag,\\n\\n path.display(),\\n\\n e\\n\\n )\\n\\n })\\n\\n .map(|_| key)\\n\\n}\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct SecurityManager {\\n\\n ca: Vec<u8>,\\n\\n cert: Vec<u8>,\\n\\n key: PathBuf,\\n\",\n \"file_path\": \"tikv-client-common/src/security.rs\",\n \"rank\": 47,\n \"score\": 78727.69657090389\n },\n {\n \"content\": \"use derive_new::new;\\n\\nuse kvproto::{kvrpcpb, metapb};\\n\\nuse tikv_client_common::{Error, Key, Result};\\n\\n\\n\\npub type RegionId = u64;\\n\\npub type StoreId = u64;\\n\\n\\n\\n#[derive(Eq, PartialEq, Hash, Clone, Default, Debug)]\\n\\npub struct RegionVerId {\\n\\n pub id: RegionId,\\n\\n pub conf_ver: u64,\\n\\n pub ver: u64,\\n\\n}\\n\\n\\n\\n#[derive(new, Clone, Default, Debug, PartialEq)]\\n\\npub struct Region {\\n\\n pub region: metapb::Region,\\n\\n pub leader: Option<metapb::Peer>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-store/src/region.rs\",\n \"rank\": 48,\n \"score\": 68925.14310325815\n },\n {\n \"content\": \"impl Region {\\n\\n #[allow(dead_code)]\\n\\n pub fn switch_peer(&mut self, _to: StoreId) -> Result<()> {\\n\\n unimplemented!()\\n\\n }\\n\\n\\n\\n pub fn contains(&self, key: &Key) -> bool {\\n\\n let key: &[u8] = key.into();\\n\\n let start_key = self.region.get_start_key();\\n\\n let end_key = self.region.get_end_key();\\n\\n key >= start_key && (key < end_key || end_key.is_empty())\\n\\n }\\n\\n\\n\\n pub fn context(&self) -> Result<kvrpcpb::Context> {\\n\\n self.leader\\n\\n .as_ref()\\n\\n .ok_or_else(|| Error::leader_not_found(self.region.get_id()))\\n\\n .map(|l| {\\n\\n let mut ctx = kvrpcpb::Context::default();\\n\\n ctx.set_region_id(self.region.get_id());\\n\",\n \"file_path\": \"tikv-client-store/src/region.rs\",\n \"rank\": 49,\n \"score\": 68915.23865356245\n },\n {\n \"content\": \" let region = &self.region;\\n\\n let epoch = region.get_region_epoch();\\n\\n RegionVerId {\\n\\n id: region.get_id(),\\n\\n conf_ver: epoch.get_conf_ver(),\\n\\n ver: epoch.get_version(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn id(&self) -> RegionId {\\n\\n self.region.get_id()\\n\\n }\\n\\n\\n\\n pub fn get_store_id(&self) -> Result<StoreId> {\\n\\n self.leader\\n\\n .as_ref()\\n\\n .cloned()\\n\\n .ok_or_else(|| Error::leader_not_found(self.id()))\\n\\n .map(|s| s.get_store_id())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-store/src/region.rs\",\n \"rank\": 50,\n \"score\": 68906.37553538021\n },\n {\n \"content\": \" ctx.set_region_epoch(Clone::clone(self.region.get_region_epoch()));\\n\\n ctx.set_peer(Clone::clone(l));\\n\\n ctx\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn start_key(&self) -> Key {\\n\\n self.region.get_start_key().to_vec().into()\\n\\n }\\n\\n\\n\\n pub fn end_key(&self) -> Key {\\n\\n self.region.get_end_key().to_vec().into()\\n\\n }\\n\\n\\n\\n pub fn range(&self) -> (Key, Key) {\\n\\n (self.start_key(), self.end_key())\\n\\n }\\n\\n\\n\\n #[allow(dead_code)]\\n\\n pub fn ver_id(&self) -> RegionVerId {\\n\",\n \"file_path\": \"tikv-client-store/src/region.rs\",\n \"rank\": 51,\n \"score\": 68902.38752767966\n },\n {\n \"content\": \"macro_rules! has_key_error {\\n\\n ($type:ty) => {\\n\\n impl HasError for $type {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n if self.has_error() {\\n\\n Some(self.take_error().into())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nhas_key_error!(kvrpcpb::GetResponse);\\n\\nhas_key_error!(kvrpcpb::CommitResponse);\\n\\nhas_key_error!(kvrpcpb::BatchRollbackResponse);\\n\\nhas_key_error!(kvrpcpb::CleanupResponse);\\n\\nhas_key_error!(kvrpcpb::ScanLockResponse);\\n\\nhas_key_error!(kvrpcpb::ResolveLockResponse);\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 52,\n \"score\": 68729.74380596535\n },\n {\n \"content\": \"has_region_error!(kvrpcpb::PrewriteResponse);\\n\\nhas_region_error!(kvrpcpb::CommitResponse);\\n\\nhas_region_error!(kvrpcpb::ImportResponse);\\n\\nhas_region_error!(kvrpcpb::BatchRollbackResponse);\\n\\nhas_region_error!(kvrpcpb::CleanupResponse);\\n\\nhas_region_error!(kvrpcpb::BatchGetResponse);\\n\\nhas_region_error!(kvrpcpb::ScanLockResponse);\\n\\nhas_region_error!(kvrpcpb::ResolveLockResponse);\\n\\nhas_region_error!(kvrpcpb::GcResponse);\\n\\nhas_region_error!(kvrpcpb::RawGetResponse);\\n\\nhas_region_error!(kvrpcpb::RawBatchGetResponse);\\n\\nhas_region_error!(kvrpcpb::RawPutResponse);\\n\\nhas_region_error!(kvrpcpb::RawBatchPutResponse);\\n\\nhas_region_error!(kvrpcpb::RawDeleteResponse);\\n\\nhas_region_error!(kvrpcpb::RawBatchDeleteResponse);\\n\\nhas_region_error!(kvrpcpb::DeleteRangeResponse);\\n\\nhas_region_error!(kvrpcpb::RawDeleteRangeResponse);\\n\\nhas_region_error!(kvrpcpb::RawScanResponse);\\n\\nhas_region_error!(kvrpcpb::RawBatchScanResponse);\\n\\n\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 53,\n \"score\": 68727.87369215695\n },\n {\n \"content\": \"has_key_error!(kvrpcpb::GcResponse);\\n\\n\\n\\nmacro_rules! has_str_error {\\n\\n ($type:ty) => {\\n\\n impl HasError for $type {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n if self.get_error().is_empty() {\\n\\n None\\n\\n } else {\\n\\n Some(Error::kv_error(self.take_error()))\\n\\n }\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nhas_str_error!(kvrpcpb::RawGetResponse);\\n\\nhas_str_error!(kvrpcpb::RawPutResponse);\\n\\nhas_str_error!(kvrpcpb::RawBatchPutResponse);\\n\\nhas_str_error!(kvrpcpb::RawDeleteResponse);\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 54,\n \"score\": 68727.52064475758\n },\n {\n \"content\": \"has_str_error!(kvrpcpb::RawBatchDeleteResponse);\\n\\nhas_str_error!(kvrpcpb::RawDeleteRangeResponse);\\n\\nhas_str_error!(kvrpcpb::ImportResponse);\\n\\nhas_str_error!(kvrpcpb::DeleteRangeResponse);\\n\\n\\n\\nimpl HasError for kvrpcpb::ScanResponse {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n extract_errors(self.pairs.iter_mut().map(|pair| pair.error.take()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl HasError for kvrpcpb::BatchGetResponse {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n extract_errors(self.pairs.iter_mut().map(|pair| pair.error.take()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl HasError for kvrpcpb::RawBatchGetResponse {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n extract_errors(self.pairs.iter_mut().map(|pair| pair.error.take()))\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 55,\n \"score\": 68725.90623259556\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl HasError for kvrpcpb::RawScanResponse {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n extract_errors(self.kvs.iter_mut().map(|pair| pair.error.take()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl HasError for kvrpcpb::RawBatchScanResponse {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n extract_errors(self.kvs.iter_mut().map(|pair| pair.error.take()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl HasError for kvrpcpb::PrewriteResponse {\\n\\n fn error(&mut self) -> Option<Error> {\\n\\n extract_errors(self.take_errors().into_iter().map(Some))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 56,\n \"score\": 68725.8060185347\n },\n {\n \"content\": \"// Copyright 2019 TiKV Project Authors. Licensed under Apache-2.0.\\n\\n\\n\\nuse kvproto::kvrpcpb;\\n\\nuse tikv_client_common::Error;\\n\\n\\n\",\n \"file_path\": \"tikv-client-store/src/errors.rs\",\n \"rank\": 57,\n \"score\": 68724.27503032933\n },\n {\n \"content\": \"type TimestampRequest = oneshot::Sender<Timestamp>;\\n\\n\\n\\n/// The timestamp oracle (TSO) which provides monotonically increasing timestamps.\\n\\n#[derive(Clone)]\\n\\npub(crate) struct TimestampOracle {\\n\\n /// The transmitter of a bounded channel which transports requests of getting a single\\n\\n /// timestamp to the TSO working thread. A bounded channel is used to prevent using\\n\\n /// too much memory unexpectedly.\\n\\n /// In the working thread, the `TimestampRequest`, which is actually a one channel sender,\\n\\n /// is used to send back the timestamp result.\\n\\n request_tx: mpsc::Sender<TimestampRequest>,\\n\\n}\\n\\n\\n\\nimpl TimestampOracle {\\n\\n pub(crate) fn new(cluster_id: u64, pd_client: &PdClient) -> Result<TimestampOracle> {\\n\\n let (request_tx, request_rx) = mpsc::channel(MAX_BATCH_SIZE);\\n\\n // FIXME: use tso_opt\\n\\n let (rpc_sender, rpc_receiver) = pd_client.tso()?;\\n\\n\\n\\n // Start a background thread to handle TSO requests and responses\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 58,\n \"score\": 64617.97704410757\n },\n {\n \"content\": \"#[derive(new)]\\n\\nstruct TwoPhaseCommitter {\\n\\n mutations: Vec<kvrpcpb::Mutation>,\\n\\n start_version: u64,\\n\\n bg_worker: ThreadPool,\\n\\n rpc: Arc<PdRpcClient>,\\n\\n #[new(default)]\\n\\n committed: bool,\\n\\n #[new(default)]\\n\\n undetermined: bool,\\n\\n}\\n\\n\\n\\nimpl TwoPhaseCommitter {\\n\\n async fn commit(mut self) -> Result<()> {\\n\\n if self.mutations.is_empty() {\\n\\n self.committed = true;\\n\\n return Ok(());\\n\\n }\\n\\n self.prewrite().await?;\\n\\n match self.commit_primary().await {\\n\\n Ok(commit_version) => {\\n\",\n \"file_path\": \"src/transaction/transaction.rs\",\n \"rank\": 59,\n \"score\": 59239.78138709422\n },\n {\n \"content\": \"pub trait HasLocks {\\n\\n fn take_locks(&mut self) -> Vec<kvrpcpb::LockInfo> {\\n\\n Vec::new()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::mock::MockPdClient;\\n\\n\\n\\n use futures::executor;\\n\\n\\n\\n #[test]\\n\\n fn test_resolve_lock_with_retry() {\\n\\n // Test resolve lock within retry limit\\n\\n fail::cfg(\\\"region-error\\\", \\\"9*return\\\").unwrap();\\n\\n let client = Arc::new(MockPdClient);\\n\\n let key: Key = vec![1].into();\\n\\n let region1 = MockPdClient::region1();\\n\",\n \"file_path\": \"src/transaction/lock.rs\",\n \"rank\": 60,\n \"score\": 51114.87470686478\n },\n {\n \"content\": \"/// Permits easy mocking of rpc calls.\\n\\npub trait DispatchHook: KvRequest {\\n\\n fn dispatch_hook(\\n\\n &self,\\n\\n _opt: CallOption,\\n\\n ) -> Option<BoxFuture<'static, Result<Self::RpcResponse>>> {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: KvRequest> DispatchHook for T {\\n\\n #[cfg(test)]\\n\\n default fn dispatch_hook(\\n\\n &self,\\n\\n _opt: CallOption,\\n\\n ) -> Option<BoxFuture<'static, Result<Self::RpcResponse>>> {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 61,\n \"score\": 47497.25452811817\n },\n {\n \"content\": \"pub trait KvRpcRequest: Default {\\n\\n fn set_context(&mut self, context: kvrpcpb::Context);\\n\\n}\\n\\n\\n\\nmacro_rules! impl_kv_rpc_request {\\n\\n ($name: ident) => {\\n\\n impl KvRpcRequest for kvrpcpb::$name {\\n\\n fn set_context(&mut self, context: kvrpcpb::Context) {\\n\\n self.set_context(context);\\n\\n }\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\\nimpl_kv_rpc_request!(RawGetRequest);\\n\\nimpl_kv_rpc_request!(RawBatchGetRequest);\\n\\nimpl_kv_rpc_request!(RawPutRequest);\\n\\nimpl_kv_rpc_request!(RawBatchPutRequest);\\n\\nimpl_kv_rpc_request!(RawDeleteRequest);\\n\\nimpl_kv_rpc_request!(RawBatchDeleteRequest);\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 62,\n \"score\": 47497.25452811817\n },\n {\n \"content\": \"/// An extension crate to make using our combinator functions more ergonomic.\\n\\npub trait ClientFutureExt {\\n\\n /// This function is similar to `map_ok` combinator. Provide a function which\\n\\n /// is applied after the `self` future is resolved, only if that future\\n\\n /// resolves to `Ok`. Similar to `Result::and_then`, the supplied function\\n\\n /// must return a Result (c.f., `map_ok`, which returns the underlying type,\\n\\n /// `T`).\\n\\n ///\\n\\n /// Note that unlike `and_then`, the supplied function returns a resolved\\n\\n /// value, not a closure.\\n\\n fn ok_and_then<U, T, F, E>(self, func: F) -> OkAndThen<Self, F>\\n\\n where\\n\\n F: FnMut(U) -> Result<T, E>,\\n\\n Self: Future<Output = Result<U, E>> + Sized,\\n\\n {\\n\\n OkAndThen { future: self, func }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: TryFuture> ClientFutureExt for T {}\\n\",\n \"file_path\": \"tikv-client-common/src/compat.rs\",\n \"rank\": 63,\n \"score\": 46879.25444292762\n },\n {\n \"content\": \"/// A convenience trait for converting ranges of borrowed types into a `BoundRange`.\\n\\npub trait ToOwnedRange {\\n\\n /// Transform a borrowed range of some form into an owned `BoundRange`.\\n\\n fn to_owned(self) -> BoundRange;\\n\\n}\\n\\n\\n\\nimpl<T: Into<Key> + Borrow<U>, U: ToOwned<Owned = T> + ?Sized> ToOwnedRange for Range<&U> {\\n\\n fn to_owned(self) -> BoundRange {\\n\\n From::from(Range {\\n\\n start: self.start.to_owned(),\\n\\n end: self.end.to_owned(),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Into<Key> + Borrow<U>, U: ToOwned<Owned = T> + ?Sized> ToOwnedRange for RangeFrom<&U> {\\n\\n fn to_owned(self) -> BoundRange {\\n\\n From::from(RangeFrom {\\n\\n start: self.start.to_owned(),\\n\\n })\\n\\n }\\n\",\n \"file_path\": \"tikv-client-common/src/kv/bound_range.rs\",\n \"rank\": 64,\n \"score\": 45970.808582868696\n },\n {\n \"content\": \"pub trait Backoff: Clone + Send + 'static {\\n\\n // Returns the delay period for next retry. If the maximum retry count is hit returns None.\\n\\n fn next_delay_duration(&mut self) -> Option<Duration>;\\n\\n}\\n\\n\\n\\n// Exponential backoff means that the retry delay should multiply a constant\\n\\n// after each attempt, up to a maximum value. After each attempt, the new retry\\n\\n// delay should be:\\n\\n//\\n\\n// new_delay = min(max_delay, base_delay * 2 ** attempts)\\n\\n#[derive(Clone)]\\n\\npub struct NoJitterBackoff {\\n\\n current_attempts: u32,\\n\\n max_attempts: u32,\\n\\n current_delay_ms: u64,\\n\\n max_delay_ms: u64,\\n\\n}\\n\\n\\n\\nimpl NoJitterBackoff {\\n\\n pub const fn new(base_delay_ms: u64, max_delay_ms: u64, max_attempts: u32) -> Self {\\n\",\n \"file_path\": \"src/backoff.rs\",\n \"rank\": 65,\n \"score\": 45343.79078038966\n },\n {\n \"content\": \"pub trait PdClient: Send + Sync + 'static {\\n\\n type KvClient: KvClient + Send + Sync + 'static;\\n\\n\\n\\n fn map_region_to_store(\\n\\n self: Arc<Self>,\\n\\n region: Region,\\n\\n ) -> BoxFuture<'static, Result<Store<Self::KvClient>>>;\\n\\n\\n\\n fn region_for_key(&self, key: &Key) -> BoxFuture<'static, Result<Region>>;\\n\\n\\n\\n fn region_for_id(&self, id: RegionId) -> BoxFuture<'static, Result<Region>>;\\n\\n\\n\\n fn get_timestamp(self: Arc<Self>) -> BoxFuture<'static, Result<Timestamp>>;\\n\\n\\n\\n fn store_for_key(\\n\\n self: Arc<Self>,\\n\\n key: &Key,\\n\\n ) -> BoxFuture<'static, Result<Store<Self::KvClient>>> {\\n\\n self.region_for_key(key)\\n\\n .and_then(move |region| self.map_region_to_store(region))\\n\",\n \"file_path\": \"src/pd/client.rs\",\n \"rank\": 66,\n \"score\": 43363.145863591104\n },\n {\n \"content\": \"use crate::Region;\\n\\nuse std::time::Duration;\\n\\n\\n\\npub struct StoreBuilder {\\n\\n pub region: Region,\\n\\n pub address: String,\\n\\n pub timeout: Duration,\\n\\n}\\n\\n\\n\\nimpl StoreBuilder {\\n\\n pub fn new(region: Region, address: String, timeout: Duration) -> StoreBuilder {\\n\\n StoreBuilder {\\n\\n region,\\n\\n address,\\n\\n timeout,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-store/src/store_builder.rs\",\n \"rank\": 67,\n \"score\": 42534.182666794455\n },\n {\n \"content\": \"pub trait KvRequest: Sync + Send + 'static + Sized {\\n\\n type Result;\\n\\n type RpcResponse: HasError + HasLocks + Clone + Send + 'static;\\n\\n /// A single `KvRequest` can be divided into a number of RPC requests because the keys span\\n\\n /// several regions or a single RPC request is too large. Most of the fields in these requests\\n\\n /// share the same content while `KeyData`, which contains keys (and associated data if any),\\n\\n /// is the part which differs among the requests.\\n\\n type KeyData;\\n\\n const REQUEST_NAME: &'static str;\\n\\n const RPC_FN: RpcFnType<Self, Self::RpcResponse>;\\n\\n\\n\\n fn execute(self, pd_client: Arc<impl PdClient>) -> BoxFuture<'static, Result<Self::Result>> {\\n\\n Self::reduce(\\n\\n self.response_stream(pd_client)\\n\\n .and_then(|mut response| match response.error() {\\n\\n Some(e) => future::err(e),\\n\\n None => future::ok(response),\\n\\n })\\n\\n .map_ok(Self::map_result)\\n\\n .boxed(),\\n\",\n \"file_path\": \"src/request.rs\",\n \"rank\": 68,\n \"score\": 42493.18326849167\n },\n {\n \"content\": \"// Copyright 2020 TiKV Project Authors. Licensed under Apache-2.0.\\n\\n\\n\\nuse kvproto::kvrpcpb::KvPair;\\n\\nuse std::{\\n\\n collections::HashMap,\\n\\n sync::{Arc, RwLock},\\n\\n};\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct KvStore {\\n\\n data: Arc<RwLock<HashMap<Vec<u8>, Vec<u8>>>>,\\n\\n}\\n\\n\\n\\nimpl Default for KvStore {\\n\\n fn default() -> Self {\\n\\n Self::new()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl KvStore {\\n\",\n \"file_path\": \"mock-tikv/src/store.rs\",\n \"rank\": 69,\n \"score\": 35570.94635045846\n },\n {\n \"content\": \" pub fn new() -> KvStore {\\n\\n KvStore {\\n\\n data: Arc::new(RwLock::new(HashMap::new())),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn raw_get(&self, key: &[u8]) -> Option<Vec<u8>> {\\n\\n let data = self.data.read().unwrap();\\n\\n data.get(key).map(|v| v.to_vec())\\n\\n }\\n\\n\\n\\n pub fn raw_batch_get(&self, keys: Vec<Vec<u8>>) -> Vec<KvPair> {\\n\\n let data = self.data.read().unwrap();\\n\\n keys.into_iter()\\n\\n .filter_map(|key| {\\n\\n if data.contains_key(&key) {\\n\\n let mut pair = KvPair::default();\\n\\n pair.set_value(data.get(&key).unwrap().to_vec());\\n\\n pair.set_key(key);\\n\\n Some(pair)\\n\",\n \"file_path\": \"mock-tikv/src/store.rs\",\n \"rank\": 70,\n \"score\": 35562.906283851924\n },\n {\n \"content\": \"\\n\\n pub fn raw_delete(&self, key: &[u8]) {\\n\\n let mut data = self.data.write().unwrap();\\n\\n data.remove(key);\\n\\n }\\n\\n\\n\\n pub fn raw_batch_delete(&self, keys: Vec<Vec<u8>>) {\\n\\n let mut data = self.data.write().unwrap();\\n\\n keys.iter().for_each(|k| {\\n\\n data.remove(k);\\n\\n });\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"mock-tikv/src/store.rs\",\n \"rank\": 71,\n \"score\": 35560.06255857689\n },\n {\n \"content\": \" } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .collect()\\n\\n }\\n\\n\\n\\n pub fn raw_put(&self, key: Vec<u8>, value: Vec<u8>) {\\n\\n let mut data = self.data.write().unwrap();\\n\\n data.insert(key, value);\\n\\n }\\n\\n\\n\\n pub fn raw_batch_put(&self, pairs: Vec<KvPair>) {\\n\\n let mut data = self.data.write().unwrap();\\n\\n data.extend(\\n\\n pairs\\n\\n .into_iter()\\n\\n .map(|mut pair| (pair.take_key(), pair.take_value())),\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"mock-tikv/src/store.rs\",\n \"rank\": 72,\n \"score\": 35558.89555866763\n },\n {\n \"content\": \" /// ```rust\\n\\n /// # use tikv_client_common::Config;\\n\\n /// let config = Config::new(vec![\\\"192.168.0.100:2379\\\", \\\"192.168.0.101:2379\\\"])\\n\\n /// .with_security(\\\"root.ca\\\", \\\"internal.cert\\\", \\\"internal.key\\\");\\n\\n /// ```\\n\\n pub fn with_security(\\n\\n mut self,\\n\\n ca_path: impl Into<PathBuf>,\\n\\n cert_path: impl Into<PathBuf>,\\n\\n key_path: impl Into<PathBuf>,\\n\\n ) -> Self {\\n\\n self.ca_path = Some(ca_path.into());\\n\\n self.cert_path = Some(cert_path.into());\\n\\n self.key_path = Some(key_path.into());\\n\\n self\\n\\n }\\n\\n\\n\\n pub fn timeout(mut self, timeout: Duration) -> Self {\\n\\n self.timeout = timeout;\\n\\n self\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-common/src/config.rs\",\n \"rank\": 73,\n \"score\": 34672.651249354894\n },\n {\n \"content\": \" /// ```rust\\n\\n /// # use tikv_client_common::Config;\\n\\n /// let config = Config::new(vec![\\\"192.168.0.100:2379\\\", \\\"192.168.0.101:2379\\\"]);\\n\\n /// ```\\n\\n pub fn new(pd_endpoints: impl IntoIterator<Item = impl Into<String>>) -> Self {\\n\\n Config {\\n\\n pd_endpoints: pd_endpoints.into_iter().map(Into::into).collect(),\\n\\n ca_path: None,\\n\\n cert_path: None,\\n\\n key_path: None,\\n\\n timeout: DEFAULT_REQUEST_TIMEOUT,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Set the certificate authority, certificate, and key locations for the\\n\\n /// [`Config`](Config).\\n\\n ///\\n\\n /// By default, TiKV connections do not utilize transport layer security. Enable it by setting\\n\\n /// these values.\\n\\n ///\\n\",\n \"file_path\": \"tikv-client-common/src/config.rs\",\n \"rank\": 74,\n \"score\": 34672.353015558365\n },\n {\n \"content\": \"/// TiKV does not currently offer encrypted storage (or encryption-at-rest).\\n\\n#[derive(Clone, Debug, Default, Serialize, Deserialize, PartialEq)]\\n\\n#[serde(default)]\\n\\n#[serde(rename_all = \\\"kebab-case\\\")]\\n\\npub struct Config {\\n\\n pub pd_endpoints: Vec<String>,\\n\\n pub ca_path: Option<PathBuf>,\\n\\n pub cert_path: Option<PathBuf>,\\n\\n pub key_path: Option<PathBuf>,\\n\\n pub timeout: Duration,\\n\\n}\\n\\n\\n\\nconst DEFAULT_REQUEST_TIMEOUT: Duration = Duration::from_secs(2);\\n\\n\\n\\nimpl Config {\\n\\n /// Create a new [`Config`](Config) which coordinates with the given PD endpoints.\\n\\n ///\\n\\n /// It's important to **include more than one PD endpoint** (include all, if possible!)\\n\\n /// This helps avoid having a *single point of failure*.\\n\\n ///\\n\",\n \"file_path\": \"tikv-client-common/src/config.rs\",\n \"rank\": 75,\n \"score\": 34670.542461642624\n },\n {\n \"content\": \"// Copyright 2019 TiKV Project Authors. Licensed under Apache-2.0.\\n\\n\\n\\nuse serde_derive::{Deserialize, Serialize};\\n\\nuse std::{path::PathBuf, time::Duration};\\n\\n\\n\\n/// The configuration for either a `raw::Client` or a `transaction::Client`.\\n\\n///\\n\\n/// Because TiKV is managed by a [PD](https://github.com/pingcap/pd/) cluster, the endpoints for PD\\n\\n/// must be provided, **not** the TiKV nodes.\\n\\n///\\n\\n/// It's important to **include more than one PD endpoint** (include all, if possible!)\\n\\n/// This helps avoid having a *single point of failure*.\\n\\n///\\n\\n/// By default, this client will use an insecure connection over instead of one protected by\\n\\n/// Transport Layer Security (TLS). Your deployment may have chosen to rely on security measures\\n\\n/// such as a private network, or a VPN layer to provid secure transmission.\\n\\n///\\n\\n/// To use a TLS secured connection, use the `with_security` function to set the required\\n\\n/// parameters.\\n\\n///\\n\",\n \"file_path\": \"tikv-client-common/src/config.rs\",\n \"rank\": 76,\n \"score\": 34655.29126296659\n },\n {\n \"content\": \" thread::spawn(move || {\\n\\n block_on(run_tso(\\n\\n cluster_id,\\n\\n rpc_sender.sink_err_into(),\\n\\n rpc_receiver.err_into(),\\n\\n request_rx,\\n\\n ))\\n\\n });\\n\\n\\n\\n Ok(TimestampOracle { request_tx })\\n\\n }\\n\\n\\n\\n pub(crate) async fn get_timestamp(mut self) -> Result<Timestamp> {\\n\\n let (request, response) = oneshot::channel();\\n\\n self.request_tx\\n\\n .send(request)\\n\\n .await\\n\\n .map_err(|_| Error::internal_error(\\\"TimestampRequest channel is closed\\\"))?;\\n\\n Ok(response.await?)\\n\\n }\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 77,\n \"score\": 34512.8433806994\n },\n {\n \"content\": \"}\\n\\n\\n\\nasync fn run_tso(\\n\\n cluster_id: u64,\\n\\n mut rpc_sender: impl Sink<(TsoRequest, WriteFlags), Error = Error> + Unpin,\\n\\n mut rpc_receiver: impl Stream<Item = Result<TsoResponse>> + Unpin,\\n\\n request_rx: mpsc::Receiver<TimestampRequest>,\\n\\n) {\\n\\n // The `TimestampRequest`s which are waiting for the responses from the PD server\\n\\n let pending_requests = Rc::new(RefCell::new(VecDeque::with_capacity(MAX_PENDING_COUNT)));\\n\\n\\n\\n // When there are too many pending requests, the `send_request` future will refuse to fetch\\n\\n // more requests from the bounded channel. This waker is used to wake up the sending future\\n\\n // if the queue containing pending requests is no longer full.\\n\\n let sending_future_waker = Rc::new(AtomicWaker::new());\\n\\n\\n\\n pin_mut!(request_rx);\\n\\n let mut request_stream = TsoRequestStream {\\n\\n cluster_id,\\n\\n request_rx,\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 78,\n \"score\": 34505.11457451827\n },\n {\n \"content\": \"//! A timestamp returned from the timestamp oracle.\\n\\n//!\\n\\n//! The version used in transactions can be converted from a timestamp.\\n\\n//! The lower 18 (PHYSICAL_SHIFT_BITS) bits are the logical part of the timestamp.\\n\\n//! The higher bits of the version are the physical part of the timestamp.\\n\\n\\n\\npub use kvproto::pdpb::Timestamp;\\n\\nuse std::convert::TryInto;\\n\\n\\n\\nconst PHYSICAL_SHIFT_BITS: i64 = 18;\\n\\nconst LOGICAL_MASK: i64 = (1 << PHYSICAL_SHIFT_BITS) - 1;\\n\\n\\n\",\n \"file_path\": \"tikv-client-common/src/timestamp.rs\",\n \"rank\": 79,\n \"score\": 34502.53874850417\n },\n {\n \"content\": \"use grpcio::WriteFlags;\\n\\nuse kvproto::pdpb::*;\\n\\nuse std::{cell::RefCell, collections::VecDeque, pin::Pin, rc::Rc, thread};\\n\\nuse tikv_client_common::{Error, Result};\\n\\n\\n\\n/// It is an empirical value.\\n\\nconst MAX_BATCH_SIZE: usize = 64;\\n\\n\\n\\n/// TODO: This value should be adjustable.\\n\\nconst MAX_PENDING_COUNT: usize = 1 << 16;\\n\\n\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 80,\n \"score\": 34500.87057917636\n },\n {\n \"content\": \" \\\"PD gives different number of timestamps than expected\\\",\\n\\n ));\\n\\n }\\n\\n\\n\\n for request in requests {\\n\\n offset -= 1;\\n\\n let ts = Timestamp {\\n\\n physical: tail_ts.physical,\\n\\n logical: tail_ts.logical - offset as i64,\\n\\n };\\n\\n let _ = request.send(ts);\\n\\n }\\n\\n } else {\\n\\n return Err(Error::internal_error(\\n\\n \\\"PD gives more TsoResponse than expected\\\",\\n\\n ));\\n\\n };\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 81,\n \"score\": 34498.69343359164\n },\n {\n \"content\": \" pending_requests: pending_requests.clone(),\\n\\n self_waker: sending_future_waker.clone(),\\n\\n }\\n\\n .map(Ok);\\n\\n\\n\\n let send_requests = rpc_sender.send_all(&mut request_stream);\\n\\n\\n\\n let receive_and_handle_responses = async move {\\n\\n while let Some(Ok(resp)) = rpc_receiver.next().await {\\n\\n let mut pending_requests = pending_requests.borrow_mut();\\n\\n\\n\\n // Wake up the sending future blocked by too many pending requests as we are consuming\\n\\n // some of them here.\\n\\n if pending_requests.len() == MAX_PENDING_COUNT {\\n\\n sending_future_waker.wake();\\n\\n }\\n\\n\\n\\n allocate_timestamps(&resp, &mut pending_requests)?;\\n\\n }\\n\\n // TODO: distinguish between unexpected stream termination and expected end of test\\n\\n info!(\\\"TSO stream terminated\\\");\\n\\n Ok(())\\n\\n };\\n\\n\\n\\n let (send_res, recv_res): (_, Result<()>) = join!(send_requests, receive_and_handle_responses);\\n\\n info!(\\\"TSO send termination: {:?}\\\", send_res);\\n\\n info!(\\\"TSO receive termination: {:?}\\\", recv_res);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 82,\n \"score\": 34498.46254140279\n },\n {\n \"content\": \"// Copyright 2019 TiKV Project Authors. Licensed under Apache-2.0.\\n\\n\\n\\n//! This module is the low-level mechanisms for getting timestamps from a PD\\n\\n//! cluster. It should be used via the `get_timestamp` API in `PdClient`.\\n\\n//!\\n\\n//! Once a `TimestampOracle` is created, there will be two futures running in a background working\\n\\n//! thread created automatically. The `get_timestamp` method creates a oneshot channel whose\\n\\n//! transmitter is served as a `TimestampRequest`. `TimestampRequest`s are sent to the working\\n\\n//! thread through a bounded multi-producer, single-consumer channel. Every time the first future\\n\\n//! is polled, it tries to exhaust the channel to get as many requests as possible and sends a\\n\\n//! single `TsoRequest` to the PD server. The other future receives `TsoResponse`s from the PD\\n\\n//! server and allocates timestamps for the requests.\\n\\n\\n\\nuse futures::{\\n\\n channel::{mpsc, oneshot},\\n\\n executor::block_on,\\n\\n join, pin_mut,\\n\\n prelude::*,\\n\\n task::{AtomicWaker, Context, Poll},\\n\\n};\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 83,\n \"score\": 34498.0636444723\n },\n {\n \"content\": \" Poll::Ready(None) => return Poll::Ready(None),\\n\\n Poll::Pending => break,\\n\\n }\\n\\n }\\n\\n\\n\\n if !requests.is_empty() {\\n\\n let req = TsoRequest {\\n\\n header: Some(RequestHeader {\\n\\n cluster_id: self.cluster_id,\\n\\n }),\\n\\n count: requests.len() as u32,\\n\\n };\\n\\n\\n\\n let request_group = RequestGroup {\\n\\n tso_request: req.clone(),\\n\\n requests,\\n\\n };\\n\\n pending_requests.push_back(request_group);\\n\\n\\n\\n let write_flags = WriteFlags::default().buffer_hint(false);\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 84,\n \"score\": 34490.68755660072\n },\n {\n \"content\": \" Poll::Ready(Some((req, write_flags)))\\n\\n } else {\\n\\n // Set the waker to the context, then the stream can be waked up after the pending queue\\n\\n // is no longer full.\\n\\n self.self_waker.register(cx.waker());\\n\\n Poll::Pending\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-pd/src/timestamp.rs\",\n \"rank\": 85,\n \"score\": 34490.68755660072\n },\n {\n \"content\": \"impl Display for Error {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n Display::fmt(&self.inner, f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Error {\\n\\n pub fn kind(&self) -> &ErrorKind {\\n\\n self.inner.get_context()\\n\\n }\\n\\n\\n\\n #[allow(dead_code)]\\n\\n pub fn unimplemented() -> Self {\\n\\n Error::from(ErrorKind::Unimplemented)\\n\\n }\\n\\n\\n\\n pub fn region_for_key_not_found(key: Vec<u8>) -> Self {\\n\\n Error::from(ErrorKind::RegionForKeyNotFound { key })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 86,\n \"score\": 34458.337937577344\n },\n {\n \"content\": \"\\n\\nimpl From<std::io::Error> for Error {\\n\\n fn from(err: std::io::Error) -> Self {\\n\\n Error::from(ErrorKind::Io(err))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<grpcio::Error> for Error {\\n\\n fn from(err: grpcio::Error) -> Self {\\n\\n Error::from(ErrorKind::Grpc(err))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<futures::channel::oneshot::Canceled> for Error {\\n\\n fn from(err: futures::channel::oneshot::Canceled) -> Self {\\n\\n Error::from(ErrorKind::Canceled(err))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<kvproto::kvrpcpb::KeyError> for Error {\\n\\n fn from(err: kvproto::kvrpcpb::KeyError) -> Self {\\n\\n Error::from(ErrorKind::KeyError(err))\\n\\n }\\n\\n}\\n\\n\\n\\n/// A result holding an [`Error`](Error).\\n\\npub type Result<T> = result::Result<T, Error>;\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 87,\n \"score\": 34457.75886736263\n },\n {\n \"content\": \" pub fn region_error(error: kvproto::errorpb::Error) -> Self {\\n\\n Error::from(ErrorKind::RegionError(error))\\n\\n }\\n\\n\\n\\n pub fn region_not_found(region_id: u64) -> Self {\\n\\n Error::from(ErrorKind::RegionNotFound { region_id })\\n\\n }\\n\\n\\n\\n pub fn leader_not_found(region_id: u64) -> Self {\\n\\n Error::from(ErrorKind::LeaderNotFound { region_id })\\n\\n }\\n\\n\\n\\n pub fn invalid_key_range() -> Self {\\n\\n Error::from(ErrorKind::InvalidKeyRange)\\n\\n }\\n\\n\\n\\n pub fn max_scan_limit_exceeded(limit: u32, max_limit: u32) -> Self {\\n\\n Error::from(ErrorKind::MaxScanLimitExceeded { limit, max_limit })\\n\\n }\\n\\n\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 88,\n \"score\": 34453.00611841118\n },\n {\n \"content\": \" pub fn kv_error(message: String) -> Self {\\n\\n Error::from(ErrorKind::KvError { message })\\n\\n }\\n\\n\\n\\n pub fn internal_error(message: impl Into<String>) -> Self {\\n\\n Error::from(ErrorKind::InternalError {\\n\\n message: message.into(),\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn multiple_errors(errors: Vec<Error>) -> Self {\\n\\n Error::from(ErrorKind::MultipleErrors(errors))\\n\\n }\\n\\n\\n\\n pub fn undetermined_error(error: Error) -> Self {\\n\\n Error::from(ErrorKind::UndeterminedError(error))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<errorpb::Error> for Error {\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 89,\n \"score\": 34452.61207711862\n },\n {\n \"content\": \"// Copyright 2018 TiKV Project Authors. Licensed under Apache-2.0.\\n\\n\\n\\nuse failure::{Backtrace, Context, Fail};\\n\\nuse kvproto::errorpb;\\n\\nuse std::{\\n\\n fmt::{self, Display},\\n\\n result,\\n\\n};\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct Error {\\n\\n inner: Box<Context<ErrorKind>>,\\n\\n}\\n\\n\\n\\n/// An error originating from the TiKV client or dependencies.\\n\\n#[derive(Debug, Fail)]\\n\\n#[allow(clippy::large_enum_variant)]\\n\\npub enum ErrorKind {\\n\\n /// Wraps a `std::io::Error`.\\n\\n #[fail(display = \\\"IO error: {}\\\", _0)]\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 90,\n \"score\": 34449.84167060134\n },\n {\n \"content\": \" #[fail(display = \\\"Leader of region {} is not found\\\", region_id)]\\n\\n LeaderNotFound { region_id: u64 },\\n\\n /// Whether the transaction is committed or not is undetermined\\n\\n #[fail(display = \\\"Whether the transaction is committed or not is undetermined\\\")]\\n\\n UndeterminedError(#[fail(cause)] Error),\\n\\n /// Invalid key range to scan. Only left bounded intervals are supported.\\n\\n #[fail(display = \\\"Only left bounded intervals are supported\\\")]\\n\\n InvalidKeyRange,\\n\\n /// Cannot set an empty value\\n\\n #[fail(display = \\\"Cannot set an empty value\\\")]\\n\\n EmptyValue,\\n\\n /// Scan limit exceeds the maximum\\n\\n #[fail(display = \\\"Limit {} exceeds max scan limit {}\\\", limit, max_limit)]\\n\\n MaxScanLimitExceeded { limit: u32, max_limit: u32 },\\n\\n /// Wraps `kvproto::kvrpcpb::KeyError`\\n\\n #[fail(display = \\\"{:?}\\\", _0)]\\n\\n KeyError(kvproto::kvrpcpb::KeyError),\\n\\n /// A string error returned by TiKV server\\n\\n #[fail(display = \\\"Kv error. {}\\\", message)]\\n\\n KvError { message: String },\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 91,\n \"score\": 34448.91598828679\n },\n {\n \"content\": \" Io(#[fail(cause)] std::io::Error),\\n\\n /// Wraps a `grpcio::Error`.\\n\\n #[fail(display = \\\"gRPC error: {}\\\", _0)]\\n\\n Grpc(#[fail(cause)] grpcio::Error),\\n\\n /// Represents that a futures oneshot channel was cancelled.\\n\\n #[fail(display = \\\"A futures oneshot channel was canceled. {}\\\", _0)]\\n\\n Canceled(#[fail(cause)] futures::channel::oneshot::Canceled),\\n\\n /// Feature is not implemented.\\n\\n #[fail(display = \\\"Unimplemented feature\\\")]\\n\\n Unimplemented,\\n\\n /// No region is found for the given key.\\n\\n #[fail(display = \\\"Region is not found for key: {:?}\\\", key)]\\n\\n RegionForKeyNotFound { key: Vec<u8> },\\n\\n /// Errors caused by changed region information\\n\\n #[fail(display = \\\"Region error: {:?}\\\", _0)]\\n\\n RegionError(kvproto::errorpb::Error),\\n\\n /// No region is found for the given id.\\n\\n #[fail(display = \\\"Region {} is not found\\\", region_id)]\\n\\n RegionNotFound { region_id: u64 },\\n\\n /// No region is found for the given id.\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 92,\n \"score\": 34444.9159081805\n },\n {\n \"content\": \" fn from(e: errorpb::Error) -> Error {\\n\\n Error::region_error(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<ErrorKind> for Error {\\n\\n fn from(kind: ErrorKind) -> Error {\\n\\n Error {\\n\\n inner: Box::new(Context::new(kind)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Context<ErrorKind>> for Error {\\n\\n fn from(inner: Context<ErrorKind>) -> Error {\\n\\n Error {\\n\\n inner: Box::new(inner),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 93,\n \"score\": 34443.698342288815\n },\n {\n \"content\": \" #[fail(display = \\\"{}\\\", message)]\\n\\n InternalError { message: String },\\n\\n /// Multiple errors\\n\\n #[fail(display = \\\"Multiple errors: {:?}\\\", _0)]\\n\\n MultipleErrors(Vec<Error>),\\n\\n /// Invalid ColumnFamily\\n\\n #[fail(display = \\\"Unsupported column family {}\\\", _0)]\\n\\n ColumnFamilyError(String),\\n\\n}\\n\\n\\n\\nimpl Fail for Error {\\n\\n fn cause(&self) -> Option<&dyn Fail> {\\n\\n self.inner.cause()\\n\\n }\\n\\n\\n\\n fn backtrace(&self) -> Option<&Backtrace> {\\n\\n self.inner.backtrace()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-common/src/errors.rs\",\n \"rank\": 94,\n \"score\": 34443.11916554209\n },\n {\n \"content\": \"// Copyright 2018 TiKV Project Authors. Licensed under Apache-2.0.\\n\\n\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\n\\n\\nmod errors;\\n\\npub mod region;\\n\\nmod store_builder;\\n\\n\\n\\npub use crate::errors::{HasError, HasRegionError};\\n\\n#[doc(inline)]\\n\\npub use crate::region::{Region, RegionId, RegionVerId, StoreId};\\n\\n#[doc(inline)]\\n\\npub use crate::store_builder::StoreBuilder;\\n\\npub use kvproto::tikvpb::TikvClient;\\n\\n\\n\\nuse derive_new::new;\\n\\nuse futures::{future::BoxFuture, prelude::*};\\n\\nuse grpcio::{CallOption, Environment};\\n\\nuse std::{sync::Arc, time::Duration};\\n\\nuse tikv_client_common::{security::SecurityManager, stats::tikv_stats, ErrorKind, Result};\\n\\n\\n\\n/// A trait for connecting to TiKV stores.\\n\",\n \"file_path\": \"tikv-client-store/src/lib.rs\",\n \"rank\": 95,\n \"score\": 34308.33699809596\n },\n {\n \"content\": \"#[derive(new)]\\n\\npub struct Store<Client: KvClient> {\\n\\n pub region: Region,\\n\\n pub client: Client,\\n\\n timeout: Duration,\\n\\n}\\n\\n\\n\\nimpl<Client: KvClient> Store<Client> {\\n\\n pub fn from_builder<T>(builder: StoreBuilder, connect: Arc<T>) -> Result<Store<Client>>\\n\\n where\\n\\n Client: KvClient + Clone + Send + Sync + 'static,\\n\\n T: KvConnect<KvClient = Client>,\\n\\n {\\n\\n info!(\\\"connect to tikv endpoint: {:?}\\\", &builder.address);\\n\\n let client = connect.connect(builder.address.as_str())?;\\n\\n Ok(Store::new(builder.region, client, builder.timeout))\\n\\n }\\n\\n\\n\\n pub fn call_options(&self) -> CallOption {\\n\\n CallOption::default().timeout(self.timeout)\\n\",\n \"file_path\": \"tikv-client-store/src/lib.rs\",\n \"rank\": 96,\n \"score\": 34297.667611530036\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn dispatch<Resp, RpcFuture>(\\n\\n &self,\\n\\n request_name: &'static str,\\n\\n fut: ::grpcio::Result<RpcFuture>,\\n\\n ) -> BoxFuture<'static, Result<Resp>>\\n\\n where\\n\\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\\n\\n Resp: HasError + Sized + Clone + Send + 'static,\\n\\n RpcFuture: Send + 'static,\\n\\n {\\n\\n self.client.dispatch(request_name, fut)\\n\\n }\\n\\n}\\n\\n\\n\\nasync fn map_errors_and_trace<Resp, RpcFuture>(\\n\\n request_name: &'static str,\\n\\n fut: ::grpcio::Result<RpcFuture>,\\n\\n) -> Result<Resp>\\n\",\n \"file_path\": \"tikv-client-store/src/lib.rs\",\n \"rank\": 97,\n \"score\": 34294.218261570255\n },\n {\n \"content\": \"where\\n\\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\\n\\n Resp: HasError + Sized + Clone + Send + 'static,\\n\\n{\\n\\n let res = match fut {\\n\\n Ok(f) => f.await,\\n\\n Err(e) => Err(e),\\n\\n };\\n\\n\\n\\n let context = tikv_stats(request_name);\\n\\n context.done(res.map_err(|e| ErrorKind::Grpc(e).into()))\\n\\n}\\n\",\n \"file_path\": \"tikv-client-store/src/lib.rs\",\n \"rank\": 98,\n \"score\": 34292.10278563741\n },\n {\n \"content\": \"\\n\\nimpl KvClient for KvRpcClient {\\n\\n fn dispatch<Resp, RpcFuture>(\\n\\n &self,\\n\\n request_name: &'static str,\\n\\n fut: ::grpcio::Result<RpcFuture>,\\n\\n ) -> BoxFuture<'static, Result<Resp>>\\n\\n where\\n\\n RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,\\n\\n Resp: HasError + Sized + Clone + Send + 'static,\\n\\n RpcFuture: Send + 'static,\\n\\n {\\n\\n map_errors_and_trace(request_name, fut).boxed()\\n\\n }\\n\\n\\n\\n fn get_rpc_client(&self) -> Arc<TikvClient> {\\n\\n self.rpc_client.clone()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tikv-client-store/src/lib.rs\",\n \"rank\": 99,\n \"score\": 34291.5111316441\n }\n]","isConversational":false}}},{"rowIdx":2986,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"2021/05_hydrothermal-venture/src/main.rs"},"repo_name":{"kind":"string","value":"macisamuele/adventofcode"},"commit":{"kind":"string","value":"34d8994493446f951afc4584d6da7f83e85fd8f8"},"file_code":{"kind":"string","value":"use helpers::input_lines;\nuse scan_fmt::scan_fmt;\nuse std::collections::HashMap;\nuse std::str::FromStr;\n\nconst INPUT: &str = include_str!(\"../input.txt\");\n\n#[derive(Debug, PartialEq, Eq, Hash)]\nstruct Point {\n x: usize,\n y: usize,\n}\n\n#[derive(Debug, PartialEq, Eq, Hash)]\nstruct Line {\n point1: Point,\n point2: Point,\n}\n\nimpl FromStr for Line {\n type Err = anyhow::Error;\n\n fn from_str(line: &str) -> Result<Self, Self::Err> {\n let (x1, y1, x2, y2) = scan_fmt!(line, \"{},{} -> {},{}\", usize, usize, usize, usize)?;\n Ok(Self {\n point1: Point { x: x1, y: y1 },\n point2: Point { x: x2, y: y2 },\n })\n }\n}\n\nimpl Line {\n fn to_horizontal_points(&self) -> impl Iterator<Item = Point> {\n let y: usize = self.point1.y;\n let (min_x, max_x): (usize, usize) = if self.point1.y == self.point2.y {\n if self.point1.x < self.point2.x {\n (self.point1.x, self.point2.x + 1)\n } else {\n (self.point2.x, self.point1.x + 1)\n }\n } else {\n (0, 0)\n };\n\n (min_x..max_x).map(move |x| Point { x, y })\n }\n\n fn to_vertical_points(&self) -> impl Iterator<Item = Point> {\n let x: usize = self.point1.x;\n let (min_y, max_y): (usize, usize) = if self.point1.x == self.point2.x {\n if self.point1.y < self.point2.y {\n (self.point1.y, self.point2.y + 1)\n } else {\n (self.point2.y, self.point1.y + 1)\n }\n } else {\n (0, 0)\n };\n\n (min_y..max_y).map(move |y| Point { x, y })\n }\n\n fn to_diagonal_points(&self) -> impl Iterator<Item = Point> {\n let (min_x, max_x): (usize, usize) = if self.point1.x < self.point2.x {\n (self.point1.x, self.point2.x + 1)\n } else {\n (self.point2.x, self.point1.x + 1)\n };\n let (min_y, max_y): (usize, usize) = if self.point1.y < self.point2.y {\n (self.point1.y, self.point2.y + 1)\n } else {\n (self.point2.y, self.point1.y + 1)\n };\n\n let (is_x_negative_increment, is_y_negative_increment, points_in_line) =\n if max_x - min_x == max_y - min_y {\n (\n self.point1.x > self.point2.x,\n self.point1.y > self.point2.y,\n max_x - min_x,\n )\n } else {\n (false, false, 0)\n };\n\n let point1_x = self.point1.x;\n let point1_y = self.point1.y;\n (0..points_in_line).map(move |point_number| Point {\n x: if is_x_negative_increment {\n point1_x - point_number\n } else {\n point1_x + point_number\n },\n y: if is_y_negative_increment {\n point1_y - point_number\n } else {\n point1_y + point_number\n },\n })\n }\n}\n\nfn register_point(sparse_grid: &mut HashMap<Point, usize>, key: Point) {\n let current_value = sparse_grid.get(&key).map_or(0, |value| *value);\n sparse_grid.insert(key, current_value + 1);\n}\n\nfn part01(lines: &[Line]) -> usize {\n let mut sparse_grid = HashMap::new();\n for line in lines {\n for point in line.to_horizontal_points().chain(line.to_vertical_points()) {\n register_point(&mut sparse_grid, point);\n }\n }\n sparse_grid.values().filter(|count| **count >= 2).count()\n}\n\nfn part02(lines: &[Line]) -> usize {\n let mut sparse_grid = HashMap::new();\n for line in lines {\n for point in line\n .to_horizontal_points()\n .chain(line.to_vertical_points())\n .chain(line.to_diagonal_points())\n {\n register_point(&mut sparse_grid, point);\n }\n }\n sparse_grid.values().filter(|count| **count >= 2).count()\n}\n\nfn main() -> anyhow::Result<()> {\n let lines: Vec<Line> = input_lines(INPUT)?\n .iter()\n .map(|line| line.parse())\n .collect::<Result<_, _>>()?;\n\n println!(\"Part 1: {}\", part01(&lines));\n println!(\"Part 2: {}\", part02(&lines));\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"use helpers::input_lines;\nuse scan_fmt::scan_fmt;\nuse std::collections::HashMap;\nuse std::str::FromStr;\n\nconst INPUT: &str = include_str!(\"../input.txt\");\n\n#[derive(Debug, PartialEq, Eq, Hash)]\nstruct Point {\n x: usize,\n y: usize,\n}\n\n#[derive(Debug, PartialEq, Eq, Hash)]\nstruct Line {\n point1: Point,\n point2: Point,\n}\n\nimpl FromStr for Line {\n type Err = anyhow::Error;\n\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl Line {\n fn to_horizontal_points(&self) -> impl Iterator<Item = Point> {\n let y: usize = self.point1.y;\n let (min_x, max_x): (usize, usize) = if self.point1.y == self.point2.y {\n if self.point1.x < self.point2.x {\n (self.point1.x, self.point2.x + 1)\n } else {\n (self.point2.x, self.point1.x + 1)\n }\n } else {\n (0, 0)\n };\n\n (min_x..max_x).map(move |x| Point { x, y })\n }\n\n fn to_vertical_points(&self) -> impl Iterator<Item = Point> {\n let x: usize = self.point1.x;\n let (min_y, max_y): (usize, usize) = if self.point1.x == self.point2.x {\n if self.point1.y < self.point2.y {\n (self.point1.y, self.point2.y + 1)\n } else {\n (self.point2.y, self.point1.y + 1)\n }\n } else {\n (0, 0)\n };\n\n (min_y..max_y).map(move |y| Point { x, y })\n }\n\n fn to_diagonal_points(&self) -> impl Iterator<Item = Point> {\n let (min_x, max_x): (usize, usize) = if self.point1.x < self.point2.x {\n (self.point1.x, self.point2.x + 1)\n } else {\n (self.point2.x, self.point1.x + 1)\n };\n let (min_y, max_y): (usize, usize) = if self.point1.y < self.point2.y {\n (self.point1.y, self.point2.y + 1)\n } else {\n (self.point2.y, self.point1.y + 1)\n };\n\n let (is_x_negative_increment, is_y_negative_increment, points_in_line) =\n if max_x - min_x == max_y - min_y {\n (\n self.point1.x > self.point2.x,\n self.point1.y > self.point2.y,\n max_x - min_x,\n )\n } else {\n (false, false, 0)\n };\n\n let point1_x = self.point1.x;\n let point1_y = self.point1.y;\n (0..points_in_line).map(move |point_number| Point {\n x: if is_x_negative_increment {\n point1_x - point_number\n } else {\n point1_x + point_number\n },\n y: if is_y_negative_increment {\n point1_y - point_number\n } else {\n point1_y + point_number\n },\n })\n }\n}\n\nfn register_point(sparse_grid: &mut HashMap<Point, usize>, key: Point) {\n let current_value = sparse_grid.get(&key).map_or(0, |value| *value);\n sparse_grid.insert(key, current_value + 1);\n}\n\nfn part01(lines: &[Line]) -> usize {\n let mut sparse_grid = HashMap::new();\n for line in lines {\n for point in line.to_horizontal_points().chain(line.to_vertical_points()) {\n register_point(&mut sparse_grid, point);\n }\n }\n sparse_grid.values().filter(|count| **count >= 2).count()\n}\n\nfn part02(lines: &[Line]) -> usize {\n let mut sparse_grid = HashMap::new();\n for line in lines {\n for point in line\n .to_horizontal_points()\n .chain(line.to_vertical_points())\n .chain(line.to_diagonal_points())\n {\n register_point(&mut sparse_grid, point);\n }\n }\n sparse_grid.values().filter(|count| **count >= 2).count()\n}\n\nfn main() -> anyhow::Result<()> {\n let lines: Vec<Line> = input_lines(INPUT)?\n .iter()\n .map(|line| line.parse())\n .collect::<Result<_, _>>()?;\n\n println!(\"Part 1: {}\", part01(&lines));\n println!(\"Part 2: {}\", part02(&lines));\n Ok(())\n}\n"},"middle":{"kind":"string","value":"fn from_str(line: &str) -> Result<Self, Self::Err> {\n let (x1, y1, x2, y2) = scan_fmt!(line, \"{},{} -> {},{}\", usize, usize, usize, usize)?;\n Ok(Self {\n point1: Point { x: x1, y: y1 },\n point2: Point { x: x2, y: y2 },\n })\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"type Point = (usize, usize);\n\n\n","file_path":"2021/15_chiton/src/main.rs","rank":0,"score":208321.5886531291},{"content":"fn part02(line: &str) -> usize {\n\n let mut game = GameTable::new(\n\n line.as_bytes()\n\n .iter()\n\n .map(|b| (b - b'0') as usize)\n\n .collect::<Vec<_>>()\n\n .as_slice(),\n\n 1_000_000,\n\n );\n\n\n\n game.play(10_000_000);\n\n\n\n game.iter(1).skip(1).take(2).product()\n\n}\n\n\n","file_path":"2020/23_crab-cups/src/main.rs","rank":1,"score":190194.6895700844},{"content":"fn part01(input: &str) -> usize {\n\n find_start(input, 4)\n\n}\n\n\n","file_path":"2022/06_tuning-trouble/src/main.rs","rank":2,"score":189353.01464357652},{"content":"fn part02(input: &str) -> usize {\n\n find_start(input, 14)\n\n}\n\n\n","file_path":"2022/06_tuning-trouble/src/main.rs","rank":3,"score":189353.01464357652},{"content":"fn find_start(input: &str, sequence_length: usize) -> usize {\n\n input\n\n .as_bytes()\n\n .windows(sequence_length)\n\n .enumerate()\n\n .find(|(_, chars)| {\n\n (0..(sequence_length - 1))\n\n .flat_map(|index1| {\n\n (index1 + 1..sequence_length).map(move |index2| (index1, index2))\n\n })\n\n .all(|(index1, index2)| chars[index1] != chars[index2])\n\n })\n\n .map_or(0, |(idx, _)| idx)\n\n + sequence_length\n\n}\n\n\n","file_path":"2022/06_tuning-trouble/src/main.rs","rank":4,"score":184536.08420694803},{"content":"/// # Errors\n\n///\n\n/// Will return `Err` if the `filename` provided in the CLI argumens does not exist\n\n/// or the user does not have permission to read it.\n\npub fn input_lines(input: &str) -> anyhow::Result<Vec<String>> {\n\n let mut res: Vec<String> = match Opts::parse().input_filename.as_deref() {\n\n Some(path) => {\n\n eprintln!(\"Loading input from custom file: {}\", &path);\n\n read_lines(path)?.collect()\n\n }\n\n None => input.split('\\n').map(ToString::to_string).collect(),\n\n };\n\n\n\n if res[res.len() - 1].is_empty() {\n\n res.remove(res.len() - 1);\n\n }\n\n Ok(res)\n\n}\n","file_path":"helpers/src/lib.rs","rank":5,"score":180345.8576424376},{"content":"#[derive(Clone, Eq, Hash, PartialEq)]\n\nstruct Point {\n\n x: i64,\n\n y: i64,\n\n z: i64,\n\n w: i64,\n\n}\n\n\n\nimpl std::fmt::Debug for Point {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n write!(\n\n f,\n\n \"[x={}, y={}, z={}, w={}]\",\n\n self.x, self.y, self.z, self.w\n\n )\n\n }\n\n}\n\n\n\nimpl Point {\n\n #[allow(clippy::needless_lifetimes)]\n\n fn neighbours<'a>(&'a self) -> impl Iterator<Item = Point> + 'a {\n","file_path":"2020/17_conway-cubes/src/main.rs","rank":7,"score":164557.5492696818},{"content":"#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\n\nstruct Point {\n\n x: i64,\n\n y: i64,\n\n}\n\n\n\nimpl std::ops::Add for Point {\n\n type Output = Self;\n\n fn add(self, rhs: Self) -> Self {\n\n Self {\n\n x: self.x + rhs.x,\n\n y: self.y + rhs.y,\n\n }\n\n }\n\n}\n\n\n\nimpl std::ops::Sub for Point {\n\n type Output = Self;\n\n fn sub(self, rhs: Self) -> Self {\n\n Self {\n\n x: self.x - rhs.x,\n","file_path":"2020/24_lobby-layout/src/main.rs","rank":8,"score":164557.3980580591},{"content":"#[derive(Debug)]\n\nstruct Point {\n\n east: i64,\n\n north: i64,\n\n}\n\n\n\nimpl Point {\n\n fn rotate(&mut self, degrees: i64) {\n\n let rotation_in_quarters = degree_to_quarters(degrees);\n\n match rotation_in_quarters {\n\n 0 => {\n\n // (x, y) => (x, y)\n\n }\n\n 1 => {\n\n // (x, y) => (y, -x)\n\n std::mem::swap(&mut self.east, &mut self.north);\n\n self.east *= -1;\n\n }\n\n 2 => {\n\n // (x, y) => (-x, -y)\n\n self.east *= -1;\n","file_path":"2020/12_rain-risk/src/main.rs","rank":9,"score":164547.60213872825},{"content":"#[derive(Clone, Debug)]\n\nstruct Input {\n\n supply_stacks: SupplyStacks,\n\n moves: Vec<Move>,\n\n}\n\n\n\nimpl TryFrom<&[String]> for Input {\n\n type Error = anyhow::Error;\n\n fn try_from(lines: &[String]) -> Result<Self, Self::Error> {\n\n let (idx, _) = lines\n\n .iter()\n\n .enumerate()\n\n .find(|(_, line)| line.is_empty())\n\n .ok_or_else(|| anyhow::anyhow!(\"Expected empty line, but it is missing\"))?;\n\n Ok(Self {\n\n supply_stacks: SupplyStacks::try_from(&lines[..idx])?,\n\n moves: lines[(idx + 1)..]\n\n .iter()\n\n .map(|line| line.parse())\n\n .collect::<Result<_, _>>()?,\n\n })\n\n }\n\n}\n\n\n","file_path":"2022/05_supply-stacks/src/main.rs","rank":11,"score":163409.16499618354},{"content":"#[derive(Debug)]\n\nstruct Input {\n\n messages: Vec<String>,\n\n rules: HashMap<usize, Rule>,\n\n}\n\n\n\nimpl std::fmt::Display for Input {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n for (index, rule) in &self.rules {\n\n writeln!(f, \"{}: {}\", index, rule)?;\n\n }\n\n writeln!(f)?;\n\n for message in &self.messages {\n\n writeln!(f, \"{}\", message)?;\n\n }\n\n Ok(())\n\n }\n\n}\n\n\n\nimpl Clone for Input {\n\n fn clone(&self) -> Self {\n","file_path":"2020/19_monster-messages/src/main.rs","rank":12,"score":163409.16499618354},{"content":"#[derive(Clone, Debug)]\n\nstruct Input {\n\n monkeys: BTreeMap<usize, Monkey>,\n\n}\n\n\n\nimpl TryFrom<&Vec<String>> for Input {\n\n type Error = anyhow::Error;\n\n fn try_from(lines: &Vec<String>) -> Result<Self, Self::Error> {\n\n Ok(Self {\n\n monkeys: (0..lines.len())\n\n .step_by(7)\n\n .map(|monkey_start| Monkey::try_from(&lines[monkey_start..monkey_start + 6]))\n\n .collect::<Result<Vec<_>, _>>()?\n\n .into_iter()\n\n .map(|monkey| (monkey.id, monkey))\n\n .collect(),\n\n })\n\n }\n\n}\n\n\n","file_path":"2022/11_monkey-in-the-middle/src/main.rs","rank":13,"score":163409.16499618354},{"content":"#[derive(Debug)]\n\nstruct Input {\n\n image_enhancement_algorithm: ImageEnhancementAlgorithm,\n\n base_image: Image,\n\n}\n\n\n\nimpl TryFrom<Vec<String>> for Input {\n\n type Error = anyhow::Error;\n\n\n\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\n\n anyhow::ensure!(lines.len() > 3);\n\n Ok(Self {\n\n image_enhancement_algorithm: lines[0].parse()?,\n\n base_image: Image::try_from(&lines[2..])?,\n\n })\n\n }\n\n}\n\n\n\nimpl ImageEnhancementAlgorithm {\n\n fn is_light(&self, position: usize) -> bool {\n\n debug_assert!(position < 512);\n","file_path":"2021/20_trench-map/src/main.rs","rank":14,"score":163409.16499618354},{"content":"#[derive(Debug)]\n\nstruct Input {\n\n template: Vec<char>,\n\n insertion_rules: HashMap<(char, char), char>,\n\n}\n\n\n\nimpl TryFrom<Vec<String>> for Input {\n\n type Error = anyhow::Error;\n\n\n\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\n\n anyhow::ensure!(lines.len() > 2);\n\n let template = lines[0].chars().collect();\n\n let insertion_rules = lines[2..]\n\n .iter()\n\n .map(|line| {\n\n if let Some((source, destination)) = line.split_once(\" -> \") {\n\n let bytes_source: Vec<char> = source.chars().collect();\n\n anyhow::ensure!(\n\n bytes_source.len() == 2,\n\n \"source ({source}) is expected to have only 2 elements\",\n\n source = source\n","file_path":"2021/14_extended-polymerization/src/main.rs","rank":15,"score":163409.16499618354},{"content":"#[derive(Debug)]\n\nstruct Input {\n\n scanner_id_to_rotation_to_scanner: HashMap<ScannerId, HashMap<Rotation, Scanner>>,\n\n}\n\n\n\nimpl TryFrom<Vec<String>> for Input {\n\n type Error = anyhow::Error;\n\n\n\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\n\n let read_scanners: Vec<Scanner> = std::iter::once(0)\n\n .chain(lines.iter().enumerate().filter_map(|(line_number, line)| {\n\n if line.is_empty() {\n\n Some(line_number)\n\n } else {\n\n None\n\n }\n\n }))\n\n .chain(std::iter::once(lines.len()))\n\n .collect::<Vec<_>>()\n\n .windows(2)\n\n .map(|pair| {\n","file_path":"2021/19_beacon-scanner/src/main.rs","rank":16,"score":163409.16499618354},{"content":"#[derive(Debug)]\n\nstruct Input {\n\n start: Position,\n\n end: Position,\n\n n_rows: usize,\n\n n_columns: usize,\n\n map: Vec<Vec<u8>>,\n\n}\n\n\n\nimpl TryFrom<&Vec<String>> for Input {\n\n type Error = anyhow::Error;\n\n\n\n fn try_from(lines: &Vec<String>) -> Result<Self, Self::Error> {\n\n if lines.is_empty() {\n\n Err(anyhow::anyhow!(\"Expected to have at least one row\"))\n\n } else if lines\n\n .iter()\n\n .skip(1)\n\n .any(|line| lines[0].len() != line.len())\n\n {\n\n Err(anyhow::anyhow!(\n","file_path":"2022/12_hill-climbing-algorithm/src/main.rs","rank":18,"score":161614.76511174836},{"content":"struct Input {\n\n cmds: Vec<Cmd>,\n\n}\n\nimpl TryFrom<&[String]> for Input {\n\n type Error = anyhow::Error;\n\n fn try_from(lines: &[String]) -> Result<Self, Self::Error> {\n\n let mut lines_iter = lines.iter().map(String::as_str).peekable();\n\n let mut cmds: Vec<Cmd> = vec![];\n\n while lines_iter.peek().is_some() {\n\n let cmd = Cmd::from_shell_content(&mut lines_iter, cmds.last().map(Cmd::cwd))?;\n\n cmds.push(cmd);\n\n }\n\n Ok(Self { cmds })\n\n }\n\n}\n\nimpl Input {\n\n fn directory_to_size(&self) -> BTreeMap<&Path, usize> {\n\n let mut directory_to_size: BTreeMap<&Path, usize> =\n\n self.cmds.iter().map(|cmd| (cmd.cwd(), 0)).collect();\n\n\n","file_path":"2022/07_no-space-left-on-device/src/main.rs","rank":19,"score":161614.76511174836},{"content":"#[derive(Debug)]\n\nstruct Input<'a> {\n\n field_to_ranges: HashMap<&'a str, Vec<RangeInclusive<usize>>>,\n\n nearby_tickets: Vec<Ticket>,\n\n ticket: Ticket,\n\n}\n\n\n\nimpl<'a> From<&'a Vec<String>> for Input<'a> {\n\n fn from(lines: &'a Vec<String>) -> Self {\n\n let mut lines_iter = lines.iter();\n\n\n\n let field_to_ranges = lines_iter\n\n .by_ref()\n\n .take_while(|line| !line.is_empty())\n\n .map(|line| {\n\n let line_parts: Vec<_> = line.split(\": \").collect();\n\n let field = line_parts[0];\n\n let ranges = line_parts[1]\n\n .split(\" or \")\n\n .map(|range| {\n\n let (start, end) = scan_fmt!(range, \"{}-{}\", usize, usize).unwrap();\n","file_path":"2020/16_ticket-translation/src/main.rs","rank":20,"score":159150.54287603975},{"content":"#[derive(Clone, Debug)]\n\nstruct Input<'a> {\n\n allergen_to_ingredients: HashMap<&'a str, HashSet<&'a str>>,\n\n ingredients: Vec<&'a str>,\n\n}\n\n\n\nimpl<'a> From<&Vec<&'a str>> for Input<'a> {\n\n fn from(lines: &Vec<&'a str>) -> Self {\n\n let mut allergen_to_ingredients: HashMap<&'a str, HashSet<&'a str>> = HashMap::new();\n\n let mut all_ingredients = Vec::new();\n\n\n\n for line in lines {\n\n let (column_index, _) = line\n\n .as_bytes()\n\n .iter()\n\n .enumerate()\n\n .find(|(_, character)| *character == &b'(')\n\n .unwrap();\n\n let current_ingredients: HashSet<_> = line[..column_index]\n\n .split(' ')\n\n .filter(|ingredient| !ingredient.is_empty())\n","file_path":"2020/21_allergen-assessment/src/main.rs","rank":21,"score":159150.54287603975},{"content":"type BingoNumber = u8; // Using u8 as numbers in the input are in the range 0-99\n\n\n","file_path":"2021/04_giant-squid/src/main.rs","rank":22,"score":157801.174963204},{"content":"fn part01(line: &str) -> String {\n\n let mut game = GameTable::new(\n\n line.as_bytes()\n\n .iter()\n\n .map(|b| (b - b'0') as usize)\n\n .collect::<Vec<_>>()\n\n .as_slice(),\n\n 9,\n\n );\n\n\n\n game.play(100);\n\n\n\n game.cups_in_string(1)[1..].to_string()\n\n}\n\n\n","file_path":"2020/23_crab-cups/src/main.rs","rank":23,"score":149561.94672182022},{"content":"type BagRules<'a> = Graph<&'a str>;\n\n\n","file_path":"2020/07_handy-haversacks/src/main.rs","rank":24,"score":146552.6711704515},{"content":"#[derive(Debug, Default)]\n\nstruct DeterministicDice<const N: u8> {\n\n value: u8,\n\n roll_count: u16,\n\n}\n\n\n\nimpl<const N: u8> Dice for DeterministicDice<N> {\n\n fn roll(&mut self) -> u8 {\n\n self.roll_count += 1;\n\n let result = self.value + 1;\n\n self.value = (self.value + 1) % N;\n\n result\n\n }\n\n\n\n fn roll_count(&self) -> u16 {\n\n self.roll_count\n\n }\n\n\n\n fn extraction_3_rolls_statistics() -> HashMap<u16, usize> {\n\n let mut dice = Self::default();\n\n let mut extractions_histogram: HashMap<(u8, u8, u8), usize> = HashMap::new();\n","file_path":"2021/21_dirac-dice/src/main.rs","rank":25,"score":146258.41547678533},{"content":"#[derive(Debug, Default)]\n\nstruct RandomDice<const N: u8> {\n\n roll_count: u16,\n\n}\n\n\n\nimpl<const N: u8> Dice for RandomDice<N> {\n\n fn roll(&mut self) -> u8 {\n\n self.roll_count += 1;\n\n rand::random::<u8>() % N + 1\n\n }\n\n\n\n fn roll_count(&self) -> u16 {\n\n self.roll_count\n\n }\n\n\n\n fn extraction_3_rolls_statistics() -> HashMap<u16, usize> {\n\n (1..=N)\n\n .flat_map(|d1| {\n\n (1..=N).flat_map(move |d2| {\n\n (1..=N).map(move |d3| u16::from(d1) + u16::from(d2) + u16::from(d3))\n\n })\n\n })\n\n .fold(HashMap::new(), |mut map, value| {\n\n *map.entry(value).or_default() += 1;\n\n map\n\n })\n\n }\n\n}\n\n\n","file_path":"2021/21_dirac-dice/src/main.rs","rank":26,"score":146258.41547678533},{"content":"fn part01(input: &Input) -> usize {\n\n input\n\n .messages\n\n .iter()\n\n .filter(|message| input.is_valid(0, message))\n\n .count()\n\n}\n\n\n","file_path":"2020/19_monster-messages/src/main.rs","rank":27,"score":133111.6637042059},{"content":"fn part02(input: &Input) -> usize {\n\n let mut cloned_input: Input = input.clone();\n\n\n\n cloned_input.rules.extend(\n\n [\"8: 42 | 42 8\", \"11: 42 31 | 42 11 31\"]\n\n .iter()\n\n .map(|rule_str| Rule::rule_id_and_rule(rule_str)),\n\n );\n\n\n\n cloned_input\n\n .messages\n\n .iter()\n\n .filter(|message| cloned_input.is_valid(0, message))\n\n .count()\n\n}\n\n\n","file_path":"2020/19_monster-messages/src/main.rs","rank":28,"score":133111.6637042059},{"content":"fn part02(input: &Input) -> usize {\n\n fn update_possible_fields_per_column<'a>(\n\n ticket: &Ticket,\n\n input: &Input,\n\n possible_fields_per_column: &mut BTreeMap<usize, HashSet<&'a str>>,\n\n certanly_allocated_field_names: &mut HashSet<&'a str>,\n\n ) {\n\n if let Some(possible_columns_for_fields) =\n\n ticket.possible_columns_for_fields(&input.field_to_ranges)\n\n {\n\n for (general_possible_fields, possible_field_for_ticket) in possible_fields_per_column\n\n .values_mut()\n\n .zip(possible_columns_for_fields.iter())\n\n {\n\n general_possible_fields.retain(|value| possible_field_for_ticket.contains(value));\n\n if general_possible_fields.len() == 1 {\n\n certanly_allocated_field_names\n\n .insert(*general_possible_fields.iter().next().unwrap());\n\n }\n\n }\n","file_path":"2020/16_ticket-translation/src/main.rs","rank":29,"score":133111.6637042059},{"content":"fn part02(input: &Input) -> usize {\n\n let mut processed_image = input.base_image.clone();\n\n processed_image.apply_image_enhancement_algorithm(&input.image_enhancement_algorithm, 50);\n\n processed_image.light_pixels_count()\n\n}\n\n\n\nimpl std::fmt::Display for Image {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n let ranges = &self.ranges;\n\n for row_index in ranges.min_row..=ranges.max_row {\n\n for column_index in ranges.min_column..=ranges.max_column {\n\n write!(\n\n f,\n\n \"{}\",\n\n if self.is_light(row_index, column_index) {\n\n '#'\n\n } else {\n\n '.'\n\n }\n\n )?;\n\n }\n\n writeln!(f)?;\n\n }\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"2021/20_trench-map/src/main.rs","rank":30,"score":133111.6637042059},{"content":"fn part02(input: &Input) -> usize {\n\n let final_occurrences = input.occurrences_after_iterations(40);\n\n\n\n let min = final_occurrences.values().min().unwrap_or(&0);\n\n let max = final_occurrences.values().max().unwrap_or(&usize::MAX);\n\n\n\n max - min\n\n}\n\n\n","file_path":"2021/14_extended-polymerization/src/main.rs","rank":31,"score":133111.6637042059},{"content":"fn part01(input: &Input) -> usize {\n\n input\n\n .try_merge_all_scanners()\n\n .map_or(0, |(merged_scanner, _)| merged_scanner.visible_beacons())\n\n}\n\n\n","file_path":"2021/19_beacon-scanner/src/main.rs","rank":32,"score":133111.6637042059},{"content":"fn part01(input: &Input) -> usize {\n\n let final_occurrences = input.occurrences_after_iterations(10);\n\n\n\n let min = final_occurrences.values().min().unwrap_or(&0);\n\n let max = final_occurrences.values().max().unwrap_or(&usize::MAX);\n\n\n\n max - min\n\n}\n\n\n","file_path":"2021/14_extended-polymerization/src/main.rs","rank":33,"score":133111.6637042059},{"content":"fn part01(input: &Input) -> usize {\n\n input\n\n .nearby_tickets\n\n .iter()\n\n .map(|ticket| {\n\n ticket\n\n .invalid_field_values(&input.field_to_ranges)\n\n .iter()\n\n .sum::<usize>()\n\n })\n\n .sum()\n\n}\n\n\n","file_path":"2020/16_ticket-translation/src/main.rs","rank":34,"score":133111.6637042059},{"content":"fn part01(input: &Input) -> usize {\n\n let mut processed_image = input.base_image.clone();\n\n processed_image.apply_image_enhancement_algorithm(&input.image_enhancement_algorithm, 2);\n\n processed_image.light_pixels_count()\n\n}\n\n\n","file_path":"2021/20_trench-map/src/main.rs","rank":35,"score":133111.6637042059},{"content":"fn part02(input: &Input) -> usize {\n\n input\n\n .try_merge_all_scanners()\n\n .map_or(0, |(_, scanner_id_to_offset)| {\n\n let offsets: HashSet<Point3D> = scanner_id_to_offset.values().cloned().collect();\n\n pair_of_values(&offsets)\n\n .map(|(offset1, offset2)| offset1.manhattan_distance(offset2))\n\n .max()\n\n .unwrap_or(0)\n\n })\n\n}\n\n\n","file_path":"2021/19_beacon-scanner/src/main.rs","rank":36,"score":133111.6637042059},{"content":"fn part01(input: &Input) -> usize {\n\n let ingredients_with_allergene: HashSet<_> =\n\n input.allergen_to_ingredients.values().flatten().collect();\n\n\n\n let ingredients_with_no_allergene_count = input\n\n .ingredients\n\n .iter()\n\n .filter(|ingredient| !ingredients_with_allergene.contains(ingredient))\n\n .count();\n\n\n\n ingredients_with_no_allergene_count\n\n}\n\n\n","file_path":"2020/21_allergen-assessment/src/main.rs","rank":37,"score":133111.6637042059},{"content":"fn part02(input: &Input) -> usize {\n\n let directory_to_size = input.directory_to_size();\n\n let space_needed_for_update = 30_000_000;\n\n let disk_size = 70_000_000;\n\n let space_to_release = directory_to_size[&Path::new(\"/\")] + space_needed_for_update - disk_size;\n\n directory_to_size\n\n .values()\n\n .filter(|size| size >= &&space_to_release)\n\n .min()\n\n .copied()\n\n .unwrap_or(0)\n\n}\n\n\n","file_path":"2022/07_no-space-left-on-device/src/main.rs","rank":38,"score":131711.10540014462},{"content":"fn part01(input: &Input) -> usize {\n\n input\n\n .directory_to_size()\n\n .values()\n\n .filter(|size| size < &&100_000)\n\n .sum()\n\n}\n\n\n","file_path":"2022/07_no-space-left-on-device/src/main.rs","rank":39,"score":131711.10540014462},{"content":"fn part01(input: &Input) -> usize {\n\n shortest_path_length(input, &input.start, &input.end).unwrap_or(0)\n\n}\n\n\n","file_path":"2022/12_hill-climbing-algorithm/src/main.rs","rank":40,"score":131711.10540014462},{"content":"fn part02(input: &Input) -> usize {\n\n input\n\n .map\n\n .iter()\n\n .enumerate()\n\n .flat_map(|(row_id, row)| {\n\n row.iter()\n\n .enumerate()\n\n .map(move |(column_id, cell)| (row_id, column_id, cell))\n\n })\n\n .filter_map(|(row_id, column_id, cell)| {\n\n if *cell == b'a' {\n\n Some(Position {\n\n row: row_id,\n\n column: column_id,\n\n })\n\n } else {\n\n None\n\n }\n\n })\n\n .filter_map(|start_position| shortest_path_length(input, &start_position, &input.end))\n\n .min()\n\n .unwrap_or(0)\n\n}\n\n\n","file_path":"2022/12_hill-climbing-algorithm/src/main.rs","rank":41,"score":131711.10540014462},{"content":"fn part01(input: &[usize]) -> usize {\n\n input\n\n .windows(2)\n\n .map(|elements| usize::from(elements.last().unwrap() > elements.first().unwrap()))\n\n .sum()\n\n}\n\n\n","file_path":"2021/01_sonar-sweep/src/main.rs","rank":44,"score":124163.54655046045},{"content":"fn part01(input: &[usize]) -> usize {\n\n game(input, 2_020)\n\n}\n\n\n","file_path":"2020/15_rambunctious-recitation/src/main.rs","rank":45,"score":124163.54655046045},{"content":"fn part02(input: &[usize]) -> usize {\n\n input\n\n .windows(4)\n\n .map(|elements| usize::from(elements.last().unwrap() > elements.first().unwrap()))\n\n .sum()\n\n}\n\n\n","file_path":"2021/01_sonar-sweep/src/main.rs","rank":46,"score":124163.54655046045},{"content":"fn part02(input: &[usize]) -> usize {\n\n game(input, 30_000_000)\n\n}\n\n\n","file_path":"2020/15_rambunctious-recitation/src/main.rs","rank":47,"score":124163.54655046045},{"content":"fn game(input: &[usize], turns: usize) -> usize {\n\n if turns < input.len() {\n\n input[turns]\n\n } else {\n\n let mut values: Vec<usize> = vec![0; turns];\n\n let mut value_to_turns: HashMap<usize, CircularBuffer<usize>> = HashMap::new();\n\n\n\n macro_rules! play {\n\n ($turn:expr, $value: expr) => {\n\n values[$turn] = $value;\n\n value_to_turns\n\n .entry($value)\n\n .or_insert_with(|| CircularBuffer::new(2))\n\n .add($turn);\n\n };\n\n }\n\n\n\n for (turn, value) in input.iter().enumerate() {\n\n play!(turn, *value);\n\n }\n","file_path":"2020/15_rambunctious-recitation/src/main.rs","rank":48,"score":122960.69602155156},{"content":"// Considering the input we should need around 10 bits to represent the number\n\n// Even assuming translations we should be able to make it work within 16 bits\n\n// Doing this reduces the memory of each point from\n\n// 24 bytes (with isize) to 6 bytes (with i16)\n\ntype PointInt = i16;\n\n\n","file_path":"2021/19_beacon-scanner/src/main.rs","rank":49,"score":121910.22561167256},{"content":"fn part01(input: &[InputEntry]) -> usize {\n\n input\n\n .iter()\n\n .filter_map(|entry| entry.digits().ok())\n\n .map(|digits| {\n\n digits\n\n .iter()\n\n .filter(|digit| matches!(digit, 1 | 4 | 7 | 8))\n\n .count()\n\n })\n\n .sum()\n\n}\n\n\n","file_path":"2021/08_seven-segment-search/src/main.rs","rank":50,"score":121547.75944330488},{"content":"fn part02(input: &[InputEntry]) -> usize {\n\n input\n\n .iter()\n\n .filter_map(|entry| entry.to_number().ok())\n\n .sum()\n\n}\n\n\n","file_path":"2021/08_seven-segment-search/src/main.rs","rank":51,"score":121547.75944330488},{"content":"#[derive(Debug)]\n\nstruct InputEntry {\n\n one_representation: Vec<char>,\n\n four_representation: Vec<char>,\n\n four_displays: [Vec<char>; 4],\n\n}\n\n\n\nimpl FromStr for InputEntry {\n\n type Err = anyhow::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n if let Some((combinations, displays)) = s.split_once('|') {\n\n const EMPTY: Vec<char> = vec![];\n\n let (one_representation, four_representation) = {\n\n let (maybe_one_representation, maybe_four_representation) =\n\n combinations.split_whitespace().fold(\n\n (None, None),\n\n move |(maybe_one_representation, maybe_four_representation), segments| {\n\n let values: Vec<char> = segments.chars().collect();\n\n\n\n match values.len() {\n","file_path":"2021/08_seven-segment-search/src/main.rs","rank":52,"score":121382.30933189527},{"content":"fn evaluate_operation_part02(operation_str: &str) -> usize {\n\n fn eval_rec(operation: &mut Operation) -> usize {\n\n let mut stack = LinkedList::<Token>::new();\n\n\n\n for token in &mut operation.tokens {\n\n // Resolve sub operations\n\n if let Token::SubOperation(sub_operation) = token {\n\n *token = Token::Literal(eval_rec(sub_operation));\n\n }\n\n }\n\n\n\n for token in &operation.tokens {\n\n // Resolve additions (have precedence)\n\n match token {\n\n Token::Literal(n) => {\n\n if let Some(last_token) = stack.back() {\n\n if last_token == &Token::Add {\n\n stack.pop_back(); // Operator\n\n if let Some(Token::Literal(previous_n)) = stack.pop_back() {\n\n stack.push_back(Token::Literal(previous_n + n));\n","file_path":"2020/18_operation-order/src/main.rs","rank":53,"score":121166.84600459505},{"content":"fn evaluate_operation_part01(operation_str: &str) -> usize {\n\n fn eval_rec(iter: &mut dyn Iterator<Item = &Token>) -> usize {\n\n let mut current_result = 0;\n\n let mut algebric_operation = AlgebricOperation::Add;\n\n\n\n for token in iter {\n\n match token {\n\n Token::Literal(n) => match algebric_operation {\n\n AlgebricOperation::Add => {\n\n current_result += n;\n\n }\n\n AlgebricOperation::Mul => {\n\n current_result *= n;\n\n }\n\n },\n\n Token::Add => {\n\n algebric_operation = AlgebricOperation::Add;\n\n }\n\n Token::Mul => {\n\n algebric_operation = AlgebricOperation::Mul;\n","file_path":"2020/18_operation-order/src/main.rs","rank":54,"score":121166.84600459505},{"content":"type CellId = usize;\n\n\n","file_path":"2021/12_passage-pathing/src/main.rs","rank":55,"score":120977.33563537356},{"content":"fn shortest_path_length(input: &Input, start: &Position, end: &Position) -> Option<usize> {\n\n dijkstra(\n\n /* start */ start,\n\n /* successors */\n\n |position| {\n\n let mut successors = vec![];\n\n if position.row > 0\n\n && input.map[position.row - 1][position.column]\n\n <= input.map[position.row][position.column] + 1\n\n {\n\n // Up is possible\n\n successors.push((\n\n Position {\n\n row: position.row - 1,\n\n column: position.column,\n\n },\n\n 1,\n\n ));\n\n }\n\n if position.row < input.n_rows - 1\n","file_path":"2022/12_hill-climbing-algorithm/src/main.rs","rank":56,"score":117321.67224822905},{"content":"#[derive(Clone, Debug, Default)]\n\nstruct SparseGrid(HashMap<isize, HashSet<isize>>);\n\n\n\nimpl SparseGrid {\n\n fn rows_range(&self) -> RangeInclusive<isize> {\n\n let min_row = *self\n\n .0\n\n .keys()\n\n .min()\n\n .expect(\"Expected to have at least one row\");\n\n let max_row = *self\n\n .0\n\n .keys()\n\n .max()\n\n .expect(\"Expected to have at least one row\");\n\n min_row..=max_row\n\n }\n\n\n\n fn columns_range(&self) -> RangeInclusive<isize> {\n\n let min_columns = *self\n\n .0\n","file_path":"2021/13_transparent-origami/src/main.rs","rank":57,"score":117314.25010571301},{"content":"#[derive(Debug)]\n\nstruct Range(RangeInclusive<usize>);\n\nimpl Deref for Range {\n\n type Target = RangeInclusive<usize>;\n\n fn deref(&self) -> &Self::Target {\n\n &self.0\n\n }\n\n}\n\nimpl From<RangeInclusive<usize>> for Range {\n\n fn from(value: RangeInclusive<usize>) -> Self {\n\n Self(value)\n\n }\n\n}\n\nimpl Range {\n\n fn fully_includes(&self, other: &Range) -> bool {\n\n self.contains(other.start()) && self.contains(other.end())\n\n }\n\n\n\n fn overlaps(&self, other: &Range) -> bool {\n\n !(self.end() < other.start() || self.start() > other.end())\n\n }\n\n}\n\n\n","file_path":"2022/04_camp-cleanup/src/main.rs","rank":58,"score":115151.10888357894},{"content":"fn value_in_every_loop(subject: usize) -> impl Iterator<Item = usize> {\n\n std::iter::successors(Some(1), move |value| Some((value * subject) % 20_201_227))\n\n}\n\n\n","file_path":"2020/25_combo-breaker/src/main.rs","rank":59,"score":114258.03547540553},{"content":"fn read_lines(filename: &str) -> std::io::Result<Box<dyn Iterator<Item = String>>> {\n\n Ok(Box::new(\n\n BufReader::new(File::open(filename)?)\n\n .lines()\n\n .into_iter()\n\n .filter_map(Result::ok),\n\n ))\n\n}\n\n\n","file_path":"helpers/src/lib.rs","rank":60,"score":97432.74297347374},{"content":"/// Retrieve all the unordered pair of values within a given set.\n\n///\n\n/// NOTES:\n\n/// * The following pairs are considered as the same: `(A, B)` is equivalent to `(B, A)`\n\n/// * Having values in a set ensures that the pair `(A, A)` is not possible\n\nfn pair_of_values<T: PartialOrd>(values: &HashSet<T>) -> impl Iterator<Item = (&T, &T)> {\n\n values.iter().flat_map(move |value1| {\n\n values.iter().filter_map(move |value2| {\n\n if value1 > value2 {\n\n Some((value1, value2))\n\n } else {\n\n None\n\n }\n\n })\n\n })\n\n}\n\n\n","file_path":"2021/19_beacon-scanner/src/main.rs","rank":61,"score":94176.96553555112},{"content":"fn part01(input: &Input) -> u64 {\n\n let inspections: BTreeSet<_> = number_of_inspections(input, 20, 3)\n\n .values()\n\n .copied()\n\n .collect();\n\n inspections.iter().rev().take(2).product()\n\n}\n\n\n","file_path":"2022/11_monkey-in-the-middle/src/main.rs","rank":62,"score":92478.92085594175},{"content":"fn part02(input: &Input) -> String {\n\n let mut cloned_input = input.clone();\n\n\n\n // BTreeMap to avoid explicit sorting <- as it does not change complexity\n\n let mut allergen_to_ingredient: BTreeMap<&str, &str> = BTreeMap::new();\n\n let mut used_ingredients: HashSet<&str> = HashSet::new();\n\n\n\n while allergen_to_ingredient.len() != cloned_input.allergen_to_ingredients.len() {\n\n for (allergen, ingredients) in &cloned_input.allergen_to_ingredients {\n\n if ingredients.len() == 1 && !allergen_to_ingredient.contains_key(allergen) {\n\n used_ingredients.extend(ingredients.iter());\n\n\n\n allergen_to_ingredient.insert(allergen, ingredients.iter().next().unwrap());\n\n }\n\n }\n\n\n\n for ingredients in &mut cloned_input.allergen_to_ingredients.values_mut() {\n\n ingredients.retain(|ingredient| !used_ingredients.contains(ingredient));\n\n }\n\n }\n\n\n\n allergen_to_ingredient\n\n .values()\n\n .copied()\n\n .collect::<Vec<_>>()\n\n .join(\",\")\n\n}\n\n\n","file_path":"2020/21_allergen-assessment/src/main.rs","rank":63,"score":92478.92085594175},{"content":"fn part02(input: &Input) -> u64 {\n\n let inspections: BTreeSet<_> = number_of_inspections(input, 10000, 1)\n\n .values()\n\n .copied()\n\n .collect();\n\n\n\n inspections.iter().rev().take(2).product()\n\n}\n\n\n","file_path":"2022/11_monkey-in-the-middle/src/main.rs","rank":64,"score":92478.92085594175},{"content":"fn part02(inputs: &[usize]) -> usize {\n\n calculate_o2_value(inputs, 0) * calculate_co2_value(inputs, 0)\n\n}\n\n\n","file_path":"2021/03_binary-diagnostic/src/main.rs","rank":65,"score":91470.99733296926},{"content":"fn part01(inputs: &[usize]) -> usize {\n\n let rate = inputs.iter().fold(Rate::default(), |mut rate, value| {\n\n rate.add_value(*value);\n\n rate\n\n });\n\n rate.gamma_rate() * rate.epsilon_rate()\n\n}\n\n\n","file_path":"2021/03_binary-diagnostic/src/main.rs","rank":66,"score":91470.99733296926},{"content":"fn part01(arrival_time: usize, line_numbers: &[Option<usize>]) -> usize {\n\n let earliest_departure_to_line_number: HashMap<usize, &usize> = line_numbers\n\n .iter()\n\n .filter_map(|maybe_line_number| {\n\n maybe_line_number.as_ref().map(|line_number| {\n\n match arrival_time.checked_rem(*line_number) {\n\n Some(0) => (arrival_time, line_number),\n\n Some(value) => (arrival_time - value + line_number, line_number),\n\n None => unreachable!(\"Not possible value\"),\n\n }\n\n })\n\n })\n\n .collect();\n\n earliest_departure_to_line_number\n\n .keys()\n\n .min()\n\n .map_or(0, |earliest_departure| {\n\n let line_number = *earliest_departure_to_line_number[earliest_departure];\n\n (earliest_departure - arrival_time) * line_number\n\n })\n\n}\n\n\n","file_path":"2020/13_shuttle-search/src/main.rs","rank":67,"score":89889.1025941042},{"content":"fn calculate_o2_value(inputs: &[usize], bit_index: usize) -> usize {\n\n if inputs.len() == 1 {\n\n inputs[0]\n\n } else {\n\n let (inputs_with_0_bit, inputs_with_1_bit) = inputs.iter().fold(\n\n (vec![], vec![]),\n\n |(mut inputs_with_0_bit, mut inputs_with_1_bit), value| {\n\n if (*value) & 1 << (NUMBER_OF_BITS - 1 - bit_index) == 0 {\n\n inputs_with_0_bit.push(*value);\n\n } else {\n\n inputs_with_1_bit.push(*value);\n\n }\n\n (inputs_with_0_bit, inputs_with_1_bit)\n\n },\n\n );\n\n\n\n if inputs_with_0_bit.len() > inputs_with_1_bit.len() {\n\n calculate_o2_value(&inputs_with_0_bit, bit_index + 1)\n\n } else {\n\n calculate_o2_value(&inputs_with_1_bit, bit_index + 1)\n\n }\n\n }\n\n}\n\n\n","file_path":"2021/03_binary-diagnostic/src/main.rs","rank":68,"score":89763.07599346753},{"content":"fn calculate_co2_value(inputs: &[usize], bit_index: usize) -> usize {\n\n if inputs.len() == 1 {\n\n inputs[0]\n\n } else {\n\n let (inputs_with_0_bit, inputs_with_1_bit) = inputs.iter().fold(\n\n (vec![], vec![]),\n\n |(mut inputs_with_0_bit, mut inputs_with_1_bit), value| {\n\n if (*value) & 1 << (NUMBER_OF_BITS - 1 - bit_index) == 0 {\n\n inputs_with_0_bit.push(*value);\n\n } else {\n\n inputs_with_1_bit.push(*value);\n\n }\n\n (inputs_with_0_bit, inputs_with_1_bit)\n\n },\n\n );\n\n\n\n if inputs_with_0_bit.len() > inputs_with_1_bit.len() {\n\n calculate_co2_value(&inputs_with_1_bit, bit_index + 1)\n\n } else {\n\n calculate_co2_value(&inputs_with_0_bit, bit_index + 1)\n\n }\n\n }\n\n}\n\n\n","file_path":"2021/03_binary-diagnostic/src/main.rs","rank":69,"score":89763.07599346753},{"content":"fn part02(mut input: Input) -> anyhow::Result<String> {\n\n for move_ in input.moves {\n\n input.supply_stacks.apply_crate_mover_9001(&move_)?;\n\n }\n\n Ok(input\n\n .supply_stacks\n\n .stacks\n\n .iter()\n\n .filter_map(VecDeque::back)\n\n .collect())\n\n}\n\n\n","file_path":"2022/05_supply-stacks/src/main.rs","rank":70,"score":87048.18817725425},{"content":"fn part01(mut input: Input) -> anyhow::Result<String> {\n\n for move_ in input.moves {\n\n input.supply_stacks.apply_crate_mover_9000(&move_)?;\n\n }\n\n Ok(input\n\n .supply_stacks\n\n .stacks\n\n .iter()\n\n .filter_map(VecDeque::back)\n\n .collect())\n\n}\n\n\n","file_path":"2022/05_supply-stacks/src/main.rs","rank":71,"score":87048.18817725425},{"content":"fn part01(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2021/23_amphipod/src/main.rs","rank":72,"score":83649.94128754122},{"content":"fn part02(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2021/23_amphipod/src/main.rs","rank":73,"score":83649.94128754122},{"content":"#[derive(Clone, Debug)]\n\nstruct Grid {\n\n inner: Vec<Vec<u8>>,\n\n rows: usize,\n\n columns: usize,\n\n}\n\n\n\nimpl From<Vec<String>> for Grid {\n\n fn from(value: Vec<String>) -> Self {\n\n let inner: Vec<Vec<u8>> = value\n\n .iter()\n\n .map(|line| {\n\n line.chars()\n\n .map(|character| (character as u8) - b'0')\n\n .collect()\n\n })\n\n .collect();\n\n let rows = inner.len();\n\n let columns = inner.get(0).map_or(0, Vec::len);\n\n Self {\n\n inner,\n","file_path":"2021/15_chiton/src/main.rs","rank":74,"score":82009.25620365994},{"content":"#[derive(Parser, Debug)]\n\nstruct Opts {\n\n /// Sets a custom input file for the assignment. Passing no value implies the usage of the \"official\" assignment input.\n\n // #[clap(short, long)]\n\n input_filename: Option<String>,\n\n}\n\n\n","file_path":"helpers/src/lib.rs","rank":75,"score":82009.25620365994},{"content":"fn part01(lines: &[String]) -> usize {\n\n let pub_key_1: usize = lines[0].parse().unwrap();\n\n let pub_key_2: usize = lines[1].parse().unwrap();\n\n\n\n let loop_size = value_in_every_loop(7)\n\n .take_while(|value| value != &pub_key_1)\n\n .count();\n\n\n\n value_in_every_loop(pub_key_2).nth(loop_size).unwrap()\n\n}\n\n\n","file_path":"2020/25_combo-breaker/src/main.rs","rank":76,"score":81999.49356542644},{"content":"fn part01(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2021/25_sea-cucumber/src/main.rs","rank":77,"score":81999.49356542644},{"content":"fn part02(lines: &[String]) -> usize {\n\n let (_, score) = RecursiveCombat::from(lines).play();\n\n score\n\n}\n\n\n","file_path":"2020/22_crab-combat/src/main.rs","rank":78,"score":81999.49356542644},{"content":"fn part01(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2022/13_distress-signal/src/main.rs","rank":79,"score":81999.49356542644},{"content":"fn part01(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2020/20_jurassic-jigsaw/src/main.rs","rank":80,"score":81999.49356542644},{"content":"fn part02(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2021/25_sea-cucumber/src/main.rs","rank":81,"score":81999.49356542644},{"content":"fn part02(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2020/20_jurassic-jigsaw/src/main.rs","rank":82,"score":81999.49356542644},{"content":"fn part02(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2022/13_distress-signal/src/main.rs","rank":83,"score":81999.49356542644},{"content":"fn part02(lines: &[String]) -> usize {\n\n lines\n\n .iter()\n\n .map(|line| evaluate_operation_part02(line))\n\n .sum()\n\n}\n\n\n","file_path":"2020/18_operation-order/src/main.rs","rank":84,"score":81999.49356542644},{"content":"fn part02(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2021/22_reactor-reboot/src/main.rs","rank":85,"score":81999.49356542644},{"content":"fn part02(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2020/25_combo-breaker/src/main.rs","rank":86,"score":81999.49356542644},{"content":"fn part01(_lines: &[String]) -> usize {\n\n 0\n\n}\n\n\n","file_path":"2021/22_reactor-reboot/src/main.rs","rank":87,"score":81999.49356542644},{"content":"fn part02(lines: &[String]) -> usize {\n\n lines\n\n .iter()\n\n .filter(|line| {\n\n let (first_index, second_index, character, password) =\n\n scan_fmt!(line, \"{}-{} {}: {}\", usize, usize, char, String).unwrap();\n\n PasswordPolicyPart2 {\n\n indexes: [first_index, second_index],\n\n character,\n\n }\n\n .is_password_good(&password)\n\n })\n\n .count()\n\n}\n\n\n","file_path":"2020/02_password-philosophy/src/main.rs","rank":88,"score":81999.49356542644},{"content":"fn part01(lines: &[String]) -> usize {\n\n lines\n\n .iter()\n\n .filter(|line| {\n\n let (min, max, character, password) =\n\n scan_fmt!(line, \"{}-{} {}: {}\", usize, usize, char, String).unwrap();\n\n PasswordPolicyPart1 {\n\n min,\n\n max,\n\n character,\n\n }\n\n .is_password_good(&password)\n\n })\n\n .count()\n\n}\n\n\n","file_path":"2020/02_password-philosophy/src/main.rs","rank":89,"score":81999.49356542644},{"content":"fn part01(lines: &[String]) -> usize {\n\n let (_, score) = CrabCombat::from(lines).play();\n\n score\n\n}\n\n\n","file_path":"2020/22_crab-combat/src/main.rs","rank":90,"score":81999.49356542644},{"content":"fn part01(lines: &[String]) -> usize {\n\n lines\n\n .iter()\n\n .map(|line| evaluate_operation_part01(line))\n\n .sum()\n\n}\n\n\n","file_path":"2020/18_operation-order/src/main.rs","rank":91,"score":81999.49356542644},{"content":"#[derive(Clone, Debug, Eq, PartialEq)]\n\nstruct Scanner {\n\n id: ScannerId,\n\n beacons: HashSet<Point3D>,\n\n point_distances: HashMap<(Point3D, Point3D), Point3D>,\n\n known_distances: HashSet<Point3D>,\n\n}\n\n\n\nimpl TryFrom<&[String]> for Scanner {\n\n type Error = anyhow::Error;\n\n\n\n fn try_from(lines: &[String]) -> Result<Self, Self::Error> {\n\n anyhow::ensure!(lines.len() > 1);\n\n let id = ScannerId(scan_fmt!(&lines[0], \"--- scanner {} ---\", u8)?);\n\n let beacons: HashSet<Point3D> = lines[1..]\n\n .iter()\n\n .map(|line| line.parse())\n\n .collect::<Result<_, _>>()?;\n\n\n\n Ok(Self::new(id, beacons))\n\n }\n","file_path":"2021/19_beacon-scanner/src/main.rs","rank":92,"score":81082.0573267905},{"content":"#[derive(Clone, Copy, Debug, Default, Eq, Ord, PartialEq, PartialOrd)]\n\nstruct Position {\n\n row: i32,\n\n column: i32,\n\n}\n\n\n\nimpl Position {\n\n fn apply(&mut self, direction: Direction) {\n\n match direction {\n\n Direction::Up => self.row -= 1,\n\n Direction::Right => self.column += 1,\n\n Direction::Down => self.row += 1,\n\n Direction::Left => self.column -= 1,\n\n Direction::UpRight => {\n\n self.apply(Direction::Up);\n\n self.apply(Direction::Right);\n\n }\n\n Direction::UpLeft => {\n\n self.apply(Direction::Up);\n\n self.apply(Direction::Left);\n\n }\n","file_path":"2022/09_rope-bridge/src/main.rs","rank":93,"score":81081.90633254332},{"content":"#[derive(Clone, Debug, PartialEq)]\n\nstruct Operation {\n\n tokens: Vec<Token>,\n\n}\n\n\n\nimpl FromStr for Operation {\n\n type Err = ();\n\n\n\n fn from_str(value: &str) -> Result<Self, Self::Err> {\n\n Ok(Self::from(&mut value.chars().peekable()))\n\n }\n\n}\n\n\n\nimpl<I: Iterator<Item = char>> From<&mut Peekable<I>> for Operation {\n\n fn from(value: &mut Peekable<I>) -> Self {\n\n struct ExpressionInteration<'a, T: Iterator<Item = char>> {\n\n input_characters: &'a mut Peekable<T>,\n\n }\n\n\n\n impl<T: Iterator<Item = char>> Iterator for ExpressionInteration<'_, T> {\n\n type Item = Token;\n","file_path":"2020/18_operation-order/src/main.rs","rank":94,"score":81081.36165213841},{"content":"#[derive(Debug)]\n\nstruct Rucksack {\n\n first_compartment: BTreeSet<u8>,\n\n second_compartment: BTreeSet<u8>,\n\n}\n\n\n\nimpl FromStr for Rucksack {\n\n type Err = anyhow::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n if s.len() % 2 == 0 {\n\n let first_compartment = s[..s.len() / 2].bytes().collect();\n\n let second_compartment = s[s.len() / 2..].bytes().collect();\n\n Ok(Self {\n\n first_compartment,\n\n second_compartment,\n\n })\n\n } else {\n\n Err(anyhow::anyhow!(\n\n \"Not even number of elements ({}) in {}\",\n\n s.len(),\n\n s\n\n ))\n\n }\n\n }\n\n}\n\n\n","file_path":"2022/03_rucksack-reorganization/src/main.rs","rank":95,"score":81076.69519224131},{"content":"// Game is compressed as much as possible such that it would not cause\n\n// memory problems as we will store many\n\nstruct Game {\n\n is_player1_round: bool,\n\n // Positions are between 1 and 10, hence 8 bits are sufficient\n\n player1_position: u8,\n\n player2_position: u8,\n\n // Scores are up to 1000 for part 1 and 21 for part2,\n\n // hence 11 bits are sufficient with some margin\n\n // as there are no 11 bits integers we're using the closer\n\n // one (16 bits)\n\n player1_score: u16,\n\n player2_score: u16,\n\n}\n\n\n\nimpl TryFrom<Vec<String>> for Game {\n\n type Error = anyhow::Error;\n\n\n\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\n\n anyhow::ensure!(lines.len() == 2);\n\n let player1_position = scan_fmt!(&lines[0], \"Player 1 starting position: {}\", u8)?;\n\n let player2_position = scan_fmt!(&lines[1], \"Player 2 starting position: {}\", u8)?;\n","file_path":"2021/21_dirac-dice/src/main.rs","rank":96,"score":81076.69519224131},{"content":"#[derive(Debug)]\n\nstruct Passport {\n\n fields: HashMap<String, String>,\n\n}\n\n\n\nimpl Passport {\n\n const REQUIRED_FIELDS: [&'static str; 7] = [\"byr\", \"iyr\", \"eyr\", \"hgt\", \"hcl\", \"ecl\", \"pid\"];\n\n\n\n fn is_field_valid(&self, field_name: &str) -> Option<()> {\n\n fn is_in_range(value: i32, min: i32, max: i32) -> Option<()> {\n\n if value >= min && value <= max {\n\n Some(())\n\n } else {\n\n None\n\n }\n\n }\n\n fn is_integer_in_range(value: &str, min: i32, max: i32) -> Option<()> {\n\n is_in_range(value.parse::<i32>().ok()?, min, max)\n\n }\n\n\n\n let field_value = self.fields.get(field_name)?;\n","file_path":"2020/04_passport-processing/src/main.rs","rank":97,"score":81076.69519224131},{"content":"#[derive(Clone, Debug)]\n\nstruct Move {\n\n quantity: usize,\n\n src: usize,\n\n dst: usize,\n\n}\n\nimpl FromStr for Move {\n\n type Err = anyhow::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n let (quantity, src, dst) = scan_fmt!(s, \"move {} from {} to {}\", usize, usize, usize)?;\n\n Ok(Self { quantity, src, dst })\n\n }\n\n}\n\n\n","file_path":"2022/05_supply-stacks/src/main.rs","rank":98,"score":81076.69519224131},{"content":"#[derive(Debug)]\n\nstruct Assignment {\n\n first: Range,\n\n second: Range,\n\n}\n\nimpl FromStr for Assignment {\n\n type Err = anyhow::Error;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n let (first_start, first_end, second_start, second_end) =\n\n scan_fmt!(s, \"{}-{},{}-{}\", usize, usize, usize, usize)?;\n\n Ok(Self {\n\n first: (first_start..=first_end).into(),\n\n second: (second_start..=second_end).into(),\n\n })\n\n }\n\n}\n\n\n","file_path":"2022/04_camp-cleanup/src/main.rs","rank":99,"score":81076.69519224131}],"string":"[\n {\n \"content\": \"type Point = (usize, usize);\\n\\n\\n\",\n \"file_path\": \"2021/15_chiton/src/main.rs\",\n \"rank\": 0,\n \"score\": 208321.5886531291\n },\n {\n \"content\": \"fn part02(line: &str) -> usize {\\n\\n let mut game = GameTable::new(\\n\\n line.as_bytes()\\n\\n .iter()\\n\\n .map(|b| (b - b'0') as usize)\\n\\n .collect::<Vec<_>>()\\n\\n .as_slice(),\\n\\n 1_000_000,\\n\\n );\\n\\n\\n\\n game.play(10_000_000);\\n\\n\\n\\n game.iter(1).skip(1).take(2).product()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/23_crab-cups/src/main.rs\",\n \"rank\": 1,\n \"score\": 190194.6895700844\n },\n {\n \"content\": \"fn part01(input: &str) -> usize {\\n\\n find_start(input, 4)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/06_tuning-trouble/src/main.rs\",\n \"rank\": 2,\n \"score\": 189353.01464357652\n },\n {\n \"content\": \"fn part02(input: &str) -> usize {\\n\\n find_start(input, 14)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/06_tuning-trouble/src/main.rs\",\n \"rank\": 3,\n \"score\": 189353.01464357652\n },\n {\n \"content\": \"fn find_start(input: &str, sequence_length: usize) -> usize {\\n\\n input\\n\\n .as_bytes()\\n\\n .windows(sequence_length)\\n\\n .enumerate()\\n\\n .find(|(_, chars)| {\\n\\n (0..(sequence_length - 1))\\n\\n .flat_map(|index1| {\\n\\n (index1 + 1..sequence_length).map(move |index2| (index1, index2))\\n\\n })\\n\\n .all(|(index1, index2)| chars[index1] != chars[index2])\\n\\n })\\n\\n .map_or(0, |(idx, _)| idx)\\n\\n + sequence_length\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/06_tuning-trouble/src/main.rs\",\n \"rank\": 4,\n \"score\": 184536.08420694803\n },\n {\n \"content\": \"/// # Errors\\n\\n///\\n\\n/// Will return `Err` if the `filename` provided in the CLI argumens does not exist\\n\\n/// or the user does not have permission to read it.\\n\\npub fn input_lines(input: &str) -> anyhow::Result<Vec<String>> {\\n\\n let mut res: Vec<String> = match Opts::parse().input_filename.as_deref() {\\n\\n Some(path) => {\\n\\n eprintln!(\\\"Loading input from custom file: {}\\\", &path);\\n\\n read_lines(path)?.collect()\\n\\n }\\n\\n None => input.split('\\\\n').map(ToString::to_string).collect(),\\n\\n };\\n\\n\\n\\n if res[res.len() - 1].is_empty() {\\n\\n res.remove(res.len() - 1);\\n\\n }\\n\\n Ok(res)\\n\\n}\\n\",\n \"file_path\": \"helpers/src/lib.rs\",\n \"rank\": 5,\n \"score\": 180345.8576424376\n },\n {\n \"content\": \"#[derive(Clone, Eq, Hash, PartialEq)]\\n\\nstruct Point {\\n\\n x: i64,\\n\\n y: i64,\\n\\n z: i64,\\n\\n w: i64,\\n\\n}\\n\\n\\n\\nimpl std::fmt::Debug for Point {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n write!(\\n\\n f,\\n\\n \\\"[x={}, y={}, z={}, w={}]\\\",\\n\\n self.x, self.y, self.z, self.w\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Point {\\n\\n #[allow(clippy::needless_lifetimes)]\\n\\n fn neighbours<'a>(&'a self) -> impl Iterator<Item = Point> + 'a {\\n\",\n \"file_path\": \"2020/17_conway-cubes/src/main.rs\",\n \"rank\": 7,\n \"score\": 164557.5492696818\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]\\n\\nstruct Point {\\n\\n x: i64,\\n\\n y: i64,\\n\\n}\\n\\n\\n\\nimpl std::ops::Add for Point {\\n\\n type Output = Self;\\n\\n fn add(self, rhs: Self) -> Self {\\n\\n Self {\\n\\n x: self.x + rhs.x,\\n\\n y: self.y + rhs.y,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::ops::Sub for Point {\\n\\n type Output = Self;\\n\\n fn sub(self, rhs: Self) -> Self {\\n\\n Self {\\n\\n x: self.x - rhs.x,\\n\",\n \"file_path\": \"2020/24_lobby-layout/src/main.rs\",\n \"rank\": 8,\n \"score\": 164557.3980580591\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Point {\\n\\n east: i64,\\n\\n north: i64,\\n\\n}\\n\\n\\n\\nimpl Point {\\n\\n fn rotate(&mut self, degrees: i64) {\\n\\n let rotation_in_quarters = degree_to_quarters(degrees);\\n\\n match rotation_in_quarters {\\n\\n 0 => {\\n\\n // (x, y) => (x, y)\\n\\n }\\n\\n 1 => {\\n\\n // (x, y) => (y, -x)\\n\\n std::mem::swap(&mut self.east, &mut self.north);\\n\\n self.east *= -1;\\n\\n }\\n\\n 2 => {\\n\\n // (x, y) => (-x, -y)\\n\\n self.east *= -1;\\n\",\n \"file_path\": \"2020/12_rain-risk/src/main.rs\",\n \"rank\": 9,\n \"score\": 164547.60213872825\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct Input {\\n\\n supply_stacks: SupplyStacks,\\n\\n moves: Vec<Move>,\\n\\n}\\n\\n\\n\\nimpl TryFrom<&[String]> for Input {\\n\\n type Error = anyhow::Error;\\n\\n fn try_from(lines: &[String]) -> Result<Self, Self::Error> {\\n\\n let (idx, _) = lines\\n\\n .iter()\\n\\n .enumerate()\\n\\n .find(|(_, line)| line.is_empty())\\n\\n .ok_or_else(|| anyhow::anyhow!(\\\"Expected empty line, but it is missing\\\"))?;\\n\\n Ok(Self {\\n\\n supply_stacks: SupplyStacks::try_from(&lines[..idx])?,\\n\\n moves: lines[(idx + 1)..]\\n\\n .iter()\\n\\n .map(|line| line.parse())\\n\\n .collect::<Result<_, _>>()?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/05_supply-stacks/src/main.rs\",\n \"rank\": 11,\n \"score\": 163409.16499618354\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Input {\\n\\n messages: Vec<String>,\\n\\n rules: HashMap<usize, Rule>,\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for Input {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n for (index, rule) in &self.rules {\\n\\n writeln!(f, \\\"{}: {}\\\", index, rule)?;\\n\\n }\\n\\n writeln!(f)?;\\n\\n for message in &self.messages {\\n\\n writeln!(f, \\\"{}\\\", message)?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clone for Input {\\n\\n fn clone(&self) -> Self {\\n\",\n \"file_path\": \"2020/19_monster-messages/src/main.rs\",\n \"rank\": 12,\n \"score\": 163409.16499618354\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct Input {\\n\\n monkeys: BTreeMap<usize, Monkey>,\\n\\n}\\n\\n\\n\\nimpl TryFrom<&Vec<String>> for Input {\\n\\n type Error = anyhow::Error;\\n\\n fn try_from(lines: &Vec<String>) -> Result<Self, Self::Error> {\\n\\n Ok(Self {\\n\\n monkeys: (0..lines.len())\\n\\n .step_by(7)\\n\\n .map(|monkey_start| Monkey::try_from(&lines[monkey_start..monkey_start + 6]))\\n\\n .collect::<Result<Vec<_>, _>>()?\\n\\n .into_iter()\\n\\n .map(|monkey| (monkey.id, monkey))\\n\\n .collect(),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/11_monkey-in-the-middle/src/main.rs\",\n \"rank\": 13,\n \"score\": 163409.16499618354\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Input {\\n\\n image_enhancement_algorithm: ImageEnhancementAlgorithm,\\n\\n base_image: Image,\\n\\n}\\n\\n\\n\\nimpl TryFrom<Vec<String>> for Input {\\n\\n type Error = anyhow::Error;\\n\\n\\n\\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\\n\\n anyhow::ensure!(lines.len() > 3);\\n\\n Ok(Self {\\n\\n image_enhancement_algorithm: lines[0].parse()?,\\n\\n base_image: Image::try_from(&lines[2..])?,\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ImageEnhancementAlgorithm {\\n\\n fn is_light(&self, position: usize) -> bool {\\n\\n debug_assert!(position < 512);\\n\",\n \"file_path\": \"2021/20_trench-map/src/main.rs\",\n \"rank\": 14,\n \"score\": 163409.16499618354\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Input {\\n\\n template: Vec<char>,\\n\\n insertion_rules: HashMap<(char, char), char>,\\n\\n}\\n\\n\\n\\nimpl TryFrom<Vec<String>> for Input {\\n\\n type Error = anyhow::Error;\\n\\n\\n\\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\\n\\n anyhow::ensure!(lines.len() > 2);\\n\\n let template = lines[0].chars().collect();\\n\\n let insertion_rules = lines[2..]\\n\\n .iter()\\n\\n .map(|line| {\\n\\n if let Some((source, destination)) = line.split_once(\\\" -> \\\") {\\n\\n let bytes_source: Vec<char> = source.chars().collect();\\n\\n anyhow::ensure!(\\n\\n bytes_source.len() == 2,\\n\\n \\\"source ({source}) is expected to have only 2 elements\\\",\\n\\n source = source\\n\",\n \"file_path\": \"2021/14_extended-polymerization/src/main.rs\",\n \"rank\": 15,\n \"score\": 163409.16499618354\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Input {\\n\\n scanner_id_to_rotation_to_scanner: HashMap<ScannerId, HashMap<Rotation, Scanner>>,\\n\\n}\\n\\n\\n\\nimpl TryFrom<Vec<String>> for Input {\\n\\n type Error = anyhow::Error;\\n\\n\\n\\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\\n\\n let read_scanners: Vec<Scanner> = std::iter::once(0)\\n\\n .chain(lines.iter().enumerate().filter_map(|(line_number, line)| {\\n\\n if line.is_empty() {\\n\\n Some(line_number)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }))\\n\\n .chain(std::iter::once(lines.len()))\\n\\n .collect::<Vec<_>>()\\n\\n .windows(2)\\n\\n .map(|pair| {\\n\",\n \"file_path\": \"2021/19_beacon-scanner/src/main.rs\",\n \"rank\": 16,\n \"score\": 163409.16499618354\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Input {\\n\\n start: Position,\\n\\n end: Position,\\n\\n n_rows: usize,\\n\\n n_columns: usize,\\n\\n map: Vec<Vec<u8>>,\\n\\n}\\n\\n\\n\\nimpl TryFrom<&Vec<String>> for Input {\\n\\n type Error = anyhow::Error;\\n\\n\\n\\n fn try_from(lines: &Vec<String>) -> Result<Self, Self::Error> {\\n\\n if lines.is_empty() {\\n\\n Err(anyhow::anyhow!(\\\"Expected to have at least one row\\\"))\\n\\n } else if lines\\n\\n .iter()\\n\\n .skip(1)\\n\\n .any(|line| lines[0].len() != line.len())\\n\\n {\\n\\n Err(anyhow::anyhow!(\\n\",\n \"file_path\": \"2022/12_hill-climbing-algorithm/src/main.rs\",\n \"rank\": 18,\n \"score\": 161614.76511174836\n },\n {\n \"content\": \"struct Input {\\n\\n cmds: Vec<Cmd>,\\n\\n}\\n\\nimpl TryFrom<&[String]> for Input {\\n\\n type Error = anyhow::Error;\\n\\n fn try_from(lines: &[String]) -> Result<Self, Self::Error> {\\n\\n let mut lines_iter = lines.iter().map(String::as_str).peekable();\\n\\n let mut cmds: Vec<Cmd> = vec![];\\n\\n while lines_iter.peek().is_some() {\\n\\n let cmd = Cmd::from_shell_content(&mut lines_iter, cmds.last().map(Cmd::cwd))?;\\n\\n cmds.push(cmd);\\n\\n }\\n\\n Ok(Self { cmds })\\n\\n }\\n\\n}\\n\\nimpl Input {\\n\\n fn directory_to_size(&self) -> BTreeMap<&Path, usize> {\\n\\n let mut directory_to_size: BTreeMap<&Path, usize> =\\n\\n self.cmds.iter().map(|cmd| (cmd.cwd(), 0)).collect();\\n\\n\\n\",\n \"file_path\": \"2022/07_no-space-left-on-device/src/main.rs\",\n \"rank\": 19,\n \"score\": 161614.76511174836\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Input<'a> {\\n\\n field_to_ranges: HashMap<&'a str, Vec<RangeInclusive<usize>>>,\\n\\n nearby_tickets: Vec<Ticket>,\\n\\n ticket: Ticket,\\n\\n}\\n\\n\\n\\nimpl<'a> From<&'a Vec<String>> for Input<'a> {\\n\\n fn from(lines: &'a Vec<String>) -> Self {\\n\\n let mut lines_iter = lines.iter();\\n\\n\\n\\n let field_to_ranges = lines_iter\\n\\n .by_ref()\\n\\n .take_while(|line| !line.is_empty())\\n\\n .map(|line| {\\n\\n let line_parts: Vec<_> = line.split(\\\": \\\").collect();\\n\\n let field = line_parts[0];\\n\\n let ranges = line_parts[1]\\n\\n .split(\\\" or \\\")\\n\\n .map(|range| {\\n\\n let (start, end) = scan_fmt!(range, \\\"{}-{}\\\", usize, usize).unwrap();\\n\",\n \"file_path\": \"2020/16_ticket-translation/src/main.rs\",\n \"rank\": 20,\n \"score\": 159150.54287603975\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct Input<'a> {\\n\\n allergen_to_ingredients: HashMap<&'a str, HashSet<&'a str>>,\\n\\n ingredients: Vec<&'a str>,\\n\\n}\\n\\n\\n\\nimpl<'a> From<&Vec<&'a str>> for Input<'a> {\\n\\n fn from(lines: &Vec<&'a str>) -> Self {\\n\\n let mut allergen_to_ingredients: HashMap<&'a str, HashSet<&'a str>> = HashMap::new();\\n\\n let mut all_ingredients = Vec::new();\\n\\n\\n\\n for line in lines {\\n\\n let (column_index, _) = line\\n\\n .as_bytes()\\n\\n .iter()\\n\\n .enumerate()\\n\\n .find(|(_, character)| *character == &b'(')\\n\\n .unwrap();\\n\\n let current_ingredients: HashSet<_> = line[..column_index]\\n\\n .split(' ')\\n\\n .filter(|ingredient| !ingredient.is_empty())\\n\",\n \"file_path\": \"2020/21_allergen-assessment/src/main.rs\",\n \"rank\": 21,\n \"score\": 159150.54287603975\n },\n {\n \"content\": \"type BingoNumber = u8; // Using u8 as numbers in the input are in the range 0-99\\n\\n\\n\",\n \"file_path\": \"2021/04_giant-squid/src/main.rs\",\n \"rank\": 22,\n \"score\": 157801.174963204\n },\n {\n \"content\": \"fn part01(line: &str) -> String {\\n\\n let mut game = GameTable::new(\\n\\n line.as_bytes()\\n\\n .iter()\\n\\n .map(|b| (b - b'0') as usize)\\n\\n .collect::<Vec<_>>()\\n\\n .as_slice(),\\n\\n 9,\\n\\n );\\n\\n\\n\\n game.play(100);\\n\\n\\n\\n game.cups_in_string(1)[1..].to_string()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/23_crab-cups/src/main.rs\",\n \"rank\": 23,\n \"score\": 149561.94672182022\n },\n {\n \"content\": \"type BagRules<'a> = Graph<&'a str>;\\n\\n\\n\",\n \"file_path\": \"2020/07_handy-haversacks/src/main.rs\",\n \"rank\": 24,\n \"score\": 146552.6711704515\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct DeterministicDice<const N: u8> {\\n\\n value: u8,\\n\\n roll_count: u16,\\n\\n}\\n\\n\\n\\nimpl<const N: u8> Dice for DeterministicDice<N> {\\n\\n fn roll(&mut self) -> u8 {\\n\\n self.roll_count += 1;\\n\\n let result = self.value + 1;\\n\\n self.value = (self.value + 1) % N;\\n\\n result\\n\\n }\\n\\n\\n\\n fn roll_count(&self) -> u16 {\\n\\n self.roll_count\\n\\n }\\n\\n\\n\\n fn extraction_3_rolls_statistics() -> HashMap<u16, usize> {\\n\\n let mut dice = Self::default();\\n\\n let mut extractions_histogram: HashMap<(u8, u8, u8), usize> = HashMap::new();\\n\",\n \"file_path\": \"2021/21_dirac-dice/src/main.rs\",\n \"rank\": 25,\n \"score\": 146258.41547678533\n },\n {\n \"content\": \"#[derive(Debug, Default)]\\n\\nstruct RandomDice<const N: u8> {\\n\\n roll_count: u16,\\n\\n}\\n\\n\\n\\nimpl<const N: u8> Dice for RandomDice<N> {\\n\\n fn roll(&mut self) -> u8 {\\n\\n self.roll_count += 1;\\n\\n rand::random::<u8>() % N + 1\\n\\n }\\n\\n\\n\\n fn roll_count(&self) -> u16 {\\n\\n self.roll_count\\n\\n }\\n\\n\\n\\n fn extraction_3_rolls_statistics() -> HashMap<u16, usize> {\\n\\n (1..=N)\\n\\n .flat_map(|d1| {\\n\\n (1..=N).flat_map(move |d2| {\\n\\n (1..=N).map(move |d3| u16::from(d1) + u16::from(d2) + u16::from(d3))\\n\\n })\\n\\n })\\n\\n .fold(HashMap::new(), |mut map, value| {\\n\\n *map.entry(value).or_default() += 1;\\n\\n map\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/21_dirac-dice/src/main.rs\",\n \"rank\": 26,\n \"score\": 146258.41547678533\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n input\\n\\n .messages\\n\\n .iter()\\n\\n .filter(|message| input.is_valid(0, message))\\n\\n .count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/19_monster-messages/src/main.rs\",\n \"rank\": 27,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part02(input: &Input) -> usize {\\n\\n let mut cloned_input: Input = input.clone();\\n\\n\\n\\n cloned_input.rules.extend(\\n\\n [\\\"8: 42 | 42 8\\\", \\\"11: 42 31 | 42 11 31\\\"]\\n\\n .iter()\\n\\n .map(|rule_str| Rule::rule_id_and_rule(rule_str)),\\n\\n );\\n\\n\\n\\n cloned_input\\n\\n .messages\\n\\n .iter()\\n\\n .filter(|message| cloned_input.is_valid(0, message))\\n\\n .count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/19_monster-messages/src/main.rs\",\n \"rank\": 28,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part02(input: &Input) -> usize {\\n\\n fn update_possible_fields_per_column<'a>(\\n\\n ticket: &Ticket,\\n\\n input: &Input,\\n\\n possible_fields_per_column: &mut BTreeMap<usize, HashSet<&'a str>>,\\n\\n certanly_allocated_field_names: &mut HashSet<&'a str>,\\n\\n ) {\\n\\n if let Some(possible_columns_for_fields) =\\n\\n ticket.possible_columns_for_fields(&input.field_to_ranges)\\n\\n {\\n\\n for (general_possible_fields, possible_field_for_ticket) in possible_fields_per_column\\n\\n .values_mut()\\n\\n .zip(possible_columns_for_fields.iter())\\n\\n {\\n\\n general_possible_fields.retain(|value| possible_field_for_ticket.contains(value));\\n\\n if general_possible_fields.len() == 1 {\\n\\n certanly_allocated_field_names\\n\\n .insert(*general_possible_fields.iter().next().unwrap());\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"2020/16_ticket-translation/src/main.rs\",\n \"rank\": 29,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part02(input: &Input) -> usize {\\n\\n let mut processed_image = input.base_image.clone();\\n\\n processed_image.apply_image_enhancement_algorithm(&input.image_enhancement_algorithm, 50);\\n\\n processed_image.light_pixels_count()\\n\\n}\\n\\n\\n\\nimpl std::fmt::Display for Image {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n let ranges = &self.ranges;\\n\\n for row_index in ranges.min_row..=ranges.max_row {\\n\\n for column_index in ranges.min_column..=ranges.max_column {\\n\\n write!(\\n\\n f,\\n\\n \\\"{}\\\",\\n\\n if self.is_light(row_index, column_index) {\\n\\n '#'\\n\\n } else {\\n\\n '.'\\n\\n }\\n\\n )?;\\n\\n }\\n\\n writeln!(f)?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/20_trench-map/src/main.rs\",\n \"rank\": 30,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part02(input: &Input) -> usize {\\n\\n let final_occurrences = input.occurrences_after_iterations(40);\\n\\n\\n\\n let min = final_occurrences.values().min().unwrap_or(&0);\\n\\n let max = final_occurrences.values().max().unwrap_or(&usize::MAX);\\n\\n\\n\\n max - min\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/14_extended-polymerization/src/main.rs\",\n \"rank\": 31,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n input\\n\\n .try_merge_all_scanners()\\n\\n .map_or(0, |(merged_scanner, _)| merged_scanner.visible_beacons())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/19_beacon-scanner/src/main.rs\",\n \"rank\": 32,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n let final_occurrences = input.occurrences_after_iterations(10);\\n\\n\\n\\n let min = final_occurrences.values().min().unwrap_or(&0);\\n\\n let max = final_occurrences.values().max().unwrap_or(&usize::MAX);\\n\\n\\n\\n max - min\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/14_extended-polymerization/src/main.rs\",\n \"rank\": 33,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n input\\n\\n .nearby_tickets\\n\\n .iter()\\n\\n .map(|ticket| {\\n\\n ticket\\n\\n .invalid_field_values(&input.field_to_ranges)\\n\\n .iter()\\n\\n .sum::<usize>()\\n\\n })\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/16_ticket-translation/src/main.rs\",\n \"rank\": 34,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n let mut processed_image = input.base_image.clone();\\n\\n processed_image.apply_image_enhancement_algorithm(&input.image_enhancement_algorithm, 2);\\n\\n processed_image.light_pixels_count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/20_trench-map/src/main.rs\",\n \"rank\": 35,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part02(input: &Input) -> usize {\\n\\n input\\n\\n .try_merge_all_scanners()\\n\\n .map_or(0, |(_, scanner_id_to_offset)| {\\n\\n let offsets: HashSet<Point3D> = scanner_id_to_offset.values().cloned().collect();\\n\\n pair_of_values(&offsets)\\n\\n .map(|(offset1, offset2)| offset1.manhattan_distance(offset2))\\n\\n .max()\\n\\n .unwrap_or(0)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/19_beacon-scanner/src/main.rs\",\n \"rank\": 36,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n let ingredients_with_allergene: HashSet<_> =\\n\\n input.allergen_to_ingredients.values().flatten().collect();\\n\\n\\n\\n let ingredients_with_no_allergene_count = input\\n\\n .ingredients\\n\\n .iter()\\n\\n .filter(|ingredient| !ingredients_with_allergene.contains(ingredient))\\n\\n .count();\\n\\n\\n\\n ingredients_with_no_allergene_count\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/21_allergen-assessment/src/main.rs\",\n \"rank\": 37,\n \"score\": 133111.6637042059\n },\n {\n \"content\": \"fn part02(input: &Input) -> usize {\\n\\n let directory_to_size = input.directory_to_size();\\n\\n let space_needed_for_update = 30_000_000;\\n\\n let disk_size = 70_000_000;\\n\\n let space_to_release = directory_to_size[&Path::new(\\\"/\\\")] + space_needed_for_update - disk_size;\\n\\n directory_to_size\\n\\n .values()\\n\\n .filter(|size| size >= &&space_to_release)\\n\\n .min()\\n\\n .copied()\\n\\n .unwrap_or(0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/07_no-space-left-on-device/src/main.rs\",\n \"rank\": 38,\n \"score\": 131711.10540014462\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n input\\n\\n .directory_to_size()\\n\\n .values()\\n\\n .filter(|size| size < &&100_000)\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/07_no-space-left-on-device/src/main.rs\",\n \"rank\": 39,\n \"score\": 131711.10540014462\n },\n {\n \"content\": \"fn part01(input: &Input) -> usize {\\n\\n shortest_path_length(input, &input.start, &input.end).unwrap_or(0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/12_hill-climbing-algorithm/src/main.rs\",\n \"rank\": 40,\n \"score\": 131711.10540014462\n },\n {\n \"content\": \"fn part02(input: &Input) -> usize {\\n\\n input\\n\\n .map\\n\\n .iter()\\n\\n .enumerate()\\n\\n .flat_map(|(row_id, row)| {\\n\\n row.iter()\\n\\n .enumerate()\\n\\n .map(move |(column_id, cell)| (row_id, column_id, cell))\\n\\n })\\n\\n .filter_map(|(row_id, column_id, cell)| {\\n\\n if *cell == b'a' {\\n\\n Some(Position {\\n\\n row: row_id,\\n\\n column: column_id,\\n\\n })\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .filter_map(|start_position| shortest_path_length(input, &start_position, &input.end))\\n\\n .min()\\n\\n .unwrap_or(0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/12_hill-climbing-algorithm/src/main.rs\",\n \"rank\": 41,\n \"score\": 131711.10540014462\n },\n {\n \"content\": \"fn part01(input: &[usize]) -> usize {\\n\\n input\\n\\n .windows(2)\\n\\n .map(|elements| usize::from(elements.last().unwrap() > elements.first().unwrap()))\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/01_sonar-sweep/src/main.rs\",\n \"rank\": 44,\n \"score\": 124163.54655046045\n },\n {\n \"content\": \"fn part01(input: &[usize]) -> usize {\\n\\n game(input, 2_020)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/15_rambunctious-recitation/src/main.rs\",\n \"rank\": 45,\n \"score\": 124163.54655046045\n },\n {\n \"content\": \"fn part02(input: &[usize]) -> usize {\\n\\n input\\n\\n .windows(4)\\n\\n .map(|elements| usize::from(elements.last().unwrap() > elements.first().unwrap()))\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/01_sonar-sweep/src/main.rs\",\n \"rank\": 46,\n \"score\": 124163.54655046045\n },\n {\n \"content\": \"fn part02(input: &[usize]) -> usize {\\n\\n game(input, 30_000_000)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/15_rambunctious-recitation/src/main.rs\",\n \"rank\": 47,\n \"score\": 124163.54655046045\n },\n {\n \"content\": \"fn game(input: &[usize], turns: usize) -> usize {\\n\\n if turns < input.len() {\\n\\n input[turns]\\n\\n } else {\\n\\n let mut values: Vec<usize> = vec![0; turns];\\n\\n let mut value_to_turns: HashMap<usize, CircularBuffer<usize>> = HashMap::new();\\n\\n\\n\\n macro_rules! play {\\n\\n ($turn:expr, $value: expr) => {\\n\\n values[$turn] = $value;\\n\\n value_to_turns\\n\\n .entry($value)\\n\\n .or_insert_with(|| CircularBuffer::new(2))\\n\\n .add($turn);\\n\\n };\\n\\n }\\n\\n\\n\\n for (turn, value) in input.iter().enumerate() {\\n\\n play!(turn, *value);\\n\\n }\\n\",\n \"file_path\": \"2020/15_rambunctious-recitation/src/main.rs\",\n \"rank\": 48,\n \"score\": 122960.69602155156\n },\n {\n \"content\": \"// Considering the input we should need around 10 bits to represent the number\\n\\n// Even assuming translations we should be able to make it work within 16 bits\\n\\n// Doing this reduces the memory of each point from\\n\\n// 24 bytes (with isize) to 6 bytes (with i16)\\n\\ntype PointInt = i16;\\n\\n\\n\",\n \"file_path\": \"2021/19_beacon-scanner/src/main.rs\",\n \"rank\": 49,\n \"score\": 121910.22561167256\n },\n {\n \"content\": \"fn part01(input: &[InputEntry]) -> usize {\\n\\n input\\n\\n .iter()\\n\\n .filter_map(|entry| entry.digits().ok())\\n\\n .map(|digits| {\\n\\n digits\\n\\n .iter()\\n\\n .filter(|digit| matches!(digit, 1 | 4 | 7 | 8))\\n\\n .count()\\n\\n })\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/08_seven-segment-search/src/main.rs\",\n \"rank\": 50,\n \"score\": 121547.75944330488\n },\n {\n \"content\": \"fn part02(input: &[InputEntry]) -> usize {\\n\\n input\\n\\n .iter()\\n\\n .filter_map(|entry| entry.to_number().ok())\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/08_seven-segment-search/src/main.rs\",\n \"rank\": 51,\n \"score\": 121547.75944330488\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct InputEntry {\\n\\n one_representation: Vec<char>,\\n\\n four_representation: Vec<char>,\\n\\n four_displays: [Vec<char>; 4],\\n\\n}\\n\\n\\n\\nimpl FromStr for InputEntry {\\n\\n type Err = anyhow::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n if let Some((combinations, displays)) = s.split_once('|') {\\n\\n const EMPTY: Vec<char> = vec![];\\n\\n let (one_representation, four_representation) = {\\n\\n let (maybe_one_representation, maybe_four_representation) =\\n\\n combinations.split_whitespace().fold(\\n\\n (None, None),\\n\\n move |(maybe_one_representation, maybe_four_representation), segments| {\\n\\n let values: Vec<char> = segments.chars().collect();\\n\\n\\n\\n match values.len() {\\n\",\n \"file_path\": \"2021/08_seven-segment-search/src/main.rs\",\n \"rank\": 52,\n \"score\": 121382.30933189527\n },\n {\n \"content\": \"fn evaluate_operation_part02(operation_str: &str) -> usize {\\n\\n fn eval_rec(operation: &mut Operation) -> usize {\\n\\n let mut stack = LinkedList::<Token>::new();\\n\\n\\n\\n for token in &mut operation.tokens {\\n\\n // Resolve sub operations\\n\\n if let Token::SubOperation(sub_operation) = token {\\n\\n *token = Token::Literal(eval_rec(sub_operation));\\n\\n }\\n\\n }\\n\\n\\n\\n for token in &operation.tokens {\\n\\n // Resolve additions (have precedence)\\n\\n match token {\\n\\n Token::Literal(n) => {\\n\\n if let Some(last_token) = stack.back() {\\n\\n if last_token == &Token::Add {\\n\\n stack.pop_back(); // Operator\\n\\n if let Some(Token::Literal(previous_n)) = stack.pop_back() {\\n\\n stack.push_back(Token::Literal(previous_n + n));\\n\",\n \"file_path\": \"2020/18_operation-order/src/main.rs\",\n \"rank\": 53,\n \"score\": 121166.84600459505\n },\n {\n \"content\": \"fn evaluate_operation_part01(operation_str: &str) -> usize {\\n\\n fn eval_rec(iter: &mut dyn Iterator<Item = &Token>) -> usize {\\n\\n let mut current_result = 0;\\n\\n let mut algebric_operation = AlgebricOperation::Add;\\n\\n\\n\\n for token in iter {\\n\\n match token {\\n\\n Token::Literal(n) => match algebric_operation {\\n\\n AlgebricOperation::Add => {\\n\\n current_result += n;\\n\\n }\\n\\n AlgebricOperation::Mul => {\\n\\n current_result *= n;\\n\\n }\\n\\n },\\n\\n Token::Add => {\\n\\n algebric_operation = AlgebricOperation::Add;\\n\\n }\\n\\n Token::Mul => {\\n\\n algebric_operation = AlgebricOperation::Mul;\\n\",\n \"file_path\": \"2020/18_operation-order/src/main.rs\",\n \"rank\": 54,\n \"score\": 121166.84600459505\n },\n {\n \"content\": \"type CellId = usize;\\n\\n\\n\",\n \"file_path\": \"2021/12_passage-pathing/src/main.rs\",\n \"rank\": 55,\n \"score\": 120977.33563537356\n },\n {\n \"content\": \"fn shortest_path_length(input: &Input, start: &Position, end: &Position) -> Option<usize> {\\n\\n dijkstra(\\n\\n /* start */ start,\\n\\n /* successors */\\n\\n |position| {\\n\\n let mut successors = vec![];\\n\\n if position.row > 0\\n\\n && input.map[position.row - 1][position.column]\\n\\n <= input.map[position.row][position.column] + 1\\n\\n {\\n\\n // Up is possible\\n\\n successors.push((\\n\\n Position {\\n\\n row: position.row - 1,\\n\\n column: position.column,\\n\\n },\\n\\n 1,\\n\\n ));\\n\\n }\\n\\n if position.row < input.n_rows - 1\\n\",\n \"file_path\": \"2022/12_hill-climbing-algorithm/src/main.rs\",\n \"rank\": 56,\n \"score\": 117321.67224822905\n },\n {\n \"content\": \"#[derive(Clone, Debug, Default)]\\n\\nstruct SparseGrid(HashMap<isize, HashSet<isize>>);\\n\\n\\n\\nimpl SparseGrid {\\n\\n fn rows_range(&self) -> RangeInclusive<isize> {\\n\\n let min_row = *self\\n\\n .0\\n\\n .keys()\\n\\n .min()\\n\\n .expect(\\\"Expected to have at least one row\\\");\\n\\n let max_row = *self\\n\\n .0\\n\\n .keys()\\n\\n .max()\\n\\n .expect(\\\"Expected to have at least one row\\\");\\n\\n min_row..=max_row\\n\\n }\\n\\n\\n\\n fn columns_range(&self) -> RangeInclusive<isize> {\\n\\n let min_columns = *self\\n\\n .0\\n\",\n \"file_path\": \"2021/13_transparent-origami/src/main.rs\",\n \"rank\": 57,\n \"score\": 117314.25010571301\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Range(RangeInclusive<usize>);\\n\\nimpl Deref for Range {\\n\\n type Target = RangeInclusive<usize>;\\n\\n fn deref(&self) -> &Self::Target {\\n\\n &self.0\\n\\n }\\n\\n}\\n\\nimpl From<RangeInclusive<usize>> for Range {\\n\\n fn from(value: RangeInclusive<usize>) -> Self {\\n\\n Self(value)\\n\\n }\\n\\n}\\n\\nimpl Range {\\n\\n fn fully_includes(&self, other: &Range) -> bool {\\n\\n self.contains(other.start()) && self.contains(other.end())\\n\\n }\\n\\n\\n\\n fn overlaps(&self, other: &Range) -> bool {\\n\\n !(self.end() < other.start() || self.start() > other.end())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/04_camp-cleanup/src/main.rs\",\n \"rank\": 58,\n \"score\": 115151.10888357894\n },\n {\n \"content\": \"fn value_in_every_loop(subject: usize) -> impl Iterator<Item = usize> {\\n\\n std::iter::successors(Some(1), move |value| Some((value * subject) % 20_201_227))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/25_combo-breaker/src/main.rs\",\n \"rank\": 59,\n \"score\": 114258.03547540553\n },\n {\n \"content\": \"fn read_lines(filename: &str) -> std::io::Result<Box<dyn Iterator<Item = String>>> {\\n\\n Ok(Box::new(\\n\\n BufReader::new(File::open(filename)?)\\n\\n .lines()\\n\\n .into_iter()\\n\\n .filter_map(Result::ok),\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"helpers/src/lib.rs\",\n \"rank\": 60,\n \"score\": 97432.74297347374\n },\n {\n \"content\": \"/// Retrieve all the unordered pair of values within a given set.\\n\\n///\\n\\n/// NOTES:\\n\\n/// * The following pairs are considered as the same: `(A, B)` is equivalent to `(B, A)`\\n\\n/// * Having values in a set ensures that the pair `(A, A)` is not possible\\n\\nfn pair_of_values<T: PartialOrd>(values: &HashSet<T>) -> impl Iterator<Item = (&T, &T)> {\\n\\n values.iter().flat_map(move |value1| {\\n\\n values.iter().filter_map(move |value2| {\\n\\n if value1 > value2 {\\n\\n Some((value1, value2))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/19_beacon-scanner/src/main.rs\",\n \"rank\": 61,\n \"score\": 94176.96553555112\n },\n {\n \"content\": \"fn part01(input: &Input) -> u64 {\\n\\n let inspections: BTreeSet<_> = number_of_inspections(input, 20, 3)\\n\\n .values()\\n\\n .copied()\\n\\n .collect();\\n\\n inspections.iter().rev().take(2).product()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/11_monkey-in-the-middle/src/main.rs\",\n \"rank\": 62,\n \"score\": 92478.92085594175\n },\n {\n \"content\": \"fn part02(input: &Input) -> String {\\n\\n let mut cloned_input = input.clone();\\n\\n\\n\\n // BTreeMap to avoid explicit sorting <- as it does not change complexity\\n\\n let mut allergen_to_ingredient: BTreeMap<&str, &str> = BTreeMap::new();\\n\\n let mut used_ingredients: HashSet<&str> = HashSet::new();\\n\\n\\n\\n while allergen_to_ingredient.len() != cloned_input.allergen_to_ingredients.len() {\\n\\n for (allergen, ingredients) in &cloned_input.allergen_to_ingredients {\\n\\n if ingredients.len() == 1 && !allergen_to_ingredient.contains_key(allergen) {\\n\\n used_ingredients.extend(ingredients.iter());\\n\\n\\n\\n allergen_to_ingredient.insert(allergen, ingredients.iter().next().unwrap());\\n\\n }\\n\\n }\\n\\n\\n\\n for ingredients in &mut cloned_input.allergen_to_ingredients.values_mut() {\\n\\n ingredients.retain(|ingredient| !used_ingredients.contains(ingredient));\\n\\n }\\n\\n }\\n\\n\\n\\n allergen_to_ingredient\\n\\n .values()\\n\\n .copied()\\n\\n .collect::<Vec<_>>()\\n\\n .join(\\\",\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/21_allergen-assessment/src/main.rs\",\n \"rank\": 63,\n \"score\": 92478.92085594175\n },\n {\n \"content\": \"fn part02(input: &Input) -> u64 {\\n\\n let inspections: BTreeSet<_> = number_of_inspections(input, 10000, 1)\\n\\n .values()\\n\\n .copied()\\n\\n .collect();\\n\\n\\n\\n inspections.iter().rev().take(2).product()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/11_monkey-in-the-middle/src/main.rs\",\n \"rank\": 64,\n \"score\": 92478.92085594175\n },\n {\n \"content\": \"fn part02(inputs: &[usize]) -> usize {\\n\\n calculate_o2_value(inputs, 0) * calculate_co2_value(inputs, 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/03_binary-diagnostic/src/main.rs\",\n \"rank\": 65,\n \"score\": 91470.99733296926\n },\n {\n \"content\": \"fn part01(inputs: &[usize]) -> usize {\\n\\n let rate = inputs.iter().fold(Rate::default(), |mut rate, value| {\\n\\n rate.add_value(*value);\\n\\n rate\\n\\n });\\n\\n rate.gamma_rate() * rate.epsilon_rate()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/03_binary-diagnostic/src/main.rs\",\n \"rank\": 66,\n \"score\": 91470.99733296926\n },\n {\n \"content\": \"fn part01(arrival_time: usize, line_numbers: &[Option<usize>]) -> usize {\\n\\n let earliest_departure_to_line_number: HashMap<usize, &usize> = line_numbers\\n\\n .iter()\\n\\n .filter_map(|maybe_line_number| {\\n\\n maybe_line_number.as_ref().map(|line_number| {\\n\\n match arrival_time.checked_rem(*line_number) {\\n\\n Some(0) => (arrival_time, line_number),\\n\\n Some(value) => (arrival_time - value + line_number, line_number),\\n\\n None => unreachable!(\\\"Not possible value\\\"),\\n\\n }\\n\\n })\\n\\n })\\n\\n .collect();\\n\\n earliest_departure_to_line_number\\n\\n .keys()\\n\\n .min()\\n\\n .map_or(0, |earliest_departure| {\\n\\n let line_number = *earliest_departure_to_line_number[earliest_departure];\\n\\n (earliest_departure - arrival_time) * line_number\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/13_shuttle-search/src/main.rs\",\n \"rank\": 67,\n \"score\": 89889.1025941042\n },\n {\n \"content\": \"fn calculate_o2_value(inputs: &[usize], bit_index: usize) -> usize {\\n\\n if inputs.len() == 1 {\\n\\n inputs[0]\\n\\n } else {\\n\\n let (inputs_with_0_bit, inputs_with_1_bit) = inputs.iter().fold(\\n\\n (vec![], vec![]),\\n\\n |(mut inputs_with_0_bit, mut inputs_with_1_bit), value| {\\n\\n if (*value) & 1 << (NUMBER_OF_BITS - 1 - bit_index) == 0 {\\n\\n inputs_with_0_bit.push(*value);\\n\\n } else {\\n\\n inputs_with_1_bit.push(*value);\\n\\n }\\n\\n (inputs_with_0_bit, inputs_with_1_bit)\\n\\n },\\n\\n );\\n\\n\\n\\n if inputs_with_0_bit.len() > inputs_with_1_bit.len() {\\n\\n calculate_o2_value(&inputs_with_0_bit, bit_index + 1)\\n\\n } else {\\n\\n calculate_o2_value(&inputs_with_1_bit, bit_index + 1)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/03_binary-diagnostic/src/main.rs\",\n \"rank\": 68,\n \"score\": 89763.07599346753\n },\n {\n \"content\": \"fn calculate_co2_value(inputs: &[usize], bit_index: usize) -> usize {\\n\\n if inputs.len() == 1 {\\n\\n inputs[0]\\n\\n } else {\\n\\n let (inputs_with_0_bit, inputs_with_1_bit) = inputs.iter().fold(\\n\\n (vec![], vec![]),\\n\\n |(mut inputs_with_0_bit, mut inputs_with_1_bit), value| {\\n\\n if (*value) & 1 << (NUMBER_OF_BITS - 1 - bit_index) == 0 {\\n\\n inputs_with_0_bit.push(*value);\\n\\n } else {\\n\\n inputs_with_1_bit.push(*value);\\n\\n }\\n\\n (inputs_with_0_bit, inputs_with_1_bit)\\n\\n },\\n\\n );\\n\\n\\n\\n if inputs_with_0_bit.len() > inputs_with_1_bit.len() {\\n\\n calculate_co2_value(&inputs_with_1_bit, bit_index + 1)\\n\\n } else {\\n\\n calculate_co2_value(&inputs_with_0_bit, bit_index + 1)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/03_binary-diagnostic/src/main.rs\",\n \"rank\": 69,\n \"score\": 89763.07599346753\n },\n {\n \"content\": \"fn part02(mut input: Input) -> anyhow::Result<String> {\\n\\n for move_ in input.moves {\\n\\n input.supply_stacks.apply_crate_mover_9001(&move_)?;\\n\\n }\\n\\n Ok(input\\n\\n .supply_stacks\\n\\n .stacks\\n\\n .iter()\\n\\n .filter_map(VecDeque::back)\\n\\n .collect())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/05_supply-stacks/src/main.rs\",\n \"rank\": 70,\n \"score\": 87048.18817725425\n },\n {\n \"content\": \"fn part01(mut input: Input) -> anyhow::Result<String> {\\n\\n for move_ in input.moves {\\n\\n input.supply_stacks.apply_crate_mover_9000(&move_)?;\\n\\n }\\n\\n Ok(input\\n\\n .supply_stacks\\n\\n .stacks\\n\\n .iter()\\n\\n .filter_map(VecDeque::back)\\n\\n .collect())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/05_supply-stacks/src/main.rs\",\n \"rank\": 71,\n \"score\": 87048.18817725425\n },\n {\n \"content\": \"fn part01(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/23_amphipod/src/main.rs\",\n \"rank\": 72,\n \"score\": 83649.94128754122\n },\n {\n \"content\": \"fn part02(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/23_amphipod/src/main.rs\",\n \"rank\": 73,\n \"score\": 83649.94128754122\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct Grid {\\n\\n inner: Vec<Vec<u8>>,\\n\\n rows: usize,\\n\\n columns: usize,\\n\\n}\\n\\n\\n\\nimpl From<Vec<String>> for Grid {\\n\\n fn from(value: Vec<String>) -> Self {\\n\\n let inner: Vec<Vec<u8>> = value\\n\\n .iter()\\n\\n .map(|line| {\\n\\n line.chars()\\n\\n .map(|character| (character as u8) - b'0')\\n\\n .collect()\\n\\n })\\n\\n .collect();\\n\\n let rows = inner.len();\\n\\n let columns = inner.get(0).map_or(0, Vec::len);\\n\\n Self {\\n\\n inner,\\n\",\n \"file_path\": \"2021/15_chiton/src/main.rs\",\n \"rank\": 74,\n \"score\": 82009.25620365994\n },\n {\n \"content\": \"#[derive(Parser, Debug)]\\n\\nstruct Opts {\\n\\n /// Sets a custom input file for the assignment. Passing no value implies the usage of the \\\"official\\\" assignment input.\\n\\n // #[clap(short, long)]\\n\\n input_filename: Option<String>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"helpers/src/lib.rs\",\n \"rank\": 75,\n \"score\": 82009.25620365994\n },\n {\n \"content\": \"fn part01(lines: &[String]) -> usize {\\n\\n let pub_key_1: usize = lines[0].parse().unwrap();\\n\\n let pub_key_2: usize = lines[1].parse().unwrap();\\n\\n\\n\\n let loop_size = value_in_every_loop(7)\\n\\n .take_while(|value| value != &pub_key_1)\\n\\n .count();\\n\\n\\n\\n value_in_every_loop(pub_key_2).nth(loop_size).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/25_combo-breaker/src/main.rs\",\n \"rank\": 76,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part01(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/25_sea-cucumber/src/main.rs\",\n \"rank\": 77,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(lines: &[String]) -> usize {\\n\\n let (_, score) = RecursiveCombat::from(lines).play();\\n\\n score\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/22_crab-combat/src/main.rs\",\n \"rank\": 78,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part01(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/13_distress-signal/src/main.rs\",\n \"rank\": 79,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part01(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/20_jurassic-jigsaw/src/main.rs\",\n \"rank\": 80,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/25_sea-cucumber/src/main.rs\",\n \"rank\": 81,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/20_jurassic-jigsaw/src/main.rs\",\n \"rank\": 82,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/13_distress-signal/src/main.rs\",\n \"rank\": 83,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(lines: &[String]) -> usize {\\n\\n lines\\n\\n .iter()\\n\\n .map(|line| evaluate_operation_part02(line))\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/18_operation-order/src/main.rs\",\n \"rank\": 84,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/22_reactor-reboot/src/main.rs\",\n \"rank\": 85,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/25_combo-breaker/src/main.rs\",\n \"rank\": 86,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part01(_lines: &[String]) -> usize {\\n\\n 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2021/22_reactor-reboot/src/main.rs\",\n \"rank\": 87,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part02(lines: &[String]) -> usize {\\n\\n lines\\n\\n .iter()\\n\\n .filter(|line| {\\n\\n let (first_index, second_index, character, password) =\\n\\n scan_fmt!(line, \\\"{}-{} {}: {}\\\", usize, usize, char, String).unwrap();\\n\\n PasswordPolicyPart2 {\\n\\n indexes: [first_index, second_index],\\n\\n character,\\n\\n }\\n\\n .is_password_good(&password)\\n\\n })\\n\\n .count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/02_password-philosophy/src/main.rs\",\n \"rank\": 88,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part01(lines: &[String]) -> usize {\\n\\n lines\\n\\n .iter()\\n\\n .filter(|line| {\\n\\n let (min, max, character, password) =\\n\\n scan_fmt!(line, \\\"{}-{} {}: {}\\\", usize, usize, char, String).unwrap();\\n\\n PasswordPolicyPart1 {\\n\\n min,\\n\\n max,\\n\\n character,\\n\\n }\\n\\n .is_password_good(&password)\\n\\n })\\n\\n .count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/02_password-philosophy/src/main.rs\",\n \"rank\": 89,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part01(lines: &[String]) -> usize {\\n\\n let (_, score) = CrabCombat::from(lines).play();\\n\\n score\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/22_crab-combat/src/main.rs\",\n \"rank\": 90,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"fn part01(lines: &[String]) -> usize {\\n\\n lines\\n\\n .iter()\\n\\n .map(|line| evaluate_operation_part01(line))\\n\\n .sum()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2020/18_operation-order/src/main.rs\",\n \"rank\": 91,\n \"score\": 81999.49356542644\n },\n {\n \"content\": \"#[derive(Clone, Debug, Eq, PartialEq)]\\n\\nstruct Scanner {\\n\\n id: ScannerId,\\n\\n beacons: HashSet<Point3D>,\\n\\n point_distances: HashMap<(Point3D, Point3D), Point3D>,\\n\\n known_distances: HashSet<Point3D>,\\n\\n}\\n\\n\\n\\nimpl TryFrom<&[String]> for Scanner {\\n\\n type Error = anyhow::Error;\\n\\n\\n\\n fn try_from(lines: &[String]) -> Result<Self, Self::Error> {\\n\\n anyhow::ensure!(lines.len() > 1);\\n\\n let id = ScannerId(scan_fmt!(&lines[0], \\\"--- scanner {} ---\\\", u8)?);\\n\\n let beacons: HashSet<Point3D> = lines[1..]\\n\\n .iter()\\n\\n .map(|line| line.parse())\\n\\n .collect::<Result<_, _>>()?;\\n\\n\\n\\n Ok(Self::new(id, beacons))\\n\\n }\\n\",\n \"file_path\": \"2021/19_beacon-scanner/src/main.rs\",\n \"rank\": 92,\n \"score\": 81082.0573267905\n },\n {\n \"content\": \"#[derive(Clone, Copy, Debug, Default, Eq, Ord, PartialEq, PartialOrd)]\\n\\nstruct Position {\\n\\n row: i32,\\n\\n column: i32,\\n\\n}\\n\\n\\n\\nimpl Position {\\n\\n fn apply(&mut self, direction: Direction) {\\n\\n match direction {\\n\\n Direction::Up => self.row -= 1,\\n\\n Direction::Right => self.column += 1,\\n\\n Direction::Down => self.row += 1,\\n\\n Direction::Left => self.column -= 1,\\n\\n Direction::UpRight => {\\n\\n self.apply(Direction::Up);\\n\\n self.apply(Direction::Right);\\n\\n }\\n\\n Direction::UpLeft => {\\n\\n self.apply(Direction::Up);\\n\\n self.apply(Direction::Left);\\n\\n }\\n\",\n \"file_path\": \"2022/09_rope-bridge/src/main.rs\",\n \"rank\": 93,\n \"score\": 81081.90633254332\n },\n {\n \"content\": \"#[derive(Clone, Debug, PartialEq)]\\n\\nstruct Operation {\\n\\n tokens: Vec<Token>,\\n\\n}\\n\\n\\n\\nimpl FromStr for Operation {\\n\\n type Err = ();\\n\\n\\n\\n fn from_str(value: &str) -> Result<Self, Self::Err> {\\n\\n Ok(Self::from(&mut value.chars().peekable()))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<I: Iterator<Item = char>> From<&mut Peekable<I>> for Operation {\\n\\n fn from(value: &mut Peekable<I>) -> Self {\\n\\n struct ExpressionInteration<'a, T: Iterator<Item = char>> {\\n\\n input_characters: &'a mut Peekable<T>,\\n\\n }\\n\\n\\n\\n impl<T: Iterator<Item = char>> Iterator for ExpressionInteration<'_, T> {\\n\\n type Item = Token;\\n\",\n \"file_path\": \"2020/18_operation-order/src/main.rs\",\n \"rank\": 94,\n \"score\": 81081.36165213841\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Rucksack {\\n\\n first_compartment: BTreeSet<u8>,\\n\\n second_compartment: BTreeSet<u8>,\\n\\n}\\n\\n\\n\\nimpl FromStr for Rucksack {\\n\\n type Err = anyhow::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n if s.len() % 2 == 0 {\\n\\n let first_compartment = s[..s.len() / 2].bytes().collect();\\n\\n let second_compartment = s[s.len() / 2..].bytes().collect();\\n\\n Ok(Self {\\n\\n first_compartment,\\n\\n second_compartment,\\n\\n })\\n\\n } else {\\n\\n Err(anyhow::anyhow!(\\n\\n \\\"Not even number of elements ({}) in {}\\\",\\n\\n s.len(),\\n\\n s\\n\\n ))\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/03_rucksack-reorganization/src/main.rs\",\n \"rank\": 95,\n \"score\": 81076.69519224131\n },\n {\n \"content\": \"// Game is compressed as much as possible such that it would not cause\\n\\n// memory problems as we will store many\\n\\nstruct Game {\\n\\n is_player1_round: bool,\\n\\n // Positions are between 1 and 10, hence 8 bits are sufficient\\n\\n player1_position: u8,\\n\\n player2_position: u8,\\n\\n // Scores are up to 1000 for part 1 and 21 for part2,\\n\\n // hence 11 bits are sufficient with some margin\\n\\n // as there are no 11 bits integers we're using the closer\\n\\n // one (16 bits)\\n\\n player1_score: u16,\\n\\n player2_score: u16,\\n\\n}\\n\\n\\n\\nimpl TryFrom<Vec<String>> for Game {\\n\\n type Error = anyhow::Error;\\n\\n\\n\\n fn try_from(lines: Vec<String>) -> Result<Self, Self::Error> {\\n\\n anyhow::ensure!(lines.len() == 2);\\n\\n let player1_position = scan_fmt!(&lines[0], \\\"Player 1 starting position: {}\\\", u8)?;\\n\\n let player2_position = scan_fmt!(&lines[1], \\\"Player 2 starting position: {}\\\", u8)?;\\n\",\n \"file_path\": \"2021/21_dirac-dice/src/main.rs\",\n \"rank\": 96,\n \"score\": 81076.69519224131\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Passport {\\n\\n fields: HashMap<String, String>,\\n\\n}\\n\\n\\n\\nimpl Passport {\\n\\n const REQUIRED_FIELDS: [&'static str; 7] = [\\\"byr\\\", \\\"iyr\\\", \\\"eyr\\\", \\\"hgt\\\", \\\"hcl\\\", \\\"ecl\\\", \\\"pid\\\"];\\n\\n\\n\\n fn is_field_valid(&self, field_name: &str) -> Option<()> {\\n\\n fn is_in_range(value: i32, min: i32, max: i32) -> Option<()> {\\n\\n if value >= min && value <= max {\\n\\n Some(())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n fn is_integer_in_range(value: &str, min: i32, max: i32) -> Option<()> {\\n\\n is_in_range(value.parse::<i32>().ok()?, min, max)\\n\\n }\\n\\n\\n\\n let field_value = self.fields.get(field_name)?;\\n\",\n \"file_path\": \"2020/04_passport-processing/src/main.rs\",\n \"rank\": 97,\n \"score\": 81076.69519224131\n },\n {\n \"content\": \"#[derive(Clone, Debug)]\\n\\nstruct Move {\\n\\n quantity: usize,\\n\\n src: usize,\\n\\n dst: usize,\\n\\n}\\n\\nimpl FromStr for Move {\\n\\n type Err = anyhow::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n let (quantity, src, dst) = scan_fmt!(s, \\\"move {} from {} to {}\\\", usize, usize, usize)?;\\n\\n Ok(Self { quantity, src, dst })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/05_supply-stacks/src/main.rs\",\n \"rank\": 98,\n \"score\": 81076.69519224131\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Assignment {\\n\\n first: Range,\\n\\n second: Range,\\n\\n}\\n\\nimpl FromStr for Assignment {\\n\\n type Err = anyhow::Error;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n let (first_start, first_end, second_start, second_end) =\\n\\n scan_fmt!(s, \\\"{}-{},{}-{}\\\", usize, usize, usize, usize)?;\\n\\n Ok(Self {\\n\\n first: (first_start..=first_end).into(),\\n\\n second: (second_start..=second_end).into(),\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"2022/04_camp-cleanup/src/main.rs\",\n \"rank\": 99,\n \"score\": 81076.69519224131\n }\n]","isConversational":false}}},{"rowIdx":2987,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/connectivity/network/tests/dhcp_interop/dhcp_validity/src/lib.rs"},"repo_name":{"kind":"string","value":"EnderNightLord-ChromeBook/fuchsia-pine64-pinephone"},"commit":{"kind":"string","value":"05e2c059b57b6217089090a0315971d1735ecf57"},"file_code":{"kind":"string","value":"\n\nuse {\n anyhow::{format_err, Context as _, Error},\n fidl_fuchsia_net as fnet, fidl_fuchsia_net_dhcpv6 as fdhcpv6,\n fidl_fuchsia_net_interfaces as finterfaces, fidl_fuchsia_net_name as fnetname,\n fidl_fuchsia_net_stack as fstack,\n fidl_fuchsia_net_stack_ext::FidlReturn as _,\n fidl_fuchsia_netemul_guest::{\n CommandListenerMarker, GuestDiscoveryMarker, GuestInteractionMarker,\n },\n fuchsia_async::TimeoutExt as _,\n fuchsia_component::client,\n netemul_guest_lib::wait_for_command_completion,\n std::time::Duration,\n};\n\npub async fn configure_dhcp_server(guest_name: &str, command_to_run: &str) -> Result<(), Error> {\n \n let mut env = vec![];\n let guest_discovery_service = client::connect_to_service::<GuestDiscoveryMarker>()?;\n let (gis, gis_ch) = fidl::endpoints::create_proxy::<GuestInteractionMarker>()?;\n let () = guest_discovery_service.get_guest(None, guest_name, gis_ch)?;\n\n let (client_proxy, server_end) = fidl::endpoints::create_proxy::<CommandListenerMarker>()?;\n\n gis.execute_command(command_to_run, &mut env.iter_mut(), None, None, None, server_end)?;\n\n \n wait_for_command_completion(client_proxy.take_event_stream(), None).await\n}\n\npub async fn verify_v4_addr_present(addr: fnet::IpAddress, timeout: Duration) -> Result<(), Error> {\n let interface_state = client::connect_to_service::<finterfaces::StateMarker>()?;\n let mut if_map = std::collections::HashMap::new();\n fidl_fuchsia_net_interfaces_ext::wait_interface(\n fidl_fuchsia_net_interfaces_ext::event_stream_from_state(&interface_state)?,\n &mut if_map,\n |if_map| {\n if_map\n .iter()\n .filter_map(|(_, properties)| properties.addresses.as_ref())\n .flatten()\n .find_map(|a| if a.addr?.addr == addr { Some(()) } else { None })\n },\n )\n .on_timeout(timeout, || Err(anyhow::anyhow!(\"timed out\")))\n .await\n .map_err(|e| {\n e.context(format!(\n \"DHCPv4 client got unexpected addresses: {}, address missing: {:?}\",\n if_map.iter().fold(String::from(\"addresses present:\"), |s, (id, properties)| {\n s + &format!(\" {:?}: {:?}\", id, properties.addresses)\n }),\n addr\n ))\n })\n}\n\npub async fn verify_v6_dns_servers(\n interface_id: u64,\n want_dns_servers: Vec<fnetname::DnsServer_>,\n) -> Result<(), Error> {\n let stack = client::connect_to_service::<fstack::StackMarker>()\n .context(\"connecting to stack service\")?;\n let info = stack\n .get_interface_info(interface_id)\n .await\n .squash_result()\n .context(\"getting interface info\")?;\n\n let addr = info\n .properties\n .addresses\n .into_iter()\n .find_map(|addr: fnet::Subnet| match addr.addr {\n fnet::IpAddress::Ipv4(_addr) => None,\n fnet::IpAddress::Ipv6(addr) => {\n \n \n \n \n if addr.addr[..8] == [0xfe, 0x80, 0, 0, 0, 0, 0, 0] {\n Some(addr)\n } else {\n None\n }\n }\n })\n .ok_or(format_err!(\"no addresses found to start DHCPv6 client on\"))?;\n\n let provider = client::connect_to_service::<fdhcpv6::ClientProviderMarker>()\n .context(\"connecting to DHCPv6 client\")?;\n\n let (client_end, server_end) = fidl::endpoints::create_endpoints::<fdhcpv6::ClientMarker>()\n .context(\"creating DHCPv6 client channel\")?;\n let () = provider.new_client(\n fdhcpv6::NewClientParams {\n interface_id: Some(interface_id),\n address: Some(fnet::Ipv6SocketAddress {\n address: addr,\n port: fdhcpv6::DEFAULT_CLIENT_PORT,\n zone_index: interface_id,\n }),\n models: Some(fdhcpv6::OperationalModels {\n stateless: Some(fdhcpv6::Stateless {\n options_to_request: Some(vec![fdhcpv6::RequestableOptionCode::DnsServers]),\n }),\n }),\n },\n server_end,\n )?;\n let client_proxy = client_end.into_proxy().context(\"getting client proxy from channel\")?;\n\n let got_dns_servers = client_proxy.watch_servers().await.context(\"watching DNS servers\")?;\n if got_dns_servers == want_dns_servers {\n Ok(())\n } else {\n Err(format_err!(\n \"DHCPv6 client received unexpected DNS servers:\\ngot dns servers: {:?}\\n, want dns servers: {:?}\\n\",\n got_dns_servers,\n want_dns_servers\n ))\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse {\n anyhow::{format_err, Context as _, Error},\n fidl_fuchsia_net as fnet, fidl_fuchsia_net_dhcpv6 as fdhcpv6,\n fidl_fuchsia_net_interfaces as finterfaces, fidl_fuchsia_net_name as fnetname,\n fidl_fuchsia_net_stack as fstack,\n fidl_fuchsia_net_stack_ext::FidlReturn as _,\n fidl_fuchsia_netemul_guest::{\n CommandListenerMarker, GuestDiscoveryMarker, GuestInteractionMarker,\n },\n fuchsia_async::TimeoutExt as _,\n fuchsia_component::client,\n netemul_guest_lib::wait_for_command_completion,\n std::time::Duration,\n};\n\npub async fn configure_dhcp_server(guest_name: &str, command_to_run: &str) -> Result<(), Error> {\n \n let mut env = vec![];\n let guest_discovery_service = client::connect_to_service::<GuestDiscoveryMarker>()?;\n let (gis, gis_ch) = fidl::endpoints::create_proxy::<GuestInteractionMarker>()?;\n let () = guest_discovery_service.get_guest(None, guest_name, gis_ch)?;\n\n let (client_proxy, server_end) = fidl::endpoints::create_proxy::<CommandListenerMarker>()?;\n\n gis.execute_command(command_to_run, &mut env.iter_mut(), None, None, None, server_end)?;\n\n \n wait_for_command_completion(client_proxy.take_event_stream(), None).await\n}\n\n"},"suffix":{"kind":"string","value":"\n\npub async fn verify_v6_dns_servers(\n interface_id: u64,\n want_dns_servers: Vec<fnetname::DnsServer_>,\n) -> Result<(), Error> {\n let stack = client::connect_to_service::<fstack::StackMarker>()\n .context(\"connecting to stack service\")?;\n let info = stack\n .get_interface_info(interface_id)\n .await\n .squash_result()\n .context(\"getting interface info\")?;\n\n let addr = info\n .properties\n .addresses\n .into_iter()\n .find_map(|addr: fnet::Subnet| match addr.addr {\n fnet::IpAddress::Ipv4(_addr) => None,\n fnet::IpAddress::Ipv6(addr) => {\n \n \n \n \n if addr.addr[..8] == [0xfe, 0x80, 0, 0, 0, 0, 0, 0] {\n Some(addr)\n } else {\n None\n }\n }\n })\n .ok_or(format_err!(\"no addresses found to start DHCPv6 client on\"))?;\n\n let provider = client::connect_to_service::<fdhcpv6::ClientProviderMarker>()\n .context(\"connecting to DHCPv6 client\")?;\n\n let (client_end, server_end) = fidl::endpoints::create_endpoints::<fdhcpv6::ClientMarker>()\n .context(\"creating DHCPv6 client channel\")?;\n let () = provider.new_client(\n fdhcpv6::NewClientParams {\n interface_id: Some(interface_id),\n address: Some(fnet::Ipv6SocketAddress {\n address: addr,\n port: fdhcpv6::DEFAULT_CLIENT_PORT,\n zone_index: interface_id,\n }),\n models: Some(fdhcpv6::OperationalModels {\n stateless: Some(fdhcpv6::Stateless {\n options_to_request: Some(vec![fdhcpv6::RequestableOptionCode::DnsServers]),\n }),\n }),\n },\n server_end,\n )?;\n let client_proxy = client_end.into_proxy().context(\"getting client proxy from channel\")?;\n\n let got_dns_servers = client_proxy.watch_servers().await.context(\"watching DNS servers\")?;\n if got_dns_servers == want_dns_servers {\n Ok(())\n } else {\n Err(format_err!(\n \"DHCPv6 client received unexpected DNS servers:\\ngot dns servers: {:?}\\n, want dns servers: {:?}\\n\",\n got_dns_servers,\n want_dns_servers\n ))\n }\n}\n"},"middle":{"kind":"string","value":"pub async fn verify_v4_addr_present(addr: fnet::IpAddress, timeout: Duration) -> Result<(), Error> {\n let interface_state = client::connect_to_service::<finterfaces::StateMarker>()?;\n let mut if_map = std::collections::HashMap::new();\n fidl_fuchsia_net_interfaces_ext::wait_interface(\n fidl_fuchsia_net_interfaces_ext::event_stream_from_state(&interface_state)?,\n &mut if_map,\n |if_map| {\n if_map\n .iter()\n .filter_map(|(_, properties)| properties.addresses.as_ref())\n .flatten()\n .find_map(|a| if a.addr?.addr == addr { Some(()) } else { None })\n },\n )\n .on_timeout(timeout, || Err(anyhow::anyhow!(\"timed out\")))\n .await\n .map_err(|e| {\n e.context(format!(\n \"DHCPv4 client got unexpected addresses: {}, address missing: {:?}\",\n if_map.iter().fold(String::from(\"addresses present:\"), |s, (id, properties)| {\n s + &format!(\" {:?}: {:?}\", id, properties.addresses)\n }),\n addr\n ))\n })\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":2988,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/csv2json/mod.rs"},"repo_name":{"kind":"string","value":"perzanko/csv2json"},"commit":{"kind":"string","value":"aae4c50856f73fc0f88450dd2f38ad8fc6ffaeae"},"file_code":{"kind":"string","value":"extern crate serde_json;\n\nuse std::collections::HashMap;\nuse std::env;\nuse std::fs::File;\nuse std::io;\nuse std::io::prelude::*;\nuse std::process;\nuse std::time::Instant;\n\ntype Lines = Vec<String>;\ntype Nav = String;\ntype NavKeys = Vec<String>;\ntype Args = Vec<String>;\ntype Rows = Vec<HashMap<String, String>>;\ntype Hash = HashMap<String, String>;\n\npub fn new() {\n let start_time = Instant::now();\n let (input_file, output_file) = parse_args(&env::args().collect::<Args>());\n\n if is_str_empty(&input_file) || is_str_empty(&output_file) {\n show_help();\n process::exit(0x0100);\n }\n\n let nav_with_lines: (Nav, Lines) = read_file(&input_file).unwrap();\n let nav: NavKeys = fetch_keys(&nav_with_lines.0);\n let rows: Rows = generate_rows(&nav_with_lines.1, &nav);\n let json = serde_json::to_string(&rows).unwrap();\n\n match write_file(&output_file, &json) {\n Ok(()) => println!(\"Ok, done! - {}\", output_file),\n Err(err) => println!(\"Something went wrong. {}\", err),\n };\n\n println!(\"Rows: {}\", rows.len());\n println!(\"Elapsed: {} ms\", get_elapsed_time(start_time));\n}\n\nfn parse_args(args: &Args) -> (String, String) {\n let mut input_file = String::new();\n let mut output_file = String::new();\n let mut args: Args = args.clone();\n args.remove(0);\n args.chunks(2).for_each(|x| match x[0].as_ref() {\n \"--input\" => {\n input_file = x[1].clone();\n }\n \"-i\" => {\n input_file = x[1].clone();\n }\n \"--output\" => {\n output_file = x[1].clone();\n }\n \"-o\" => {\n output_file = x[1].clone();\n }\n _ => {}\n });\n\n (input_file, output_file)\n}\n\nfn read_file(file_path: &String) -> Result<(Nav, Lines), io::Error> {\n let file = File::open(file_path)?;\n let buf_reader = io::BufReader::new(file);\n let mut lines = Vec::new();\n let mut nav = String::new();\n for (i, line) in buf_reader.lines().enumerate() {\n let line = line.unwrap();\n if i == 0 {\n nav = line\n } else {\n lines.push(line)\n }\n }\n Ok((nav, lines))\n}\n\nfn write_file(file_path: &String, data: &String) -> Result<(), io::Error> {\n let mut file = File::create(file_path)?;\n file.write_all(&data.as_bytes())?;\n Ok(())\n}\n\nfn fetch_keys(keys_str: &String) -> NavKeys {\n let mut i: i16 = -1;\n keys_str\n .split(\",\")\n .collect::<Vec<&str>>()\n .into_iter()\n .map(|key| {\n i += 1;\n String::from(key)\n })\n .collect()\n}\n\nfn generate_rows(lines: &Lines, nav: &NavKeys) -> Vec<Hash> {\n lines\n .into_iter()\n .map(|line| {\n let mut hash: HashMap<String, String> = HashMap::new();\n let mut i = 0;\n let nav = nav;\n line.split(\",\")\n .collect::<Vec<&str>>()\n .into_iter()\n .for_each(|x| {\n i += 1;\n hash.insert(nav[i - 1].clone(), String::from(x));\n });\n return hash;\n })\n .collect()\n}\n\nfn show_help() {\n print!(\n \"\n Created by perzanko\n ----\n .o88b. .d8888. db db .d888b. d88b .d8888. .d88b. d8b db \nd8P Y8 88' YP 88 88 VP `8D `8P' 88' YP .8P Y8. 888o 88 \n8P `8bo. Y8 8P odD' 88 `8bo. 88 88 88V8o 88 \n8b `Y8b. `8b d8' .88' 88 `Y8b. 88 88 88 V8o88 \nY8b d8 db 8D `8bd8' j88. db. 88 db 8D `8b d8' 88 V888 \n `Y88P' `8888Y' YP 888888D Y8888P `8888Y' `Y88P' VP V8P \n \nThis tool provides simple and efficient csv to json conversion.\n\nUsage: csv2json --input [path] --output [path]\n\n -h, --help print this help\n -i, --input input path of CSV file\n -o, --output output path of converted JSON\n\n\"\n )\n}\n\nfn is_str_empty(text: &String) -> bool {\n if text.trim().len() == 0 {\n true\n } else {\n false\n }\n}\n\nfn get_elapsed_time(start_time: Instant) -> String {\n let x = start_time.elapsed();\n ((x.as_secs() * 1_000) + (x.subsec_nanos() / 1_000_000) as u64).to_string()\n}\n"},"prefix":{"kind":"string","value":"extern crate serde_json;\n\nuse std::collections::HashMap;\nuse std::env;\nuse std::fs::File;\nuse std::io;\nuse std::io::prelude::*;\nuse std::process;\nuse std::time::Instant;\n\ntype Lines = Vec<String>;\ntype Nav = String;\ntype NavKeys = Vec<String>;\ntype Args = Vec<String>;\ntype Rows = Vec<HashMap<String, String>>;\ntype Hash = HashMap<String, String>;\n\npub fn new() {\n let start_time = Instant::now();\n let (input_file, output_file) = parse_args(&env::args().collect::<Args>());\n\n if is_str_empty(&input_file) || is_str_empty(&output_file) {\n show_help();\n process::exit(0x0100);\n }\n\n let nav_with_lines: (Nav, Lines) = read_file(&input_file).unwrap();\n let nav: NavKeys = fetch_keys(&nav_with_lines.0);\n let rows: Rows = generate_rows(&nav_with_lines.1, &nav);\n let json = serde_json::to_string(&rows).unwrap();\n\n match write_file(&output_file, &json) {\n Ok(()) => println!(\"Ok, done! - {}\", output_file),\n Err(err) => println!(\"Something went wrong. {}\", err),\n };\n\n println!(\"Rows: {}\", rows.len());\n println!(\"Elapsed: {} ms\", get_elapsed_time(start_time));\n}\n\nfn parse_args(args: &Args) -> (String, String) {\n "},"suffix":{"kind":"string","value":"\n\nfn read_file(file_path: &String) -> Result<(Nav, Lines), io::Error> {\n let file = File::open(file_path)?;\n let buf_reader = io::BufReader::new(file);\n let mut lines = Vec::new();\n let mut nav = String::new();\n for (i, line) in buf_reader.lines().enumerate() {\n let line = line.unwrap();\n if i == 0 {\n nav = line\n } else {\n lines.push(line)\n }\n }\n Ok((nav, lines))\n}\n\nfn write_file(file_path: &String, data: &String) -> Result<(), io::Error> {\n let mut file = File::create(file_path)?;\n file.write_all(&data.as_bytes())?;\n Ok(())\n}\n\nfn fetch_keys(keys_str: &String) -> NavKeys {\n let mut i: i16 = -1;\n keys_str\n .split(\",\")\n .collect::<Vec<&str>>()\n .into_iter()\n .map(|key| {\n i += 1;\n String::from(key)\n })\n .collect()\n}\n\nfn generate_rows(lines: &Lines, nav: &NavKeys) -> Vec<Hash> {\n lines\n .into_iter()\n .map(|line| {\n let mut hash: HashMap<String, String> = HashMap::new();\n let mut i = 0;\n let nav = nav;\n line.split(\",\")\n .collect::<Vec<&str>>()\n .into_iter()\n .for_each(|x| {\n i += 1;\n hash.insert(nav[i - 1].clone(), String::from(x));\n });\n return hash;\n })\n .collect()\n}\n\nfn show_help() {\n print!(\n \"\n Created by perzanko\n ----\n .o88b. .d8888. db db .d888b. d88b .d8888. .d88b. d8b db \nd8P Y8 88' YP 88 88 VP `8D `8P' 88' YP .8P Y8. 888o 88 \n8P `8bo. Y8 8P odD' 88 `8bo. 88 88 88V8o 88 \n8b `Y8b. `8b d8' .88' 88 `Y8b. 88 88 88 V8o88 \nY8b d8 db 8D `8bd8' j88. db. 88 db 8D `8b d8' 88 V888 \n `Y88P' `8888Y' YP 888888D Y8888P `8888Y' `Y88P' VP V8P \n \nThis tool provides simple and efficient csv to json conversion.\n\nUsage: csv2json --input [path] --output [path]\n\n -h, --help print this help\n -i, --input input path of CSV file\n -o, --output output path of converted JSON\n\n\"\n )\n}\n\nfn is_str_empty(text: &String) -> bool {\n if text.trim().len() == 0 {\n true\n } else {\n false\n }\n}\n\nfn get_elapsed_time(start_time: Instant) -> String {\n let x = start_time.elapsed();\n ((x.as_secs() * 1_000) + (x.subsec_nanos() / 1_000_000) as u64).to_string()\n}\n"},"middle":{"kind":"string","value":"let mut input_file = String::new();\n let mut output_file = String::new();\n let mut args: Args = args.clone();\n args.remove(0);\n args.chunks(2).for_each(|x| match x[0].as_ref() {\n \"--input\" => {\n input_file = x[1].clone();\n }\n \"-i\" => {\n input_file = x[1].clone();\n }\n \"--output\" => {\n output_file = x[1].clone();\n }\n \"-o\" => {\n output_file = x[1].clone();\n }\n _ => {}\n });\n\n (input_file, output_file)\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"fn main() {\n\n csv2json::new();\n\n}\n","file_path":"src/main.rs","rank":15,"score":25552.07465452124},{"content":"# csv2json\n\n\n\nThis tool provides simple and efficient csv to json converting, written in Rust.\n\n\n\n## Getting Started\n\n\n\nYou need to have the Rust and Cargo installed. Please follow this [instruction](https://www.rust-lang.org/tools/install)\n\n\n\n\n\n### Installing\n\n\n\nIf you want to run the `csv2json`, please run in the project directory:\n\n\n\n```\n\ncargo build --release\n\n```\n\n\n\nAfter this command, you should have a compiled binary already in directory `./target/release/`\n\n\n\nNow please run:\n\n```\n\ntarget/release/csv2json -i [input] -o [output]\n\n```\n\nand that's it!\n\n\n\n## Example\n\n\n\n<img src=\"https://raw.githubusercontent.com/perzanko/csv2json/master/example/example.png\" width=\"500\">\n\n\n\n## Authors\n\n\n\n* **Kacper Perzankowski** - [perzanko](https://github.com/perzanko)\n\n\n\n## License\n\n\n\nThis project is licensed under the MIT License - see the [LICENSE.md](LICENSE.md) file for details\n","file_path":"README.md","rank":17,"score":0.22498081427576033}],"string":"[\n {\n \"content\": \"fn main() {\\n\\n csv2json::new();\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 15,\n \"score\": 25552.07465452124\n },\n {\n \"content\": \"# csv2json\\n\\n\\n\\nThis tool provides simple and efficient csv to json converting, written in Rust.\\n\\n\\n\\n## Getting Started\\n\\n\\n\\nYou need to have the Rust and Cargo installed. Please follow this [instruction](https://www.rust-lang.org/tools/install)\\n\\n\\n\\n\\n\\n### Installing\\n\\n\\n\\nIf you want to run the `csv2json`, please run in the project directory:\\n\\n\\n\\n```\\n\\ncargo build --release\\n\\n```\\n\\n\\n\\nAfter this command, you should have a compiled binary already in directory `./target/release/`\\n\\n\\n\\nNow please run:\\n\\n```\\n\\ntarget/release/csv2json -i [input] -o [output]\\n\\n```\\n\\nand that's it!\\n\\n\\n\\n## Example\\n\\n\\n\\n<img src=\\\"https://raw.githubusercontent.com/perzanko/csv2json/master/example/example.png\\\" width=\\\"500\\\">\\n\\n\\n\\n## Authors\\n\\n\\n\\n* **Kacper Perzankowski** - [perzanko](https://github.com/perzanko)\\n\\n\\n\\n## License\\n\\n\\n\\nThis project is licensed under the MIT License - see the [LICENSE.md](LICENSE.md) file for details\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 17,\n \"score\": 0.22498081427576033\n }\n]","isConversational":false}}},{"rowIdx":2989,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"python/src/lib.rs"},"repo_name":{"kind":"string","value":"kngwyu/rogue-gym"},"commit":{"kind":"string","value":"00de77e6c9f3d2b9ed602f93abb5526c13791ca9"},"file_code":{"kind":"string","value":"#[macro_use]\nextern crate failure;\nextern crate ndarray;\nextern crate numpy;\nextern crate pyo3;\nextern crate rect_iter;\nextern crate rogue_gym_core;\n#[cfg(unix)]\nextern crate rogue_gym_devui;\n\nmod fearures;\nmod state_impls;\nmod thread_impls;\n\nuse fearures::{MessageFlagInner, StatusFlagInner};\nuse ndarray::{Array2, Axis, Zip};\nuse numpy::PyArray3;\nuse pyo3::{\n basic::{PyObjectProtocol, PyObjectReprProtocol, PyObjectStrProtocol},\n exceptions::RuntimeError,\n prelude::*,\n};\nuse rect_iter::{Get2D, GetMut2D, RectRange};\nuse rogue_gym_core::character::player::Status;\nuse rogue_gym_core::dungeon::{Positioned, X, Y};\nuse rogue_gym_core::{error::*, symbol, GameConfig, RunTime};\nuse state_impls::GameStateImpl;\nuse std::collections::HashMap;\nuse std::fmt::Display;\nuse std::str::from_utf8_unchecked;\nuse thread_impls::ThreadConductor;\n\nfn pyresult<T, E: Display>(result: Result<T, E>) -> PyResult<T> {\n pyresult_with(result, \"Error in rogue-gym\")\n}\n\nfn pyresult_with<T, E: Display>(result: Result<T, E>, msg: &str) -> PyResult<T> {\n result.map_err(|e| PyErr::new::<RuntimeError, _>(format!(\"{}: {}\", msg, e)))\n}\n\n#[pyclass]\n#[derive(Clone, Debug, PartialEq)]\nstruct PlayerState {\n map: Vec<Vec<u8>>,\n history: Array2<bool>,\n status: Status,\n symbols: u8,\n message: MessageFlagInner,\n is_terminal: bool,\n}\n\nimpl PlayerState {\n fn new(w: X, h: Y, symbols: u8) -> Self {\n let (w, h) = (w.0 as usize, h.0 as usize);\n PlayerState {\n map: vec![vec![b' '; w]; h],\n history: Array2::from_elem([h, w], false),\n status: Status::default(),\n symbols,\n message: MessageFlagInner::new(),\n is_terminal: false,\n }\n }\n fn reset(&mut self, runtime: &RunTime) -> GameResult<()> {\n self.status = runtime.player_status();\n self.draw_map(runtime)?;\n self.message = MessageFlagInner::new();\n self.is_terminal = false;\n Ok(())\n }\n fn draw_map(&mut self, runtime: &RunTime) -> GameResult<()> {\n self.history = runtime.history(&self.status).unwrap();\n runtime.draw_screen(|Positioned(cd, tile)| -> GameResult<()> {\n *self\n .map\n .try_get_mut_p(cd)\n .into_chained(|| \"in python::GameState::react\")? = tile.to_byte();\n Ok(())\n })\n }\n fn dungeon_str(&self) -> impl Iterator<Item = &str> {\n self.map.iter().map(|v| unsafe { from_utf8_unchecked(v) })\n }\n fn gray_image_with_offset<'py>(\n &self,\n py: Python<'py>,\n offset: usize,\n ) -> PyResult<&'py PyArray3<f32>> {\n let (h, w) = (self.map.len(), self.map[0].len());\n let py_array = PyArray3::zeros(py, [1 + offset, h, w], false);\n RectRange::zero_start(w, h)\n .unwrap()\n .into_iter()\n .for_each(|(x, y)| unsafe {\n let symbol = symbol::tile_to_sym(*self.map.get_xy(x, y)).unwrap();\n *py_array.uget_mut([0, y, x]) = f32::from(symbol) / f32::from(self.symbols);\n });\n Ok(py_array)\n }\n fn symbol_image_with_offset<'py>(\n &self,\n py: Python<'py>,\n offset: usize,\n ) -> PyResult<&'py PyArray3<f32>> {\n let (h, w) = (self.map.len(), self.map[0].len());\n let channels = usize::from(self.symbols);\n let py_array = PyArray3::zeros(py, [channels + offset, h, w], false);\n pyresult(symbol::construct_symbol_map(\n &self.map,\n h,\n w,\n self.symbols - 1,\n |idx| unsafe { py_array.uget_mut(idx) },\n ))?;\n Ok(py_array)\n }\n fn copy_hist(&self, py_array: &PyArray3<f32>, offset: usize) {\n let mut array = py_array.as_array_mut();\n let hist_array = array.index_axis_mut(Axis(0), usize::from(offset));\n Zip::from(hist_array).and(&self.history).apply(|p, &r| {\n *p = if r { 1.0 } else { 0.0 };\n });\n }\n}\n\nimpl<'p> PyObjectReprProtocol<'p> for PlayerState {\n type Success = String;\n type Result = PyResult<String>;\n}\n\nimpl<'p> PyObjectStrProtocol<'p> for PlayerState {\n type Success = String;\n type Result = PyResult<String>;\n}\n\nimpl<'p> PyObjectProtocol<'p> for PlayerState {\n fn __repr__(&'p self) -> <Self as PyObjectReprProtocol>::Result {\n let mut dungeon = self.dungeon_str().fold(String::new(), |mut res, s| {\n res.push_str(s);\n res.push('\\n');\n res\n });\n dungeon.push_str(&format!(\"{}\", self.status));\n Ok(dungeon)\n }\n fn __str__(&'p self) -> <Self as PyObjectStrProtocol>::Result {\n self.__repr__()\n }\n}\n\n#[pymethods]\nimpl PlayerState {\n #[getter]\n fn status(&self) -> PyResult<HashMap<String, u32>> {\n Ok(self\n .status\n .to_dict_vec()\n .into_iter()\n .map(|(s, v)| (s.to_owned(), v))\n .collect())\n }\n #[getter]\n fn dungeon(&self) -> PyResult<Vec<String>> {\n Ok(self.dungeon_str().map(|s| s.to_string()).collect())\n }\n #[getter]\n fn dungeon_level(&self) -> PyResult<u32> {\n Ok(self.status.dungeon_level)\n }\n #[getter]\n fn gold(&self) -> PyResult<u32> {\n Ok(self.status.gold)\n }\n #[getter]\n fn symbols(&self) -> PyResult<usize> {\n Ok(usize::from(self.symbols))\n }\n #[getter]\n fn is_terminal(&self) -> PyResult<bool> {\n Ok(self.is_terminal)\n }\n fn status_vec(&self, flag: u32) -> Vec<i32> {\n let flag = StatusFlagInner(flag);\n flag.to_vector(&self.status)\n }\n fn gray_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.gray_image_with_offset(py, flag.len())?;\n flag.copy_status(&self.status, 1, &mut array.as_array_mut());\n Ok(array)\n }\n fn gray_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.gray_image_with_offset(py, flag.len() + 1)?;\n let offset = flag.copy_status(&self.status, 1, &mut array.as_array_mut());\n self.copy_hist(&array, offset);\n Ok(array)\n }\n \n fn symbol_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.symbol_image_with_offset(py, flag.len())?;\n flag.copy_status(\n &self.status,\n usize::from(self.symbols),\n &mut array.as_array_mut(),\n );\n Ok(array)\n }\n \n fn symbol_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.symbol_image_with_offset(py, flag.len() + 1)?;\n let offset = flag.copy_status(\n &self.status,\n usize::from(self.symbols),\n &mut array.as_array_mut(),\n );\n self.copy_hist(&array, offset);\n Ok(array)\n }\n}\n\n#[pyclass]\nstruct GameState {\n inner: GameStateImpl,\n config: GameConfig,\n}\n\n#[pymethods]\nimpl GameState {\n #[new]\n fn __new__(obj: &PyRawObject, max_steps: usize, config_str: Option<String>) -> PyResult<()> {\n let config = if let Some(cfg) = config_str {\n pyresult_with(GameConfig::from_json(&cfg), \"Failed to parse config\")?\n } else {\n GameConfig::default()\n };\n let inner = pyresult(GameStateImpl::new(config.clone(), max_steps))?;\n obj.init(GameState { inner, config });\n Ok(())\n }\n fn screen_size(&self) -> (i32, i32) {\n (self.config.height, self.config.width)\n }\n fn set_seed(&mut self, seed: u64) -> PyResult<()> {\n self.config.seed = Some(seed as u128);\n Ok(())\n }\n \n fn reset(&mut self) -> PyResult<()> {\n pyresult(self.inner.reset(self.config.clone()))\n }\n \n fn prev(&self) -> PlayerState {\n self.inner.state()\n }\n fn react(&mut self, input: u8) -> PyResult<()> {\n pyresult(self.inner.react(input))\n }\n \n fn dump_history(&self) -> PyResult<String> {\n pyresult_with(\n self.inner.runtime.saved_inputs_as_json(),\n \"Error when getting history\",\n )\n }\n \n fn dump_config(&self) -> PyResult<String> {\n pyresult_with(self.config.to_json(), \"Error when getting config\")\n }\n fn symbols(&self) -> PyResult<usize> {\n Ok(self.inner.symbols())\n }\n}\n\n#[pyclass]\nstruct ParallelGameState {\n conductor: ThreadConductor,\n configs: Vec<GameConfig>,\n symbols: u8,\n}\n\n#[pymethods]\nimpl ParallelGameState {\n #[new]\n fn __new__(\n obj: &PyRawObject,\n py: Python,\n max_steps: usize,\n configs: Vec<String>,\n ) -> PyResult<()> {\n let configs = {\n let mut res = vec![];\n for cfg in configs {\n res.push(pyresult_with(\n GameConfig::from_json(&cfg),\n \"Failed to parse config\",\n )?);\n }\n res\n };\n let symbols = configs[0]\n .symbol_max()\n .expect(\"Failed to get symbol max\")\n .to_byte()\n + 1;\n let cloned = configs.clone();\n let conductor = py.allow_threads(move || ThreadConductor::new(cloned, max_steps));\n let conductor = pyresult(conductor)?;\n obj.init(ParallelGameState {\n conductor,\n configs,\n symbols,\n });\n Ok(())\n }\n fn screen_size(&self) -> (i32, i32) {\n (self.configs[0].height, self.configs[0].width)\n }\n fn symbols(&self) -> PyResult<usize> {\n Ok(usize::from(self.symbols))\n }\n fn seed(&mut self, py: Python, seed: Vec<u128>) -> PyResult<()> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.seed(seed));\n pyresult(res)\n }\n fn states(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.states());\n pyresult(res)\n }\n fn step(&mut self, py: Python, input: Vec<u8>) -> PyResult<Vec<PlayerState>> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.step(input));\n pyresult(res)\n }\n fn reset(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.reset());\n pyresult(res)\n }\n fn close(&mut self, py: Python) -> PyResult<()> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n pyresult(py.allow_threads(move || conductor.close()))\n }\n}\n\n#[cfg(unix)]\n#[pyfunction]\nfn replay(game: &GameState, py: Python, interval_ms: u64) -> PyResult<()> {\n use rogue_gym_devui::show_replay;\n let inputs = game.inner.runtime.saved_inputs().to_vec();\n let config = game.config.clone();\n let res = py.allow_threads(move || show_replay(config, inputs, interval_ms));\n pyresult(res)\n}\n\n#[cfg(unix)]\n#[pyfunction]\nfn play_cli(game: &GameState) -> PyResult<()> {\n use rogue_gym_devui::play_game;\n pyresult(play_game(game.config.clone(), false))?;\n Ok(())\n}\n\n#[pymodule(_rogue_gym)]\nfn init_mod(_py: Python, m: &PyModule) -> PyResult<()> {\n m.add_class::<GameState>()?;\n m.add_class::<PlayerState>()?;\n m.add_class::<ParallelGameState>()?;\n #[cfg(unix)]\n m.add_wrapped(pyo3::wrap_pyfunction!(replay))?;\n #[cfg(unix)]\n m.add_wrapped(pyo3::wrap_pyfunction!(play_cli))?;\n Ok(())\n}\n"},"prefix":{"kind":"string","value":"#[macro_use]\nextern crate failure;\nextern crate ndarray;\nextern crate numpy;\nextern crate pyo3;\nextern crate rect_iter;\nexter"},"suffix":{"kind":"string","value":"sage: MessageFlagInner,\n is_terminal: bool,\n}\n\nimpl PlayerState {\n fn new(w: X, h: Y, symbols: u8) -> Self {\n let (w, h) = (w.0 as usize, h.0 as usize);\n PlayerState {\n map: vec![vec![b' '; w]; h],\n history: Array2::from_elem([h, w], false),\n status: Status::default(),\n symbols,\n message: MessageFlagInner::new(),\n is_terminal: false,\n }\n }\n fn reset(&mut self, runtime: &RunTime) -> GameResult<()> {\n self.status = runtime.player_status();\n self.draw_map(runtime)?;\n self.message = MessageFlagInner::new();\n self.is_terminal = false;\n Ok(())\n }\n fn draw_map(&mut self, runtime: &RunTime) -> GameResult<()> {\n self.history = runtime.history(&self.status).unwrap();\n runtime.draw_screen(|Positioned(cd, tile)| -> GameResult<()> {\n *self\n .map\n .try_get_mut_p(cd)\n .into_chained(|| \"in python::GameState::react\")? = tile.to_byte();\n Ok(())\n })\n }\n fn dungeon_str(&self) -> impl Iterator<Item = &str> {\n self.map.iter().map(|v| unsafe { from_utf8_unchecked(v) })\n }\n fn gray_image_with_offset<'py>(\n &self,\n py: Python<'py>,\n offset: usize,\n ) -> PyResult<&'py PyArray3<f32>> {\n let (h, w) = (self.map.len(), self.map[0].len());\n let py_array = PyArray3::zeros(py, [1 + offset, h, w], false);\n RectRange::zero_start(w, h)\n .unwrap()\n .into_iter()\n .for_each(|(x, y)| unsafe {\n let symbol = symbol::tile_to_sym(*self.map.get_xy(x, y)).unwrap();\n *py_array.uget_mut([0, y, x]) = f32::from(symbol) / f32::from(self.symbols);\n });\n Ok(py_array)\n }\n fn symbol_image_with_offset<'py>(\n &self,\n py: Python<'py>,\n offset: usize,\n ) -> PyResult<&'py PyArray3<f32>> {\n let (h, w) = (self.map.len(), self.map[0].len());\n let channels = usize::from(self.symbols);\n let py_array = PyArray3::zeros(py, [channels + offset, h, w], false);\n pyresult(symbol::construct_symbol_map(\n &self.map,\n h,\n w,\n self.symbols - 1,\n |idx| unsafe { py_array.uget_mut(idx) },\n ))?;\n Ok(py_array)\n }\n fn copy_hist(&self, py_array: &PyArray3<f32>, offset: usize) {\n let mut array = py_array.as_array_mut();\n let hist_array = array.index_axis_mut(Axis(0), usize::from(offset));\n Zip::from(hist_array).and(&self.history).apply(|p, &r| {\n *p = if r { 1.0 } else { 0.0 };\n });\n }\n}\n\nimpl<'p> PyObjectReprProtocol<'p> for PlayerState {\n type Success = String;\n type Result = PyResult<String>;\n}\n\nimpl<'p> PyObjectStrProtocol<'p> for PlayerState {\n type Success = String;\n type Result = PyResult<String>;\n}\n\nimpl<'p> PyObjectProtocol<'p> for PlayerState {\n fn __repr__(&'p self) -> <Self as PyObjectReprProtocol>::Result {\n let mut dungeon = self.dungeon_str().fold(String::new(), |mut res, s| {\n res.push_str(s);\n res.push('\\n');\n res\n });\n dungeon.push_str(&format!(\"{}\", self.status));\n Ok(dungeon)\n }\n fn __str__(&'p self) -> <Self as PyObjectStrProtocol>::Result {\n self.__repr__()\n }\n}\n\n#[pymethods]\nimpl PlayerState {\n #[getter]\n fn status(&self) -> PyResult<HashMap<String, u32>> {\n Ok(self\n .status\n .to_dict_vec()\n .into_iter()\n .map(|(s, v)| (s.to_owned(), v))\n .collect())\n }\n #[getter]\n fn dungeon(&self) -> PyResult<Vec<String>> {\n Ok(self.dungeon_str().map(|s| s.to_string()).collect())\n }\n #[getter]\n fn dungeon_level(&self) -> PyResult<u32> {\n Ok(self.status.dungeon_level)\n }\n #[getter]\n fn gold(&self) -> PyResult<u32> {\n Ok(self.status.gold)\n }\n #[getter]\n fn symbols(&self) -> PyResult<usize> {\n Ok(usize::from(self.symbols))\n }\n #[getter]\n fn is_terminal(&self) -> PyResult<bool> {\n Ok(self.is_terminal)\n }\n fn status_vec(&self, flag: u32) -> Vec<i32> {\n let flag = StatusFlagInner(flag);\n flag.to_vector(&self.status)\n }\n fn gray_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.gray_image_with_offset(py, flag.len())?;\n flag.copy_status(&self.status, 1, &mut array.as_array_mut());\n Ok(array)\n }\n fn gray_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.gray_image_with_offset(py, flag.len() + 1)?;\n let offset = flag.copy_status(&self.status, 1, &mut array.as_array_mut());\n self.copy_hist(&array, offset);\n Ok(array)\n }\n \n fn symbol_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.symbol_image_with_offset(py, flag.len())?;\n flag.copy_status(\n &self.status,\n usize::from(self.symbols),\n &mut array.as_array_mut(),\n );\n Ok(array)\n }\n \n fn symbol_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {\n let (py, flag) = (\n unsafe { Python::assume_gil_acquired() },\n StatusFlagInner::from(flag),\n );\n let array = self.symbol_image_with_offset(py, flag.len() + 1)?;\n let offset = flag.copy_status(\n &self.status,\n usize::from(self.symbols),\n &mut array.as_array_mut(),\n );\n self.copy_hist(&array, offset);\n Ok(array)\n }\n}\n\n#[pyclass]\nstruct GameState {\n inner: GameStateImpl,\n config: GameConfig,\n}\n\n#[pymethods]\nimpl GameState {\n #[new]\n fn __new__(obj: &PyRawObject, max_steps: usize, config_str: Option<String>) -> PyResult<()> {\n let config = if let Some(cfg) = config_str {\n pyresult_with(GameConfig::from_json(&cfg), \"Failed to parse config\")?\n } else {\n GameConfig::default()\n };\n let inner = pyresult(GameStateImpl::new(config.clone(), max_steps))?;\n obj.init(GameState { inner, config });\n Ok(())\n }\n fn screen_size(&self) -> (i32, i32) {\n (self.config.height, self.config.width)\n }\n fn set_seed(&mut self, seed: u64) -> PyResult<()> {\n self.config.seed = Some(seed as u128);\n Ok(())\n }\n \n fn reset(&mut self) -> PyResult<()> {\n pyresult(self.inner.reset(self.config.clone()))\n }\n \n fn prev(&self) -> PlayerState {\n self.inner.state()\n }\n fn react(&mut self, input: u8) -> PyResult<()> {\n pyresult(self.inner.react(input))\n }\n \n fn dump_history(&self) -> PyResult<String> {\n pyresult_with(\n self.inner.runtime.saved_inputs_as_json(),\n \"Error when getting history\",\n )\n }\n \n fn dump_config(&self) -> PyResult<String> {\n pyresult_with(self.config.to_json(), \"Error when getting config\")\n }\n fn symbols(&self) -> PyResult<usize> {\n Ok(self.inner.symbols())\n }\n}\n\n#[pyclass]\nstruct ParallelGameState {\n conductor: ThreadConductor,\n configs: Vec<GameConfig>,\n symbols: u8,\n}\n\n#[pymethods]\nimpl ParallelGameState {\n #[new]\n fn __new__(\n obj: &PyRawObject,\n py: Python,\n max_steps: usize,\n configs: Vec<String>,\n ) -> PyResult<()> {\n let configs = {\n let mut res = vec![];\n for cfg in configs {\n res.push(pyresult_with(\n GameConfig::from_json(&cfg),\n \"Failed to parse config\",\n )?);\n }\n res\n };\n let symbols = configs[0]\n .symbol_max()\n .expect(\"Failed to get symbol max\")\n .to_byte()\n + 1;\n let cloned = configs.clone();\n let conductor = py.allow_threads(move || ThreadConductor::new(cloned, max_steps));\n let conductor = pyresult(conductor)?;\n obj.init(ParallelGameState {\n conductor,\n configs,\n symbols,\n });\n Ok(())\n }\n fn screen_size(&self) -> (i32, i32) {\n (self.configs[0].height, self.configs[0].width)\n }\n fn symbols(&self) -> PyResult<usize> {\n Ok(usize::from(self.symbols))\n }\n fn seed(&mut self, py: Python, seed: Vec<u128>) -> PyResult<()> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.seed(seed));\n pyresult(res)\n }\n fn states(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.states());\n pyresult(res)\n }\n fn step(&mut self, py: Python, input: Vec<u8>) -> PyResult<Vec<PlayerState>> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.step(input));\n pyresult(res)\n }\n fn reset(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n let res = py.allow_threads(move || conductor.reset());\n pyresult(res)\n }\n fn close(&mut self, py: Python) -> PyResult<()> {\n let ParallelGameState {\n ref mut conductor, ..\n } = self;\n pyresult(py.allow_threads(move || conductor.close()))\n }\n}\n\n#[cfg(unix)]\n#[pyfunction]\nfn replay(game: &GameState, py: Python, interval_ms: u64) -> PyResult<()> {\n use rogue_gym_devui::show_replay;\n let inputs = game.inner.runtime.saved_inputs().to_vec();\n let config = game.config.clone();\n let res = py.allow_threads(move || show_replay(config, inputs, interval_ms));\n pyresult(res)\n}\n\n#[cfg(unix)]\n#[pyfunction]\nfn play_cli(game: &GameState) -> PyResult<()> {\n use rogue_gym_devui::play_game;\n pyresult(play_game(game.config.clone(), false))?;\n Ok(())\n}\n\n#[pymodule(_rogue_gym)]\nfn init_mod(_py: Python, m: &PyModule) -> PyResult<()> {\n m.add_class::<GameState>()?;\n m.add_class::<PlayerState>()?;\n m.add_class::<ParallelGameState>()?;\n #[cfg(unix)]\n m.add_wrapped(pyo3::wrap_pyfunction!(replay))?;\n #[cfg(unix)]\n m.add_wrapped(pyo3::wrap_pyfunction!(play_cli))?;\n Ok(())\n}\n"},"middle":{"kind":"string","value":"n crate rogue_gym_core;\n#[cfg(unix)]\nextern crate rogue_gym_devui;\n\nmod fearures;\nmod state_impls;\nmod thread_impls;\n\nuse fearures::{MessageFlagInner, StatusFlagInner};\nuse ndarray::{Array2, Axis, Zip};\nuse numpy::PyArray3;\nuse pyo3::{\n basic::{PyObjectProtocol, PyObjectReprProtocol, PyObjectStrProtocol},\n exceptions::RuntimeError,\n prelude::*,\n};\nuse rect_iter::{Get2D, GetMut2D, RectRange};\nuse rogue_gym_core::character::player::Status;\nuse rogue_gym_core::dungeon::{Positioned, X, Y};\nuse rogue_gym_core::{error::*, symbol, GameConfig, RunTime};\nuse state_impls::GameStateImpl;\nuse std::collections::HashMap;\nuse std::fmt::Display;\nuse std::str::from_utf8_unchecked;\nuse thread_impls::ThreadConductor;\n\nfn pyresult<T, E: Display>(result: Result<T, E>) -> PyResult<T> {\n pyresult_with(result, \"Error in rogue-gym\")\n}\n\nfn pyresult_with<T, E: Display>(result: Result<T, E>, msg: &str) -> PyResult<T> {\n result.map_err(|e| PyErr::new::<RuntimeError, _>(format!(\"{}: {}\", msg, e)))\n}\n\n#[pyclass]\n#[derive(Clone, Debug, PartialEq)]\nstruct PlayerState {\n map: Vec<Vec<u8>>,\n history: Array2<bool>,\n status: Status,\n symbols: u8,\n mes"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"#![cfg_attr(test, feature(test))]\n\n#[macro_use]\n\nextern crate bitflags;\n\n#[macro_use]\n\nextern crate derive_more;\n\n#[macro_use]\n\nextern crate enum_iterator;\n\n#[macro_use]\n\nextern crate failure;\n\nextern crate fixedbitset;\n\nextern crate ndarray;\n\nextern crate num_traits;\n\n#[macro_use]\n\nextern crate log;\n\nextern crate rand;\n\nextern crate rand_xorshift;\n\nextern crate rect_iter;\n\nextern crate regex;\n\n#[macro_use]\n\nextern crate serde;\n","file_path":"core/src/lib.rs","rank":1,"score":15.898894763226801},{"content":"extern crate chrono;\n\nextern crate clap;\n\n#[macro_use]\n\nextern crate failure;\n\nextern crate fern;\n\n#[macro_use]\n\nextern crate log;\n\nextern crate rogue_gym_core;\n\nextern crate rogue_gym_uilib;\n\nextern crate termion;\n\nextern crate tuple_map;\n\n\n\npub mod error;\n\npub mod screen;\n\nuse error::*;\n\nuse rogue_gym_core::input::InputCode;\n\nuse rogue_gym_core::{GameConfig, RunTime};\n\nuse rogue_gym_uilib::{process_reaction, Screen, Transition};\n\nuse screen::{RawTerm, TermScreen};\n\nuse std::io;\n\nuse std::sync::mpsc;\n\nuse std::thread;\n\nuse std::time::Duration;\n\nuse termion::event::Key;\n\nuse termion::input::TermRead;\n\n\n","file_path":"devui/src/lib.rs","rank":2,"score":11.707334038556201},{"content":"extern crate chrono;\n\nextern crate clap;\n\nextern crate fern;\n\nextern crate log;\n\nextern crate rogue_gym_core;\n\nextern crate rogue_gym_devui;\n\nextern crate termion;\n\nextern crate tuple_map;\n\n\n\nuse std::fs::{File, OpenOptions};\n\nuse std::io::prelude::*;\n\n\n\nuse clap::ArgMatches;\n\nuse rogue_gym_core::{json_to_inputs, read_file, GameConfig};\n\nuse rogue_gym_devui::error::*;\n\nuse rogue_gym_devui::{play_game, show_replay};\n\n\n\nconst DEFAULT_INTERVAL_MS: u64 = 500;\n\n\n","file_path":"devui/src/main.rs","rank":3,"score":10.033597415295834},{"content":"extern crate serde_json;\n\nextern crate smallvec;\n\n#[cfg(unix)]\n\nextern crate termion;\n\n#[cfg(feature = \"bench\")]\n\nextern crate test;\n\nextern crate tuple_map;\n\n\n\nmod actions;\n\nuse std::fs::File;\n\nuse std::io::{self, Read};\n\npub mod character;\n\npub mod dungeon;\n\npub mod error;\n\nmod fenwick;\n\npub mod input;\n\npub mod item;\n\nmod rng;\n\nmod smallstr;\n\npub mod symbol;\n","file_path":"core/src/lib.rs","rank":4,"score":9.486697166988257},{"content":"#[macro_use]\n\nextern crate failure;\n\n\n\nmod draw;\n\nmod font;\n\nmod term_image;\n\nmod theme;\n\nuse self::draw::GifEncoder;\n\nuse clap::{self, ArgMatches};\n\nuse rogue_gym_core::{error::*, input::InputCode, json_to_inputs, read_file, GameConfig};\n\nconst UBUNTU_MONO: &[u8; 205748] = include_bytes!(\"../../data/fonts/UbuntuMono-R.ttf\");\n\nuse self::font::FontHandle;\n\nuse self::theme::Theme;\n\n\n","file_path":"act2gif/src/main.rs","rank":5,"score":7.784145151402287},{"content":"use crate::input::{InputCode, Key};\n\nuse failure::{self, Error, Fail};\n\nuse rect_iter::IndexError;\n\nuse serde_json::Error as JsonError;\n\nuse std::error::Error as StdError;\n\nuse std::fmt;\n\n\n\npub type GameResult<T> = Result<T, Error>;\n\n\n","file_path":"core/src/error.rs","rank":6,"score":6.019127580824188},{"content":"//! module for handling actions and do some operations related to multiple modules\n\nuse crate::character::{\n\n fight, player::PlayerEvent, Action, DamageReaction, Enemy, EnemyHandler, Player,\n\n};\n\nuse crate::dungeon::{Direction, Dungeon, DungeonPath};\n\nuse crate::error::*;\n\nuse crate::item::{itembox::Entry as ItemEntry, ItemHandler, ItemToken};\n\nuse crate::ui::UiState;\n\nuse crate::{GameInfo, GameMsg, Reaction};\n\nuse std::iter;\n\nuse std::rc::Rc;\n\n\n\npub(crate) fn process_action(\n\n action: Action,\n\n info: &mut GameInfo,\n\n dungeon: &mut dyn Dungeon,\n\n item: &mut ItemHandler,\n\n player: &mut Player,\n\n enemies: &mut EnemyHandler,\n\n) -> GameResult<(Option<UiState>, Vec<Reaction>)> {\n","file_path":"core/src/actions.rs","rank":7,"score":4.650219826819137},{"content":"use ndarray::{ArrayViewMut, Axis, Ix3};\n\nuse rogue_gym_core::character::player::Status;\n\nuse rogue_gym_core::GameMsg;\n\n\n\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\n\npub(crate) struct MessageFlagInner(pub u32);\n\n\n\n#[rustfmt::skip]\n\nimpl MessageFlagInner {\n\n const HIT_FROM: u32 = 0b000_000_001;\n\n const HIT_TO: u32 = 0b000_000_010;\n\n const MISS_TO: u32 = 0b000_000_100;\n\n const MISS_FROM: u32 = 0b000_001_000;\n\n const KILLED: u32 = 0b000_010_000;\n\n const SECRET_DOOR: u32 = 0b000_100_000;\n\n const NO_DOWNSTAIR: u32 = 0b001_000_000;\n\n}\n\n\n\nimpl MessageFlagInner {\n\n pub fn new() -> Self {\n","file_path":"python/src/fearures.rs","rank":8,"score":4.609263946658296},{"content":" self.steps = 0;\n\n Ok(())\n\n }\n\n pub(crate) fn state(&self) -> PlayerState {\n\n self.state.clone()\n\n }\n\n pub(crate) fn symbols(&self) -> usize {\n\n usize::from(self.state.symbols)\n\n }\n\n pub(crate) fn react(&mut self, input: u8) -> GameResult<()> {\n\n if self.steps > self.max_steps {\n\n return Ok(());\n\n }\n\n let res = self.runtime.react_to_key(Key::Char(input as char))?;\n\n self.state.message.reset();\n\n let mut dead = false;\n\n for reaction in res {\n\n match reaction {\n\n Reaction::Redraw => {\n\n self.state.draw_map(&self.runtime)?;\n","file_path":"python/src/state_impls.rs","rank":9,"score":4.1949236349545425},{"content":"use super::{clamp, DamageReaction, Defense, Dice, Exp, HitPoint, Level, Maxed, Strength};\n\nuse crate::dungeon::{Direction, DungeonPath};\n\nuse crate::error::GameResult;\n\nuse crate::item::{\n\n armor, food::Food, itembox::ItemBox, weapon, InitItem, Item, ItemHandler, ItemKind, ItemToken,\n\n};\n\nuse crate::rng::RngHandle;\n\nuse crate::tile::{Drawable, Tile};\n\nuse smallstr::SmallStr;\n\nuse std::{cmp, fmt};\n\nuse tuple_map::TupleMap2;\n\n\n\n/// Player configuration\n\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\n\npub struct Config {\n\n #[serde(default, flatten)]\n\n pub level: Leveling,\n\n #[serde(default = \"default_hunger_time\")]\n\n pub hunger_time: u32,\n\n #[serde(default = \"default_init_hp\")]\n","file_path":"core/src/character/player.rs","rank":10,"score":4.184789431627651},{"content":"use rogue_gym_core::{\n\n error::GameResult,\n\n input::{Key, KeyMap},\n\n ui::{MordalKind, UiState},\n\n GameConfig, Reaction, RunTime,\n\n};\n\nuse PlayerState;\n\n\n\npub(crate) struct GameStateImpl {\n\n pub(crate) runtime: RunTime,\n\n state: PlayerState,\n\n steps: usize,\n\n max_steps: usize,\n\n}\n\n\n\nunsafe impl Send for GameStateImpl {}\n\n\n\nimpl GameStateImpl {\n\n pub(crate) fn new(config: GameConfig, max_steps: usize) -> GameResult<Self> {\n\n let symbols = config\n","file_path":"python/src/state_impls.rs","rank":11,"score":3.948243568655669},{"content":"use crate::font::FontHandle;\n\nuse crate::term_image::TermImage;\n\nuse crate::theme::Theme;\n\nuse image::gif::{DisposalMethod, Encoder};\n\nuse rogue_gym_core::{error::*, input::InputCode, GameConfig, Reaction};\n\nuse rogue_gym_uilib::process_reaction;\n\nuse std::fs::File;\n\nuse std::io::BufWriter;\n\n\n\npub struct GifEncoder<'a> {\n\n config: GameConfig,\n\n font: FontHandle<'a>,\n\n scale: u32,\n\n theme: Theme,\n\n interval: u32,\n\n}\n\n\n\nimpl<'a> GifEncoder<'a> {\n\n pub fn new(\n\n config: GameConfig,\n","file_path":"act2gif/src/draw.rs","rank":12,"score":3.883004190606571},{"content":" ItemKind::Armor(a) => name == a.name(),\n\n _ => false,\n\n })\n\n }\n\n Ok(())\n\n }\n\n pub fn strength(&self) -> Maxed<Strength> {\n\n self.status.strength\n\n }\n\n pub fn level(&self) -> Level {\n\n self.status.level\n\n }\n\n pub(crate) fn buttle(&mut self) {\n\n self.status.quiet = 0\n\n }\n\n pub(crate) fn turn_passed(&mut self, rng: &mut RngHandle) -> Vec<PlayerEvent> {\n\n let mut res = vec![];\n\n self.status.food_left -= 1;\n\n if self.status.food_left == 0 {\n\n return vec![PlayerEvent::Dead];\n","file_path":"core/src/character/player.rs","rank":13,"score":3.7095141943945813},{"content":" dam_plus: 0.into(),\n\n worth,\n\n launcher,\n\n };\n\n (weapon, attr, num.into())\n\n }\n\n fn name(&self) -> &str {\n\n self.name.as_ref()\n\n }\n\n fn worth(&self) -> crate::item::ItemNum {\n\n self.worth\n\n }\n\n}\n\n\n\npub(crate) fn rogue_init_weapons(vec: &mut Vec<InitItem>) {\n\n ((0, 0, 1, 1), (2, 0, 1, 0), (3, 25, 0, 0)).for_each(|(idx, num_plus, hit_plus, dam_plus)| {\n\n vec.push(InitItem::Weapon {\n\n name: BUILTIN_WEAPONS[idx].name.clone(),\n\n num_plus,\n\n hit_plus,\n","file_path":"core/src/item/weapon.rs","rank":14,"score":3.7095141943945813},{"content":" let enem = self.placed_enemies.remove(&place)?;\n\n enem.run();\n\n self.active_enemies.insert(place, enem);\n\n Some(())\n\n }\n\n pub(crate) fn remove_enemies(&mut self) {\n\n self.active_enemies = BTreeMap::new();\n\n self.placed_enemies = BTreeMap::new();\n\n }\n\n pub(crate) fn move_actives(\n\n &mut self,\n\n player_pos: &DungeonPath,\n\n gold_pos: Option<&DungeonPath>,\n\n dungeon: &mut dyn Dungeon,\n\n ) -> Vec<Attack> {\n\n let mut out = Vec::new();\n\n debug!(\n\n \"[EnemyHandler::move_actives] before: {:?}\",\n\n self.active_enemies\n\n );\n","file_path":"core/src/character/enemies.rs","rank":15,"score":3.502200799279783},{"content":"use super::handler::{Handler, ItemInner, ItemStat};\n\nuse super::{InitItem, Item, ItemAttr, ItemKind, ItemNum};\n\nuse crate::character::{Dice, HitPoint, Level};\n\nuse crate::rng::{Parcent, RngHandle};\n\nuse crate::SmallStr;\n\nuse std::fmt;\n\nuse std::ops::Range;\n\nuse tuple_map::TupleMap3;\n\n\n\n/// Weapon configuration\n\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\n\npub struct Config {\n\n #[serde(default = \"default_weapons\")]\n\n pub weapons: Vec<Preset>,\n\n #[serde(default = \"default_cursed_rate\")]\n\n #[serde(skip_serializing_if = \"is_default_cursed_rate\")]\n\n pub cursed_rate: Parcent,\n\n #[serde(default = \"default_powerup_rate\")]\n\n #[serde(skip_serializing_if = \"is_default_powerup_rate\")]\n\n pub powerup_rate: Parcent,\n","file_path":"core/src/item/weapon.rs","rank":16,"score":3.480437568621258},{"content":" }\n\n if self.notify_hungry() {\n\n res.push(PlayerEvent::Hungry);\n\n }\n\n if self.heal(rng) {\n\n res.push(PlayerEvent::Healed);\n\n }\n\n res\n\n }\n\n pub(crate) fn get_damage(&mut self, damage: HitPoint) -> DamageReaction {\n\n self.status.hp.current = cmp::max(self.status.hp.current - damage, HitPoint(0));\n\n if self.status.hp.current == HitPoint(0) {\n\n DamageReaction::Death\n\n } else {\n\n DamageReaction::None\n\n }\n\n }\n\n pub(crate) fn level_up(&mut self, exp: Exp, rng: &mut RngHandle) -> bool {\n\n self.status.exp += exp;\n\n let diff = self\n","file_path":"core/src/character/player.rs","rank":17,"score":3.4444508543940455},{"content":" DamageReaction::None\n\n }\n\n }\n\n fn run(&self) {\n\n self.running.replace(true);\n\n }\n\n}\n\n\n\nimpl Drawable for Enemy {\n\n fn tile(&self) -> Tile {\n\n self.tile\n\n }\n\n}\n\n\n\npub(crate) struct Attack(Rc<Enemy>);\n\n\n\nimpl Attack {\n\n pub fn enemy(&self) -> &Enemy {\n\n self.0.as_ref()\n\n }\n","file_path":"core/src/character/enemies.rs","rank":18,"score":3.4136157483226337},{"content":"use super::{Damage, Defense, Dice, Enemy, HitPoint, Level, Player, Strength};\n\nuse crate::rng::{Parcent, RngHandle};\n\nuse item::ItemToken;\n\nuse std::iter;\n\n\n","file_path":"core/src/character/fight.rs","rank":19,"score":3.4136157483226337},{"content":" res.push(Reaction::UiTransition(mordal.clone()));\n\n return Ok(Some(mordal));\n\n }\n\n DamageReaction::None => {}\n\n }\n\n }\n\n None => {\n\n res.push(Reaction::Notify(GameMsg::MissFrom(\n\n at.enemy().name().to_owned(),\n\n )));\n\n }\n\n }\n\n }\n\n if did_hit {\n\n res.push(Reaction::StatusUpdated);\n\n }\n\n Ok(None)\n\n}\n\n\n\npub(crate) fn new_level(\n","file_path":"core/src/actions.rs","rank":20,"score":3.048303072370465},{"content":" rng.range(1..level - 6)\n\n } else {\n\n 0\n\n };\n\n if heal > 0 {\n\n self.status.hp.current += HitPoint(heal);\n\n self.status.hp.verify();\n\n self.status.quiet = 0;\n\n true\n\n } else {\n\n false\n\n }\n\n }\n\n fn notify_hungry(&mut self) -> bool {\n\n let hunger = self.config.hunger_time / 10;\n\n self.status.food_left == hunger || self.status.food_left == hunger * 2\n\n }\n\n}\n\n\n\npub(crate) enum PlayerEvent {\n","file_path":"core/src/character/player.rs","rank":21,"score":2.990122708858669},{"content":" };\n\n (armor, ItemAttr::empty(), 1.into())\n\n }\n\n}\n\n\n\nimpl ItemStat for ArmorStatus {\n\n type Item = Armor;\n\n fn appear_rate(&self) -> Parcent {\n\n self.appear_rate\n\n }\n\n fn build(self, _rng: &mut RngHandle) -> (Armor, ItemAttr, ItemNum) {\n\n self.build_inner()\n\n }\n\n fn name(&self) -> &str {\n\n self.name.as_ref()\n\n }\n\n fn worth(&self) -> crate::item::ItemNum {\n\n self.worth\n\n }\n\n}\n","file_path":"core/src/item/armor.rs","rank":22,"score":2.9618574837508596},{"content":" }\n\n pub fn from_path(p: &DungeonPath) -> Self {\n\n Address {\n\n level: p[0] as u32,\n\n cd: Coord::new(p[1], p[2]),\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::{Address, Coord, Direction, DungeonPath, MoveResult, TupleMap2};\n\n use crate::{GameConfig, RunTime};\n\n // tiny dungeon setting\n\n const CONFIG: &str = r#\"\n\n{\n\n \"width\": 32,\n\n \"height\": 16,\n\n \"seed\": 5,\n\n \"dungeon\": {\n","file_path":"core/src/dungeon/rogue/mod.rs","rank":23,"score":2.8801796392791568},{"content":" self.active_enemies.insert(next, enemy);\n\n }\n\n debug!(\n\n \"[EnemyHandler::move_actives] after: {:?}\",\n\n self.active_enemies\n\n );\n\n out\n\n }\n\n pub(crate) fn rng(&mut self) -> &mut RngHandle {\n\n &mut self.rng\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, Eq, PartialEq)]\n\npub struct StaticStatus {\n\n attack: &'static [Dice<HitPoint>],\n\n attr: EnemyAttr,\n\n defense: Defense,\n\n exp: Exp,\n\n gold: ItemNum,\n","file_path":"core/src/character/enemies.rs","rank":24,"score":2.778034777487774},{"content":" self.placed_enemies\n\n .get(&path)\n\n .or_else(|| self.active_enemies.get(&path))\n\n .map(Rc::clone)\n\n }\n\n pub fn activate_area<'a, F>(&mut self, is_in_activation_area: F)\n\n where\n\n F: Fn(&DungeonPath) -> bool,\n\n {\n\n let removes: Vec<_> = self\n\n .placed_enemies\n\n .iter()\n\n .filter(|(p, e)| is_in_activation_area(p) && e.is_mean())\n\n .map(|(p, _)| p.to_owned())\n\n .collect();\n\n for path in removes {\n\n self.activate(path);\n\n }\n\n }\n\n pub(crate) fn activate(&mut self, place: DungeonPath) -> Option<()> {\n","file_path":"core/src/character/enemies.rs","rank":25,"score":2.6828868556917773},{"content":"use fenwick::FenwickSet;\n\nuse num_traits::PrimInt;\n\nuse rand::{\n\n distributions::uniform::SampleUniform, thread_rng, Error as RndError, RngCore, SeedableRng,\n\n};\n\npub(crate) use rand::{seq::SliceRandom, Rng};\n\nuse rand_xorshift::XorShiftRng;\n\nuse std::cmp;\n\nuse std::mem;\n\nuse std::ops::{Bound, Range, RangeBounds};\n\n\n","file_path":"core/src/rng.rs","rank":26,"score":2.637715862046227},{"content":"}\n\n\n\nimpl Enemy {\n\n pub(crate) const STRENGTH: Strength = Strength(10);\n\n pub fn is_mean(&self) -> bool {\n\n self.attr.get().contains(EnemyAttr::MEAN)\n\n }\n\n pub fn is_greedy(&self) -> bool {\n\n self.attr.get().contains(EnemyAttr::GREEDY)\n\n }\n\n pub fn is_random(&self) -> bool {\n\n self.attr.get().contains(EnemyAttr::RANDOM)\n\n }\n\n pub fn is_confused(&self) -> bool {\n\n self.attr.get().contains(EnemyAttr::CONFUSED)\n\n }\n\n pub fn is_running(&self) -> bool {\n\n self.running.get()\n\n }\n\n pub fn level(&self) -> Level {\n","file_path":"core/src/character/enemies.rs","rank":27,"score":2.637715862046227},{"content":"use input::System;\n\n\n\n/// A representation of Ui transition\n\n#[derive(Clone, Debug, Serialize, Deserialize, PartialEq)]\n\npub enum UiState {\n\n Dungeon,\n\n Mordal(MordalKind),\n\n}\n\n\n\nimpl UiState {\n\n pub(crate) fn die(message: String) -> Self {\n\n UiState::Mordal(MordalKind::Grave(message.into_boxed_str()))\n\n }\n\n}\n\n\n\n/// mordals\n\n#[derive(Clone, Debug, Serialize, Deserialize, PartialEq)]\n\npub enum MordalKind {\n\n Grave(Box<str>),\n\n Inventory,\n","file_path":"core/src/ui.rs","rank":28,"score":2.594040744793051},{"content":"pub enum DamageReaction {\n\n Death,\n\n None,\n\n}\n\n\n\npub(crate) fn clamp<T: Ord>(value: T, min: T, max: T) -> T {\n\n use std::cmp;\n\n cmp::max(cmp::min(value, max), min)\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n #[test]\n\n fn test_dice() {\n\n let dice = Dice::new(2, HitPoint(4));\n\n let mut rng = RngHandle::new();\n\n for _ in 0..100 {\n\n let hp = dice.random(&mut rng);\n\n assert!(2 <= hp.0 && hp.0 <= 8);\n\n }\n\n }\n\n}\n","file_path":"core/src/character/mod.rs","rank":29,"score":2.572741109898014},{"content":"#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\n\npub enum InitItem {\n\n Noinit(Item),\n\n Armor {\n\n name: SmallStr,\n\n def_plus: i32,\n\n },\n\n Weapon {\n\n name: SmallStr,\n\n num_plus: u32,\n\n hit_plus: i32,\n\n dam_plus: i32,\n\n },\n\n}\n\n\n\nimpl InitItem {\n\n pub(crate) fn initialize(self, handle: &mut ItemHandler) -> GameResult<ItemToken> {\n\n match self {\n\n InitItem::Noinit(item) => Ok(item),\n\n InitItem::Weapon {\n","file_path":"core/src/item/mod.rs","rank":30,"score":2.531174232343861},{"content":" font: FontHandle<'a>,\n\n scale: u32,\n\n theme: Theme,\n\n interval: u32,\n\n ) -> Self {\n\n GifEncoder {\n\n config,\n\n font,\n\n scale,\n\n theme,\n\n interval,\n\n }\n\n }\n\n pub fn exec(&mut self, inputs: Vec<InputCode>, filename: &str) -> GameResult<()> {\n\n let mut runtime = self.config.clone().build()?;\n\n let file = File::create(filename).into_chained(|| \"Failed to crate file\")?;\n\n let writer = BufWriter::new(file);\n\n let mut encoder = Encoder::new(writer);\n\n let mut term = TermImage::new(\n\n self.config.width.into(),\n","file_path":"act2gif/src/draw.rs","rank":31,"score":2.4909291617978293},{"content":" .symbol_max()\n\n .expect(\"Failed to get symbol max\")\n\n .to_byte()\n\n + 1;\n\n let mut runtime = config.build()?;\n\n runtime.keymap = KeyMap::ai();\n\n let (w, h) = runtime.screen_size();\n\n let mut state = PlayerState::new(w, h, symbols);\n\n state.reset(&mut runtime)?;\n\n Ok(GameStateImpl {\n\n runtime,\n\n state,\n\n steps: 0,\n\n max_steps,\n\n })\n\n }\n\n pub(crate) fn reset(&mut self, config: GameConfig) -> GameResult<()> {\n\n self.runtime = config.build()?;\n\n self.runtime.keymap = KeyMap::ai();\n\n self.state.reset(&mut self.runtime)?;\n","file_path":"python/src/state_impls.rs","rank":32,"score":2.451943835783881},{"content":"#[derive(Copy, Clone, Debug)]\n\npub(crate) struct StatusFlagInner(pub u32);\n\n\n\n#[rustfmt::skip]\n\nimpl StatusFlagInner {\n\n const DUNGEON_LEVEL: u32 = 0b000_000_001;\n\n const HP_CURRENT: u32 = 0b000_000_010;\n\n const HP_MAX: u32 = 0b000_000_100;\n\n const STR_CURRENT: u32 = 0b000_001_000;\n\n const STR_MAX: u32 = 0b000_010_000;\n\n const DEFENSE: u32 = 0b000_100_000;\n\n const PLAYER_LEVEL: u32 = 0b001_000_000;\n\n const EXP: u32 = 0b010_000_000;\n\n const HUNGER: u32 = 0b100_000_000;\n\n}\n\n\n\nimpl From<Option<u32>> for StatusFlagInner {\n\n fn from(u: Option<u32>) -> Self {\n\n StatusFlagInner(u.unwrap_or(0))\n\n }\n","file_path":"python/src/fearures.rs","rank":33,"score":2.3957014483477135},{"content":"use rogue_gym_core::{\n\n error::{GameResult, ResultExt2},\n\n GameConfig,\n\n};\n\nuse state_impls::GameStateImpl;\n\nuse std::sync::mpsc::{self, Receiver, SyncSender};\n\nuse std::thread;\n\nuse PlayerState;\n\n\n\npub(crate) struct ThreadConductor {\n\n receivers: Vec<Receiver<GameResult<PlayerState>>>,\n\n senders: Vec<SyncSender<Instruction>>,\n\n}\n\n\n\nimpl ThreadConductor {\n\n const SENDER_BOUND: usize = 4;\n\n pub fn new(configs: Vec<GameConfig>, max_steps: usize) -> GameResult<Self> {\n\n let mut receivers = vec![];\n\n let mut senders = vec![];\n\n for config in configs {\n","file_path":"python/src/thread_impls.rs","rank":34,"score":2.241458543606019},{"content":"use error::*;\n\nuse rogue_gym_core::dungeon::{Coord, X, Y};\n\nuse rogue_gym_uilib::Screen;\n\nuse std::collections::VecDeque;\n\nuse std::io::{self, Stdout, Write};\n\nuse termion::raw::{IntoRawMode, RawTerminal};\n\nuse termion::{clear, cursor, terminal_size};\n\nuse tuple_map::TupleMap2;\n\n\n\npub type RawTerm = RawTerminal<Stdout>;\n\n\n\n/// wrapper of stdout as rogue screen\n\npub struct TermScreen<T> {\n\n /// stdout\n\n term: T,\n\n has_notification: bool,\n\n width: u16,\n\n height: u16,\n\n pub(crate) pending_messages: VecDeque<String>,\n\n}\n","file_path":"devui/src/screen.rs","rank":35,"score":2.2255377411369883},{"content":"//! module for making and managing dangeon\n\nmod coord;\n\nmod field;\n\nmod rogue;\n\npub use self::coord::{Coord, Direction, Positioned, X, Y};\n\npub use self::field::{Cell, CellAttr, Field};\n\nuse character::player::Status as PlayerStatus;\n\nuse character::EnemyHandler;\n\nuse error::*;\n\nuse item::{ItemHandler, ItemToken};\n\nuse ndarray::Array2;\n\nuse smallvec::SmallVec;\n\nuse tile::Tile;\n\nuse {GameInfo, GameMsg, GlobalConfig};\n\n\n\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\n\n#[serde(tag = \"style\")]\n\n#[serde(rename_all = \"lowercase\")]\n\npub enum DungeonStyle {\n\n /// rogue 5.4.4 like dungeon\n","file_path":"core/src/dungeon/mod.rs","rank":36,"score":2.1606875066099085},{"content":"//! rogue floor\n\nuse super::{passages, rooms, Address, Config, Room, Surface};\n\nuse dungeon::{Cell, CellAttr, Coord, Direction, Field, Positioned, X, Y};\n\nuse enemies::EnemyHandler;\n\nuse enum_iterator::IntoEnumIterator;\n\nuse error::*;\n\nuse fenwick::FenwickSet;\n\nuse item::{ItemHandler, ItemToken};\n\nuse ndarray::Array2;\n\nuse rect_iter::{Get2D, GetMut2D};\n\nuse rng::RngHandle;\n\nuse std::collections::{HashMap, HashSet, VecDeque};\n\nuse GameMsg;\n\n\n\n/// representation of 'floor'\n\n#[derive(Clone, Debug, Default)]\n\npub struct Floor {\n\n /// rooms\n\n pub rooms: Vec<Room>,\n\n /// Coordinates of doors\n","file_path":"core/src/dungeon/rogue/floor.rs","rank":37,"score":2.1033702940584766},{"content":"use crate::font::{DrawInst, FontHandle};\n\nuse image::{gif::Frame, Pixel, Rgb, Rgba, RgbaImage};\n\nuse rect_iter::GetMut2D;\n\nuse rect_iter::RectRange;\n\nuse rogue_gym_core::dungeon::{Coord, X, Y};\n\nuse rogue_gym_core::error::{GameResult, ResultExt1};\n\nuse rogue_gym_uilib::Screen;\n\nuse rusttype::point;\n\nuse tuple_map::TupleMap2;\n\n\n\n#[derive(Debug, Fail)]\n\n#[fail(display = \"EncodeError\")]\n\npub struct EncodeError;\n\n\n\npub struct TermImage<'a: 'b, 'b> {\n\n buffer: RgbaImage,\n\n background: Rgba<u8>,\n\n fontcolor: Rgb<u8>,\n\n fontsize: u32,\n\n size: Coord,\n","file_path":"act2gif/src/term_image.rs","rank":38,"score":2.0779439551779473},{"content":"pub mod tile;\n\npub mod ui;\n\n\n\nuse character::{enemies, player, EnemyHandler, Player};\n\nuse dungeon::{Direction, Dungeon, DungeonStyle, Positioned, X, Y};\n\nuse error::*;\n\nuse input::{InputCode, Key, KeyMap};\n\nuse item::{ItemHandler, ItemKind};\n\nuse ndarray::Array2;\n\npub use smallstr::SmallStr;\n\nuse tile::{Drawable, Tile};\n\nuse ui::{MordalKind, MordalMsg, UiState};\n\n\n\n/// Game configuration\n\n/// it's inteded to construct from json\n\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\n\npub struct GameConfig {\n\n /// screen width\n\n #[serde(default = \"default_screen_width\")]\n\n #[serde(skip_serializing_if = \"is_default_width\")]\n","file_path":"core/src/lib.rs","rank":39,"score":2.0758371138296052},{"content":"pub mod floor;\n\npub mod maze;\n\npub mod passages;\n\npub mod rooms;\n\n\n\nuse self::floor::Floor;\n\npub use self::rooms::{Room, RoomKind};\n\nuse super::{Coord, Direction, Dungeon as DungeonTrait, DungeonPath, MoveResult, Positioned, X, Y};\n\nuse character::{player::Status as PlayerStatus, EnemyHandler};\n\nuse enum_iterator::IntoEnumIterator;\n\nuse error::*;\n\nuse item::{ItemHandler, ItemToken};\n\nuse ndarray::Array2;\n\nuse rect_iter::{Get2D, GetMut2D, RectRange};\n\nuse rng::RngHandle;\n\nuse std::collections::VecDeque;\n\nuse tile::{Drawable, Tile};\n\nuse tuple_map::TupleMap2;\n\nuse {GameInfo, GameMsg, GlobalConfig};\n\n\n","file_path":"core/src/dungeon/rogue/mod.rs","rank":40,"score":1.9725539522631452},{"content":"use super::{DamageReaction, Defense, Dice, Exp, HitPoint, Level, Strength};\n\nuse crate::{Drawable, SmallStr};\n\nuse dungeon::{Dungeon, DungeonPath, MoveResult};\n\nuse item::ItemNum;\n\nuse rng::{Parcent, RngHandle};\n\nuse smallvec::SmallVec;\n\nuse std::cell::Cell;\n\nuse std::collections::BTreeMap;\n\nuse std::ops::Range;\n\nuse std::rc::{Rc, Weak};\n\nuse tile::Tile;\n\n\n\npub type DiceVec<T> = SmallVec<[Dice<T>; 4]>;\n\n\n\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\n\npub struct Config {\n\n #[serde(default = \"default_enemies\")]\n\n pub enemies: Vec<Preset>,\n\n #[serde(default = \"default_appear_rate_gold\")]\n\n #[serde(skip_serializing_if = \"is_default_appear_rate_gold\")]\n","file_path":"core/src/character/enemies.rs","rank":41,"score":1.9014067761517843}],"string":"[\n {\n \"content\": \"#![cfg_attr(test, feature(test))]\\n\\n#[macro_use]\\n\\nextern crate bitflags;\\n\\n#[macro_use]\\n\\nextern crate derive_more;\\n\\n#[macro_use]\\n\\nextern crate enum_iterator;\\n\\n#[macro_use]\\n\\nextern crate failure;\\n\\nextern crate fixedbitset;\\n\\nextern crate ndarray;\\n\\nextern crate num_traits;\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\nextern crate rand;\\n\\nextern crate rand_xorshift;\\n\\nextern crate rect_iter;\\n\\nextern crate regex;\\n\\n#[macro_use]\\n\\nextern crate serde;\\n\",\n \"file_path\": \"core/src/lib.rs\",\n \"rank\": 1,\n \"score\": 15.898894763226801\n },\n {\n \"content\": \"extern crate chrono;\\n\\nextern crate clap;\\n\\n#[macro_use]\\n\\nextern crate failure;\\n\\nextern crate fern;\\n\\n#[macro_use]\\n\\nextern crate log;\\n\\nextern crate rogue_gym_core;\\n\\nextern crate rogue_gym_uilib;\\n\\nextern crate termion;\\n\\nextern crate tuple_map;\\n\\n\\n\\npub mod error;\\n\\npub mod screen;\\n\\nuse error::*;\\n\\nuse rogue_gym_core::input::InputCode;\\n\\nuse rogue_gym_core::{GameConfig, RunTime};\\n\\nuse rogue_gym_uilib::{process_reaction, Screen, Transition};\\n\\nuse screen::{RawTerm, TermScreen};\\n\\nuse std::io;\\n\\nuse std::sync::mpsc;\\n\\nuse std::thread;\\n\\nuse std::time::Duration;\\n\\nuse termion::event::Key;\\n\\nuse termion::input::TermRead;\\n\\n\\n\",\n \"file_path\": \"devui/src/lib.rs\",\n \"rank\": 2,\n \"score\": 11.707334038556201\n },\n {\n \"content\": \"extern crate chrono;\\n\\nextern crate clap;\\n\\nextern crate fern;\\n\\nextern crate log;\\n\\nextern crate rogue_gym_core;\\n\\nextern crate rogue_gym_devui;\\n\\nextern crate termion;\\n\\nextern crate tuple_map;\\n\\n\\n\\nuse std::fs::{File, OpenOptions};\\n\\nuse std::io::prelude::*;\\n\\n\\n\\nuse clap::ArgMatches;\\n\\nuse rogue_gym_core::{json_to_inputs, read_file, GameConfig};\\n\\nuse rogue_gym_devui::error::*;\\n\\nuse rogue_gym_devui::{play_game, show_replay};\\n\\n\\n\\nconst DEFAULT_INTERVAL_MS: u64 = 500;\\n\\n\\n\",\n \"file_path\": \"devui/src/main.rs\",\n \"rank\": 3,\n \"score\": 10.033597415295834\n },\n {\n \"content\": \"extern crate serde_json;\\n\\nextern crate smallvec;\\n\\n#[cfg(unix)]\\n\\nextern crate termion;\\n\\n#[cfg(feature = \\\"bench\\\")]\\n\\nextern crate test;\\n\\nextern crate tuple_map;\\n\\n\\n\\nmod actions;\\n\\nuse std::fs::File;\\n\\nuse std::io::{self, Read};\\n\\npub mod character;\\n\\npub mod dungeon;\\n\\npub mod error;\\n\\nmod fenwick;\\n\\npub mod input;\\n\\npub mod item;\\n\\nmod rng;\\n\\nmod smallstr;\\n\\npub mod symbol;\\n\",\n \"file_path\": \"core/src/lib.rs\",\n \"rank\": 4,\n \"score\": 9.486697166988257\n },\n {\n \"content\": \"#[macro_use]\\n\\nextern crate failure;\\n\\n\\n\\nmod draw;\\n\\nmod font;\\n\\nmod term_image;\\n\\nmod theme;\\n\\nuse self::draw::GifEncoder;\\n\\nuse clap::{self, ArgMatches};\\n\\nuse rogue_gym_core::{error::*, input::InputCode, json_to_inputs, read_file, GameConfig};\\n\\nconst UBUNTU_MONO: &[u8; 205748] = include_bytes!(\\\"../../data/fonts/UbuntuMono-R.ttf\\\");\\n\\nuse self::font::FontHandle;\\n\\nuse self::theme::Theme;\\n\\n\\n\",\n \"file_path\": \"act2gif/src/main.rs\",\n \"rank\": 5,\n \"score\": 7.784145151402287\n },\n {\n \"content\": \"use crate::input::{InputCode, Key};\\n\\nuse failure::{self, Error, Fail};\\n\\nuse rect_iter::IndexError;\\n\\nuse serde_json::Error as JsonError;\\n\\nuse std::error::Error as StdError;\\n\\nuse std::fmt;\\n\\n\\n\\npub type GameResult<T> = Result<T, Error>;\\n\\n\\n\",\n \"file_path\": \"core/src/error.rs\",\n \"rank\": 6,\n \"score\": 6.019127580824188\n },\n {\n \"content\": \"//! module for handling actions and do some operations related to multiple modules\\n\\nuse crate::character::{\\n\\n fight, player::PlayerEvent, Action, DamageReaction, Enemy, EnemyHandler, Player,\\n\\n};\\n\\nuse crate::dungeon::{Direction, Dungeon, DungeonPath};\\n\\nuse crate::error::*;\\n\\nuse crate::item::{itembox::Entry as ItemEntry, ItemHandler, ItemToken};\\n\\nuse crate::ui::UiState;\\n\\nuse crate::{GameInfo, GameMsg, Reaction};\\n\\nuse std::iter;\\n\\nuse std::rc::Rc;\\n\\n\\n\\npub(crate) fn process_action(\\n\\n action: Action,\\n\\n info: &mut GameInfo,\\n\\n dungeon: &mut dyn Dungeon,\\n\\n item: &mut ItemHandler,\\n\\n player: &mut Player,\\n\\n enemies: &mut EnemyHandler,\\n\\n) -> GameResult<(Option<UiState>, Vec<Reaction>)> {\\n\",\n \"file_path\": \"core/src/actions.rs\",\n \"rank\": 7,\n \"score\": 4.650219826819137\n },\n {\n \"content\": \"use ndarray::{ArrayViewMut, Axis, Ix3};\\n\\nuse rogue_gym_core::character::player::Status;\\n\\nuse rogue_gym_core::GameMsg;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, Eq, PartialEq)]\\n\\npub(crate) struct MessageFlagInner(pub u32);\\n\\n\\n\\n#[rustfmt::skip]\\n\\nimpl MessageFlagInner {\\n\\n const HIT_FROM: u32 = 0b000_000_001;\\n\\n const HIT_TO: u32 = 0b000_000_010;\\n\\n const MISS_TO: u32 = 0b000_000_100;\\n\\n const MISS_FROM: u32 = 0b000_001_000;\\n\\n const KILLED: u32 = 0b000_010_000;\\n\\n const SECRET_DOOR: u32 = 0b000_100_000;\\n\\n const NO_DOWNSTAIR: u32 = 0b001_000_000;\\n\\n}\\n\\n\\n\\nimpl MessageFlagInner {\\n\\n pub fn new() -> Self {\\n\",\n \"file_path\": \"python/src/fearures.rs\",\n \"rank\": 8,\n \"score\": 4.609263946658296\n },\n {\n \"content\": \" self.steps = 0;\\n\\n Ok(())\\n\\n }\\n\\n pub(crate) fn state(&self) -> PlayerState {\\n\\n self.state.clone()\\n\\n }\\n\\n pub(crate) fn symbols(&self) -> usize {\\n\\n usize::from(self.state.symbols)\\n\\n }\\n\\n pub(crate) fn react(&mut self, input: u8) -> GameResult<()> {\\n\\n if self.steps > self.max_steps {\\n\\n return Ok(());\\n\\n }\\n\\n let res = self.runtime.react_to_key(Key::Char(input as char))?;\\n\\n self.state.message.reset();\\n\\n let mut dead = false;\\n\\n for reaction in res {\\n\\n match reaction {\\n\\n Reaction::Redraw => {\\n\\n self.state.draw_map(&self.runtime)?;\\n\",\n \"file_path\": \"python/src/state_impls.rs\",\n \"rank\": 9,\n \"score\": 4.1949236349545425\n },\n {\n \"content\": \"use super::{clamp, DamageReaction, Defense, Dice, Exp, HitPoint, Level, Maxed, Strength};\\n\\nuse crate::dungeon::{Direction, DungeonPath};\\n\\nuse crate::error::GameResult;\\n\\nuse crate::item::{\\n\\n armor, food::Food, itembox::ItemBox, weapon, InitItem, Item, ItemHandler, ItemKind, ItemToken,\\n\\n};\\n\\nuse crate::rng::RngHandle;\\n\\nuse crate::tile::{Drawable, Tile};\\n\\nuse smallstr::SmallStr;\\n\\nuse std::{cmp, fmt};\\n\\nuse tuple_map::TupleMap2;\\n\\n\\n\\n/// Player configuration\\n\\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\\n\\npub struct Config {\\n\\n #[serde(default, flatten)]\\n\\n pub level: Leveling,\\n\\n #[serde(default = \\\"default_hunger_time\\\")]\\n\\n pub hunger_time: u32,\\n\\n #[serde(default = \\\"default_init_hp\\\")]\\n\",\n \"file_path\": \"core/src/character/player.rs\",\n \"rank\": 10,\n \"score\": 4.184789431627651\n },\n {\n \"content\": \"use rogue_gym_core::{\\n\\n error::GameResult,\\n\\n input::{Key, KeyMap},\\n\\n ui::{MordalKind, UiState},\\n\\n GameConfig, Reaction, RunTime,\\n\\n};\\n\\nuse PlayerState;\\n\\n\\n\\npub(crate) struct GameStateImpl {\\n\\n pub(crate) runtime: RunTime,\\n\\n state: PlayerState,\\n\\n steps: usize,\\n\\n max_steps: usize,\\n\\n}\\n\\n\\n\\nunsafe impl Send for GameStateImpl {}\\n\\n\\n\\nimpl GameStateImpl {\\n\\n pub(crate) fn new(config: GameConfig, max_steps: usize) -> GameResult<Self> {\\n\\n let symbols = config\\n\",\n \"file_path\": \"python/src/state_impls.rs\",\n \"rank\": 11,\n \"score\": 3.948243568655669\n },\n {\n \"content\": \"use crate::font::FontHandle;\\n\\nuse crate::term_image::TermImage;\\n\\nuse crate::theme::Theme;\\n\\nuse image::gif::{DisposalMethod, Encoder};\\n\\nuse rogue_gym_core::{error::*, input::InputCode, GameConfig, Reaction};\\n\\nuse rogue_gym_uilib::process_reaction;\\n\\nuse std::fs::File;\\n\\nuse std::io::BufWriter;\\n\\n\\n\\npub struct GifEncoder<'a> {\\n\\n config: GameConfig,\\n\\n font: FontHandle<'a>,\\n\\n scale: u32,\\n\\n theme: Theme,\\n\\n interval: u32,\\n\\n}\\n\\n\\n\\nimpl<'a> GifEncoder<'a> {\\n\\n pub fn new(\\n\\n config: GameConfig,\\n\",\n \"file_path\": \"act2gif/src/draw.rs\",\n \"rank\": 12,\n \"score\": 3.883004190606571\n },\n {\n \"content\": \" ItemKind::Armor(a) => name == a.name(),\\n\\n _ => false,\\n\\n })\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n pub fn strength(&self) -> Maxed<Strength> {\\n\\n self.status.strength\\n\\n }\\n\\n pub fn level(&self) -> Level {\\n\\n self.status.level\\n\\n }\\n\\n pub(crate) fn buttle(&mut self) {\\n\\n self.status.quiet = 0\\n\\n }\\n\\n pub(crate) fn turn_passed(&mut self, rng: &mut RngHandle) -> Vec<PlayerEvent> {\\n\\n let mut res = vec![];\\n\\n self.status.food_left -= 1;\\n\\n if self.status.food_left == 0 {\\n\\n return vec![PlayerEvent::Dead];\\n\",\n \"file_path\": \"core/src/character/player.rs\",\n \"rank\": 13,\n \"score\": 3.7095141943945813\n },\n {\n \"content\": \" dam_plus: 0.into(),\\n\\n worth,\\n\\n launcher,\\n\\n };\\n\\n (weapon, attr, num.into())\\n\\n }\\n\\n fn name(&self) -> &str {\\n\\n self.name.as_ref()\\n\\n }\\n\\n fn worth(&self) -> crate::item::ItemNum {\\n\\n self.worth\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) fn rogue_init_weapons(vec: &mut Vec<InitItem>) {\\n\\n ((0, 0, 1, 1), (2, 0, 1, 0), (3, 25, 0, 0)).for_each(|(idx, num_plus, hit_plus, dam_plus)| {\\n\\n vec.push(InitItem::Weapon {\\n\\n name: BUILTIN_WEAPONS[idx].name.clone(),\\n\\n num_plus,\\n\\n hit_plus,\\n\",\n \"file_path\": \"core/src/item/weapon.rs\",\n \"rank\": 14,\n \"score\": 3.7095141943945813\n },\n {\n \"content\": \" let enem = self.placed_enemies.remove(&place)?;\\n\\n enem.run();\\n\\n self.active_enemies.insert(place, enem);\\n\\n Some(())\\n\\n }\\n\\n pub(crate) fn remove_enemies(&mut self) {\\n\\n self.active_enemies = BTreeMap::new();\\n\\n self.placed_enemies = BTreeMap::new();\\n\\n }\\n\\n pub(crate) fn move_actives(\\n\\n &mut self,\\n\\n player_pos: &DungeonPath,\\n\\n gold_pos: Option<&DungeonPath>,\\n\\n dungeon: &mut dyn Dungeon,\\n\\n ) -> Vec<Attack> {\\n\\n let mut out = Vec::new();\\n\\n debug!(\\n\\n \\\"[EnemyHandler::move_actives] before: {:?}\\\",\\n\\n self.active_enemies\\n\\n );\\n\",\n \"file_path\": \"core/src/character/enemies.rs\",\n \"rank\": 15,\n \"score\": 3.502200799279783\n },\n {\n \"content\": \"use super::handler::{Handler, ItemInner, ItemStat};\\n\\nuse super::{InitItem, Item, ItemAttr, ItemKind, ItemNum};\\n\\nuse crate::character::{Dice, HitPoint, Level};\\n\\nuse crate::rng::{Parcent, RngHandle};\\n\\nuse crate::SmallStr;\\n\\nuse std::fmt;\\n\\nuse std::ops::Range;\\n\\nuse tuple_map::TupleMap3;\\n\\n\\n\\n/// Weapon configuration\\n\\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\\n\\npub struct Config {\\n\\n #[serde(default = \\\"default_weapons\\\")]\\n\\n pub weapons: Vec<Preset>,\\n\\n #[serde(default = \\\"default_cursed_rate\\\")]\\n\\n #[serde(skip_serializing_if = \\\"is_default_cursed_rate\\\")]\\n\\n pub cursed_rate: Parcent,\\n\\n #[serde(default = \\\"default_powerup_rate\\\")]\\n\\n #[serde(skip_serializing_if = \\\"is_default_powerup_rate\\\")]\\n\\n pub powerup_rate: Parcent,\\n\",\n \"file_path\": \"core/src/item/weapon.rs\",\n \"rank\": 16,\n \"score\": 3.480437568621258\n },\n {\n \"content\": \" }\\n\\n if self.notify_hungry() {\\n\\n res.push(PlayerEvent::Hungry);\\n\\n }\\n\\n if self.heal(rng) {\\n\\n res.push(PlayerEvent::Healed);\\n\\n }\\n\\n res\\n\\n }\\n\\n pub(crate) fn get_damage(&mut self, damage: HitPoint) -> DamageReaction {\\n\\n self.status.hp.current = cmp::max(self.status.hp.current - damage, HitPoint(0));\\n\\n if self.status.hp.current == HitPoint(0) {\\n\\n DamageReaction::Death\\n\\n } else {\\n\\n DamageReaction::None\\n\\n }\\n\\n }\\n\\n pub(crate) fn level_up(&mut self, exp: Exp, rng: &mut RngHandle) -> bool {\\n\\n self.status.exp += exp;\\n\\n let diff = self\\n\",\n \"file_path\": \"core/src/character/player.rs\",\n \"rank\": 17,\n \"score\": 3.4444508543940455\n },\n {\n \"content\": \" DamageReaction::None\\n\\n }\\n\\n }\\n\\n fn run(&self) {\\n\\n self.running.replace(true);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drawable for Enemy {\\n\\n fn tile(&self) -> Tile {\\n\\n self.tile\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) struct Attack(Rc<Enemy>);\\n\\n\\n\\nimpl Attack {\\n\\n pub fn enemy(&self) -> &Enemy {\\n\\n self.0.as_ref()\\n\\n }\\n\",\n \"file_path\": \"core/src/character/enemies.rs\",\n \"rank\": 18,\n \"score\": 3.4136157483226337\n },\n {\n \"content\": \"use super::{Damage, Defense, Dice, Enemy, HitPoint, Level, Player, Strength};\\n\\nuse crate::rng::{Parcent, RngHandle};\\n\\nuse item::ItemToken;\\n\\nuse std::iter;\\n\\n\\n\",\n \"file_path\": \"core/src/character/fight.rs\",\n \"rank\": 19,\n \"score\": 3.4136157483226337\n },\n {\n \"content\": \" res.push(Reaction::UiTransition(mordal.clone()));\\n\\n return Ok(Some(mordal));\\n\\n }\\n\\n DamageReaction::None => {}\\n\\n }\\n\\n }\\n\\n None => {\\n\\n res.push(Reaction::Notify(GameMsg::MissFrom(\\n\\n at.enemy().name().to_owned(),\\n\\n )));\\n\\n }\\n\\n }\\n\\n }\\n\\n if did_hit {\\n\\n res.push(Reaction::StatusUpdated);\\n\\n }\\n\\n Ok(None)\\n\\n}\\n\\n\\n\\npub(crate) fn new_level(\\n\",\n \"file_path\": \"core/src/actions.rs\",\n \"rank\": 20,\n \"score\": 3.048303072370465\n },\n {\n \"content\": \" rng.range(1..level - 6)\\n\\n } else {\\n\\n 0\\n\\n };\\n\\n if heal > 0 {\\n\\n self.status.hp.current += HitPoint(heal);\\n\\n self.status.hp.verify();\\n\\n self.status.quiet = 0;\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n }\\n\\n fn notify_hungry(&mut self) -> bool {\\n\\n let hunger = self.config.hunger_time / 10;\\n\\n self.status.food_left == hunger || self.status.food_left == hunger * 2\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) enum PlayerEvent {\\n\",\n \"file_path\": \"core/src/character/player.rs\",\n \"rank\": 21,\n \"score\": 2.990122708858669\n },\n {\n \"content\": \" };\\n\\n (armor, ItemAttr::empty(), 1.into())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl ItemStat for ArmorStatus {\\n\\n type Item = Armor;\\n\\n fn appear_rate(&self) -> Parcent {\\n\\n self.appear_rate\\n\\n }\\n\\n fn build(self, _rng: &mut RngHandle) -> (Armor, ItemAttr, ItemNum) {\\n\\n self.build_inner()\\n\\n }\\n\\n fn name(&self) -> &str {\\n\\n self.name.as_ref()\\n\\n }\\n\\n fn worth(&self) -> crate::item::ItemNum {\\n\\n self.worth\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/item/armor.rs\",\n \"rank\": 22,\n \"score\": 2.9618574837508596\n },\n {\n \"content\": \" }\\n\\n pub fn from_path(p: &DungeonPath) -> Self {\\n\\n Address {\\n\\n level: p[0] as u32,\\n\\n cd: Coord::new(p[1], p[2]),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::{Address, Coord, Direction, DungeonPath, MoveResult, TupleMap2};\\n\\n use crate::{GameConfig, RunTime};\\n\\n // tiny dungeon setting\\n\\n const CONFIG: &str = r#\\\"\\n\\n{\\n\\n \\\"width\\\": 32,\\n\\n \\\"height\\\": 16,\\n\\n \\\"seed\\\": 5,\\n\\n \\\"dungeon\\\": {\\n\",\n \"file_path\": \"core/src/dungeon/rogue/mod.rs\",\n \"rank\": 23,\n \"score\": 2.8801796392791568\n },\n {\n \"content\": \" self.active_enemies.insert(next, enemy);\\n\\n }\\n\\n debug!(\\n\\n \\\"[EnemyHandler::move_actives] after: {:?}\\\",\\n\\n self.active_enemies\\n\\n );\\n\\n out\\n\\n }\\n\\n pub(crate) fn rng(&mut self) -> &mut RngHandle {\\n\\n &mut self.rng\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, Eq, PartialEq)]\\n\\npub struct StaticStatus {\\n\\n attack: &'static [Dice<HitPoint>],\\n\\n attr: EnemyAttr,\\n\\n defense: Defense,\\n\\n exp: Exp,\\n\\n gold: ItemNum,\\n\",\n \"file_path\": \"core/src/character/enemies.rs\",\n \"rank\": 24,\n \"score\": 2.778034777487774\n },\n {\n \"content\": \" self.placed_enemies\\n\\n .get(&path)\\n\\n .or_else(|| self.active_enemies.get(&path))\\n\\n .map(Rc::clone)\\n\\n }\\n\\n pub fn activate_area<'a, F>(&mut self, is_in_activation_area: F)\\n\\n where\\n\\n F: Fn(&DungeonPath) -> bool,\\n\\n {\\n\\n let removes: Vec<_> = self\\n\\n .placed_enemies\\n\\n .iter()\\n\\n .filter(|(p, e)| is_in_activation_area(p) && e.is_mean())\\n\\n .map(|(p, _)| p.to_owned())\\n\\n .collect();\\n\\n for path in removes {\\n\\n self.activate(path);\\n\\n }\\n\\n }\\n\\n pub(crate) fn activate(&mut self, place: DungeonPath) -> Option<()> {\\n\",\n \"file_path\": \"core/src/character/enemies.rs\",\n \"rank\": 25,\n \"score\": 2.6828868556917773\n },\n {\n \"content\": \"use fenwick::FenwickSet;\\n\\nuse num_traits::PrimInt;\\n\\nuse rand::{\\n\\n distributions::uniform::SampleUniform, thread_rng, Error as RndError, RngCore, SeedableRng,\\n\\n};\\n\\npub(crate) use rand::{seq::SliceRandom, Rng};\\n\\nuse rand_xorshift::XorShiftRng;\\n\\nuse std::cmp;\\n\\nuse std::mem;\\n\\nuse std::ops::{Bound, Range, RangeBounds};\\n\\n\\n\",\n \"file_path\": \"core/src/rng.rs\",\n \"rank\": 26,\n \"score\": 2.637715862046227\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Enemy {\\n\\n pub(crate) const STRENGTH: Strength = Strength(10);\\n\\n pub fn is_mean(&self) -> bool {\\n\\n self.attr.get().contains(EnemyAttr::MEAN)\\n\\n }\\n\\n pub fn is_greedy(&self) -> bool {\\n\\n self.attr.get().contains(EnemyAttr::GREEDY)\\n\\n }\\n\\n pub fn is_random(&self) -> bool {\\n\\n self.attr.get().contains(EnemyAttr::RANDOM)\\n\\n }\\n\\n pub fn is_confused(&self) -> bool {\\n\\n self.attr.get().contains(EnemyAttr::CONFUSED)\\n\\n }\\n\\n pub fn is_running(&self) -> bool {\\n\\n self.running.get()\\n\\n }\\n\\n pub fn level(&self) -> Level {\\n\",\n \"file_path\": \"core/src/character/enemies.rs\",\n \"rank\": 27,\n \"score\": 2.637715862046227\n },\n {\n \"content\": \"use input::System;\\n\\n\\n\\n/// A representation of Ui transition\\n\\n#[derive(Clone, Debug, Serialize, Deserialize, PartialEq)]\\n\\npub enum UiState {\\n\\n Dungeon,\\n\\n Mordal(MordalKind),\\n\\n}\\n\\n\\n\\nimpl UiState {\\n\\n pub(crate) fn die(message: String) -> Self {\\n\\n UiState::Mordal(MordalKind::Grave(message.into_boxed_str()))\\n\\n }\\n\\n}\\n\\n\\n\\n/// mordals\\n\\n#[derive(Clone, Debug, Serialize, Deserialize, PartialEq)]\\n\\npub enum MordalKind {\\n\\n Grave(Box<str>),\\n\\n Inventory,\\n\",\n \"file_path\": \"core/src/ui.rs\",\n \"rank\": 28,\n \"score\": 2.594040744793051\n },\n {\n \"content\": \"pub enum DamageReaction {\\n\\n Death,\\n\\n None,\\n\\n}\\n\\n\\n\\npub(crate) fn clamp<T: Ord>(value: T, min: T, max: T) -> T {\\n\\n use std::cmp;\\n\\n cmp::max(cmp::min(value, max), min)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n #[test]\\n\\n fn test_dice() {\\n\\n let dice = Dice::new(2, HitPoint(4));\\n\\n let mut rng = RngHandle::new();\\n\\n for _ in 0..100 {\\n\\n let hp = dice.random(&mut rng);\\n\\n assert!(2 <= hp.0 && hp.0 <= 8);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"core/src/character/mod.rs\",\n \"rank\": 29,\n \"score\": 2.572741109898014\n },\n {\n \"content\": \"#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\\n\\npub enum InitItem {\\n\\n Noinit(Item),\\n\\n Armor {\\n\\n name: SmallStr,\\n\\n def_plus: i32,\\n\\n },\\n\\n Weapon {\\n\\n name: SmallStr,\\n\\n num_plus: u32,\\n\\n hit_plus: i32,\\n\\n dam_plus: i32,\\n\\n },\\n\\n}\\n\\n\\n\\nimpl InitItem {\\n\\n pub(crate) fn initialize(self, handle: &mut ItemHandler) -> GameResult<ItemToken> {\\n\\n match self {\\n\\n InitItem::Noinit(item) => Ok(item),\\n\\n InitItem::Weapon {\\n\",\n \"file_path\": \"core/src/item/mod.rs\",\n \"rank\": 30,\n \"score\": 2.531174232343861\n },\n {\n \"content\": \" font: FontHandle<'a>,\\n\\n scale: u32,\\n\\n theme: Theme,\\n\\n interval: u32,\\n\\n ) -> Self {\\n\\n GifEncoder {\\n\\n config,\\n\\n font,\\n\\n scale,\\n\\n theme,\\n\\n interval,\\n\\n }\\n\\n }\\n\\n pub fn exec(&mut self, inputs: Vec<InputCode>, filename: &str) -> GameResult<()> {\\n\\n let mut runtime = self.config.clone().build()?;\\n\\n let file = File::create(filename).into_chained(|| \\\"Failed to crate file\\\")?;\\n\\n let writer = BufWriter::new(file);\\n\\n let mut encoder = Encoder::new(writer);\\n\\n let mut term = TermImage::new(\\n\\n self.config.width.into(),\\n\",\n \"file_path\": \"act2gif/src/draw.rs\",\n \"rank\": 31,\n \"score\": 2.4909291617978293\n },\n {\n \"content\": \" .symbol_max()\\n\\n .expect(\\\"Failed to get symbol max\\\")\\n\\n .to_byte()\\n\\n + 1;\\n\\n let mut runtime = config.build()?;\\n\\n runtime.keymap = KeyMap::ai();\\n\\n let (w, h) = runtime.screen_size();\\n\\n let mut state = PlayerState::new(w, h, symbols);\\n\\n state.reset(&mut runtime)?;\\n\\n Ok(GameStateImpl {\\n\\n runtime,\\n\\n state,\\n\\n steps: 0,\\n\\n max_steps,\\n\\n })\\n\\n }\\n\\n pub(crate) fn reset(&mut self, config: GameConfig) -> GameResult<()> {\\n\\n self.runtime = config.build()?;\\n\\n self.runtime.keymap = KeyMap::ai();\\n\\n self.state.reset(&mut self.runtime)?;\\n\",\n \"file_path\": \"python/src/state_impls.rs\",\n \"rank\": 32,\n \"score\": 2.451943835783881\n },\n {\n \"content\": \"#[derive(Copy, Clone, Debug)]\\n\\npub(crate) struct StatusFlagInner(pub u32);\\n\\n\\n\\n#[rustfmt::skip]\\n\\nimpl StatusFlagInner {\\n\\n const DUNGEON_LEVEL: u32 = 0b000_000_001;\\n\\n const HP_CURRENT: u32 = 0b000_000_010;\\n\\n const HP_MAX: u32 = 0b000_000_100;\\n\\n const STR_CURRENT: u32 = 0b000_001_000;\\n\\n const STR_MAX: u32 = 0b000_010_000;\\n\\n const DEFENSE: u32 = 0b000_100_000;\\n\\n const PLAYER_LEVEL: u32 = 0b001_000_000;\\n\\n const EXP: u32 = 0b010_000_000;\\n\\n const HUNGER: u32 = 0b100_000_000;\\n\\n}\\n\\n\\n\\nimpl From<Option<u32>> for StatusFlagInner {\\n\\n fn from(u: Option<u32>) -> Self {\\n\\n StatusFlagInner(u.unwrap_or(0))\\n\\n }\\n\",\n \"file_path\": \"python/src/fearures.rs\",\n \"rank\": 33,\n \"score\": 2.3957014483477135\n },\n {\n \"content\": \"use rogue_gym_core::{\\n\\n error::{GameResult, ResultExt2},\\n\\n GameConfig,\\n\\n};\\n\\nuse state_impls::GameStateImpl;\\n\\nuse std::sync::mpsc::{self, Receiver, SyncSender};\\n\\nuse std::thread;\\n\\nuse PlayerState;\\n\\n\\n\\npub(crate) struct ThreadConductor {\\n\\n receivers: Vec<Receiver<GameResult<PlayerState>>>,\\n\\n senders: Vec<SyncSender<Instruction>>,\\n\\n}\\n\\n\\n\\nimpl ThreadConductor {\\n\\n const SENDER_BOUND: usize = 4;\\n\\n pub fn new(configs: Vec<GameConfig>, max_steps: usize) -> GameResult<Self> {\\n\\n let mut receivers = vec![];\\n\\n let mut senders = vec![];\\n\\n for config in configs {\\n\",\n \"file_path\": \"python/src/thread_impls.rs\",\n \"rank\": 34,\n \"score\": 2.241458543606019\n },\n {\n \"content\": \"use error::*;\\n\\nuse rogue_gym_core::dungeon::{Coord, X, Y};\\n\\nuse rogue_gym_uilib::Screen;\\n\\nuse std::collections::VecDeque;\\n\\nuse std::io::{self, Stdout, Write};\\n\\nuse termion::raw::{IntoRawMode, RawTerminal};\\n\\nuse termion::{clear, cursor, terminal_size};\\n\\nuse tuple_map::TupleMap2;\\n\\n\\n\\npub type RawTerm = RawTerminal<Stdout>;\\n\\n\\n\\n/// wrapper of stdout as rogue screen\\n\\npub struct TermScreen<T> {\\n\\n /// stdout\\n\\n term: T,\\n\\n has_notification: bool,\\n\\n width: u16,\\n\\n height: u16,\\n\\n pub(crate) pending_messages: VecDeque<String>,\\n\\n}\\n\",\n \"file_path\": \"devui/src/screen.rs\",\n \"rank\": 35,\n \"score\": 2.2255377411369883\n },\n {\n \"content\": \"//! module for making and managing dangeon\\n\\nmod coord;\\n\\nmod field;\\n\\nmod rogue;\\n\\npub use self::coord::{Coord, Direction, Positioned, X, Y};\\n\\npub use self::field::{Cell, CellAttr, Field};\\n\\nuse character::player::Status as PlayerStatus;\\n\\nuse character::EnemyHandler;\\n\\nuse error::*;\\n\\nuse item::{ItemHandler, ItemToken};\\n\\nuse ndarray::Array2;\\n\\nuse smallvec::SmallVec;\\n\\nuse tile::Tile;\\n\\nuse {GameInfo, GameMsg, GlobalConfig};\\n\\n\\n\\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\\n\\n#[serde(tag = \\\"style\\\")]\\n\\n#[serde(rename_all = \\\"lowercase\\\")]\\n\\npub enum DungeonStyle {\\n\\n /// rogue 5.4.4 like dungeon\\n\",\n \"file_path\": \"core/src/dungeon/mod.rs\",\n \"rank\": 36,\n \"score\": 2.1606875066099085\n },\n {\n \"content\": \"//! rogue floor\\n\\nuse super::{passages, rooms, Address, Config, Room, Surface};\\n\\nuse dungeon::{Cell, CellAttr, Coord, Direction, Field, Positioned, X, Y};\\n\\nuse enemies::EnemyHandler;\\n\\nuse enum_iterator::IntoEnumIterator;\\n\\nuse error::*;\\n\\nuse fenwick::FenwickSet;\\n\\nuse item::{ItemHandler, ItemToken};\\n\\nuse ndarray::Array2;\\n\\nuse rect_iter::{Get2D, GetMut2D};\\n\\nuse rng::RngHandle;\\n\\nuse std::collections::{HashMap, HashSet, VecDeque};\\n\\nuse GameMsg;\\n\\n\\n\\n/// representation of 'floor'\\n\\n#[derive(Clone, Debug, Default)]\\n\\npub struct Floor {\\n\\n /// rooms\\n\\n pub rooms: Vec<Room>,\\n\\n /// Coordinates of doors\\n\",\n \"file_path\": \"core/src/dungeon/rogue/floor.rs\",\n \"rank\": 37,\n \"score\": 2.1033702940584766\n },\n {\n \"content\": \"use crate::font::{DrawInst, FontHandle};\\n\\nuse image::{gif::Frame, Pixel, Rgb, Rgba, RgbaImage};\\n\\nuse rect_iter::GetMut2D;\\n\\nuse rect_iter::RectRange;\\n\\nuse rogue_gym_core::dungeon::{Coord, X, Y};\\n\\nuse rogue_gym_core::error::{GameResult, ResultExt1};\\n\\nuse rogue_gym_uilib::Screen;\\n\\nuse rusttype::point;\\n\\nuse tuple_map::TupleMap2;\\n\\n\\n\\n#[derive(Debug, Fail)]\\n\\n#[fail(display = \\\"EncodeError\\\")]\\n\\npub struct EncodeError;\\n\\n\\n\\npub struct TermImage<'a: 'b, 'b> {\\n\\n buffer: RgbaImage,\\n\\n background: Rgba<u8>,\\n\\n fontcolor: Rgb<u8>,\\n\\n fontsize: u32,\\n\\n size: Coord,\\n\",\n \"file_path\": \"act2gif/src/term_image.rs\",\n \"rank\": 38,\n \"score\": 2.0779439551779473\n },\n {\n \"content\": \"pub mod tile;\\n\\npub mod ui;\\n\\n\\n\\nuse character::{enemies, player, EnemyHandler, Player};\\n\\nuse dungeon::{Direction, Dungeon, DungeonStyle, Positioned, X, Y};\\n\\nuse error::*;\\n\\nuse input::{InputCode, Key, KeyMap};\\n\\nuse item::{ItemHandler, ItemKind};\\n\\nuse ndarray::Array2;\\n\\npub use smallstr::SmallStr;\\n\\nuse tile::{Drawable, Tile};\\n\\nuse ui::{MordalKind, MordalMsg, UiState};\\n\\n\\n\\n/// Game configuration\\n\\n/// it's inteded to construct from json\\n\\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\\n\\npub struct GameConfig {\\n\\n /// screen width\\n\\n #[serde(default = \\\"default_screen_width\\\")]\\n\\n #[serde(skip_serializing_if = \\\"is_default_width\\\")]\\n\",\n \"file_path\": \"core/src/lib.rs\",\n \"rank\": 39,\n \"score\": 2.0758371138296052\n },\n {\n \"content\": \"pub mod floor;\\n\\npub mod maze;\\n\\npub mod passages;\\n\\npub mod rooms;\\n\\n\\n\\nuse self::floor::Floor;\\n\\npub use self::rooms::{Room, RoomKind};\\n\\nuse super::{Coord, Direction, Dungeon as DungeonTrait, DungeonPath, MoveResult, Positioned, X, Y};\\n\\nuse character::{player::Status as PlayerStatus, EnemyHandler};\\n\\nuse enum_iterator::IntoEnumIterator;\\n\\nuse error::*;\\n\\nuse item::{ItemHandler, ItemToken};\\n\\nuse ndarray::Array2;\\n\\nuse rect_iter::{Get2D, GetMut2D, RectRange};\\n\\nuse rng::RngHandle;\\n\\nuse std::collections::VecDeque;\\n\\nuse tile::{Drawable, Tile};\\n\\nuse tuple_map::TupleMap2;\\n\\nuse {GameInfo, GameMsg, GlobalConfig};\\n\\n\\n\",\n \"file_path\": \"core/src/dungeon/rogue/mod.rs\",\n \"rank\": 40,\n \"score\": 1.9725539522631452\n },\n {\n \"content\": \"use super::{DamageReaction, Defense, Dice, Exp, HitPoint, Level, Strength};\\n\\nuse crate::{Drawable, SmallStr};\\n\\nuse dungeon::{Dungeon, DungeonPath, MoveResult};\\n\\nuse item::ItemNum;\\n\\nuse rng::{Parcent, RngHandle};\\n\\nuse smallvec::SmallVec;\\n\\nuse std::cell::Cell;\\n\\nuse std::collections::BTreeMap;\\n\\nuse std::ops::Range;\\n\\nuse std::rc::{Rc, Weak};\\n\\nuse tile::Tile;\\n\\n\\n\\npub type DiceVec<T> = SmallVec<[Dice<T>; 4]>;\\n\\n\\n\\n#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]\\n\\npub struct Config {\\n\\n #[serde(default = \\\"default_enemies\\\")]\\n\\n pub enemies: Vec<Preset>,\\n\\n #[serde(default = \\\"default_appear_rate_gold\\\")]\\n\\n #[serde(skip_serializing_if = \\\"is_default_appear_rate_gold\\\")]\\n\",\n \"file_path\": \"core/src/character/enemies.rs\",\n \"rank\": 41,\n \"score\": 1.9014067761517843\n }\n]","isConversational":false}}},{"rowIdx":2990,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/bin/2019_day20.rs"},"repo_name":{"kind":"string","value":"ibookstein/aoc"},"commit":{"kind":"string","value":"6beb8369f80d47eef95022ced9a9b9a9bccc7d99"},"file_code":{"kind":"string","value":"use aoc::aoc_input::get_input;\nuse itertools::iproduct;\nuse std::collections::{HashMap, HashSet};\nuse std::convert::{TryFrom, TryInto};\nuse std::ops::Index;\nuse std::str::FromStr;\n\ntype Vertex = usize;\ntype Label = (usize, usize);\ntype LabelMap = HashMap<Label, Vertex>;\ntype VertexSet = HashSet<Vertex>;\ntype AdjacencyList = Vec<VertexSet>;\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq)]\nenum BfsReply {\n Halt,\n Continue,\n}\n\n#[derive(Debug)]\nstruct Graph {\n label_map: LabelMap,\n adj_list: AdjacencyList,\n}\n\nimpl Graph {\n fn new() -> Graph {\n Graph {\n label_map: LabelMap::new(),\n adj_list: AdjacencyList::new(),\n }\n }\n\n fn get_or_insert_vertex(&mut self, label: &Label) -> Vertex {\n match self.label_map.get(label) {\n Some(v) => *v,\n None => {\n let new_vertex = self.adj_list.len();\n self.adj_list.push(VertexSet::new());\n self.label_map.insert(label.to_owned(), new_vertex);\n new_vertex\n }\n }\n }\n\n fn add_edge_by_labels(&mut self, from_label: &Label, to_label: &Label) {\n let from_vertex = self.get_or_insert_vertex(from_label);\n let to_vertex = self.get_or_insert_vertex(to_label);\n self.adj_list[from_vertex].insert(to_vertex);\n }\n\n fn add_bidirectional_edge_by_labels(&mut self, label1: &Label, label2: &Label) {\n self.add_edge_by_labels(label1, label2);\n self.add_edge_by_labels(label2, label1);\n }\n\n fn bfs_layers(&self, origin: Vertex, mut func: impl FnMut(usize, &VertexSet) -> BfsReply) {\n let mut visited = VertexSet::new();\n visited.insert(origin);\n let mut current_layer = VertexSet::new();\n current_layer.insert(origin);\n let mut depth = 0usize;\n\n while !current_layer.is_empty() {\n match func(depth, ¤t_layer) {\n BfsReply::Halt => return,\n BfsReply::Continue => (),\n }\n\n let new_layer: VertexSet = current_layer\n .iter()\n .flat_map(|v| &self.adj_list[*v])\n .cloned()\n .filter(|v| !visited.contains(v))\n .collect();\n\n visited.extend(&new_layer);\n current_layer = new_layer;\n depth += 1;\n }\n }\n}\n\n#[derive(Debug)]\nstruct AsciiGrid {\n grid: Vec<u8>,\n width: usize,\n}\n\nimpl AsciiGrid {\n fn height(&self) -> usize {\n self.grid.len() / self.width\n }\n\n fn width(&self) -> usize {\n self.width\n }\n}\n\nimpl Index<Label> for AsciiGrid {\n type Output = u8;\n\n fn index(&self, index: Label) -> &Self::Output {\n self.grid.index(self.width * index.1 + index.0)\n }\n}\n\nimpl FromStr for AsciiGrid {\n type Err = &'static str;\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n let mut grid: Vec<u8> = Vec::new();\n let mut width: Option<usize> = None;\n\n for line in s.lines() {\n if !line.is_ascii() {\n return Err(\"Non-ASCII line\");\n }\n if line.is_empty() {\n return Err(\"Empty line\");\n }\n if width.is_some() && width.unwrap() != line.len() {\n return Err(\"Non-uniform line length\");\n }\n\n width = Some(line.len());\n grid.extend(line.bytes());\n }\n\n if grid.len() == 0 {\n return Err(\"No lines\");\n }\n\n Ok(AsciiGrid {\n grid,\n width: width.unwrap(),\n })\n }\n}\n\n#[derive(Debug)]\nstruct Maze {\n graph: Graph,\n start: Vertex,\n end: Vertex,\n}\n\nimpl TryFrom<&AsciiGrid> for Maze {\n type Error = &'static str;\n\n fn try_from(grid: &AsciiGrid) -> Result<Self, Self::Error> {\n let width = grid.width();\n let height = grid.height();\n\n let mid_x = width / 2;\n let mid_y = height / 2;\n\n let wall = '#' as u8;\n let empty = '.' as u8;\n let space = ' ' as u8;\n let tiles = [wall, empty];\n\n let left_width = (2..width - 2)\n .take_while(|x| tiles.contains(&grid[(*x, mid_y)]))\n .count();\n let right_width = (2..width - 2)\n .rev()\n .take_while(|x| tiles.contains(&grid[(*x, mid_y)]))\n .count();\n let top_height = (2..height - 2)\n .take_while(|y| tiles.contains(&grid[(mid_x, *y)]))\n .count();\n let bottom_height = (2..height - 2)\n .rev()\n .take_while(|y| tiles.contains(&grid[(mid_x, *y)]))\n .count();\n\n let mut portals = HashMap::<[u8; 2], Vec<Label>>::new();\n\n let outer_ys = 2..height - 2;\n let inner_ys = 4 + top_height..height - bottom_height - 4;\n let outer_xs = 2..width - 2;\n let inner_xs = 4 + left_width..width - right_width - 4;\n\n let leftbound1 = outer_ys.clone().map(|y| (0, y));\n let leftbound2 = inner_ys.clone().map(|y| (width - right_width - 4, y));\n for (x, y) in leftbound1.chain(leftbound2) {\n let key = [grid[(x, y)], grid[(x + 1, y)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x + 2, y));\n }\n }\n\n let rightbound1 = inner_ys.map(|y| (2 + left_width, y));\n let rightbound2 = outer_ys.map(|y| (width - 2, y));\n for (x, y) in rightbound1.chain(rightbound2) {\n let key = [grid[(x, y)], grid[(x + 1, y)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x - 1, y));\n }\n }\n\n let topbound1 = outer_xs.clone().map(|x| (x, 0));\n let topbound2 = inner_xs.clone().map(|x| (x, height - bottom_height - 4));\n for (x, y) in topbound1.chain(topbound2) {\n let key = [grid[(x, y)], grid[(x, y + 1)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x, y + 2));\n }\n }\n\n let bottombound1 = inner_xs.map(|x| (x, 2 + top_height));\n let bottombound2 = outer_xs.map(|x| (x, height - 2));\n for (x, y) in bottombound1.chain(bottombound2) {\n let key = [grid[(x, y)], grid[(x, y + 1)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x, y - 1));\n }\n }\n\n let start_portal = ['A' as u8; 2];\n let end_portal = ['Z' as u8; 2];\n\n let mut graph = Graph::new();\n let mut start: Option<Vertex> = None;\n let mut end: Option<Vertex> = None;\n\n for (key, value) in portals.iter() {\n match value[..] {\n [point] => {\n if *key == start_portal {\n start = Some(graph.get_or_insert_vertex(&point))\n } else if *key == end_portal {\n end = Some(graph.get_or_insert_vertex(&point))\n } else {\n return Err(\"Bad portal\");\n }\n }\n [point1, point2] => graph.add_bidirectional_edge_by_labels(&point1, &point2),\n _ => {\n return Err(\"Bad portal\");\n }\n }\n }\n\n if start.is_none() {\n return Err(\"Start portal not found\");\n }\n if end.is_none() {\n return Err(\"End portal not found\");\n }\n\n for coord in iproduct!(2..width - 2, 2..height - 2) {\n if grid[coord] != empty {\n continue;\n }\n\n let (x, y) = coord;\n let adjacents = [(x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)];\n for adj in adjacents.iter().copied() {\n if grid[adj] != empty {\n continue;\n }\n graph.add_bidirectional_edge_by_labels(&coord, &adj);\n }\n }\n\n Ok(Maze {\n graph,\n start: start.unwrap(),\n end: end.unwrap(),\n })\n }\n}\n\nimpl Maze {\n fn start_end_distance(&self) -> usize {\n let mut result: Option<usize> = None;\n self.graph.bfs_layers(self.start, |depth, layer| {\n if layer.contains(&self.end) {\n result = Some(depth);\n BfsReply::Halt\n } else {\n BfsReply::Continue\n }\n });\n result.unwrap()\n }\n}\n\nfn main() {\n let input = get_input(2019, 20);\n let grid: AsciiGrid = input.parse().unwrap();\n let maze: Maze = (&grid).try_into().unwrap();\n println!(\"Start-end distance: {}\", maze.start_end_distance());\n}\n"},"prefix":{"kind":"string","value":"use aoc::aoc_input::get_input;\nuse itertools::iproduct;\nuse std::collections::{HashMap, HashSet};\nuse std::convert::{TryFrom, TryInto};\nuse std::ops::Index;\nuse std::str::FromStr;\n\ntype Vertex = usize;\ntype Label = (usize, usize);\ntype LabelMap = HashMap<Label, Vertex>;\ntype VertexSet = HashSet<Vertex>;\ntype AdjacencyList = Vec<VertexSet>;\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq)]\nenum BfsReply {\n Halt,\n Continue,\n}\n\n#[derive(Debug)]\nstruct Graph {\n label_map: LabelMap,\n adj_list: AdjacencyList,\n}\n\nimpl Graph {\n fn new() -> Graph {\n Graph {\n label_map: LabelMap::new(),\n adj_list: AdjacencyList::new(),\n }\n }\n\n fn get_or_insert_vertex(&mut self, label: &Label) -> Vertex {\n match self.label_map.get(label) {\n Some(v) => *v,\n None => {\n let new_vertex = self.adj_list.len();\n self.adj_list.push(VertexSet::new());\n self.label_map.insert(label.to_owned(), new_vertex);\n new_vertex\n }\n }\n }\n\n fn add_edge_by_labels(&mut self, from_label: &Label, to_label: &Label) {\n let from_vertex = self.get_or_insert_vertex(from_label);\n let to_vertex = self.get_or_insert_vertex(to_label);\n self.adj_list[from_vertex].insert(to_vertex);\n }\n\n fn add_bidirectional_edge_by_labels(&mut self, label1: &Label, label2: &Label) {\n self.add_edge_by_labels(label1, label2);\n self.add_edge_by_labels(label2, label1);\n }\n\n fn bfs_layers(&self, origin: Vertex, mut func: impl FnMut(usize, &VertexSet) -> BfsReply) {\n let mut visited = VertexSet::new();\n visited.insert(origin);\n let mut current_layer = VertexSet::new();\n current_layer.insert(origin);\n let mut depth = 0usize;\n\n while !current_layer.is_e"},"suffix":{"kind":"string","value":"nsert_vertex(&point))\n } else if *key == end_portal {\n end = Some(graph.get_or_insert_vertex(&point))\n } else {\n return Err(\"Bad portal\");\n }\n }\n [point1, point2] => graph.add_bidirectional_edge_by_labels(&point1, &point2),\n _ => {\n return Err(\"Bad portal\");\n }\n }\n }\n\n if start.is_none() {\n return Err(\"Start portal not found\");\n }\n if end.is_none() {\n return Err(\"End portal not found\");\n }\n\n for coord in iproduct!(2..width - 2, 2..height - 2) {\n if grid[coord] != empty {\n continue;\n }\n\n let (x, y) = coord;\n let adjacents = [(x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)];\n for adj in adjacents.iter().copied() {\n if grid[adj] != empty {\n continue;\n }\n graph.add_bidirectional_edge_by_labels(&coord, &adj);\n }\n }\n\n Ok(Maze {\n graph,\n start: start.unwrap(),\n end: end.unwrap(),\n })\n }\n}\n\nimpl Maze {\n fn start_end_distance(&self) -> usize {\n let mut result: Option<usize> = None;\n self.graph.bfs_layers(self.start, |depth, layer| {\n if layer.contains(&self.end) {\n result = Some(depth);\n BfsReply::Halt\n } else {\n BfsReply::Continue\n }\n });\n result.unwrap()\n }\n}\n\nfn main() {\n let input = get_input(2019, 20);\n let grid: AsciiGrid = input.parse().unwrap();\n let maze: Maze = (&grid).try_into().unwrap();\n println!(\"Start-end distance: {}\", maze.start_end_distance());\n}\n"},"middle":{"kind":"string","value":"mpty() {\n match func(depth, ¤t_layer) {\n BfsReply::Halt => return,\n BfsReply::Continue => (),\n }\n\n let new_layer: VertexSet = current_layer\n .iter()\n .flat_map(|v| &self.adj_list[*v])\n .cloned()\n .filter(|v| !visited.contains(v))\n .collect();\n\n visited.extend(&new_layer);\n current_layer = new_layer;\n depth += 1;\n }\n }\n}\n\n#[derive(Debug)]\nstruct AsciiGrid {\n grid: Vec<u8>,\n width: usize,\n}\n\nimpl AsciiGrid {\n fn height(&self) -> usize {\n self.grid.len() / self.width\n }\n\n fn width(&self) -> usize {\n self.width\n }\n}\n\nimpl Index<Label> for AsciiGrid {\n type Output = u8;\n\n fn index(&self, index: Label) -> &Self::Output {\n self.grid.index(self.width * index.1 + index.0)\n }\n}\n\nimpl FromStr for AsciiGrid {\n type Err = &'static str;\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n let mut grid: Vec<u8> = Vec::new();\n let mut width: Option<usize> = None;\n\n for line in s.lines() {\n if !line.is_ascii() {\n return Err(\"Non-ASCII line\");\n }\n if line.is_empty() {\n return Err(\"Empty line\");\n }\n if width.is_some() && width.unwrap() != line.len() {\n return Err(\"Non-uniform line length\");\n }\n\n width = Some(line.len());\n grid.extend(line.bytes());\n }\n\n if grid.len() == 0 {\n return Err(\"No lines\");\n }\n\n Ok(AsciiGrid {\n grid,\n width: width.unwrap(),\n })\n }\n}\n\n#[derive(Debug)]\nstruct Maze {\n graph: Graph,\n start: Vertex,\n end: Vertex,\n}\n\nimpl TryFrom<&AsciiGrid> for Maze {\n type Error = &'static str;\n\n fn try_from(grid: &AsciiGrid) -> Result<Self, Self::Error> {\n let width = grid.width();\n let height = grid.height();\n\n let mid_x = width / 2;\n let mid_y = height / 2;\n\n let wall = '#' as u8;\n let empty = '.' as u8;\n let space = ' ' as u8;\n let tiles = [wall, empty];\n\n let left_width = (2..width - 2)\n .take_while(|x| tiles.contains(&grid[(*x, mid_y)]))\n .count();\n let right_width = (2..width - 2)\n .rev()\n .take_while(|x| tiles.contains(&grid[(*x, mid_y)]))\n .count();\n let top_height = (2..height - 2)\n .take_while(|y| tiles.contains(&grid[(mid_x, *y)]))\n .count();\n let bottom_height = (2..height - 2)\n .rev()\n .take_while(|y| tiles.contains(&grid[(mid_x, *y)]))\n .count();\n\n let mut portals = HashMap::<[u8; 2], Vec<Label>>::new();\n\n let outer_ys = 2..height - 2;\n let inner_ys = 4 + top_height..height - bottom_height - 4;\n let outer_xs = 2..width - 2;\n let inner_xs = 4 + left_width..width - right_width - 4;\n\n let leftbound1 = outer_ys.clone().map(|y| (0, y));\n let leftbound2 = inner_ys.clone().map(|y| (width - right_width - 4, y));\n for (x, y) in leftbound1.chain(leftbound2) {\n let key = [grid[(x, y)], grid[(x + 1, y)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x + 2, y));\n }\n }\n\n let rightbound1 = inner_ys.map(|y| (2 + left_width, y));\n let rightbound2 = outer_ys.map(|y| (width - 2, y));\n for (x, y) in rightbound1.chain(rightbound2) {\n let key = [grid[(x, y)], grid[(x + 1, y)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x - 1, y));\n }\n }\n\n let topbound1 = outer_xs.clone().map(|x| (x, 0));\n let topbound2 = inner_xs.clone().map(|x| (x, height - bottom_height - 4));\n for (x, y) in topbound1.chain(topbound2) {\n let key = [grid[(x, y)], grid[(x, y + 1)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x, y + 2));\n }\n }\n\n let bottombound1 = inner_xs.map(|x| (x, 2 + top_height));\n let bottombound2 = outer_xs.map(|x| (x, height - 2));\n for (x, y) in bottombound1.chain(bottombound2) {\n let key = [grid[(x, y)], grid[(x, y + 1)]];\n if key[0] != space {\n portals.entry(key).or_default().push((x, y - 1));\n }\n }\n\n let start_portal = ['A' as u8; 2];\n let end_portal = ['Z' as u8; 2];\n\n let mut graph = Graph::new();\n let mut start: Option<Vertex> = None;\n let mut end: Option<Vertex> = None;\n\n for (key, value) in portals.iter() {\n match value[..] {\n [point] => {\n if *key == start_portal {\n start = Some(graph.get_or_i"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn digits<T>(mut num: T, radix: T) -> impl Iterator<Item = T>\n\nwhere\n\n T: UnsignedDigits<T>,\n\n{\n\n let zero = T::zero();\n\n\n\n let mut divisor = T::one();\n\n while num >= divisor * radix {\n\n divisor *= radix;\n\n }\n\n\n\n std::iter::from_fn(move || {\n\n if divisor == zero {\n\n None\n\n } else {\n\n let v = num / divisor;\n\n num %= divisor;\n\n divisor /= radix;\n\n Some(v)\n\n }\n\n })\n\n}\n","file_path":"src/digits.rs","rank":0,"score":74380.28518279849},{"content":"pub fn new_stream_ref_from_iter(iter: impl IntoIterator<Item = isize>) -> StreamRef {\n\n let s = new_stream_ref();\n\n s.borrow_mut().extend(iter);\n\n s\n\n}\n\n\n","file_path":"src/intcode.rs","rank":1,"score":69458.1229191116},{"content":"pub fn new_stream_ref() -> StreamRef {\n\n Rc::new(RefCell::new(Stream::new()))\n\n}\n\n\n","file_path":"src/intcode.rs","rank":2,"score":55004.535479674865},{"content":"pub fn split_exact<'a, const N: usize>(\n\n s: &'a str,\n\n pat: &str,\n\n) -> Result<[&'a str; N], &'static str> {\n\n iter_consume_exact(s.split(pat))\n\n}\n\n\n","file_path":"src/parse.rs","rank":3,"score":51273.35896979222},{"content":"pub fn parse_prefix_and_split<'a, const N: usize>(\n\n s: &'a str,\n\n prefix: &str,\n\n split_pat: &str,\n\n) -> Result<[&'a str; N], &'static str> {\n\n if !s.starts_with(prefix) {\n\n return Err(\"Invalid prefix\");\n\n }\n\n\n\n iter_consume_exact(s[prefix.len()..].split(split_pat))\n\n}\n","file_path":"src/parse.rs","rank":4,"score":49678.24875399699},{"content":"pub fn new_stream_ref_from(value: isize) -> StreamRef {\n\n let s = new_stream_ref();\n\n s.borrow_mut().push_back(value);\n\n s\n\n}\n\n\n","file_path":"src/intcode.rs","rank":5,"score":49283.4474934695},{"content":"pub fn iter_consume_exact<T, const N: usize>(\n\n mut iter: impl Iterator<Item = T>,\n\n) -> Result<[T; N], &'static str> {\n\n let mut data = MaybeUninit::<[T; N]>::uninit();\n\n let start: *mut T = unsafe { std::mem::transmute(&mut data) };\n\n\n\n for i in 0..N {\n\n let item = iter.next().ok_or(\"Insufficient items in iterator\")?;\n\n unsafe { start.offset(i as isize).write(item) }\n\n }\n\n\n\n if iter.next().is_some() {\n\n return Err(\"Too many items in iterator\");\n\n }\n\n\n\n Ok(unsafe { data.assume_init() })\n\n}\n\n\n","file_path":"src/parse.rs","rank":6,"score":48209.54349869874},{"content":"fn parse_addressing_mode(digit: usize) -> IntcodeResult<AddressingMode> {\n\n match digit {\n\n 0 => Ok(AddressingMode::AbsoluteAddress),\n\n 1 => Ok(AddressingMode::Immediate),\n\n 2 => Ok(AddressingMode::BasePointerRelative),\n\n _ => Err(IntcodeError::InvalidAddressingMode),\n\n }\n\n}\n\n\n\nimpl IntcodeMachine {\n\n pub fn new_io(tape: Tape, input: StreamRef, output: StreamRef) -> Self {\n\n IntcodeMachine {\n\n tape,\n\n input,\n\n output,\n\n pc: 0,\n\n bp: 0,\n\n }\n\n }\n\n\n","file_path":"src/intcode.rs","rank":7,"score":47879.722550785606},{"content":"#[derive(Debug)]\n\nstruct Operand {\n\n mode: AddressingMode,\n\n value: isize,\n\n}\n\n\n","file_path":"src/intcode.rs","rank":8,"score":47371.96394400817},{"content":"#[derive(Debug)]\n\nstruct Opcode {\n\n operation: Operation,\n\n operands: Vec<Operand>,\n\n}\n\n\n\npub type IntcodeResult<T> = Result<T, IntcodeError>;\n\npub type Tape = Vec<isize>;\n\npub type Stream = VecDeque<isize>;\n\npub type StreamRef = Rc<RefCell<Stream>>;\n\n\n\n#[derive(Debug)]\n\npub struct IntcodeMachine {\n\n tape: Tape,\n\n pub input: StreamRef,\n\n pub output: StreamRef,\n\n pc: isize,\n\n bp: isize,\n\n}\n\n\n","file_path":"src/intcode.rs","rank":9,"score":47371.96394400817},{"content":"#[derive(Debug)]\n\nenum Operation {\n\n Add,\n\n Multiply,\n\n Input,\n\n Output,\n\n JumpTrue,\n\n JumpFalse,\n\n LessThan,\n\n Equals,\n\n AdjustBasePointer,\n\n Halt,\n\n}\n\n\n","file_path":"src/intcode.rs","rank":10,"score":47371.96394400817},{"content":"#[derive(Debug)]\n\nenum AddressingMode {\n\n AbsoluteAddress,\n\n Immediate,\n\n BasePointerRelative,\n\n}\n\n\n","file_path":"src/intcode.rs","rank":11,"score":46065.34506574787},{"content":"fn get_session_key() -> String {\n\n let mut path = std::env::current_exe().unwrap();\n\n path.pop();\n\n path.push(&SESSION_FILE_PATH.iter().cloned().collect::<PathBuf>());\n\n\n\n let mut content = String::new();\n\n let mut file = File::open(path).unwrap();\n\n file.read_to_string(&mut content).unwrap();\n\n content.trim().to_string()\n\n}\n\n\n","file_path":"src/aoc_input.rs","rank":12,"score":37939.39677563337},{"content":"pub fn parse_intcode_program(input: &str) -> Tape {\n\n input\n\n .trim()\n\n .split(',')\n\n .map(|s| s.parse().unwrap())\n\n .collect::<Tape>()\n\n}\n","file_path":"src/intcode.rs","rank":13,"score":31889.245873714608},{"content":"pub fn manhattan_distance(lhs: Coord, rhs: Coord) -> isize {\n\n (lhs.0 - rhs.0).abs() + (lhs.1 - rhs.1).abs()\n\n}\n\n\n\n#[derive(Debug, Clone, Eq, PartialEq, Hash)]\n\npub struct CoordVec(Vec<isize>);\n\n\n\nimpl CoordVec {\n\n pub fn origin(n: usize) -> Self {\n\n Self(vec![0; n])\n\n }\n\n\n\n pub fn from_vec(v: Vec<isize>) -> Self {\n\n Self(v)\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Eq, PartialEq)]\n\npub struct DeltaVec(Vec<isize>);\n\n\n","file_path":"src/coordinates.rs","rank":14,"score":29256.0393932917},{"content":"pub fn div_round_nearest(dividend: isize, divisor: isize) -> isize {\n\n let sign = 1 - ((dividend < 0) ^ (divisor < 0)) as isize * 2;\n\n let (q, r) = dividend.div_rem(&divisor);\n\n q + (r.abs() > (divisor / 2).abs()) as isize * sign\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::assert_eq;\n\n\n\n use super::*;\n\n\n\n #[test]\n\n fn test_div_round_nearest() {\n\n assert_eq!(div_round_nearest(8, 3), 3);\n\n assert_eq!(div_round_nearest(8, -3), -3);\n\n assert_eq!(div_round_nearest(-8, 3), -3);\n\n assert_eq!(div_round_nearest(-8, -3), 3);\n\n\n\n assert_eq!(div_round_nearest(10, 3), 3);\n\n assert_eq!(div_round_nearest(10, -3), -3);\n\n assert_eq!(div_round_nearest(-10, 3), -3);\n\n assert_eq!(div_round_nearest(-10, -3), 3);\n\n }\n\n}\n","file_path":"src/num.rs","rank":15,"score":28587.99471694339},{"content":"pub fn get_input(year: u16, day: u8) -> String {\n\n try_get_input(year, day).expect(\"Failed getting input\")\n\n}\n","file_path":"src/aoc_input.rs","rank":16,"score":28587.99471694339},{"content":"fn try_get_input(year: u16, day: u8) -> Result<String, Box<dyn Error>> {\n\n let mut path = PathBuf::new();\n\n path.push(std::env::current_exe()?.parent().unwrap());\n\n path.push(CACHE_DIR);\n\n let filename = format!(\"{}_{}.txt\", year, day);\n\n path.push(&filename);\n\n\n\n let _ = std::fs::create_dir(path.parent().unwrap());\n\n\n\n if path.exists() {\n\n println!(\"Cache hit for {}\", &filename);\n\n Ok(std::fs::read_to_string(path)?)\n\n } else {\n\n println!(\"Cache miss for {}\", &filename);\n\n let input_str = get_input_web(year, day)?;\n\n std::fs::write(path, &input_str)?;\n\n Ok(input_str)\n\n }\n\n}\n\n\n","file_path":"src/aoc_input.rs","rank":17,"score":24321.615318162214},{"content":"fn get_input_web(year: u16, day: u8) -> Result<String, Box<dyn Error>> {\n\n let url_str = format!(\"https://adventofcode.com/{}/day/{}/input\", year, day);\n\n let mut headers = HeaderMap::new();\n\n headers.insert(\n\n COOKIE,\n\n format!(\"session={}\", get_session_key()).parse().unwrap(),\n\n );\n\n let resp = Client::new().get(&url_str).headers(headers).send()?;\n\n Ok(resp.text()?)\n\n}\n\n\n","file_path":"src/aoc_input.rs","rank":18,"score":24321.615318162214},{"content":"use num_traits::{Signed, Zero};\n\nuse std::ops::{Add, AddAssign, Index, Mul, MulAssign, Neg, Sub, SubAssign};\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\n\npub struct VecN<T, const N: usize>([T; N]);\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\n\npub struct Scalar<T>(T);\n\n\n\nimpl<T: Copy + Zero, const N: usize> VecN<T, N> {\n\n pub fn zero() -> Self {\n\n Self([T::zero(); N])\n\n }\n\n\n\n pub fn new(inner: [T; N]) -> Self {\n\n Self(inner)\n\n }\n\n\n\n pub fn len(&self) -> usize {\n\n self.0.len()\n","file_path":"src/vec.rs","rank":19,"score":10.586749144552034},{"content":" }\n\n}\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, EnumIter, IntoPrimitive, TryFromPrimitive)]\n\n#[repr(u8)]\n\npub enum Direction {\n\n Up = 0,\n\n Right = 1,\n\n Down = 2,\n\n Left = 3,\n\n}\n\n\n\nimpl Direction {\n\n pub fn turn(self, to: Turn) -> Self {\n\n let res = (u8::from(self) + u8::from(to)) % 4;\n\n Direction::try_from(res).unwrap()\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, EnumIter)]\n","file_path":"src/coordinates.rs","rank":20,"score":9.875298495522745},{"content":" fn size_hint(&self) -> (usize, Option<usize>) {\n\n self.iter.size_hint()\n\n }\n\n}\n\n\n\nimpl<'a, T> FusedIterator for GridIterMut<'a, T> {}\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\npub struct Grid<T> {\n\n grid: Vec<T>,\n\n width: usize,\n\n}\n\n\n\nimpl<T> Grid<T>\n\nwhere\n\n T: Default,\n\n{\n\n pub fn new(width: usize, height: usize) -> Self {\n\n let mut grid = Vec::new();\n\n grid.resize_with(width * height, Default::default);\n","file_path":"src/grid.rs","rank":21,"score":9.806360286958265},{"content":"use num_enum::{IntoPrimitive, TryFromPrimitive};\n\nuse std::convert::{From, TryFrom};\n\nuse std::ops::{Add, AddAssign, Mul};\n\nuse strum_macros::EnumIter;\n\n\n\n#[derive(Debug, Copy, Clone, PartialEq, Eq, IntoPrimitive, TryFromPrimitive)]\n\n#[repr(u8)]\n\npub enum Turn {\n\n Front = 0,\n\n Right = 1,\n\n Back = 2,\n\n Left = 3,\n\n}\n\n\n\nimpl Mul<Turn> for isize {\n\n type Output = Turn;\n\n\n\n fn mul(self, rhs: Turn) -> Self::Output {\n\n let n = self.rem_euclid(4) as u8;\n\n Turn::try_from((n * u8::from(rhs)) % 4).unwrap()\n","file_path":"src/coordinates.rs","rank":22,"score":8.521303942680099},{"content":" }\n\n\n\n pub fn values_mut(&mut self) -> impl Iterator<Item = &mut T> {\n\n self.grid.iter_mut()\n\n }\n\n\n\n fn index_for(&self, c: Coord) -> Option<usize> {\n\n let Coord(x, y) = c;\n\n if x < 0 || y < 0 {\n\n return None;\n\n }\n\n\n\n let (x, y) = (x as usize, y as usize);\n\n let (w, h) = (self.width(), self.height());\n\n if x < w && y < h {\n\n Some(x + w * y)\n\n } else {\n\n None\n\n }\n\n }\n","file_path":"src/grid.rs","rank":23,"score":8.37954393010667},{"content":" }\n\n\n\n fn size_hint(&self) -> (usize, Option<usize>) {\n\n self.iter.size_hint()\n\n }\n\n}\n\n\n\nimpl<'a, T> FusedIterator for GridIter<'a, T> {}\n\n\n\n#[derive(Debug)]\n\npub struct GridIterMut<'a, T: 'a> {\n\n iter: std::slice::IterMut<'a, T>,\n\n width: usize,\n\n coord: Coord,\n\n}\n\n\n\nimpl<'a, T> GridIterMut<'a, T> {\n\n pub fn new(grid: &'a mut Grid<T>) -> Self {\n\n Self {\n\n iter: grid.grid.iter_mut(),\n","file_path":"src/grid.rs","rank":24,"score":7.698520072640159},{"content":"impl Rotation {\n\n pub fn to_cw_count(&self) -> usize {\n\n match *self {\n\n Rotation::Cw0 => 0,\n\n Rotation::Cw90 => 1,\n\n Rotation::Cw180 => 2,\n\n Rotation::Cw270 => 3,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct GridIter<'a, T: 'a> {\n\n iter: std::slice::Iter<'a, T>,\n\n width: usize,\n\n coord: Coord,\n\n}\n\n\n\nimpl<'a, T> GridIter<'a, T> {\n\n pub fn new(grid: &'a Grid<T>) -> Self {\n","file_path":"src/grid.rs","rank":25,"score":7.504596086862804},{"content":" self.verify_addr(newbp)?;\n\n self.bp = newbp;\n\n }\n\n Operation::Halt => {\n\n self.pc = start_pc;\n\n return Ok(Some(StopStatus::Halted));\n\n }\n\n };\n\n\n\n Ok(None)\n\n }\n\n\n\n pub fn run(&mut self) -> IntcodeResult<StopStatus> {\n\n loop {\n\n match self.tick() {\n\n Ok(None) => continue,\n\n Ok(Some(status)) => return Ok(status),\n\n Err(e) => return Err(e),\n\n }\n\n }\n","file_path":"src/intcode.rs","rank":26,"score":7.491738739159216},{"content":"#[derive(Debug, Copy, Clone, Eq, PartialEq)]\n\npub struct Delta(pub isize, pub isize);\n\n\n\nimpl Delta {\n\n pub fn turn(&self, t: Turn) -> Delta {\n\n match t {\n\n Turn::Front => *self,\n\n Turn::Right => Delta(-self.1, self.0),\n\n Turn::Back => Delta(-self.0, -self.1),\n\n Turn::Left => Delta(self.1, -self.0),\n\n }\n\n }\n\n}\n\n\n\nimpl Add<Delta> for Coord {\n\n type Output = Coord;\n\n\n\n fn add(self, rhs: Delta) -> Self::Output {\n\n Coord(self.0 + rhs.0, self.1 + rhs.1)\n\n }\n","file_path":"src/coordinates.rs","rank":27,"score":7.2686426117660705},{"content":"{\n\n pub fn count_eq(&self, item: &T) -> usize {\n\n self.values().filter(|&e| e == item).count()\n\n }\n\n}\n\n\n\nimpl<T> Grid<T>\n\nwhere\n\n T: Clone,\n\n{\n\n pub fn rotate_clockwise_inplace(&mut self) {\n\n let w = self.width() as isize;\n\n let h = self.height() as isize;\n\n let mut v = Vec::with_capacity(self.grid.len());\n\n\n\n for x in 0..w {\n\n for y in (0..h).rev() {\n\n v.push(self.get(Coord(x, y)).unwrap().clone());\n\n }\n\n }\n","file_path":"src/grid.rs","rank":28,"score":6.868597476277547},{"content":" fn add(self, rhs: VecN<T, N>) -> Self::Output {\n\n let mut res = self;\n\n res += rhs;\n\n res\n\n }\n\n}\n\n\n\nimpl<T: Copy + MulAssign<T>, const N: usize> Mul<VecN<T, N>> for Scalar<T> {\n\n type Output = VecN<T, N>;\n\n\n\n fn mul(self, rhs: VecN<T, N>) -> Self::Output {\n\n let mut res = rhs;\n\n for c in res.0.iter_mut() {\n\n *c *= self.0;\n\n }\n\n res\n\n }\n\n}\n\n\n\nimpl<T: Copy + Neg<Output = T>, const N: usize> Neg for VecN<T, N> {\n","file_path":"src/vec.rs","rank":29,"score":6.840618204187196},{"content":" width: grid.width,\n\n coord: Coord::origin(),\n\n }\n\n }\n\n}\n\n\n\nimpl<'a, T> Iterator for GridIterMut<'a, T> {\n\n type Item = (Coord, &'a mut T);\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let res = (self.coord, self.iter.next()?);\n\n if self.coord.0 as usize == self.width - 1 {\n\n self.coord.0 = 0;\n\n self.coord.1 += 1;\n\n } else {\n\n self.coord.0 += 1;\n\n }\n\n Some(res)\n\n }\n\n\n","file_path":"src/grid.rs","rank":30,"score":6.827607863781044},{"content":"pub enum Direction8 {\n\n North,\n\n NorthEast,\n\n East,\n\n SouthEast,\n\n South,\n\n SouthWest,\n\n West,\n\n NorthWest,\n\n}\n\n\n\n#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]\n\npub struct Coord(pub isize, pub isize);\n\n\n\nimpl Coord {\n\n pub fn origin() -> Coord {\n\n Coord(0, 0)\n\n }\n\n}\n\n\n","file_path":"src/coordinates.rs","rank":31,"score":6.804141944477849},{"content":" }\n\n}\n\n\n\nimpl<T, const N: usize> Index<usize> for VecN<T, N> {\n\n type Output = T;\n\n\n\n fn index(&self, index: usize) -> &Self::Output {\n\n &self.0[index]\n\n }\n\n}\n\n\n\nimpl<T: Copy + SubAssign, const N: usize> SubAssign<VecN<T, N>> for VecN<T, N> {\n\n fn sub_assign(&mut self, rhs: VecN<T, N>) {\n\n for i in 0..self.0.len() {\n\n self.0[i] -= rhs.0[i];\n\n }\n\n }\n\n}\n\n\n\nimpl<T: Copy + SubAssign, const N: usize> Sub<VecN<T, N>> for VecN<T, N> {\n","file_path":"src/vec.rs","rank":32,"score":6.668905254562867},{"content":"\n\n self.grid = v;\n\n self.width = h as usize;\n\n }\n\n\n\n pub fn rotate_inplace(&mut self, rotation: Rotation) {\n\n for _ in 0..rotation.to_cw_count() {\n\n self.rotate_clockwise_inplace();\n\n }\n\n }\n\n}\n\n\n\nimpl<T> FromStr for Grid<T>\n\nwhere\n\n T: TryFrom<char>,\n\n{\n\n type Err = &'static str;\n\n\n\n fn from_str(s: &str) -> Result<Self, Self::Err> {\n\n let mut grid: Vec<T> = Vec::new();\n","file_path":"src/grid.rs","rank":33,"score":6.562678425892871},{"content":" Self { grid, width }\n\n }\n\n}\n\n\n\nimpl<T> Grid<T> {\n\n pub fn from_vec_and_width(grid: Vec<T>, width: usize) -> Self {\n\n assert_eq!(grid.len() % width, 0);\n\n Self { grid, width }\n\n }\n\n\n\n pub fn height(&self) -> usize {\n\n self.grid.len() / self.width\n\n }\n\n\n\n pub fn width(&self) -> usize {\n\n self.width\n\n }\n\n\n\n pub fn len(&self) -> usize {\n\n self.grid.len()\n","file_path":"src/grid.rs","rank":34,"score":6.419489443399563},{"content":" Self {\n\n iter: grid.grid.iter(),\n\n width: grid.width,\n\n coord: Coord::origin(),\n\n }\n\n }\n\n}\n\n\n\nimpl<'a, T> Iterator for GridIter<'a, T> {\n\n type Item = (Coord, &'a T);\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let res = (self.coord, self.iter.next()?);\n\n if self.coord.0 as usize == self.width - 1 {\n\n self.coord.0 = 0;\n\n self.coord.1 += 1;\n\n } else {\n\n self.coord.0 += 1;\n\n }\n\n Some(res)\n","file_path":"src/grid.rs","rank":35,"score":6.247579937759485},{"content":" pub fn new(tape: Tape) -> Self {\n\n Self::new_io(tape, new_stream_ref(), new_stream_ref())\n\n }\n\n\n\n fn verify_addr(&mut self, addr: isize) -> IntcodeResult<usize> {\n\n if addr < 0 {\n\n return Err(IntcodeError::NegativeAddress);\n\n }\n\n\n\n let addr = addr as usize;\n\n if addr >= self.tape.len() {\n\n self.tape.resize(addr + 1, 0);\n\n }\n\n Ok(addr)\n\n }\n\n\n\n pub fn read_addr(&mut self, addr: isize) -> IntcodeResult<isize> {\n\n let addr = self.verify_addr(addr)?;\n\n Ok(self.tape[addr])\n\n }\n","file_path":"src/intcode.rs","rank":36,"score":6.211716997616638},{"content":"use crate::coordinates::Coord;\n\nuse std::convert::{TryFrom, TryInto};\n\nuse std::fmt::{Display, Write};\n\nuse std::iter::FusedIterator;\n\nuse std::str::FromStr;\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub enum Axis {\n\n Horizontal,\n\n Vertical,\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub enum Rotation {\n\n Cw0,\n\n Cw90,\n\n Cw180,\n\n Cw270,\n\n}\n\n\n","file_path":"src/grid.rs","rank":37,"score":6.061292385928891},{"content":" type Output = VecN<T, N>;\n\n\n\n fn neg(self) -> Self::Output {\n\n let mut res = self;\n\n for c in res.0.iter_mut() {\n\n *c = -*c;\n\n }\n\n res\n\n }\n\n}\n\n\n\nimpl<T: Zero + Copy + Signed + AddAssign, const N: usize> VecN<T, N> {\n\n pub fn manhattan_norm(&self) -> T {\n\n let mut norm = T::zero();\n\n for c in self.0.iter() {\n\n norm += c.abs();\n\n }\n\n norm\n\n }\n\n}\n\n\n\npub type ISizeVec3 = VecN<isize, 3>;\n","file_path":"src/vec.rs","rank":38,"score":5.763859748593008},{"content":" type Output = VecN<T, N>;\n\n\n\n fn sub(self, rhs: VecN<T, N>) -> Self::Output {\n\n let mut res = self;\n\n res -= rhs;\n\n res\n\n }\n\n}\n\n\n\nimpl<T: Copy + AddAssign, const N: usize> AddAssign<VecN<T, N>> for VecN<T, N> {\n\n fn add_assign(&mut self, rhs: VecN<T, N>) {\n\n for i in 0..self.0.len() {\n\n self.0[i] += rhs.0[i];\n\n }\n\n }\n\n}\n\n\n\nimpl<T: Copy + AddAssign, const N: usize> Add<VecN<T, N>> for VecN<T, N> {\n\n type Output = VecN<T, N>;\n\n\n","file_path":"src/vec.rs","rank":39,"score":5.752644100890617},{"content":" }\n\n\n\n pub fn is_empty(&self) -> bool {\n\n self.len() != 0\n\n }\n\n\n\n pub fn iter(&self) -> impl Iterator<Item = (Coord, &T)> {\n\n GridIter::new(self)\n\n }\n\n\n\n pub fn iter_mut(&mut self) -> impl Iterator<Item = (Coord, &mut T)> {\n\n GridIterMut::new(self)\n\n }\n\n\n\n pub fn keys<'a>(&'a self) -> impl Iterator<Item = Coord> + 'a {\n\n self.iter().map(|(c, _)| c)\n\n }\n\n\n\n pub fn values(&self) -> impl Iterator<Item = &T> {\n\n self.grid.iter()\n","file_path":"src/grid.rs","rank":40,"score":5.714605922091131},{"content":"impl DeltaVec {\n\n pub fn from_vec(v: Vec<isize>) -> Self {\n\n Self(v)\n\n }\n\n}\n\n\n\nimpl<'a, 'b> Add<&'b DeltaVec> for &'a CoordVec {\n\n type Output = CoordVec;\n\n\n\n fn add(self, rhs: &'b DeltaVec) -> Self::Output {\n\n let n = self.0.len();\n\n assert_eq!(n, rhs.0.len());\n\n let res: Vec<_> = (0..n).map(|i| self.0[i] + rhs.0[i]).collect();\n\n CoordVec(res)\n\n }\n\n}\n\n\n\nimpl<'a> AddAssign<&'a DeltaVec> for CoordVec {\n\n fn add_assign(&mut self, rhs: &'a DeltaVec) {\n\n *self = &*self + rhs;\n","file_path":"src/coordinates.rs","rank":41,"score":5.2827307135229},{"content":" }\n\n\n\n pub fn run_to_completion(&mut self) -> IntcodeResult<()> {\n\n match self.run()? {\n\n StopStatus::Halted => Ok(()),\n\n _ => Err(IntcodeError::DidNotRunToCompletion),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/intcode.rs","rank":42,"score":5.078721720067781},{"content":"}\n\n\n\nimpl Mul<Delta> for isize {\n\n type Output = Delta;\n\n\n\n fn mul(self, rhs: Delta) -> Self::Output {\n\n Delta(self * rhs.0, self * rhs.1)\n\n }\n\n}\n\n\n\nimpl From<Direction> for Delta {\n\n fn from(d: Direction) -> Self {\n\n match d {\n\n Direction::Up => Delta(0, -1),\n\n Direction::Down => Delta(0, 1),\n\n Direction::Left => Delta(-1, 0),\n\n Direction::Right => Delta(1, 0),\n\n }\n\n }\n\n}\n","file_path":"src/coordinates.rs","rank":43,"score":4.879918184897452},{"content":"}\n\n\n\nimpl AddAssign<Delta> for Coord {\n\n fn add_assign(&mut self, rhs: Delta) {\n\n *self = *self + rhs;\n\n }\n\n}\n\n\n\nimpl Add<Delta> for Delta {\n\n type Output = Delta;\n\n\n\n fn add(self, rhs: Delta) -> Self::Output {\n\n Delta(self.0 + rhs.0, self.1 + rhs.1)\n\n }\n\n}\n\n\n\nimpl AddAssign<Delta> for Delta {\n\n fn add_assign(&mut self, rhs: Delta) {\n\n *self = *self + rhs;\n\n }\n","file_path":"src/coordinates.rs","rank":44,"score":4.635715784778801},{"content":" }\n\n}\n\n\n\nimpl<'a, 'b> Add<&'b DeltaVec> for &'a DeltaVec {\n\n type Output = DeltaVec;\n\n\n\n fn add(self, rhs: &'b DeltaVec) -> Self::Output {\n\n let n = self.0.len();\n\n assert_eq!(n, rhs.0.len());\n\n let res: Vec<_> = (0..n).map(|i| self.0[i] + rhs.0[i]).collect();\n\n DeltaVec(res)\n\n }\n\n}\n\n\n\nimpl<'a> AddAssign<&'a DeltaVec> for DeltaVec {\n\n fn add_assign(&mut self, rhs: &'a DeltaVec) {\n\n *self = &*self + rhs;\n\n }\n\n}\n","file_path":"src/coordinates.rs","rank":45,"score":4.584280245192236},{"content":" let mut width: Option<usize> = None;\n\n\n\n for line in s.lines() {\n\n if line.is_empty() {\n\n return Err(\"Empty line\");\n\n }\n\n\n\n let mut cur_width = 0usize;\n\n for c in line.chars() {\n\n let item: T = c.try_into().or(Err(\"Failed parsing char\"))?;\n\n grid.push(item);\n\n cur_width += 1;\n\n }\n\n\n\n if width.is_some() && width.unwrap() != cur_width {\n\n return Err(\"Non-uniform line length\");\n\n }\n\n\n\n width = Some(cur_width);\n\n }\n","file_path":"src/grid.rs","rank":46,"score":4.280117930854635},{"content":"use crate::digits::digits;\n\nuse std::cell::RefCell;\n\nuse std::collections::VecDeque;\n\nuse std::rc::Rc;\n\n\n\n#[derive(Debug)]\n\npub enum IntcodeError {\n\n InvalidOpcodeOperation,\n\n NegativeOpcode,\n\n InvalidAddressingMode,\n\n NegativeAddress,\n\n InvalidStoreAddressingMode,\n\n DidNotRunToCompletion,\n\n}\n\n\n\n#[derive(Debug, PartialEq)]\n\npub enum StopStatus {\n\n Halted,\n\n BlockedOnInput,\n\n}\n\n\n\n#[derive(Debug)]\n","file_path":"src/intcode.rs","rank":47,"score":4.228034005327409},{"content":"\n\n let width = width.ok_or(\"No lines\")?;\n\n Ok(Grid { grid, width })\n\n }\n\n}\n\n\n\nimpl<T> Display for Grid<T>\n\nwhere\n\n T: Clone + Into<char>,\n\n{\n\n fn fmt(&self, fmt: &mut std::fmt::Formatter) -> std::fmt::Result {\n\n for y in 0..self.height() as isize {\n\n for x in 0..self.width() as isize {\n\n let e = self.get(Coord(x, y)).unwrap();\n\n fmt.write_char(e.clone().into())?;\n\n }\n\n fmt.write_char('\\n')?;\n\n }\n\n Ok(())\n\n }\n\n}\n","file_path":"src/grid.rs","rank":48,"score":3.752852344434581},{"content":" digits.extend(vec![0; 5 - digits.len()]);\n\n\n\n let (operation, operand_count) = match 10 * digits[1] + digits[0] {\n\n 1 => (Operation::Add, 3),\n\n 2 => (Operation::Multiply, 3),\n\n 3 => (Operation::Input, 1),\n\n 4 => (Operation::Output, 1),\n\n 5 => (Operation::JumpTrue, 2),\n\n 6 => (Operation::JumpFalse, 2),\n\n 7 => (Operation::LessThan, 3),\n\n 8 => (Operation::Equals, 3),\n\n 9 => (Operation::AdjustBasePointer, 1),\n\n 99 => (Operation::Halt, 0),\n\n _ => return Err(IntcodeError::InvalidOpcodeOperation),\n\n };\n\n\n\n let mut operands = Vec::<Operand>::new();\n\n for i in 0..operand_count {\n\n let mode = parse_addressing_mode(digits[2 + i])?;\n\n let value = self.read_pc()?;\n","file_path":"src/intcode.rs","rank":49,"score":3.632918366731699},{"content":"\n\nimpl From<Direction8> for Delta {\n\n fn from(d: Direction8) -> Self {\n\n match d {\n\n Direction8::North => Delta(0, -1),\n\n Direction8::NorthEast => Delta(1, -1),\n\n Direction8::East => Delta(1, 0),\n\n Direction8::SouthEast => Delta(1, 1),\n\n Direction8::South => Delta(0, 1),\n\n Direction8::SouthWest => Delta(-1, 1),\n\n Direction8::West => Delta(-1, 0),\n\n Direction8::NorthWest => Delta(-1, -1),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/coordinates.rs","rank":50,"score":3.509585613802387},{"content":" self.store(&opcode.operands[2], value)?;\n\n }\n\n Operation::Multiply => {\n\n let value = self.load(&opcode.operands[0])? * self.load(&opcode.operands[1])?;\n\n self.store(&opcode.operands[2], value)?;\n\n }\n\n Operation::Input => {\n\n let input = self.input.borrow_mut().pop_front();\n\n match input {\n\n Some(value) => self.store(&opcode.operands[0], value)?,\n\n None => {\n\n self.pc = start_pc;\n\n return Ok(Some(StopStatus::BlockedOnInput));\n\n }\n\n };\n\n }\n\n Operation::Output => {\n\n let value = self.load(&opcode.operands[0])?;\n\n self.output.borrow_mut().push_back(value);\n\n }\n","file_path":"src/intcode.rs","rank":51,"score":3.284004187769971},{"content":"\n\n pub fn get(&self, c: Coord) -> Option<&T> {\n\n let idx = self.index_for(c)?;\n\n self.grid.get(idx)\n\n }\n\n\n\n pub fn get_mut(&mut self, c: Coord) -> Option<&mut T> {\n\n let idx = self.index_for(c)?;\n\n self.grid.get_mut(idx)\n\n }\n\n\n\n pub fn flip_inplace(&mut self, axis: Axis) {\n\n let w = self.width() as isize;\n\n let h = self.height() as isize;\n\n match axis {\n\n Axis::Horizontal => {\n\n for y in 0..h / 2 {\n\n for x in 0..w {\n\n let i1 = self.index_for(Coord(x, y)).unwrap();\n\n let i2 = self.index_for(Coord(x, h - 1 - y)).unwrap();\n","file_path":"src/grid.rs","rank":52,"score":3.1911693120803633},{"content":"\n\n fn write_addr(&mut self, addr: isize, value: isize) -> IntcodeResult<()> {\n\n let addr = self.verify_addr(addr)?;\n\n self.tape[addr] = value;\n\n Ok(())\n\n }\n\n\n\n fn read_pc(&mut self) -> IntcodeResult<isize> {\n\n let value = self.read_addr(self.pc)?;\n\n self.pc += 1;\n\n Ok(value)\n\n }\n\n\n\n fn read_opcode(&mut self) -> IntcodeResult<Opcode> {\n\n let opcode = self.read_pc()?;\n\n if opcode < 0 {\n\n return Err(IntcodeError::NegativeOpcode);\n\n }\n\n\n\n let mut digits: Vec<_> = digits(opcode as usize, 10).collect();\n","file_path":"src/intcode.rs","rank":53,"score":2.8193152118319946},{"content":"use reqwest::blocking::Client;\n\nuse reqwest::header::{HeaderMap, COOKIE};\n\nuse std::error::Error;\n\nuse std::fs::File;\n\nuse std::io::prelude::*;\n\nuse std::path::PathBuf;\n\n\n\nconst CACHE_DIR: &str = \"input_cache\";\n\nconst SESSION_FILE_PATH: &[&str] = &[\"..\", \"..\", \"session.txt\"];\n\n\n","file_path":"src/aoc_input.rs","rank":54,"score":2.776517134148186},{"content":" self.grid.swap(i1, i2);\n\n }\n\n }\n\n }\n\n Axis::Vertical => {\n\n for x in 0..w / 2 {\n\n for y in 0..h {\n\n let i1 = self.index_for(Coord(x, y)).unwrap();\n\n let i2 = self.index_for(Coord(w - 1 - x, y)).unwrap();\n\n self.grid.swap(i1, i2);\n\n }\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n\nimpl<T> Grid<T>\n\nwhere\n\n T: std::cmp::PartialEq,\n","file_path":"src/grid.rs","rank":55,"score":2.646903793636519},{"content":" operands.push(Operand { mode, value });\n\n }\n\n\n\n Ok(Opcode {\n\n operation,\n\n operands,\n\n })\n\n }\n\n\n\n fn load(&mut self, op: &Operand) -> IntcodeResult<isize> {\n\n match op.mode {\n\n AddressingMode::AbsoluteAddress => Ok(self.read_addr(op.value)?),\n\n AddressingMode::Immediate => Ok(op.value),\n\n AddressingMode::BasePointerRelative => Ok(self.read_addr(self.bp + op.value)?),\n\n }\n\n }\n\n\n\n fn store(&mut self, op: &Operand, value: isize) -> IntcodeResult<()> {\n\n match op.mode {\n\n AddressingMode::AbsoluteAddress => Ok(self.write_addr(op.value, value)?),\n","file_path":"src/intcode.rs","rank":56,"score":2.5218095175661497},{"content":"use num_integer::Integer;\n\n\n","file_path":"src/num.rs","rank":57,"score":2.520612348795983},{"content":"use std::mem::MaybeUninit;\n\n\n","file_path":"src/parse.rs","rank":58,"score":2.441799427940077},{"content":"use num_traits::{sign::Unsigned, AsPrimitive, One, Zero};\n\nuse std::ops::{DivAssign, MulAssign, RemAssign};\n\n\n","file_path":"src/digits.rs","rank":59,"score":2.412630603248221},{"content":" AddressingMode::BasePointerRelative => Ok(self.write_addr(self.bp + op.value, value)?),\n\n AddressingMode::Immediate => Err(IntcodeError::InvalidStoreAddressingMode),\n\n }\n\n }\n\n\n\n fn jump_conditional(&mut self, condition: bool, target: isize) -> IntcodeResult<()> {\n\n if condition {\n\n self.verify_addr(target)?;\n\n self.pc = target;\n\n }\n\n Ok(())\n\n }\n\n\n\n fn tick(&mut self) -> IntcodeResult<Option<StopStatus>> {\n\n let start_pc = self.pc;\n\n let opcode = self.read_opcode()?;\n\n\n\n match opcode.operation {\n\n Operation::Add => {\n\n let value = self.load(&opcode.operands[0])? + self.load(&opcode.operands[1])?;\n","file_path":"src/intcode.rs","rank":60,"score":2.058047099974774}],"string":"[\n {\n \"content\": \"pub fn digits<T>(mut num: T, radix: T) -> impl Iterator<Item = T>\\n\\nwhere\\n\\n T: UnsignedDigits<T>,\\n\\n{\\n\\n let zero = T::zero();\\n\\n\\n\\n let mut divisor = T::one();\\n\\n while num >= divisor * radix {\\n\\n divisor *= radix;\\n\\n }\\n\\n\\n\\n std::iter::from_fn(move || {\\n\\n if divisor == zero {\\n\\n None\\n\\n } else {\\n\\n let v = num / divisor;\\n\\n num %= divisor;\\n\\n divisor /= radix;\\n\\n Some(v)\\n\\n }\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"src/digits.rs\",\n \"rank\": 0,\n \"score\": 74380.28518279849\n },\n {\n \"content\": \"pub fn new_stream_ref_from_iter(iter: impl IntoIterator<Item = isize>) -> StreamRef {\\n\\n let s = new_stream_ref();\\n\\n s.borrow_mut().extend(iter);\\n\\n s\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 1,\n \"score\": 69458.1229191116\n },\n {\n \"content\": \"pub fn new_stream_ref() -> StreamRef {\\n\\n Rc::new(RefCell::new(Stream::new()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 2,\n \"score\": 55004.535479674865\n },\n {\n \"content\": \"pub fn split_exact<'a, const N: usize>(\\n\\n s: &'a str,\\n\\n pat: &str,\\n\\n) -> Result<[&'a str; N], &'static str> {\\n\\n iter_consume_exact(s.split(pat))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parse.rs\",\n \"rank\": 3,\n \"score\": 51273.35896979222\n },\n {\n \"content\": \"pub fn parse_prefix_and_split<'a, const N: usize>(\\n\\n s: &'a str,\\n\\n prefix: &str,\\n\\n split_pat: &str,\\n\\n) -> Result<[&'a str; N], &'static str> {\\n\\n if !s.starts_with(prefix) {\\n\\n return Err(\\\"Invalid prefix\\\");\\n\\n }\\n\\n\\n\\n iter_consume_exact(s[prefix.len()..].split(split_pat))\\n\\n}\\n\",\n \"file_path\": \"src/parse.rs\",\n \"rank\": 4,\n \"score\": 49678.24875399699\n },\n {\n \"content\": \"pub fn new_stream_ref_from(value: isize) -> StreamRef {\\n\\n let s = new_stream_ref();\\n\\n s.borrow_mut().push_back(value);\\n\\n s\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 5,\n \"score\": 49283.4474934695\n },\n {\n \"content\": \"pub fn iter_consume_exact<T, const N: usize>(\\n\\n mut iter: impl Iterator<Item = T>,\\n\\n) -> Result<[T; N], &'static str> {\\n\\n let mut data = MaybeUninit::<[T; N]>::uninit();\\n\\n let start: *mut T = unsafe { std::mem::transmute(&mut data) };\\n\\n\\n\\n for i in 0..N {\\n\\n let item = iter.next().ok_or(\\\"Insufficient items in iterator\\\")?;\\n\\n unsafe { start.offset(i as isize).write(item) }\\n\\n }\\n\\n\\n\\n if iter.next().is_some() {\\n\\n return Err(\\\"Too many items in iterator\\\");\\n\\n }\\n\\n\\n\\n Ok(unsafe { data.assume_init() })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parse.rs\",\n \"rank\": 6,\n \"score\": 48209.54349869874\n },\n {\n \"content\": \"fn parse_addressing_mode(digit: usize) -> IntcodeResult<AddressingMode> {\\n\\n match digit {\\n\\n 0 => Ok(AddressingMode::AbsoluteAddress),\\n\\n 1 => Ok(AddressingMode::Immediate),\\n\\n 2 => Ok(AddressingMode::BasePointerRelative),\\n\\n _ => Err(IntcodeError::InvalidAddressingMode),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl IntcodeMachine {\\n\\n pub fn new_io(tape: Tape, input: StreamRef, output: StreamRef) -> Self {\\n\\n IntcodeMachine {\\n\\n tape,\\n\\n input,\\n\\n output,\\n\\n pc: 0,\\n\\n bp: 0,\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 7,\n \"score\": 47879.722550785606\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Operand {\\n\\n mode: AddressingMode,\\n\\n value: isize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 8,\n \"score\": 47371.96394400817\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct Opcode {\\n\\n operation: Operation,\\n\\n operands: Vec<Operand>,\\n\\n}\\n\\n\\n\\npub type IntcodeResult<T> = Result<T, IntcodeError>;\\n\\npub type Tape = Vec<isize>;\\n\\npub type Stream = VecDeque<isize>;\\n\\npub type StreamRef = Rc<RefCell<Stream>>;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct IntcodeMachine {\\n\\n tape: Tape,\\n\\n pub input: StreamRef,\\n\\n pub output: StreamRef,\\n\\n pc: isize,\\n\\n bp: isize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 9,\n \"score\": 47371.96394400817\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum Operation {\\n\\n Add,\\n\\n Multiply,\\n\\n Input,\\n\\n Output,\\n\\n JumpTrue,\\n\\n JumpFalse,\\n\\n LessThan,\\n\\n Equals,\\n\\n AdjustBasePointer,\\n\\n Halt,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 10,\n \"score\": 47371.96394400817\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum AddressingMode {\\n\\n AbsoluteAddress,\\n\\n Immediate,\\n\\n BasePointerRelative,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 11,\n \"score\": 46065.34506574787\n },\n {\n \"content\": \"fn get_session_key() -> String {\\n\\n let mut path = std::env::current_exe().unwrap();\\n\\n path.pop();\\n\\n path.push(&SESSION_FILE_PATH.iter().cloned().collect::<PathBuf>());\\n\\n\\n\\n let mut content = String::new();\\n\\n let mut file = File::open(path).unwrap();\\n\\n file.read_to_string(&mut content).unwrap();\\n\\n content.trim().to_string()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/aoc_input.rs\",\n \"rank\": 12,\n \"score\": 37939.39677563337\n },\n {\n \"content\": \"pub fn parse_intcode_program(input: &str) -> Tape {\\n\\n input\\n\\n .trim()\\n\\n .split(',')\\n\\n .map(|s| s.parse().unwrap())\\n\\n .collect::<Tape>()\\n\\n}\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 13,\n \"score\": 31889.245873714608\n },\n {\n \"content\": \"pub fn manhattan_distance(lhs: Coord, rhs: Coord) -> isize {\\n\\n (lhs.0 - rhs.0).abs() + (lhs.1 - rhs.1).abs()\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Eq, PartialEq, Hash)]\\n\\npub struct CoordVec(Vec<isize>);\\n\\n\\n\\nimpl CoordVec {\\n\\n pub fn origin(n: usize) -> Self {\\n\\n Self(vec![0; n])\\n\\n }\\n\\n\\n\\n pub fn from_vec(v: Vec<isize>) -> Self {\\n\\n Self(v)\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Eq, PartialEq)]\\n\\npub struct DeltaVec(Vec<isize>);\\n\\n\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 14,\n \"score\": 29256.0393932917\n },\n {\n \"content\": \"pub fn div_round_nearest(dividend: isize, divisor: isize) -> isize {\\n\\n let sign = 1 - ((dividend < 0) ^ (divisor < 0)) as isize * 2;\\n\\n let (q, r) = dividend.div_rem(&divisor);\\n\\n q + (r.abs() > (divisor / 2).abs()) as isize * sign\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use std::assert_eq;\\n\\n\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_div_round_nearest() {\\n\\n assert_eq!(div_round_nearest(8, 3), 3);\\n\\n assert_eq!(div_round_nearest(8, -3), -3);\\n\\n assert_eq!(div_round_nearest(-8, 3), -3);\\n\\n assert_eq!(div_round_nearest(-8, -3), 3);\\n\\n\\n\\n assert_eq!(div_round_nearest(10, 3), 3);\\n\\n assert_eq!(div_round_nearest(10, -3), -3);\\n\\n assert_eq!(div_round_nearest(-10, 3), -3);\\n\\n assert_eq!(div_round_nearest(-10, -3), 3);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/num.rs\",\n \"rank\": 15,\n \"score\": 28587.99471694339\n },\n {\n \"content\": \"pub fn get_input(year: u16, day: u8) -> String {\\n\\n try_get_input(year, day).expect(\\\"Failed getting input\\\")\\n\\n}\\n\",\n \"file_path\": \"src/aoc_input.rs\",\n \"rank\": 16,\n \"score\": 28587.99471694339\n },\n {\n \"content\": \"fn try_get_input(year: u16, day: u8) -> Result<String, Box<dyn Error>> {\\n\\n let mut path = PathBuf::new();\\n\\n path.push(std::env::current_exe()?.parent().unwrap());\\n\\n path.push(CACHE_DIR);\\n\\n let filename = format!(\\\"{}_{}.txt\\\", year, day);\\n\\n path.push(&filename);\\n\\n\\n\\n let _ = std::fs::create_dir(path.parent().unwrap());\\n\\n\\n\\n if path.exists() {\\n\\n println!(\\\"Cache hit for {}\\\", &filename);\\n\\n Ok(std::fs::read_to_string(path)?)\\n\\n } else {\\n\\n println!(\\\"Cache miss for {}\\\", &filename);\\n\\n let input_str = get_input_web(year, day)?;\\n\\n std::fs::write(path, &input_str)?;\\n\\n Ok(input_str)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/aoc_input.rs\",\n \"rank\": 17,\n \"score\": 24321.615318162214\n },\n {\n \"content\": \"fn get_input_web(year: u16, day: u8) -> Result<String, Box<dyn Error>> {\\n\\n let url_str = format!(\\\"https://adventofcode.com/{}/day/{}/input\\\", year, day);\\n\\n let mut headers = HeaderMap::new();\\n\\n headers.insert(\\n\\n COOKIE,\\n\\n format!(\\\"session={}\\\", get_session_key()).parse().unwrap(),\\n\\n );\\n\\n let resp = Client::new().get(&url_str).headers(headers).send()?;\\n\\n Ok(resp.text()?)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/aoc_input.rs\",\n \"rank\": 18,\n \"score\": 24321.615318162214\n },\n {\n \"content\": \"use num_traits::{Signed, Zero};\\n\\nuse std::ops::{Add, AddAssign, Index, Mul, MulAssign, Neg, Sub, SubAssign};\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\\n\\npub struct VecN<T, const N: usize>([T; N]);\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]\\n\\npub struct Scalar<T>(T);\\n\\n\\n\\nimpl<T: Copy + Zero, const N: usize> VecN<T, N> {\\n\\n pub fn zero() -> Self {\\n\\n Self([T::zero(); N])\\n\\n }\\n\\n\\n\\n pub fn new(inner: [T; N]) -> Self {\\n\\n Self(inner)\\n\\n }\\n\\n\\n\\n pub fn len(&self) -> usize {\\n\\n self.0.len()\\n\",\n \"file_path\": \"src/vec.rs\",\n \"rank\": 19,\n \"score\": 10.586749144552034\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, EnumIter, IntoPrimitive, TryFromPrimitive)]\\n\\n#[repr(u8)]\\n\\npub enum Direction {\\n\\n Up = 0,\\n\\n Right = 1,\\n\\n Down = 2,\\n\\n Left = 3,\\n\\n}\\n\\n\\n\\nimpl Direction {\\n\\n pub fn turn(self, to: Turn) -> Self {\\n\\n let res = (u8::from(self) + u8::from(to)) % 4;\\n\\n Direction::try_from(res).unwrap()\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, EnumIter)]\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 20,\n \"score\": 9.875298495522745\n },\n {\n \"content\": \" fn size_hint(&self) -> (usize, Option<usize>) {\\n\\n self.iter.size_hint()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, T> FusedIterator for GridIterMut<'a, T> {}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\npub struct Grid<T> {\\n\\n grid: Vec<T>,\\n\\n width: usize,\\n\\n}\\n\\n\\n\\nimpl<T> Grid<T>\\n\\nwhere\\n\\n T: Default,\\n\\n{\\n\\n pub fn new(width: usize, height: usize) -> Self {\\n\\n let mut grid = Vec::new();\\n\\n grid.resize_with(width * height, Default::default);\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 21,\n \"score\": 9.806360286958265\n },\n {\n \"content\": \"use num_enum::{IntoPrimitive, TryFromPrimitive};\\n\\nuse std::convert::{From, TryFrom};\\n\\nuse std::ops::{Add, AddAssign, Mul};\\n\\nuse strum_macros::EnumIter;\\n\\n\\n\\n#[derive(Debug, Copy, Clone, PartialEq, Eq, IntoPrimitive, TryFromPrimitive)]\\n\\n#[repr(u8)]\\n\\npub enum Turn {\\n\\n Front = 0,\\n\\n Right = 1,\\n\\n Back = 2,\\n\\n Left = 3,\\n\\n}\\n\\n\\n\\nimpl Mul<Turn> for isize {\\n\\n type Output = Turn;\\n\\n\\n\\n fn mul(self, rhs: Turn) -> Self::Output {\\n\\n let n = self.rem_euclid(4) as u8;\\n\\n Turn::try_from((n * u8::from(rhs)) % 4).unwrap()\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 22,\n \"score\": 8.521303942680099\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn values_mut(&mut self) -> impl Iterator<Item = &mut T> {\\n\\n self.grid.iter_mut()\\n\\n }\\n\\n\\n\\n fn index_for(&self, c: Coord) -> Option<usize> {\\n\\n let Coord(x, y) = c;\\n\\n if x < 0 || y < 0 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let (x, y) = (x as usize, y as usize);\\n\\n let (w, h) = (self.width(), self.height());\\n\\n if x < w && y < h {\\n\\n Some(x + w * y)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 23,\n \"score\": 8.37954393010667\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn size_hint(&self) -> (usize, Option<usize>) {\\n\\n self.iter.size_hint()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, T> FusedIterator for GridIter<'a, T> {}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct GridIterMut<'a, T: 'a> {\\n\\n iter: std::slice::IterMut<'a, T>,\\n\\n width: usize,\\n\\n coord: Coord,\\n\\n}\\n\\n\\n\\nimpl<'a, T> GridIterMut<'a, T> {\\n\\n pub fn new(grid: &'a mut Grid<T>) -> Self {\\n\\n Self {\\n\\n iter: grid.grid.iter_mut(),\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 24,\n \"score\": 7.698520072640159\n },\n {\n \"content\": \"impl Rotation {\\n\\n pub fn to_cw_count(&self) -> usize {\\n\\n match *self {\\n\\n Rotation::Cw0 => 0,\\n\\n Rotation::Cw90 => 1,\\n\\n Rotation::Cw180 => 2,\\n\\n Rotation::Cw270 => 3,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct GridIter<'a, T: 'a> {\\n\\n iter: std::slice::Iter<'a, T>,\\n\\n width: usize,\\n\\n coord: Coord,\\n\\n}\\n\\n\\n\\nimpl<'a, T> GridIter<'a, T> {\\n\\n pub fn new(grid: &'a Grid<T>) -> Self {\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 25,\n \"score\": 7.504596086862804\n },\n {\n \"content\": \" self.verify_addr(newbp)?;\\n\\n self.bp = newbp;\\n\\n }\\n\\n Operation::Halt => {\\n\\n self.pc = start_pc;\\n\\n return Ok(Some(StopStatus::Halted));\\n\\n }\\n\\n };\\n\\n\\n\\n Ok(None)\\n\\n }\\n\\n\\n\\n pub fn run(&mut self) -> IntcodeResult<StopStatus> {\\n\\n loop {\\n\\n match self.tick() {\\n\\n Ok(None) => continue,\\n\\n Ok(Some(status)) => return Ok(status),\\n\\n Err(e) => return Err(e),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 26,\n \"score\": 7.491738739159216\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone, Eq, PartialEq)]\\n\\npub struct Delta(pub isize, pub isize);\\n\\n\\n\\nimpl Delta {\\n\\n pub fn turn(&self, t: Turn) -> Delta {\\n\\n match t {\\n\\n Turn::Front => *self,\\n\\n Turn::Right => Delta(-self.1, self.0),\\n\\n Turn::Back => Delta(-self.0, -self.1),\\n\\n Turn::Left => Delta(self.1, -self.0),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Add<Delta> for Coord {\\n\\n type Output = Coord;\\n\\n\\n\\n fn add(self, rhs: Delta) -> Self::Output {\\n\\n Coord(self.0 + rhs.0, self.1 + rhs.1)\\n\\n }\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 27,\n \"score\": 7.2686426117660705\n },\n {\n \"content\": \"{\\n\\n pub fn count_eq(&self, item: &T) -> usize {\\n\\n self.values().filter(|&e| e == item).count()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Grid<T>\\n\\nwhere\\n\\n T: Clone,\\n\\n{\\n\\n pub fn rotate_clockwise_inplace(&mut self) {\\n\\n let w = self.width() as isize;\\n\\n let h = self.height() as isize;\\n\\n let mut v = Vec::with_capacity(self.grid.len());\\n\\n\\n\\n for x in 0..w {\\n\\n for y in (0..h).rev() {\\n\\n v.push(self.get(Coord(x, y)).unwrap().clone());\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 28,\n \"score\": 6.868597476277547\n },\n {\n \"content\": \" fn add(self, rhs: VecN<T, N>) -> Self::Output {\\n\\n let mut res = self;\\n\\n res += rhs;\\n\\n res\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy + MulAssign<T>, const N: usize> Mul<VecN<T, N>> for Scalar<T> {\\n\\n type Output = VecN<T, N>;\\n\\n\\n\\n fn mul(self, rhs: VecN<T, N>) -> Self::Output {\\n\\n let mut res = rhs;\\n\\n for c in res.0.iter_mut() {\\n\\n *c *= self.0;\\n\\n }\\n\\n res\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy + Neg<Output = T>, const N: usize> Neg for VecN<T, N> {\\n\",\n \"file_path\": \"src/vec.rs\",\n \"rank\": 29,\n \"score\": 6.840618204187196\n },\n {\n \"content\": \" width: grid.width,\\n\\n coord: Coord::origin(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, T> Iterator for GridIterMut<'a, T> {\\n\\n type Item = (Coord, &'a mut T);\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let res = (self.coord, self.iter.next()?);\\n\\n if self.coord.0 as usize == self.width - 1 {\\n\\n self.coord.0 = 0;\\n\\n self.coord.1 += 1;\\n\\n } else {\\n\\n self.coord.0 += 1;\\n\\n }\\n\\n Some(res)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 30,\n \"score\": 6.827607863781044\n },\n {\n \"content\": \"pub enum Direction8 {\\n\\n North,\\n\\n NorthEast,\\n\\n East,\\n\\n SouthEast,\\n\\n South,\\n\\n SouthWest,\\n\\n West,\\n\\n NorthWest,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]\\n\\npub struct Coord(pub isize, pub isize);\\n\\n\\n\\nimpl Coord {\\n\\n pub fn origin() -> Coord {\\n\\n Coord(0, 0)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 31,\n \"score\": 6.804141944477849\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<T, const N: usize> Index<usize> for VecN<T, N> {\\n\\n type Output = T;\\n\\n\\n\\n fn index(&self, index: usize) -> &Self::Output {\\n\\n &self.0[index]\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy + SubAssign, const N: usize> SubAssign<VecN<T, N>> for VecN<T, N> {\\n\\n fn sub_assign(&mut self, rhs: VecN<T, N>) {\\n\\n for i in 0..self.0.len() {\\n\\n self.0[i] -= rhs.0[i];\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy + SubAssign, const N: usize> Sub<VecN<T, N>> for VecN<T, N> {\\n\",\n \"file_path\": \"src/vec.rs\",\n \"rank\": 32,\n \"score\": 6.668905254562867\n },\n {\n \"content\": \"\\n\\n self.grid = v;\\n\\n self.width = h as usize;\\n\\n }\\n\\n\\n\\n pub fn rotate_inplace(&mut self, rotation: Rotation) {\\n\\n for _ in 0..rotation.to_cw_count() {\\n\\n self.rotate_clockwise_inplace();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> FromStr for Grid<T>\\n\\nwhere\\n\\n T: TryFrom<char>,\\n\\n{\\n\\n type Err = &'static str;\\n\\n\\n\\n fn from_str(s: &str) -> Result<Self, Self::Err> {\\n\\n let mut grid: Vec<T> = Vec::new();\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 33,\n \"score\": 6.562678425892871\n },\n {\n \"content\": \" Self { grid, width }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Grid<T> {\\n\\n pub fn from_vec_and_width(grid: Vec<T>, width: usize) -> Self {\\n\\n assert_eq!(grid.len() % width, 0);\\n\\n Self { grid, width }\\n\\n }\\n\\n\\n\\n pub fn height(&self) -> usize {\\n\\n self.grid.len() / self.width\\n\\n }\\n\\n\\n\\n pub fn width(&self) -> usize {\\n\\n self.width\\n\\n }\\n\\n\\n\\n pub fn len(&self) -> usize {\\n\\n self.grid.len()\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 34,\n \"score\": 6.419489443399563\n },\n {\n \"content\": \" Self {\\n\\n iter: grid.grid.iter(),\\n\\n width: grid.width,\\n\\n coord: Coord::origin(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, T> Iterator for GridIter<'a, T> {\\n\\n type Item = (Coord, &'a T);\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let res = (self.coord, self.iter.next()?);\\n\\n if self.coord.0 as usize == self.width - 1 {\\n\\n self.coord.0 = 0;\\n\\n self.coord.1 += 1;\\n\\n } else {\\n\\n self.coord.0 += 1;\\n\\n }\\n\\n Some(res)\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 35,\n \"score\": 6.247579937759485\n },\n {\n \"content\": \" pub fn new(tape: Tape) -> Self {\\n\\n Self::new_io(tape, new_stream_ref(), new_stream_ref())\\n\\n }\\n\\n\\n\\n fn verify_addr(&mut self, addr: isize) -> IntcodeResult<usize> {\\n\\n if addr < 0 {\\n\\n return Err(IntcodeError::NegativeAddress);\\n\\n }\\n\\n\\n\\n let addr = addr as usize;\\n\\n if addr >= self.tape.len() {\\n\\n self.tape.resize(addr + 1, 0);\\n\\n }\\n\\n Ok(addr)\\n\\n }\\n\\n\\n\\n pub fn read_addr(&mut self, addr: isize) -> IntcodeResult<isize> {\\n\\n let addr = self.verify_addr(addr)?;\\n\\n Ok(self.tape[addr])\\n\\n }\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 36,\n \"score\": 6.211716997616638\n },\n {\n \"content\": \"use crate::coordinates::Coord;\\n\\nuse std::convert::{TryFrom, TryInto};\\n\\nuse std::fmt::{Display, Write};\\n\\nuse std::iter::FusedIterator;\\n\\nuse std::str::FromStr;\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub enum Axis {\\n\\n Horizontal,\\n\\n Vertical,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub enum Rotation {\\n\\n Cw0,\\n\\n Cw90,\\n\\n Cw180,\\n\\n Cw270,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 37,\n \"score\": 6.061292385928891\n },\n {\n \"content\": \" type Output = VecN<T, N>;\\n\\n\\n\\n fn neg(self) -> Self::Output {\\n\\n let mut res = self;\\n\\n for c in res.0.iter_mut() {\\n\\n *c = -*c;\\n\\n }\\n\\n res\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Zero + Copy + Signed + AddAssign, const N: usize> VecN<T, N> {\\n\\n pub fn manhattan_norm(&self) -> T {\\n\\n let mut norm = T::zero();\\n\\n for c in self.0.iter() {\\n\\n norm += c.abs();\\n\\n }\\n\\n norm\\n\\n }\\n\\n}\\n\\n\\n\\npub type ISizeVec3 = VecN<isize, 3>;\\n\",\n \"file_path\": \"src/vec.rs\",\n \"rank\": 38,\n \"score\": 5.763859748593008\n },\n {\n \"content\": \" type Output = VecN<T, N>;\\n\\n\\n\\n fn sub(self, rhs: VecN<T, N>) -> Self::Output {\\n\\n let mut res = self;\\n\\n res -= rhs;\\n\\n res\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy + AddAssign, const N: usize> AddAssign<VecN<T, N>> for VecN<T, N> {\\n\\n fn add_assign(&mut self, rhs: VecN<T, N>) {\\n\\n for i in 0..self.0.len() {\\n\\n self.0[i] += rhs.0[i];\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T: Copy + AddAssign, const N: usize> Add<VecN<T, N>> for VecN<T, N> {\\n\\n type Output = VecN<T, N>;\\n\\n\\n\",\n \"file_path\": \"src/vec.rs\",\n \"rank\": 39,\n \"score\": 5.752644100890617\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn is_empty(&self) -> bool {\\n\\n self.len() != 0\\n\\n }\\n\\n\\n\\n pub fn iter(&self) -> impl Iterator<Item = (Coord, &T)> {\\n\\n GridIter::new(self)\\n\\n }\\n\\n\\n\\n pub fn iter_mut(&mut self) -> impl Iterator<Item = (Coord, &mut T)> {\\n\\n GridIterMut::new(self)\\n\\n }\\n\\n\\n\\n pub fn keys<'a>(&'a self) -> impl Iterator<Item = Coord> + 'a {\\n\\n self.iter().map(|(c, _)| c)\\n\\n }\\n\\n\\n\\n pub fn values(&self) -> impl Iterator<Item = &T> {\\n\\n self.grid.iter()\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 40,\n \"score\": 5.714605922091131\n },\n {\n \"content\": \"impl DeltaVec {\\n\\n pub fn from_vec(v: Vec<isize>) -> Self {\\n\\n Self(v)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a, 'b> Add<&'b DeltaVec> for &'a CoordVec {\\n\\n type Output = CoordVec;\\n\\n\\n\\n fn add(self, rhs: &'b DeltaVec) -> Self::Output {\\n\\n let n = self.0.len();\\n\\n assert_eq!(n, rhs.0.len());\\n\\n let res: Vec<_> = (0..n).map(|i| self.0[i] + rhs.0[i]).collect();\\n\\n CoordVec(res)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> AddAssign<&'a DeltaVec> for CoordVec {\\n\\n fn add_assign(&mut self, rhs: &'a DeltaVec) {\\n\\n *self = &*self + rhs;\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 41,\n \"score\": 5.2827307135229\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn run_to_completion(&mut self) -> IntcodeResult<()> {\\n\\n match self.run()? {\\n\\n StopStatus::Halted => Ok(()),\\n\\n _ => Err(IntcodeError::DidNotRunToCompletion),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 42,\n \"score\": 5.078721720067781\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Mul<Delta> for isize {\\n\\n type Output = Delta;\\n\\n\\n\\n fn mul(self, rhs: Delta) -> Self::Output {\\n\\n Delta(self * rhs.0, self * rhs.1)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Direction> for Delta {\\n\\n fn from(d: Direction) -> Self {\\n\\n match d {\\n\\n Direction::Up => Delta(0, -1),\\n\\n Direction::Down => Delta(0, 1),\\n\\n Direction::Left => Delta(-1, 0),\\n\\n Direction::Right => Delta(1, 0),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 43,\n \"score\": 4.879918184897452\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl AddAssign<Delta> for Coord {\\n\\n fn add_assign(&mut self, rhs: Delta) {\\n\\n *self = *self + rhs;\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Add<Delta> for Delta {\\n\\n type Output = Delta;\\n\\n\\n\\n fn add(self, rhs: Delta) -> Self::Output {\\n\\n Delta(self.0 + rhs.0, self.1 + rhs.1)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl AddAssign<Delta> for Delta {\\n\\n fn add_assign(&mut self, rhs: Delta) {\\n\\n *self = *self + rhs;\\n\\n }\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 44,\n \"score\": 4.635715784778801\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl<'a, 'b> Add<&'b DeltaVec> for &'a DeltaVec {\\n\\n type Output = DeltaVec;\\n\\n\\n\\n fn add(self, rhs: &'b DeltaVec) -> Self::Output {\\n\\n let n = self.0.len();\\n\\n assert_eq!(n, rhs.0.len());\\n\\n let res: Vec<_> = (0..n).map(|i| self.0[i] + rhs.0[i]).collect();\\n\\n DeltaVec(res)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> AddAssign<&'a DeltaVec> for DeltaVec {\\n\\n fn add_assign(&mut self, rhs: &'a DeltaVec) {\\n\\n *self = &*self + rhs;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 45,\n \"score\": 4.584280245192236\n },\n {\n \"content\": \" let mut width: Option<usize> = None;\\n\\n\\n\\n for line in s.lines() {\\n\\n if line.is_empty() {\\n\\n return Err(\\\"Empty line\\\");\\n\\n }\\n\\n\\n\\n let mut cur_width = 0usize;\\n\\n for c in line.chars() {\\n\\n let item: T = c.try_into().or(Err(\\\"Failed parsing char\\\"))?;\\n\\n grid.push(item);\\n\\n cur_width += 1;\\n\\n }\\n\\n\\n\\n if width.is_some() && width.unwrap() != cur_width {\\n\\n return Err(\\\"Non-uniform line length\\\");\\n\\n }\\n\\n\\n\\n width = Some(cur_width);\\n\\n }\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 46,\n \"score\": 4.280117930854635\n },\n {\n \"content\": \"use crate::digits::digits;\\n\\nuse std::cell::RefCell;\\n\\nuse std::collections::VecDeque;\\n\\nuse std::rc::Rc;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum IntcodeError {\\n\\n InvalidOpcodeOperation,\\n\\n NegativeOpcode,\\n\\n InvalidAddressingMode,\\n\\n NegativeAddress,\\n\\n InvalidStoreAddressingMode,\\n\\n DidNotRunToCompletion,\\n\\n}\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub enum StopStatus {\\n\\n Halted,\\n\\n BlockedOnInput,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 47,\n \"score\": 4.228034005327409\n },\n {\n \"content\": \"\\n\\n let width = width.ok_or(\\\"No lines\\\")?;\\n\\n Ok(Grid { grid, width })\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Display for Grid<T>\\n\\nwhere\\n\\n T: Clone + Into<char>,\\n\\n{\\n\\n fn fmt(&self, fmt: &mut std::fmt::Formatter) -> std::fmt::Result {\\n\\n for y in 0..self.height() as isize {\\n\\n for x in 0..self.width() as isize {\\n\\n let e = self.get(Coord(x, y)).unwrap();\\n\\n fmt.write_char(e.clone().into())?;\\n\\n }\\n\\n fmt.write_char('\\\\n')?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 48,\n \"score\": 3.752852344434581\n },\n {\n \"content\": \" digits.extend(vec![0; 5 - digits.len()]);\\n\\n\\n\\n let (operation, operand_count) = match 10 * digits[1] + digits[0] {\\n\\n 1 => (Operation::Add, 3),\\n\\n 2 => (Operation::Multiply, 3),\\n\\n 3 => (Operation::Input, 1),\\n\\n 4 => (Operation::Output, 1),\\n\\n 5 => (Operation::JumpTrue, 2),\\n\\n 6 => (Operation::JumpFalse, 2),\\n\\n 7 => (Operation::LessThan, 3),\\n\\n 8 => (Operation::Equals, 3),\\n\\n 9 => (Operation::AdjustBasePointer, 1),\\n\\n 99 => (Operation::Halt, 0),\\n\\n _ => return Err(IntcodeError::InvalidOpcodeOperation),\\n\\n };\\n\\n\\n\\n let mut operands = Vec::<Operand>::new();\\n\\n for i in 0..operand_count {\\n\\n let mode = parse_addressing_mode(digits[2 + i])?;\\n\\n let value = self.read_pc()?;\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 49,\n \"score\": 3.632918366731699\n },\n {\n \"content\": \"\\n\\nimpl From<Direction8> for Delta {\\n\\n fn from(d: Direction8) -> Self {\\n\\n match d {\\n\\n Direction8::North => Delta(0, -1),\\n\\n Direction8::NorthEast => Delta(1, -1),\\n\\n Direction8::East => Delta(1, 0),\\n\\n Direction8::SouthEast => Delta(1, 1),\\n\\n Direction8::South => Delta(0, 1),\\n\\n Direction8::SouthWest => Delta(-1, 1),\\n\\n Direction8::West => Delta(-1, 0),\\n\\n Direction8::NorthWest => Delta(-1, -1),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/coordinates.rs\",\n \"rank\": 50,\n \"score\": 3.509585613802387\n },\n {\n \"content\": \" self.store(&opcode.operands[2], value)?;\\n\\n }\\n\\n Operation::Multiply => {\\n\\n let value = self.load(&opcode.operands[0])? * self.load(&opcode.operands[1])?;\\n\\n self.store(&opcode.operands[2], value)?;\\n\\n }\\n\\n Operation::Input => {\\n\\n let input = self.input.borrow_mut().pop_front();\\n\\n match input {\\n\\n Some(value) => self.store(&opcode.operands[0], value)?,\\n\\n None => {\\n\\n self.pc = start_pc;\\n\\n return Ok(Some(StopStatus::BlockedOnInput));\\n\\n }\\n\\n };\\n\\n }\\n\\n Operation::Output => {\\n\\n let value = self.load(&opcode.operands[0])?;\\n\\n self.output.borrow_mut().push_back(value);\\n\\n }\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 51,\n \"score\": 3.284004187769971\n },\n {\n \"content\": \"\\n\\n pub fn get(&self, c: Coord) -> Option<&T> {\\n\\n let idx = self.index_for(c)?;\\n\\n self.grid.get(idx)\\n\\n }\\n\\n\\n\\n pub fn get_mut(&mut self, c: Coord) -> Option<&mut T> {\\n\\n let idx = self.index_for(c)?;\\n\\n self.grid.get_mut(idx)\\n\\n }\\n\\n\\n\\n pub fn flip_inplace(&mut self, axis: Axis) {\\n\\n let w = self.width() as isize;\\n\\n let h = self.height() as isize;\\n\\n match axis {\\n\\n Axis::Horizontal => {\\n\\n for y in 0..h / 2 {\\n\\n for x in 0..w {\\n\\n let i1 = self.index_for(Coord(x, y)).unwrap();\\n\\n let i2 = self.index_for(Coord(x, h - 1 - y)).unwrap();\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 52,\n \"score\": 3.1911693120803633\n },\n {\n \"content\": \"\\n\\n fn write_addr(&mut self, addr: isize, value: isize) -> IntcodeResult<()> {\\n\\n let addr = self.verify_addr(addr)?;\\n\\n self.tape[addr] = value;\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn read_pc(&mut self) -> IntcodeResult<isize> {\\n\\n let value = self.read_addr(self.pc)?;\\n\\n self.pc += 1;\\n\\n Ok(value)\\n\\n }\\n\\n\\n\\n fn read_opcode(&mut self) -> IntcodeResult<Opcode> {\\n\\n let opcode = self.read_pc()?;\\n\\n if opcode < 0 {\\n\\n return Err(IntcodeError::NegativeOpcode);\\n\\n }\\n\\n\\n\\n let mut digits: Vec<_> = digits(opcode as usize, 10).collect();\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 53,\n \"score\": 2.8193152118319946\n },\n {\n \"content\": \"use reqwest::blocking::Client;\\n\\nuse reqwest::header::{HeaderMap, COOKIE};\\n\\nuse std::error::Error;\\n\\nuse std::fs::File;\\n\\nuse std::io::prelude::*;\\n\\nuse std::path::PathBuf;\\n\\n\\n\\nconst CACHE_DIR: &str = \\\"input_cache\\\";\\n\\nconst SESSION_FILE_PATH: &[&str] = &[\\\"..\\\", \\\"..\\\", \\\"session.txt\\\"];\\n\\n\\n\",\n \"file_path\": \"src/aoc_input.rs\",\n \"rank\": 54,\n \"score\": 2.776517134148186\n },\n {\n \"content\": \" self.grid.swap(i1, i2);\\n\\n }\\n\\n }\\n\\n }\\n\\n Axis::Vertical => {\\n\\n for x in 0..w / 2 {\\n\\n for y in 0..h {\\n\\n let i1 = self.index_for(Coord(x, y)).unwrap();\\n\\n let i2 = self.index_for(Coord(w - 1 - x, y)).unwrap();\\n\\n self.grid.swap(i1, i2);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T> Grid<T>\\n\\nwhere\\n\\n T: std::cmp::PartialEq,\\n\",\n \"file_path\": \"src/grid.rs\",\n \"rank\": 55,\n \"score\": 2.646903793636519\n },\n {\n \"content\": \" operands.push(Operand { mode, value });\\n\\n }\\n\\n\\n\\n Ok(Opcode {\\n\\n operation,\\n\\n operands,\\n\\n })\\n\\n }\\n\\n\\n\\n fn load(&mut self, op: &Operand) -> IntcodeResult<isize> {\\n\\n match op.mode {\\n\\n AddressingMode::AbsoluteAddress => Ok(self.read_addr(op.value)?),\\n\\n AddressingMode::Immediate => Ok(op.value),\\n\\n AddressingMode::BasePointerRelative => Ok(self.read_addr(self.bp + op.value)?),\\n\\n }\\n\\n }\\n\\n\\n\\n fn store(&mut self, op: &Operand, value: isize) -> IntcodeResult<()> {\\n\\n match op.mode {\\n\\n AddressingMode::AbsoluteAddress => Ok(self.write_addr(op.value, value)?),\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 56,\n \"score\": 2.5218095175661497\n },\n {\n \"content\": \"use num_integer::Integer;\\n\\n\\n\",\n \"file_path\": \"src/num.rs\",\n \"rank\": 57,\n \"score\": 2.520612348795983\n },\n {\n \"content\": \"use std::mem::MaybeUninit;\\n\\n\\n\",\n \"file_path\": \"src/parse.rs\",\n \"rank\": 58,\n \"score\": 2.441799427940077\n },\n {\n \"content\": \"use num_traits::{sign::Unsigned, AsPrimitive, One, Zero};\\n\\nuse std::ops::{DivAssign, MulAssign, RemAssign};\\n\\n\\n\",\n \"file_path\": \"src/digits.rs\",\n \"rank\": 59,\n \"score\": 2.412630603248221\n },\n {\n \"content\": \" AddressingMode::BasePointerRelative => Ok(self.write_addr(self.bp + op.value, value)?),\\n\\n AddressingMode::Immediate => Err(IntcodeError::InvalidStoreAddressingMode),\\n\\n }\\n\\n }\\n\\n\\n\\n fn jump_conditional(&mut self, condition: bool, target: isize) -> IntcodeResult<()> {\\n\\n if condition {\\n\\n self.verify_addr(target)?;\\n\\n self.pc = target;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn tick(&mut self) -> IntcodeResult<Option<StopStatus>> {\\n\\n let start_pc = self.pc;\\n\\n let opcode = self.read_opcode()?;\\n\\n\\n\\n match opcode.operation {\\n\\n Operation::Add => {\\n\\n let value = self.load(&opcode.operands[0])? + self.load(&opcode.operands[1])?;\\n\",\n \"file_path\": \"src/intcode.rs\",\n \"rank\": 60,\n \"score\": 2.058047099974774\n }\n]","isConversational":false}}},{"rowIdx":2991,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/cli/commands/color_commands.rs"},"repo_name":{"kind":"string","value":"dandycheung/pastel"},"commit":{"kind":"string","value":"3719824a56fb9eb92eb960068e513b95486756a7"},"file_code":{"kind":"string","value":"use crate::colorspace::get_mixing_function;\nuse crate::commands::prelude::*;\n\nuse pastel::ColorblindnessType;\nuse pastel::Fraction;\n\nfn clamp(lower: f64, upper: f64, x: f64) -> f64 {\n f64::max(f64::min(upper, x), lower)\n}\n\nmacro_rules! color_command {\n ($cmd_name:ident, $config:ident, $matches:ident, $color:ident, $body:block) => {\n pub struct $cmd_name;\n\n impl ColorCommand for $cmd_name {\n fn run(\n &self,\n out: &mut Output,\n $matches: &ArgMatches,\n $config: &Config,\n $color: &Color,\n ) -> Result<()> {\n let output = $body;\n out.show_color($config, &output)\n }\n }\n };\n}\n\ncolor_command!(SaturateCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.saturate(amount)\n});\n\ncolor_command!(DesaturateCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.desaturate(amount)\n});\n\ncolor_command!(LightenCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.lighten(amount)\n});\n\ncolor_command!(DarkenCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.darken(amount)\n});\n\ncolor_command!(RotateCommand, _config, matches, color, {\n let degrees = number_arg(matches, \"degrees\")?;\n color.rotate_hue(degrees)\n});\n\ncolor_command!(ComplementCommand, _config, _matches, color, {\n color.complementary()\n});\n\ncolor_command!(ToGrayCommand, _config, _matches, color, { color.to_gray() });\n\ncolor_command!(TextColorCommand, _config, _matches, color, {\n color.text_color()\n});\n\ncolor_command!(MixCommand, config, matches, color, {\n let mut print_spectrum = PrintSpectrum::Yes;\n\n let base = ColorArgIterator::from_color_arg(\n config,\n matches.value_of(\"base\").expect(\"required argument\"),\n &mut print_spectrum,\n )?;\n let fraction = Fraction::from(1.0 - number_arg(matches, \"fraction\")?);\n\n let mix = get_mixing_function(matches.value_of(\"colorspace\").expect(\"required argument\"));\n\n mix(&base, color, fraction)\n});\n\ncolor_command!(ColorblindCommand, config, matches, color, {\n \n let cb_ty = matches.value_of(\"type\").expect(\"required argument\");\n let cb_ty = cb_ty.to_lowercase();\n\n \n let cb_ty = match cb_ty.as_ref() {\n \"prot\" => ColorblindnessType::Protanopia,\n \"deuter\" => ColorblindnessType::Deuteranopia,\n \"trit\" => ColorblindnessType::Tritanopia,\n &_ => {\n unreachable!(\"Unknown property\");\n }\n };\n\n color.simulate_colorblindness(cb_ty)\n});\n\ncolor_command!(SetCommand, config, matches, color, {\n let property = matches.value_of(\"property\").expect(\"required argument\");\n let property = property.to_lowercase();\n let property = property.as_ref();\n\n let value = number_arg(matches, \"value\")?;\n\n match property {\n \"red\" | \"green\" | \"blue\" => {\n let mut rgba = color.to_rgba();\n let value = clamp(0.0, 255.0, value) as u8;\n match property {\n \"red\" => {\n rgba.r = value;\n }\n \"green\" => {\n rgba.g = value;\n }\n \"blue\" => {\n rgba.b = value;\n }\n _ => unreachable!(),\n }\n Color::from_rgba(rgba.r, rgba.g, rgba.b, rgba.alpha)\n }\n \"hsl-hue\" | \"hsl-saturation\" | \"hsl-lightness\" => {\n let mut hsla = color.to_hsla();\n match property {\n \"hsl-hue\" => {\n hsla.h = value;\n }\n \"hsl-saturation\" => {\n hsla.s = value;\n }\n \"hsl-lightness\" => {\n hsla.l = value;\n }\n _ => unreachable!(),\n }\n Color::from_hsla(hsla.h, hsla.s, hsla.l, hsla.alpha)\n }\n \"lightness\" | \"lab-a\" | \"lab-b\" => {\n let mut lab = color.to_lab();\n match property {\n \"lightness\" => {\n lab.l = value;\n }\n \"lab-a\" => {\n lab.a = value;\n }\n \"lab-b\" => {\n lab.b = value;\n }\n _ => unreachable!(),\n }\n Color::from_lab(lab.l, lab.a, lab.b, lab.alpha)\n }\n \"hue\" | \"chroma\" => {\n let mut lch = color.to_lch();\n match property {\n \"hue\" => {\n lch.h = value;\n }\n \"chroma\" => {\n lch.c = value;\n }\n _ => unreachable!(),\n }\n Color::from_lch(lch.l, lch.c, lch.h, lch.alpha)\n }\n &_ => {\n unreachable!(\"Unknown property\");\n }\n }\n});\n"},"prefix":{"kind":"string","value":"use crate::colorspace::get_mixing_function;\nuse crate::commands::prelude::*;\n\nuse pastel::ColorblindnessType;\nuse pastel::Fraction;\n\nfn clamp(lower: f64, upper: f64, x: f64) -> f64 {\n f64::max(f64::min(upper, x), lower)\n}\n\nmacro_rules! color_command {\n ($cmd_name:ident, $config:ident, $matches:ident, $color:ident, $body:block) => {\n pub struct $cmd_name;\n\n impl ColorCommand for $cmd_name {\n fn run(\n &self,\n out: &mut Output,\n $matches: &ArgMatches,\n $config: &Config,\n $color: &Color,\n "},"suffix":{"kind":"string","value":" match property {\n \"hsl-hue\" => {\n hsla.h = value;\n }\n \"hsl-saturation\" => {\n hsla.s = value;\n }\n \"hsl-lightness\" => {\n hsla.l = value;\n }\n _ => unreachable!(),\n }\n Color::from_hsla(hsla.h, hsla.s, hsla.l, hsla.alpha)\n }\n \"lightness\" | \"lab-a\" | \"lab-b\" => {\n let mut lab = color.to_lab();\n match property {\n \"lightness\" => {\n lab.l = value;\n }\n \"lab-a\" => {\n lab.a = value;\n }\n \"lab-b\" => {\n lab.b = value;\n }\n _ => unreachable!(),\n }\n Color::from_lab(lab.l, lab.a, lab.b, lab.alpha)\n }\n \"hue\" | \"chroma\" => {\n let mut lch = color.to_lch();\n match property {\n \"hue\" => {\n lch.h = value;\n }\n \"chroma\" => {\n lch.c = value;\n }\n _ => unreachable!(),\n }\n Color::from_lch(lch.l, lch.c, lch.h, lch.alpha)\n }\n &_ => {\n unreachable!(\"Unknown property\");\n }\n }\n});\n"},"middle":{"kind":"string","value":" ) -> Result<()> {\n let output = $body;\n out.show_color($config, &output)\n }\n }\n };\n}\n\ncolor_command!(SaturateCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.saturate(amount)\n});\n\ncolor_command!(DesaturateCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.desaturate(amount)\n});\n\ncolor_command!(LightenCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.lighten(amount)\n});\n\ncolor_command!(DarkenCommand, _config, matches, color, {\n let amount = number_arg(matches, \"amount\")?;\n color.darken(amount)\n});\n\ncolor_command!(RotateCommand, _config, matches, color, {\n let degrees = number_arg(matches, \"degrees\")?;\n color.rotate_hue(degrees)\n});\n\ncolor_command!(ComplementCommand, _config, _matches, color, {\n color.complementary()\n});\n\ncolor_command!(ToGrayCommand, _config, _matches, color, { color.to_gray() });\n\ncolor_command!(TextColorCommand, _config, _matches, color, {\n color.text_color()\n});\n\ncolor_command!(MixCommand, config, matches, color, {\n let mut print_spectrum = PrintSpectrum::Yes;\n\n let base = ColorArgIterator::from_color_arg(\n config,\n matches.value_of(\"base\").expect(\"required argument\"),\n &mut print_spectrum,\n )?;\n let fraction = Fraction::from(1.0 - number_arg(matches, \"fraction\")?);\n\n let mix = get_mixing_function(matches.value_of(\"colorspace\").expect(\"required argument\"));\n\n mix(&base, color, fraction)\n});\n\ncolor_command!(ColorblindCommand, config, matches, color, {\n \n let cb_ty = matches.value_of(\"type\").expect(\"required argument\");\n let cb_ty = cb_ty.to_lowercase();\n\n \n let cb_ty = match cb_ty.as_ref() {\n \"prot\" => ColorblindnessType::Protanopia,\n \"deuter\" => ColorblindnessType::Deuteranopia,\n \"trit\" => ColorblindnessType::Tritanopia,\n &_ => {\n unreachable!(\"Unknown property\");\n }\n };\n\n color.simulate_colorblindness(cb_ty)\n});\n\ncolor_command!(SetCommand, config, matches, color, {\n let property = matches.value_of(\"property\").expect(\"required argument\");\n let property = property.to_lowercase();\n let property = property.as_ref();\n\n let value = number_arg(matches, \"value\")?;\n\n match property {\n \"red\" | \"green\" | \"blue\" => {\n let mut rgba = color.to_rgba();\n let value = clamp(0.0, 255.0, value) as u8;\n match property {\n \"red\" => {\n rgba.r = value;\n }\n \"green\" => {\n rgba.g = value;\n }\n \"blue\" => {\n rgba.b = value;\n }\n _ => unreachable!(),\n }\n Color::from_rgba(rgba.r, rgba.g, rgba.b, rgba.alpha)\n }\n \"hsl-hue\" | \"hsl-saturation\" | \"hsl-lightness\" => {\n let mut hsla = color.to_hsla();\n "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Trim a number such that it fits into the range [lower, upper].\n\npub fn clamp(lower: Scalar, upper: Scalar, x: Scalar) -> Scalar {\n\n Scalar::max(Scalar::min(upper, x), lower)\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub struct Fraction {\n\n f: Scalar,\n\n}\n\n\n\nimpl Fraction {\n\n pub fn from(s: Scalar) -> Self {\n\n Fraction {\n\n f: clamp(0.0, 1.0, s),\n\n }\n\n }\n\n\n\n pub fn value(self) -> Scalar {\n\n self.f\n\n }\n\n}\n\n\n","file_path":"src/helper.rs","rank":1,"score":171202.1231389646},{"content":"fn print_board(out: &mut Output, config: &Config, mode: Mode) -> Result<()> {\n\n // These colors have been chosen/computed such that the perceived color difference (CIE delta-E\n\n // 2000) to the closest ANSI 8-bit color is maximal.\n\n let c1 = Color::from_rgb(73, 39, 50);\n\n let c2 = Color::from_rgb(16, 51, 30);\n\n let c3 = Color::from_rgb(29, 54, 90);\n\n\n\n let width = config.colorcheck_width;\n\n\n\n let mut canvas = Canvas::new(\n\n width + 2 * config.padding,\n\n 3 * width + 3 * config.padding,\n\n Brush::from_mode(Some(mode)),\n\n );\n\n\n\n canvas.draw_rect(config.padding, config.padding, width, width, &c1);\n\n\n\n canvas.draw_rect(\n\n config.padding,\n\n 2 * config.padding + width,\n","file_path":"src/cli/commands/colorcheck.rs","rank":2,"score":164284.16409518497},{"content":"/// Re-arrange the sequence of colors such that the minimal difference between a given color and\n\n/// any of its predecessors is maximized.\n\n///\n\n/// Note: this is only a heuristic and will not yield optimal results (especially at the end of\n\n/// the sequence).\n\n///\n\n/// See: <https://en.wikipedia.org/wiki/Farthest-first_traversal>\n\npub fn rearrange_sequence(colors: &mut Vec<Color>, metric: DistanceMetric) {\n\n let distance = |c1: &Color, c2: &Color| match metric {\n\n DistanceMetric::CIE76 => c1.distance_delta_e_cie76(c2),\n\n DistanceMetric::CIEDE2000 => c1.distance_delta_e_ciede2000(c2),\n\n };\n\n\n\n // vector where the i-th element contains the minimum distance to the colors from 0 to i-1.\n\n let mut min_distances = vec![i32::max_value(); colors.len()];\n\n\n\n for i in 1..colors.len() {\n\n let mut max_i = colors.len();\n\n let mut max_d = i32::min_value();\n\n\n\n for j in i..colors.len() {\n\n min_distances[j] =\n\n min_distances[j].min((distance(&colors[j], &colors[i - 1]) * 1000.0) as i32);\n\n\n\n if min_distances[j] > max_d {\n\n max_i = j;\n\n max_d = min_distances[j];\n\n }\n\n }\n\n\n\n colors.swap(i, max_i);\n\n min_distances.swap(i, max_i);\n\n }\n\n}\n\n\n","file_path":"src/distinct.rs","rank":3,"score":160470.71012037623},{"content":"/// Print a color spectrum to STDERR.\n\npub fn print_colorspectrum(config: &Config) -> Result<()> {\n\n let width = config.colorpicker_width;\n\n\n\n let mut canvas = Canvas::new(\n\n width + 2 * config.padding,\n\n width + 2 * config.padding,\n\n Brush::from_environment(Stream::Stderr),\n\n );\n\n canvas.draw_rect(\n\n config.padding,\n\n config.padding,\n\n width + 2,\n\n width + 2,\n\n &Color::white(),\n\n );\n\n\n\n for y in 0..width {\n\n for x in 0..width {\n\n let rx = (x as f64) / (width as f64);\n\n let ry = (y as f64) / (width as f64);\n","file_path":"src/cli/colorpicker.rs","rank":4,"score":145547.0687778088},{"content":"/// Returns a list of named colors, sorted by the perceived distance to the given color\n\npub fn similar_colors(color: &Color) -> Vec<&NamedColor> {\n\n let mut colors: Vec<&NamedColor> = NAMED_COLORS.iter().collect();\n\n colors.sort_by_key(|nc| (1000.0 * nc.color.distance_delta_e_ciede2000(color)) as i32);\n\n colors.dedup_by(|n1, n2| n1.color == n2.color);\n\n colors\n\n}\n","file_path":"src/cli/utility.rs","rank":5,"score":144192.99905087016},{"content":"pub fn number_arg(matches: &ArgMatches, name: &str) -> Result<f64> {\n\n let value_str = matches.value_of(name).expect(\"required argument\");\n\n value_str\n\n .parse::<f64>()\n\n .map_err(|_| PastelError::CouldNotParseNumber(value_str.into()))\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq)]\n\npub enum PrintSpectrum {\n\n Yes,\n\n No,\n\n}\n\n\n\npub enum ColorArgIterator<'a> {\n\n FromPositionalArguments(&'a Config<'a>, Values<'a>, PrintSpectrum),\n\n FromStdin,\n\n}\n\n\n\nimpl<'a> ColorArgIterator<'a> {\n\n pub fn from_args(config: &'a Config, args: Option<Values<'a>>) -> Result<Self> {\n","file_path":"src/cli/commands/io.rs","rank":6,"score":137844.99762734436},{"content":"fn get_h_prime_fn(x: f64, y: f64) -> f64 {\n\n if x == 0.0 && y == 0.0 {\n\n return 0.0;\n\n }\n\n\n\n let mut hue_angle = radians_to_degrees(x.atan2(y));\n\n\n\n if hue_angle < 0.0 {\n\n hue_angle += 360.0;\n\n }\n\n\n\n hue_angle\n\n}\n\n\n","file_path":"src/delta_e.rs","rank":7,"score":136470.45271845092},{"content":"pub fn parse_color(input: &str) -> Option<Color> {\n\n alt((\n\n all_consuming(parse_hex),\n\n all_consuming(parse_numeric_rgb),\n\n all_consuming(parse_percentage_rgb),\n\n all_consuming(parse_hsl),\n\n all_consuming(parse_gray),\n\n all_consuming(parse_lab),\n\n all_consuming(parse_lch),\n\n all_consuming(parse_named),\n\n ))(input.trim())\n\n .ok()\n\n .map(|(_, c)| c)\n\n}\n\n\n","file_path":"src/parser.rs","rank":8,"score":133311.25902068208},{"content":"fn blue_red_yellow(f: f64) -> Color {\n\n let blue = Color::from_rgb(0, 0, 120);\n\n let red = Color::from_rgb(224, 0, 119);\n\n let yellow = Color::from_rgb(255, 255, 0);\n\n\n\n if f < 0.5 {\n\n blue.mix::<HSLA>(&red, Fraction::from(2.0 * f))\n\n } else {\n\n red.mix::<HSLA>(&yellow, Fraction::from(2.0 * (f - 0.5)))\n\n }\n\n}\n\n\n","file_path":"src/cli/commands/distinct.rs","rank":9,"score":130542.23019347189},{"content":"pub fn distinct_colors(\n\n count: usize,\n\n distance_metric: DistanceMetric,\n\n fixed_colors: Vec<Color>,\n\n callback: &mut dyn FnMut(&IterationStatistics),\n\n) -> (Vec<Color>, DistanceResult) {\n\n assert!(count > 1);\n\n assert!(fixed_colors.len() <= count);\n\n\n\n let num_fixed_colors = fixed_colors.len();\n\n let mut colors = fixed_colors;\n\n\n\n for _ in num_fixed_colors..count {\n\n colors.push(random::strategies::UniformRGB.generate());\n\n }\n\n\n\n let mut annealing = SimulatedAnnealing::new(\n\n &colors,\n\n SimulationParameters {\n\n initial_temperature: 3.0,\n","file_path":"src/distinct.rs","rank":10,"score":128756.39556364014},{"content":"pub fn key_function(sort_order: &str, color: &Color) -> i32 {\n\n match sort_order {\n\n \"brightness\" => (color.brightness() * 1000.0) as i32,\n\n \"luminance\" => (color.luminance() * 1000.0) as i32,\n\n \"hue\" => (color.to_lch().h * 1000.0) as i32,\n\n \"chroma\" => (color.to_lch().c * 1000.0) as i32,\n\n \"random\" => random(),\n\n _ => unreachable!(\"Unknown sort order\"),\n\n }\n\n}\n\n\n\nimpl GenericCommand for SortCommand {\n\n fn run(&self, out: &mut Output, matches: &ArgMatches, config: &Config) -> Result<()> {\n\n let sort_order = matches.value_of(\"sort-order\").expect(\"required argument\");\n\n\n\n let mut colors: Vec<Color> = vec![];\n\n for color in ColorArgIterator::from_args(config, matches.values_of(\"color\"))? {\n\n colors.push(color?);\n\n }\n\n\n","file_path":"src/cli/commands/sort.rs","rank":11,"score":127693.98868103817},{"content":"pub fn cie76(c1: &Lab, c2: &Lab) -> f64 {\n\n ((c1.l - c2.l).powi(2) + (c1.a - c2.a).powi(2) + (c1.b - c2.b).powi(2)).sqrt()\n\n}\n\n\n","file_path":"src/delta_e.rs","rank":12,"score":120518.11293140583},{"content":"pub fn ciede2000(color1: &Lab, color2: &Lab) -> f64 {\n\n let ksub_l = 1.0;\n\n let ksub_c = 1.0;\n\n let ksub_h = 1.0;\n\n\n\n let delta_l_prime = color2.l - color1.l;\n\n\n\n let l_bar = (color1.l + color2.l) / 2.0;\n\n\n\n let c1 = (color1.a.powi(2) + color1.b.powi(2)).sqrt();\n\n let c2 = (color2.a.powi(2) + color2.b.powi(2)).sqrt();\n\n\n\n let c_bar = (c1 + c2) / 2.0;\n\n\n\n let a_prime_1 = color1.a\n\n + (color1.a / 2.0) * (1.0 - (c_bar.powi(7) / (c_bar.powi(7) + 25f64.powi(7))).sqrt());\n\n let a_prime_2 = color2.a\n\n + (color2.a / 2.0) * (1.0 - (c_bar.powi(7) / (c_bar.powi(7) + 25f64.powi(7))).sqrt());\n\n\n\n let c_prime_1 = (a_prime_1.powi(2) + color1.b.powi(2)).sqrt();\n","file_path":"src/delta_e.rs","rank":13,"score":120518.11293140583},{"content":"fn criterion_benchmark(c: &mut Criterion) {\n\n c.bench_function(\"parse_hex\", |b| {\n\n b.iter(|| {\n\n parse_color(\"#ff0077\");\n\n })\n\n });\n\n c.bench_function(\"parse_hex_short\", |b| {\n\n b.iter(|| {\n\n parse_color(\"#f07\");\n\n })\n\n });\n\n c.bench_function(\"parse_rgb\", |b| {\n\n b.iter(|| {\n\n parse_color(\"rgb(255, 125, 0)\");\n\n })\n\n });\n\n c.bench_function(\"parse_hsl\", |b| b.iter(|| parse_color(\"hsl(280,20%,50%)\")));\n\n}\n\n\n\ncriterion_group!(benches, criterion_benchmark);\n\ncriterion_main!(benches);\n","file_path":"benches/parse_color.rs","rank":14,"score":117248.22021137728},{"content":"fn rgba(r: u8, g: u8, b: u8, a: f64) -> Color {\n\n Color::from_rgba(r, g, b, a)\n\n}\n\n\n","file_path":"src/parser.rs","rank":15,"score":117233.53559988114},{"content":"pub trait ColorCommand {\n\n fn run(\n\n &self,\n\n out: &mut Output,\n\n matches: &ArgMatches,\n\n config: &Config,\n\n color: &Color,\n\n ) -> Result<()>;\n\n}\n","file_path":"src/cli/commands/traits.rs","rank":16,"score":105851.62450482087},{"content":"fn degrees_to_radians(degrees: f64) -> f64 {\n\n degrees * (f64::consts::PI / 180.0)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::{ciede2000, Lab};\n\n\n\n fn round(val: f64) -> f64 {\n\n let rounded = val * 10000_f64;\n\n rounded.round() / 10000_f64\n\n }\n\n\n\n fn assert_delta_e(expected: f64, lab1: &[f64; 3], lab2: &[f64; 3]) {\n\n let color1 = Lab {\n\n l: lab1[0],\n\n a: lab1[1],\n\n b: lab1[2],\n\n alpha: 1.0,\n\n };\n","file_path":"src/delta_e.rs","rank":17,"score":104960.4045008853},{"content":"fn radians_to_degrees(radians: f64) -> f64 {\n\n radians * (180.0 / f64::consts::PI)\n\n}\n\n\n","file_path":"src/delta_e.rs","rank":18,"score":104960.4045008853},{"content":"fn get_delta_h_prime(c1: f64, c2: f64, h_prime_1: f64, h_prime_2: f64) -> f64 {\n\n if 0.0 == c1 || 0.0 == c2 {\n\n return 0.0;\n\n }\n\n\n\n if (h_prime_1 - h_prime_2).abs() <= 180.0 {\n\n return h_prime_2 - h_prime_1;\n\n }\n\n\n\n if h_prime_2 <= h_prime_1 {\n\n h_prime_2 - h_prime_1 + 360.0\n\n } else {\n\n h_prime_2 - h_prime_1 - 360.0\n\n }\n\n}\n\n\n","file_path":"src/delta_e.rs","rank":19,"score":103702.26892221288},{"content":"fn get_upcase_h_bar_prime(h_prime_1: f64, h_prime_2: f64) -> f64 {\n\n if (h_prime_1 - h_prime_2).abs() > 180.0 {\n\n return (h_prime_1 + h_prime_2 + 360.0) / 2.0;\n\n }\n\n\n\n (h_prime_1 + h_prime_2) / 2.0\n\n}\n\n\n","file_path":"src/delta_e.rs","rank":20,"score":102679.44193213448},{"content":"fn get_r_sub_t(c_bar_prime: f64, upcase_h_bar_prime: f64) -> f64 {\n\n -2.0 * (c_bar_prime.powi(7) / (c_bar_prime.powi(7) + 25f64.powi(7))).sqrt()\n\n * (degrees_to_radians(60.0 * (-(((upcase_h_bar_prime - 275.0) / 25.0).powi(2))).exp()))\n\n .sin()\n\n}\n\n\n","file_path":"src/delta_e.rs","rank":21,"score":101114.70339785097},{"content":"fn get_upcase_t(upcase_h_bar_prime: f64) -> f64 {\n\n 1.0 - 0.17 * (degrees_to_radians(upcase_h_bar_prime - 30.0)).cos()\n\n + 0.24 * (degrees_to_radians(2.0 * upcase_h_bar_prime)).cos()\n\n + 0.32 * (degrees_to_radians(3.0 * upcase_h_bar_prime + 6.0)).cos()\n\n - 0.20 * (degrees_to_radians(4.0 * upcase_h_bar_prime - 63.0)).cos()\n\n}\n\n\n","file_path":"src/delta_e.rs","rank":22,"score":100848.32754546811},{"content":"/// Like `%`, but always positive.\n\npub fn mod_positive(x: Scalar, y: Scalar) -> Scalar {\n\n (x % y + y) % y\n\n}\n\n\n","file_path":"src/helper.rs","rank":23,"score":97292.4690851545},{"content":"/// Run an external color picker tool (e.g. gpick or xcolor) and get the output as a string.\n\npub fn run_external_colorpicker(picker: Option<&str>) -> Result<String> {\n\n for tool in COLOR_PICKER_TOOLS\n\n .iter()\n\n .filter(|t| picker.map_or(true, |p| t.command.eq_ignore_ascii_case(p)))\n\n {\n\n let result = Command::new(tool.command).args(tool.version_args).output();\n\n\n\n let tool_is_available = match result {\n\n Ok(ref output) => {\n\n output.stdout.starts_with(tool.version_output_starts_with)\n\n || output.stderr.starts_with(tool.version_output_starts_with)\n\n }\n\n _ => false,\n\n };\n\n\n\n if tool_is_available {\n\n let result = Command::new(tool.command).args(tool.args).output()?;\n\n if !result.status.success() {\n\n return Err(PastelError::ColorPickerExecutionError(\n\n tool.command.to_string(),\n","file_path":"src/cli/colorpicker.rs","rank":24,"score":95882.49734814632},{"content":"pub fn get_mixing_function(\n\n colorspace_name: &str,\n\n) -> Box<dyn Fn(&Color, &Color, Fraction) -> Color> {\n\n match colorspace_name.to_lowercase().as_ref() {\n\n \"rgb\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<RGBA<f64>>(c2, f)),\n\n \"hsl\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<HSLA>(c2, f)),\n\n \"lab\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<Lab>(c2, f)),\n\n \"lch\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<LCh>(c2, f)),\n\n _ => unreachable!(\"Unknown color space\"),\n\n }\n\n}\n","file_path":"src/cli/colorspace.rs","rank":25,"score":93143.80776775708},{"content":"#[derive(Debug, Clone)]\n\nstruct ColorStop {\n\n color: Color,\n\n position: Fraction,\n\n}\n\n\n\n/// The representation of a color scale.\n\n/// The first `ColorStop` (position 0.0) defines the left end color.\n\n/// The last `ColorStop` (position 1.0) defines the right end color.\n\n#[derive(Debug, Clone)]\n\npub struct ColorScale {\n\n color_stops: Vec<ColorStop>,\n\n}\n\n\n\nimpl ColorScale {\n\n /// Create an empty `ColorScale`.\n\n pub fn empty() -> Self {\n\n Self {\n\n color_stops: Vec::new(),\n\n }\n\n }\n","file_path":"src/lib.rs","rank":26,"score":92751.43319886108},{"content":"fn run() -> Result<ExitCode> {\n\n let app = cli::build_cli();\n\n let global_matches = app.get_matches();\n\n\n\n let interactive_mode = atty::is(Stream::Stdout);\n\n\n\n let color_mode = if global_matches.is_present(\"force-color\") {\n\n Some(ansi::Mode::TrueColor)\n\n } else {\n\n match global_matches\n\n .value_of(\"color-mode\")\n\n .expect(\"required argument\")\n\n {\n\n \"24bit\" => Some(ansi::Mode::TrueColor),\n\n \"8bit\" => Some(ansi::Mode::Ansi8Bit),\n\n \"off\" => None,\n\n \"auto\" => {\n\n if interactive_mode {\n\n let env_color_mode = std::env::var(\"PASTEL_COLOR_MODE\").ok();\n\n match env_color_mode.as_deref() {\n","file_path":"src/cli/main.rs","rank":27,"score":92069.71802726941},{"content":"#[cfg(target_os = \"linux\")]\n\npub fn gdbus_parse_color(raw: String) -> Result<String, &'static str> {\n\n const PARSE_ERROR: &str = \"Unexpected gdbus output format\";\n\n let rgb = raw\n\n .split('(')\n\n .nth(2)\n\n .ok_or(PARSE_ERROR)?\n\n .split(')')\n\n .next()\n\n .ok_or(PARSE_ERROR)?;\n\n let rgb = rgb\n\n .split(',')\n\n .map(|v| v.trim().parse::<f64>())\n\n .collect::<Result<Vec<_>, _>>()\n\n .map_err(|_| PARSE_ERROR)?;\n\n if rgb.len() != 3 {\n\n return Err(PARSE_ERROR);\n\n }\n\n Ok(format!(\n\n \"rgb({}%,{}%,{}%)\",\n\n rgb[0] * 100.,\n\n rgb[1] * 100.,\n\n rgb[2] * 100.\n\n ))\n\n}\n","file_path":"src/cli/colorpicker_tools.rs","rank":28,"score":89527.85805420799},{"content":"#[cfg(windows)]\n\npub fn get_colormode() -> Option<Mode> {\n\n use std::env;\n\n let env_nocolor = env::var_os(\"NO_COLOR\");\n\n match env_nocolor {\n\n Some(_) => None,\n\n // Assume 24bit support on Windows\n\n None => Some(Mode::TrueColor),\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub struct Brush {\n\n mode: Option<Mode>,\n\n}\n\n\n\nimpl Brush {\n\n pub fn from_mode(mode: Option<Mode>) -> Self {\n\n Brush { mode }\n\n }\n\n\n","file_path":"src/ansi.rs","rank":29,"score":87579.7248637676},{"content":"pub fn build_cli() -> Command<'static> {\n\n let color_arg = Arg::new(\"color\")\n\n .help(\n\n \"Colors can be specified in many different formats, such as #RRGGBB, RRGGBB, \\\n\n #RGB, 'rgb(…, …, …)', 'hsl(…, …, …)', 'gray(…)' or simply by the name of the \\\n\n color. The identifier '-' can be used to read a single color from standard input. \\\n\n Also, the special identifier 'pick' can be used to run an external color picker \\\n\n to choose a color. If no color argument is specified, colors will be read from \\\n\n standard input.\\n\\\n\n Examples (all of these specify the same color):\\\n\n \\n - lightslategray\\\n\n \\n - '#778899'\\\n\n \\n - 778899\\\n\n \\n - 789\\\n\n \\n - 'rgb(119, 136, 153)'\\\n\n \\n - '119,136,153'\\\n\n \\n - 'hsl(210, 14.3%, 53.3%)'\\n\\\n\n Alpha transparency is also supported:\\\n\n \\n - '#77889980'\\\n\n \\n - 'rgba(119, 136, 153, 0.5)'\\\n","file_path":"src/cli/cli.rs","rank":30,"score":85368.92536475374},{"content":"pub trait ColorSpace {\n\n fn from_color(c: &Color) -> Self;\n\n fn into_color(self) -> Color;\n\n\n\n fn mix(&self, other: &Self, fraction: Fraction) -> Self;\n\n}\n","file_path":"src/colorspace.rs","rank":31,"score":85271.80117534977},{"content":"pub trait AnsiColor {\n\n fn from_ansi_8bit(code: u8) -> Self;\n\n fn to_ansi_8bit(&self) -> u8;\n\n\n\n fn to_ansi_sequence(&self, mode: Mode) -> String;\n\n}\n\n\n\nimpl AnsiColor for Color {\n\n /// Create a color from an 8-bit ANSI escape code\n\n ///\n\n /// See: <https://en.wikipedia.org/wiki/ANSI_escape_code>\n\n fn from_ansi_8bit(code: u8) -> Color {\n\n match code {\n\n 0 => Color::black(),\n\n 1 => Color::maroon(),\n\n 2 => Color::green(),\n\n 3 => Color::olive(),\n\n 4 => Color::navy(),\n\n 5 => Color::purple(),\n\n 6 => Color::teal(),\n","file_path":"src/ansi.rs","rank":32,"score":85271.80117534977},{"content":"fn rgb(r: u8, g: u8, b: u8) -> Color {\n\n Color::from_rgb(r, g, b)\n\n}\n\n\n","file_path":"src/parser.rs","rank":33,"score":80569.82541659176},{"content":"#[test]\n\nfn color_reads_colors_from_args() {\n\n pastel()\n\n .arg(\"color\")\n\n .arg(\"red\")\n\n .assert()\n\n .success()\n\n .stdout(\"hsl(0,100.0%,50.0%)\\n\");\n\n\n\n pastel()\n\n .arg(\"color\")\n\n .arg(\"red\")\n\n .arg(\"blue\")\n\n .assert()\n\n .success()\n\n .stdout(\"hsl(0,100.0%,50.0%)\\nhsl(240,100.0%,50.0%)\\n\");\n\n\n\n pastel().arg(\"color\").arg(\"no color\").assert().failure();\n\n}\n\n\n","file_path":"tests/integration_tests.rs","rank":34,"score":80163.31632197197},{"content":"#[test]\n\nfn color_reads_colors_from_stdin() {\n\n pastel()\n\n .arg(\"color\")\n\n .write_stdin(\"red\\nblue\\n\")\n\n .assert()\n\n .success()\n\n .stdout(\"hsl(0,100.0%,50.0%)\\nhsl(240,100.0%,50.0%)\\n\");\n\n\n\n pastel()\n\n .arg(\"color\")\n\n .write_stdin(\"no color\")\n\n .assert()\n\n .failure();\n\n}\n\n\n","file_path":"tests/integration_tests.rs","rank":35,"score":80163.31632197197},{"content":"fn parse_hex(input: &str) -> IResult<&str, Color> {\n\n let (input, _) = opt_hash_char(input)?;\n\n let (input, hex_chars) = hex_digit1(input)?;\n\n match hex_chars.len() {\n\n // RRGGBB\n\n 6 => {\n\n let r = hex_to_u8_unsafe(&hex_chars[0..2]);\n\n let g = hex_to_u8_unsafe(&hex_chars[2..4]);\n\n let b = hex_to_u8_unsafe(&hex_chars[4..6]);\n\n Ok((input, rgb(r, g, b)))\n\n }\n\n // RGB\n\n 3 => {\n\n let r = hex_to_u8_unsafe(&hex_chars[0..1]);\n\n let g = hex_to_u8_unsafe(&hex_chars[1..2]);\n\n let b = hex_to_u8_unsafe(&hex_chars[2..3]);\n\n let r = r * 16 + r;\n\n let g = g * 16 + g;\n\n let b = b * 16 + b;\n\n Ok((input, rgb(r, g, b)))\n","file_path":"src/parser.rs","rank":36,"score":79574.71329894724},{"content":"fn parse_lch(input: &str) -> IResult<&str, Color> {\n\n let (input, _) = opt(tag_no_case(\"cie\"))(input)?;\n\n let (input, _) = tag_no_case(\"lch(\")(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, l) = double(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, c) = double(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, h) = parse_angle(input)?;\n\n let (input, alpha) = parse_alpha(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, _) = char(')')(input)?;\n\n\n\n let c = Color::from_lch(l, c, h, alpha);\n\n\n\n Ok((input, c))\n\n}\n\n\n","file_path":"src/parser.rs","rank":37,"score":79574.71329894724},{"content":"fn parse_gray(input: &str) -> IResult<&str, Color> {\n\n let (input, _) = tag(\"gray(\")(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, g) = verify(alt((parse_percentage, double)), |&d| d >= 0.)(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, _) = char(')')(input)?;\n\n\n\n let c = Color::from_rgb_float(g, g, g);\n\n\n\n Ok((input, c))\n\n}\n\n\n","file_path":"src/parser.rs","rank":38,"score":79574.71329894724},{"content":"fn parse_named(input: &str) -> IResult<&str, Color> {\n\n let (input, color) = all_consuming(alpha1)(input)?;\n\n let nc = NAMED_COLORS\n\n .iter()\n\n .find(|nc| color.to_lowercase() == nc.name);\n\n\n\n match nc {\n\n None => Err(Err::Error(nom::error::Error::new(\n\n \"Couldn't find matching named color\",\n\n ErrorKind::Alpha,\n\n ))),\n\n Some(nc) => Ok((input, nc.color.clone())),\n\n }\n\n}\n\n\n","file_path":"src/parser.rs","rank":39,"score":79574.71329894724},{"content":"fn parse_hsl(input: &str) -> IResult<&str, Color> {\n\n let (input, _) = alt((tag(\"hsl(\"), tag(\"hsla(\")))(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, h) = parse_angle(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, s) = parse_percentage(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, l) = parse_percentage(input)?;\n\n let (input, alpha) = parse_alpha(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, _) = char(')')(input)?;\n\n\n\n let c = Color::from_hsla(h, s, l, alpha);\n\n\n\n Ok((input, c))\n\n}\n\n\n","file_path":"src/parser.rs","rank":40,"score":79574.71329894724},{"content":"fn parse_lab(input: &str) -> IResult<&str, Color> {\n\n let (input, _) = opt(tag_no_case(\"cie\"))(input)?;\n\n let (input, _) = tag_no_case(\"lab(\")(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, l) = double(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, a) = double(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, b) = double(input)?;\n\n let (input, alpha) = parse_alpha(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, _) = char(')')(input)?;\n\n\n\n let c = Color::from_lab(l, a, b, alpha);\n\n\n\n Ok((input, c))\n\n}\n\n\n","file_path":"src/parser.rs","rank":41,"score":79574.71329894724},{"content":"fn parse_rads(input: &str) -> IResult<&str, f64> {\n\n let (input, rads) = double(input)?;\n\n let (input, _) = tag(\"rad\")(input)?;\n\n Ok((input, rads * 180. / std::f64::consts::PI))\n\n}\n\n\n","file_path":"src/parser.rs","rank":42,"score":79495.51853174574},{"content":"fn parse_degrees(input: &str) -> IResult<&str, f64> {\n\n let (input, d) = double(input)?;\n\n let (input, _) = alt((tag(\"°\"), tag(\"deg\"), tag(\"\")))(input)?;\n\n Ok((input, d))\n\n}\n\n\n","file_path":"src/parser.rs","rank":43,"score":79495.51853174574},{"content":"fn parse_grads(input: &str) -> IResult<&str, f64> {\n\n let (input, grads) = double(input)?;\n\n let (input, _) = tag(\"grad\")(input)?;\n\n Ok((input, grads * 360. / 400.))\n\n}\n\n\n","file_path":"src/parser.rs","rank":44,"score":79495.51853174574},{"content":"fn parse_percentage(input: &str) -> IResult<&str, f64> {\n\n let (input, percent) = double(input)?;\n\n let (input, _) = char('%')(input)?;\n\n Ok((input, percent / 100.))\n\n}\n\n\n","file_path":"src/parser.rs","rank":45,"score":79495.51853174574},{"content":"fn parse_angle(input: &str) -> IResult<&str, f64> {\n\n alt((parse_turns, parse_grads, parse_rads, parse_degrees))(input)\n\n}\n\n\n","file_path":"src/parser.rs","rank":46,"score":79495.51853174574},{"content":"fn parse_turns(input: &str) -> IResult<&str, f64> {\n\n let (input, turns) = double(input)?;\n\n let (input, _) = tag(\"turn\")(input)?;\n\n Ok((input, turns * 360.))\n\n}\n\n\n","file_path":"src/parser.rs","rank":47,"score":79495.51853174574},{"content":"fn parse_numeric_rgb(input: &str) -> IResult<&str, Color> {\n\n let (input, prefixed) = opt(alt((tag(\"rgb(\"), tag(\"rgba(\"))))(input)?;\n\n let is_prefixed = prefixed.is_some();\n\n let (input, _) = space0(input)?;\n\n let (input, r) = double(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, g) = double(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, b) = double(input)?;\n\n let (input, alpha) = parse_alpha(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, _) = cond(is_prefixed, char(')'))(input)?;\n\n\n\n let r = r / 255.;\n\n let g = g / 255.;\n\n let b = b / 255.;\n\n let c = Color::from_rgba_float(r, g, b, alpha);\n\n\n\n Ok((input, c))\n\n}\n\n\n","file_path":"src/parser.rs","rank":48,"score":77689.14677140843},{"content":"fn parse_percentage_rgb(input: &str) -> IResult<&str, Color> {\n\n let (input, prefixed) = opt(alt((tag(\"rgb(\"), tag(\"rgba(\"))))(input)?;\n\n let is_prefixed = prefixed.is_some();\n\n let (input, _) = space0(input)?;\n\n let (input, r) = parse_percentage(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, g) = parse_percentage(input)?;\n\n let (input, _) = parse_separator(input)?;\n\n let (input, b) = parse_percentage(input)?;\n\n let (input, alpha) = parse_alpha(input)?;\n\n let (input, _) = space0(input)?;\n\n let (input, _) = cond(is_prefixed, char(')'))(input)?;\n\n\n\n let c = Color::from_rgba_float(r, g, b, alpha);\n\n\n\n Ok((input, c))\n\n}\n\n\n","file_path":"src/parser.rs","rank":49,"score":77689.14677140843},{"content":"fn write_stderr(c: Color, title: &str, message: &str) {\n\n writeln!(\n\n io::stderr(),\n\n \"{}: {}\",\n\n Brush::from_environment(Stream::Stdout).paint(format!(\"[{}]\", title), c),\n\n message\n\n )\n\n .ok();\n\n}\n\n\n","file_path":"src/cli/main.rs","rank":50,"score":75968.57067224912},{"content":"fn parse_alpha<'a>(input: &'a str) -> IResult<&'a str, f64> {\n\n let (input, alpha) = opt(|input: &'a str| {\n\n let (input, _) = parse_separator(input)?;\n\n alt((parse_percentage, double))(input)\n\n })(input)?;\n\n Ok((input, alpha.unwrap_or(1.0)))\n\n}\n\n\n","file_path":"src/parser.rs","rank":51,"score":74938.65598089871},{"content":"/// Linearly interpolate between two values.\n\npub fn interpolate(a: Scalar, b: Scalar, fraction: Fraction) -> Scalar {\n\n a + fraction.value() * (b - a)\n\n}\n\n\n","file_path":"src/helper.rs","rank":52,"score":74682.56555850516},{"content":"/// Linearly interpolate between two angles. Always take the shortest path\n\n/// along the circle.\n\npub fn interpolate_angle(a: Scalar, b: Scalar, fraction: Fraction) -> Scalar {\n\n let paths = [(a, b), (a, b + 360.0), (a + 360.0, b)];\n\n\n\n let dist = |&(x, y): &(Scalar, Scalar)| (x - y).abs();\n\n let shortest = paths\n\n .iter()\n\n .min_by(|p1, p2| dist(p1).partial_cmp(&dist(p2)).unwrap_or(Ordering::Less))\n\n .unwrap();\n\n\n\n mod_positive(interpolate(shortest.0, shortest.1, fraction), 360.0)\n\n}\n\n\n\n// `format!`-style format strings only allow specifying a fixed floating\n\n// point precision, e.g. `{:.3}` to print 3 decimal places. This always\n\n// displays trailing zeroes, while web colors generally omit them. For\n\n// example, we'd prefer to print `0.5` as `0.5` instead of `0.500`.\n\n//\n\n// Note that this will round using omitted decimal places:\n\n//\n\n// MaxPrecision::wrap(3, 0.5004) //=> 0.500\n","file_path":"src/helper.rs","rank":53,"score":72791.21948714311},{"content":"fn print_colors(\n\n out: &mut dyn Write,\n\n brush: Brush,\n\n colors: &[Color],\n\n closest_pair: Option<(usize, usize)>,\n\n) -> Result<()> {\n\n for (ci, c) in colors.iter().enumerate() {\n\n let tc = c.text_color();\n\n let mut style = tc.ansi_style();\n\n style.on(c);\n\n\n\n if let Some(pair) = closest_pair {\n\n if pair.0 == ci || pair.1 == ci {\n\n style.bold(true);\n\n style.underline(true);\n\n }\n\n }\n\n\n\n write!(out, \"{} \", brush.paint(c.to_rgb_hex_string(false), style))?;\n\n }\n\n writeln!(out)?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/cli/commands/distinct.rs","rank":54,"score":72765.5961505107},{"content":"fn print_iteration(out: &mut dyn Write, brush: Brush, stats: &IterationStatistics) -> Result<()> {\n\n let result = stats.distance_result;\n\n write!(\n\n out,\n\n \"[{:10.}] D_mean = {:<6.2}; D_min = {:<6.2}; T = {:.6} \",\n\n stats.iteration,\n\n result.mean_closest_distance,\n\n result.min_closest_distance,\n\n stats.temperature\n\n )?;\n\n print_colors(out, brush, &stats.colors, Some(result.closest_pair))?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/cli/commands/distinct.rs","rank":55,"score":65033.31353576126},{"content":"fn named_color(name: &'static str, r: u8, g: u8, b: u8) -> NamedColor {\n\n NamedColor {\n\n name,\n\n color: Color::from_rgb(r, g, b),\n\n }\n\n}\n\n\n\npub static NAMED_COLORS: Lazy<[NamedColor; 148]> = Lazy::new(|| {\n\n [\n\n named_color(\"aliceblue\", 240, 248, 255),\n\n named_color(\"antiquewhite\", 250, 235, 215),\n\n named_color(\"aqua\", 0, 255, 255),\n\n named_color(\"aquamarine\", 127, 255, 212),\n\n named_color(\"azure\", 240, 255, 255),\n\n named_color(\"beige\", 245, 245, 220),\n\n named_color(\"bisque\", 255, 228, 196),\n\n named_color(\"black\", 0, 0, 0),\n\n named_color(\"blanchedalmond\", 255, 235, 205),\n\n named_color(\"blue\", 0, 0, 255),\n\n named_color(\"blueviolet\", 138, 43, 226),\n","file_path":"src/named.rs","rank":56,"score":63542.84268512387},{"content":"type Scalar = f64;\n\n\n\n#[derive(Clone)]\n\npub struct DistanceResult {\n\n /// The closest distance between any two colors\n\n pub min_closest_distance: Scalar,\n\n\n\n /// The average over all nearest-neighbor distances\n\n pub mean_closest_distance: Scalar,\n\n\n\n /// Indices of the colors that were closest to each other\n\n pub closest_pair: (usize, usize),\n\n\n\n /// The closest distance and the index of the nearest neighbor\n\n pub closest_distances: Vec<(Scalar, usize)>,\n\n\n\n pub distance_metric: DistanceMetric,\n\n\n\n /// The number of colors that are fixed and cannot be changed. The actual colors are the first\n\n /// `num_fixed_colors` elements in the `colors` array.\n","file_path":"src/distinct.rs","rank":57,"score":56527.60538613514},{"content":"pub trait RandomizationStrategy {\n\n fn generate(&mut self) -> Color {\n\n self.generate_with(&mut thread_rng())\n\n }\n\n\n\n fn generate_with(&mut self, r: &mut dyn RngCore) -> Color;\n\n}\n\n\n\npub mod strategies {\n\n use super::RandomizationStrategy;\n\n use crate::Color;\n\n\n\n use rand::prelude::*;\n\n\n\n pub struct Vivid;\n\n\n\n impl RandomizationStrategy for Vivid {\n\n fn generate_with(&mut self, rng: &mut dyn RngCore) -> Color {\n\n let hue = rng.gen::<f64>() * 360.0;\n\n let saturation = 0.2 + 0.6 * rng.gen::<f64>();\n","file_path":"src/random.rs","rank":58,"score":54679.5923686156},{"content":"pub trait ToAnsiStyle {\n\n fn ansi_style(&self) -> Style;\n\n}\n\n\n\nimpl ToAnsiStyle for Color {\n\n fn ansi_style(&self) -> Style {\n\n self.clone().into()\n\n }\n\n}\n\n\n","file_path":"src/ansi.rs","rank":59,"score":54679.5923686156},{"content":"pub trait GenericCommand {\n\n fn run(&self, out: &mut Output, matches: &ArgMatches, config: &Config) -> Result<()>;\n\n}\n\n\n","file_path":"src/cli/commands/traits.rs","rank":60,"score":52131.05378191799},{"content":"fn main() {\n\n let var = std::env::var_os(\"SHELL_COMPLETIONS_DIR\").or_else(|| std::env::var_os(\"OUT_DIR\"));\n\n let outdir = match var {\n\n None => return,\n\n Some(outdir) => outdir,\n\n };\n\n fs::create_dir_all(&outdir).unwrap();\n\n\n\n let mut cmd = build_cli();\n\n\n\n for shell in [Shell::Bash, Shell::Zsh, Shell::Fish, Shell::PowerShell] {\n\n generate_to(shell, &mut cmd, crate_name!(), &outdir).unwrap();\n\n }\n\n\n\n println!(\"cargo:rustc-cfg=pastel_normal_build\");\n\n}\n","file_path":"build.rs","rank":61,"score":49459.682883690984},{"content":"#[test]\n\nfn test_interpolate() {\n\n assert_eq!(0.0, interpolate_angle(0.0, 90.0, Fraction::from(0.0)));\n\n assert_eq!(45.0, interpolate_angle(0.0, 90.0, Fraction::from(0.5)));\n\n assert_eq!(90.0, interpolate_angle(0.0, 90.0, Fraction::from(1.0)));\n\n assert_eq!(90.0, interpolate_angle(0.0, 90.0, Fraction::from(1.1)));\n\n}\n\n\n","file_path":"src/helper.rs","rank":62,"score":46195.19505703078},{"content":"fn main() {\n\n let result = run();\n\n match result {\n\n Err(PastelError::StdoutClosed) => {}\n\n Err(err) => {\n\n write_stderr(Color::red(), \"pastel error\", &err.message());\n\n std::process::exit(1);\n\n }\n\n Ok(exit_code) => {\n\n std::process::exit(exit_code);\n\n }\n\n }\n\n}\n","file_path":"src/cli/main.rs","rank":63,"score":46195.19505703078},{"content":"#[test]\n\nfn parse_lch_syntax() {\n\n assert_eq!(\n\n Some(Color::from_lch(12.43, -35.5, 43.4, 1.0)),\n\n parse_color(\"Lch(12.43,-35.5,43.4)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lch(15.0, -23.0, 43.0, 0.5)),\n\n parse_color(\"lch(15,-23,43,0.5)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lch(15.0, 23.0, -43.0, 1.0)),\n\n parse_color(\"CIELch(15,23,-43)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lch(15.0, 35.5, -43.4, 1.0)),\n\n parse_color(\"CIELch(15,35.5,-43.4)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lch(15.0, -35.5, -43.4, 0.4)),\n\n parse_color(\"cieLch(15,-35.5,-43.4,0.4)\")\n","file_path":"src/parser.rs","rank":64,"score":44783.992218743304},{"content":"#[test]\n\nfn parse_alpha_syntax() {\n\n // hex\n\n assert_eq!(Some(rgba(255, 0, 0, 1.0)), parse_color(\"ff0000ff\"));\n\n assert_eq!(Some(rgba(255, 0, 0, 1.0)), parse_color(\"#ff0000ff\"));\n\n\n\n // rgb/rgba\n\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\"rgb(10,0,0,1)\"));\n\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\"rgb(10,0,0, 1)\"));\n\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\"rgba(10,0,0,1)\"));\n\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\"rgba(10,0,0, 1)\"));\n\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\"rgba(10,0,0,1.0)\"));\n\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\"rgba(10,0,0, 1.0)\"));\n\n\n\n // hsl/hsla\n\n assert_eq!(\n\n Some(Color::from_hsla(10.0, 0.5, 0.5, 1.0)),\n\n parse_color(\"hsl(10,50%,50%,1)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_hsla(10.0, 0.5, 0.5, 1.0)),\n","file_path":"src/parser.rs","rank":65,"score":44783.992218743304},{"content":"#[test]\n\nfn test_max_precision() {\n\n assert_eq!(format!(\"{}\", MaxPrecision::wrap(3, 0.5)), \"0.5\");\n\n assert_eq!(format!(\"{}\", MaxPrecision::wrap(3, 0.51)), \"0.51\");\n\n assert_eq!(format!(\"{}\", MaxPrecision::wrap(3, 0.512)), \"0.512\");\n\n assert_eq!(format!(\"{}\", MaxPrecision::wrap(3, 0.5124)), \"0.512\");\n\n assert_eq!(format!(\"{}\", MaxPrecision::wrap(3, 0.5125)), \"0.513\");\n\n}\n","file_path":"src/helper.rs","rank":66,"score":44783.992218743304},{"content":"#[test]\n\nfn parse_hsl_syntax() {\n\n assert_eq!(\n\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\n\n parse_color(\"hsl(280,20%,50%)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\n\n parse_color(\"hsl(280deg,20%,50%)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\n\n parse_color(\"hsl(280°,20%,50%)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_hsl(280.33, 0.123, 0.456)),\n\n parse_color(\"hsl(280.33001,12.3%,45.6%)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\n\n parse_color(\"hsl( 280 , 20% , 50%)\")\n","file_path":"src/parser.rs","rank":67,"score":44783.992218743304},{"content":"#[test]\n\nfn sort_by_basic() {\n\n pastel()\n\n .arg(\"sort-by\")\n\n .arg(\"luminance\")\n\n .arg(\"gray\")\n\n .arg(\"white\")\n\n .arg(\"black\")\n\n .assert()\n\n .success()\n\n .stdout(\"hsl(0,0.0%,0.0%)\\nhsl(0,0.0%,50.2%)\\nhsl(0,0.0%,100.0%)\\n\");\n\n}\n\n\n","file_path":"tests/integration_tests.rs","rank":68,"score":44783.992218743304},{"content":"#[test]\n\nfn format_basic() {\n\n pastel()\n\n .arg(\"format\")\n\n .arg(\"hex\")\n\n .arg(\"red\")\n\n .assert()\n\n .success()\n\n .stdout(\"#ff0000\\n\");\n\n\n\n pastel()\n\n .arg(\"format\")\n\n .arg(\"rgb\")\n\n .arg(\"red\")\n\n .arg(\"blue\")\n\n .assert()\n\n .success()\n\n .stdout(\"rgb(255, 0, 0)\\nrgb(0, 0, 255)\\n\");\n\n}\n\n\n","file_path":"tests/integration_tests.rs","rank":69,"score":44783.992218743304},{"content":"#[test]\n\nfn parse_gray_syntax() {\n\n assert_eq!(Some(Color::graytone(0.2)), parse_color(\"gray(0.2)\"));\n\n assert_eq!(Some(Color::black()), parse_color(\"gray(0.0)\"));\n\n assert_eq!(Some(Color::black()), parse_color(\"gray(0)\"));\n\n assert_eq!(Some(Color::white()), parse_color(\"gray(1.0)\"));\n\n assert_eq!(Some(Color::white()), parse_color(\"gray(1)\"));\n\n assert_eq!(Some(Color::white()), parse_color(\"gray(7.3)\"));\n\n\n\n assert_eq!(Some(Color::graytone(0.32)), parse_color(\"gray(.32)\"));\n\n\n\n assert_eq!(\n\n Some(Color::graytone(0.41)),\n\n parse_color(\" gray( 0.41 ) \")\n\n );\n\n\n\n assert_eq!(Some(Color::graytone(0.2)), parse_color(\"gray(20%)\"));\n\n assert_eq!(Some(Color::black()), parse_color(\"gray(0%)\"));\n\n assert_eq!(Some(Color::black()), parse_color(\"gray(0.0%)\"));\n\n assert_eq!(Some(Color::white()), parse_color(\"gray(100%)\"));\n\n assert_eq!(Some(Color::graytone(0.5)), parse_color(\"gray(50%)\"));\n\n\n\n assert_eq!(None, parse_color(\"gray(-1)\"));\n\n assert_eq!(None, parse_color(\"gray(-1%)\"));\n\n assert_eq!(None, parse_color(\"gray(-4.%)\"));\n\n}\n\n\n","file_path":"src/parser.rs","rank":70,"score":44783.992218743304},{"content":"#[test]\n\nfn test_interpolate_angle() {\n\n assert_eq!(15.0, interpolate_angle(0.0, 30.0, Fraction::from(0.5)));\n\n assert_eq!(20.0, interpolate_angle(0.0, 100.0, Fraction::from(0.2)));\n\n assert_eq!(0.0, interpolate_angle(10.0, 350.0, Fraction::from(0.5)));\n\n assert_eq!(0.0, interpolate_angle(350.0, 10.0, Fraction::from(0.5)));\n\n}\n\n\n","file_path":"src/helper.rs","rank":71,"score":44783.992218743304},{"content":"#[test]\n\nfn verify_cmd() {\n\n build_cli().debug_assert();\n\n}\n","file_path":"src/cli/cli.rs","rank":72,"score":44783.992218743304},{"content":"#[test]\n\nfn parse_lab_syntax() {\n\n assert_eq!(\n\n Some(Color::from_lab(12.43, -35.5, 43.4, 1.0)),\n\n parse_color(\"Lab(12.43,-35.5,43.4)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lab(15.0, -23.0, 43.0, 0.5)),\n\n parse_color(\"lab(15,-23,43,0.5)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lab(15.0, 23.0, -43.0, 1.0)),\n\n parse_color(\"CIELab(15,23,-43)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lab(15.0, 35.5, -43.4, 1.0)),\n\n parse_color(\"CIELab(15,35.5,-43.4)\")\n\n );\n\n assert_eq!(\n\n Some(Color::from_lab(15.0, -35.5, -43.4, 0.4)),\n\n parse_color(\"cieLab(15,-35.5,-43.4,0.4)\")\n","file_path":"src/parser.rs","rank":73,"score":44783.992218743304},{"content":"#[test]\n\nfn set_basic() {\n\n pastel()\n\n .arg(\"set\")\n\n .arg(\"hsl-hue\")\n\n .arg(\"120\")\n\n .arg(\"red\")\n\n .assert()\n\n .success()\n\n .stdout(\"hsl(120,100.0%,50.0%)\\n\");\n\n\n\n pastel()\n\n .arg(\"set\")\n\n .arg(\"hsl-saturation\")\n\n .arg(\"0.1\")\n\n .arg(\"red\")\n\n .assert()\n\n .success()\n\n .stdout(\"hsl(0,10.0%,50.0%)\\n\");\n\n\n\n pastel()\n\n .arg(\"set\")\n\n .arg(\"hsl-lightness\")\n\n .arg(\"0.5\")\n\n .arg(\"white\")\n\n .assert()\n\n .success()\n\n .stdout(\"hsl(0,0.0%,50.0%)\\n\");\n\n}\n","file_path":"tests/integration_tests.rs","rank":74,"score":44783.992218743304},{"content":"#[test]\n\nfn parse_named_syntax() {\n\n assert_eq!(Some(Color::black()), parse_color(\"black\"));\n\n assert_eq!(Some(Color::blue()), parse_color(\"blue\"));\n\n assert_eq!(Some(Color::blue()), parse_color(\"Blue\"));\n\n assert_eq!(Some(Color::blue()), parse_color(\"BLUE\"));\n\n assert_eq!(Some(rgb(255, 20, 147)), parse_color(\"deeppink\"));\n\n assert_eq!(None, parse_color(\"whatever\"));\n\n assert_eq!(None, parse_color(\"red blue\"));\n\n}\n\n\n","file_path":"src/parser.rs","rank":75,"score":44783.992218743304},{"content":"#[test]\n\nfn pipe_into_format_command() {\n\n let first = pastel()\n\n .arg(\"color\")\n\n .arg(\"red\")\n\n .arg(\"teal\")\n\n .arg(\"hotpink\")\n\n .assert()\n\n .success();\n\n\n\n pastel()\n\n .arg(\"format\")\n\n .arg(\"name\")\n\n .write_stdin(String::from_utf8(first.get_output().stdout.clone()).unwrap())\n\n .assert()\n\n .success()\n\n .stdout(\"red\\nteal\\nhotpink\\n\");\n\n}\n\n\n","file_path":"tests/integration_tests.rs","rank":76,"score":43494.6915452264},{"content":"#[test]\n\nfn parse_rgb_hex_syntax() {\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"f09\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"#f09\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"#F09\"));\n\n\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"#ff0099\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"#FF0099\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"ff0099\"));\n\n\n\n assert_eq!(Some(rgb(87, 166, 206)), parse_color(\"57A6CE\"));\n\n assert_eq!(Some(rgb(255, 0, 119)), parse_color(\" #ff0077 \"));\n\n\n\n assert_eq!(None, parse_color(\"#1\"));\n\n assert_eq!(None, parse_color(\"#12\"));\n\n assert_eq!(None, parse_color(\"#12345\"));\n\n assert_eq!(None, parse_color(\"#1234567\"));\n\n assert_eq!(None, parse_color(\"#hh0033\"));\n\n assert_eq!(None, parse_color(\"#h03\"));\n\n}\n\n\n","file_path":"src/parser.rs","rank":77,"score":43494.6915452264},{"content":"fn print_pastel_warning() {\n\n write_stderr(\n\n Color::yellow(),\n\n \"pastel warning\",\n\n \"Your terminal emulator does not appear to support 24-bit colors \\\n\n (this means that the COLORTERM environment variable is not set to \\\n\n 'truecolor' or '24bit'). \\\n\n pastel will fall back to 8-bit colors, but you will only be able \\\n\n to see rough approximations of the real colors.\\n\\n\\\n\n To fix this, follow these steps:\\n \\\n\n 1. Run 'pastel colorcheck' to test if your terminal\\n \\\n\n emulator does support 24-bit colors. If this is the\\n \\\n\n case, set 'PASTEL_COLOR_MODE=24bit' to force 24-bit\\n \\\n\n mode and to remove this warning. Alternatively, make\\n \\\n\n sure that COLORTERM is properly set by your terminal\\n \\\n\n emulator.\\n \\\n\n 2. If your terminal emulator does not support 24-bit\\n \\\n\n colors, set 'PASTEL_COLOR_MODE=8bit' to remove this\\n \\\n\n warning or try a different terminal emulator.\\n\\n\\\n\n \\\n\n For more information, see https://gist.github.com/XVilka/8346728\\n\",\n\n );\n\n}\n\n\n","file_path":"src/cli/main.rs","rank":78,"score":43494.6915452264},{"content":"#[test]\n\nfn parse_rgb_standalone_syntax() {\n\n assert_eq!(\n\n Some(rgb(255, 8, 119)),\n\n parse_color(\" rgb( 255 , 8 , 119 ) \")\n\n );\n\n\n\n assert_eq!(rgb(255, 0, 153), parse_color(\"255,0,153\").unwrap());\n\n assert_eq!(rgb(255, 0, 153), parse_color(\"255, 0, 153\").unwrap());\n\n assert_eq!(\n\n rgb(255, 0, 153),\n\n parse_color(\" 255 , 0 , 153 \").unwrap()\n\n );\n\n assert_eq!(rgb(255, 0, 153), parse_color(\"255 0 153\").unwrap());\n\n assert_eq!(rgb(255, 0, 153), parse_color(\"255 0 153.0\").unwrap());\n\n\n\n assert_eq!(Some(rgb(1, 2, 3)), parse_color(\"1,2,3\"));\n\n}\n\n\n","file_path":"src/parser.rs","rank":79,"score":43494.6915452264},{"content":"#[test]\n\nfn parse_rgb_functional_syntax() {\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"rgb(255,0,153)\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"rgb(255, 0, 153)\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"rgb( 255 , 0 , 153 )\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"rgb(255, 0, 153.0)\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"rgb(255 0 153)\"));\n\n\n\n assert_eq!(\n\n Some(rgb(255, 8, 119)),\n\n parse_color(\" rgb( 255 , 8 , 119 ) \")\n\n );\n\n\n\n assert_eq!(Some(rgb(255, 0, 127)), parse_color(\"rgb(100%,0%,49.8%)\"));\n\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\"rgb(100%,0%,60%)\"));\n\n assert_eq!(Some(rgb(255, 0, 119)), parse_color(\"rgb(100%,0%,46.7%)\"));\n\n assert_eq!(Some(rgb(3, 54, 119)), parse_color(\"rgb(1%,21.2%,46.7%)\"));\n\n assert_eq!(Some(rgb(255, 0, 119)), parse_color(\"rgb(255 0 119)\"));\n\n assert_eq!(\n\n Some(rgb(255, 0, 119)),\n\n parse_color(\"rgb( 255 0 119)\")\n","file_path":"src/parser.rs","rank":80,"score":43494.6915452264},{"content":"fn pastel() -> Command {\n\n let mut cmd = Command::cargo_bin(\"pastel\").unwrap();\n\n cmd.env_remove(\"PASTEL_COLOR_MODE\");\n\n cmd\n\n}\n\n\n","file_path":"tests/integration_tests.rs","rank":81,"score":43484.594388290396},{"content":"fn print_distance_matrix(\n\n out: &mut dyn Write,\n\n brush: Brush,\n\n colors: &[Color],\n\n metric: DistanceMetric,\n\n) -> Result<()> {\n\n let count = colors.len();\n\n\n\n let distance = |c1: &Color, c2: &Color| match metric {\n\n DistanceMetric::CIE76 => c1.distance_delta_e_cie76(c2),\n\n DistanceMetric::CIEDE2000 => c1.distance_delta_e_ciede2000(c2),\n\n };\n\n\n\n let mut min = std::f64::MAX;\n\n let mut max = 0.0;\n\n for i in 0..count {\n\n for j in 0..count {\n\n if i != j {\n\n let dist = distance(&colors[i], &colors[j]);\n\n if dist < min {\n","file_path":"src/cli/commands/distinct.rs","rank":82,"score":42312.15181629201},{"content":"fn cube_to_8bit(code: u8) -> u8 {\n\n assert!(code < 6);\n\n match code {\n\n 0 => 0,\n\n _ => 55 + 40 * code,\n\n }\n\n}\n\n\n","file_path":"src/ansi.rs","rank":83,"score":38991.808183652334},{"content":"fn hex_to_u8_unsafe(num: &str) -> u8 {\n\n u8::from_str_radix(num, 16).unwrap()\n\n}\n\n\n","file_path":"src/parser.rs","rank":84,"score":37903.29603443151},{"content":"fn parse_separator(input: &str) -> IResult<&str, &str> {\n\n alt((comma_separated, space1))(input)\n\n}\n\n\n","file_path":"src/parser.rs","rank":85,"score":35398.88139378665},{"content":"fn comma_separated(input: &str) -> IResult<&str, &str> {\n\n let (input, _) = space0(input)?;\n\n let (input, _) = char(',')(input)?;\n\n space0(input)\n\n}\n\n\n","file_path":"src/parser.rs","rank":86,"score":35398.88139378665},{"content":"use pastel::ansi::Brush;\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Config<'p> {\n\n pub padding: usize,\n\n pub colorpicker_width: usize,\n\n pub colorcheck_width: usize,\n\n pub colorpicker: Option<&'p str>,\n\n pub interactive_mode: bool,\n\n pub brush: Brush,\n\n}\n","file_path":"src/cli/config.rs","rank":87,"score":34199.235178276984},{"content":"use std::io::Write;\n\n\n\nuse crate::config::Config;\n\nuse crate::error::Result;\n\nuse crate::hdcanvas::Canvas;\n\nuse crate::utility::similar_colors;\n\n\n\nuse pastel::Color;\n\nuse pastel::Format;\n\n\n\n// #[derive(Debug)]\n\npub struct Output<'a> {\n\n pub handle: &'a mut dyn Write,\n\n colors_shown: usize,\n\n}\n\n\n\nimpl Output<'_> {\n\n pub fn new(handle: &mut dyn Write) -> Output {\n\n Output {\n\n handle,\n","file_path":"src/cli/output.rs","rank":88,"score":34148.05195594544},{"content":"\n\n canvas.print(self.handle)\n\n }\n\n\n\n pub fn show_color(&mut self, config: &Config, color: &Color) -> Result<()> {\n\n if config.interactive_mode {\n\n if self.colors_shown < 1 {\n\n writeln!(self.handle)?\n\n };\n\n self.show_color_tty(config, color)?;\n\n writeln!(self.handle)?;\n\n } else {\n\n writeln!(self.handle, \"{}\", color.to_hsl_string(Format::NoSpaces))?;\n\n }\n\n self.colors_shown += 1;\n\n\n\n Ok(())\n\n }\n\n}\n","file_path":"src/cli/output.rs","rank":89,"score":34137.83053958249},{"content":" colors_shown: 0,\n\n }\n\n }\n\n\n\n pub fn show_color_tty(&mut self, config: &Config, color: &Color) -> Result<()> {\n\n let checkerboard_size: usize = 16;\n\n let color_panel_size: usize = 12;\n\n\n\n let checkerboard_position_y: usize = 0;\n\n let checkerboard_position_x: usize = config.padding;\n\n let color_panel_position_y: usize =\n\n checkerboard_position_y + (checkerboard_size - color_panel_size) / 2;\n\n let color_panel_position_x: usize =\n\n config.padding + (checkerboard_size - color_panel_size) / 2;\n\n let text_position_x: usize = checkerboard_size + 2 * config.padding;\n\n let text_position_y: usize = 0;\n\n\n\n let mut canvas = Canvas::new(checkerboard_size, 60, config.brush);\n\n canvas.draw_checkerboard(\n\n checkerboard_position_y,\n","file_path":"src/cli/output.rs","rank":90,"score":34136.86024440189},{"content":" checkerboard_position_x,\n\n checkerboard_size,\n\n checkerboard_size,\n\n &Color::graytone(0.94),\n\n &Color::graytone(0.71),\n\n );\n\n canvas.draw_rect(\n\n color_panel_position_y,\n\n color_panel_position_x,\n\n color_panel_size,\n\n color_panel_size,\n\n color,\n\n );\n\n\n\n let mut text_y_offset = 0;\n\n let similar = similar_colors(color);\n\n\n\n for (i, nc) in similar.iter().enumerate().take(3) {\n\n if nc.color == *color {\n\n canvas.draw_text(\n","file_path":"src/cli/output.rs","rank":91,"score":34131.02380549978},{"content":" text_position_y + 0 + text_y_offset,\n\n text_position_x,\n\n &format!(\"Hex: {}\", color.to_rgb_hex_string(true)),\n\n );\n\n canvas.draw_text(\n\n text_position_y + 2 + text_y_offset,\n\n text_position_x,\n\n &format!(\"RGB: {}\", color.to_rgb_string(Format::Spaces)),\n\n );\n\n canvas.draw_text(\n\n text_position_y + 4 + text_y_offset,\n\n text_position_x,\n\n &format!(\"HSL: {}\", color.to_hsl_string(Format::Spaces)),\n\n );\n\n\n\n canvas.draw_text(\n\n text_position_y + 8 + text_y_offset,\n\n text_position_x,\n\n \"Most similar:\",\n\n );\n","file_path":"src/cli/output.rs","rank":92,"score":34127.73724544361},{"content":" text_position_y,\n\n text_position_x,\n\n &format!(\"Name: {}\", nc.name),\n\n );\n\n text_y_offset = 2;\n\n continue;\n\n }\n\n\n\n canvas.draw_text(text_position_y + 10 + 2 * i, text_position_x + 7, nc.name);\n\n canvas.draw_rect(\n\n text_position_y + 10 + 2 * i,\n\n text_position_x + 1,\n\n 2,\n\n 5,\n\n &nc.color,\n\n );\n\n }\n\n\n\n #[allow(clippy::identity_op)]\n\n canvas.draw_text(\n","file_path":"src/cli/output.rs","rank":93,"score":34126.95125874111},{"content":"fn opt_hash_char(s: &str) -> IResult<&str, Option<char>> {\n\n opt(char('#'))(s)\n\n}\n\n\n","file_path":"src/parser.rs","rank":94,"score":33854.43506680201},{"content":"use criterion::{criterion_group, criterion_main, Criterion};\n\nuse pastel::parser::parse_color;\n\n\n","file_path":"benches/parse_color.rs","rank":95,"score":33635.02762928185},{"content":"use crate::commands::prelude::*;\n\n\n\npub struct ShowCommand;\n\n\n\nimpl ColorCommand for ShowCommand {\n\n fn run(&self, out: &mut Output, _: &ArgMatches, config: &Config, color: &Color) -> Result<()> {\n\n out.show_color(config, color)\n\n }\n\n}\n","file_path":"src/cli/commands/show.rs","rank":99,"score":27.267342931457037}],"string":"[\n {\n \"content\": \"/// Trim a number such that it fits into the range [lower, upper].\\n\\npub fn clamp(lower: Scalar, upper: Scalar, x: Scalar) -> Scalar {\\n\\n Scalar::max(Scalar::min(upper, x), lower)\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub struct Fraction {\\n\\n f: Scalar,\\n\\n}\\n\\n\\n\\nimpl Fraction {\\n\\n pub fn from(s: Scalar) -> Self {\\n\\n Fraction {\\n\\n f: clamp(0.0, 1.0, s),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn value(self) -> Scalar {\\n\\n self.f\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helper.rs\",\n \"rank\": 1,\n \"score\": 171202.1231389646\n },\n {\n \"content\": \"fn print_board(out: &mut Output, config: &Config, mode: Mode) -> Result<()> {\\n\\n // These colors have been chosen/computed such that the perceived color difference (CIE delta-E\\n\\n // 2000) to the closest ANSI 8-bit color is maximal.\\n\\n let c1 = Color::from_rgb(73, 39, 50);\\n\\n let c2 = Color::from_rgb(16, 51, 30);\\n\\n let c3 = Color::from_rgb(29, 54, 90);\\n\\n\\n\\n let width = config.colorcheck_width;\\n\\n\\n\\n let mut canvas = Canvas::new(\\n\\n width + 2 * config.padding,\\n\\n 3 * width + 3 * config.padding,\\n\\n Brush::from_mode(Some(mode)),\\n\\n );\\n\\n\\n\\n canvas.draw_rect(config.padding, config.padding, width, width, &c1);\\n\\n\\n\\n canvas.draw_rect(\\n\\n config.padding,\\n\\n 2 * config.padding + width,\\n\",\n \"file_path\": \"src/cli/commands/colorcheck.rs\",\n \"rank\": 2,\n \"score\": 164284.16409518497\n },\n {\n \"content\": \"/// Re-arrange the sequence of colors such that the minimal difference between a given color and\\n\\n/// any of its predecessors is maximized.\\n\\n///\\n\\n/// Note: this is only a heuristic and will not yield optimal results (especially at the end of\\n\\n/// the sequence).\\n\\n///\\n\\n/// See: <https://en.wikipedia.org/wiki/Farthest-first_traversal>\\n\\npub fn rearrange_sequence(colors: &mut Vec<Color>, metric: DistanceMetric) {\\n\\n let distance = |c1: &Color, c2: &Color| match metric {\\n\\n DistanceMetric::CIE76 => c1.distance_delta_e_cie76(c2),\\n\\n DistanceMetric::CIEDE2000 => c1.distance_delta_e_ciede2000(c2),\\n\\n };\\n\\n\\n\\n // vector where the i-th element contains the minimum distance to the colors from 0 to i-1.\\n\\n let mut min_distances = vec![i32::max_value(); colors.len()];\\n\\n\\n\\n for i in 1..colors.len() {\\n\\n let mut max_i = colors.len();\\n\\n let mut max_d = i32::min_value();\\n\\n\\n\\n for j in i..colors.len() {\\n\\n min_distances[j] =\\n\\n min_distances[j].min((distance(&colors[j], &colors[i - 1]) * 1000.0) as i32);\\n\\n\\n\\n if min_distances[j] > max_d {\\n\\n max_i = j;\\n\\n max_d = min_distances[j];\\n\\n }\\n\\n }\\n\\n\\n\\n colors.swap(i, max_i);\\n\\n min_distances.swap(i, max_i);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/distinct.rs\",\n \"rank\": 3,\n \"score\": 160470.71012037623\n },\n {\n \"content\": \"/// Print a color spectrum to STDERR.\\n\\npub fn print_colorspectrum(config: &Config) -> Result<()> {\\n\\n let width = config.colorpicker_width;\\n\\n\\n\\n let mut canvas = Canvas::new(\\n\\n width + 2 * config.padding,\\n\\n width + 2 * config.padding,\\n\\n Brush::from_environment(Stream::Stderr),\\n\\n );\\n\\n canvas.draw_rect(\\n\\n config.padding,\\n\\n config.padding,\\n\\n width + 2,\\n\\n width + 2,\\n\\n &Color::white(),\\n\\n );\\n\\n\\n\\n for y in 0..width {\\n\\n for x in 0..width {\\n\\n let rx = (x as f64) / (width as f64);\\n\\n let ry = (y as f64) / (width as f64);\\n\",\n \"file_path\": \"src/cli/colorpicker.rs\",\n \"rank\": 4,\n \"score\": 145547.0687778088\n },\n {\n \"content\": \"/// Returns a list of named colors, sorted by the perceived distance to the given color\\n\\npub fn similar_colors(color: &Color) -> Vec<&NamedColor> {\\n\\n let mut colors: Vec<&NamedColor> = NAMED_COLORS.iter().collect();\\n\\n colors.sort_by_key(|nc| (1000.0 * nc.color.distance_delta_e_ciede2000(color)) as i32);\\n\\n colors.dedup_by(|n1, n2| n1.color == n2.color);\\n\\n colors\\n\\n}\\n\",\n \"file_path\": \"src/cli/utility.rs\",\n \"rank\": 5,\n \"score\": 144192.99905087016\n },\n {\n \"content\": \"pub fn number_arg(matches: &ArgMatches, name: &str) -> Result<f64> {\\n\\n let value_str = matches.value_of(name).expect(\\\"required argument\\\");\\n\\n value_str\\n\\n .parse::<f64>()\\n\\n .map_err(|_| PastelError::CouldNotParseNumber(value_str.into()))\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub enum PrintSpectrum {\\n\\n Yes,\\n\\n No,\\n\\n}\\n\\n\\n\\npub enum ColorArgIterator<'a> {\\n\\n FromPositionalArguments(&'a Config<'a>, Values<'a>, PrintSpectrum),\\n\\n FromStdin,\\n\\n}\\n\\n\\n\\nimpl<'a> ColorArgIterator<'a> {\\n\\n pub fn from_args(config: &'a Config, args: Option<Values<'a>>) -> Result<Self> {\\n\",\n \"file_path\": \"src/cli/commands/io.rs\",\n \"rank\": 6,\n \"score\": 137844.99762734436\n },\n {\n \"content\": \"fn get_h_prime_fn(x: f64, y: f64) -> f64 {\\n\\n if x == 0.0 && y == 0.0 {\\n\\n return 0.0;\\n\\n }\\n\\n\\n\\n let mut hue_angle = radians_to_degrees(x.atan2(y));\\n\\n\\n\\n if hue_angle < 0.0 {\\n\\n hue_angle += 360.0;\\n\\n }\\n\\n\\n\\n hue_angle\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 7,\n \"score\": 136470.45271845092\n },\n {\n \"content\": \"pub fn parse_color(input: &str) -> Option<Color> {\\n\\n alt((\\n\\n all_consuming(parse_hex),\\n\\n all_consuming(parse_numeric_rgb),\\n\\n all_consuming(parse_percentage_rgb),\\n\\n all_consuming(parse_hsl),\\n\\n all_consuming(parse_gray),\\n\\n all_consuming(parse_lab),\\n\\n all_consuming(parse_lch),\\n\\n all_consuming(parse_named),\\n\\n ))(input.trim())\\n\\n .ok()\\n\\n .map(|(_, c)| c)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 8,\n \"score\": 133311.25902068208\n },\n {\n \"content\": \"fn blue_red_yellow(f: f64) -> Color {\\n\\n let blue = Color::from_rgb(0, 0, 120);\\n\\n let red = Color::from_rgb(224, 0, 119);\\n\\n let yellow = Color::from_rgb(255, 255, 0);\\n\\n\\n\\n if f < 0.5 {\\n\\n blue.mix::<HSLA>(&red, Fraction::from(2.0 * f))\\n\\n } else {\\n\\n red.mix::<HSLA>(&yellow, Fraction::from(2.0 * (f - 0.5)))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/commands/distinct.rs\",\n \"rank\": 9,\n \"score\": 130542.23019347189\n },\n {\n \"content\": \"pub fn distinct_colors(\\n\\n count: usize,\\n\\n distance_metric: DistanceMetric,\\n\\n fixed_colors: Vec<Color>,\\n\\n callback: &mut dyn FnMut(&IterationStatistics),\\n\\n) -> (Vec<Color>, DistanceResult) {\\n\\n assert!(count > 1);\\n\\n assert!(fixed_colors.len() <= count);\\n\\n\\n\\n let num_fixed_colors = fixed_colors.len();\\n\\n let mut colors = fixed_colors;\\n\\n\\n\\n for _ in num_fixed_colors..count {\\n\\n colors.push(random::strategies::UniformRGB.generate());\\n\\n }\\n\\n\\n\\n let mut annealing = SimulatedAnnealing::new(\\n\\n &colors,\\n\\n SimulationParameters {\\n\\n initial_temperature: 3.0,\\n\",\n \"file_path\": \"src/distinct.rs\",\n \"rank\": 10,\n \"score\": 128756.39556364014\n },\n {\n \"content\": \"pub fn key_function(sort_order: &str, color: &Color) -> i32 {\\n\\n match sort_order {\\n\\n \\\"brightness\\\" => (color.brightness() * 1000.0) as i32,\\n\\n \\\"luminance\\\" => (color.luminance() * 1000.0) as i32,\\n\\n \\\"hue\\\" => (color.to_lch().h * 1000.0) as i32,\\n\\n \\\"chroma\\\" => (color.to_lch().c * 1000.0) as i32,\\n\\n \\\"random\\\" => random(),\\n\\n _ => unreachable!(\\\"Unknown sort order\\\"),\\n\\n }\\n\\n}\\n\\n\\n\\nimpl GenericCommand for SortCommand {\\n\\n fn run(&self, out: &mut Output, matches: &ArgMatches, config: &Config) -> Result<()> {\\n\\n let sort_order = matches.value_of(\\\"sort-order\\\").expect(\\\"required argument\\\");\\n\\n\\n\\n let mut colors: Vec<Color> = vec![];\\n\\n for color in ColorArgIterator::from_args(config, matches.values_of(\\\"color\\\"))? {\\n\\n colors.push(color?);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/cli/commands/sort.rs\",\n \"rank\": 11,\n \"score\": 127693.98868103817\n },\n {\n \"content\": \"pub fn cie76(c1: &Lab, c2: &Lab) -> f64 {\\n\\n ((c1.l - c2.l).powi(2) + (c1.a - c2.a).powi(2) + (c1.b - c2.b).powi(2)).sqrt()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 12,\n \"score\": 120518.11293140583\n },\n {\n \"content\": \"pub fn ciede2000(color1: &Lab, color2: &Lab) -> f64 {\\n\\n let ksub_l = 1.0;\\n\\n let ksub_c = 1.0;\\n\\n let ksub_h = 1.0;\\n\\n\\n\\n let delta_l_prime = color2.l - color1.l;\\n\\n\\n\\n let l_bar = (color1.l + color2.l) / 2.0;\\n\\n\\n\\n let c1 = (color1.a.powi(2) + color1.b.powi(2)).sqrt();\\n\\n let c2 = (color2.a.powi(2) + color2.b.powi(2)).sqrt();\\n\\n\\n\\n let c_bar = (c1 + c2) / 2.0;\\n\\n\\n\\n let a_prime_1 = color1.a\\n\\n + (color1.a / 2.0) * (1.0 - (c_bar.powi(7) / (c_bar.powi(7) + 25f64.powi(7))).sqrt());\\n\\n let a_prime_2 = color2.a\\n\\n + (color2.a / 2.0) * (1.0 - (c_bar.powi(7) / (c_bar.powi(7) + 25f64.powi(7))).sqrt());\\n\\n\\n\\n let c_prime_1 = (a_prime_1.powi(2) + color1.b.powi(2)).sqrt();\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 13,\n \"score\": 120518.11293140583\n },\n {\n \"content\": \"fn criterion_benchmark(c: &mut Criterion) {\\n\\n c.bench_function(\\\"parse_hex\\\", |b| {\\n\\n b.iter(|| {\\n\\n parse_color(\\\"#ff0077\\\");\\n\\n })\\n\\n });\\n\\n c.bench_function(\\\"parse_hex_short\\\", |b| {\\n\\n b.iter(|| {\\n\\n parse_color(\\\"#f07\\\");\\n\\n })\\n\\n });\\n\\n c.bench_function(\\\"parse_rgb\\\", |b| {\\n\\n b.iter(|| {\\n\\n parse_color(\\\"rgb(255, 125, 0)\\\");\\n\\n })\\n\\n });\\n\\n c.bench_function(\\\"parse_hsl\\\", |b| b.iter(|| parse_color(\\\"hsl(280,20%,50%)\\\")));\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, criterion_benchmark);\\n\\ncriterion_main!(benches);\\n\",\n \"file_path\": \"benches/parse_color.rs\",\n \"rank\": 14,\n \"score\": 117248.22021137728\n },\n {\n \"content\": \"fn rgba(r: u8, g: u8, b: u8, a: f64) -> Color {\\n\\n Color::from_rgba(r, g, b, a)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 15,\n \"score\": 117233.53559988114\n },\n {\n \"content\": \"pub trait ColorCommand {\\n\\n fn run(\\n\\n &self,\\n\\n out: &mut Output,\\n\\n matches: &ArgMatches,\\n\\n config: &Config,\\n\\n color: &Color,\\n\\n ) -> Result<()>;\\n\\n}\\n\",\n \"file_path\": \"src/cli/commands/traits.rs\",\n \"rank\": 16,\n \"score\": 105851.62450482087\n },\n {\n \"content\": \"fn degrees_to_radians(degrees: f64) -> f64 {\\n\\n degrees * (f64::consts::PI / 180.0)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::{ciede2000, Lab};\\n\\n\\n\\n fn round(val: f64) -> f64 {\\n\\n let rounded = val * 10000_f64;\\n\\n rounded.round() / 10000_f64\\n\\n }\\n\\n\\n\\n fn assert_delta_e(expected: f64, lab1: &[f64; 3], lab2: &[f64; 3]) {\\n\\n let color1 = Lab {\\n\\n l: lab1[0],\\n\\n a: lab1[1],\\n\\n b: lab1[2],\\n\\n alpha: 1.0,\\n\\n };\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 17,\n \"score\": 104960.4045008853\n },\n {\n \"content\": \"fn radians_to_degrees(radians: f64) -> f64 {\\n\\n radians * (180.0 / f64::consts::PI)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 18,\n \"score\": 104960.4045008853\n },\n {\n \"content\": \"fn get_delta_h_prime(c1: f64, c2: f64, h_prime_1: f64, h_prime_2: f64) -> f64 {\\n\\n if 0.0 == c1 || 0.0 == c2 {\\n\\n return 0.0;\\n\\n }\\n\\n\\n\\n if (h_prime_1 - h_prime_2).abs() <= 180.0 {\\n\\n return h_prime_2 - h_prime_1;\\n\\n }\\n\\n\\n\\n if h_prime_2 <= h_prime_1 {\\n\\n h_prime_2 - h_prime_1 + 360.0\\n\\n } else {\\n\\n h_prime_2 - h_prime_1 - 360.0\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 19,\n \"score\": 103702.26892221288\n },\n {\n \"content\": \"fn get_upcase_h_bar_prime(h_prime_1: f64, h_prime_2: f64) -> f64 {\\n\\n if (h_prime_1 - h_prime_2).abs() > 180.0 {\\n\\n return (h_prime_1 + h_prime_2 + 360.0) / 2.0;\\n\\n }\\n\\n\\n\\n (h_prime_1 + h_prime_2) / 2.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 20,\n \"score\": 102679.44193213448\n },\n {\n \"content\": \"fn get_r_sub_t(c_bar_prime: f64, upcase_h_bar_prime: f64) -> f64 {\\n\\n -2.0 * (c_bar_prime.powi(7) / (c_bar_prime.powi(7) + 25f64.powi(7))).sqrt()\\n\\n * (degrees_to_radians(60.0 * (-(((upcase_h_bar_prime - 275.0) / 25.0).powi(2))).exp()))\\n\\n .sin()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 21,\n \"score\": 101114.70339785097\n },\n {\n \"content\": \"fn get_upcase_t(upcase_h_bar_prime: f64) -> f64 {\\n\\n 1.0 - 0.17 * (degrees_to_radians(upcase_h_bar_prime - 30.0)).cos()\\n\\n + 0.24 * (degrees_to_radians(2.0 * upcase_h_bar_prime)).cos()\\n\\n + 0.32 * (degrees_to_radians(3.0 * upcase_h_bar_prime + 6.0)).cos()\\n\\n - 0.20 * (degrees_to_radians(4.0 * upcase_h_bar_prime - 63.0)).cos()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/delta_e.rs\",\n \"rank\": 22,\n \"score\": 100848.32754546811\n },\n {\n \"content\": \"/// Like `%`, but always positive.\\n\\npub fn mod_positive(x: Scalar, y: Scalar) -> Scalar {\\n\\n (x % y + y) % y\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helper.rs\",\n \"rank\": 23,\n \"score\": 97292.4690851545\n },\n {\n \"content\": \"/// Run an external color picker tool (e.g. gpick or xcolor) and get the output as a string.\\n\\npub fn run_external_colorpicker(picker: Option<&str>) -> Result<String> {\\n\\n for tool in COLOR_PICKER_TOOLS\\n\\n .iter()\\n\\n .filter(|t| picker.map_or(true, |p| t.command.eq_ignore_ascii_case(p)))\\n\\n {\\n\\n let result = Command::new(tool.command).args(tool.version_args).output();\\n\\n\\n\\n let tool_is_available = match result {\\n\\n Ok(ref output) => {\\n\\n output.stdout.starts_with(tool.version_output_starts_with)\\n\\n || output.stderr.starts_with(tool.version_output_starts_with)\\n\\n }\\n\\n _ => false,\\n\\n };\\n\\n\\n\\n if tool_is_available {\\n\\n let result = Command::new(tool.command).args(tool.args).output()?;\\n\\n if !result.status.success() {\\n\\n return Err(PastelError::ColorPickerExecutionError(\\n\\n tool.command.to_string(),\\n\",\n \"file_path\": \"src/cli/colorpicker.rs\",\n \"rank\": 24,\n \"score\": 95882.49734814632\n },\n {\n \"content\": \"pub fn get_mixing_function(\\n\\n colorspace_name: &str,\\n\\n) -> Box<dyn Fn(&Color, &Color, Fraction) -> Color> {\\n\\n match colorspace_name.to_lowercase().as_ref() {\\n\\n \\\"rgb\\\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<RGBA<f64>>(c2, f)),\\n\\n \\\"hsl\\\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<HSLA>(c2, f)),\\n\\n \\\"lab\\\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<Lab>(c2, f)),\\n\\n \\\"lch\\\" => Box::new(|c1: &Color, c2: &Color, f: Fraction| c1.mix::<LCh>(c2, f)),\\n\\n _ => unreachable!(\\\"Unknown color space\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cli/colorspace.rs\",\n \"rank\": 25,\n \"score\": 93143.80776775708\n },\n {\n \"content\": \"#[derive(Debug, Clone)]\\n\\nstruct ColorStop {\\n\\n color: Color,\\n\\n position: Fraction,\\n\\n}\\n\\n\\n\\n/// The representation of a color scale.\\n\\n/// The first `ColorStop` (position 0.0) defines the left end color.\\n\\n/// The last `ColorStop` (position 1.0) defines the right end color.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ColorScale {\\n\\n color_stops: Vec<ColorStop>,\\n\\n}\\n\\n\\n\\nimpl ColorScale {\\n\\n /// Create an empty `ColorScale`.\\n\\n pub fn empty() -> Self {\\n\\n Self {\\n\\n color_stops: Vec::new(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 26,\n \"score\": 92751.43319886108\n },\n {\n \"content\": \"fn run() -> Result<ExitCode> {\\n\\n let app = cli::build_cli();\\n\\n let global_matches = app.get_matches();\\n\\n\\n\\n let interactive_mode = atty::is(Stream::Stdout);\\n\\n\\n\\n let color_mode = if global_matches.is_present(\\\"force-color\\\") {\\n\\n Some(ansi::Mode::TrueColor)\\n\\n } else {\\n\\n match global_matches\\n\\n .value_of(\\\"color-mode\\\")\\n\\n .expect(\\\"required argument\\\")\\n\\n {\\n\\n \\\"24bit\\\" => Some(ansi::Mode::TrueColor),\\n\\n \\\"8bit\\\" => Some(ansi::Mode::Ansi8Bit),\\n\\n \\\"off\\\" => None,\\n\\n \\\"auto\\\" => {\\n\\n if interactive_mode {\\n\\n let env_color_mode = std::env::var(\\\"PASTEL_COLOR_MODE\\\").ok();\\n\\n match env_color_mode.as_deref() {\\n\",\n \"file_path\": \"src/cli/main.rs\",\n \"rank\": 27,\n \"score\": 92069.71802726941\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\npub fn gdbus_parse_color(raw: String) -> Result<String, &'static str> {\\n\\n const PARSE_ERROR: &str = \\\"Unexpected gdbus output format\\\";\\n\\n let rgb = raw\\n\\n .split('(')\\n\\n .nth(2)\\n\\n .ok_or(PARSE_ERROR)?\\n\\n .split(')')\\n\\n .next()\\n\\n .ok_or(PARSE_ERROR)?;\\n\\n let rgb = rgb\\n\\n .split(',')\\n\\n .map(|v| v.trim().parse::<f64>())\\n\\n .collect::<Result<Vec<_>, _>>()\\n\\n .map_err(|_| PARSE_ERROR)?;\\n\\n if rgb.len() != 3 {\\n\\n return Err(PARSE_ERROR);\\n\\n }\\n\\n Ok(format!(\\n\\n \\\"rgb({}%,{}%,{}%)\\\",\\n\\n rgb[0] * 100.,\\n\\n rgb[1] * 100.,\\n\\n rgb[2] * 100.\\n\\n ))\\n\\n}\\n\",\n \"file_path\": \"src/cli/colorpicker_tools.rs\",\n \"rank\": 28,\n \"score\": 89527.85805420799\n },\n {\n \"content\": \"#[cfg(windows)]\\n\\npub fn get_colormode() -> Option<Mode> {\\n\\n use std::env;\\n\\n let env_nocolor = env::var_os(\\\"NO_COLOR\\\");\\n\\n match env_nocolor {\\n\\n Some(_) => None,\\n\\n // Assume 24bit support on Windows\\n\\n None => Some(Mode::TrueColor),\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy)]\\n\\npub struct Brush {\\n\\n mode: Option<Mode>,\\n\\n}\\n\\n\\n\\nimpl Brush {\\n\\n pub fn from_mode(mode: Option<Mode>) -> Self {\\n\\n Brush { mode }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/ansi.rs\",\n \"rank\": 29,\n \"score\": 87579.7248637676\n },\n {\n \"content\": \"pub fn build_cli() -> Command<'static> {\\n\\n let color_arg = Arg::new(\\\"color\\\")\\n\\n .help(\\n\\n \\\"Colors can be specified in many different formats, such as #RRGGBB, RRGGBB, \\\\\\n\\n #RGB, 'rgb(…, …, …)', 'hsl(…, …, …)', 'gray(…)' or simply by the name of the \\\\\\n\\n color. The identifier '-' can be used to read a single color from standard input. \\\\\\n\\n Also, the special identifier 'pick' can be used to run an external color picker \\\\\\n\\n to choose a color. If no color argument is specified, colors will be read from \\\\\\n\\n standard input.\\\\n\\\\\\n\\n Examples (all of these specify the same color):\\\\\\n\\n \\\\n - lightslategray\\\\\\n\\n \\\\n - '#778899'\\\\\\n\\n \\\\n - 778899\\\\\\n\\n \\\\n - 789\\\\\\n\\n \\\\n - 'rgb(119, 136, 153)'\\\\\\n\\n \\\\n - '119,136,153'\\\\\\n\\n \\\\n - 'hsl(210, 14.3%, 53.3%)'\\\\n\\\\\\n\\n Alpha transparency is also supported:\\\\\\n\\n \\\\n - '#77889980'\\\\\\n\\n \\\\n - 'rgba(119, 136, 153, 0.5)'\\\\\\n\",\n \"file_path\": \"src/cli/cli.rs\",\n \"rank\": 30,\n \"score\": 85368.92536475374\n },\n {\n \"content\": \"pub trait ColorSpace {\\n\\n fn from_color(c: &Color) -> Self;\\n\\n fn into_color(self) -> Color;\\n\\n\\n\\n fn mix(&self, other: &Self, fraction: Fraction) -> Self;\\n\\n}\\n\",\n \"file_path\": \"src/colorspace.rs\",\n \"rank\": 31,\n \"score\": 85271.80117534977\n },\n {\n \"content\": \"pub trait AnsiColor {\\n\\n fn from_ansi_8bit(code: u8) -> Self;\\n\\n fn to_ansi_8bit(&self) -> u8;\\n\\n\\n\\n fn to_ansi_sequence(&self, mode: Mode) -> String;\\n\\n}\\n\\n\\n\\nimpl AnsiColor for Color {\\n\\n /// Create a color from an 8-bit ANSI escape code\\n\\n ///\\n\\n /// See: <https://en.wikipedia.org/wiki/ANSI_escape_code>\\n\\n fn from_ansi_8bit(code: u8) -> Color {\\n\\n match code {\\n\\n 0 => Color::black(),\\n\\n 1 => Color::maroon(),\\n\\n 2 => Color::green(),\\n\\n 3 => Color::olive(),\\n\\n 4 => Color::navy(),\\n\\n 5 => Color::purple(),\\n\\n 6 => Color::teal(),\\n\",\n \"file_path\": \"src/ansi.rs\",\n \"rank\": 32,\n \"score\": 85271.80117534977\n },\n {\n \"content\": \"fn rgb(r: u8, g: u8, b: u8) -> Color {\\n\\n Color::from_rgb(r, g, b)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 33,\n \"score\": 80569.82541659176\n },\n {\n \"content\": \"#[test]\\n\\nfn color_reads_colors_from_args() {\\n\\n pastel()\\n\\n .arg(\\\"color\\\")\\n\\n .arg(\\\"red\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"hsl(0,100.0%,50.0%)\\\\n\\\");\\n\\n\\n\\n pastel()\\n\\n .arg(\\\"color\\\")\\n\\n .arg(\\\"red\\\")\\n\\n .arg(\\\"blue\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"hsl(0,100.0%,50.0%)\\\\nhsl(240,100.0%,50.0%)\\\\n\\\");\\n\\n\\n\\n pastel().arg(\\\"color\\\").arg(\\\"no color\\\").assert().failure();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 34,\n \"score\": 80163.31632197197\n },\n {\n \"content\": \"#[test]\\n\\nfn color_reads_colors_from_stdin() {\\n\\n pastel()\\n\\n .arg(\\\"color\\\")\\n\\n .write_stdin(\\\"red\\\\nblue\\\\n\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"hsl(0,100.0%,50.0%)\\\\nhsl(240,100.0%,50.0%)\\\\n\\\");\\n\\n\\n\\n pastel()\\n\\n .arg(\\\"color\\\")\\n\\n .write_stdin(\\\"no color\\\")\\n\\n .assert()\\n\\n .failure();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 35,\n \"score\": 80163.31632197197\n },\n {\n \"content\": \"fn parse_hex(input: &str) -> IResult<&str, Color> {\\n\\n let (input, _) = opt_hash_char(input)?;\\n\\n let (input, hex_chars) = hex_digit1(input)?;\\n\\n match hex_chars.len() {\\n\\n // RRGGBB\\n\\n 6 => {\\n\\n let r = hex_to_u8_unsafe(&hex_chars[0..2]);\\n\\n let g = hex_to_u8_unsafe(&hex_chars[2..4]);\\n\\n let b = hex_to_u8_unsafe(&hex_chars[4..6]);\\n\\n Ok((input, rgb(r, g, b)))\\n\\n }\\n\\n // RGB\\n\\n 3 => {\\n\\n let r = hex_to_u8_unsafe(&hex_chars[0..1]);\\n\\n let g = hex_to_u8_unsafe(&hex_chars[1..2]);\\n\\n let b = hex_to_u8_unsafe(&hex_chars[2..3]);\\n\\n let r = r * 16 + r;\\n\\n let g = g * 16 + g;\\n\\n let b = b * 16 + b;\\n\\n Ok((input, rgb(r, g, b)))\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 36,\n \"score\": 79574.71329894724\n },\n {\n \"content\": \"fn parse_lch(input: &str) -> IResult<&str, Color> {\\n\\n let (input, _) = opt(tag_no_case(\\\"cie\\\"))(input)?;\\n\\n let (input, _) = tag_no_case(\\\"lch(\\\")(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, l) = double(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, c) = double(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, h) = parse_angle(input)?;\\n\\n let (input, alpha) = parse_alpha(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, _) = char(')')(input)?;\\n\\n\\n\\n let c = Color::from_lch(l, c, h, alpha);\\n\\n\\n\\n Ok((input, c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 37,\n \"score\": 79574.71329894724\n },\n {\n \"content\": \"fn parse_gray(input: &str) -> IResult<&str, Color> {\\n\\n let (input, _) = tag(\\\"gray(\\\")(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, g) = verify(alt((parse_percentage, double)), |&d| d >= 0.)(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, _) = char(')')(input)?;\\n\\n\\n\\n let c = Color::from_rgb_float(g, g, g);\\n\\n\\n\\n Ok((input, c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 38,\n \"score\": 79574.71329894724\n },\n {\n \"content\": \"fn parse_named(input: &str) -> IResult<&str, Color> {\\n\\n let (input, color) = all_consuming(alpha1)(input)?;\\n\\n let nc = NAMED_COLORS\\n\\n .iter()\\n\\n .find(|nc| color.to_lowercase() == nc.name);\\n\\n\\n\\n match nc {\\n\\n None => Err(Err::Error(nom::error::Error::new(\\n\\n \\\"Couldn't find matching named color\\\",\\n\\n ErrorKind::Alpha,\\n\\n ))),\\n\\n Some(nc) => Ok((input, nc.color.clone())),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 39,\n \"score\": 79574.71329894724\n },\n {\n \"content\": \"fn parse_hsl(input: &str) -> IResult<&str, Color> {\\n\\n let (input, _) = alt((tag(\\\"hsl(\\\"), tag(\\\"hsla(\\\")))(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, h) = parse_angle(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, s) = parse_percentage(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, l) = parse_percentage(input)?;\\n\\n let (input, alpha) = parse_alpha(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, _) = char(')')(input)?;\\n\\n\\n\\n let c = Color::from_hsla(h, s, l, alpha);\\n\\n\\n\\n Ok((input, c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 40,\n \"score\": 79574.71329894724\n },\n {\n \"content\": \"fn parse_lab(input: &str) -> IResult<&str, Color> {\\n\\n let (input, _) = opt(tag_no_case(\\\"cie\\\"))(input)?;\\n\\n let (input, _) = tag_no_case(\\\"lab(\\\")(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, l) = double(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, a) = double(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, b) = double(input)?;\\n\\n let (input, alpha) = parse_alpha(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, _) = char(')')(input)?;\\n\\n\\n\\n let c = Color::from_lab(l, a, b, alpha);\\n\\n\\n\\n Ok((input, c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 41,\n \"score\": 79574.71329894724\n },\n {\n \"content\": \"fn parse_rads(input: &str) -> IResult<&str, f64> {\\n\\n let (input, rads) = double(input)?;\\n\\n let (input, _) = tag(\\\"rad\\\")(input)?;\\n\\n Ok((input, rads * 180. / std::f64::consts::PI))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 42,\n \"score\": 79495.51853174574\n },\n {\n \"content\": \"fn parse_degrees(input: &str) -> IResult<&str, f64> {\\n\\n let (input, d) = double(input)?;\\n\\n let (input, _) = alt((tag(\\\"°\\\"), tag(\\\"deg\\\"), tag(\\\"\\\")))(input)?;\\n\\n Ok((input, d))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 43,\n \"score\": 79495.51853174574\n },\n {\n \"content\": \"fn parse_grads(input: &str) -> IResult<&str, f64> {\\n\\n let (input, grads) = double(input)?;\\n\\n let (input, _) = tag(\\\"grad\\\")(input)?;\\n\\n Ok((input, grads * 360. / 400.))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 44,\n \"score\": 79495.51853174574\n },\n {\n \"content\": \"fn parse_percentage(input: &str) -> IResult<&str, f64> {\\n\\n let (input, percent) = double(input)?;\\n\\n let (input, _) = char('%')(input)?;\\n\\n Ok((input, percent / 100.))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 45,\n \"score\": 79495.51853174574\n },\n {\n \"content\": \"fn parse_angle(input: &str) -> IResult<&str, f64> {\\n\\n alt((parse_turns, parse_grads, parse_rads, parse_degrees))(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 46,\n \"score\": 79495.51853174574\n },\n {\n \"content\": \"fn parse_turns(input: &str) -> IResult<&str, f64> {\\n\\n let (input, turns) = double(input)?;\\n\\n let (input, _) = tag(\\\"turn\\\")(input)?;\\n\\n Ok((input, turns * 360.))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 47,\n \"score\": 79495.51853174574\n },\n {\n \"content\": \"fn parse_numeric_rgb(input: &str) -> IResult<&str, Color> {\\n\\n let (input, prefixed) = opt(alt((tag(\\\"rgb(\\\"), tag(\\\"rgba(\\\"))))(input)?;\\n\\n let is_prefixed = prefixed.is_some();\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, r) = double(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, g) = double(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, b) = double(input)?;\\n\\n let (input, alpha) = parse_alpha(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, _) = cond(is_prefixed, char(')'))(input)?;\\n\\n\\n\\n let r = r / 255.;\\n\\n let g = g / 255.;\\n\\n let b = b / 255.;\\n\\n let c = Color::from_rgba_float(r, g, b, alpha);\\n\\n\\n\\n Ok((input, c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 48,\n \"score\": 77689.14677140843\n },\n {\n \"content\": \"fn parse_percentage_rgb(input: &str) -> IResult<&str, Color> {\\n\\n let (input, prefixed) = opt(alt((tag(\\\"rgb(\\\"), tag(\\\"rgba(\\\"))))(input)?;\\n\\n let is_prefixed = prefixed.is_some();\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, r) = parse_percentage(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, g) = parse_percentage(input)?;\\n\\n let (input, _) = parse_separator(input)?;\\n\\n let (input, b) = parse_percentage(input)?;\\n\\n let (input, alpha) = parse_alpha(input)?;\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, _) = cond(is_prefixed, char(')'))(input)?;\\n\\n\\n\\n let c = Color::from_rgba_float(r, g, b, alpha);\\n\\n\\n\\n Ok((input, c))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 49,\n \"score\": 77689.14677140843\n },\n {\n \"content\": \"fn write_stderr(c: Color, title: &str, message: &str) {\\n\\n writeln!(\\n\\n io::stderr(),\\n\\n \\\"{}: {}\\\",\\n\\n Brush::from_environment(Stream::Stdout).paint(format!(\\\"[{}]\\\", title), c),\\n\\n message\\n\\n )\\n\\n .ok();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/main.rs\",\n \"rank\": 50,\n \"score\": 75968.57067224912\n },\n {\n \"content\": \"fn parse_alpha<'a>(input: &'a str) -> IResult<&'a str, f64> {\\n\\n let (input, alpha) = opt(|input: &'a str| {\\n\\n let (input, _) = parse_separator(input)?;\\n\\n alt((parse_percentage, double))(input)\\n\\n })(input)?;\\n\\n Ok((input, alpha.unwrap_or(1.0)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 51,\n \"score\": 74938.65598089871\n },\n {\n \"content\": \"/// Linearly interpolate between two values.\\n\\npub fn interpolate(a: Scalar, b: Scalar, fraction: Fraction) -> Scalar {\\n\\n a + fraction.value() * (b - a)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helper.rs\",\n \"rank\": 52,\n \"score\": 74682.56555850516\n },\n {\n \"content\": \"/// Linearly interpolate between two angles. Always take the shortest path\\n\\n/// along the circle.\\n\\npub fn interpolate_angle(a: Scalar, b: Scalar, fraction: Fraction) -> Scalar {\\n\\n let paths = [(a, b), (a, b + 360.0), (a + 360.0, b)];\\n\\n\\n\\n let dist = |&(x, y): &(Scalar, Scalar)| (x - y).abs();\\n\\n let shortest = paths\\n\\n .iter()\\n\\n .min_by(|p1, p2| dist(p1).partial_cmp(&dist(p2)).unwrap_or(Ordering::Less))\\n\\n .unwrap();\\n\\n\\n\\n mod_positive(interpolate(shortest.0, shortest.1, fraction), 360.0)\\n\\n}\\n\\n\\n\\n// `format!`-style format strings only allow specifying a fixed floating\\n\\n// point precision, e.g. `{:.3}` to print 3 decimal places. This always\\n\\n// displays trailing zeroes, while web colors generally omit them. For\\n\\n// example, we'd prefer to print `0.5` as `0.5` instead of `0.500`.\\n\\n//\\n\\n// Note that this will round using omitted decimal places:\\n\\n//\\n\\n// MaxPrecision::wrap(3, 0.5004) //=> 0.500\\n\",\n \"file_path\": \"src/helper.rs\",\n \"rank\": 53,\n \"score\": 72791.21948714311\n },\n {\n \"content\": \"fn print_colors(\\n\\n out: &mut dyn Write,\\n\\n brush: Brush,\\n\\n colors: &[Color],\\n\\n closest_pair: Option<(usize, usize)>,\\n\\n) -> Result<()> {\\n\\n for (ci, c) in colors.iter().enumerate() {\\n\\n let tc = c.text_color();\\n\\n let mut style = tc.ansi_style();\\n\\n style.on(c);\\n\\n\\n\\n if let Some(pair) = closest_pair {\\n\\n if pair.0 == ci || pair.1 == ci {\\n\\n style.bold(true);\\n\\n style.underline(true);\\n\\n }\\n\\n }\\n\\n\\n\\n write!(out, \\\"{} \\\", brush.paint(c.to_rgb_hex_string(false), style))?;\\n\\n }\\n\\n writeln!(out)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/commands/distinct.rs\",\n \"rank\": 54,\n \"score\": 72765.5961505107\n },\n {\n \"content\": \"fn print_iteration(out: &mut dyn Write, brush: Brush, stats: &IterationStatistics) -> Result<()> {\\n\\n let result = stats.distance_result;\\n\\n write!(\\n\\n out,\\n\\n \\\"[{:10.}] D_mean = {:<6.2}; D_min = {:<6.2}; T = {:.6} \\\",\\n\\n stats.iteration,\\n\\n result.mean_closest_distance,\\n\\n result.min_closest_distance,\\n\\n stats.temperature\\n\\n )?;\\n\\n print_colors(out, brush, &stats.colors, Some(result.closest_pair))?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/commands/distinct.rs\",\n \"rank\": 55,\n \"score\": 65033.31353576126\n },\n {\n \"content\": \"fn named_color(name: &'static str, r: u8, g: u8, b: u8) -> NamedColor {\\n\\n NamedColor {\\n\\n name,\\n\\n color: Color::from_rgb(r, g, b),\\n\\n }\\n\\n}\\n\\n\\n\\npub static NAMED_COLORS: Lazy<[NamedColor; 148]> = Lazy::new(|| {\\n\\n [\\n\\n named_color(\\\"aliceblue\\\", 240, 248, 255),\\n\\n named_color(\\\"antiquewhite\\\", 250, 235, 215),\\n\\n named_color(\\\"aqua\\\", 0, 255, 255),\\n\\n named_color(\\\"aquamarine\\\", 127, 255, 212),\\n\\n named_color(\\\"azure\\\", 240, 255, 255),\\n\\n named_color(\\\"beige\\\", 245, 245, 220),\\n\\n named_color(\\\"bisque\\\", 255, 228, 196),\\n\\n named_color(\\\"black\\\", 0, 0, 0),\\n\\n named_color(\\\"blanchedalmond\\\", 255, 235, 205),\\n\\n named_color(\\\"blue\\\", 0, 0, 255),\\n\\n named_color(\\\"blueviolet\\\", 138, 43, 226),\\n\",\n \"file_path\": \"src/named.rs\",\n \"rank\": 56,\n \"score\": 63542.84268512387\n },\n {\n \"content\": \"type Scalar = f64;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct DistanceResult {\\n\\n /// The closest distance between any two colors\\n\\n pub min_closest_distance: Scalar,\\n\\n\\n\\n /// The average over all nearest-neighbor distances\\n\\n pub mean_closest_distance: Scalar,\\n\\n\\n\\n /// Indices of the colors that were closest to each other\\n\\n pub closest_pair: (usize, usize),\\n\\n\\n\\n /// The closest distance and the index of the nearest neighbor\\n\\n pub closest_distances: Vec<(Scalar, usize)>,\\n\\n\\n\\n pub distance_metric: DistanceMetric,\\n\\n\\n\\n /// The number of colors that are fixed and cannot be changed. The actual colors are the first\\n\\n /// `num_fixed_colors` elements in the `colors` array.\\n\",\n \"file_path\": \"src/distinct.rs\",\n \"rank\": 57,\n \"score\": 56527.60538613514\n },\n {\n \"content\": \"pub trait RandomizationStrategy {\\n\\n fn generate(&mut self) -> Color {\\n\\n self.generate_with(&mut thread_rng())\\n\\n }\\n\\n\\n\\n fn generate_with(&mut self, r: &mut dyn RngCore) -> Color;\\n\\n}\\n\\n\\n\\npub mod strategies {\\n\\n use super::RandomizationStrategy;\\n\\n use crate::Color;\\n\\n\\n\\n use rand::prelude::*;\\n\\n\\n\\n pub struct Vivid;\\n\\n\\n\\n impl RandomizationStrategy for Vivid {\\n\\n fn generate_with(&mut self, rng: &mut dyn RngCore) -> Color {\\n\\n let hue = rng.gen::<f64>() * 360.0;\\n\\n let saturation = 0.2 + 0.6 * rng.gen::<f64>();\\n\",\n \"file_path\": \"src/random.rs\",\n \"rank\": 58,\n \"score\": 54679.5923686156\n },\n {\n \"content\": \"pub trait ToAnsiStyle {\\n\\n fn ansi_style(&self) -> Style;\\n\\n}\\n\\n\\n\\nimpl ToAnsiStyle for Color {\\n\\n fn ansi_style(&self) -> Style {\\n\\n self.clone().into()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ansi.rs\",\n \"rank\": 59,\n \"score\": 54679.5923686156\n },\n {\n \"content\": \"pub trait GenericCommand {\\n\\n fn run(&self, out: &mut Output, matches: &ArgMatches, config: &Config) -> Result<()>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/commands/traits.rs\",\n \"rank\": 60,\n \"score\": 52131.05378191799\n },\n {\n \"content\": \"fn main() {\\n\\n let var = std::env::var_os(\\\"SHELL_COMPLETIONS_DIR\\\").or_else(|| std::env::var_os(\\\"OUT_DIR\\\"));\\n\\n let outdir = match var {\\n\\n None => return,\\n\\n Some(outdir) => outdir,\\n\\n };\\n\\n fs::create_dir_all(&outdir).unwrap();\\n\\n\\n\\n let mut cmd = build_cli();\\n\\n\\n\\n for shell in [Shell::Bash, Shell::Zsh, Shell::Fish, Shell::PowerShell] {\\n\\n generate_to(shell, &mut cmd, crate_name!(), &outdir).unwrap();\\n\\n }\\n\\n\\n\\n println!(\\\"cargo:rustc-cfg=pastel_normal_build\\\");\\n\\n}\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 61,\n \"score\": 49459.682883690984\n },\n {\n \"content\": \"#[test]\\n\\nfn test_interpolate() {\\n\\n assert_eq!(0.0, interpolate_angle(0.0, 90.0, Fraction::from(0.0)));\\n\\n assert_eq!(45.0, interpolate_angle(0.0, 90.0, Fraction::from(0.5)));\\n\\n assert_eq!(90.0, interpolate_angle(0.0, 90.0, Fraction::from(1.0)));\\n\\n assert_eq!(90.0, interpolate_angle(0.0, 90.0, Fraction::from(1.1)));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helper.rs\",\n \"rank\": 62,\n \"score\": 46195.19505703078\n },\n {\n \"content\": \"fn main() {\\n\\n let result = run();\\n\\n match result {\\n\\n Err(PastelError::StdoutClosed) => {}\\n\\n Err(err) => {\\n\\n write_stderr(Color::red(), \\\"pastel error\\\", &err.message());\\n\\n std::process::exit(1);\\n\\n }\\n\\n Ok(exit_code) => {\\n\\n std::process::exit(exit_code);\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cli/main.rs\",\n \"rank\": 63,\n \"score\": 46195.19505703078\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_lch_syntax() {\\n\\n assert_eq!(\\n\\n Some(Color::from_lch(12.43, -35.5, 43.4, 1.0)),\\n\\n parse_color(\\\"Lch(12.43,-35.5,43.4)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lch(15.0, -23.0, 43.0, 0.5)),\\n\\n parse_color(\\\"lch(15,-23,43,0.5)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lch(15.0, 23.0, -43.0, 1.0)),\\n\\n parse_color(\\\"CIELch(15,23,-43)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lch(15.0, 35.5, -43.4, 1.0)),\\n\\n parse_color(\\\"CIELch(15,35.5,-43.4)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lch(15.0, -35.5, -43.4, 0.4)),\\n\\n parse_color(\\\"cieLch(15,-35.5,-43.4,0.4)\\\")\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 64,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_alpha_syntax() {\\n\\n // hex\\n\\n assert_eq!(Some(rgba(255, 0, 0, 1.0)), parse_color(\\\"ff0000ff\\\"));\\n\\n assert_eq!(Some(rgba(255, 0, 0, 1.0)), parse_color(\\\"#ff0000ff\\\"));\\n\\n\\n\\n // rgb/rgba\\n\\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\\\"rgb(10,0,0,1)\\\"));\\n\\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\\\"rgb(10,0,0, 1)\\\"));\\n\\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\\\"rgba(10,0,0,1)\\\"));\\n\\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\\\"rgba(10,0,0, 1)\\\"));\\n\\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\\\"rgba(10,0,0,1.0)\\\"));\\n\\n assert_eq!(Some(rgba(10, 0, 0, 1.0)), parse_color(\\\"rgba(10,0,0, 1.0)\\\"));\\n\\n\\n\\n // hsl/hsla\\n\\n assert_eq!(\\n\\n Some(Color::from_hsla(10.0, 0.5, 0.5, 1.0)),\\n\\n parse_color(\\\"hsl(10,50%,50%,1)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_hsla(10.0, 0.5, 0.5, 1.0)),\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 65,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn test_max_precision() {\\n\\n assert_eq!(format!(\\\"{}\\\", MaxPrecision::wrap(3, 0.5)), \\\"0.5\\\");\\n\\n assert_eq!(format!(\\\"{}\\\", MaxPrecision::wrap(3, 0.51)), \\\"0.51\\\");\\n\\n assert_eq!(format!(\\\"{}\\\", MaxPrecision::wrap(3, 0.512)), \\\"0.512\\\");\\n\\n assert_eq!(format!(\\\"{}\\\", MaxPrecision::wrap(3, 0.5124)), \\\"0.512\\\");\\n\\n assert_eq!(format!(\\\"{}\\\", MaxPrecision::wrap(3, 0.5125)), \\\"0.513\\\");\\n\\n}\\n\",\n \"file_path\": \"src/helper.rs\",\n \"rank\": 66,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_hsl_syntax() {\\n\\n assert_eq!(\\n\\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\\n\\n parse_color(\\\"hsl(280,20%,50%)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\\n\\n parse_color(\\\"hsl(280deg,20%,50%)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\\n\\n parse_color(\\\"hsl(280°,20%,50%)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_hsl(280.33, 0.123, 0.456)),\\n\\n parse_color(\\\"hsl(280.33001,12.3%,45.6%)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_hsl(280.0, 0.2, 0.5)),\\n\\n parse_color(\\\"hsl( 280 , 20% , 50%)\\\")\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 67,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn sort_by_basic() {\\n\\n pastel()\\n\\n .arg(\\\"sort-by\\\")\\n\\n .arg(\\\"luminance\\\")\\n\\n .arg(\\\"gray\\\")\\n\\n .arg(\\\"white\\\")\\n\\n .arg(\\\"black\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"hsl(0,0.0%,0.0%)\\\\nhsl(0,0.0%,50.2%)\\\\nhsl(0,0.0%,100.0%)\\\\n\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 68,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn format_basic() {\\n\\n pastel()\\n\\n .arg(\\\"format\\\")\\n\\n .arg(\\\"hex\\\")\\n\\n .arg(\\\"red\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"#ff0000\\\\n\\\");\\n\\n\\n\\n pastel()\\n\\n .arg(\\\"format\\\")\\n\\n .arg(\\\"rgb\\\")\\n\\n .arg(\\\"red\\\")\\n\\n .arg(\\\"blue\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"rgb(255, 0, 0)\\\\nrgb(0, 0, 255)\\\\n\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 69,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_gray_syntax() {\\n\\n assert_eq!(Some(Color::graytone(0.2)), parse_color(\\\"gray(0.2)\\\"));\\n\\n assert_eq!(Some(Color::black()), parse_color(\\\"gray(0.0)\\\"));\\n\\n assert_eq!(Some(Color::black()), parse_color(\\\"gray(0)\\\"));\\n\\n assert_eq!(Some(Color::white()), parse_color(\\\"gray(1.0)\\\"));\\n\\n assert_eq!(Some(Color::white()), parse_color(\\\"gray(1)\\\"));\\n\\n assert_eq!(Some(Color::white()), parse_color(\\\"gray(7.3)\\\"));\\n\\n\\n\\n assert_eq!(Some(Color::graytone(0.32)), parse_color(\\\"gray(.32)\\\"));\\n\\n\\n\\n assert_eq!(\\n\\n Some(Color::graytone(0.41)),\\n\\n parse_color(\\\" gray( 0.41 ) \\\")\\n\\n );\\n\\n\\n\\n assert_eq!(Some(Color::graytone(0.2)), parse_color(\\\"gray(20%)\\\"));\\n\\n assert_eq!(Some(Color::black()), parse_color(\\\"gray(0%)\\\"));\\n\\n assert_eq!(Some(Color::black()), parse_color(\\\"gray(0.0%)\\\"));\\n\\n assert_eq!(Some(Color::white()), parse_color(\\\"gray(100%)\\\"));\\n\\n assert_eq!(Some(Color::graytone(0.5)), parse_color(\\\"gray(50%)\\\"));\\n\\n\\n\\n assert_eq!(None, parse_color(\\\"gray(-1)\\\"));\\n\\n assert_eq!(None, parse_color(\\\"gray(-1%)\\\"));\\n\\n assert_eq!(None, parse_color(\\\"gray(-4.%)\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 70,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn test_interpolate_angle() {\\n\\n assert_eq!(15.0, interpolate_angle(0.0, 30.0, Fraction::from(0.5)));\\n\\n assert_eq!(20.0, interpolate_angle(0.0, 100.0, Fraction::from(0.2)));\\n\\n assert_eq!(0.0, interpolate_angle(10.0, 350.0, Fraction::from(0.5)));\\n\\n assert_eq!(0.0, interpolate_angle(350.0, 10.0, Fraction::from(0.5)));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/helper.rs\",\n \"rank\": 71,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn verify_cmd() {\\n\\n build_cli().debug_assert();\\n\\n}\\n\",\n \"file_path\": \"src/cli/cli.rs\",\n \"rank\": 72,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_lab_syntax() {\\n\\n assert_eq!(\\n\\n Some(Color::from_lab(12.43, -35.5, 43.4, 1.0)),\\n\\n parse_color(\\\"Lab(12.43,-35.5,43.4)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lab(15.0, -23.0, 43.0, 0.5)),\\n\\n parse_color(\\\"lab(15,-23,43,0.5)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lab(15.0, 23.0, -43.0, 1.0)),\\n\\n parse_color(\\\"CIELab(15,23,-43)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lab(15.0, 35.5, -43.4, 1.0)),\\n\\n parse_color(\\\"CIELab(15,35.5,-43.4)\\\")\\n\\n );\\n\\n assert_eq!(\\n\\n Some(Color::from_lab(15.0, -35.5, -43.4, 0.4)),\\n\\n parse_color(\\\"cieLab(15,-35.5,-43.4,0.4)\\\")\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 73,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn set_basic() {\\n\\n pastel()\\n\\n .arg(\\\"set\\\")\\n\\n .arg(\\\"hsl-hue\\\")\\n\\n .arg(\\\"120\\\")\\n\\n .arg(\\\"red\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"hsl(120,100.0%,50.0%)\\\\n\\\");\\n\\n\\n\\n pastel()\\n\\n .arg(\\\"set\\\")\\n\\n .arg(\\\"hsl-saturation\\\")\\n\\n .arg(\\\"0.1\\\")\\n\\n .arg(\\\"red\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"hsl(0,10.0%,50.0%)\\\\n\\\");\\n\\n\\n\\n pastel()\\n\\n .arg(\\\"set\\\")\\n\\n .arg(\\\"hsl-lightness\\\")\\n\\n .arg(\\\"0.5\\\")\\n\\n .arg(\\\"white\\\")\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"hsl(0,0.0%,50.0%)\\\\n\\\");\\n\\n}\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 74,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_named_syntax() {\\n\\n assert_eq!(Some(Color::black()), parse_color(\\\"black\\\"));\\n\\n assert_eq!(Some(Color::blue()), parse_color(\\\"blue\\\"));\\n\\n assert_eq!(Some(Color::blue()), parse_color(\\\"Blue\\\"));\\n\\n assert_eq!(Some(Color::blue()), parse_color(\\\"BLUE\\\"));\\n\\n assert_eq!(Some(rgb(255, 20, 147)), parse_color(\\\"deeppink\\\"));\\n\\n assert_eq!(None, parse_color(\\\"whatever\\\"));\\n\\n assert_eq!(None, parse_color(\\\"red blue\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 75,\n \"score\": 44783.992218743304\n },\n {\n \"content\": \"#[test]\\n\\nfn pipe_into_format_command() {\\n\\n let first = pastel()\\n\\n .arg(\\\"color\\\")\\n\\n .arg(\\\"red\\\")\\n\\n .arg(\\\"teal\\\")\\n\\n .arg(\\\"hotpink\\\")\\n\\n .assert()\\n\\n .success();\\n\\n\\n\\n pastel()\\n\\n .arg(\\\"format\\\")\\n\\n .arg(\\\"name\\\")\\n\\n .write_stdin(String::from_utf8(first.get_output().stdout.clone()).unwrap())\\n\\n .assert()\\n\\n .success()\\n\\n .stdout(\\\"red\\\\nteal\\\\nhotpink\\\\n\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 76,\n \"score\": 43494.6915452264\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_rgb_hex_syntax() {\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"f09\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"#f09\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"#F09\\\"));\\n\\n\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"#ff0099\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"#FF0099\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"ff0099\\\"));\\n\\n\\n\\n assert_eq!(Some(rgb(87, 166, 206)), parse_color(\\\"57A6CE\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 119)), parse_color(\\\" #ff0077 \\\"));\\n\\n\\n\\n assert_eq!(None, parse_color(\\\"#1\\\"));\\n\\n assert_eq!(None, parse_color(\\\"#12\\\"));\\n\\n assert_eq!(None, parse_color(\\\"#12345\\\"));\\n\\n assert_eq!(None, parse_color(\\\"#1234567\\\"));\\n\\n assert_eq!(None, parse_color(\\\"#hh0033\\\"));\\n\\n assert_eq!(None, parse_color(\\\"#h03\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 77,\n \"score\": 43494.6915452264\n },\n {\n \"content\": \"fn print_pastel_warning() {\\n\\n write_stderr(\\n\\n Color::yellow(),\\n\\n \\\"pastel warning\\\",\\n\\n \\\"Your terminal emulator does not appear to support 24-bit colors \\\\\\n\\n (this means that the COLORTERM environment variable is not set to \\\\\\n\\n 'truecolor' or '24bit'). \\\\\\n\\n pastel will fall back to 8-bit colors, but you will only be able \\\\\\n\\n to see rough approximations of the real colors.\\\\n\\\\n\\\\\\n\\n To fix this, follow these steps:\\\\n \\\\\\n\\n 1. Run 'pastel colorcheck' to test if your terminal\\\\n \\\\\\n\\n emulator does support 24-bit colors. If this is the\\\\n \\\\\\n\\n case, set 'PASTEL_COLOR_MODE=24bit' to force 24-bit\\\\n \\\\\\n\\n mode and to remove this warning. Alternatively, make\\\\n \\\\\\n\\n sure that COLORTERM is properly set by your terminal\\\\n \\\\\\n\\n emulator.\\\\n \\\\\\n\\n 2. If your terminal emulator does not support 24-bit\\\\n \\\\\\n\\n colors, set 'PASTEL_COLOR_MODE=8bit' to remove this\\\\n \\\\\\n\\n warning or try a different terminal emulator.\\\\n\\\\n\\\\\\n\\n \\\\\\n\\n For more information, see https://gist.github.com/XVilka/8346728\\\\n\\\",\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cli/main.rs\",\n \"rank\": 78,\n \"score\": 43494.6915452264\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_rgb_standalone_syntax() {\\n\\n assert_eq!(\\n\\n Some(rgb(255, 8, 119)),\\n\\n parse_color(\\\" rgb( 255 , 8 , 119 ) \\\")\\n\\n );\\n\\n\\n\\n assert_eq!(rgb(255, 0, 153), parse_color(\\\"255,0,153\\\").unwrap());\\n\\n assert_eq!(rgb(255, 0, 153), parse_color(\\\"255, 0, 153\\\").unwrap());\\n\\n assert_eq!(\\n\\n rgb(255, 0, 153),\\n\\n parse_color(\\\" 255 , 0 , 153 \\\").unwrap()\\n\\n );\\n\\n assert_eq!(rgb(255, 0, 153), parse_color(\\\"255 0 153\\\").unwrap());\\n\\n assert_eq!(rgb(255, 0, 153), parse_color(\\\"255 0 153.0\\\").unwrap());\\n\\n\\n\\n assert_eq!(Some(rgb(1, 2, 3)), parse_color(\\\"1,2,3\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 79,\n \"score\": 43494.6915452264\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_rgb_functional_syntax() {\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"rgb(255,0,153)\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"rgb(255, 0, 153)\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"rgb( 255 , 0 , 153 )\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"rgb(255, 0, 153.0)\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"rgb(255 0 153)\\\"));\\n\\n\\n\\n assert_eq!(\\n\\n Some(rgb(255, 8, 119)),\\n\\n parse_color(\\\" rgb( 255 , 8 , 119 ) \\\")\\n\\n );\\n\\n\\n\\n assert_eq!(Some(rgb(255, 0, 127)), parse_color(\\\"rgb(100%,0%,49.8%)\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 153)), parse_color(\\\"rgb(100%,0%,60%)\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 119)), parse_color(\\\"rgb(100%,0%,46.7%)\\\"));\\n\\n assert_eq!(Some(rgb(3, 54, 119)), parse_color(\\\"rgb(1%,21.2%,46.7%)\\\"));\\n\\n assert_eq!(Some(rgb(255, 0, 119)), parse_color(\\\"rgb(255 0 119)\\\"));\\n\\n assert_eq!(\\n\\n Some(rgb(255, 0, 119)),\\n\\n parse_color(\\\"rgb( 255 0 119)\\\")\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 80,\n \"score\": 43494.6915452264\n },\n {\n \"content\": \"fn pastel() -> Command {\\n\\n let mut cmd = Command::cargo_bin(\\\"pastel\\\").unwrap();\\n\\n cmd.env_remove(\\\"PASTEL_COLOR_MODE\\\");\\n\\n cmd\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/integration_tests.rs\",\n \"rank\": 81,\n \"score\": 43484.594388290396\n },\n {\n \"content\": \"fn print_distance_matrix(\\n\\n out: &mut dyn Write,\\n\\n brush: Brush,\\n\\n colors: &[Color],\\n\\n metric: DistanceMetric,\\n\\n) -> Result<()> {\\n\\n let count = colors.len();\\n\\n\\n\\n let distance = |c1: &Color, c2: &Color| match metric {\\n\\n DistanceMetric::CIE76 => c1.distance_delta_e_cie76(c2),\\n\\n DistanceMetric::CIEDE2000 => c1.distance_delta_e_ciede2000(c2),\\n\\n };\\n\\n\\n\\n let mut min = std::f64::MAX;\\n\\n let mut max = 0.0;\\n\\n for i in 0..count {\\n\\n for j in 0..count {\\n\\n if i != j {\\n\\n let dist = distance(&colors[i], &colors[j]);\\n\\n if dist < min {\\n\",\n \"file_path\": \"src/cli/commands/distinct.rs\",\n \"rank\": 82,\n \"score\": 42312.15181629201\n },\n {\n \"content\": \"fn cube_to_8bit(code: u8) -> u8 {\\n\\n assert!(code < 6);\\n\\n match code {\\n\\n 0 => 0,\\n\\n _ => 55 + 40 * code,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ansi.rs\",\n \"rank\": 83,\n \"score\": 38991.808183652334\n },\n {\n \"content\": \"fn hex_to_u8_unsafe(num: &str) -> u8 {\\n\\n u8::from_str_radix(num, 16).unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 84,\n \"score\": 37903.29603443151\n },\n {\n \"content\": \"fn parse_separator(input: &str) -> IResult<&str, &str> {\\n\\n alt((comma_separated, space1))(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 85,\n \"score\": 35398.88139378665\n },\n {\n \"content\": \"fn comma_separated(input: &str) -> IResult<&str, &str> {\\n\\n let (input, _) = space0(input)?;\\n\\n let (input, _) = char(',')(input)?;\\n\\n space0(input)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 86,\n \"score\": 35398.88139378665\n },\n {\n \"content\": \"use pastel::ansi::Brush;\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Config<'p> {\\n\\n pub padding: usize,\\n\\n pub colorpicker_width: usize,\\n\\n pub colorcheck_width: usize,\\n\\n pub colorpicker: Option<&'p str>,\\n\\n pub interactive_mode: bool,\\n\\n pub brush: Brush,\\n\\n}\\n\",\n \"file_path\": \"src/cli/config.rs\",\n \"rank\": 87,\n \"score\": 34199.235178276984\n },\n {\n \"content\": \"use std::io::Write;\\n\\n\\n\\nuse crate::config::Config;\\n\\nuse crate::error::Result;\\n\\nuse crate::hdcanvas::Canvas;\\n\\nuse crate::utility::similar_colors;\\n\\n\\n\\nuse pastel::Color;\\n\\nuse pastel::Format;\\n\\n\\n\\n// #[derive(Debug)]\\n\\npub struct Output<'a> {\\n\\n pub handle: &'a mut dyn Write,\\n\\n colors_shown: usize,\\n\\n}\\n\\n\\n\\nimpl Output<'_> {\\n\\n pub fn new(handle: &mut dyn Write) -> Output {\\n\\n Output {\\n\\n handle,\\n\",\n \"file_path\": \"src/cli/output.rs\",\n \"rank\": 88,\n \"score\": 34148.05195594544\n },\n {\n \"content\": \"\\n\\n canvas.print(self.handle)\\n\\n }\\n\\n\\n\\n pub fn show_color(&mut self, config: &Config, color: &Color) -> Result<()> {\\n\\n if config.interactive_mode {\\n\\n if self.colors_shown < 1 {\\n\\n writeln!(self.handle)?\\n\\n };\\n\\n self.show_color_tty(config, color)?;\\n\\n writeln!(self.handle)?;\\n\\n } else {\\n\\n writeln!(self.handle, \\\"{}\\\", color.to_hsl_string(Format::NoSpaces))?;\\n\\n }\\n\\n self.colors_shown += 1;\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cli/output.rs\",\n \"rank\": 89,\n \"score\": 34137.83053958249\n },\n {\n \"content\": \" colors_shown: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn show_color_tty(&mut self, config: &Config, color: &Color) -> Result<()> {\\n\\n let checkerboard_size: usize = 16;\\n\\n let color_panel_size: usize = 12;\\n\\n\\n\\n let checkerboard_position_y: usize = 0;\\n\\n let checkerboard_position_x: usize = config.padding;\\n\\n let color_panel_position_y: usize =\\n\\n checkerboard_position_y + (checkerboard_size - color_panel_size) / 2;\\n\\n let color_panel_position_x: usize =\\n\\n config.padding + (checkerboard_size - color_panel_size) / 2;\\n\\n let text_position_x: usize = checkerboard_size + 2 * config.padding;\\n\\n let text_position_y: usize = 0;\\n\\n\\n\\n let mut canvas = Canvas::new(checkerboard_size, 60, config.brush);\\n\\n canvas.draw_checkerboard(\\n\\n checkerboard_position_y,\\n\",\n \"file_path\": \"src/cli/output.rs\",\n \"rank\": 90,\n \"score\": 34136.86024440189\n },\n {\n \"content\": \" checkerboard_position_x,\\n\\n checkerboard_size,\\n\\n checkerboard_size,\\n\\n &Color::graytone(0.94),\\n\\n &Color::graytone(0.71),\\n\\n );\\n\\n canvas.draw_rect(\\n\\n color_panel_position_y,\\n\\n color_panel_position_x,\\n\\n color_panel_size,\\n\\n color_panel_size,\\n\\n color,\\n\\n );\\n\\n\\n\\n let mut text_y_offset = 0;\\n\\n let similar = similar_colors(color);\\n\\n\\n\\n for (i, nc) in similar.iter().enumerate().take(3) {\\n\\n if nc.color == *color {\\n\\n canvas.draw_text(\\n\",\n \"file_path\": \"src/cli/output.rs\",\n \"rank\": 91,\n \"score\": 34131.02380549978\n },\n {\n \"content\": \" text_position_y + 0 + text_y_offset,\\n\\n text_position_x,\\n\\n &format!(\\\"Hex: {}\\\", color.to_rgb_hex_string(true)),\\n\\n );\\n\\n canvas.draw_text(\\n\\n text_position_y + 2 + text_y_offset,\\n\\n text_position_x,\\n\\n &format!(\\\"RGB: {}\\\", color.to_rgb_string(Format::Spaces)),\\n\\n );\\n\\n canvas.draw_text(\\n\\n text_position_y + 4 + text_y_offset,\\n\\n text_position_x,\\n\\n &format!(\\\"HSL: {}\\\", color.to_hsl_string(Format::Spaces)),\\n\\n );\\n\\n\\n\\n canvas.draw_text(\\n\\n text_position_y + 8 + text_y_offset,\\n\\n text_position_x,\\n\\n \\\"Most similar:\\\",\\n\\n );\\n\",\n \"file_path\": \"src/cli/output.rs\",\n \"rank\": 92,\n \"score\": 34127.73724544361\n },\n {\n \"content\": \" text_position_y,\\n\\n text_position_x,\\n\\n &format!(\\\"Name: {}\\\", nc.name),\\n\\n );\\n\\n text_y_offset = 2;\\n\\n continue;\\n\\n }\\n\\n\\n\\n canvas.draw_text(text_position_y + 10 + 2 * i, text_position_x + 7, nc.name);\\n\\n canvas.draw_rect(\\n\\n text_position_y + 10 + 2 * i,\\n\\n text_position_x + 1,\\n\\n 2,\\n\\n 5,\\n\\n &nc.color,\\n\\n );\\n\\n }\\n\\n\\n\\n #[allow(clippy::identity_op)]\\n\\n canvas.draw_text(\\n\",\n \"file_path\": \"src/cli/output.rs\",\n \"rank\": 93,\n \"score\": 34126.95125874111\n },\n {\n \"content\": \"fn opt_hash_char(s: &str) -> IResult<&str, Option<char>> {\\n\\n opt(char('#'))(s)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 94,\n \"score\": 33854.43506680201\n },\n {\n \"content\": \"use criterion::{criterion_group, criterion_main, Criterion};\\n\\nuse pastel::parser::parse_color;\\n\\n\\n\",\n \"file_path\": \"benches/parse_color.rs\",\n \"rank\": 95,\n \"score\": 33635.02762928185\n },\n {\n \"content\": \"use crate::commands::prelude::*;\\n\\n\\n\\npub struct ShowCommand;\\n\\n\\n\\nimpl ColorCommand for ShowCommand {\\n\\n fn run(&self, out: &mut Output, _: &ArgMatches, config: &Config, color: &Color) -> Result<()> {\\n\\n out.show_color(config, color)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cli/commands/show.rs\",\n \"rank\": 99,\n \"score\": 27.267342931457037\n }\n]","isConversational":false}}},{"rowIdx":2992,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"mshv-ioctls/src/ioctls/system.rs"},"repo_name":{"kind":"string","value":"russell-islam/mshv"},"commit":{"kind":"string","value":"99da566389546aedb56fc3d279e01c5dbde79bce"},"file_code":{"kind":"string","value":"\n\nuse crate::ioctls::vm::{new_vmfd, VmFd};\nuse crate::ioctls::Result;\nuse crate::mshv_ioctls::*;\nuse libc::{open, O_CLOEXEC, O_NONBLOCK};\nuse mshv_bindings::*;\nuse std::fs::File;\nuse std::os::raw::c_char;\nuse std::os::unix::io::{FromRawFd, RawFd};\nuse vmm_sys_util::errno;\nuse vmm_sys_util::ioctl::ioctl_with_ref;\n\npub struct Mshv {\n hv: File,\n}\n\nimpl Mshv {\n \n #[allow(clippy::new_ret_no_self)]\n pub fn new() -> Result<Self> {\n \n let fd = Self::open_with_cloexec(true)?;\n \n let ret = unsafe { Self::new_with_fd_number(fd) };\n Ok(ret)\n }\n \n \n \n \n \n \n \n \n \n \n \n pub unsafe fn new_with_fd_number(fd: RawFd) -> Self {\n Mshv {\n hv: File::from_raw_fd(fd),\n }\n }\n\n \n pub fn open_with_cloexec(close_on_exec: bool) -> Result<RawFd> {\n let open_flags = O_NONBLOCK | if close_on_exec { O_CLOEXEC } else { 0 };\n \n let ret = unsafe { open(\"/dev/mshv\\0\".as_ptr() as *const c_char, open_flags) };\n if ret < 0 {\n Err(errno::Error::last())\n } else {\n Ok(ret)\n }\n }\n \n pub fn create_vm(&self) -> Result<VmFd> {\n \n \n let creation_flags: u64 = HV_PARTITION_CREATION_FLAG_LAPIC_ENABLED as u64;\n let mut pr = mshv_create_partition {\n partition_creation_properties: hv_partition_creation_properties {\n disabled_processor_features: hv_partition_processor_features { as_uint64: [0; 2] },\n disabled_processor_xsave_features: hv_partition_processor_xsave_features {\n as_uint64: 0_u64,\n },\n },\n synthetic_processor_features: hv_partition_synthetic_processor_features {\n as_uint64: [0; 1],\n },\n flags: creation_flags,\n };\n /* TODO pass in arg for this */\n unsafe {\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_hypervisor_present(1);\n pr.synthetic_processor_features.__bindgen_anon_1.set_hv1(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_partition_reference_counter(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_synic_regs(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_synthetic_timer_regs(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_partition_reference_tsc(1);\n /* Need this for linux on CH, as there's no PIT or HPET */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_frequency_regs(1);\n /* Linux I'm using appears to require vp assist page... */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_intr_ctrl_regs(1);\n /* According to Hv#1 spec, these must be set also, but they aren't in KVM? */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_vp_index(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_hypercall_regs(1);\n /* Windows requires this */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_guest_idle_reg(1);\n }\n\n let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CREATE_PARTITION(), &pr) };\n if ret >= 0 {\n \n let vm_file = unsafe { File::from_raw_fd(ret) };\n Ok(new_vmfd(vm_file))\n } else {\n Err(errno::Error::last())\n }\n }\n \n pub fn check_stable(&self) -> Result<bool> {\n \n \n let cap: u32 = MSHV_CAP_CORE_API_STABLE;\n let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CHECK_EXTENSION(), &cap) };\n match ret {\n 0 => Ok(false),\n r if r > 0 => Ok(true),\n _ => Err(errno::Error::last()),\n }\n }\n \n pub fn get_msr_index_list(&self) -> Result<MsrList> {\n /* return all the MSRs we currently support */\n Ok(MsrList::from_entries(&[\n IA32_MSR_TSC,\n IA32_MSR_EFER,\n IA32_MSR_KERNEL_GS_BASE,\n IA32_MSR_APIC_BASE,\n IA32_MSR_PAT,\n IA32_MSR_SYSENTER_CS,\n IA32_MSR_SYSENTER_ESP,\n IA32_MSR_SYSENTER_EIP,\n IA32_MSR_STAR,\n IA32_MSR_LSTAR,\n IA32_MSR_CSTAR,\n IA32_MSR_SFMASK,\n IA32_MSR_MTRR_DEF_TYPE,\n IA32_MSR_MTRR_PHYSBASE0,\n IA32_MSR_MTRR_PHYSMASK0,\n IA32_MSR_MTRR_PHYSBASE1,\n IA32_MSR_MTRR_PHYSMASK1,\n IA32_MSR_MTRR_PHYSBASE2,\n IA32_MSR_MTRR_PHYSMASK2,\n IA32_MSR_MTRR_PHYSBASE3,\n IA32_MSR_MTRR_PHYSMASK3,\n IA32_MSR_MTRR_PHYSBASE4,\n IA32_MSR_MTRR_PHYSMASK4,\n IA32_MSR_MTRR_PHYSBASE5,\n IA32_MSR_MTRR_PHYSMASK5,\n IA32_MSR_MTRR_PHYSBASE6,\n IA32_MSR_MTRR_PHYSMASK6,\n IA32_MSR_MTRR_PHYSBASE7,\n IA32_MSR_MTRR_PHYSMASK7,\n IA32_MSR_MTRR_FIX64K_00000,\n IA32_MSR_MTRR_FIX16K_80000,\n IA32_MSR_MTRR_FIX16K_a0000,\n IA32_MSR_MTRR_FIX4K_c0000,\n IA32_MSR_MTRR_FIX4K_c8000,\n IA32_MSR_MTRR_FIX4K_d0000,\n IA32_MSR_MTRR_FIX4K_d8000,\n IA32_MSR_MTRR_FIX4K_e0000,\n IA32_MSR_MTRR_FIX4K_e8000,\n IA32_MSR_MTRR_FIX4K_f0000,\n IA32_MSR_MTRR_FIX4K_f8000,\n IA32_MSR_TSC_AUX,\n IA32_MSR_BNDCFGS,\n IA32_MSR_DEBUG_CTL,\n IA32_MSR_SPEC_CTRL,\n \n ])\n .unwrap())\n }\n}\n#[allow(dead_code)]\n#[cfg(test)]\nmod tests {\n \n use super::*;\n\n #[test]\n #[ignore]\n fn test_create_vm() {\n let hv = Mshv::new().unwrap();\n let vm = hv.create_vm();\n assert!(vm.is_ok());\n }\n #[test]\n #[ignore]\n fn test_get_msr_index_list() {\n let hv = Mshv::new().unwrap();\n let msr_list = hv.get_msr_index_list().unwrap();\n assert!(msr_list.as_fam_struct_ref().nmsrs == 44);\n\n let mut found = false;\n for index in msr_list.as_slice() {\n if *index == IA32_MSR_SYSENTER_CS {\n found = true;\n break;\n }\n }\n assert!(found);\n\n /* Test all MSRs in the list individually and determine which can be get/set */\n let vm = hv.create_vm().unwrap();\n let vcpu = vm.create_vcpu(0).unwrap();\n let mut num_errors = 0;\n for idx in hv.get_msr_index_list().unwrap().as_slice().iter() {\n let mut get_set_msrs = Msrs::from_entries(&[msr_entry {\n index: *idx,\n ..Default::default()\n }])\n .unwrap();\n vcpu.get_msrs(&mut get_set_msrs).unwrap_or_else(|_| {\n println!(\"Error getting MSR: 0x{:x}\", *idx);\n num_errors += 1;\n 0\n });\n vcpu.set_msrs(&get_set_msrs).unwrap_or_else(|_| {\n println!(\"Error setting MSR: 0x{:x}\", *idx);\n num_errors += 1;\n 0\n });\n }\n assert!(num_errors == 0);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::ioctls::vm::{new_vmfd, VmFd};\nuse crate::ioctls::Result;\nuse crate::mshv_ioctls::*;\nuse libc::{open, O_CLOEXEC, O_NONBLOCK};\nuse mshv_bindings::*;\nuse std::fs::File;\nuse std::os::raw::c_char;\nuse std::os::unix::io::{FromRawFd, RawFd};\nuse vmm_sys_util::errno;\nuse vmm_sys_util::ioctl::ioctl_with_ref;\n\npub struct Mshv {\n hv: File,\n}\n\nimpl Mshv {\n \n #[allow(clippy::new_ret_no_self)]\n pub fn new() -> Result<Self> {\n \n let fd = Self::open_with_cloexec(true)?;\n \n let ret = unsafe { Self::new_with_fd_number(fd) };\n Ok(ret)\n }\n \n \n \n \n \n \n \n \n \n \n \n pub unsafe fn new_with_fd_number(fd: RawFd) -> Self {\n Mshv {\n hv: File::from_raw_fd(fd),\n }\n }\n\n \n pub fn open_with_cloexec(close_on_exec: bool) -> Result<RawFd> {\n let open_flags = O_NONBLOCK | if close_on_exec { O_CLOEXEC } else { 0 };\n \n let ret = unsafe { open(\"/dev/mshv\\0\".as_ptr() as *const c_char, open_flags) };\n if ret < 0 {\n Err(errno::Error::last())\n } else {\n Ok(ret)\n }\n }\n \n "},"suffix":{"kind":"string","value":"\n \n pub fn check_stable(&self) -> Result<bool> {\n \n \n let cap: u32 = MSHV_CAP_CORE_API_STABLE;\n let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CHECK_EXTENSION(), &cap) };\n match ret {\n 0 => Ok(false),\n r if r > 0 => Ok(true),\n _ => Err(errno::Error::last()),\n }\n }\n \n pub fn get_msr_index_list(&self) -> Result<MsrList> {\n /* return all the MSRs we currently support */\n Ok(MsrList::from_entries(&[\n IA32_MSR_TSC,\n IA32_MSR_EFER,\n IA32_MSR_KERNEL_GS_BASE,\n IA32_MSR_APIC_BASE,\n IA32_MSR_PAT,\n IA32_MSR_SYSENTER_CS,\n IA32_MSR_SYSENTER_ESP,\n IA32_MSR_SYSENTER_EIP,\n IA32_MSR_STAR,\n IA32_MSR_LSTAR,\n IA32_MSR_CSTAR,\n IA32_MSR_SFMASK,\n IA32_MSR_MTRR_DEF_TYPE,\n IA32_MSR_MTRR_PHYSBASE0,\n IA32_MSR_MTRR_PHYSMASK0,\n IA32_MSR_MTRR_PHYSBASE1,\n IA32_MSR_MTRR_PHYSMASK1,\n IA32_MSR_MTRR_PHYSBASE2,\n IA32_MSR_MTRR_PHYSMASK2,\n IA32_MSR_MTRR_PHYSBASE3,\n IA32_MSR_MTRR_PHYSMASK3,\n IA32_MSR_MTRR_PHYSBASE4,\n IA32_MSR_MTRR_PHYSMASK4,\n IA32_MSR_MTRR_PHYSBASE5,\n IA32_MSR_MTRR_PHYSMASK5,\n IA32_MSR_MTRR_PHYSBASE6,\n IA32_MSR_MTRR_PHYSMASK6,\n IA32_MSR_MTRR_PHYSBASE7,\n IA32_MSR_MTRR_PHYSMASK7,\n IA32_MSR_MTRR_FIX64K_00000,\n IA32_MSR_MTRR_FIX16K_80000,\n IA32_MSR_MTRR_FIX16K_a0000,\n IA32_MSR_MTRR_FIX4K_c0000,\n IA32_MSR_MTRR_FIX4K_c8000,\n IA32_MSR_MTRR_FIX4K_d0000,\n IA32_MSR_MTRR_FIX4K_d8000,\n IA32_MSR_MTRR_FIX4K_e0000,\n IA32_MSR_MTRR_FIX4K_e8000,\n IA32_MSR_MTRR_FIX4K_f0000,\n IA32_MSR_MTRR_FIX4K_f8000,\n IA32_MSR_TSC_AUX,\n IA32_MSR_BNDCFGS,\n IA32_MSR_DEBUG_CTL,\n IA32_MSR_SPEC_CTRL,\n \n ])\n .unwrap())\n }\n}\n#[allow(dead_code)]\n#[cfg(test)]\nmod tests {\n \n use super::*;\n\n #[test]\n #[ignore]\n fn test_create_vm() {\n let hv = Mshv::new().unwrap();\n let vm = hv.create_vm();\n assert!(vm.is_ok());\n }\n #[test]\n #[ignore]\n fn test_get_msr_index_list() {\n let hv = Mshv::new().unwrap();\n let msr_list = hv.get_msr_index_list().unwrap();\n assert!(msr_list.as_fam_struct_ref().nmsrs == 44);\n\n let mut found = false;\n for index in msr_list.as_slice() {\n if *index == IA32_MSR_SYSENTER_CS {\n found = true;\n break;\n }\n }\n assert!(found);\n\n /* Test all MSRs in the list individually and determine which can be get/set */\n let vm = hv.create_vm().unwrap();\n let vcpu = vm.create_vcpu(0).unwrap();\n let mut num_errors = 0;\n for idx in hv.get_msr_index_list().unwrap().as_slice().iter() {\n let mut get_set_msrs = Msrs::from_entries(&[msr_entry {\n index: *idx,\n ..Default::default()\n }])\n .unwrap();\n vcpu.get_msrs(&mut get_set_msrs).unwrap_or_else(|_| {\n println!(\"Error getting MSR: 0x{:x}\", *idx);\n num_errors += 1;\n 0\n });\n vcpu.set_msrs(&get_set_msrs).unwrap_or_else(|_| {\n println!(\"Error setting MSR: 0x{:x}\", *idx);\n num_errors += 1;\n 0\n });\n }\n assert!(num_errors == 0);\n }\n}\n"},"middle":{"kind":"string","value":"pub fn create_vm(&self) -> Result<VmFd> {\n \n \n let creation_flags: u64 = HV_PARTITION_CREATION_FLAG_LAPIC_ENABLED as u64;\n let mut pr = mshv_create_partition {\n partition_creation_properties: hv_partition_creation_properties {\n disabled_processor_features: hv_partition_processor_features { as_uint64: [0; 2] },\n disabled_processor_xsave_features: hv_partition_processor_xsave_features {\n as_uint64: 0_u64,\n },\n },\n synthetic_processor_features: hv_partition_synthetic_processor_features {\n as_uint64: [0; 1],\n },\n flags: creation_flags,\n };\n /* TODO pass in arg for this */\n unsafe {\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_hypervisor_present(1);\n pr.synthetic_processor_features.__bindgen_anon_1.set_hv1(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_partition_reference_counter(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_synic_regs(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_synthetic_timer_regs(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_partition_reference_tsc(1);\n /* Need this for linux on CH, as there's no PIT or HPET */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_frequency_regs(1);\n /* Linux I'm using appears to require vp assist page... */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_intr_ctrl_regs(1);\n /* According to Hv#1 spec, these must be set also, but they aren't in KVM? */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_vp_index(1);\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_hypercall_regs(1);\n /* Windows requires this */\n pr.synthetic_processor_features\n .__bindgen_anon_1\n .set_access_guest_idle_reg(1);\n }\n\n let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CREATE_PARTITION(), &pr) };\n if ret >= 0 {\n \n let vm_file = unsafe { File::from_raw_fd(ret) };\n Ok(new_vmfd(vm_file))\n } else {\n Err(errno::Error::last())\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"/// Helper function to create a new `VmFd`.\n\n///\n\n/// This should not be exported as a public function because the preferred way is to use\n\n/// `create_vm` from `Mshv`. The function cannot be part of the `VmFd` implementation because\n\n/// then it would be exported with the public `VmFd` interface.\n\npub fn new_vmfd(vm: File) -> VmFd {\n\n VmFd { vm }\n\n}\n\n#[cfg(test)]\n\nmod tests {\n\n use libc::c_void;\n\n\n\n // Note this useful idiom: importing names from outer (for mod tests) scope.\n\n use super::*;\n\n use crate::ioctls::system::Mshv;\n\n\n\n #[test]\n\n #[ignore]\n\n fn test_user_memory() {\n\n let hv = Mshv::new().unwrap();\n\n let vm = hv.create_vm().unwrap();\n\n let addr = unsafe {\n\n libc::mmap(\n\n std::ptr::null_mut(),\n\n 0x1000,\n","file_path":"mshv-ioctls/src/ioctls/vm.rs","rank":0,"score":161208.19848076237},{"content":"/// Helper function for creating a new device.\n\npub fn new_device(dev_fd: File) -> DeviceFd {\n\n DeviceFd { fd: dev_fd }\n\n}\n\n\n\nimpl AsRawFd for DeviceFd {\n\n fn as_raw_fd(&self) -> RawFd {\n\n self.fd.as_raw_fd()\n\n }\n\n}\n\n\n\nimpl FromRawFd for DeviceFd {\n\n /// This function is also unsafe as the primitives currently returned have the contract that\n\n /// they are the sole owner of the file descriptor they are wrapping. Usage of this function\n\n /// could accidentally allow violating this contract which can cause memory unsafety in code\n\n /// that relies on it being true.\n\n unsafe fn from_raw_fd(fd: RawFd) -> Self {\n\n DeviceFd {\n\n fd: File::from_raw_fd(fd),\n\n }\n\n }\n","file_path":"mshv-ioctls/src/ioctls/device.rs","rank":1,"score":139609.07999298672},{"content":"/// Helper function to create a new `VcpuFd`.\n\n///\n\n/// This should not be exported as a public function because the preferred way is to use\n\n/// `create_vcpu` from `VmFd`. The function cannot be part of the `VcpuFd` implementation because\n\n/// then it would be exported with the public `VcpuFd` interface.\n\npub fn new_vcpu(vcpu: File) -> VcpuFd {\n\n VcpuFd { vcpu }\n\n}\n\n\n\nimpl AsRawFd for VcpuFd {\n\n fn as_raw_fd(&self) -> RawFd {\n\n self.vcpu.as_raw_fd()\n\n }\n\n}\n\n\n\nimpl VcpuFd {\n\n /// Get the register values by providing an array of register names\n\n #[cfg(not(any(target_arch = \"arm\", target_arch = \"aarch64\")))]\n\n pub fn get_reg(&self, reg_names: &mut [hv_register_assoc]) -> Result<()> {\n\n //TODO: Error if input register len is zero\n\n let mut mshv_vp_register_args = mshv_vp_registers {\n\n count: reg_names.len() as i32,\n\n regs: reg_names.as_mut_ptr(),\n\n };\n\n // Safe because we know that our file is a vCPU fd, we know the kernel will only read the\n","file_path":"mshv-ioctls/src/ioctls/vcpu.rs","rank":2,"score":132932.03369973158},{"content":"pub fn msr_to_hv_reg_name(msr: u32) -> Result<hv_register_name, &'static str> {\n\n match msr {\n\n IA32_MSR_TSC => Ok(hv_register_name::HV_X64_REGISTER_TSC),\n\n\n\n IA32_MSR_EFER => Ok(hv_register_name::HV_X64_REGISTER_EFER),\n\n IA32_MSR_KERNEL_GS_BASE => Ok(hv_register_name::HV_X64_REGISTER_KERNEL_GS_BASE),\n\n IA32_MSR_APIC_BASE => Ok(hv_register_name::HV_X64_REGISTER_APIC_BASE),\n\n IA32_MSR_PAT => Ok(hv_register_name::HV_X64_REGISTER_PAT),\n\n IA32_MSR_SYSENTER_CS => Ok(hv_register_name::HV_X64_REGISTER_SYSENTER_CS),\n\n IA32_MSR_SYSENTER_ESP => Ok(hv_register_name::HV_X64_REGISTER_SYSENTER_ESP),\n\n IA32_MSR_SYSENTER_EIP => Ok(hv_register_name::HV_X64_REGISTER_SYSENTER_EIP),\n\n IA32_MSR_STAR => Ok(hv_register_name::HV_X64_REGISTER_STAR),\n\n IA32_MSR_LSTAR => Ok(hv_register_name::HV_X64_REGISTER_LSTAR),\n\n IA32_MSR_CSTAR => Ok(hv_register_name::HV_X64_REGISTER_CSTAR),\n\n IA32_MSR_SFMASK => Ok(hv_register_name::HV_X64_REGISTER_SFMASK),\n\n\n\n IA32_MSR_MTRR_CAP => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_CAP),\n\n IA32_MSR_MTRR_DEF_TYPE => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_DEF_TYPE),\n\n IA32_MSR_MTRR_PHYSBASE0 => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_PHYS_BASE0),\n\n IA32_MSR_MTRR_PHYSMASK0 => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_PHYS_MASK0),\n","file_path":"mshv-bindings/src/regs.rs","rank":3,"score":76733.55513153323},{"content":"#[test]\n\nfn bindgen_test_layout_hv_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_message>(),\n\n 256usize,\n\n concat!(\"Size of: \", stringify!(hv_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_message>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_message))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_message>())).header as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_message),\n\n \"::\",\n\n stringify!(header)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":4,"score":66245.23511505898},{"content":"#[test]\n\nfn bindgen_test_layout_hv_u128() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_u128>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_u128))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_u128>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_u128))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_u128>())).high_part as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_u128),\n\n \"::\",\n\n stringify!(high_part)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":5,"score":66245.23511505898},{"content":"#[test]\n\nfn bindgen_test_layout___kernel_fd_set() {\n\n assert_eq!(\n\n ::std::mem::size_of::<__kernel_fd_set>(),\n\n 128usize,\n\n concat!(\"Size of: \", stringify!(__kernel_fd_set))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<__kernel_fd_set>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(__kernel_fd_set))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<__kernel_fd_set>())).fds_bits as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(__kernel_fd_set),\n\n \"::\",\n\n stringify!(fds_bits)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":6,"score":64455.468934854915},{"content":"#[test]\n\nfn bindgen_test_layout_hv_connection_id() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_connection_id>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(hv_connection_id))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_connection_id>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(hv_connection_id))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_connection_id>())).asu32 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_connection_id),\n\n \"::\",\n\n stringify!(asu32)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":7,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_port_id() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_port_id>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(hv_port_id))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_port_id>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(hv_port_id))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_port_id>())).asu32 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_port_id),\n\n \"::\",\n\n stringify!(asu32)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":8,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_message_header() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_message_header>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_message_header))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_message_header>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_message_header))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_message_header>())).message_type as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_message_header),\n\n \"::\",\n\n stringify!(message_type)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":9,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_register_value() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_register_value>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_register_value))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_register_value>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_register_value))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_register_value>())).reg128 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_register_value),\n\n \"::\",\n\n stringify!(reg128)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":10,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_interrupt_control() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_interrupt_control>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_interrupt_control))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_interrupt_control>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_interrupt_control))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_interrupt_control>())).as_uint64 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_interrupt_control),\n\n \"::\",\n\n stringify!(as_uint64)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":11,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_intercept_parameters() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_intercept_parameters>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_intercept_parameters))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_intercept_parameters>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_intercept_parameters))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_intercept_parameters>())).as_uint64 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_intercept_parameters),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":12,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_message_flags() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_message_flags>(),\n\n 1usize,\n\n concat!(\"Size of: \", stringify!(hv_message_flags))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_message_flags>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_message_flags))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_message_flags>())).asu8 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_message_flags),\n\n \"::\",\n\n stringify!(asu8)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":13,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_register_assoc() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_register_assoc>(),\n\n 32usize,\n\n concat!(\"Size of: \", stringify!(hv_register_assoc))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_register_assoc>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_register_assoc))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_register_assoc>())).name as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_register_assoc),\n\n \"::\",\n\n stringify!(name)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":14,"score":63951.469696580316},{"content":"#[test]\n\nfn bindgen_test_layout_hv_intercept_suspend_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_intercept_suspend_register>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_intercept_suspend_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_intercept_suspend_register>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_intercept_suspend_register))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_intercept_suspend_register>())).as_uint64 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_intercept_suspend_register),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":15,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_exception_info() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_exception_info>(),\n\n 1usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_exception_info))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_exception_info>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_exception_info))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_x64_exception_info>())).as_uint8 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_exception_info),\n\n \"::\",\n\n stringify!(as_uint8)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":16,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_halt_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_halt_message>(),\n\n 40usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_halt_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_halt_message>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_halt_message))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_x64_halt_message>())).header as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_halt_message),\n\n \"::\",\n\n stringify!(header)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":17,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_fp_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_fp_register>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_fp_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_fp_register>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_fp_register))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_x64_fp_register>())).as_uint128 as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_fp_register),\n\n \"::\",\n\n stringify!(as_uint128)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":18,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_creation_properties() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_creation_properties>(),\n\n 24usize,\n\n concat!(\"Size of: \", stringify!(hv_partition_creation_properties))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_creation_properties>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_partition_creation_properties)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_partition_creation_properties>())).disabled_processor_features\n\n as *const _ as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":19,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_translate_gva_result() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_translate_gva_result>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_translate_gva_result))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_translate_gva_result>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_translate_gva_result))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_translate_gva_result>())).as_uint64 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_translate_gva_result),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":20,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_segment_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_segment_register>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_segment_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_segment_register>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_segment_register))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_x64_segment_register>())).base as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_segment_register),\n\n \"::\",\n\n stringify!(base)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":21,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_dispatch_suspend_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_dispatch_suspend_register>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_dispatch_suspend_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_dispatch_suspend_register>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_dispatch_suspend_register))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_dispatch_suspend_register>())).as_uint64 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_dispatch_suspend_register),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":22,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_processor_features() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_processor_features>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_partition_processor_features))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_processor_features>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_partition_processor_features))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_partition_processor_features>())).as_uint64 as *const _\n\n as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_partition_processor_features),\n","file_path":"mshv-bindings/src/bindings.rs","rank":23,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_register_page() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_register_page>(),\n\n 416usize,\n\n concat!(\"Size of: \", stringify!(hv_vp_register_page))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_register_page>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_vp_register_page))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_vp_register_page>())).version as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_vp_register_page),\n\n \"::\",\n\n stringify!(version)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":24,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_table_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_table_register>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_table_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_table_register>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_table_register))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_x64_table_register>())).pad as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_table_register),\n\n \"::\",\n\n stringify!(pad)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":25,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_explicit_suspend_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_explicit_suspend_register>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_explicit_suspend_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_explicit_suspend_register>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_explicit_suspend_register))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_explicit_suspend_register>())).as_uint64 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_explicit_suspend_register),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":26,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_message__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_message__bindgen_ty_1>(),\n\n 240usize,\n\n concat!(\"Size of: \", stringify!(hv_message__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_message__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_message__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_message__bindgen_ty_1>())).payload as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_message__bindgen_ty_1),\n\n \"::\",\n\n stringify!(payload)\n\n )\n\n );\n\n}\n\nimpl Default for hv_message__bindgen_ty_1 {\n\n fn default() -> Self {\n\n unsafe { ::std::mem::zeroed() }\n\n }\n\n}\n","file_path":"mshv-bindings/src/bindings.rs","rank":27,"score":61843.95239341707},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_unsupported_feature_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_unsupported_feature_message>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_unsupported_feature_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_unsupported_feature_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_unsupported_feature_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_unsupported_feature_message>())).vp_index as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":28,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_vp_execution_state() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_vp_execution_state>(),\n\n 2usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_vp_execution_state))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_vp_execution_state>(),\n\n 2usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_vp_execution_state))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_vp_execution_state>())).as_uint16 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_vp_execution_state),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":29,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_gpa_page_access_state() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_gpa_page_access_state>(),\n\n 1usize,\n\n concat!(\"Size of: \", stringify!(hv_gpa_page_access_state))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_gpa_page_access_state>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_gpa_page_access_state))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_gpa_page_access_state>())).as_uint8 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_gpa_page_access_state),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":30,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_unrecoverable_exception_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_unrecoverable_exception_message>(),\n\n 40usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_unrecoverable_exception_message)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_unrecoverable_exception_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_unrecoverable_exception_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_unrecoverable_exception_message>())).header as *const _\n","file_path":"mshv-bindings/src/bindings.rs","rank":31,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_state_data_xsave() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_state_data_xsave>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_vp_state_data_xsave))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_state_data_xsave>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_vp_state_data_xsave))\n\n );\n\n assert_eq!(\n\n unsafe { &(*(::std::ptr::null::<hv_vp_state_data_xsave>())).flags as *const _ as usize },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_vp_state_data_xsave),\n\n \"::\",\n\n stringify!(flags)\n\n )\n","file_path":"mshv-bindings/src/bindings.rs","rank":32,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_synthetic_processor_features() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_synthetic_processor_features>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_partition_synthetic_processor_features)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_synthetic_processor_features>(),\n\n 8usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_partition_synthetic_processor_features)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_partition_synthetic_processor_features>())).as_uint64\n","file_path":"mshv-bindings/src/bindings.rs","rank":33,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_pending_interruption_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_pending_interruption_register>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_pending_interruption_register)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_pending_interruption_register>(),\n\n 8usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_pending_interruption_register)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_pending_interruption_register>())).as_uint64 as *const _\n","file_path":"mshv-bindings/src/bindings.rs","rank":34,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_hypercall_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_hypercall_intercept_message>(),\n\n 196usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_hypercall_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_hypercall_intercept_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_hypercall_intercept_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_hypercall_intercept_message>())).header as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":35,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_interrupt_state_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_interrupt_state_register>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_interrupt_state_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_interrupt_state_register>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_interrupt_state_register))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_interrupt_state_register>())).as_uint64 as *const _\n\n as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_interrupt_state_register),\n","file_path":"mshv-bindings/src/bindings.rs","rank":36,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_processor_xsave_features() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_processor_xsave_features>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_partition_processor_xsave_features)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_processor_xsave_features>(),\n\n 8usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_partition_processor_xsave_features)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_partition_processor_xsave_features>())).as_uint64 as *const _\n","file_path":"mshv-bindings/src/bindings.rs","rank":37,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_msr_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_msr_intercept_message>(),\n\n 64usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_msr_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_msr_intercept_message>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_msr_intercept_message))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_msr_intercept_message>())).header as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_msr_intercept_message),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":38,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_xsave_xfem_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_xsave_xfem_register>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_xsave_xfem_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_xsave_xfem_register>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_xsave_xfem_register))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_xsave_xfem_register>())).as_uint64 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_xsave_xfem_register),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":39,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_cpuid_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_cpuid_intercept_message>(),\n\n 104usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_cpuid_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_cpuid_intercept_message>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_cpuid_intercept_message))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_cpuid_intercept_message>())).header as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_cpuid_intercept_message),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":40,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_sipi_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_sipi_intercept_message>(),\n\n 48usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_sipi_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_sipi_intercept_message>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_sipi_intercept_message))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_sipi_intercept_message>())).header as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_sipi_intercept_message),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":41,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_apic_eoi_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_apic_eoi_message>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_apic_eoi_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_apic_eoi_message>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_apic_eoi_message))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_apic_eoi_message>())).vp_index as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_apic_eoi_message),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":42,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_register_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_register_intercept_message>(),\n\n 64usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_register_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_register_intercept_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_register_intercept_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_register_intercept_message>())).header as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":43,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_exception_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_exception_intercept_message>(),\n\n 240usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_exception_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_exception_intercept_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_exception_intercept_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_exception_intercept_message>())).header as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":44,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_interruption_deliverable_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_interruption_deliverable_message>(),\n\n 48usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_interruption_deliverable_message)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_interruption_deliverable_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_interruption_deliverable_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_interruption_deliverable_message>())).header as *const _\n","file_path":"mshv-bindings/src/bindings.rs","rank":45,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_memory_access_info() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_memory_access_info>(),\n\n 1usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_memory_access_info))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_memory_access_info>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_memory_access_info))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_memory_access_info>())).as_uint8 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_memory_access_info),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":46,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_register_access_info() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_register_access_info>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_register_access_info))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_register_access_info>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_register_access_info))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_register_access_info>())).source_value as *const _\n\n as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_register_access_info),\n","file_path":"mshv-bindings/src/bindings.rs","rank":47,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_port_id__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_port_id__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(hv_port_id__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_port_id__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_port_id__bindgen_ty_1))\n\n );\n\n}\n\nimpl hv_port_id__bindgen_ty_1 {\n\n #[inline]\n\n pub fn id(&self) -> __u32 {\n\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 24u8) as u32) }\n\n }\n\n #[inline]\n\n pub fn set_id(&mut self, val: __u32) {\n\n unsafe {\n","file_path":"mshv-bindings/src/bindings.rs","rank":48,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_interrupt_control__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_interrupt_control__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_interrupt_control__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_interrupt_control__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_interrupt_control__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_interrupt_control__bindgen_ty_1>())).interrupt_type\n\n as *const _ as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":49,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_local_interrupt_controller_state() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_local_interrupt_controller_state>(),\n\n 176usize,\n\n concat!(\"Size of: \", stringify!(hv_local_interrupt_controller_state))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_local_interrupt_controller_state>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_local_interrupt_controller_state)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_local_interrupt_controller_state>())).apic_id as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":50,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_connection_id__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_connection_id__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\"Size of: \", stringify!(hv_connection_id__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_connection_id__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\"Alignment of \", stringify!(hv_connection_id__bindgen_ty_1))\n\n );\n\n}\n\nimpl hv_connection_id__bindgen_ty_1 {\n\n #[inline]\n\n pub fn id(&self) -> __u32 {\n\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 24u8) as u32) }\n\n }\n\n #[inline]\n\n pub fn set_id(&mut self, val: __u32) {\n\n unsafe {\n","file_path":"mshv-bindings/src/bindings.rs","rank":51,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_message_header__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_message_header__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_message_header__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_message_header__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_message_header__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_message_header__bindgen_ty_1>())).sender as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_message_header__bindgen_ty_1),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":52,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_message_flags__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_message_flags__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\"Size of: \", stringify!(hv_message_flags__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_message_flags__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_message_flags__bindgen_ty_1))\n\n );\n\n}\n\nimpl hv_message_flags__bindgen_ty_1 {\n\n #[inline]\n\n pub fn msg_pending(&self) -> __u8 {\n\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 1u8) as u8) }\n\n }\n\n #[inline]\n\n pub fn set_msg_pending(&mut self, val: __u8) {\n\n unsafe {\n","file_path":"mshv-bindings/src/bindings.rs","rank":53,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_memory_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_memory_intercept_message>(),\n\n 80usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_memory_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_memory_intercept_message>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_memory_intercept_message))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_memory_intercept_message>())).header as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_memory_intercept_message),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":54,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_pending_exception_event() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_pending_exception_event>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_pending_exception_event))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_pending_exception_event>(),\n\n 8usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_pending_exception_event))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_pending_exception_event>())).as_uint64 as *const _\n\n as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_pending_exception_event),\n","file_path":"mshv-bindings/src/bindings.rs","rank":55,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_intercept_message_header() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_intercept_message_header>(),\n\n 40usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_intercept_message_header))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_intercept_message_header>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_intercept_message_header))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_intercept_message_header>())).vp_index as *const _\n\n as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_intercept_message_header),\n","file_path":"mshv-bindings/src/bindings.rs","rank":56,"score":59900.883896800246},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_fp_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_fp_register__bindgen_ty_1>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_fp_register__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_fp_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_fp_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_fp_register__bindgen_ty_1>())).mantissa as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":57,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_2() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_2>(),\n\n 96usize,\n\n concat!(\"Size of: \", stringify!(hv_vp_register_page__bindgen_ty_2))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_2>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_vp_register_page__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_2>())).xmm_registers as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":58,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_xmm_control_status_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_xmm_control_status_register>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_xmm_control_status_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_xmm_control_status_register>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_xmm_control_status_register)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_xmm_control_status_register>())).as_uint128 as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":59,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_processor_features__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_processor_features__bindgen_ty_1>(),\n\n 16usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_partition_processor_features__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_processor_features__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_partition_processor_features__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_partition_processor_features__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":60,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_io_port_access_info() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_io_port_access_info>(),\n\n 1usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_io_port_access_info))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_io_port_access_info>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_x64_io_port_access_info))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_io_port_access_info>())).as_uint8 as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_x64_io_port_access_info),\n\n \"::\",\n","file_path":"mshv-bindings/src/bindings.rs","rank":61,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_io_port_intercept_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_io_port_intercept_message>(),\n\n 128usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_io_port_intercept_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_io_port_intercept_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_io_port_intercept_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_io_port_intercept_message>())).header as *const _ as usize\n\n },\n\n 0usize,\n\n concat!(\n","file_path":"mshv-bindings/src/bindings.rs","rank":62,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_explicit_suspend_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_explicit_suspend_register__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_explicit_suspend_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_explicit_suspend_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_explicit_suspend_register__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_explicit_suspend_register__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":63,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_intercept_suspend_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_intercept_suspend_register__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_intercept_suspend_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_intercept_suspend_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_intercept_suspend_register__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_intercept_suspend_register__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":64,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_msr_npiep_config_contents() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_msr_npiep_config_contents>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_msr_npiep_config_contents))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_msr_npiep_config_contents>(),\n\n 8usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_msr_npiep_config_contents)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_msr_npiep_config_contents>())).as_uint64 as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":65,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_pending_virtualization_fault_event() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_pending_virtualization_fault_event>(),\n\n 16usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_pending_virtualization_fault_event)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_pending_virtualization_fault_event>(),\n\n 8usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_pending_virtualization_fault_event)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_pending_virtualization_fault_event>())).as_uint64\n","file_path":"mshv-bindings/src/bindings.rs","rank":66,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_3() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_3>(),\n\n 96usize,\n\n concat!(\"Size of: \", stringify!(hv_vp_register_page__bindgen_ty_3))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_3>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_vp_register_page__bindgen_ty_3)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_3>())).segment_registers\n\n as *const _ as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":67,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_translate_gva_result__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_translate_gva_result__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_translate_gva_result__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_translate_gva_result__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_translate_gva_result__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_translate_gva_result__bindgen_ty_1>())).result_code\n","file_path":"mshv-bindings/src/bindings.rs","rank":68,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_gpa_page_access_state_flags() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_gpa_page_access_state_flags>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_gpa_page_access_state_flags))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_gpa_page_access_state_flags>(),\n\n 1usize,\n\n concat!(\"Alignment of \", stringify!(hv_gpa_page_access_state_flags))\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_gpa_page_access_state_flags>())).as_uint64 as *const _\n\n as usize\n\n },\n\n 0usize,\n\n concat!(\n\n \"Offset of field: \",\n\n stringify!(hv_gpa_page_access_state_flags),\n","file_path":"mshv-bindings/src/bindings.rs","rank":69,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_1>(),\n\n 128usize,\n\n concat!(\"Size of: \", stringify!(hv_vp_register_page__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_vp_register_page__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_1>())).gp_registers as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":70,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_invalid_vp_register_message() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_invalid_vp_register_message>(),\n\n 8usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_invalid_vp_register_message))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_invalid_vp_register_message>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_invalid_vp_register_message)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_invalid_vp_register_message>())).vp_index as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":71,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_dispatch_suspend_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_dispatch_suspend_register__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_dispatch_suspend_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_dispatch_suspend_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_dispatch_suspend_register__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_dispatch_suspend_register__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":72,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_segment_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_segment_register__bindgen_ty_1>(),\n\n 2usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_segment_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_segment_register__bindgen_ty_1>(),\n\n 2usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_segment_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_segment_register__bindgen_ty_1>())).attributes as *const _\n","file_path":"mshv-bindings/src/bindings.rs","rank":73,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_exception_info__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_exception_info__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_exception_info__bindgen_ty_1))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_exception_info__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_exception_info__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_exception_info__bindgen_ty_1 {\n\n #[inline]\n\n pub fn error_code_valid(&self) -> __u8 {\n\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 1u8) as u8) }\n\n }\n","file_path":"mshv-bindings/src/bindings.rs","rank":74,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_fp_control_status_register() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_fp_control_status_register>(),\n\n 16usize,\n\n concat!(\"Size of: \", stringify!(hv_x64_fp_control_status_register))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_fp_control_status_register>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_fp_control_status_register)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_fp_control_status_register>())).as_uint128 as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":75,"score":58103.73913829705},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_property_page_access_tracking_config() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_property_page_access_tracking_config>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_partition_property_page_access_tracking_config)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_property_page_access_tracking_config>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_partition_property_page_access_tracking_config)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_partition_property_page_access_tracking_config>())).as_uint64\n","file_path":"mshv-bindings/src/bindings.rs","rank":76,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_gpa_page_access_state__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_gpa_page_access_state__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_gpa_page_access_state__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_gpa_page_access_state__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_gpa_page_access_state__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_gpa_page_access_state__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":77,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_pending_interruption_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_pending_interruption_register__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_pending_interruption_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_pending_interruption_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_pending_interruption_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_pending_interruption_register__bindgen_ty_1>()))\n","file_path":"mshv-bindings/src/bindings.rs","rank":78,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_xsave_xfem_register__bindgen_ty_2() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_xsave_xfem_register__bindgen_ty_2>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_2)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_xsave_xfem_register__bindgen_ty_2>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_2)\n\n )\n\n );\n\n}\n\nimpl hv_x64_xsave_xfem_register__bindgen_ty_2 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":79,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_register_intercept_message__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_register_intercept_message__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_register_intercept_message__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_register_intercept_message__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_register_intercept_message__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_register_intercept_message__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":80,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_hypercall_intercept_message__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_hypercall_intercept_message__bindgen_ty_1>(),\n\n 4usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_hypercall_intercept_message__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_hypercall_intercept_message__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_hypercall_intercept_message__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_hypercall_intercept_message__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":81,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_synthetic_processor_features__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_synthetic_processor_features__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_partition_synthetic_processor_features__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_synthetic_processor_features__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_partition_synthetic_processor_features__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_partition_synthetic_processor_features__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":82,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_pending_exception_event__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_pending_exception_event__bindgen_ty_1>(),\n\n 16usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_pending_exception_event__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_pending_exception_event__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_pending_exception_event__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_pending_exception_event__bindgen_ty_1>())).error_code\n","file_path":"mshv-bindings/src/bindings.rs","rank":83,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_interrupt_state_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_interrupt_state_register__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_interrupt_state_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_interrupt_state_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_interrupt_state_register__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_interrupt_state_register__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":84,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_xsave_xfem_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_xsave_xfem_register__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_xsave_xfem_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_xsave_xfem_register__bindgen_ty_1>())).low_uint32\n","file_path":"mshv-bindings/src/bindings.rs","rank":85,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_input_get_gpa_pages_access_state() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_input_get_gpa_pages_access_state>(),\n\n 24usize,\n\n concat!(\"Size of: \", stringify!(hv_input_get_gpa_pages_access_state))\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_input_get_gpa_pages_access_state>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_input_get_gpa_pages_access_state)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_input_get_gpa_pages_access_state>())).partition_id as *const _\n\n as usize\n\n },\n\n 0usize,\n","file_path":"mshv-bindings/src/bindings.rs","rank":86,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_vp_execution_state__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_vp_execution_state__bindgen_ty_1>(),\n\n 2usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_vp_execution_state__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_vp_execution_state__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_vp_execution_state__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_vp_execution_state__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":87,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_partition_processor_xsave_features__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_partition_processor_xsave_features__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_partition_processor_xsave_features__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_partition_processor_xsave_features__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_partition_processor_xsave_features__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_partition_processor_xsave_features__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":88,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_memory_access_info__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_memory_access_info__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_memory_access_info__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_memory_access_info__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_memory_access_info__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_memory_access_info__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":89,"score":56436.674801972666},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_fp_control_status_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_fp_control_status_register__bindgen_ty_1>(),\n\n 16usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_fp_control_status_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_fp_control_status_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_fp_control_status_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_fp_control_status_register__bindgen_ty_1>())).fp_control\n","file_path":"mshv-bindings/src/bindings.rs","rank":90,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_3__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_3__bindgen_ty_1>(),\n\n 96usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_vp_register_page__bindgen_ty_3__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_3__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_vp_register_page__bindgen_ty_3__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_3__bindgen_ty_1>())).es\n","file_path":"mshv-bindings/src/bindings.rs","rank":91,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_pending_virtualization_fault_event__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_pending_virtualization_fault_event__bindgen_ty_1>(),\n\n 16usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_pending_virtualization_fault_event__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_pending_virtualization_fault_event__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_pending_virtualization_fault_event__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_pending_virtualization_fault_event__bindgen_ty_1>())).code\n","file_path":"mshv-bindings/src/bindings.rs","rank":92,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_msr_npiep_config_contents__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_msr_npiep_config_contents__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_msr_npiep_config_contents__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_msr_npiep_config_contents__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_msr_npiep_config_contents__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_msr_npiep_config_contents__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":93,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_2__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_2__bindgen_ty_1>(),\n\n 96usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_vp_register_page__bindgen_ty_2__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_2__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_vp_register_page__bindgen_ty_2__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_2__bindgen_ty_1>())).xmm0\n","file_path":"mshv-bindings/src/bindings.rs","rank":94,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_1__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_1__bindgen_ty_1>(),\n\n 128usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_vp_register_page__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_1__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_vp_register_page__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_1__bindgen_ty_1>())).rax\n","file_path":"mshv-bindings/src/bindings.rs","rank":95,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_xmm_control_status_register__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_xmm_control_status_register__bindgen_ty_1>(),\n\n 16usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_xmm_control_status_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_xmm_control_status_register__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_xmm_control_status_register__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n unsafe {\n\n &(*(::std::ptr::null::<hv_x64_xmm_control_status_register__bindgen_ty_1>()))\n","file_path":"mshv-bindings/src/bindings.rs","rank":96,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_gpa_page_access_state_flags__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_gpa_page_access_state_flags__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_gpa_page_access_state_flags__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_gpa_page_access_state_flags__bindgen_ty_1>(),\n\n 8usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_gpa_page_access_state_flags__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_gpa_page_access_state_flags__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":97,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1>(),\n\n 2usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":98,"score":54886.06099887096},{"content":"#[test]\n\nfn bindgen_test_layout_hv_x64_io_port_access_info__bindgen_ty_1() {\n\n assert_eq!(\n\n ::std::mem::size_of::<hv_x64_io_port_access_info__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Size of: \",\n\n stringify!(hv_x64_io_port_access_info__bindgen_ty_1)\n\n )\n\n );\n\n assert_eq!(\n\n ::std::mem::align_of::<hv_x64_io_port_access_info__bindgen_ty_1>(),\n\n 1usize,\n\n concat!(\n\n \"Alignment of \",\n\n stringify!(hv_x64_io_port_access_info__bindgen_ty_1)\n\n )\n\n );\n\n}\n\nimpl hv_x64_io_port_access_info__bindgen_ty_1 {\n\n #[inline]\n","file_path":"mshv-bindings/src/bindings.rs","rank":99,"score":54886.06099887096}],"string":"[\n {\n \"content\": \"/// Helper function to create a new `VmFd`.\\n\\n///\\n\\n/// This should not be exported as a public function because the preferred way is to use\\n\\n/// `create_vm` from `Mshv`. The function cannot be part of the `VmFd` implementation because\\n\\n/// then it would be exported with the public `VmFd` interface.\\n\\npub fn new_vmfd(vm: File) -> VmFd {\\n\\n VmFd { vm }\\n\\n}\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use libc::c_void;\\n\\n\\n\\n // Note this useful idiom: importing names from outer (for mod tests) scope.\\n\\n use super::*;\\n\\n use crate::ioctls::system::Mshv;\\n\\n\\n\\n #[test]\\n\\n #[ignore]\\n\\n fn test_user_memory() {\\n\\n let hv = Mshv::new().unwrap();\\n\\n let vm = hv.create_vm().unwrap();\\n\\n let addr = unsafe {\\n\\n libc::mmap(\\n\\n std::ptr::null_mut(),\\n\\n 0x1000,\\n\",\n \"file_path\": \"mshv-ioctls/src/ioctls/vm.rs\",\n \"rank\": 0,\n \"score\": 161208.19848076237\n },\n {\n \"content\": \"/// Helper function for creating a new device.\\n\\npub fn new_device(dev_fd: File) -> DeviceFd {\\n\\n DeviceFd { fd: dev_fd }\\n\\n}\\n\\n\\n\\nimpl AsRawFd for DeviceFd {\\n\\n fn as_raw_fd(&self) -> RawFd {\\n\\n self.fd.as_raw_fd()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl FromRawFd for DeviceFd {\\n\\n /// This function is also unsafe as the primitives currently returned have the contract that\\n\\n /// they are the sole owner of the file descriptor they are wrapping. Usage of this function\\n\\n /// could accidentally allow violating this contract which can cause memory unsafety in code\\n\\n /// that relies on it being true.\\n\\n unsafe fn from_raw_fd(fd: RawFd) -> Self {\\n\\n DeviceFd {\\n\\n fd: File::from_raw_fd(fd),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"mshv-ioctls/src/ioctls/device.rs\",\n \"rank\": 1,\n \"score\": 139609.07999298672\n },\n {\n \"content\": \"/// Helper function to create a new `VcpuFd`.\\n\\n///\\n\\n/// This should not be exported as a public function because the preferred way is to use\\n\\n/// `create_vcpu` from `VmFd`. The function cannot be part of the `VcpuFd` implementation because\\n\\n/// then it would be exported with the public `VcpuFd` interface.\\n\\npub fn new_vcpu(vcpu: File) -> VcpuFd {\\n\\n VcpuFd { vcpu }\\n\\n}\\n\\n\\n\\nimpl AsRawFd for VcpuFd {\\n\\n fn as_raw_fd(&self) -> RawFd {\\n\\n self.vcpu.as_raw_fd()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl VcpuFd {\\n\\n /// Get the register values by providing an array of register names\\n\\n #[cfg(not(any(target_arch = \\\"arm\\\", target_arch = \\\"aarch64\\\")))]\\n\\n pub fn get_reg(&self, reg_names: &mut [hv_register_assoc]) -> Result<()> {\\n\\n //TODO: Error if input register len is zero\\n\\n let mut mshv_vp_register_args = mshv_vp_registers {\\n\\n count: reg_names.len() as i32,\\n\\n regs: reg_names.as_mut_ptr(),\\n\\n };\\n\\n // Safe because we know that our file is a vCPU fd, we know the kernel will only read the\\n\",\n \"file_path\": \"mshv-ioctls/src/ioctls/vcpu.rs\",\n \"rank\": 2,\n \"score\": 132932.03369973158\n },\n {\n \"content\": \"pub fn msr_to_hv_reg_name(msr: u32) -> Result<hv_register_name, &'static str> {\\n\\n match msr {\\n\\n IA32_MSR_TSC => Ok(hv_register_name::HV_X64_REGISTER_TSC),\\n\\n\\n\\n IA32_MSR_EFER => Ok(hv_register_name::HV_X64_REGISTER_EFER),\\n\\n IA32_MSR_KERNEL_GS_BASE => Ok(hv_register_name::HV_X64_REGISTER_KERNEL_GS_BASE),\\n\\n IA32_MSR_APIC_BASE => Ok(hv_register_name::HV_X64_REGISTER_APIC_BASE),\\n\\n IA32_MSR_PAT => Ok(hv_register_name::HV_X64_REGISTER_PAT),\\n\\n IA32_MSR_SYSENTER_CS => Ok(hv_register_name::HV_X64_REGISTER_SYSENTER_CS),\\n\\n IA32_MSR_SYSENTER_ESP => Ok(hv_register_name::HV_X64_REGISTER_SYSENTER_ESP),\\n\\n IA32_MSR_SYSENTER_EIP => Ok(hv_register_name::HV_X64_REGISTER_SYSENTER_EIP),\\n\\n IA32_MSR_STAR => Ok(hv_register_name::HV_X64_REGISTER_STAR),\\n\\n IA32_MSR_LSTAR => Ok(hv_register_name::HV_X64_REGISTER_LSTAR),\\n\\n IA32_MSR_CSTAR => Ok(hv_register_name::HV_X64_REGISTER_CSTAR),\\n\\n IA32_MSR_SFMASK => Ok(hv_register_name::HV_X64_REGISTER_SFMASK),\\n\\n\\n\\n IA32_MSR_MTRR_CAP => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_CAP),\\n\\n IA32_MSR_MTRR_DEF_TYPE => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_DEF_TYPE),\\n\\n IA32_MSR_MTRR_PHYSBASE0 => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_PHYS_BASE0),\\n\\n IA32_MSR_MTRR_PHYSMASK0 => Ok(hv_register_name::HV_X64_REGISTER_MSR_MTRR_PHYS_MASK0),\\n\",\n \"file_path\": \"mshv-bindings/src/regs.rs\",\n \"rank\": 3,\n \"score\": 76733.55513153323\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_message>(),\\n\\n 256usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_message>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_message))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_message>())).header as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_message),\\n\\n \\\"::\\\",\\n\\n stringify!(header)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 4,\n \"score\": 66245.23511505898\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_u128() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_u128>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_u128))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_u128>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_u128))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_u128>())).high_part as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_u128),\\n\\n \\\"::\\\",\\n\\n stringify!(high_part)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 5,\n \"score\": 66245.23511505898\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout___kernel_fd_set() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<__kernel_fd_set>(),\\n\\n 128usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(__kernel_fd_set))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<__kernel_fd_set>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(__kernel_fd_set))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<__kernel_fd_set>())).fds_bits as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(__kernel_fd_set),\\n\\n \\\"::\\\",\\n\\n stringify!(fds_bits)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 6,\n \"score\": 64455.468934854915\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_connection_id() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_connection_id>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_connection_id))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_connection_id>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_connection_id))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_connection_id>())).asu32 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_connection_id),\\n\\n \\\"::\\\",\\n\\n stringify!(asu32)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 7,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_port_id() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_port_id>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_port_id))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_port_id>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_port_id))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_port_id>())).asu32 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_port_id),\\n\\n \\\"::\\\",\\n\\n stringify!(asu32)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 8,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_message_header() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_message_header>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_message_header))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_message_header>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_message_header))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_message_header>())).message_type as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_message_header),\\n\\n \\\"::\\\",\\n\\n stringify!(message_type)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 9,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_register_value() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_register_value>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_register_value))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_register_value>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_register_value))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_register_value>())).reg128 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_register_value),\\n\\n \\\"::\\\",\\n\\n stringify!(reg128)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 10,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_interrupt_control() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_interrupt_control>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_interrupt_control))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_interrupt_control>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_interrupt_control))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_interrupt_control>())).as_uint64 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_interrupt_control),\\n\\n \\\"::\\\",\\n\\n stringify!(as_uint64)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 11,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_intercept_parameters() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_intercept_parameters>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_intercept_parameters))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_intercept_parameters>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_intercept_parameters))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_intercept_parameters>())).as_uint64 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_intercept_parameters),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 12,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_message_flags() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_message_flags>(),\\n\\n 1usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_message_flags))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_message_flags>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_message_flags))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_message_flags>())).asu8 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_message_flags),\\n\\n \\\"::\\\",\\n\\n stringify!(asu8)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 13,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_register_assoc() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_register_assoc>(),\\n\\n 32usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_register_assoc))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_register_assoc>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_register_assoc))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_register_assoc>())).name as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_register_assoc),\\n\\n \\\"::\\\",\\n\\n stringify!(name)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 14,\n \"score\": 63951.469696580316\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_intercept_suspend_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_intercept_suspend_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_intercept_suspend_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_intercept_suspend_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_intercept_suspend_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_intercept_suspend_register>())).as_uint64 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_intercept_suspend_register),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 15,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_exception_info() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_exception_info>(),\\n\\n 1usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_exception_info))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_exception_info>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_exception_info))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_x64_exception_info>())).as_uint8 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_exception_info),\\n\\n \\\"::\\\",\\n\\n stringify!(as_uint8)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 16,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_halt_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_halt_message>(),\\n\\n 40usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_halt_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_halt_message>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_halt_message))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_x64_halt_message>())).header as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_halt_message),\\n\\n \\\"::\\\",\\n\\n stringify!(header)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 17,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_fp_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_fp_register>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_fp_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_fp_register>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_fp_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_x64_fp_register>())).as_uint128 as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_fp_register),\\n\\n \\\"::\\\",\\n\\n stringify!(as_uint128)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 18,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_creation_properties() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_creation_properties>(),\\n\\n 24usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_partition_creation_properties))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_creation_properties>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_partition_creation_properties)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_partition_creation_properties>())).disabled_processor_features\\n\\n as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 19,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_translate_gva_result() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_translate_gva_result>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_translate_gva_result))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_translate_gva_result>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_translate_gva_result))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_translate_gva_result>())).as_uint64 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_translate_gva_result),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 20,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_segment_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_segment_register>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_segment_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_segment_register>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_segment_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_x64_segment_register>())).base as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_segment_register),\\n\\n \\\"::\\\",\\n\\n stringify!(base)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 21,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_dispatch_suspend_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_dispatch_suspend_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_dispatch_suspend_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_dispatch_suspend_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_dispatch_suspend_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_dispatch_suspend_register>())).as_uint64 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_dispatch_suspend_register),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 22,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_processor_features() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_processor_features>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_partition_processor_features))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_processor_features>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_partition_processor_features))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_partition_processor_features>())).as_uint64 as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_partition_processor_features),\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 23,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_register_page() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_register_page>(),\\n\\n 416usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_vp_register_page))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_register_page>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_vp_register_page))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_vp_register_page>())).version as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_vp_register_page),\\n\\n \\\"::\\\",\\n\\n stringify!(version)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 24,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_table_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_table_register>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_table_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_table_register>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_table_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_x64_table_register>())).pad as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_table_register),\\n\\n \\\"::\\\",\\n\\n stringify!(pad)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 25,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_explicit_suspend_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_explicit_suspend_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_explicit_suspend_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_explicit_suspend_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_explicit_suspend_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_explicit_suspend_register>())).as_uint64 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_explicit_suspend_register),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 26,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_message__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_message__bindgen_ty_1>(),\\n\\n 240usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_message__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_message__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_message__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_message__bindgen_ty_1>())).payload as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_message__bindgen_ty_1),\\n\\n \\\"::\\\",\\n\\n stringify!(payload)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl Default for hv_message__bindgen_ty_1 {\\n\\n fn default() -> Self {\\n\\n unsafe { ::std::mem::zeroed() }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 27,\n \"score\": 61843.95239341707\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_unsupported_feature_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_unsupported_feature_message>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_unsupported_feature_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_unsupported_feature_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_unsupported_feature_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_unsupported_feature_message>())).vp_index as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 28,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_vp_execution_state() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_vp_execution_state>(),\\n\\n 2usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_vp_execution_state))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_vp_execution_state>(),\\n\\n 2usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_vp_execution_state))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_vp_execution_state>())).as_uint16 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_vp_execution_state),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 29,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_gpa_page_access_state() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_gpa_page_access_state>(),\\n\\n 1usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_gpa_page_access_state))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_gpa_page_access_state>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_gpa_page_access_state))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_gpa_page_access_state>())).as_uint8 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_gpa_page_access_state),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 30,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_unrecoverable_exception_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_unrecoverable_exception_message>(),\\n\\n 40usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_unrecoverable_exception_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_unrecoverable_exception_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_unrecoverable_exception_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_unrecoverable_exception_message>())).header as *const _\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 31,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_state_data_xsave() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_state_data_xsave>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_vp_state_data_xsave))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_state_data_xsave>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_vp_state_data_xsave))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe { &(*(::std::ptr::null::<hv_vp_state_data_xsave>())).flags as *const _ as usize },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_vp_state_data_xsave),\\n\\n \\\"::\\\",\\n\\n stringify!(flags)\\n\\n )\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 32,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_synthetic_processor_features() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_synthetic_processor_features>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_partition_synthetic_processor_features)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_synthetic_processor_features>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_partition_synthetic_processor_features)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_partition_synthetic_processor_features>())).as_uint64\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 33,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_pending_interruption_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_pending_interruption_register>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_pending_interruption_register)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_pending_interruption_register>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_pending_interruption_register)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_pending_interruption_register>())).as_uint64 as *const _\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 34,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_hypercall_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_hypercall_intercept_message>(),\\n\\n 196usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_hypercall_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_hypercall_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_hypercall_intercept_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_hypercall_intercept_message>())).header as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 35,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_interrupt_state_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_interrupt_state_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_interrupt_state_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_interrupt_state_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_interrupt_state_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_interrupt_state_register>())).as_uint64 as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_interrupt_state_register),\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 36,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_processor_xsave_features() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_processor_xsave_features>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_partition_processor_xsave_features)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_processor_xsave_features>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_partition_processor_xsave_features)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_partition_processor_xsave_features>())).as_uint64 as *const _\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 37,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_msr_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_msr_intercept_message>(),\\n\\n 64usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_msr_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_msr_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_msr_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_msr_intercept_message>())).header as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_msr_intercept_message),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 38,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_xsave_xfem_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_xsave_xfem_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_xsave_xfem_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_xsave_xfem_register>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_xsave_xfem_register))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_xsave_xfem_register>())).as_uint64 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_xsave_xfem_register),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 39,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_cpuid_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_cpuid_intercept_message>(),\\n\\n 104usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_cpuid_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_cpuid_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_cpuid_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_cpuid_intercept_message>())).header as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_cpuid_intercept_message),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 40,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_sipi_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_sipi_intercept_message>(),\\n\\n 48usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_sipi_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_sipi_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_sipi_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_sipi_intercept_message>())).header as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_sipi_intercept_message),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 41,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_apic_eoi_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_apic_eoi_message>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_apic_eoi_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_apic_eoi_message>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_apic_eoi_message))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_apic_eoi_message>())).vp_index as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_apic_eoi_message),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 42,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_register_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_register_intercept_message>(),\\n\\n 64usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_register_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_register_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_register_intercept_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_register_intercept_message>())).header as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 43,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_exception_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_exception_intercept_message>(),\\n\\n 240usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_exception_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_exception_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_exception_intercept_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_exception_intercept_message>())).header as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 44,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_interruption_deliverable_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_interruption_deliverable_message>(),\\n\\n 48usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_interruption_deliverable_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_interruption_deliverable_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_interruption_deliverable_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_interruption_deliverable_message>())).header as *const _\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 45,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_memory_access_info() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_memory_access_info>(),\\n\\n 1usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_memory_access_info))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_memory_access_info>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_memory_access_info))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_memory_access_info>())).as_uint8 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_memory_access_info),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 46,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_register_access_info() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_register_access_info>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_register_access_info))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_register_access_info>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_register_access_info))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_register_access_info>())).source_value as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_register_access_info),\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 47,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_port_id__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_port_id__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_port_id__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_port_id__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_port_id__bindgen_ty_1))\\n\\n );\\n\\n}\\n\\nimpl hv_port_id__bindgen_ty_1 {\\n\\n #[inline]\\n\\n pub fn id(&self) -> __u32 {\\n\\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 24u8) as u32) }\\n\\n }\\n\\n #[inline]\\n\\n pub fn set_id(&mut self, val: __u32) {\\n\\n unsafe {\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 48,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_interrupt_control__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_interrupt_control__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_interrupt_control__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_interrupt_control__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_interrupt_control__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_interrupt_control__bindgen_ty_1>())).interrupt_type\\n\\n as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 49,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_local_interrupt_controller_state() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_local_interrupt_controller_state>(),\\n\\n 176usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_local_interrupt_controller_state))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_local_interrupt_controller_state>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_local_interrupt_controller_state)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_local_interrupt_controller_state>())).apic_id as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 50,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_connection_id__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_connection_id__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_connection_id__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_connection_id__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_connection_id__bindgen_ty_1))\\n\\n );\\n\\n}\\n\\nimpl hv_connection_id__bindgen_ty_1 {\\n\\n #[inline]\\n\\n pub fn id(&self) -> __u32 {\\n\\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 24u8) as u32) }\\n\\n }\\n\\n #[inline]\\n\\n pub fn set_id(&mut self, val: __u32) {\\n\\n unsafe {\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 51,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_message_header__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_message_header__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_message_header__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_message_header__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_message_header__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_message_header__bindgen_ty_1>())).sender as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_message_header__bindgen_ty_1),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 52,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_message_flags__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_message_flags__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_message_flags__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_message_flags__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_message_flags__bindgen_ty_1))\\n\\n );\\n\\n}\\n\\nimpl hv_message_flags__bindgen_ty_1 {\\n\\n #[inline]\\n\\n pub fn msg_pending(&self) -> __u8 {\\n\\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 1u8) as u8) }\\n\\n }\\n\\n #[inline]\\n\\n pub fn set_msg_pending(&mut self, val: __u8) {\\n\\n unsafe {\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 53,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_memory_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_memory_intercept_message>(),\\n\\n 80usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_memory_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_memory_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_memory_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_memory_intercept_message>())).header as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_memory_intercept_message),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 54,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_pending_exception_event() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_pending_exception_event>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_pending_exception_event))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_pending_exception_event>(),\\n\\n 8usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_pending_exception_event))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_pending_exception_event>())).as_uint64 as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_pending_exception_event),\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 55,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_intercept_message_header() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_intercept_message_header>(),\\n\\n 40usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_intercept_message_header))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_intercept_message_header>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_intercept_message_header))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_intercept_message_header>())).vp_index as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_intercept_message_header),\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 56,\n \"score\": 59900.883896800246\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_fp_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_fp_register__bindgen_ty_1>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_fp_register__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_fp_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_fp_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_fp_register__bindgen_ty_1>())).mantissa as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 57,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_2() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_2>(),\\n\\n 96usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_vp_register_page__bindgen_ty_2))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_2>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_2>())).xmm_registers as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 58,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_xmm_control_status_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_xmm_control_status_register>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_xmm_control_status_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_xmm_control_status_register>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_xmm_control_status_register)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_xmm_control_status_register>())).as_uint128 as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 59,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_processor_features__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_processor_features__bindgen_ty_1>(),\\n\\n 16usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_partition_processor_features__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_processor_features__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_partition_processor_features__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_partition_processor_features__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 60,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_io_port_access_info() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_io_port_access_info>(),\\n\\n 1usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_io_port_access_info))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_io_port_access_info>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_x64_io_port_access_info))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_io_port_access_info>())).as_uint8 as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_x64_io_port_access_info),\\n\\n \\\"::\\\",\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 61,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_io_port_intercept_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_io_port_intercept_message>(),\\n\\n 128usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_io_port_intercept_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_io_port_intercept_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_io_port_intercept_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_io_port_intercept_message>())).header as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 62,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_explicit_suspend_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_explicit_suspend_register__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_explicit_suspend_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_explicit_suspend_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_explicit_suspend_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_explicit_suspend_register__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 63,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_intercept_suspend_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_intercept_suspend_register__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_intercept_suspend_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_intercept_suspend_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_intercept_suspend_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_intercept_suspend_register__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 64,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_msr_npiep_config_contents() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_msr_npiep_config_contents>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_msr_npiep_config_contents))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_msr_npiep_config_contents>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_msr_npiep_config_contents)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_msr_npiep_config_contents>())).as_uint64 as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 65,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_pending_virtualization_fault_event() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_pending_virtualization_fault_event>(),\\n\\n 16usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_pending_virtualization_fault_event)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_pending_virtualization_fault_event>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_pending_virtualization_fault_event)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_pending_virtualization_fault_event>())).as_uint64\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 66,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_3() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_3>(),\\n\\n 96usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_vp_register_page__bindgen_ty_3))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_3>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_3)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_3>())).segment_registers\\n\\n as *const _ as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 67,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_translate_gva_result__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_translate_gva_result__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_translate_gva_result__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_translate_gva_result__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_translate_gva_result__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_translate_gva_result__bindgen_ty_1>())).result_code\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 68,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_gpa_page_access_state_flags() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_gpa_page_access_state_flags>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_gpa_page_access_state_flags))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_gpa_page_access_state_flags>(),\\n\\n 1usize,\\n\\n concat!(\\\"Alignment of \\\", stringify!(hv_gpa_page_access_state_flags))\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_gpa_page_access_state_flags>())).as_uint64 as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\\n concat!(\\n\\n \\\"Offset of field: \\\",\\n\\n stringify!(hv_gpa_page_access_state_flags),\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 69,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_1>(),\\n\\n 128usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_vp_register_page__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_1>())).gp_registers as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 70,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_invalid_vp_register_message() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_invalid_vp_register_message>(),\\n\\n 8usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_invalid_vp_register_message))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_invalid_vp_register_message>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_invalid_vp_register_message)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_invalid_vp_register_message>())).vp_index as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 71,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_dispatch_suspend_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_dispatch_suspend_register__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_dispatch_suspend_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_dispatch_suspend_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_dispatch_suspend_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_dispatch_suspend_register__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 72,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_segment_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_segment_register__bindgen_ty_1>(),\\n\\n 2usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_segment_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_segment_register__bindgen_ty_1>(),\\n\\n 2usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_segment_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_segment_register__bindgen_ty_1>())).attributes as *const _\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 73,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_exception_info__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_exception_info__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_exception_info__bindgen_ty_1))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_exception_info__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_exception_info__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_exception_info__bindgen_ty_1 {\\n\\n #[inline]\\n\\n pub fn error_code_valid(&self) -> __u8 {\\n\\n unsafe { ::std::mem::transmute(self._bitfield_1.get(0usize, 1u8) as u8) }\\n\\n }\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 74,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_fp_control_status_register() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_fp_control_status_register>(),\\n\\n 16usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_x64_fp_control_status_register))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_fp_control_status_register>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_fp_control_status_register)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_fp_control_status_register>())).as_uint128 as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 75,\n \"score\": 58103.73913829705\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_property_page_access_tracking_config() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_property_page_access_tracking_config>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_partition_property_page_access_tracking_config)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_property_page_access_tracking_config>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_partition_property_page_access_tracking_config)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_partition_property_page_access_tracking_config>())).as_uint64\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 76,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_gpa_page_access_state__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_gpa_page_access_state__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_gpa_page_access_state__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_gpa_page_access_state__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_gpa_page_access_state__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_gpa_page_access_state__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 77,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_pending_interruption_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_pending_interruption_register__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_pending_interruption_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_pending_interruption_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_pending_interruption_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_pending_interruption_register__bindgen_ty_1>()))\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 78,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_xsave_xfem_register__bindgen_ty_2() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_xsave_xfem_register__bindgen_ty_2>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_xsave_xfem_register__bindgen_ty_2>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_2)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_xsave_xfem_register__bindgen_ty_2 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 79,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_register_intercept_message__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_register_intercept_message__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_register_intercept_message__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_register_intercept_message__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_register_intercept_message__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_register_intercept_message__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 80,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_hypercall_intercept_message__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_hypercall_intercept_message__bindgen_ty_1>(),\\n\\n 4usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_hypercall_intercept_message__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_hypercall_intercept_message__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_hypercall_intercept_message__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_hypercall_intercept_message__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 81,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_synthetic_processor_features__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_synthetic_processor_features__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_partition_synthetic_processor_features__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_synthetic_processor_features__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_partition_synthetic_processor_features__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_partition_synthetic_processor_features__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 82,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_pending_exception_event__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_pending_exception_event__bindgen_ty_1>(),\\n\\n 16usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_pending_exception_event__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_pending_exception_event__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_pending_exception_event__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_pending_exception_event__bindgen_ty_1>())).error_code\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 83,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_interrupt_state_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_interrupt_state_register__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_interrupt_state_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_interrupt_state_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_interrupt_state_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_interrupt_state_register__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 84,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_xsave_xfem_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_xsave_xfem_register__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_xsave_xfem_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_xsave_xfem_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_xsave_xfem_register__bindgen_ty_1>())).low_uint32\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 85,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_input_get_gpa_pages_access_state() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_input_get_gpa_pages_access_state>(),\\n\\n 24usize,\\n\\n concat!(\\\"Size of: \\\", stringify!(hv_input_get_gpa_pages_access_state))\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_input_get_gpa_pages_access_state>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_input_get_gpa_pages_access_state)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_input_get_gpa_pages_access_state>())).partition_id as *const _\\n\\n as usize\\n\\n },\\n\\n 0usize,\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 86,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_vp_execution_state__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_vp_execution_state__bindgen_ty_1>(),\\n\\n 2usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_vp_execution_state__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_vp_execution_state__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_vp_execution_state__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_vp_execution_state__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 87,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_partition_processor_xsave_features__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_partition_processor_xsave_features__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_partition_processor_xsave_features__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_partition_processor_xsave_features__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_partition_processor_xsave_features__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_partition_processor_xsave_features__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 88,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_memory_access_info__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_memory_access_info__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_memory_access_info__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_memory_access_info__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_memory_access_info__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_memory_access_info__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 89,\n \"score\": 56436.674801972666\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_fp_control_status_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_fp_control_status_register__bindgen_ty_1>(),\\n\\n 16usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_fp_control_status_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_fp_control_status_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_fp_control_status_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_fp_control_status_register__bindgen_ty_1>())).fp_control\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 90,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_3__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_3__bindgen_ty_1>(),\\n\\n 96usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_3__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_3__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_3__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_3__bindgen_ty_1>())).es\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 91,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_pending_virtualization_fault_event__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_pending_virtualization_fault_event__bindgen_ty_1>(),\\n\\n 16usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_pending_virtualization_fault_event__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_pending_virtualization_fault_event__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_pending_virtualization_fault_event__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_pending_virtualization_fault_event__bindgen_ty_1>())).code\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 92,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_msr_npiep_config_contents__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_msr_npiep_config_contents__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_msr_npiep_config_contents__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_msr_npiep_config_contents__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_msr_npiep_config_contents__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_msr_npiep_config_contents__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 93,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_2__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_2__bindgen_ty_1>(),\\n\\n 96usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_2__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_2__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_2__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_2__bindgen_ty_1>())).xmm0\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 94,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_vp_register_page__bindgen_ty_1__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_vp_register_page__bindgen_ty_1__bindgen_ty_1>(),\\n\\n 128usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_vp_register_page__bindgen_ty_1__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_vp_register_page__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_vp_register_page__bindgen_ty_1__bindgen_ty_1>())).rax\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 95,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_xmm_control_status_register__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_xmm_control_status_register__bindgen_ty_1>(),\\n\\n 16usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_xmm_control_status_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_xmm_control_status_register__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_xmm_control_status_register__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n unsafe {\\n\\n &(*(::std::ptr::null::<hv_x64_xmm_control_status_register__bindgen_ty_1>()))\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 96,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_gpa_page_access_state_flags__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_gpa_page_access_state_flags__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_gpa_page_access_state_flags__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_gpa_page_access_state_flags__bindgen_ty_1>(),\\n\\n 8usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_gpa_page_access_state_flags__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_gpa_page_access_state_flags__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 97,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1>(),\\n\\n 2usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_segment_register__bindgen_ty_1__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 98,\n \"score\": 54886.06099887096\n },\n {\n \"content\": \"#[test]\\n\\nfn bindgen_test_layout_hv_x64_io_port_access_info__bindgen_ty_1() {\\n\\n assert_eq!(\\n\\n ::std::mem::size_of::<hv_x64_io_port_access_info__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Size of: \\\",\\n\\n stringify!(hv_x64_io_port_access_info__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n assert_eq!(\\n\\n ::std::mem::align_of::<hv_x64_io_port_access_info__bindgen_ty_1>(),\\n\\n 1usize,\\n\\n concat!(\\n\\n \\\"Alignment of \\\",\\n\\n stringify!(hv_x64_io_port_access_info__bindgen_ty_1)\\n\\n )\\n\\n );\\n\\n}\\n\\nimpl hv_x64_io_port_access_info__bindgen_ty_1 {\\n\\n #[inline]\\n\",\n \"file_path\": \"mshv-bindings/src/bindings.rs\",\n \"rank\": 99,\n \"score\": 54886.06099887096\n }\n]","isConversational":false}}},{"rowIdx":2993,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/test/debuginfo/recursive-struct.rs"},"repo_name":{"kind":"string","value":"komaeda/rust"},"commit":{"kind":"string","value":"b2c6b8c29f13f8d1f242da89e587960b95337819"},"file_code":{"kind":"string","value":"\n\n#![allow(unused_variables)]\n#![feature(box_syntax)]\n#![feature(omit_gdb_pretty_printer_section)]\n#![omit_gdb_pretty_printer_section]\n\nuse self::Opt::{Empty, Val};\n\nenum Opt<T> {\n Empty,\n Val { val: T }\n}\n\nstruct UniqueNode<T> {\n next: Opt<Box<UniqueNode<T>>>,\n value: T\n}\n\nstruct LongCycle1<T> {\n next: Box<LongCycle2<T>>,\n value: T,\n}\n\nstruct LongCycle2<T> {\n next: Box<LongCycle3<T>>,\n value: T,\n}\n\nstruct LongCycle3<T> {\n next: Box<LongCycle4<T>>,\n value: T,\n}\n\nstruct LongCycle4<T> {\n next: Option<Box<LongCycle1<T>>>,\n value: T,\n}\n\nstruct LongCycleWithAnonymousTypes {\n next: Opt<Box<Box<Box<Box<Box<LongCycleWithAnonymousTypes>>>>>>,\n value: usize,\n}\n\nfn main() {\n let stack_unique: UniqueNode<u16> = UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 1,\n }\n },\n value: 0,\n };\n\n let unique_unique: Box<UniqueNode<u32>> = box UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 3,\n }\n },\n value: 2,\n };\n\n let vec_unique: [UniqueNode<f32>; 1] = [UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 7.5,\n }\n },\n value: 6.5,\n }];\n\n let borrowed_unique: &UniqueNode<f64> = &UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 9.5,\n }\n },\n value: 8.5,\n };\n\n \n let long_cycle1: LongCycle1<u16> = LongCycle1 {\n next: box LongCycle2 {\n next: box LongCycle3 {\n next: box LongCycle4 {\n next: None,\n value: 23,\n },\n value: 22,\n },\n value: 21\n },\n value: 20\n };\n\n let long_cycle2: LongCycle2<u32> = LongCycle2 {\n next: box LongCycle3 {\n next: box LongCycle4 {\n next: None,\n value: 26,\n },\n value: 25,\n },\n value: 24\n };\n\n let long_cycle3: LongCycle3<u64> = LongCycle3 {\n next: box LongCycle4 {\n next: None,\n value: 28,\n },\n value: 27,\n };\n\n let long_cycle4: LongCycle4<f32> = LongCycle4 {\n next: None,\n value: 29.5,\n };\n\n \n \n let long_cycle_w_anonymous_types = box box box box box LongCycleWithAnonymousTypes {\n next: Val {\n val: box box box box box LongCycleWithAnonymousTypes {\n next: Empty,\n value: 31,\n }\n },\n value: 30\n };\n\n zzz(); \n}\n\nfn zzz() {()}\n"},"prefix":{"kind":"string","value":"\n\n#![allow(unused_variables)]\n#![feature(box_syntax)]\n#![feature(omit_gdb_pretty_printer_section)]\n#![omit_gdb_pretty_printer_section]\n\nuse self::Opt::{Empty, Val};\n\nenum Opt<T> {\n Empty,\n Val { val: T }\n}\n\nstruct UniqueNode<T> {\n next: Opt<Box<UniqueNode<T>>>,\n value: T\n}\n\nstruct LongCycle1<T> {\n next: Box<LongCycle2<T>>,\n value: T,\n}\n\nstruct LongCycle2<T> {\n next: Box<LongCycle3<T>>,\n value: T,\n}\n\nstruct LongCycle3<T> {\n next: Box<LongCycle4<T>>,\n value: T,\n}\n\nstruct LongCycle4<T> {\n next: Option<Box<LongCycle1<T>>>,\n value: T,\n}\n\nstruct LongCycleWithAnonymousTypes {\n next: Opt<Box<Box<Box<Box<Box<LongCycleWithAnonymousTypes>>>>>>,\n value: usize,\n}\n\nfn main() {\n let stack_unique: UniqueNode<u16> = UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 1,\n }\n },\n value: 0,\n };\n\n "},"suffix":{"kind":"string","value":"\n\n let vec_unique: [UniqueNode<f32>; 1] = [UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 7.5,\n }\n },\n value: 6.5,\n }];\n\n let borrowed_unique: &UniqueNode<f64> = &UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 9.5,\n }\n },\n value: 8.5,\n };\n\n \n let long_cycle1: LongCycle1<u16> = LongCycle1 {\n next: box LongCycle2 {\n next: box LongCycle3 {\n next: box LongCycle4 {\n next: None,\n value: 23,\n },\n value: 22,\n },\n value: 21\n },\n value: 20\n };\n\n let long_cycle2: LongCycle2<u32> = LongCycle2 {\n next: box LongCycle3 {\n next: box LongCycle4 {\n next: None,\n value: 26,\n },\n value: 25,\n },\n value: 24\n };\n\n let long_cycle3: LongCycle3<u64> = LongCycle3 {\n next: box LongCycle4 {\n next: None,\n value: 28,\n },\n value: 27,\n };\n\n let long_cycle4: LongCycle4<f32> = LongCycle4 {\n next: None,\n value: 29.5,\n };\n\n \n \n let long_cycle_w_anonymous_types = box box box box box LongCycleWithAnonymousTypes {\n next: Val {\n val: box box box box box LongCycleWithAnonymousTypes {\n next: Empty,\n value: 31,\n }\n },\n value: 30\n };\n\n zzz(); \n}\n\nfn zzz() {()}\n"},"middle":{"kind":"string","value":"let unique_unique: Box<UniqueNode<u32>> = box UniqueNode {\n next: Val {\n val: box UniqueNode {\n next: Empty,\n value: 3,\n }\n },\n value: 2,\n };"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":2994,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"shared/rust/src/api/endpoints/jig.rs"},"repo_name":{"kind":"string","value":"corinnewo/ji-cloud"},"commit":{"kind":"string","value":"58fc898703ca0fc5b962e644dfcfbcce8547c525"},"file_code":{"kind":"string","value":"use crate::{\n api::Method,\n domain::{\n jig::{\n JigBrowseQuery, JigBrowseResponse, JigCountResponse, JigCreateRequest, JigId,\n JigResponse, JigSearchQuery, JigSearchResponse, JigUpdateDraftDataRequest,\n JigUpdateRequest,\n },\n CreateResponse,\n },\n error::{EmptyError, MetadataNotFound},\n};\n\nuse super::ApiEndpoint;\n\npub mod module;\n\npub mod additional_resource;\n\npub mod player;\n\npub struct Create;\nimpl ApiEndpoint for Create {\n type Req = JigCreateRequest;\n type Res = CreateResponse<JigId>;\n type Err = MetadataNotFound;\n const PATH: &'static str = \"/v1/jig\";\n const METHOD: Method = Method::Post;\n}\n\npub struct Update;\nimpl ApiEndpoint for Update {\n type Req = JigUpdateRequest;\n type Res = ();\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}\";\n const METHOD: Method = Method::Patch;\n}\n\npub struct GetLive;\nimpl ApiEndpoint for GetLive {\n type Req = ();\n type Res = JigResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/live\";\n const METHOD: Method = Method::Get;\n}\n\npub struct GetDraft;\nimpl ApiEndpoint for GetDraft {\n type Req = ();\n type Res = JigResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/draft\";\n const METHOD: Method = Method::Get;\n}\n\npub struct UpdateDraftData;\nimpl ApiEndpoint for UpdateDraftData {\n type Req = JigUpdateDraftDataRequest;\n type Res = ();\n type Err = MetadataNotFound;\n const PATH: &'static str = \"/v1/jig/{id}/draft\";\n const METHOD: Method = Method::Patch;\n}\n\npub struct Publish;\nimpl ApiEndpoint for Publish {\n type Req = ();\n type Res = ();\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/draft/publish\";\n const METHOD: Method = Method::Put;\n}\n\npub struct Browse;\nimpl ApiEndpoint for Browse {\n type Req = JigBrowseQuery;\n type Res = JigBrowseResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/browse\";\n const METHOD: Method = Method::Get;\n}\n\npub struct Search;\nimpl ApiEndpoint for Search {\n type Req = JigSearchQuery;\n type Res = JigSearchResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig\";\n const METHOD: Method = Method::Get;\n}\n\npub struct Clone;\nimpl ApiEndpoint for Clone {\n type Req = ();\n type Res = CreateResponse<JigId>;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/clone\";\n const METHOD: Method = Method::Post;\n}\n\npub struct Delete;\nimpl ApiEndpoint for Delete {\n type Req = ();\n type Res = ();\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}\";\n const METHOD: Method = Method::Delete;\n}\n\npub struct Count;\nimpl ApiEndpoint for Count {\n type Req = ();\n type Res = JigCountResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/count\";\n const METHOD: Method = Method::Get;\n}\n"},"prefix":{"kind":"string","value":"use crate::{\n api::Method,\n domain::{\n jig::{\n JigBrowseQuery, JigBrowseResponse, JigCountResponse, JigCreateRequest, JigId,\n JigResponse, JigSearchQuery, JigSearchResponse, JigUpdateDraftDataRequest,\n JigUpdateRequest,\n },\n CreateResponse,\n },\n error::{EmptyError, MetadataNotFound},\n};\n\nuse super::ApiEndpoint;\n\npub"},"suffix":{"kind":"string","value":"ApiEndpoint for Browse {\n type Req = JigBrowseQuery;\n type Res = JigBrowseResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/browse\";\n const METHOD: Method = Method::Get;\n}\n\npub struct Search;\nimpl ApiEndpoint for Search {\n type Req = JigSearchQuery;\n type Res = JigSearchResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig\";\n const METHOD: Method = Method::Get;\n}\n\npub struct Clone;\nimpl ApiEndpoint for Clone {\n type Req = ();\n type Res = CreateResponse<JigId>;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/clone\";\n const METHOD: Method = Method::Post;\n}\n\npub struct Delete;\nimpl ApiEndpoint for Delete {\n type Req = ();\n type Res = ();\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}\";\n const METHOD: Method = Method::Delete;\n}\n\npub struct Count;\nimpl ApiEndpoint for Count {\n type Req = ();\n type Res = JigCountResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/count\";\n const METHOD: Method = Method::Get;\n}\n"},"middle":{"kind":"string","value":" mod module;\n\npub mod additional_resource;\n\npub mod player;\n\npub struct Create;\nimpl ApiEndpoint for Create {\n type Req = JigCreateRequest;\n type Res = CreateResponse<JigId>;\n type Err = MetadataNotFound;\n const PATH: &'static str = \"/v1/jig\";\n const METHOD: Method = Method::Post;\n}\n\npub struct Update;\nimpl ApiEndpoint for Update {\n type Req = JigUpdateRequest;\n type Res = ();\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}\";\n const METHOD: Method = Method::Patch;\n}\n\npub struct GetLive;\nimpl ApiEndpoint for GetLive {\n type Req = ();\n type Res = JigResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/live\";\n const METHOD: Method = Method::Get;\n}\n\npub struct GetDraft;\nimpl ApiEndpoint for GetDraft {\n type Req = ();\n type Res = JigResponse;\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/draft\";\n const METHOD: Method = Method::Get;\n}\n\npub struct UpdateDraftData;\nimpl ApiEndpoint for UpdateDraftData {\n type Req = JigUpdateDraftDataRequest;\n type Res = ();\n type Err = MetadataNotFound;\n const PATH: &'static str = \"/v1/jig/{id}/draft\";\n const METHOD: Method = Method::Patch;\n}\n\npub struct Publish;\nimpl ApiEndpoint for Publish {\n type Req = ();\n type Res = ();\n type Err = EmptyError;\n const PATH: &'static str = \"/v1/jig/{id}/draft/publish\";\n const METHOD: Method = Method::Put;\n}\n\npub struct Browse;\nimpl "},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"pub fn delete_jig(state: Rc<State>, jig_id: JigId) {\n\n state.loader.load(clone!(state => async move {\n\n let path = Delete::PATH.replace(\"{id}\",&jig_id.0.to_string());\n\n match api_with_auth_empty::<EmptyError, ()>(&path, Delete::METHOD, None).await {\n\n Ok(_) => {\n\n state.jigs.lock_mut().retain(|jig| {\n\n jig.id != jig_id\n\n });\n\n },\n\n Err(_) => {}\n\n }\n\n }));\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs","rank":0,"score":248539.08709984063},{"content":"pub fn copy_jig(state: Rc<State>, jig_id: &JigId) {\n\n let path = Clone::PATH.replace(\"{id}\", &jig_id.0.to_string());\n\n\n\n state.loader.load(clone!(state => async move {\n\n match api_with_auth::<CreateResponse<JigId>, EmptyError, ()>(&path, Clone::METHOD, None).await {\n\n Ok(resp) => {\n\n\n\n let path = GetDraft::PATH.replace(\"{id}\", &resp.id.0.to_string());\n\n match api_with_auth::<JigResponse, EmptyError, ()>(&path, GetDraft::METHOD, None).await {\n\n Ok(resp) => {\n\n state.jigs.lock_mut().push_cloned(resp);\n\n },\n\n Err(_) => {},\n\n };\n\n\n\n },\n\n Err(_) => {},\n\n };\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs","rank":1,"score":248539.08709984063},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n stickers: vec![\n\n InitSticker::Text, //InitSticker::Sprite\n\n ],\n\n }))).unwrap_ji();\n\n \n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/cover/edit/src/debug.rs","rank":2,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n stickers: vec![\n\n InitSticker::Text, //InitSticker::Sprite\n\n ],\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/poster/play/src/debug.rs","rank":3,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: false }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/memory/edit/src/debug.rs","rank":4,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n stickers: vec![\n\n InitSticker::Text, //InitSticker::Sprite\n\n ],\n\n }))).unwrap_ji();\n\n \n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/poster/edit/src/debug.rs","rank":5,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, _module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS\n\n .set(DebugSettings::debug(Some(InitData {\n\n stickers: vec![\n\n InitSticker::Text,\n\n InitSticker::Video, //InitSticker::Sprite\n\n ],\n\n })))\n\n .unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/video/play/src/debug.rs","rank":6,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n with_pairs: true\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/flashcards/play/src/debug.rs","rank":7,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, _module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS\n\n .set(DebugSettings::debug(Some(InitData {\n\n stickers: vec![\n\n // InitSticker::Text, InitSticker::Sprite\n\n ],\n\n })))\n\n .unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/video/edit/src/debug.rs","rank":8,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n //SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: true }))).unwrap_ji();\n\n SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/flashcards/edit/src/debug.rs","rank":9,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n stickers: vec![\n\n InitSticker::Text, //InitSticker::Sprite\n\n ],\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/cover/play/src/debug.rs","rank":10,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n with_pairs: true\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/memory/play/src/debug.rs","rank":11,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n with_pairs: true\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/matching/play/src/debug.rs","rank":12,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n //SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: true }))).unwrap_ji();\n\n SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/matching/edit/src/debug.rs","rank":13,"score":243115.3589902591},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n with_pairs: true\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/card-quiz/play/src/debug.rs","rank":14,"score":241545.9922149301},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: true }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/card-quiz/edit/src/debug.rs","rank":15,"score":241545.9922149301},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n stickers: vec![\n\n InitSticker::Text,// InitSticker::Sprite\n\n ],\n\n traces: vec![\n\n InitTrace::Ellipse(0.3, 0.4, 0.2, 0.1),\n\n InitTrace::Ellipse(0.1, 0.1, 0.1, 0.1),\n\n ]\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/tapping-board/play/src/debug.rs","rank":16,"score":241545.9922149301},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n stickers: vec![\n\n (InitSticker::Text, ItemKind::Static, (0.3, 0.3)),\n\n /*\n\n (\n\n InitSticker::Text, \n\n ItemKind::Interactive(\n\n Interactive {\n\n audio: None,\n\n target_transform: {\n\n let mut t = Transform::identity();\n\n Some(t)\n\n }\n\n }\n\n ),\n\n (-0.3, -0.3)\n\n ),\n\n */\n","file_path":"frontend/apps/crates/entry/module/drag-drop/play/src/debug.rs","rank":17,"score":241545.9922149301},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n\n\n stickers: vec![\n\n (InitSticker::Text, ItemKind::Static, (0.3, 0.3)),\n\n (\n\n InitSticker::Text, \n\n ItemKind::Interactive(\n\n Interactive {\n\n audio: None,\n\n target_transform: None,\n\n }\n\n ),\n\n (-0.3, -0.3)\n\n ),\n\n (\n\n InitSticker::Sprite, \n\n ItemKind::Interactive(\n\n Interactive {\n","file_path":"frontend/apps/crates/entry/module/drag-drop/edit/src/debug.rs","rank":18,"score":241545.9922149301},{"content":"pub fn init(jig_id: JigId, module_id: ModuleId) {\n\n if jig_id == JigId(Uuid::from_u128(0)) {\n\n SETTINGS.set(DebugSettings::debug(Some(InitData{\n\n stickers: vec![\n\n InitSticker::Text, //InitSticker::Sprite\n\n ],\n\n traces: vec![\n\n InitTrace::Ellipse(0.3, 0.4, 0.2, 0.1)\n\n ]\n\n }))).unwrap_ji();\n\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\n\n } else {\n\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/tapping-board/edit/src/debug.rs","rank":19,"score":241545.9922149301},{"content":"pub fn render(jig_id: JigId, jig_edit_state: Rc<JigEditState>) -> Dom {\n\n let state = Rc::new(State::new(jig_id, jig_edit_state));\n\n\n\n let share_anchor = html!(\"post-publish-action\", {\n\n .property(\"kind\", \"share\")\n\n .property_signal(\"active\", state.share_state.active_popup.signal_cloned().map(|active| active.is_some()))\n\n });\n\n\n\n html!(\"post-publish\", {\n\n .property(\"slot\", \"main\")\n\n .children(&mut [\n\n share_jig::dom::render(Rc::clone(&state.share_state), share_anchor, Some(\"actions\")),\n\n html!(\"post-publish-action\", {\n\n .property(\"slot\", \"actions\")\n\n .property(\"kind\", \"new-jig\")\n\n .event(clone!(state => move |_: events::Click| {\n\n actions::create_jig(Rc::clone(&state));\n\n }))\n\n }),\n\n html!(\"post-publish-action\", {\n\n .property(\"kind\", \"play-jig\")\n\n .property(\"slot\", \"actions\")\n\n .event(clone!(state => move |_: events::Click| {\n\n state.jig_edit_state.play_jig.set(Some(JigPlayerSettings::default()));\n\n }))\n\n }),\n\n ])\n\n })\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/post_publish/dom.rs","rank":20,"score":239177.57089070458},{"content":"pub trait JigAudioExt {\n\n fn display_name(&self) -> &'static str;\n\n}\n\n\n\n\n\nimpl JigAudioExt for AudioBackground {\n\n fn display_name(&self) -> &'static str {\n\n match self {\n\n AudioBackground::FunForKids => \"Fun for Kids\",\n\n AudioBackground::DancingHappy => \"Dancing Happy\",\n\n AudioBackground::Jigzi1 => \"Jigzi 1\",\n\n AudioBackground::Jigzi2 => \"Jigzi 2\",\n\n AudioBackground::Jigzi3 => \"Jigzi 3\",\n\n }\n\n }\n\n}\n\n\n\n\n\nimpl JigAudioExt for AudioFeedbackPositive {\n\n fn display_name(&self) -> &'static str {\n","file_path":"frontend/apps/crates/utils/src/jig.rs","rank":21,"score":234334.54934916346},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.is_main_scrollable = false;\n\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/poster/edit/src/state.rs","rank":22,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/cover/play/src/state.rs","rank":23,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n","file_path":"frontend/apps/crates/entry/module/flashcards/play/src/state.rs","rank":24,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n let debug_settings = crate::debug::settings();\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = debug_settings.data.clone();\n\n opts.is_main_scrollable = true;\n\n opts.skip_save_for_debug = debug_settings.skip_save; \n\n opts.skip_load_jig = debug_settings.skip_load_jig; \n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\n\n\n\n\n\n let force_step = {\n","file_path":"frontend/apps/crates/entry/module/matching/edit/src/state.rs","rank":25,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n","file_path":"frontend/apps/crates/entry/module/memory/play/src/state.rs","rank":26,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n opts.skip_play = crate::debug::settings().skip_play;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n","file_path":"frontend/apps/crates/entry/module/matching/play/src/state.rs","rank":27,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new(jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone();\n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n","file_path":"frontend/apps/crates/entry/module/video/play/src/state.rs","rank":28,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new(jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone();\n\n opts.is_main_scrollable = false;\n\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, init_from_raw)\n\n}\n","file_path":"frontend/apps/crates/entry/module/video/edit/src/state.rs","rank":29,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/poster/play/src/state.rs","rank":30,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n let debug_settings = crate::debug::settings();\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = debug_settings.data.clone();\n\n opts.is_main_scrollable = true;\n\n opts.skip_save_for_debug = debug_settings.skip_save; \n\n opts.skip_load_jig = debug_settings.skip_load_jig; \n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\n\n\n\n\n\n let force_step = {\n","file_path":"frontend/apps/crates/entry/module/flashcards/edit/src/state.rs","rank":31,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n let debug_settings = crate::debug::settings();\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = debug_settings.data.clone();\n\n opts.is_main_scrollable = true;\n\n opts.skip_save_for_debug = debug_settings.skip_save; \n\n opts.skip_load_jig = debug_settings.skip_load_jig; \n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\n\n\n\n\n\n let force_step = {\n","file_path":"frontend/apps/crates/entry/module/memory/edit/src/state.rs","rank":32,"score":228977.7836843365},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.is_main_scrollable = false;\n\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/cover/edit/src/state.rs","rank":33,"score":228977.7836843365},{"content":"pub fn use_module_as(state: Rc<State>, target_kind: ModuleKind, source_module_id: ModuleId) {\n\n state.loader.load(clone!(state => async move {\n\n let target_module_id: Result<ModuleId, EmptyError> = async {\n\n let path = endpoints::jig::module::GetDraft::PATH\n\n .replace(\"{id}\", &state.jig.id.0.to_string())\n\n .replace(\"{module_id}\", &source_module_id.0.to_string());\n\n\n\n let source_module = api_with_auth::<ModuleResponse, EmptyError, ()>(\n\n &path,\n\n endpoints::jig::module::GetDraft::METHOD,\n\n None\n\n ).await?.module;\n\n\n\n let target_body = source_module.body.convert_to_body(target_kind).unwrap_ji();\n\n\n\n let path = endpoints::jig::module::Create::PATH\n\n .replace(\"{id}\", &state.jig.id.0.to_string());\n\n\n\n let req = ModuleCreateRequest { body: target_body };\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs","rank":34,"score":228602.692312716},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n","file_path":"frontend/apps/crates/entry/module/card-quiz/play/src/state.rs","rank":35,"score":227522.57366456735},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/tapping-board/play/src/state.rs","rank":36,"score":227522.57366456735},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.is_main_scrollable = false;\n\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/drag-drop/edit/src/state.rs","rank":37,"score":227522.57366456735},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n opts.skip_play = crate::debug::settings().skip_play;\n\n\n\n AppState::new(opts, Base::new)\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/drag-drop/play/src/state.rs","rank":38,"score":227522.57366456735},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n let debug_settings = crate::debug::settings();\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = debug_settings.data.clone();\n\n opts.is_main_scrollable = true;\n\n opts.skip_save_for_debug = debug_settings.skip_save; \n\n opts.skip_load_jig = debug_settings.skip_load_jig; \n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\n\n\n\n\n\n let force_step = {\n","file_path":"frontend/apps/crates/entry/module/card-quiz/edit/src/state.rs","rank":39,"score":227522.57366456735},{"content":"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\n\n crate::debug::init(jig_id, module_id);\n\n\n\n let mut opts = StateOpts::new( jig_id, module_id);\n\n opts.force_raw = crate::debug::settings().data.clone(); \n\n opts.is_main_scrollable = false;\n\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\n\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\n\n\n\n AppState::new(\n\n opts,\n\n init_from_raw, \n\n )\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/module/tapping-board/edit/src/state.rs","rank":40,"score":227522.57366456735},{"content":"pub fn get_jig() -> JigResponse {\n\n let module_id = ModuleId(Uuid::from_u128(0));\n\n JigResponse {\n\n id: JigId(Uuid::from_u128(0)),\n\n creator_id: None,\n\n author_id: None,\n\n author_name: None,\n\n published_at: None,\n\n jig_data: JigData {\n\n draft_or_live: DraftOrLive::Draft,\n\n display_name: \"hello world\".to_string(),\n\n //TODO - delete me: https://github.com/ji-devs/ji-cloud/issues/835\n\n modules: vec![\n\n LiteModule {\n\n id: module_id,\n\n kind: ModuleKind::Cover,\n\n },\n\n LiteModule {\n\n id: module_id,\n\n kind: ModuleKind::Memory,\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/debug.rs","rank":41,"score":227378.5268293215},{"content":"/// These will all error by default.\n\n/// Modules that can be converted between eachother must override\n\n/// The relevant methods\n\npub trait BodyConvert {\n\n /// Get a list of valid conversion targets\n\n fn convertable_list() -> Vec<ModuleKind> {\n\n Vec::new()\n\n }\n\n /// Memory game\n\n fn convert_to_memory(&self) -> Result<memory::ModuleData, &'static str> {\n\n Err(\"cannot convert to memory game!\")\n\n }\n\n /// Matching\n\n fn convert_to_matching(&self) -> Result<matching::ModuleData, &'static str> {\n\n Err(\"cannot convert to matching!\")\n\n }\n\n /// Flashcards\n\n fn convert_to_flashcards(&self) -> Result<flashcards::ModuleData, &'static str> {\n\n Err(\"cannot convert to matching!\")\n\n }\n\n /// Card quiz\n\n fn convert_to_card_quiz(&self) -> Result<card_quiz::ModuleData, &'static str> {\n\n Err(\"cannot convert to card quiz!\")\n","file_path":"shared/rust/src/domain/jig/module/body.rs","rank":42,"score":225210.54739557576},{"content":"pub fn create_jig(state: Rc<State>) {\n\n state.loader.load(clone!(state => async move {\n\n let req = Some(JigCreateRequest::default());\n\n\n\n match api_with_auth::<CreateResponse<JigId>, MetadataNotFound, _>(&Create::PATH, Create::METHOD, req).await {\n\n Ok(resp) => {\n\n let url:String = Route::Jig(JigRoute::Edit(resp.id, JigEditRoute::Landing)).into();\n\n dominator::routing::go_to_url(&url);\n\n },\n\n Err(_) => {},\n\n }\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs","rank":43,"score":215721.38015605722},{"content":"pub fn load_jig(state: Rc<State>) {\n\n state.loader.load(clone!(state => async move {\n\n\n\n let resp = match state.player_options.draft {\n\n false => {\n\n let path = jig::GetLive::PATH.replace(\"{id}\", &state.jig_id.0.to_string());\n\n api_no_auth::<JigResponse, EmptyError, ()>(&path, jig::GetLive::METHOD, None).await\n\n },\n\n true => {\n\n let path = jig::GetDraft::PATH.replace(\"{id}\", &state.jig_id.0.to_string());\n\n api_no_auth::<JigResponse, EmptyError, ()>(&path, jig::GetDraft::METHOD, None).await\n\n },\n\n };\n\n\n\n match resp {\n\n Ok(resp) => {\n\n // state.active_module.set(Some(resp.jig.modules[0].clone()));\n\n state.jig.set(Some(resp));\n\n },\n\n Err(_) => {},\n\n }\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":44,"score":215721.38015605722},{"content":"pub fn item_duplicate(\n\n state: Rc<State>,\n\n sidebar_state: Rc<SidebarState>,\n\n module_id: ModuleId,\n\n) -> Dom {\n\n html!(\"menu-line\", {\n\n .property(\"slot\", \"lines\")\n\n .property(\"icon\", \"duplicate\")\n\n .event(clone!(state, module_id => move |_:events::Click| {\n\n state.close_menu();\n\n duplicate_module(sidebar_state.clone(), &module_id);\n\n }))\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/menu/dom.rs","rank":45,"score":214264.39423997732},{"content":"pub fn load_jigs_regular(state: Rc<State>) {\n\n state.loader.load(clone!(state => async move {\n\n load_jigs(Rc::clone(&state)).await\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs","rank":46,"score":214023.32184755313},{"content":"pub fn save_jig(state: Rc<State>) {\n\n if form_invalid(Rc::clone(&state)) {\n\n state.submission_tried.set(true);\n\n return;\n\n };\n\n\n\n state.loader.load(clone!(state => async move {\n\n match save_and_publish(Rc::clone(&state)).await {\n\n Ok(_) => {\n\n state.submission_tried.set(false);\n\n\n\n state.jig_edit_state.route.set_neq(JigEditRoute::PostPublish);\n\n\n\n let url: String = Route::Jig(JigRoute::Edit(state.jig.id, JigEditRoute::PostPublish)).into();\n\n log::info!(\"{}\", url);\n\n\n\n /* this will cause a full refresh - but preserves history\n\n * see the .future in EditPage too\n\n dominator::routing::go_to_url(&url);\n\n */\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/actions.rs","rank":47,"score":214023.32184755313},{"content":"pub fn create_jig(state: Rc<State>) {\n\n state.loader.load(async {\n\n let req = Some(JigCreateRequest::default());\n\n\n\n match api_with_auth::<CreateResponse<JigId>, EmptyError, _>(&jig::Create::PATH, jig::Create::METHOD, req).await {\n\n Ok(resp) => {\n\n let url:String = Route::Jig(JigRoute::Edit(resp.id, JigEditRoute::Landing)).into();\n\n dominator::routing::go_to_url(&url);\n\n },\n\n Err(_) => {},\n\n }\n\n });\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/post_publish/actions.rs","rank":48,"score":212358.93451844103},{"content":"pub fn render(jig_edit_state: Rc<JigEditState>) -> Dom {\n\n let state: Mutable<Option<Rc<State>>> = Mutable::new(None);\n\n\n\n html!(\"empty-fragment\", {\n\n .future(clone!(state => async move {\n\n let _state = State::load_new(jig_edit_state).await;\n\n state.set(Some(Rc::new(_state)));\n\n }))\n\n .property(\"slot\", \"main\")\n\n .child_signal(state.signal_cloned().map(|state| {\n\n state.map(|state| render_page(state.clone()))\n\n }))\n\n .child(html!(\"window-loader-block\", {\n\n .property_signal(\"visible\", state.signal_ref(|state| state.is_none()))\n\n }))\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/dom.rs","rank":49,"score":211407.72126942826},{"content":"pub fn update_jig_settings(state: Rc<State>) {\n\n let req = state.get_jig_update_req();\n\n\n\n let path = endpoints::jig::Update::PATH.replace(\"{id}\", &state.jig_id.0.to_string());\n\n\n\n state.loader.load(async move {\n\n match api_with_auth_empty::<EmptyError, _>(&path, endpoints::jig::Update::METHOD, Some(req)).await {\n\n Ok(_) => {}\n\n Err(_) => {}\n\n };\n\n });\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/actions.rs","rank":50,"score":210727.1915693922},{"content":"pub fn search_jigs(state: Rc<State>, q: String) {\n\n state.loader.load(clone!(state => async move {\n\n let is_published = match *state.visible_jigs.lock_ref() {\n\n VisibleJigs::All => None,\n\n VisibleJigs::Published => Some(true),\n\n VisibleJigs::Draft => Some(false),\n\n };\n\n\n\n let req = Some(JigSearchQuery {\n\n q,\n\n is_published,\n\n ..Default::default()\n\n });\n\n\n\n match api_with_auth::<JigSearchResponse, EmptyError, _>(&Search::PATH, Search::METHOD, req).await {\n\n Ok(resp) => {\n\n state.jigs.lock_mut().replace_cloned(resp.jigs);\n\n },\n\n Err(_) => {},\n\n }\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs","rank":51,"score":209518.02534352217},{"content":"pub fn get_player_settings(state: Rc<State>) -> JigPlayerSettings {\n\n let direction = state.settings.direction.get_cloned();\n\n let display_score = state.settings.display_score.get();\n\n let track_assessments = state.settings.track_assessments.get();\n\n let drag_assist = state.settings.drag_assist.get();\n\n\n\n JigPlayerSettings {\n\n direction: direction,\n\n display_score: display_score,\n\n track_assessments: track_assessments,\n\n drag_assist: drag_assist,\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs","rank":52,"score":205164.12131512404},{"content":"pub fn on_iframe_message(state: Rc<State>, message: ModuleToJigPlayerMessage) {\n\n match message {\n\n ModuleToJigPlayerMessage::AddPoints(amount) => {\n\n let mut points = state.points.lock_mut();\n\n *points += amount;\n\n }\n\n ModuleToJigPlayerMessage::Start(time) => {\n\n if let Some(time) = time {\n\n start_timer(Rc::clone(&state), time);\n\n }\n\n }\n\n ModuleToJigPlayerMessage::Next => {\n\n navigate_forward(Rc::clone(&state));\n\n },\n\n ModuleToJigPlayerMessage::Stop => {\n\n state.timer.set(None);\n\n },\n\n };\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":53,"score":203052.4454743166},{"content":"pub fn navigate_back(state: Rc<State>) {\n\n let mut active_module = state.active_module.lock_mut();\n\n if *active_module != 0 {\n\n *active_module -= 1;\n\n state.timer.set(None);\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":54,"score":202799.5205342083},{"content":"pub fn toggle_paused(state: Rc<State>) {\n\n let paused = !state.paused.get();\n\n\n\n // set state to paused\n\n state.paused.set(paused);\n\n\n\n // pause timer if exists\n\n match &*state.timer.lock_ref() {\n\n None => {}\n\n Some(timer) => {\n\n *timer.paused.borrow_mut() = paused;\n\n }\n\n }\n\n\n\n // let iframe know that paused\n\n let iframe_message = match paused {\n\n false => JigToModulePlayerMessage::Play,\n\n true => JigToModulePlayerMessage::Pause,\n\n };\n\n sent_iframe_message(Rc::clone(&state), iframe_message);\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":55,"score":202799.5205342083},{"content":"pub fn reload_iframe(state: Rc<State>) {\n\n match &*state.iframe.borrow() {\n\n None => {}\n\n Some(iframe) => {\n\n iframe.set_src(&iframe.src());\n\n state.timer.set(None);\n\n }\n\n };\n\n}\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":56,"score":202799.5205342083},{"content":"pub fn load_data(state: Rc<State>) {\n\n state.loader.load(clone!(state => async move {\n\n join!(\n\n load_jigs(Rc::clone(&state)),\n\n load_ages(Rc::clone(&state)),\n\n );\n\n }));\n\n}\n\n\n\nasync fn load_jigs(state: Rc<State>) {\n\n let is_published = match *state.visible_jigs.lock_ref() {\n\n VisibleJigs::All => None,\n\n VisibleJigs::Published => Some(true),\n\n VisibleJigs::Draft => Some(false),\n\n };\n\n\n\n let req = Some(JigBrowseQuery {\n\n is_published,\n\n author_id: Some(UserOrMe::Me),\n\n page: None,\n","file_path":"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs","rank":57,"score":202799.5205342083},{"content":"pub fn navigate_forward(state: Rc<State>) {\n\n let mut active_module = state.active_module.lock_mut();\n\n if let Some(jig) = &*state.jig.lock_ref() {\n\n if *active_module < jig.jig_data.modules.len() - 1 {\n\n\n\n *active_module += 1;\n\n state.timer.set(None);\n\n\n\n } else {\n\n\n\n state.done.set(true);\n\n\n\n }\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":58,"score":202799.5205342083},{"content":"pub fn sent_iframe_message(state: Rc<State>, data: JigToModulePlayerMessage) {\n\n let iframe_origin: String = Route::Home(HomeRoute::Home).into();\n\n let iframe_origin = unsafe {\n\n SETTINGS\n\n .get_unchecked()\n\n .remote_target\n\n .spa_iframe(&iframe_origin)\n\n };\n\n\n\n match &*state.iframe.borrow() {\n\n None => todo!(),\n\n Some(iframe) => {\n\n let m = IframeAction::new(data);\n\n let _ = iframe\n\n .content_window()\n\n .unwrap_ji()\n\n .post_message(&m.into(), &iframe_origin);\n\n }\n\n };\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":59,"score":201512.8887385088},{"content":"pub fn on_iframe_message(state: Rc<State>, message: ModuleToJigEditorMessage) {\n\n match message {\n\n ModuleToJigEditorMessage::AppendModule(module) => {\n\n populate_added_module(Rc::clone(&state), module);\n\n },\n\n ModuleToJigEditorMessage::Next => {\n\n state.collapsed.set(false);\n\n },\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs","rank":60,"score":201512.8887385088},{"content":"/// Extension trait for interop\n\n/// impl on inner body data\n\npub trait BodyExt<Mode: ModeExt, Step: StepExt>:\n\n BodyConvert + TryFrom<Body> + Serialize + DeserializeOwned + Clone + Debug\n\n{\n\n /// get choose mode list. By default it's the full list\n\n /// but that can be overridden to re-order or hide some modes\n\n fn choose_mode_list() -> Vec<Mode> {\n\n Mode::get_list()\n\n }\n\n\n\n /// get self as a Body\n\n fn as_body(&self) -> Body;\n\n\n\n /// is complete\n\n fn is_complete(&self) -> bool;\n\n\n\n /// get the kind from the type itself\n\n fn kind() -> super::ModuleKind;\n\n\n\n /// given a Mode, get a new Self\n\n /// will usually populate an inner .content\n","file_path":"shared/rust/src/domain/jig/module/body.rs","rank":61,"score":201311.56198073586},{"content":"pub fn send_report(state: Rc<State>) {\n\n state.player_state.loader.load(clone!(state => async move {\n\n let report_type = state.report_type.lock_ref();\n\n log::info!(\"Sending report: {:?}\", report_type);\n\n // TODO: actually send report\n\n state.report_status.set(ReportStatus::Sent);\n\n\n\n spawn_local(clone!(state => async move {\n\n TimeoutFuture::new(5_000).await;\n\n let mut report_status = state.report_status.lock_mut();\n\n // only update if status hasn't changed\n\n if *report_status == ReportStatus::Sent {\n\n *report_status = ReportStatus::Default;\n\n }\n\n }));\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/sidebar/actions.rs","rank":62,"score":200955.5302554462},{"content":"pub fn edit(state: Rc<State>) {\n\n if let Some(module) = &*state.module {\n\n let module_id = module.id;\n\n state.sidebar.jig_edit_state.route.set_neq(JigEditRoute::Module(module_id));\n\n state.sidebar.collapsed.set(true);\n\n\n\n let jig_id = state.sidebar.jig.id;\n\n let url: String =\n\n Route::Jig(JigRoute::Edit(jig_id, JigEditRoute::Module(module_id))).into();\n\n log::info!(\"{}\", url);\n\n\n\n /* this will cause a full refresh - but preserves history\n\n * see the .future in EditPage too\n\n dominator::routing::go_to_url(&url);\n\n */\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs","rank":63,"score":200955.5302554462},{"content":"pub fn load_ages(state: Rc<State>) {\n\n state.loader.load(clone!(state => async move {\n\n match api_no_auth::<MetadataResponse, EmptyError, ()>(meta::Get::PATH, meta::Get::METHOD, None).await {\n\n Err(_) => {},\n\n Ok(res) => {\n\n state.all_ages.set(res.age_ranges);\n\n },\n\n }\n\n }));\n\n}\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/sidebar/actions.rs","rank":64,"score":200955.53025544618},{"content":"pub fn delete(state: Rc<State>) {\n\n let index = state.index;\n\n\n\n state.sidebar.loader.load(clone!(state => async move {\n\n if let Some(module) = &*state.module {\n\n let path = endpoints::jig::module::Delete::PATH\n\n .replace(\"{id}\",&state.sidebar.jig.id.0.to_string())\n\n .replace(\"{module_id}\",&module.id.0.to_string());\n\n match api_with_auth_empty::<EmptyError, ()>(&path, endpoints::jig::module::Delete::METHOD, None).await {\n\n Ok(_) => {\n\n state.sidebar.modules.lock_mut().remove(index);\n\n },\n\n Err(_) => {}\n\n }\n\n }\n\n }));\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs","rank":65,"score":200955.53025544618},{"content":"pub fn navigate_to_publish(state: Rc<State>) {\n\n state.jig_edit_state.route.set_neq(JigEditRoute::Publish);\n\n state.collapsed.set(true);\n\n\n\n let jig_id = state.jig.id;\n\n let url: String = Route::Jig(JigRoute::Edit(jig_id, JigEditRoute::Publish)).into();\n\n log::info!(\"{}\", url);\n\n\n\n /* this will cause a full refresh - but preserves history\n\n * see the .future in EditPage too\n\n dominator::routing::go_to_url(&url);\n\n */\n\n}\n\n\n\npub async fn update_jig(jig_id: &JigId, req: JigUpdateDraftDataRequest) -> Result<(), EmptyError> {\n\n let path = endpoints::jig::Update::PATH.replace(\"{id}\", &jig_id.0.to_string());\n\n api_with_auth_empty::<EmptyError, _>(&path, endpoints::jig::Update::METHOD, Some(req)).await\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs","rank":66,"score":200955.5302554462},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n actions::load_jig(state.clone());\n\n\n\n html!(\"jig-play-landing\", {\n\n .property_signal(\"paused\", state.paused.signal())\n\n .global_event(clone!(state => move |evt:Message| {\n\n match evt.try_serde_data::<IframeAction<ModuleToJigPlayerMessage>>() {\n\n Err(_) => {},\n\n Ok(m) => {\n\n actions::on_iframe_message(Rc::clone(&state), m.data)\n\n },\n\n };\n\n }))\n\n .apply(|dom| {\n\n if state.player_options.is_student {\n\n dom\n\n } else {\n\n let sidebar_state = Rc::new(sidebar::state::State::new(state.clone()));\n\n dom.child(sidebar::dom::render(sidebar_state))\n\n }\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/dom.rs","rank":67,"score":200405.89987098478},{"content":"/// This extension trait makes it possible to keep the Step\n\n/// functionality generic and at a higher level than the module itself\n\npub trait StepExt: Copy + Default + PartialEq + Eq + Hash {\n\n /// Get the next step from current step\n\n fn next(&self) -> Option<Self>;\n\n /// Get the step as a number\n\n fn as_number(&self) -> usize;\n\n /// Label to display (will be localized)\n\n fn label(&self) -> &'static str;\n\n /// List of all available steps\n\n fn get_list() -> Vec<Self>;\n\n /// Get the step which is synonymous with \"preview\"\n\n /// TODO: this could probably be derived as a combo\n\n /// of get_list() and next() (i.e. the first step to return None)\n\n fn get_preview() -> Self;\n\n /// Auto-implemented, check whether current step is \"preview\"\n\n fn is_preview(&self) -> bool {\n\n *self == Self::get_preview()\n\n }\n\n}\n\n\n\n/// Theme Ids. Used in various modules\n","file_path":"shared/rust/src/domain/jig/module/body.rs","rank":68,"score":199199.8861399284},{"content":"/// Extenstion trait for modes\n\npub trait ModeExt: Copy + Default + PartialEq + Eq + Hash {\n\n /// get a list of all the modes\n\n /// (becomes the default in Choose page, which can be overriden in BodyExt)\n\n fn get_list() -> Vec<Self>;\n\n\n\n /// get the mode itself as a string id\n\n fn as_str_id(&self) -> &'static str;\n\n /// for headers, labels, etc.\n\n fn label(&self) -> &'static str;\n\n}\n\n\n\n/// impl ModeExt for empty modes\n\n/// this is a special case and should only be used\n\n/// where the module genuinely ignores the mode\n\n/// one example is the Cover module\n\nimpl ModeExt for () {\n\n fn get_list() -> Vec<Self> {\n\n vec![]\n\n }\n\n\n","file_path":"shared/rust/src/domain/jig/module/body.rs","rank":69,"score":199199.88613992842},{"content":"pub fn paste_module(state: Rc<State>) {\n\n match get_module_to_paste() {\n\n None => log::warn!(\"No module to paste\"),\n\n Some((jig_id, module_id)) => {\n\n state.loader.load(clone!(state => async move {\n\n\n\n let module = super::module_cloner::clone_module(&jig_id, &module_id, &state.jig.id).await.unwrap_ji();\n\n state.modules.lock_mut().push_cloned(Rc::new(Some(module)));\n\n\n\n }));\n\n }\n\n }\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/copy_paste_module.rs","rank":70,"score":197388.81648262328},{"content":"pub fn add_empty_module_after(state: Rc<State>) {\n\n state\n\n .sidebar\n\n .modules\n\n .lock_mut()\n\n .insert_cloned(state.index + 1, Rc::new(None));\n\n state.sidebar.jig_edit_state.route.set_neq(JigEditRoute::Landing);\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs","rank":71,"score":197388.81648262328},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"input-select\", {\n\n .property(\"slot\", \"goal\")\n\n .property(\"label\", STR_TEACHING_GOAL_LABEL)\n\n .property(\"placeholder\", STR_TEACHING_GOAL_PLACEHOLDER)\n\n .property(\"multiple\", true)\n\n .property_signal(\"value\", goal_value_signal(state.clone()))\n\n .property_signal(\"error\", {\n\n (map_ref! {\n\n let submission_tried = state.submission_tried.signal(),\n\n let value = state.jig.goals.signal_cloned()\n\n => (*submission_tried, value.clone())\n\n })\n\n .map(|(submission_tried, value)| {\n\n submission_tried && value.is_empty()\n\n })\n\n })\n\n .children_signal_vec(state.goals.signal_cloned().map(clone!(state => move |goals| {\n\n goals.iter().map(|goal| {\n\n render_goal(&goal, state.clone())\n\n }).collect()\n\n })).to_signal_vec())\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/goal.rs","rank":72,"score":196758.78953475785},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n\n\n let state = Rc::new(share_jig::state::State::new(state.player_state.jig_id));\n\n\n\n let anchor = html!(\"jig-play-sidebar-action\", {\n\n .property(\"kind\", \"share\")\n\n .property_signal(\"active\", state.active_popup.signal_cloned().map(|active| active.is_some()))\n\n });\n\n\n\n share_jig::dom::render(state, anchor, Some(\"actions\"))\n\n}\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/sidebar/dom/share.rs","rank":73,"score":196758.78953475785},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n load_ages(Rc::clone(&state));\n\n\n\n html!(\"jig-play-sidebar\", {\n\n .property(\"slot\", \"sidebar\")\n\n .property_signal(\"jigName\", state.player_state.jig.signal_cloned().map(|jig| {\n\n match jig {\n\n None => String::new(),\n\n Some(jig) => jig.jig_data.display_name,\n\n }\n\n }))\n\n .property_signal(\"open\", state.sidebar_open.signal())\n\n .child(html!(\"button-empty\", {\n\n .property(\"slot\", \"close\")\n\n .text(\"<\")\n\n .event(clone!(state => move |_: events::Click| {\n\n state.sidebar_open.set(false);\n\n }))\n\n }))\n\n .child(html!(\"button\", {\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/sidebar/dom/mod.rs","rank":74,"score":196758.78953475785},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"input-select\", {\n\n .property(\"slot\", \"language\")\n\n .property(\"label\", STR_LANGUAGE_LABEL)\n\n .property(\"placeholder\", STR_LANGUAGE_PLACEHOLDER)\n\n .property_signal(\"value\", language_value_signal(state.clone()))\n\n .property_signal(\"error\", {\n\n (map_ref! {\n\n let submission_tried = state.submission_tried.signal(),\n\n let value = state.jig.language.signal_cloned()\n\n => (*submission_tried, value.clone())\n\n })\n\n .map(|(submission_tried, value)| {\n\n submission_tried && value.is_empty()\n\n })\n\n })\n\n .children(state.languages.iter().map(clone!(state => move |language| {\n\n render_language(language, state.clone())\n\n })))\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/language.rs","rank":75,"score":196758.78953475785},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"input-select\", {\n\n .property(\"slot\", \"age\")\n\n .property(\"label\", STR_AGE_LABEL)\n\n .property(\"placeholder\", STR_AGE_PLACEHOLDER)\n\n .property(\"multiple\", true)\n\n .property_signal(\"value\", age_value_signal(state.clone()))\n\n .property_signal(\"error\", {\n\n (map_ref! {\n\n let submission_tried = state.submission_tried.signal(),\n\n let value = state.jig.age_ranges.signal_cloned()\n\n => (*submission_tried, value.clone())\n\n })\n\n .map(|(submission_tried, value)| {\n\n submission_tried && value.is_empty()\n\n })\n\n })\n\n .children_signal_vec(state.ages.signal_cloned().map(clone!(state => move |ages| {\n\n ages.iter().map(|age| {\n\n render_age(&age, state.clone())\n\n }).collect()\n\n })).to_signal_vec())\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/age.rs","rank":76,"score":196758.78953475785},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"anchored-overlay\", {\n\n .property(\"positionY\", \"bottom-out\")\n\n .property(\"positionX\", \"left-in\")\n\n .property(\"styled\", true)\n\n .property(\"slot\", \"actions\")\n\n .property_signal(\"open\", info_open_signal(Rc::clone(&state)))\n\n .event(clone!(state => move |_: events::Close| {\n\n state.info_popup_active.set(false);\n\n }))\n\n .child(html!(\"jig-play-sidebar-action\", {\n\n .property(\"slot\", \"anchor\")\n\n .property(\"kind\", \"info\")\n\n .property_signal(\"active\", info_open_signal(Rc::clone(&state)))\n\n .event(clone!(state => move |_: events::Click| {\n\n let mut info_popup_active = state.info_popup_active.lock_mut();\n\n *info_popup_active = !*info_popup_active;\n\n }))\n\n }))\n\n .child_signal({\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/sidebar/dom/info.rs","rank":77,"score":196758.78953475785},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"div\", {\n\n .property(\"slot\", \"category-labels\")\n\n .children_signal_vec(state.jig.categories.signal_cloned().map(clone!(state => move|categories| {\n\n categories.iter()\n\n .map(|category_id| render_pill(state.clone(), category_id.clone()))\n\n .collect()\n\n })).to_signal_vec())\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/categories_pills.rs","rank":78,"score":194995.19581939979},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"jig-settings\", {\n\n .property(\"slot\", \"overlay\")\n\n .children(&mut [\n\n html!(\"button-icon\", {\n\n .property(\"icon\", \"x\")\n\n .property(\"slot\", \"close\")\n\n .event(clone!(state => move |_:events::Click| {\n\n state.active_popup.set(None);\n\n }))\n\n }),\n\n html!(\"jig-settings-button\", {\n\n .property(\"slot\", \"creator\")\n\n .property(\"kind\", \"theme\")\n\n .event(clone!(state => move|_: events::Click| {\n\n set_active_popup(Rc::clone(&state), ActiveSettingsPopup::Theme);\n\n }))\n\n }),\n\n html!(\"jig-settings-button\", {\n\n .property(\"slot\", \"creator\")\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/main.rs","rank":79,"score":194995.19581939979},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"anchored-overlay\", {\n\n .class(class! {\n\n .pseudo!(\"::part(overlay)\", {\n\n .style(\"z-index\", \"2\")\n\n })\n\n })\n\n .property(\"slot\", \"settings\")\n\n .property(\"positionX\", \"right-out\")\n\n .property(\"positionY\", \"top-in\")\n\n .property(\"styled\", true)\n\n .property_signal(\"open\", state.active_popup.signal_cloned().map(|x| x.is_some()))\n\n .event(clone!(state => move |_: events::Close| {\n\n state.active_popup.set(None);\n\n }))\n\n .child(html!(\"jig-edit-sidebar-action-button\", {\n\n .property(\"slot\", \"anchor\")\n\n .property(\"kind\", \"settings\")\n\n .event(clone!(state => move |_: events::Click| {\n\n let mut active_popup = state.active_popup.lock_mut();\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/mod.rs","rank":80,"score":194995.19581939979},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n let audio_handles: Vec<Mutable<Option<AudioHandle>>> = AudioBackground::variants().iter().map(|_| Mutable::new(None)).collect();\n\n let audio_handles = Rc::new(audio_handles);\n\n\n\n html!(\"jig-audio-body\", {\n\n .property(\"slot\", \"overlay\")\n\n .property(\"kind\", \"background\")\n\n .children(&mut [\n\n html!(\"button-rect\", {\n\n .property(\"kind\", \"text\")\n\n .property(\"slot\", \"back\")\n\n .property(\"color\", \"blue\")\n\n .child(html!(\"fa-icon\", {.property(\"icon\", \"fa-light fa-chevron-left\")}))\n\n .text(STR_BACK_TO_SETTINGS)\n\n .event(clone!(state => move|_: events::Click| {\n\n set_active_popup(Rc::clone(&state), ActiveSettingsPopup::Main);\n\n }))\n\n }),\n\n html!(\"button-icon\", {\n\n .property(\"icon\", \"x\")\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/background.rs","rank":81,"score":194995.19581939979},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"jig-settings-themes\", {\n\n .property(\"slot\", \"overlay\")\n\n .children(&mut [\n\n html!(\"button-rect\", {\n\n .property(\"kind\", \"text\")\n\n .property(\"slot\", \"back\")\n\n .property(\"color\", \"blue\")\n\n .child(html!(\"fa-icon\", {.property(\"icon\", \"fa-light fa-chevron-left\")}))\n\n .text(STR_BACK_TO_SETTINGS)\n\n .event(clone!(state => move|_: events::Click| {\n\n set_active_popup(Rc::clone(&state), ActiveSettingsPopup::Main);\n\n }))\n\n }),\n\n html!(\"button-icon\", {\n\n .property(\"icon\", \"x\")\n\n .property(\"slot\", \"close\")\n\n .event(clone!(state => move |_:events::Click| {\n\n state.active_popup.set(None);\n\n }))\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/themes.rs","rank":82,"score":194995.19581939979},{"content":"pub fn render(state: Rc<State>) -> Dom {\n\n html!(\"input-select\", {\n\n .property(\"slot\", \"catagories-select\")\n\n .property(\"label\", STR_CATEGORIES_LABEL)\n\n .property(\"placeholder\", STR_CATEGORIES_PLACEHOLDER)\n\n .property(\"multiple\", true)\n\n .property_signal(\"value\", category_value_signal(state.clone()))\n\n .property_signal(\"error\", {\n\n (map_ref! {\n\n let submission_tried = state.submission_tried.signal(),\n\n let value = state.jig.categories.signal_cloned()\n\n => (*submission_tried, value.clone())\n\n })\n\n .map(|(submission_tried, value)| {\n\n submission_tried && value.is_empty()\n\n })\n\n })\n\n .children_signal_vec(state.categories.signal_cloned().map(clone!(state => move |categories| {\n\n render_categories(state.clone(), &categories)\n\n })).to_signal_vec())\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/categories_select.rs","rank":83,"score":194995.19581939979},{"content":"pub fn start_timer(state: Rc<State>, time: u32) {\n\n let timer = Timer::new(time);\n\n\n\n spawn_local(timer.time.signal().for_each(clone!(state => move|time| {\n\n if time == 0 {\n\n sent_iframe_message(Rc::clone(&state), JigToModulePlayerMessage::TimerDone);\n\n }\n\n async {}\n\n })));\n\n\n\n state.timer.set(Some(timer));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":84,"score":194647.1136939504},{"content":"pub fn published_at_string(time: DateTime<Utc>, short: bool) -> String {\n\n let millis_since_published = Utc::now().timestamp_millis() - time.timestamp_millis();\n\n let millis_since_published = millis_since_published as u64;\n\n\n\n let unit = PublishedAtUnit::new(millis_since_published);\n\n\n\n match short {\n\n true => format!(\"{} {} ago\", unit.get_number(), unit.to_string_short()),\n\n false => {\n\n let num = unit.get_number();\n\n match num {\n\n 1 => format!(\"1 {} ago\", unit.to_string_long()),\n\n num => format!(\"{} {}s ago\", num, unit.to_string_long()),\n\n }\n\n },\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Clone, Debug)]\n\npub struct JigPlayerOptions {\n","file_path":"frontend/apps/crates/utils/src/jig.rs","rank":85,"score":194573.45797245312},{"content":"pub fn player_settings_change_signal(state: Rc<State>) -> impl Signal<Item = JigPlayerSettings> {\n\n let sig = map_ref! {\n\n let direction = state.settings.direction.signal_cloned(),\n\n let display_score = state.settings.display_score.signal(),\n\n let track_assessments = state.settings.track_assessments.signal(),\n\n let drag_assist = state.settings.drag_assist.signal()\n\n => ( direction.clone(), display_score.clone(), track_assessments.clone(), drag_assist.clone())\n\n };\n\n\n\n sig.map(\n\n |(direction, display_score, track_assessments, drag_assist)| JigPlayerSettings {\n\n direction: direction.clone(),\n\n display_score: display_score.clone(),\n\n track_assessments: track_assessments.clone(),\n\n drag_assist: drag_assist.clone(),\n\n },\n\n )\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs","rank":86,"score":193508.76901011646},{"content":"pub fn render(_state: Rc<State>) -> Vec<Dom> {\n\n vec![\n\n html!(\"jig-edit-publish-add-resource\", {\n\n .property(\"slot\", \"additional-resources\")\n\n .property(\"label\", \"Add Lesson Plan\")\n\n .children(&mut [\n\n html!(\"jig-edit-publish-add-resource-method\", {\n\n .property(\"slot\", \"add-method\")\n\n .property(\"kind\", \"upload\")\n\n }),\n\n html!(\"jig-edit-publish-add-resource-method\", {\n\n .property(\"slot\", \"add-method\")\n\n .property(\"kind\", \"link\")\n\n }),\n\n ])\n\n }),\n\n html!(\"jig-edit-publish-add-resource\", {\n\n .property(\"slot\", \"additional-resources\")\n\n .property(\"label\", \"Add Curriculum\")\n\n }),\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/additional_resources.rs","rank":87,"score":191158.16700594337},{"content":"pub fn update_display_name(state: Rc<State>, value: String) {\n\n state.loader.load(clone!(state => async move {\n\n state.name.set(value.clone());\n\n\n\n let req = JigUpdateDraftDataRequest {\n\n display_name: Some(value),\n\n ..Default::default()\n\n };\n\n\n\n match update_jig(&state.jig.id, req).await {\n\n Ok(_) => {},\n\n Err(_) => {},\n\n }\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs","rank":88,"score":191158.16700594337},{"content":"pub fn assign_kind(state: Rc<State>, kind: ModuleKind) {\n\n state.sidebar.loader.load(clone!(state => async move {\n\n let req = Some(ModuleCreateRequest {\n\n body: ModuleBody::new(kind),\n\n });\n\n let path = endpoints::jig::module::Create::PATH.replace(\"{id}\",&state.sidebar.jig.id.0.to_string());\n\n\n\n match api_with_auth::<CreateResponse<ModuleId>, EmptyError, _>(&path, endpoints::jig::module::Create::METHOD, req).await {\n\n Ok(resp) => {\n\n let id = resp.id;\n\n let index = state.index;\n\n let module = Rc::new(Some(LiteModule {\n\n id,\n\n kind,\n\n }));\n\n state.sidebar.modules.lock_mut().set_cloned(index, module);\n\n let req = ModuleUpdateRequest {\n\n id: StableOrUniqueId::Unique(id.clone()),\n\n index: Some(index.try_into().unwrap_ji()),\n\n body: None,\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs","rank":89,"score":189469.82433102033},{"content":"pub fn duplicate_module(state: Rc<State>, module_id: &ModuleId) {\n\n state.loader.load(clone!(state, module_id => async move {\n\n let module = super::module_cloner::clone_module(&state.jig.id, &module_id, &state.jig.id).await.unwrap_ji();\n\n state.modules.lock_mut().push_cloned(Rc::new(Some(module)));\n\n }));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs","rank":90,"score":189469.82433102033},{"content":"pub fn toggle_background_audio(state: Rc<State>, background_audio: AudioBackground) {\n\n let mut bg_audio_handle = state.bg_audio_handle.borrow_mut();\n\n\n\n match &*bg_audio_handle {\n\n Some(bg_audio_handle) => {\n\n if state.bg_audio_playing.get() {\n\n bg_audio_handle.pause();\n\n state.bg_audio_playing.set(false);\n\n } else {\n\n bg_audio_handle.play();\n\n state.bg_audio_playing.set(true);\n\n };\n\n },\n\n None => {\n\n let handle = AUDIO_MIXER.with(|mixer| mixer.add_source(background_audio.as_source(), AudioClipOptions {\n\n auto_play: true,\n\n is_loop: true,\n\n on_ended: None::<fn()>,\n\n }));\n\n\n\n *bg_audio_handle = Some(handle);\n\n state.bg_audio_playing.set(true);\n\n },\n\n };\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/play/src/player/actions.rs","rank":91,"score":189469.82433102033},{"content":"pub fn render(state: Rc<State>, query: String, jigs: Rc<MutableVec<JigResponse>>) -> Dom {\n\n html!(\"home-search-results\", {\n\n .property_signal(\"resultsCount\", jigs.signal_vec_cloned().len().map(|len| len as u32))\n\n .property(\"query\", &query)\n\n .child(\n\n html!(\"home-search-results-section\", {\n\n .property(\"slot\", \"sections\")\n\n .property_signal(\"resultsCount\", jigs.signal_vec_cloned().len().map(|len| len as u32))\n\n .children_signal_vec(jigs.signal_vec_cloned().map(clone!(state => move |jig| {\n\n render_result(state.clone(), &jig)\n\n })))\n\n })\n\n )\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/home/src/home/dom/search_results.rs","rank":92,"score":189388.43379093357},{"content":"pub fn mouse_down(state: Rc<State>, x: i32, y: i32) {\n\n state\n\n .sidebar\n\n .drag\n\n .set(Some(Rc::new(DragState::new(state.clone(), x, y))));\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs","rank":93,"score":189327.73865524252},{"content":"pub fn move_index(state: Rc<State>, move_target: MoveTarget) {\n\n state.sidebar.loader.load(clone!(state => async move {\n\n if let Some(module) = &*state.module {\n\n if let Some(target) = {\n\n match move_target {\n\n MoveTarget::Up if state.index > 1 => {\n\n Some(state.index-1)\n\n },\n\n MoveTarget::Down if state.index < state.total_len-1 => {\n\n Some(state.index+1)\n\n },\n\n MoveTarget::Any(target) => Some(target),\n\n _ => None\n\n }\n\n } {\n\n state.sidebar.modules.lock_mut().move_from_to(state.index, target);\n\n let req = ModuleUpdateRequest {\n\n id: StableOrUniqueId::Unique(module.id.clone()),\n\n index: Some(target.try_into().unwrap_ji()),\n\n body: None,\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs","rank":94,"score":187817.3137368678},{"content":"pub fn mouse_up(sidebar: Rc<SidebarState>, _x: i32, _y: i32) {\n\n if let Some(_drag) = sidebar.drag.replace(None) {\n\n sidebar.drag_target_index.set_neq(None);\n\n }\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/dragging/actions.rs","rank":95,"score":187602.38568259357},{"content":"pub fn copy_module(state: Rc<State>, module_id: &ModuleId) {\n\n let value = format!(\"{},{}\", &state.jig.id.0, &module_id.0);\n\n\n\n let local_storage = get_local_storage().unwrap_ji();\n\n\n\n local_storage.set(COPY_MODULE_KEY, &value).unwrap_ji();\n\n}\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/copy_paste_module.rs","rank":96,"score":186199.50649253704},{"content":"pub fn render(state: Rc<State>, tab: FeedbackTab) -> Dom {\n\n html!(\"jig-audio-body\", {\n\n .property(\"slot\", \"overlay\")\n\n .property(\"kind\", \"feedback\")\n\n .children(&mut [\n\n html!(\"label\", {\n\n .property(\"slot\", \"correct-mistake\")\n\n .child(html!(\"input\", {\n\n .property(\"name\", \"correct-mistake\")\n\n .property(\"type\", \"radio\")\n\n .property(\"checked\", tab == FeedbackTab::Positive)\n\n .event(clone!(state => move |_:events::Input| {\n\n state.active_popup.set(Some(ActiveSettingsPopup::Feedback(FeedbackTab::Positive)));\n\n }))\n\n }))\n\n .text(STR_CORRECT)\n\n }),\n\n html!(\"label\", {\n\n .property(\"slot\", \"correct-mistake\")\n\n .child(html!(\"input\", {\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/feedback.rs","rank":97,"score":185940.53795790568},{"content":"//Mouse movements are triggered from sidebar regardless of\n\n//whether drag state exists yet or not\n\npub fn mouse_move(sidebar: Rc<SidebarState>, x: i32, y: i32) {\n\n //update via ref not lock_mut\n\n //otherwise it will replace the drag and cause a re-render\n\n //with every update\n\n //internally, drag uses Mutable and Atomic so this works in Rc\n\n if let Some(drag) = &*sidebar.drag.lock_ref() {\n\n drag.inner.update(x, y);\n\n }\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/dragging/actions.rs","rank":98,"score":185914.04300767052},{"content":"pub fn render(state: Rc<State>, items: Vec<Dom>) -> Dom {\n\n html!(\"menu-kebab\", {\n\n .property(\"slot\", \"menu\")\n\n .child(html!(\"jig-edit-sidebar-module-menu\", {\n\n .children(items)\n\n }))\n\n .after_inserted(clone!(state => move |elem| {\n\n *state.menu_ref.borrow_mut() = Some(elem);\n\n }))\n\n })\n\n}\n\n\n","file_path":"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/menu/dom.rs","rank":99,"score":185914.04300767052}],"string":"[\n {\n \"content\": \"pub fn delete_jig(state: Rc<State>, jig_id: JigId) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n let path = Delete::PATH.replace(\\\"{id}\\\",&jig_id.0.to_string());\\n\\n match api_with_auth_empty::<EmptyError, ()>(&path, Delete::METHOD, None).await {\\n\\n Ok(_) => {\\n\\n state.jigs.lock_mut().retain(|jig| {\\n\\n jig.id != jig_id\\n\\n });\\n\\n },\\n\\n Err(_) => {}\\n\\n }\\n\\n }));\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs\",\n \"rank\": 0,\n \"score\": 248539.08709984063\n },\n {\n \"content\": \"pub fn copy_jig(state: Rc<State>, jig_id: &JigId) {\\n\\n let path = Clone::PATH.replace(\\\"{id}\\\", &jig_id.0.to_string());\\n\\n\\n\\n state.loader.load(clone!(state => async move {\\n\\n match api_with_auth::<CreateResponse<JigId>, EmptyError, ()>(&path, Clone::METHOD, None).await {\\n\\n Ok(resp) => {\\n\\n\\n\\n let path = GetDraft::PATH.replace(\\\"{id}\\\", &resp.id.0.to_string());\\n\\n match api_with_auth::<JigResponse, EmptyError, ()>(&path, GetDraft::METHOD, None).await {\\n\\n Ok(resp) => {\\n\\n state.jigs.lock_mut().push_cloned(resp);\\n\\n },\\n\\n Err(_) => {},\\n\\n };\\n\\n\\n\\n },\\n\\n Err(_) => {},\\n\\n };\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs\",\n \"rank\": 1,\n \"score\": 248539.08709984063\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n stickers: vec![\\n\\n InitSticker::Text, //InitSticker::Sprite\\n\\n ],\\n\\n }))).unwrap_ji();\\n\\n \\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/cover/edit/src/debug.rs\",\n \"rank\": 2,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n stickers: vec![\\n\\n InitSticker::Text, //InitSticker::Sprite\\n\\n ],\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/poster/play/src/debug.rs\",\n \"rank\": 3,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: false }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/memory/edit/src/debug.rs\",\n \"rank\": 4,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n stickers: vec![\\n\\n InitSticker::Text, //InitSticker::Sprite\\n\\n ],\\n\\n }))).unwrap_ji();\\n\\n \\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/poster/edit/src/debug.rs\",\n \"rank\": 5,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, _module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS\\n\\n .set(DebugSettings::debug(Some(InitData {\\n\\n stickers: vec![\\n\\n InitSticker::Text,\\n\\n InitSticker::Video, //InitSticker::Sprite\\n\\n ],\\n\\n })))\\n\\n .unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/video/play/src/debug.rs\",\n \"rank\": 6,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n with_pairs: true\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/flashcards/play/src/debug.rs\",\n \"rank\": 7,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, _module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS\\n\\n .set(DebugSettings::debug(Some(InitData {\\n\\n stickers: vec![\\n\\n // InitSticker::Text, InitSticker::Sprite\\n\\n ],\\n\\n })))\\n\\n .unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/video/edit/src/debug.rs\",\n \"rank\": 8,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n //SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: true }))).unwrap_ji();\\n\\n SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/flashcards/edit/src/debug.rs\",\n \"rank\": 9,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n stickers: vec![\\n\\n InitSticker::Text, //InitSticker::Sprite\\n\\n ],\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/cover/play/src/debug.rs\",\n \"rank\": 10,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n with_pairs: true\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/memory/play/src/debug.rs\",\n \"rank\": 11,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n with_pairs: true\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/matching/play/src/debug.rs\",\n \"rank\": 12,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n //SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: true }))).unwrap_ji();\\n\\n SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/matching/edit/src/debug.rs\",\n \"rank\": 13,\n \"score\": 243115.3589902591\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n with_pairs: true\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/card-quiz/play/src/debug.rs\",\n \"rank\": 14,\n \"score\": 241545.9922149301\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData { with_pairs: true }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/card-quiz/edit/src/debug.rs\",\n \"rank\": 15,\n \"score\": 241545.9922149301\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n stickers: vec![\\n\\n InitSticker::Text,// InitSticker::Sprite\\n\\n ],\\n\\n traces: vec![\\n\\n InitTrace::Ellipse(0.3, 0.4, 0.2, 0.1),\\n\\n InitTrace::Ellipse(0.1, 0.1, 0.1, 0.1),\\n\\n ]\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/tapping-board/play/src/debug.rs\",\n \"rank\": 16,\n \"score\": 241545.9922149301\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n stickers: vec![\\n\\n (InitSticker::Text, ItemKind::Static, (0.3, 0.3)),\\n\\n /*\\n\\n (\\n\\n InitSticker::Text, \\n\\n ItemKind::Interactive(\\n\\n Interactive {\\n\\n audio: None,\\n\\n target_transform: {\\n\\n let mut t = Transform::identity();\\n\\n Some(t)\\n\\n }\\n\\n }\\n\\n ),\\n\\n (-0.3, -0.3)\\n\\n ),\\n\\n */\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/drag-drop/play/src/debug.rs\",\n \"rank\": 17,\n \"score\": 241545.9922149301\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n\\n\\n stickers: vec![\\n\\n (InitSticker::Text, ItemKind::Static, (0.3, 0.3)),\\n\\n (\\n\\n InitSticker::Text, \\n\\n ItemKind::Interactive(\\n\\n Interactive {\\n\\n audio: None,\\n\\n target_transform: None,\\n\\n }\\n\\n ),\\n\\n (-0.3, -0.3)\\n\\n ),\\n\\n (\\n\\n InitSticker::Sprite, \\n\\n ItemKind::Interactive(\\n\\n Interactive {\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/drag-drop/edit/src/debug.rs\",\n \"rank\": 18,\n \"score\": 241545.9922149301\n },\n {\n \"content\": \"pub fn init(jig_id: JigId, module_id: ModuleId) {\\n\\n if jig_id == JigId(Uuid::from_u128(0)) {\\n\\n SETTINGS.set(DebugSettings::debug(Some(InitData{\\n\\n stickers: vec![\\n\\n InitSticker::Text, //InitSticker::Sprite\\n\\n ],\\n\\n traces: vec![\\n\\n InitTrace::Ellipse(0.3, 0.4, 0.2, 0.1)\\n\\n ]\\n\\n }))).unwrap_ji();\\n\\n //SETTINGS.set(DebugSettings::debug(None)).unwrap_ji();\\n\\n } else {\\n\\n SETTINGS.set(DebugSettings::default()).unwrap_ji();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/tapping-board/edit/src/debug.rs\",\n \"rank\": 19,\n \"score\": 241545.9922149301\n },\n {\n \"content\": \"pub fn render(jig_id: JigId, jig_edit_state: Rc<JigEditState>) -> Dom {\\n\\n let state = Rc::new(State::new(jig_id, jig_edit_state));\\n\\n\\n\\n let share_anchor = html!(\\\"post-publish-action\\\", {\\n\\n .property(\\\"kind\\\", \\\"share\\\")\\n\\n .property_signal(\\\"active\\\", state.share_state.active_popup.signal_cloned().map(|active| active.is_some()))\\n\\n });\\n\\n\\n\\n html!(\\\"post-publish\\\", {\\n\\n .property(\\\"slot\\\", \\\"main\\\")\\n\\n .children(&mut [\\n\\n share_jig::dom::render(Rc::clone(&state.share_state), share_anchor, Some(\\\"actions\\\")),\\n\\n html!(\\\"post-publish-action\\\", {\\n\\n .property(\\\"slot\\\", \\\"actions\\\")\\n\\n .property(\\\"kind\\\", \\\"new-jig\\\")\\n\\n .event(clone!(state => move |_: events::Click| {\\n\\n actions::create_jig(Rc::clone(&state));\\n\\n }))\\n\\n }),\\n\\n html!(\\\"post-publish-action\\\", {\\n\\n .property(\\\"kind\\\", \\\"play-jig\\\")\\n\\n .property(\\\"slot\\\", \\\"actions\\\")\\n\\n .event(clone!(state => move |_: events::Click| {\\n\\n state.jig_edit_state.play_jig.set(Some(JigPlayerSettings::default()));\\n\\n }))\\n\\n }),\\n\\n ])\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/post_publish/dom.rs\",\n \"rank\": 20,\n \"score\": 239177.57089070458\n },\n {\n \"content\": \"pub trait JigAudioExt {\\n\\n fn display_name(&self) -> &'static str;\\n\\n}\\n\\n\\n\\n\\n\\nimpl JigAudioExt for AudioBackground {\\n\\n fn display_name(&self) -> &'static str {\\n\\n match self {\\n\\n AudioBackground::FunForKids => \\\"Fun for Kids\\\",\\n\\n AudioBackground::DancingHappy => \\\"Dancing Happy\\\",\\n\\n AudioBackground::Jigzi1 => \\\"Jigzi 1\\\",\\n\\n AudioBackground::Jigzi2 => \\\"Jigzi 2\\\",\\n\\n AudioBackground::Jigzi3 => \\\"Jigzi 3\\\",\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nimpl JigAudioExt for AudioFeedbackPositive {\\n\\n fn display_name(&self) -> &'static str {\\n\",\n \"file_path\": \"frontend/apps/crates/utils/src/jig.rs\",\n \"rank\": 21,\n \"score\": 234334.54934916346\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.is_main_scrollable = false;\\n\\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/poster/edit/src/state.rs\",\n \"rank\": 22,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/cover/play/src/state.rs\",\n \"rank\": 23,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/flashcards/play/src/state.rs\",\n \"rank\": 24,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n let debug_settings = crate::debug::settings();\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = debug_settings.data.clone();\\n\\n opts.is_main_scrollable = true;\\n\\n opts.skip_save_for_debug = debug_settings.skip_save; \\n\\n opts.skip_load_jig = debug_settings.skip_load_jig; \\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\\n\\n\\n\\n\\n\\n let force_step = {\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/matching/edit/src/state.rs\",\n \"rank\": 25,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/memory/play/src/state.rs\",\n \"rank\": 26,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n opts.skip_play = crate::debug::settings().skip_play;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/matching/play/src/state.rs\",\n \"rank\": 27,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new(jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone();\\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/video/play/src/state.rs\",\n \"rank\": 28,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new(jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone();\\n\\n opts.is_main_scrollable = false;\\n\\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, init_from_raw)\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/video/edit/src/state.rs\",\n \"rank\": 29,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/poster/play/src/state.rs\",\n \"rank\": 30,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n let debug_settings = crate::debug::settings();\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = debug_settings.data.clone();\\n\\n opts.is_main_scrollable = true;\\n\\n opts.skip_save_for_debug = debug_settings.skip_save; \\n\\n opts.skip_load_jig = debug_settings.skip_load_jig; \\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\\n\\n\\n\\n\\n\\n let force_step = {\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/flashcards/edit/src/state.rs\",\n \"rank\": 31,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n let debug_settings = crate::debug::settings();\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = debug_settings.data.clone();\\n\\n opts.is_main_scrollable = true;\\n\\n opts.skip_save_for_debug = debug_settings.skip_save; \\n\\n opts.skip_load_jig = debug_settings.skip_load_jig; \\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\\n\\n\\n\\n\\n\\n let force_step = {\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/memory/edit/src/state.rs\",\n \"rank\": 32,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.is_main_scrollable = false;\\n\\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/cover/edit/src/state.rs\",\n \"rank\": 33,\n \"score\": 228977.7836843365\n },\n {\n \"content\": \"pub fn use_module_as(state: Rc<State>, target_kind: ModuleKind, source_module_id: ModuleId) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n let target_module_id: Result<ModuleId, EmptyError> = async {\\n\\n let path = endpoints::jig::module::GetDraft::PATH\\n\\n .replace(\\\"{id}\\\", &state.jig.id.0.to_string())\\n\\n .replace(\\\"{module_id}\\\", &source_module_id.0.to_string());\\n\\n\\n\\n let source_module = api_with_auth::<ModuleResponse, EmptyError, ()>(\\n\\n &path,\\n\\n endpoints::jig::module::GetDraft::METHOD,\\n\\n None\\n\\n ).await?.module;\\n\\n\\n\\n let target_body = source_module.body.convert_to_body(target_kind).unwrap_ji();\\n\\n\\n\\n let path = endpoints::jig::module::Create::PATH\\n\\n .replace(\\\"{id}\\\", &state.jig.id.0.to_string());\\n\\n\\n\\n let req = ModuleCreateRequest { body: target_body };\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs\",\n \"rank\": 34,\n \"score\": 228602.692312716\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/card-quiz/play/src/state.rs\",\n \"rank\": 35,\n \"score\": 227522.57366456735\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/tapping-board/play/src/state.rs\",\n \"rank\": 36,\n \"score\": 227522.57366456735\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.is_main_scrollable = false;\\n\\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/drag-drop/edit/src/state.rs\",\n \"rank\": 37,\n \"score\": 227522.57366456735\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n opts.skip_play = crate::debug::settings().skip_play;\\n\\n\\n\\n AppState::new(opts, Base::new)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/drag-drop/play/src/state.rs\",\n \"rank\": 38,\n \"score\": 227522.57366456735\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n let debug_settings = crate::debug::settings();\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = debug_settings.data.clone();\\n\\n opts.is_main_scrollable = true;\\n\\n opts.skip_save_for_debug = debug_settings.skip_save; \\n\\n opts.skip_load_jig = debug_settings.skip_load_jig; \\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\\npub async fn init_from_raw(init_args: BaseInitFromRawArgs<RawData, Mode, Step>) -> BaseInit<Step, Base, Main, Sidebar, Header, Footer, Overlay> {\\n\\n\\n\\n\\n\\n let force_step = {\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/card-quiz/edit/src/state.rs\",\n \"rank\": 39,\n \"score\": 227522.57366456735\n },\n {\n \"content\": \"pub fn create_state(jig_id: JigId, module_id: ModuleId) -> Rc<AppState> {\\n\\n crate::debug::init(jig_id, module_id);\\n\\n\\n\\n let mut opts = StateOpts::new( jig_id, module_id);\\n\\n opts.force_raw = crate::debug::settings().data.clone(); \\n\\n opts.is_main_scrollable = false;\\n\\n opts.skip_save_for_debug = crate::debug::settings().skip_save;\\n\\n opts.skip_load_jig = crate::debug::settings().skip_load_jig;\\n\\n\\n\\n AppState::new(\\n\\n opts,\\n\\n init_from_raw, \\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/module/tapping-board/edit/src/state.rs\",\n \"rank\": 40,\n \"score\": 227522.57366456735\n },\n {\n \"content\": \"pub fn get_jig() -> JigResponse {\\n\\n let module_id = ModuleId(Uuid::from_u128(0));\\n\\n JigResponse {\\n\\n id: JigId(Uuid::from_u128(0)),\\n\\n creator_id: None,\\n\\n author_id: None,\\n\\n author_name: None,\\n\\n published_at: None,\\n\\n jig_data: JigData {\\n\\n draft_or_live: DraftOrLive::Draft,\\n\\n display_name: \\\"hello world\\\".to_string(),\\n\\n //TODO - delete me: https://github.com/ji-devs/ji-cloud/issues/835\\n\\n modules: vec![\\n\\n LiteModule {\\n\\n id: module_id,\\n\\n kind: ModuleKind::Cover,\\n\\n },\\n\\n LiteModule {\\n\\n id: module_id,\\n\\n kind: ModuleKind::Memory,\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/debug.rs\",\n \"rank\": 41,\n \"score\": 227378.5268293215\n },\n {\n \"content\": \"/// These will all error by default.\\n\\n/// Modules that can be converted between eachother must override\\n\\n/// The relevant methods\\n\\npub trait BodyConvert {\\n\\n /// Get a list of valid conversion targets\\n\\n fn convertable_list() -> Vec<ModuleKind> {\\n\\n Vec::new()\\n\\n }\\n\\n /// Memory game\\n\\n fn convert_to_memory(&self) -> Result<memory::ModuleData, &'static str> {\\n\\n Err(\\\"cannot convert to memory game!\\\")\\n\\n }\\n\\n /// Matching\\n\\n fn convert_to_matching(&self) -> Result<matching::ModuleData, &'static str> {\\n\\n Err(\\\"cannot convert to matching!\\\")\\n\\n }\\n\\n /// Flashcards\\n\\n fn convert_to_flashcards(&self) -> Result<flashcards::ModuleData, &'static str> {\\n\\n Err(\\\"cannot convert to matching!\\\")\\n\\n }\\n\\n /// Card quiz\\n\\n fn convert_to_card_quiz(&self) -> Result<card_quiz::ModuleData, &'static str> {\\n\\n Err(\\\"cannot convert to card quiz!\\\")\\n\",\n \"file_path\": \"shared/rust/src/domain/jig/module/body.rs\",\n \"rank\": 42,\n \"score\": 225210.54739557576\n },\n {\n \"content\": \"pub fn create_jig(state: Rc<State>) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n let req = Some(JigCreateRequest::default());\\n\\n\\n\\n match api_with_auth::<CreateResponse<JigId>, MetadataNotFound, _>(&Create::PATH, Create::METHOD, req).await {\\n\\n Ok(resp) => {\\n\\n let url:String = Route::Jig(JigRoute::Edit(resp.id, JigEditRoute::Landing)).into();\\n\\n dominator::routing::go_to_url(&url);\\n\\n },\\n\\n Err(_) => {},\\n\\n }\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs\",\n \"rank\": 43,\n \"score\": 215721.38015605722\n },\n {\n \"content\": \"pub fn load_jig(state: Rc<State>) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n\\n\\n let resp = match state.player_options.draft {\\n\\n false => {\\n\\n let path = jig::GetLive::PATH.replace(\\\"{id}\\\", &state.jig_id.0.to_string());\\n\\n api_no_auth::<JigResponse, EmptyError, ()>(&path, jig::GetLive::METHOD, None).await\\n\\n },\\n\\n true => {\\n\\n let path = jig::GetDraft::PATH.replace(\\\"{id}\\\", &state.jig_id.0.to_string());\\n\\n api_no_auth::<JigResponse, EmptyError, ()>(&path, jig::GetDraft::METHOD, None).await\\n\\n },\\n\\n };\\n\\n\\n\\n match resp {\\n\\n Ok(resp) => {\\n\\n // state.active_module.set(Some(resp.jig.modules[0].clone()));\\n\\n state.jig.set(Some(resp));\\n\\n },\\n\\n Err(_) => {},\\n\\n }\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 44,\n \"score\": 215721.38015605722\n },\n {\n \"content\": \"pub fn item_duplicate(\\n\\n state: Rc<State>,\\n\\n sidebar_state: Rc<SidebarState>,\\n\\n module_id: ModuleId,\\n\\n) -> Dom {\\n\\n html!(\\\"menu-line\\\", {\\n\\n .property(\\\"slot\\\", \\\"lines\\\")\\n\\n .property(\\\"icon\\\", \\\"duplicate\\\")\\n\\n .event(clone!(state, module_id => move |_:events::Click| {\\n\\n state.close_menu();\\n\\n duplicate_module(sidebar_state.clone(), &module_id);\\n\\n }))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/menu/dom.rs\",\n \"rank\": 45,\n \"score\": 214264.39423997732\n },\n {\n \"content\": \"pub fn load_jigs_regular(state: Rc<State>) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n load_jigs(Rc::clone(&state)).await\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs\",\n \"rank\": 46,\n \"score\": 214023.32184755313\n },\n {\n \"content\": \"pub fn save_jig(state: Rc<State>) {\\n\\n if form_invalid(Rc::clone(&state)) {\\n\\n state.submission_tried.set(true);\\n\\n return;\\n\\n };\\n\\n\\n\\n state.loader.load(clone!(state => async move {\\n\\n match save_and_publish(Rc::clone(&state)).await {\\n\\n Ok(_) => {\\n\\n state.submission_tried.set(false);\\n\\n\\n\\n state.jig_edit_state.route.set_neq(JigEditRoute::PostPublish);\\n\\n\\n\\n let url: String = Route::Jig(JigRoute::Edit(state.jig.id, JigEditRoute::PostPublish)).into();\\n\\n log::info!(\\\"{}\\\", url);\\n\\n\\n\\n /* this will cause a full refresh - but preserves history\\n\\n * see the .future in EditPage too\\n\\n dominator::routing::go_to_url(&url);\\n\\n */\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/actions.rs\",\n \"rank\": 47,\n \"score\": 214023.32184755313\n },\n {\n \"content\": \"pub fn create_jig(state: Rc<State>) {\\n\\n state.loader.load(async {\\n\\n let req = Some(JigCreateRequest::default());\\n\\n\\n\\n match api_with_auth::<CreateResponse<JigId>, EmptyError, _>(&jig::Create::PATH, jig::Create::METHOD, req).await {\\n\\n Ok(resp) => {\\n\\n let url:String = Route::Jig(JigRoute::Edit(resp.id, JigEditRoute::Landing)).into();\\n\\n dominator::routing::go_to_url(&url);\\n\\n },\\n\\n Err(_) => {},\\n\\n }\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/post_publish/actions.rs\",\n \"rank\": 48,\n \"score\": 212358.93451844103\n },\n {\n \"content\": \"pub fn render(jig_edit_state: Rc<JigEditState>) -> Dom {\\n\\n let state: Mutable<Option<Rc<State>>> = Mutable::new(None);\\n\\n\\n\\n html!(\\\"empty-fragment\\\", {\\n\\n .future(clone!(state => async move {\\n\\n let _state = State::load_new(jig_edit_state).await;\\n\\n state.set(Some(Rc::new(_state)));\\n\\n }))\\n\\n .property(\\\"slot\\\", \\\"main\\\")\\n\\n .child_signal(state.signal_cloned().map(|state| {\\n\\n state.map(|state| render_page(state.clone()))\\n\\n }))\\n\\n .child(html!(\\\"window-loader-block\\\", {\\n\\n .property_signal(\\\"visible\\\", state.signal_ref(|state| state.is_none()))\\n\\n }))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/dom.rs\",\n \"rank\": 49,\n \"score\": 211407.72126942826\n },\n {\n \"content\": \"pub fn update_jig_settings(state: Rc<State>) {\\n\\n let req = state.get_jig_update_req();\\n\\n\\n\\n let path = endpoints::jig::Update::PATH.replace(\\\"{id}\\\", &state.jig_id.0.to_string());\\n\\n\\n\\n state.loader.load(async move {\\n\\n match api_with_auth_empty::<EmptyError, _>(&path, endpoints::jig::Update::METHOD, Some(req)).await {\\n\\n Ok(_) => {}\\n\\n Err(_) => {}\\n\\n };\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/actions.rs\",\n \"rank\": 50,\n \"score\": 210727.1915693922\n },\n {\n \"content\": \"pub fn search_jigs(state: Rc<State>, q: String) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n let is_published = match *state.visible_jigs.lock_ref() {\\n\\n VisibleJigs::All => None,\\n\\n VisibleJigs::Published => Some(true),\\n\\n VisibleJigs::Draft => Some(false),\\n\\n };\\n\\n\\n\\n let req = Some(JigSearchQuery {\\n\\n q,\\n\\n is_published,\\n\\n ..Default::default()\\n\\n });\\n\\n\\n\\n match api_with_auth::<JigSearchResponse, EmptyError, _>(&Search::PATH, Search::METHOD, req).await {\\n\\n Ok(resp) => {\\n\\n state.jigs.lock_mut().replace_cloned(resp.jigs);\\n\\n },\\n\\n Err(_) => {},\\n\\n }\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs\",\n \"rank\": 51,\n \"score\": 209518.02534352217\n },\n {\n \"content\": \"pub fn get_player_settings(state: Rc<State>) -> JigPlayerSettings {\\n\\n let direction = state.settings.direction.get_cloned();\\n\\n let display_score = state.settings.display_score.get();\\n\\n let track_assessments = state.settings.track_assessments.get();\\n\\n let drag_assist = state.settings.drag_assist.get();\\n\\n\\n\\n JigPlayerSettings {\\n\\n direction: direction,\\n\\n display_score: display_score,\\n\\n track_assessments: track_assessments,\\n\\n drag_assist: drag_assist,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs\",\n \"rank\": 52,\n \"score\": 205164.12131512404\n },\n {\n \"content\": \"pub fn on_iframe_message(state: Rc<State>, message: ModuleToJigPlayerMessage) {\\n\\n match message {\\n\\n ModuleToJigPlayerMessage::AddPoints(amount) => {\\n\\n let mut points = state.points.lock_mut();\\n\\n *points += amount;\\n\\n }\\n\\n ModuleToJigPlayerMessage::Start(time) => {\\n\\n if let Some(time) = time {\\n\\n start_timer(Rc::clone(&state), time);\\n\\n }\\n\\n }\\n\\n ModuleToJigPlayerMessage::Next => {\\n\\n navigate_forward(Rc::clone(&state));\\n\\n },\\n\\n ModuleToJigPlayerMessage::Stop => {\\n\\n state.timer.set(None);\\n\\n },\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 53,\n \"score\": 203052.4454743166\n },\n {\n \"content\": \"pub fn navigate_back(state: Rc<State>) {\\n\\n let mut active_module = state.active_module.lock_mut();\\n\\n if *active_module != 0 {\\n\\n *active_module -= 1;\\n\\n state.timer.set(None);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 54,\n \"score\": 202799.5205342083\n },\n {\n \"content\": \"pub fn toggle_paused(state: Rc<State>) {\\n\\n let paused = !state.paused.get();\\n\\n\\n\\n // set state to paused\\n\\n state.paused.set(paused);\\n\\n\\n\\n // pause timer if exists\\n\\n match &*state.timer.lock_ref() {\\n\\n None => {}\\n\\n Some(timer) => {\\n\\n *timer.paused.borrow_mut() = paused;\\n\\n }\\n\\n }\\n\\n\\n\\n // let iframe know that paused\\n\\n let iframe_message = match paused {\\n\\n false => JigToModulePlayerMessage::Play,\\n\\n true => JigToModulePlayerMessage::Pause,\\n\\n };\\n\\n sent_iframe_message(Rc::clone(&state), iframe_message);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 55,\n \"score\": 202799.5205342083\n },\n {\n \"content\": \"pub fn reload_iframe(state: Rc<State>) {\\n\\n match &*state.iframe.borrow() {\\n\\n None => {}\\n\\n Some(iframe) => {\\n\\n iframe.set_src(&iframe.src());\\n\\n state.timer.set(None);\\n\\n }\\n\\n };\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 56,\n \"score\": 202799.5205342083\n },\n {\n \"content\": \"pub fn load_data(state: Rc<State>) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n join!(\\n\\n load_jigs(Rc::clone(&state)),\\n\\n load_ages(Rc::clone(&state)),\\n\\n );\\n\\n }));\\n\\n}\\n\\n\\n\\nasync fn load_jigs(state: Rc<State>) {\\n\\n let is_published = match *state.visible_jigs.lock_ref() {\\n\\n VisibleJigs::All => None,\\n\\n VisibleJigs::Published => Some(true),\\n\\n VisibleJigs::Draft => Some(false),\\n\\n };\\n\\n\\n\\n let req = Some(JigBrowseQuery {\\n\\n is_published,\\n\\n author_id: Some(UserOrMe::Me),\\n\\n page: None,\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/gallery/actions.rs\",\n \"rank\": 57,\n \"score\": 202799.5205342083\n },\n {\n \"content\": \"pub fn navigate_forward(state: Rc<State>) {\\n\\n let mut active_module = state.active_module.lock_mut();\\n\\n if let Some(jig) = &*state.jig.lock_ref() {\\n\\n if *active_module < jig.jig_data.modules.len() - 1 {\\n\\n\\n\\n *active_module += 1;\\n\\n state.timer.set(None);\\n\\n\\n\\n } else {\\n\\n\\n\\n state.done.set(true);\\n\\n\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 58,\n \"score\": 202799.5205342083\n },\n {\n \"content\": \"pub fn sent_iframe_message(state: Rc<State>, data: JigToModulePlayerMessage) {\\n\\n let iframe_origin: String = Route::Home(HomeRoute::Home).into();\\n\\n let iframe_origin = unsafe {\\n\\n SETTINGS\\n\\n .get_unchecked()\\n\\n .remote_target\\n\\n .spa_iframe(&iframe_origin)\\n\\n };\\n\\n\\n\\n match &*state.iframe.borrow() {\\n\\n None => todo!(),\\n\\n Some(iframe) => {\\n\\n let m = IframeAction::new(data);\\n\\n let _ = iframe\\n\\n .content_window()\\n\\n .unwrap_ji()\\n\\n .post_message(&m.into(), &iframe_origin);\\n\\n }\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 59,\n \"score\": 201512.8887385088\n },\n {\n \"content\": \"pub fn on_iframe_message(state: Rc<State>, message: ModuleToJigEditorMessage) {\\n\\n match message {\\n\\n ModuleToJigEditorMessage::AppendModule(module) => {\\n\\n populate_added_module(Rc::clone(&state), module);\\n\\n },\\n\\n ModuleToJigEditorMessage::Next => {\\n\\n state.collapsed.set(false);\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs\",\n \"rank\": 60,\n \"score\": 201512.8887385088\n },\n {\n \"content\": \"/// Extension trait for interop\\n\\n/// impl on inner body data\\n\\npub trait BodyExt<Mode: ModeExt, Step: StepExt>:\\n\\n BodyConvert + TryFrom<Body> + Serialize + DeserializeOwned + Clone + Debug\\n\\n{\\n\\n /// get choose mode list. By default it's the full list\\n\\n /// but that can be overridden to re-order or hide some modes\\n\\n fn choose_mode_list() -> Vec<Mode> {\\n\\n Mode::get_list()\\n\\n }\\n\\n\\n\\n /// get self as a Body\\n\\n fn as_body(&self) -> Body;\\n\\n\\n\\n /// is complete\\n\\n fn is_complete(&self) -> bool;\\n\\n\\n\\n /// get the kind from the type itself\\n\\n fn kind() -> super::ModuleKind;\\n\\n\\n\\n /// given a Mode, get a new Self\\n\\n /// will usually populate an inner .content\\n\",\n \"file_path\": \"shared/rust/src/domain/jig/module/body.rs\",\n \"rank\": 61,\n \"score\": 201311.56198073586\n },\n {\n \"content\": \"pub fn send_report(state: Rc<State>) {\\n\\n state.player_state.loader.load(clone!(state => async move {\\n\\n let report_type = state.report_type.lock_ref();\\n\\n log::info!(\\\"Sending report: {:?}\\\", report_type);\\n\\n // TODO: actually send report\\n\\n state.report_status.set(ReportStatus::Sent);\\n\\n\\n\\n spawn_local(clone!(state => async move {\\n\\n TimeoutFuture::new(5_000).await;\\n\\n let mut report_status = state.report_status.lock_mut();\\n\\n // only update if status hasn't changed\\n\\n if *report_status == ReportStatus::Sent {\\n\\n *report_status = ReportStatus::Default;\\n\\n }\\n\\n }));\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/sidebar/actions.rs\",\n \"rank\": 62,\n \"score\": 200955.5302554462\n },\n {\n \"content\": \"pub fn edit(state: Rc<State>) {\\n\\n if let Some(module) = &*state.module {\\n\\n let module_id = module.id;\\n\\n state.sidebar.jig_edit_state.route.set_neq(JigEditRoute::Module(module_id));\\n\\n state.sidebar.collapsed.set(true);\\n\\n\\n\\n let jig_id = state.sidebar.jig.id;\\n\\n let url: String =\\n\\n Route::Jig(JigRoute::Edit(jig_id, JigEditRoute::Module(module_id))).into();\\n\\n log::info!(\\\"{}\\\", url);\\n\\n\\n\\n /* this will cause a full refresh - but preserves history\\n\\n * see the .future in EditPage too\\n\\n dominator::routing::go_to_url(&url);\\n\\n */\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs\",\n \"rank\": 63,\n \"score\": 200955.5302554462\n },\n {\n \"content\": \"pub fn load_ages(state: Rc<State>) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n match api_no_auth::<MetadataResponse, EmptyError, ()>(meta::Get::PATH, meta::Get::METHOD, None).await {\\n\\n Err(_) => {},\\n\\n Ok(res) => {\\n\\n state.all_ages.set(res.age_ranges);\\n\\n },\\n\\n }\\n\\n }));\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/sidebar/actions.rs\",\n \"rank\": 64,\n \"score\": 200955.53025544618\n },\n {\n \"content\": \"pub fn delete(state: Rc<State>) {\\n\\n let index = state.index;\\n\\n\\n\\n state.sidebar.loader.load(clone!(state => async move {\\n\\n if let Some(module) = &*state.module {\\n\\n let path = endpoints::jig::module::Delete::PATH\\n\\n .replace(\\\"{id}\\\",&state.sidebar.jig.id.0.to_string())\\n\\n .replace(\\\"{module_id}\\\",&module.id.0.to_string());\\n\\n match api_with_auth_empty::<EmptyError, ()>(&path, endpoints::jig::module::Delete::METHOD, None).await {\\n\\n Ok(_) => {\\n\\n state.sidebar.modules.lock_mut().remove(index);\\n\\n },\\n\\n Err(_) => {}\\n\\n }\\n\\n }\\n\\n }));\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs\",\n \"rank\": 65,\n \"score\": 200955.53025544618\n },\n {\n \"content\": \"pub fn navigate_to_publish(state: Rc<State>) {\\n\\n state.jig_edit_state.route.set_neq(JigEditRoute::Publish);\\n\\n state.collapsed.set(true);\\n\\n\\n\\n let jig_id = state.jig.id;\\n\\n let url: String = Route::Jig(JigRoute::Edit(jig_id, JigEditRoute::Publish)).into();\\n\\n log::info!(\\\"{}\\\", url);\\n\\n\\n\\n /* this will cause a full refresh - but preserves history\\n\\n * see the .future in EditPage too\\n\\n dominator::routing::go_to_url(&url);\\n\\n */\\n\\n}\\n\\n\\n\\npub async fn update_jig(jig_id: &JigId, req: JigUpdateDraftDataRequest) -> Result<(), EmptyError> {\\n\\n let path = endpoints::jig::Update::PATH.replace(\\\"{id}\\\", &jig_id.0.to_string());\\n\\n api_with_auth_empty::<EmptyError, _>(&path, endpoints::jig::Update::METHOD, Some(req)).await\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs\",\n \"rank\": 66,\n \"score\": 200955.5302554462\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n actions::load_jig(state.clone());\\n\\n\\n\\n html!(\\\"jig-play-landing\\\", {\\n\\n .property_signal(\\\"paused\\\", state.paused.signal())\\n\\n .global_event(clone!(state => move |evt:Message| {\\n\\n match evt.try_serde_data::<IframeAction<ModuleToJigPlayerMessage>>() {\\n\\n Err(_) => {},\\n\\n Ok(m) => {\\n\\n actions::on_iframe_message(Rc::clone(&state), m.data)\\n\\n },\\n\\n };\\n\\n }))\\n\\n .apply(|dom| {\\n\\n if state.player_options.is_student {\\n\\n dom\\n\\n } else {\\n\\n let sidebar_state = Rc::new(sidebar::state::State::new(state.clone()));\\n\\n dom.child(sidebar::dom::render(sidebar_state))\\n\\n }\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/dom.rs\",\n \"rank\": 67,\n \"score\": 200405.89987098478\n },\n {\n \"content\": \"/// This extension trait makes it possible to keep the Step\\n\\n/// functionality generic and at a higher level than the module itself\\n\\npub trait StepExt: Copy + Default + PartialEq + Eq + Hash {\\n\\n /// Get the next step from current step\\n\\n fn next(&self) -> Option<Self>;\\n\\n /// Get the step as a number\\n\\n fn as_number(&self) -> usize;\\n\\n /// Label to display (will be localized)\\n\\n fn label(&self) -> &'static str;\\n\\n /// List of all available steps\\n\\n fn get_list() -> Vec<Self>;\\n\\n /// Get the step which is synonymous with \\\"preview\\\"\\n\\n /// TODO: this could probably be derived as a combo\\n\\n /// of get_list() and next() (i.e. the first step to return None)\\n\\n fn get_preview() -> Self;\\n\\n /// Auto-implemented, check whether current step is \\\"preview\\\"\\n\\n fn is_preview(&self) -> bool {\\n\\n *self == Self::get_preview()\\n\\n }\\n\\n}\\n\\n\\n\\n/// Theme Ids. Used in various modules\\n\",\n \"file_path\": \"shared/rust/src/domain/jig/module/body.rs\",\n \"rank\": 68,\n \"score\": 199199.8861399284\n },\n {\n \"content\": \"/// Extenstion trait for modes\\n\\npub trait ModeExt: Copy + Default + PartialEq + Eq + Hash {\\n\\n /// get a list of all the modes\\n\\n /// (becomes the default in Choose page, which can be overriden in BodyExt)\\n\\n fn get_list() -> Vec<Self>;\\n\\n\\n\\n /// get the mode itself as a string id\\n\\n fn as_str_id(&self) -> &'static str;\\n\\n /// for headers, labels, etc.\\n\\n fn label(&self) -> &'static str;\\n\\n}\\n\\n\\n\\n/// impl ModeExt for empty modes\\n\\n/// this is a special case and should only be used\\n\\n/// where the module genuinely ignores the mode\\n\\n/// one example is the Cover module\\n\\nimpl ModeExt for () {\\n\\n fn get_list() -> Vec<Self> {\\n\\n vec![]\\n\\n }\\n\\n\\n\",\n \"file_path\": \"shared/rust/src/domain/jig/module/body.rs\",\n \"rank\": 69,\n \"score\": 199199.88613992842\n },\n {\n \"content\": \"pub fn paste_module(state: Rc<State>) {\\n\\n match get_module_to_paste() {\\n\\n None => log::warn!(\\\"No module to paste\\\"),\\n\\n Some((jig_id, module_id)) => {\\n\\n state.loader.load(clone!(state => async move {\\n\\n\\n\\n let module = super::module_cloner::clone_module(&jig_id, &module_id, &state.jig.id).await.unwrap_ji();\\n\\n state.modules.lock_mut().push_cloned(Rc::new(Some(module)));\\n\\n\\n\\n }));\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/copy_paste_module.rs\",\n \"rank\": 70,\n \"score\": 197388.81648262328\n },\n {\n \"content\": \"pub fn add_empty_module_after(state: Rc<State>) {\\n\\n state\\n\\n .sidebar\\n\\n .modules\\n\\n .lock_mut()\\n\\n .insert_cloned(state.index + 1, Rc::new(None));\\n\\n state.sidebar.jig_edit_state.route.set_neq(JigEditRoute::Landing);\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs\",\n \"rank\": 71,\n \"score\": 197388.81648262328\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"input-select\\\", {\\n\\n .property(\\\"slot\\\", \\\"goal\\\")\\n\\n .property(\\\"label\\\", STR_TEACHING_GOAL_LABEL)\\n\\n .property(\\\"placeholder\\\", STR_TEACHING_GOAL_PLACEHOLDER)\\n\\n .property(\\\"multiple\\\", true)\\n\\n .property_signal(\\\"value\\\", goal_value_signal(state.clone()))\\n\\n .property_signal(\\\"error\\\", {\\n\\n (map_ref! {\\n\\n let submission_tried = state.submission_tried.signal(),\\n\\n let value = state.jig.goals.signal_cloned()\\n\\n => (*submission_tried, value.clone())\\n\\n })\\n\\n .map(|(submission_tried, value)| {\\n\\n submission_tried && value.is_empty()\\n\\n })\\n\\n })\\n\\n .children_signal_vec(state.goals.signal_cloned().map(clone!(state => move |goals| {\\n\\n goals.iter().map(|goal| {\\n\\n render_goal(&goal, state.clone())\\n\\n }).collect()\\n\\n })).to_signal_vec())\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/goal.rs\",\n \"rank\": 72,\n \"score\": 196758.78953475785\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n\\n\\n let state = Rc::new(share_jig::state::State::new(state.player_state.jig_id));\\n\\n\\n\\n let anchor = html!(\\\"jig-play-sidebar-action\\\", {\\n\\n .property(\\\"kind\\\", \\\"share\\\")\\n\\n .property_signal(\\\"active\\\", state.active_popup.signal_cloned().map(|active| active.is_some()))\\n\\n });\\n\\n\\n\\n share_jig::dom::render(state, anchor, Some(\\\"actions\\\"))\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/sidebar/dom/share.rs\",\n \"rank\": 73,\n \"score\": 196758.78953475785\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n load_ages(Rc::clone(&state));\\n\\n\\n\\n html!(\\\"jig-play-sidebar\\\", {\\n\\n .property(\\\"slot\\\", \\\"sidebar\\\")\\n\\n .property_signal(\\\"jigName\\\", state.player_state.jig.signal_cloned().map(|jig| {\\n\\n match jig {\\n\\n None => String::new(),\\n\\n Some(jig) => jig.jig_data.display_name,\\n\\n }\\n\\n }))\\n\\n .property_signal(\\\"open\\\", state.sidebar_open.signal())\\n\\n .child(html!(\\\"button-empty\\\", {\\n\\n .property(\\\"slot\\\", \\\"close\\\")\\n\\n .text(\\\"<\\\")\\n\\n .event(clone!(state => move |_: events::Click| {\\n\\n state.sidebar_open.set(false);\\n\\n }))\\n\\n }))\\n\\n .child(html!(\\\"button\\\", {\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/sidebar/dom/mod.rs\",\n \"rank\": 74,\n \"score\": 196758.78953475785\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"input-select\\\", {\\n\\n .property(\\\"slot\\\", \\\"language\\\")\\n\\n .property(\\\"label\\\", STR_LANGUAGE_LABEL)\\n\\n .property(\\\"placeholder\\\", STR_LANGUAGE_PLACEHOLDER)\\n\\n .property_signal(\\\"value\\\", language_value_signal(state.clone()))\\n\\n .property_signal(\\\"error\\\", {\\n\\n (map_ref! {\\n\\n let submission_tried = state.submission_tried.signal(),\\n\\n let value = state.jig.language.signal_cloned()\\n\\n => (*submission_tried, value.clone())\\n\\n })\\n\\n .map(|(submission_tried, value)| {\\n\\n submission_tried && value.is_empty()\\n\\n })\\n\\n })\\n\\n .children(state.languages.iter().map(clone!(state => move |language| {\\n\\n render_language(language, state.clone())\\n\\n })))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/language.rs\",\n \"rank\": 75,\n \"score\": 196758.78953475785\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"input-select\\\", {\\n\\n .property(\\\"slot\\\", \\\"age\\\")\\n\\n .property(\\\"label\\\", STR_AGE_LABEL)\\n\\n .property(\\\"placeholder\\\", STR_AGE_PLACEHOLDER)\\n\\n .property(\\\"multiple\\\", true)\\n\\n .property_signal(\\\"value\\\", age_value_signal(state.clone()))\\n\\n .property_signal(\\\"error\\\", {\\n\\n (map_ref! {\\n\\n let submission_tried = state.submission_tried.signal(),\\n\\n let value = state.jig.age_ranges.signal_cloned()\\n\\n => (*submission_tried, value.clone())\\n\\n })\\n\\n .map(|(submission_tried, value)| {\\n\\n submission_tried && value.is_empty()\\n\\n })\\n\\n })\\n\\n .children_signal_vec(state.ages.signal_cloned().map(clone!(state => move |ages| {\\n\\n ages.iter().map(|age| {\\n\\n render_age(&age, state.clone())\\n\\n }).collect()\\n\\n })).to_signal_vec())\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/age.rs\",\n \"rank\": 76,\n \"score\": 196758.78953475785\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"anchored-overlay\\\", {\\n\\n .property(\\\"positionY\\\", \\\"bottom-out\\\")\\n\\n .property(\\\"positionX\\\", \\\"left-in\\\")\\n\\n .property(\\\"styled\\\", true)\\n\\n .property(\\\"slot\\\", \\\"actions\\\")\\n\\n .property_signal(\\\"open\\\", info_open_signal(Rc::clone(&state)))\\n\\n .event(clone!(state => move |_: events::Close| {\\n\\n state.info_popup_active.set(false);\\n\\n }))\\n\\n .child(html!(\\\"jig-play-sidebar-action\\\", {\\n\\n .property(\\\"slot\\\", \\\"anchor\\\")\\n\\n .property(\\\"kind\\\", \\\"info\\\")\\n\\n .property_signal(\\\"active\\\", info_open_signal(Rc::clone(&state)))\\n\\n .event(clone!(state => move |_: events::Click| {\\n\\n let mut info_popup_active = state.info_popup_active.lock_mut();\\n\\n *info_popup_active = !*info_popup_active;\\n\\n }))\\n\\n }))\\n\\n .child_signal({\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/sidebar/dom/info.rs\",\n \"rank\": 77,\n \"score\": 196758.78953475785\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"div\\\", {\\n\\n .property(\\\"slot\\\", \\\"category-labels\\\")\\n\\n .children_signal_vec(state.jig.categories.signal_cloned().map(clone!(state => move|categories| {\\n\\n categories.iter()\\n\\n .map(|category_id| render_pill(state.clone(), category_id.clone()))\\n\\n .collect()\\n\\n })).to_signal_vec())\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/categories_pills.rs\",\n \"rank\": 78,\n \"score\": 194995.19581939979\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"jig-settings\\\", {\\n\\n .property(\\\"slot\\\", \\\"overlay\\\")\\n\\n .children(&mut [\\n\\n html!(\\\"button-icon\\\", {\\n\\n .property(\\\"icon\\\", \\\"x\\\")\\n\\n .property(\\\"slot\\\", \\\"close\\\")\\n\\n .event(clone!(state => move |_:events::Click| {\\n\\n state.active_popup.set(None);\\n\\n }))\\n\\n }),\\n\\n html!(\\\"jig-settings-button\\\", {\\n\\n .property(\\\"slot\\\", \\\"creator\\\")\\n\\n .property(\\\"kind\\\", \\\"theme\\\")\\n\\n .event(clone!(state => move|_: events::Click| {\\n\\n set_active_popup(Rc::clone(&state), ActiveSettingsPopup::Theme);\\n\\n }))\\n\\n }),\\n\\n html!(\\\"jig-settings-button\\\", {\\n\\n .property(\\\"slot\\\", \\\"creator\\\")\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/main.rs\",\n \"rank\": 79,\n \"score\": 194995.19581939979\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"anchored-overlay\\\", {\\n\\n .class(class! {\\n\\n .pseudo!(\\\"::part(overlay)\\\", {\\n\\n .style(\\\"z-index\\\", \\\"2\\\")\\n\\n })\\n\\n })\\n\\n .property(\\\"slot\\\", \\\"settings\\\")\\n\\n .property(\\\"positionX\\\", \\\"right-out\\\")\\n\\n .property(\\\"positionY\\\", \\\"top-in\\\")\\n\\n .property(\\\"styled\\\", true)\\n\\n .property_signal(\\\"open\\\", state.active_popup.signal_cloned().map(|x| x.is_some()))\\n\\n .event(clone!(state => move |_: events::Close| {\\n\\n state.active_popup.set(None);\\n\\n }))\\n\\n .child(html!(\\\"jig-edit-sidebar-action-button\\\", {\\n\\n .property(\\\"slot\\\", \\\"anchor\\\")\\n\\n .property(\\\"kind\\\", \\\"settings\\\")\\n\\n .event(clone!(state => move |_: events::Click| {\\n\\n let mut active_popup = state.active_popup.lock_mut();\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/mod.rs\",\n \"rank\": 80,\n \"score\": 194995.19581939979\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n let audio_handles: Vec<Mutable<Option<AudioHandle>>> = AudioBackground::variants().iter().map(|_| Mutable::new(None)).collect();\\n\\n let audio_handles = Rc::new(audio_handles);\\n\\n\\n\\n html!(\\\"jig-audio-body\\\", {\\n\\n .property(\\\"slot\\\", \\\"overlay\\\")\\n\\n .property(\\\"kind\\\", \\\"background\\\")\\n\\n .children(&mut [\\n\\n html!(\\\"button-rect\\\", {\\n\\n .property(\\\"kind\\\", \\\"text\\\")\\n\\n .property(\\\"slot\\\", \\\"back\\\")\\n\\n .property(\\\"color\\\", \\\"blue\\\")\\n\\n .child(html!(\\\"fa-icon\\\", {.property(\\\"icon\\\", \\\"fa-light fa-chevron-left\\\")}))\\n\\n .text(STR_BACK_TO_SETTINGS)\\n\\n .event(clone!(state => move|_: events::Click| {\\n\\n set_active_popup(Rc::clone(&state), ActiveSettingsPopup::Main);\\n\\n }))\\n\\n }),\\n\\n html!(\\\"button-icon\\\", {\\n\\n .property(\\\"icon\\\", \\\"x\\\")\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/background.rs\",\n \"rank\": 81,\n \"score\": 194995.19581939979\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"jig-settings-themes\\\", {\\n\\n .property(\\\"slot\\\", \\\"overlay\\\")\\n\\n .children(&mut [\\n\\n html!(\\\"button-rect\\\", {\\n\\n .property(\\\"kind\\\", \\\"text\\\")\\n\\n .property(\\\"slot\\\", \\\"back\\\")\\n\\n .property(\\\"color\\\", \\\"blue\\\")\\n\\n .child(html!(\\\"fa-icon\\\", {.property(\\\"icon\\\", \\\"fa-light fa-chevron-left\\\")}))\\n\\n .text(STR_BACK_TO_SETTINGS)\\n\\n .event(clone!(state => move|_: events::Click| {\\n\\n set_active_popup(Rc::clone(&state), ActiveSettingsPopup::Main);\\n\\n }))\\n\\n }),\\n\\n html!(\\\"button-icon\\\", {\\n\\n .property(\\\"icon\\\", \\\"x\\\")\\n\\n .property(\\\"slot\\\", \\\"close\\\")\\n\\n .event(clone!(state => move |_:events::Click| {\\n\\n state.active_popup.set(None);\\n\\n }))\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/themes.rs\",\n \"rank\": 82,\n \"score\": 194995.19581939979\n },\n {\n \"content\": \"pub fn render(state: Rc<State>) -> Dom {\\n\\n html!(\\\"input-select\\\", {\\n\\n .property(\\\"slot\\\", \\\"catagories-select\\\")\\n\\n .property(\\\"label\\\", STR_CATEGORIES_LABEL)\\n\\n .property(\\\"placeholder\\\", STR_CATEGORIES_PLACEHOLDER)\\n\\n .property(\\\"multiple\\\", true)\\n\\n .property_signal(\\\"value\\\", category_value_signal(state.clone()))\\n\\n .property_signal(\\\"error\\\", {\\n\\n (map_ref! {\\n\\n let submission_tried = state.submission_tried.signal(),\\n\\n let value = state.jig.categories.signal_cloned()\\n\\n => (*submission_tried, value.clone())\\n\\n })\\n\\n .map(|(submission_tried, value)| {\\n\\n submission_tried && value.is_empty()\\n\\n })\\n\\n })\\n\\n .children_signal_vec(state.categories.signal_cloned().map(clone!(state => move |categories| {\\n\\n render_categories(state.clone(), &categories)\\n\\n })).to_signal_vec())\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/categories_select.rs\",\n \"rank\": 83,\n \"score\": 194995.19581939979\n },\n {\n \"content\": \"pub fn start_timer(state: Rc<State>, time: u32) {\\n\\n let timer = Timer::new(time);\\n\\n\\n\\n spawn_local(timer.time.signal().for_each(clone!(state => move|time| {\\n\\n if time == 0 {\\n\\n sent_iframe_message(Rc::clone(&state), JigToModulePlayerMessage::TimerDone);\\n\\n }\\n\\n async {}\\n\\n })));\\n\\n\\n\\n state.timer.set(Some(timer));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 84,\n \"score\": 194647.1136939504\n },\n {\n \"content\": \"pub fn published_at_string(time: DateTime<Utc>, short: bool) -> String {\\n\\n let millis_since_published = Utc::now().timestamp_millis() - time.timestamp_millis();\\n\\n let millis_since_published = millis_since_published as u64;\\n\\n\\n\\n let unit = PublishedAtUnit::new(millis_since_published);\\n\\n\\n\\n match short {\\n\\n true => format!(\\\"{} {} ago\\\", unit.get_number(), unit.to_string_short()),\\n\\n false => {\\n\\n let num = unit.get_number();\\n\\n match num {\\n\\n 1 => format!(\\\"1 {} ago\\\", unit.to_string_long()),\\n\\n num => format!(\\\"{} {}s ago\\\", num, unit.to_string_long()),\\n\\n }\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Clone, Debug)]\\n\\npub struct JigPlayerOptions {\\n\",\n \"file_path\": \"frontend/apps/crates/utils/src/jig.rs\",\n \"rank\": 85,\n \"score\": 194573.45797245312\n },\n {\n \"content\": \"pub fn player_settings_change_signal(state: Rc<State>) -> impl Signal<Item = JigPlayerSettings> {\\n\\n let sig = map_ref! {\\n\\n let direction = state.settings.direction.signal_cloned(),\\n\\n let display_score = state.settings.display_score.signal(),\\n\\n let track_assessments = state.settings.track_assessments.signal(),\\n\\n let drag_assist = state.settings.drag_assist.signal()\\n\\n => ( direction.clone(), display_score.clone(), track_assessments.clone(), drag_assist.clone())\\n\\n };\\n\\n\\n\\n sig.map(\\n\\n |(direction, display_score, track_assessments, drag_assist)| JigPlayerSettings {\\n\\n direction: direction.clone(),\\n\\n display_score: display_score.clone(),\\n\\n track_assessments: track_assessments.clone(),\\n\\n drag_assist: drag_assist.clone(),\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs\",\n \"rank\": 86,\n \"score\": 193508.76901011646\n },\n {\n \"content\": \"pub fn render(_state: Rc<State>) -> Vec<Dom> {\\n\\n vec![\\n\\n html!(\\\"jig-edit-publish-add-resource\\\", {\\n\\n .property(\\\"slot\\\", \\\"additional-resources\\\")\\n\\n .property(\\\"label\\\", \\\"Add Lesson Plan\\\")\\n\\n .children(&mut [\\n\\n html!(\\\"jig-edit-publish-add-resource-method\\\", {\\n\\n .property(\\\"slot\\\", \\\"add-method\\\")\\n\\n .property(\\\"kind\\\", \\\"upload\\\")\\n\\n }),\\n\\n html!(\\\"jig-edit-publish-add-resource-method\\\", {\\n\\n .property(\\\"slot\\\", \\\"add-method\\\")\\n\\n .property(\\\"kind\\\", \\\"link\\\")\\n\\n }),\\n\\n ])\\n\\n }),\\n\\n html!(\\\"jig-edit-publish-add-resource\\\", {\\n\\n .property(\\\"slot\\\", \\\"additional-resources\\\")\\n\\n .property(\\\"label\\\", \\\"Add Curriculum\\\")\\n\\n }),\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/publish/components/additional_resources.rs\",\n \"rank\": 87,\n \"score\": 191158.16700594337\n },\n {\n \"content\": \"pub fn update_display_name(state: Rc<State>, value: String) {\\n\\n state.loader.load(clone!(state => async move {\\n\\n state.name.set(value.clone());\\n\\n\\n\\n let req = JigUpdateDraftDataRequest {\\n\\n display_name: Some(value),\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n match update_jig(&state.jig.id, req).await {\\n\\n Ok(_) => {},\\n\\n Err(_) => {},\\n\\n }\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs\",\n \"rank\": 88,\n \"score\": 191158.16700594337\n },\n {\n \"content\": \"pub fn assign_kind(state: Rc<State>, kind: ModuleKind) {\\n\\n state.sidebar.loader.load(clone!(state => async move {\\n\\n let req = Some(ModuleCreateRequest {\\n\\n body: ModuleBody::new(kind),\\n\\n });\\n\\n let path = endpoints::jig::module::Create::PATH.replace(\\\"{id}\\\",&state.sidebar.jig.id.0.to_string());\\n\\n\\n\\n match api_with_auth::<CreateResponse<ModuleId>, EmptyError, _>(&path, endpoints::jig::module::Create::METHOD, req).await {\\n\\n Ok(resp) => {\\n\\n let id = resp.id;\\n\\n let index = state.index;\\n\\n let module = Rc::new(Some(LiteModule {\\n\\n id,\\n\\n kind,\\n\\n }));\\n\\n state.sidebar.modules.lock_mut().set_cloned(index, module);\\n\\n let req = ModuleUpdateRequest {\\n\\n id: StableOrUniqueId::Unique(id.clone()),\\n\\n index: Some(index.try_into().unwrap_ji()),\\n\\n body: None,\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs\",\n \"rank\": 89,\n \"score\": 189469.82433102033\n },\n {\n \"content\": \"pub fn duplicate_module(state: Rc<State>, module_id: &ModuleId) {\\n\\n state.loader.load(clone!(state, module_id => async move {\\n\\n let module = super::module_cloner::clone_module(&state.jig.id, &module_id, &state.jig.id).await.unwrap_ji();\\n\\n state.modules.lock_mut().push_cloned(Rc::new(Some(module)));\\n\\n }));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/actions.rs\",\n \"rank\": 90,\n \"score\": 189469.82433102033\n },\n {\n \"content\": \"pub fn toggle_background_audio(state: Rc<State>, background_audio: AudioBackground) {\\n\\n let mut bg_audio_handle = state.bg_audio_handle.borrow_mut();\\n\\n\\n\\n match &*bg_audio_handle {\\n\\n Some(bg_audio_handle) => {\\n\\n if state.bg_audio_playing.get() {\\n\\n bg_audio_handle.pause();\\n\\n state.bg_audio_playing.set(false);\\n\\n } else {\\n\\n bg_audio_handle.play();\\n\\n state.bg_audio_playing.set(true);\\n\\n };\\n\\n },\\n\\n None => {\\n\\n let handle = AUDIO_MIXER.with(|mixer| mixer.add_source(background_audio.as_source(), AudioClipOptions {\\n\\n auto_play: true,\\n\\n is_loop: true,\\n\\n on_ended: None::<fn()>,\\n\\n }));\\n\\n\\n\\n *bg_audio_handle = Some(handle);\\n\\n state.bg_audio_playing.set(true);\\n\\n },\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/play/src/player/actions.rs\",\n \"rank\": 91,\n \"score\": 189469.82433102033\n },\n {\n \"content\": \"pub fn render(state: Rc<State>, query: String, jigs: Rc<MutableVec<JigResponse>>) -> Dom {\\n\\n html!(\\\"home-search-results\\\", {\\n\\n .property_signal(\\\"resultsCount\\\", jigs.signal_vec_cloned().len().map(|len| len as u32))\\n\\n .property(\\\"query\\\", &query)\\n\\n .child(\\n\\n html!(\\\"home-search-results-section\\\", {\\n\\n .property(\\\"slot\\\", \\\"sections\\\")\\n\\n .property_signal(\\\"resultsCount\\\", jigs.signal_vec_cloned().len().map(|len| len as u32))\\n\\n .children_signal_vec(jigs.signal_vec_cloned().map(clone!(state => move |jig| {\\n\\n render_result(state.clone(), &jig)\\n\\n })))\\n\\n })\\n\\n )\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/home/src/home/dom/search_results.rs\",\n \"rank\": 92,\n \"score\": 189388.43379093357\n },\n {\n \"content\": \"pub fn mouse_down(state: Rc<State>, x: i32, y: i32) {\\n\\n state\\n\\n .sidebar\\n\\n .drag\\n\\n .set(Some(Rc::new(DragState::new(state.clone(), x, y))));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs\",\n \"rank\": 93,\n \"score\": 189327.73865524252\n },\n {\n \"content\": \"pub fn move_index(state: Rc<State>, move_target: MoveTarget) {\\n\\n state.sidebar.loader.load(clone!(state => async move {\\n\\n if let Some(module) = &*state.module {\\n\\n if let Some(target) = {\\n\\n match move_target {\\n\\n MoveTarget::Up if state.index > 1 => {\\n\\n Some(state.index-1)\\n\\n },\\n\\n MoveTarget::Down if state.index < state.total_len-1 => {\\n\\n Some(state.index+1)\\n\\n },\\n\\n MoveTarget::Any(target) => Some(target),\\n\\n _ => None\\n\\n }\\n\\n } {\\n\\n state.sidebar.modules.lock_mut().move_from_to(state.index, target);\\n\\n let req = ModuleUpdateRequest {\\n\\n id: StableOrUniqueId::Unique(module.id.clone()),\\n\\n index: Some(target.try_into().unwrap_ji()),\\n\\n body: None,\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/module/actions.rs\",\n \"rank\": 94,\n \"score\": 187817.3137368678\n },\n {\n \"content\": \"pub fn mouse_up(sidebar: Rc<SidebarState>, _x: i32, _y: i32) {\\n\\n if let Some(_drag) = sidebar.drag.replace(None) {\\n\\n sidebar.drag_target_index.set_neq(None);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/dragging/actions.rs\",\n \"rank\": 95,\n \"score\": 187602.38568259357\n },\n {\n \"content\": \"pub fn copy_module(state: Rc<State>, module_id: &ModuleId) {\\n\\n let value = format!(\\\"{},{}\\\", &state.jig.id.0, &module_id.0);\\n\\n\\n\\n let local_storage = get_local_storage().unwrap_ji();\\n\\n\\n\\n local_storage.set(COPY_MODULE_KEY, &value).unwrap_ji();\\n\\n}\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/copy_paste_module.rs\",\n \"rank\": 96,\n \"score\": 186199.50649253704\n },\n {\n \"content\": \"pub fn render(state: Rc<State>, tab: FeedbackTab) -> Dom {\\n\\n html!(\\\"jig-audio-body\\\", {\\n\\n .property(\\\"slot\\\", \\\"overlay\\\")\\n\\n .property(\\\"kind\\\", \\\"feedback\\\")\\n\\n .children(&mut [\\n\\n html!(\\\"label\\\", {\\n\\n .property(\\\"slot\\\", \\\"correct-mistake\\\")\\n\\n .child(html!(\\\"input\\\", {\\n\\n .property(\\\"name\\\", \\\"correct-mistake\\\")\\n\\n .property(\\\"type\\\", \\\"radio\\\")\\n\\n .property(\\\"checked\\\", tab == FeedbackTab::Positive)\\n\\n .event(clone!(state => move |_:events::Input| {\\n\\n state.active_popup.set(Some(ActiveSettingsPopup::Feedback(FeedbackTab::Positive)));\\n\\n }))\\n\\n }))\\n\\n .text(STR_CORRECT)\\n\\n }),\\n\\n html!(\\\"label\\\", {\\n\\n .property(\\\"slot\\\", \\\"correct-mistake\\\")\\n\\n .child(html!(\\\"input\\\", {\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/settings/dom/feedback.rs\",\n \"rank\": 97,\n \"score\": 185940.53795790568\n },\n {\n \"content\": \"//Mouse movements are triggered from sidebar regardless of\\n\\n//whether drag state exists yet or not\\n\\npub fn mouse_move(sidebar: Rc<SidebarState>, x: i32, y: i32) {\\n\\n //update via ref not lock_mut\\n\\n //otherwise it will replace the drag and cause a re-render\\n\\n //with every update\\n\\n //internally, drag uses Mutable and Atomic so this works in Rc\\n\\n if let Some(drag) = &*sidebar.drag.lock_ref() {\\n\\n drag.inner.update(x, y);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/dragging/actions.rs\",\n \"rank\": 98,\n \"score\": 185914.04300767052\n },\n {\n \"content\": \"pub fn render(state: Rc<State>, items: Vec<Dom>) -> Dom {\\n\\n html!(\\\"menu-kebab\\\", {\\n\\n .property(\\\"slot\\\", \\\"menu\\\")\\n\\n .child(html!(\\\"jig-edit-sidebar-module-menu\\\", {\\n\\n .children(items)\\n\\n }))\\n\\n .after_inserted(clone!(state => move |elem| {\\n\\n *state.menu_ref.borrow_mut() = Some(elem);\\n\\n }))\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"frontend/apps/crates/entry/jig/edit/src/edit/sidebar/menu/dom.rs\",\n \"rank\": 99,\n \"score\": 185914.04300767052\n }\n]","isConversational":false}}},{"rowIdx":2995,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/columnar_transposition.rs"},"repo_name":{"kind":"string","value":"sula0/embedo"},"commit":{"kind":"string","value":"fa3ddcc54ea481ecffe5c765706aa6e1b42a6be1"},"file_code":{"kind":"string","value":"use crate::util;\n\nconst META_ROWS: usize = 2;\nconst EMPTY_CHAR: u32 = 32;\n\npub fn encrypt(text: &str, key: &str) -> String {\n let mut result = String::new();\n\n let cols = key.len();\n\n let required_rows = text.len() as f32 / cols as f32;\n let rows = META_ROWS + (required_rows as f32).ceil() as usize;\n\n let mut matrix = vec![vec![32; cols]; rows];\n\n let key_chars: Vec<char> = key.to_uppercase().chars().collect();\n let text_chars: Vec<char> = text.chars().collect();\n\n /*\n Keys vec contains tuple consisted of the alphabetized value\n of the key char and its index. Later we sort by the alphabetized\n value to get the column reading order.\n */\n let mut keys: Vec<(u32, u32)> = vec![];\n\n /*\n Fill up the matrix.\n First row contains the key. Second row contains\n the order of alphabets in the key. Rest of the rows\n are filled with the text which will be encrypted.\n */\n for i in 0..rows {\n for j in 0..cols {\n if i == 0 {\n \n matrix[i][j] = key_chars[j] as u32; \n } else if i == 1 {\n let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);\n matrix[i][j] = alphabetized_char;\n\n keys.push((j as u32, alphabetized_char));\n } else {\n let char_index = (i - META_ROWS) + j + ((i - META_ROWS) * (cols - 1));\n\n if char_index < text_chars.len() {\n matrix[i][j] = text_chars[char_index] as u32;\n } else {\n matrix[i][j] = EMPTY_CHAR;\n }\n }\n }\n }\n\n \n keys.sort_by(|a, b| a.1.cmp(&b.1));\n\n /*\n Read the columns of the text. Order of reading\n is determined but the key alphabets.\n */\n for j in keys.iter() {\n for i in META_ROWS..rows {\n let c = matrix[i as usize][j.0 as usize];\n result += std::str::from_utf8(&[c as u8]).unwrap();\n }\n }\n \n result\n}\n\npub fn decrypt(text: &str, key: &str) -> String {\n let mut result = String::new();\n\n let cols = key.len();\n\n let required_rows = text.len() as f32 / cols as f32;\n let rows = META_ROWS + (required_rows as f32).ceil() as usize;\n\n let mut matrix = vec![vec![32; cols]; rows];\n\n let key_chars: Vec<char> = key.to_uppercase().chars().collect();\n let text_chars: Vec<char> = text.chars().collect();\n\n /*\n Keys vec contains tuple consisted of the alphabetized value\n of the key char and its index. Later we sort by the alphabetized\n value to get the column reading order.\n */\n let mut keys: Vec<(u32, u32)> = vec![];\n\n /*\n Fill up the matrix.\n First row contains the key. Second row contains\n the order of alphabets in the key. Rest of the rows\n are filled with the text which will be decrypted.\n */\n for i in 0..rows {\n for j in 0..cols {\n if i == 0 {\n \n matrix[i][j] = key_chars[j] as u32; \n } else if i == 1 {\n let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);\n matrix[i][j] = alphabetized_char;\n\n keys.push((j as u32, alphabetized_char));\n }\n }\n }\n\n \n keys.sort_by(|a, b| a.1.cmp(&b.1));\n\n let mut char_index: usize = 0;\n\n /*\n Write the columns of the text. Order of writing\n is determined but the key alphabets.\n */\n for j in keys.iter() {\n for i in META_ROWS..rows {\n if char_index < text_chars.len() {\n matrix[i as usize][j.0 as usize] = text_chars[char_index] as u32;\n } else {\n matrix[i as usize][j.0 as usize] = EMPTY_CHAR;\n }\n\n char_index += 1;\n }\n }\n\n for i in META_ROWS..rows {\n for j in 0..cols {\n let c = matrix[i as usize][j as usize];\n result += std::str::from_utf8(&[c as u8]).unwrap();\n }\n }\n\n result\n}\n"},"prefix":{"kind":"string","value":"use crate::util;\n\nconst META_ROWS: usize = 2;\nconst EMPTY_CHAR: u32 = 32;\n\npub fn encrypt(text: &str, key: &str) -> String {\n let mut result = String::new();\n\n let cols = key.len();\n\n let required_rows = text.len() as f32 / cols as f32;\n let rows = META_ROWS + (required_rows as f32).ceil() as usize;\n\n let mut matrix = vec![vec![32; cols]; rows];\n\n let key_chars: Vec<char> = key.to_uppercase().chars().collect();\n let text_chars: Vec<char> = text.chars().collect();\n\n /*\n Keys vec contains tuple consisted of the alphabetized value\n of the key char and its index. Later we sort by the alphabetized\n value to get the column reading order.\n */\n let mut keys: Vec<(u32, u32)> = vec![];\n\n /*\n Fill up the matrix.\n First row contains the key. Second row contains\n the order of alphabets in the key. Rest of the rows\n are filled with the text which will be encrypted.\n */\n for i in 0..rows {\n for j in 0..cols {\n if i == 0 {\n \n matrix[i][j] = key_chars[j] as u32; \n } else if i == 1 {\n let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);\n matrix[i][j] = alphabetized_char;\n\n keys.push((j as u32, alphabetized_char));\n } else {\n let char_index = (i - META_ROWS) + j + ((i - META_ROWS) * (cols - 1));\n\n if char_index < text_chars.len() {\n matrix[i][j] = text_chars[char_index] as u32;\n } else {\n matrix[i][j] = EMPTY_CHAR;\n }\n }\n }\n }\n\n \n keys.sort_by(|a, b| a.1.cmp(&b.1));\n\n /*\n Read the columns of the text. Order of reading\n is determined but the key alphabets.\n */\n for j in keys.iter() {\n for i in META_ROWS..rows {\n let c = matrix[i as usize][j.0 as usize];\n result += std::str::from_utf8(&[c as u8]).unwrap();\n }\n }\n \n result\n}\n\npub fn decr"},"suffix":{"kind":"string","value":"f i == 1 {\n let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);\n matrix[i][j] = alphabetized_char;\n\n keys.push((j as u32, alphabetized_char));\n }\n }\n }\n\n \n keys.sort_by(|a, b| a.1.cmp(&b.1));\n\n let mut char_index: usize = 0;\n\n /*\n Write the columns of the text. Order of writing\n is determined but the key alphabets.\n */\n for j in keys.iter() {\n for i in META_ROWS..rows {\n if char_index < text_chars.len() {\n matrix[i as usize][j.0 as usize] = text_chars[char_index] as u32;\n } else {\n matrix[i as usize][j.0 as usize] = EMPTY_CHAR;\n }\n\n char_index += 1;\n }\n }\n\n for i in META_ROWS..rows {\n for j in 0..cols {\n let c = matrix[i as usize][j as usize];\n result += std::str::from_utf8(&[c as u8]).unwrap();\n }\n }\n\n result\n}\n"},"middle":{"kind":"string","value":"ypt(text: &str, key: &str) -> String {\n let mut result = String::new();\n\n let cols = key.len();\n\n let required_rows = text.len() as f32 / cols as f32;\n let rows = META_ROWS + (required_rows as f32).ceil() as usize;\n\n let mut matrix = vec![vec![32; cols]; rows];\n\n let key_chars: Vec<char> = key.to_uppercase().chars().collect();\n let text_chars: Vec<char> = text.chars().collect();\n\n /*\n Keys vec contains tuple consisted of the alphabetized value\n of the key char and its index. Later we sort by the alphabetized\n value to get the column reading order.\n */\n let mut keys: Vec<(u32, u32)> = vec![];\n\n /*\n Fill up the matrix.\n First row contains the key. Second row contains\n the order of alphabets in the key. Rest of the rows\n are filled with the text which will be decrypted.\n */\n for i in 0..rows {\n for j in 0..cols {\n if i == 0 {\n \n matrix[i][j] = key_chars[j] as u32; \n } else i"},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"pub fn encrypt(text: &str, n: u32) -> String {\n\n let mut result = String::new();\n\n\n\n for c in text.chars() {\n\n let is_upper = c.is_uppercase();\n\n\n\n let encrypted = (util::alphabetize_char(c as u32, is_upper) + n) % 26;\n\n result += std::str::from_utf8(&[util::asciify_char(encrypted, is_upper) as u8]).unwrap();\n\n }\n\n\n\n result\n\n}\n\n\n","file_path":"src/ceasar_cipher.rs","rank":1,"score":171432.56602014243},{"content":"#[wasm_bindgen]\n\npub fn columnar_transposition_encrypt(text: &str, key: &str) -> String {\n\n columnar_transposition::encrypt(text, key)\n\n}\n\n\n","file_path":"src/lib.rs","rank":2,"score":165927.01425742017},{"content":"#[wasm_bindgen]\n\npub fn ceasar_cipher_encrypt(text: &str, n: u32) -> String {\n\n ceasar_cipher::encrypt(text, n)\n\n}\n\n\n","file_path":"src/lib.rs","rank":3,"score":158262.5413867413},{"content":"#[wasm_bindgen]\n\npub fn columnar_transposition_decrypt(text: &str, key: &str) -> String {\n\n columnar_transposition::decrypt(text, key)\n\n}\n","file_path":"src/lib.rs","rank":5,"score":151138.4733967497},{"content":"pub fn decrypt(text: &str, n: u32) -> String {\n\n let mut result = String::new();\n\n\n\n for c in text.chars() {\n\n let is_upper = c.is_uppercase();\n\n \n\n let deciphered = (util::alphabetize_char(c as u32, is_upper) - n) % 26;\n\n result += std::str::from_utf8(&[util::asciify_char(deciphered, is_upper) as u8]).unwrap();\n\n }\n\n\n\n result\n\n}\n\n\n","file_path":"src/ceasar_cipher.rs","rank":6,"score":146358.66234658778},{"content":"#[wasm_bindgen]\n\npub fn ceasar_cipher_decrypt(text: &str, n: u32) -> String {\n\n ceasar_cipher::decrypt(text, n)\n\n}\n\n\n","file_path":"src/lib.rs","rank":7,"score":142937.48186136846},{"content":"pub fn alphabetize_char(c: u32, is_upper: bool) -> u32 {\n\n /*\n\n Since ASCII is being used, need to 'alphabetize'\n\n the char. In ASCII, lowercase characters are higher in\n\n number by 32 from their uppercase equivalents.\n\n */\n\n let diff = if is_upper { 0 } else { LOWER_DIFF };\n\n\n\n /*\n\n In ASCII, letters start at 65 so we subtract it\n\n (along with the diff above) to get to the 0-26 range.\n\n */\n\n c - diff - 65\n\n}\n\n\n","file_path":"src/util.rs","rank":8,"score":126599.666341614},{"content":"pub fn asciify_char(c: u32, is_upper: bool) -> u32 {\n\n /*\n\n Since ASCII is being used, need to 'alphabetize'\n\n the char. In ASCII, lowercase characters are higher in\n\n number by 32 from their uppercase equivalents.\n\n */\n\n let diff = if is_upper { 0 } else { LOWER_DIFF };\n\n\n\n /*\n\n This time we simply reverse the 'normalization' operation.\n\n Add up 65 and the diff to the char to get back to the\n\n ASCII range with correct capitalization.\n\n */\n\n c + 65 + diff\n\n}\n","file_path":"src/util.rs","rank":9,"score":109936.6544338838},{"content":"export const encrypt = (encryptionInput) => {\n\n const encryptionKey = document.getElementById('columnarTranspositionKey').value;\n\n return columnar_transposition_encrypt(encryptionInput, encryptionKey);\n","file_path":"scripts/columnarTransposition.js","rank":10,"score":37987.24637332653},{"content":"export const encrypt = (encryptionInput) => {\n\n const shiftBy = document.getElementById('ceasarShift').value;\n\n return ceasar_cipher_encrypt(encryptionInput, shiftBy);\n","file_path":"scripts/ceasarCipher.js","rank":11,"score":37987.24637332653},{"content":"const onEncrypt = () => {\n\n const encryptionInput = state.toEncryptInput.value;\n\n\n\n let encryptedText = '';\n\n\n\n switch (state.selectedCipher) {\n\n case ceasarCipher.CipherName: {\n\n encryptedText = ceasarCipher.encrypt(encryptionInput);\n\n break;\n\n }\n\n case columnarTransposition.CipherName: {\n\n encryptedText = columnarTransposition.encrypt(encryptionInput);\n\n break;\n\n }\n\n }\n\n\n\n state.toDecryptInput.value = encryptedText;\n","file_path":"scripts/index.js","rank":12,"score":35543.39420093096},{"content":"let state = {\n\n 'selectedCipher': '',\n\n 'toEncryptInput': document.getElementById('toEncrypt'),\n\n 'toDecryptInput': document.getElementById('toDecrypt'),\n\n 'cipherOptionsDiv': document.getElementById('cipherOptions')\n","file_path":"scripts/index.js","rank":13,"score":17616.88640059212},{"content":"const onDecrypt = () => {\n\n const decryptionInput = state.toDecryptInput.value;\n\n\n\n let decryptedText = '';\n\n\n\n switch (state.selectedCipher) {\n\n case ceasarCipher.CipherName: {\n\n decryptedText = ceasarCipher.decrypt(decryptionInput);\n\n break;\n\n }\n\n case columnarTransposition.CipherName: {\n\n decryptedText = columnarTransposition.decrypt(decryptionInput);\n\n break;\n\n }\n\n }\n\n\n\n state.toEncryptInput.value = decryptedText;\n","file_path":"scripts/index.js","rank":14,"score":17616.88640059212},{"content":"const clearInputs = () => {\n\n state.toEncryptInput.value = '';\n\n state.toDecryptInput.value = '';\n","file_path":"scripts/index.js","rank":15,"score":16899.700026712988},{"content":"const onChangeCipher = (e) => {\n\n clearChildren(state.cipherOptionsDiv);\n\n clearInputs();\n\n\n\n onSelectCipher(e.target.value);\n","file_path":"scripts/index.js","rank":16,"score":16899.700026712988},{"content":"const clearChildren = (node) => {\n\n while (node.firstChild) {\n\n node.removeChild(node.lastChild);\n\n }\n","file_path":"scripts/index.js","rank":17,"score":16899.700026712988},{"content":"const onSelectCipher = (selectedCipher) => {\n\n state.selectedCipher = selectedCipher;\n\n\n\n switch (state.selectedCipher) {\n\n case ceasarCipher.CipherName: {\n\n ceasarCipher.renderOptions(state.cipherOptionsDiv);\n\n break;\n\n }\n\n case columnarTransposition.CipherName: {\n\n columnarTransposition.renderOptions(state.cipherOptionsDiv);\n\n break;\n\n }\n\n }\n","file_path":"scripts/index.js","rank":18,"score":16899.700026712988},{"content":"const onClickClear = () => {\n\n clearInputs();\n","file_path":"scripts/index.js","rank":19,"score":16899.700026712988},{"content":"import init from './embedo.js';\n\nimport * as ceasarCipher from './ceasarCipher.js';\n\nimport * as columnarTransposition from './columnarTransposition.js';\n\n\n\nlet state = {\n\n 'selectedCipher': '',\n\n 'toEncryptInput': document.getElementById('toEncrypt'),\n\n 'toDecryptInput': document.getElementById('toDecrypt'),\n\n 'cipherOptionsDiv': document.getElementById('cipherOptions')\n\n};\n\n\n\nconst clearChildren = (node) => {\n\n while (node.firstChild) {\n\n node.removeChild(node.lastChild);\n\n }\n\n};\n\n\n\nconst onClickClear = () => {\n\n clearInputs();\n\n};\n\n\n\nconst clearInputs = () => {\n\n state.toEncryptInput.value = '';\n\n state.toDecryptInput.value = '';\n\n};\n\n\n\nconst onChangeCipher = (e) => {\n\n clearChildren(state.cipherOptionsDiv);\n\n clearInputs();\n\n\n\n onSelectCipher(e.target.value);\n\n};\n\n\n\nconst onSelectCipher = (selectedCipher) => {\n\n state.selectedCipher = selectedCipher;\n\n\n\n switch (state.selectedCipher) {\n\n case ceasarCipher.CipherName: {\n\n ceasarCipher.renderOptions(state.cipherOptionsDiv);\n\n break;\n\n }\n\n case columnarTransposition.CipherName: {\n\n columnarTransposition.renderOptions(state.cipherOptionsDiv);\n\n break;\n\n }\n\n }\n\n};\n\n\n\nconst onEncrypt = () => {\n\n const encryptionInput = state.toEncryptInput.value;\n\n\n\n let encryptedText = '';\n\n\n\n switch (state.selectedCipher) {\n\n case ceasarCipher.CipherName: {\n\n encryptedText = ceasarCipher.encrypt(encryptionInput);\n\n break;\n\n }\n\n case columnarTransposition.CipherName: {\n\n encryptedText = columnarTransposition.encrypt(encryptionInput);\n\n break;\n\n }\n\n }\n\n\n\n state.toDecryptInput.value = encryptedText;\n\n};\n\n\n\nconst onDecrypt = () => {\n\n const decryptionInput = state.toDecryptInput.value;\n\n\n\n let decryptedText = '';\n\n\n\n switch (state.selectedCipher) {\n\n case ceasarCipher.CipherName: {\n\n decryptedText = ceasarCipher.decrypt(decryptionInput);\n\n break;\n\n }\n\n case columnarTransposition.CipherName: {\n\n decryptedText = columnarTransposition.decrypt(decryptionInput);\n\n break;\n\n }\n\n }\n\n\n\n state.toEncryptInput.value = decryptedText;\n\n};\n\n\n\ninit().then(() => {\n\n document.getElementById('encryptButton').onclick = onEncrypt;\n\n document.getElementById('decryptButton').onclick = onDecrypt;\n\n\n\n document.getElementById('clearButton').onclick = onClickClear;\n\n\n\n document.getElementById('cipherSelect').onchange = onChangeCipher;\n\n onSelectCipher(document.getElementById('cipherSelect')[0].value);\n\n});\n","file_path":"scripts/index.js","rank":20,"score":13582.11827103726},{"content":"pub mod util;\n\n\n\nmod ceasar_cipher;\n\nmod columnar_transposition;\n\n\n\nuse wasm_bindgen::prelude::*;\n\n\n\n#[wasm_bindgen]\n","file_path":"src/lib.rs","rank":27,"score":2.1535523938226264},{"content":"use crate::util;\n\n\n","file_path":"src/ceasar_cipher.rs","rank":28,"score":1.6805506054402268},{"content":"const LOWER_DIFF: u32 = 32;\n\n\n","file_path":"src/util.rs","rank":29,"score":1.5072483915961492}],"string":"[\n {\n \"content\": \"pub fn encrypt(text: &str, n: u32) -> String {\\n\\n let mut result = String::new();\\n\\n\\n\\n for c in text.chars() {\\n\\n let is_upper = c.is_uppercase();\\n\\n\\n\\n let encrypted = (util::alphabetize_char(c as u32, is_upper) + n) % 26;\\n\\n result += std::str::from_utf8(&[util::asciify_char(encrypted, is_upper) as u8]).unwrap();\\n\\n }\\n\\n\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ceasar_cipher.rs\",\n \"rank\": 1,\n \"score\": 171432.56602014243\n },\n {\n \"content\": \"#[wasm_bindgen]\\n\\npub fn columnar_transposition_encrypt(text: &str, key: &str) -> String {\\n\\n columnar_transposition::encrypt(text, key)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 2,\n \"score\": 165927.01425742017\n },\n {\n \"content\": \"#[wasm_bindgen]\\n\\npub fn ceasar_cipher_encrypt(text: &str, n: u32) -> String {\\n\\n ceasar_cipher::encrypt(text, n)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 3,\n \"score\": 158262.5413867413\n },\n {\n \"content\": \"#[wasm_bindgen]\\n\\npub fn columnar_transposition_decrypt(text: &str, key: &str) -> String {\\n\\n columnar_transposition::decrypt(text, key)\\n\\n}\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 5,\n \"score\": 151138.4733967497\n },\n {\n \"content\": \"pub fn decrypt(text: &str, n: u32) -> String {\\n\\n let mut result = String::new();\\n\\n\\n\\n for c in text.chars() {\\n\\n let is_upper = c.is_uppercase();\\n\\n \\n\\n let deciphered = (util::alphabetize_char(c as u32, is_upper) - n) % 26;\\n\\n result += std::str::from_utf8(&[util::asciify_char(deciphered, is_upper) as u8]).unwrap();\\n\\n }\\n\\n\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ceasar_cipher.rs\",\n \"rank\": 6,\n \"score\": 146358.66234658778\n },\n {\n \"content\": \"#[wasm_bindgen]\\n\\npub fn ceasar_cipher_decrypt(text: &str, n: u32) -> String {\\n\\n ceasar_cipher::decrypt(text, n)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 7,\n \"score\": 142937.48186136846\n },\n {\n \"content\": \"pub fn alphabetize_char(c: u32, is_upper: bool) -> u32 {\\n\\n /*\\n\\n Since ASCII is being used, need to 'alphabetize'\\n\\n the char. In ASCII, lowercase characters are higher in\\n\\n number by 32 from their uppercase equivalents.\\n\\n */\\n\\n let diff = if is_upper { 0 } else { LOWER_DIFF };\\n\\n\\n\\n /*\\n\\n In ASCII, letters start at 65 so we subtract it\\n\\n (along with the diff above) to get to the 0-26 range.\\n\\n */\\n\\n c - diff - 65\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/util.rs\",\n \"rank\": 8,\n \"score\": 126599.666341614\n },\n {\n \"content\": \"pub fn asciify_char(c: u32, is_upper: bool) -> u32 {\\n\\n /*\\n\\n Since ASCII is being used, need to 'alphabetize'\\n\\n the char. In ASCII, lowercase characters are higher in\\n\\n number by 32 from their uppercase equivalents.\\n\\n */\\n\\n let diff = if is_upper { 0 } else { LOWER_DIFF };\\n\\n\\n\\n /*\\n\\n This time we simply reverse the 'normalization' operation.\\n\\n Add up 65 and the diff to the char to get back to the\\n\\n ASCII range with correct capitalization.\\n\\n */\\n\\n c + 65 + diff\\n\\n}\\n\",\n \"file_path\": \"src/util.rs\",\n \"rank\": 9,\n \"score\": 109936.6544338838\n },\n {\n \"content\": \"export const encrypt = (encryptionInput) => {\\n\\n const encryptionKey = document.getElementById('columnarTranspositionKey').value;\\n\\n return columnar_transposition_encrypt(encryptionInput, encryptionKey);\\n\",\n \"file_path\": \"scripts/columnarTransposition.js\",\n \"rank\": 10,\n \"score\": 37987.24637332653\n },\n {\n \"content\": \"export const encrypt = (encryptionInput) => {\\n\\n const shiftBy = document.getElementById('ceasarShift').value;\\n\\n return ceasar_cipher_encrypt(encryptionInput, shiftBy);\\n\",\n \"file_path\": \"scripts/ceasarCipher.js\",\n \"rank\": 11,\n \"score\": 37987.24637332653\n },\n {\n \"content\": \"const onEncrypt = () => {\\n\\n const encryptionInput = state.toEncryptInput.value;\\n\\n\\n\\n let encryptedText = '';\\n\\n\\n\\n switch (state.selectedCipher) {\\n\\n case ceasarCipher.CipherName: {\\n\\n encryptedText = ceasarCipher.encrypt(encryptionInput);\\n\\n break;\\n\\n }\\n\\n case columnarTransposition.CipherName: {\\n\\n encryptedText = columnarTransposition.encrypt(encryptionInput);\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n state.toDecryptInput.value = encryptedText;\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 12,\n \"score\": 35543.39420093096\n },\n {\n \"content\": \"let state = {\\n\\n 'selectedCipher': '',\\n\\n 'toEncryptInput': document.getElementById('toEncrypt'),\\n\\n 'toDecryptInput': document.getElementById('toDecrypt'),\\n\\n 'cipherOptionsDiv': document.getElementById('cipherOptions')\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 13,\n \"score\": 17616.88640059212\n },\n {\n \"content\": \"const onDecrypt = () => {\\n\\n const decryptionInput = state.toDecryptInput.value;\\n\\n\\n\\n let decryptedText = '';\\n\\n\\n\\n switch (state.selectedCipher) {\\n\\n case ceasarCipher.CipherName: {\\n\\n decryptedText = ceasarCipher.decrypt(decryptionInput);\\n\\n break;\\n\\n }\\n\\n case columnarTransposition.CipherName: {\\n\\n decryptedText = columnarTransposition.decrypt(decryptionInput);\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n state.toEncryptInput.value = decryptedText;\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 14,\n \"score\": 17616.88640059212\n },\n {\n \"content\": \"const clearInputs = () => {\\n\\n state.toEncryptInput.value = '';\\n\\n state.toDecryptInput.value = '';\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 15,\n \"score\": 16899.700026712988\n },\n {\n \"content\": \"const onChangeCipher = (e) => {\\n\\n clearChildren(state.cipherOptionsDiv);\\n\\n clearInputs();\\n\\n\\n\\n onSelectCipher(e.target.value);\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 16,\n \"score\": 16899.700026712988\n },\n {\n \"content\": \"const clearChildren = (node) => {\\n\\n while (node.firstChild) {\\n\\n node.removeChild(node.lastChild);\\n\\n }\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 17,\n \"score\": 16899.700026712988\n },\n {\n \"content\": \"const onSelectCipher = (selectedCipher) => {\\n\\n state.selectedCipher = selectedCipher;\\n\\n\\n\\n switch (state.selectedCipher) {\\n\\n case ceasarCipher.CipherName: {\\n\\n ceasarCipher.renderOptions(state.cipherOptionsDiv);\\n\\n break;\\n\\n }\\n\\n case columnarTransposition.CipherName: {\\n\\n columnarTransposition.renderOptions(state.cipherOptionsDiv);\\n\\n break;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 18,\n \"score\": 16899.700026712988\n },\n {\n \"content\": \"const onClickClear = () => {\\n\\n clearInputs();\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 19,\n \"score\": 16899.700026712988\n },\n {\n \"content\": \"import init from './embedo.js';\\n\\nimport * as ceasarCipher from './ceasarCipher.js';\\n\\nimport * as columnarTransposition from './columnarTransposition.js';\\n\\n\\n\\nlet state = {\\n\\n 'selectedCipher': '',\\n\\n 'toEncryptInput': document.getElementById('toEncrypt'),\\n\\n 'toDecryptInput': document.getElementById('toDecrypt'),\\n\\n 'cipherOptionsDiv': document.getElementById('cipherOptions')\\n\\n};\\n\\n\\n\\nconst clearChildren = (node) => {\\n\\n while (node.firstChild) {\\n\\n node.removeChild(node.lastChild);\\n\\n }\\n\\n};\\n\\n\\n\\nconst onClickClear = () => {\\n\\n clearInputs();\\n\\n};\\n\\n\\n\\nconst clearInputs = () => {\\n\\n state.toEncryptInput.value = '';\\n\\n state.toDecryptInput.value = '';\\n\\n};\\n\\n\\n\\nconst onChangeCipher = (e) => {\\n\\n clearChildren(state.cipherOptionsDiv);\\n\\n clearInputs();\\n\\n\\n\\n onSelectCipher(e.target.value);\\n\\n};\\n\\n\\n\\nconst onSelectCipher = (selectedCipher) => {\\n\\n state.selectedCipher = selectedCipher;\\n\\n\\n\\n switch (state.selectedCipher) {\\n\\n case ceasarCipher.CipherName: {\\n\\n ceasarCipher.renderOptions(state.cipherOptionsDiv);\\n\\n break;\\n\\n }\\n\\n case columnarTransposition.CipherName: {\\n\\n columnarTransposition.renderOptions(state.cipherOptionsDiv);\\n\\n break;\\n\\n }\\n\\n }\\n\\n};\\n\\n\\n\\nconst onEncrypt = () => {\\n\\n const encryptionInput = state.toEncryptInput.value;\\n\\n\\n\\n let encryptedText = '';\\n\\n\\n\\n switch (state.selectedCipher) {\\n\\n case ceasarCipher.CipherName: {\\n\\n encryptedText = ceasarCipher.encrypt(encryptionInput);\\n\\n break;\\n\\n }\\n\\n case columnarTransposition.CipherName: {\\n\\n encryptedText = columnarTransposition.encrypt(encryptionInput);\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n state.toDecryptInput.value = encryptedText;\\n\\n};\\n\\n\\n\\nconst onDecrypt = () => {\\n\\n const decryptionInput = state.toDecryptInput.value;\\n\\n\\n\\n let decryptedText = '';\\n\\n\\n\\n switch (state.selectedCipher) {\\n\\n case ceasarCipher.CipherName: {\\n\\n decryptedText = ceasarCipher.decrypt(decryptionInput);\\n\\n break;\\n\\n }\\n\\n case columnarTransposition.CipherName: {\\n\\n decryptedText = columnarTransposition.decrypt(decryptionInput);\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n state.toEncryptInput.value = decryptedText;\\n\\n};\\n\\n\\n\\ninit().then(() => {\\n\\n document.getElementById('encryptButton').onclick = onEncrypt;\\n\\n document.getElementById('decryptButton').onclick = onDecrypt;\\n\\n\\n\\n document.getElementById('clearButton').onclick = onClickClear;\\n\\n\\n\\n document.getElementById('cipherSelect').onchange = onChangeCipher;\\n\\n onSelectCipher(document.getElementById('cipherSelect')[0].value);\\n\\n});\\n\",\n \"file_path\": \"scripts/index.js\",\n \"rank\": 20,\n \"score\": 13582.11827103726\n },\n {\n \"content\": \"pub mod util;\\n\\n\\n\\nmod ceasar_cipher;\\n\\nmod columnar_transposition;\\n\\n\\n\\nuse wasm_bindgen::prelude::*;\\n\\n\\n\\n#[wasm_bindgen]\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 27,\n \"score\": 2.1535523938226264\n },\n {\n \"content\": \"use crate::util;\\n\\n\\n\",\n \"file_path\": \"src/ceasar_cipher.rs\",\n \"rank\": 28,\n \"score\": 1.6805506054402268\n },\n {\n \"content\": \"const LOWER_DIFF: u32 = 32;\\n\\n\\n\",\n \"file_path\": \"src/util.rs\",\n \"rank\": 29,\n \"score\": 1.5072483915961492\n }\n]","isConversational":false}}},{"rowIdx":2996,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"experiments/src/bin/graphs.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\nuse std::rc::Rc;\n\nuse rand::{Rng, SeedableRng, StdRng};\n\nuse timely::dataflow::*;\n\nuse differential_dataflow::input::Input;\nuse differential_dataflow::Collection;\nuse differential_dataflow::operators::*;\nuse differential_dataflow::trace::Trace;\nuse differential_dataflow::operators::arrange::ArrangeByKey;\nuse differential_dataflow::operators::arrange::ArrangeBySelf;\n\nuse differential_dataflow::trace::implementations::spine_fueled::Spine;\n\ntype Node = usize;\n\nuse differential_dataflow::trace::implementations::ord::OrdValBatch;\n\ntype GraphTrace = Spine<Node, Node, (), isize, Rc<OrdValBatch<Node, Node, (), isize>>>;\n\nfn main() {\n\n let nodes: usize = std::env::args().nth(1).unwrap().parse().unwrap();\n let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();\n\n \n \n \n \n \n \n \n \n \n\n timely::execute_from_args(std::env::args().skip(3), move |worker| {\n\n let index = worker.index();\n let peers = worker.peers();\n let timer = ::std::time::Instant::now();\n\n let (mut graph, mut trace) = worker.dataflow(|scope| {\n let (graph_input, graph) = scope.new_collection();\n let graph_indexed = graph.arrange_by_key();\n \n (graph_input, graph_indexed.trace)\n });\n\n let seed: &[_] = &[1, 2, 3, index];\n let mut rng1: StdRng = SeedableRng::from_seed(seed); \n \n\n if index == 0 { println!(\"performing workload on random graph with {} nodes, {} edges:\", nodes, edges); }\n\n let worker_edges = edges/peers + if index < (edges % peers) { 1 } else { 0 };\n for _ in 0 .. worker_edges {\n graph.insert((rng1.gen_range(0, nodes) as Node, rng1.gen_range(0, nodes) as Node));\n }\n graph.close();\n while worker.step() { }\n if index == 0 { println!(\"{:?}\\tgraph loaded\", timer.elapsed()); }\n\n \n let mut roots = worker.dataflow(|scope| {\n let (roots_input, roots) = scope.new_collection();\n reach(&mut trace, roots);\n roots_input\n });\n\n if index == 0 { roots.insert(0); }\n roots.close();\n while worker.step() { }\n if index == 0 { println!(\"{:?}\\treach complete\", timer.elapsed()); }\n\n \n let mut roots = worker.dataflow(|scope| {\n let (roots_input, roots) = scope.new_collection();\n bfs(&mut trace, roots);\n roots_input\n });\n\n if index == 0 { roots.insert(0); }\n roots.close();\n while worker.step() { }\n if index == 0 { println!(\"{:?}\\tbfs complete\", timer.elapsed()); }\n\n }).unwrap();\n}\n\nuse differential_dataflow::operators::arrange::TraceAgent;\n\ntype TraceHandle = TraceAgent<GraphTrace>;\n\nfn reach<G: Scope<Timestamp = ()>> (\n graph: &mut TraceHandle,\n roots: Collection<G, Node>\n) -> Collection<G, Node> {\n\n let graph = graph.import(&roots.scope());\n\n roots.iterate(|inner| {\n\n let graph = graph.enter(&inner.scope());\n let roots = roots.enter(&inner.scope());\n\n \n \n\n graph.join_core(&inner.arrange_by_self(), |_src,&dst,&()| Some(dst))\n .concat(&roots)\n .distinct_total()\n })\n}\n\nfn bfs<G: Scope<Timestamp = ()>> (\n graph: &mut TraceHandle,\n roots: Collection<G, Node>\n) -> Collection<G, (Node, u32)> {\n\n let graph = graph.import(&roots.scope());\n let roots = roots.map(|r| (r,0));\n\n roots.iterate(|inner| {\n\n let graph = graph.enter(&inner.scope());\n let roots = roots.enter(&inner.scope());\n\n graph.join_map(&inner, |_src,&dest,&dist| (dest, dist+1))\n .concat(&roots)\n .reduce(|_key, input, output| output.push((*input[0].0,1)))\n })\n}\n\n"},"prefix":{"kind":"string","value":"extern crate rand;\nextern crate timely;\nextern crate differential_dataflow;\n\nuse std::rc::Rc;\n\nuse rand::{Rng, SeedableRng, StdRng};\n\nuse timely::dataflow::*;\n\nuse differential_dataflow::input::Input;\nuse differential_dataflow::Collection;\nuse differential_dataflow::operators::*;\nuse differential_dataflow::trace::Trace;\nuse differential_dataflow::operators::arrange::ArrangeByKey;\nuse differential_dataflow::operators::arrange::ArrangeBySelf;\n\nuse differential_dataflow::trace::implementations::spine_fueled::Spine;\n\ntype Node = usize;\n\nuse differential_dataflow::trace::implementations::ord::OrdValBatch;\n\ntype GraphTrace = Spine<Node, Node, (), isize, Rc<OrdValBatch<Node, Node, (), isize>>>;\n\nfn main() {\n\n let nodes: usize = std::env::args().nth(1).unwrap().parse().unwrap();\n let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();\n\n \n \n \n \n \n \n \n \n \n\n timely::execute_from_args(std::env::args().skip(3), move |worker| {\n\n let index = worker.index();\n let peers = worker.peers();\n let timer = ::std::time::Instant::now();\n\n let (mut graph, mut trace) = worker.dataflow(|scope| {\n let (graph_input, graph) = scope.new_collection();\n let graph_indexed = graph.arrange_by_key();\n \n (graph_input, graph_indexed.trace)\n });\n\n let seed: &[_] = &[1, 2, 3, index];\n let mut rng1: StdRng = SeedableRng::from_seed(seed); \n \n\n if index == 0 { println!(\"performing workload on random graph with {} nodes, {} edges:\", nodes, edges); }\n\n let worker_edges = edges/peers + if index < (edges % peers) { 1 } else { 0 };\n for _ in 0 .. worker_edges {\n graph.insert((rng1.gen_range(0, nodes) as Node, rng1.gen_range(0, nodes) as Node));\n }\n graph.close();\n while worker.step() { }\n if index == 0 { println!(\"{:?}\\tgraph loaded\", timer.elapsed()); }\n\n \n let mut roots = worker.dataflow(|scope| {\n let (roots_input, roots) = scope.new_collection();\n reach(&mut trace, roots);\n roots_input\n });\n\n if index == 0 { roots.insert(0); }\n roots.close();\n while worker.step() { }\n if index == 0 { println!(\"{:?}\\treach complete\", timer.elapsed()); }\n\n \n let mut roots = worker.dataflow(|scope| {\n let (roots_input, roots) = scope.new_collection();\n bfs(&mut trace, roots);\n roots_input\n });\n\n if index == 0 { roots.insert(0); }\n roots.close();\n while worker.step() { }\n if index == 0 { println!(\"{:?}\\tbfs complete\", timer.elapsed()); }\n\n }).unwrap();\n}\n\nuse differential_dataflow::operators::arrange::TraceAgent;\n\ntype TraceHandle = TraceAgent<GraphTrace>;\n\nfn reach<G: Scope<Timestamp = ()>> (\n graph: &mut TraceHandle,\n roots: Collection<G, Node>\n) -> Collection<G, Node> {\n\n let graph = graph.import(&roots.scope());\n\n roots.iterate(|inner| {\n\n let graph = graph.enter(&inne"},"suffix":{"kind":"string","value":"\n\nfn bfs<G: Scope<Timestamp = ()>> (\n graph: &mut TraceHandle,\n roots: Collection<G, Node>\n) -> Collection<G, (Node, u32)> {\n\n let graph = graph.import(&roots.scope());\n let roots = roots.map(|r| (r,0));\n\n roots.iterate(|inner| {\n\n let graph = graph.enter(&inner.scope());\n let roots = roots.enter(&inner.scope());\n\n graph.join_map(&inner, |_src,&dest,&dist| (dest, dist+1))\n .concat(&roots)\n .reduce(|_key, input, output| output.push((*input[0].0,1)))\n })\n}\n\n"},"middle":{"kind":"string","value":"r.scope());\n let roots = roots.enter(&inner.scope());\n\n \n \n\n graph.join_core(&inner.arrange_by_self(), |_src,&dst,&()| Some(dst))\n .concat(&roots)\n .distinct_total()\n })\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"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":0,"score":301682.7572724212},{"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":1,"score":285284.3660070641},{"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":2,"score":268018.24871702574},{"content":"type TraceBatch = OrdValBatch<usize, usize, RootTime, isize>;\n","file_path":"server/src/lib.rs","rank":3,"score":263082.020148068},{"content":"type Node = u32;\n\n\n","file_path":"src/trace/implementations/graph.rs","rank":4,"score":249343.75661425097},{"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":5,"score":248389.92295202703},{"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":6,"score":243662.79936214344},{"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":7,"score":233140.2729517994},{"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":231454.57601472197},{"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":9,"score":231454.57601472197},{"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":231454.57601472197},{"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":11,"score":231454.57601472197},{"content":"type Edge = (Node, Node);\n","file_path":"examples/cursors.rs","rank":12,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"examples/bfs.rs","rank":13,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n","file_path":"examples/pagerank.rs","rank":14,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"examples/stackoverflow.rs","rank":15,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"examples/interpreted.rs","rank":16,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n","file_path":"examples/graspan.rs","rank":17,"score":226348.37484132207},{"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":18,"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":19,"score":226348.37484132207},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"examples/capture-test.rs","rank":20,"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":21,"score":222835.71298371206},{"content":"type Edge = (Node, Node);\n\n\n","file_path":"dogsdogsdogs/examples/ngo.rs","rank":22,"score":222835.71298371206},{"content":"fn load1<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol), Time, Diff)>+'a {\n\n read_file(&format!(\"{}{}\", prefix, filename))\n\n .filter(move |_| index == 0)\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n let mut elts = line.split('\\t');\n\n ((\n\n interner.intern(elts.next().unwrap())\n\n ), 0, 1)\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":23,"score":215977.72634790995},{"content":"type Time = usize;\n","file_path":"examples/stackoverflow.rs","rank":24,"score":215198.04432104863},{"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":25,"score":214965.4824300761},{"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":26,"score":214965.4824300761},{"content":"type Node = usize;\n","file_path":"tests/scc.rs","rank":27,"score":214602.78449930373},{"content":"type Node = usize;\n","file_path":"tests/bfs.rs","rank":28,"score":214602.7844993037},{"content":"type Node = usize;\n","file_path":"examples/graspan.rs","rank":29,"score":214602.78449930373},{"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\n\n\n\n\npub mod kafka {\n","file_path":"examples/capture-test.rs","rank":30,"score":212228.71007635424},{"content":"fn load2<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol), Time, Diff)>+'a {\n\n read_file(&format!(\"{}{}\", prefix, filename))\n\n .filter(move |_| index == 0)\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n let mut elts = line.split('\\t');\n\n ((\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n ), 0, 1)\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":31,"score":211574.36479402508},{"content":"type ArrangedIndex<K, T> = TraceAgent<DefaultValTrace<K, T, usize, isize>>;\n\n\n\npub struct ArrangementsInScope<G: Scope<Timestamp=usize>> {\n\n customer: ArrangedScope<G, usize, Customer>,\n\n nation: ArrangedScope<G, usize, Nation>,\n\n order: ArrangedScope<G, usize, Order>,\n\n part: ArrangedScope<G, usize, Part>,\n\n partsupp: ArrangedScope<G, (usize, usize), PartSupp>,\n\n region: ArrangedScope<G, usize, Region>,\n\n supplier: ArrangedScope<G, usize, Supplier>,\n\n}\n\n\n\npub struct Arrangements {\n\n arrange: bool,\n\n customer: ArrangedIndex<usize, Customer>,\n\n nation: ArrangedIndex<usize, Nation>,\n\n order: ArrangedIndex<usize, Order>,\n\n part: ArrangedIndex<usize, Part>,\n\n partsupp: ArrangedIndex<(usize, usize), PartSupp>,\n\n region: ArrangedIndex<usize, Region>,\n","file_path":"tpchlike/src/lib.rs","rank":32,"score":211215.77571160402},{"content":"// Type aliases for differential execution.\n\ntype Time = u32;\n","file_path":"doop/src/main.rs","rank":33,"score":211008.44828328883},{"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":34,"score":210616.34569801207},{"content":"fn interpret<G: Scope>(edges: &Collection<G, Edge>, relations: &[(usize, usize)]) -> Collection<G, Vec<Node>>\n\nwhere G::Timestamp: Lattice+Hash+Ord {\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 let mut field_present = ::std::collections::HashSet::new();\n\n\n\n let mut results = edges.map(|(x,y)| vec![x, y]);\n\n\n\n field_present.insert(0);\n\n field_present.insert(1);\n\n\n\n for &(src, dst) in relations.iter() {\n\n\n\n let src_present = field_present.contains(&src);\n\n let dst_present = field_present.contains(&dst);\n","file_path":"examples/interpreted.rs","rank":35,"score":209222.81150483442},{"content":"fn load3<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol), Time, Diff)>+'a {\n\n read_file(&format!(\"{}{}\", prefix, filename))\n\n .filter(move |_| index == 0)\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n let mut elts = line.split('\\t');\n\n ((\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n ), 0, 1)\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":36,"score":207348.744491083},{"content":"fn load4<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\n\n read_file(&format!(\"{}{}\", prefix, filename))\n\n .filter(move |_| index == 0)\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n let mut elts = line.split('\\t');\n\n ((\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n ), 0, 1)\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":37,"score":203290.20877422162},{"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":38,"score":200829.5973722318},{"content":"fn load5<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\n\n read_file(&format!(\"{}{}\", prefix, filename))\n\n .filter(move |_| index == 0)\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n let mut elts = line.split('\\t');\n\n ((\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n ), 0, 1)\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":39,"score":199388.94465529663},{"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":40,"score":197548.57929519942},{"content":"fn load6<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\n\n read_file(&format!(\"{}{}\", prefix, filename))\n\n .filter(move |_| index == 0)\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n let mut elts = line.split('\\t');\n\n ((\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n ), 0, 1)\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":41,"score":195635.90014654596},{"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":42,"score":194494.05172426775},{"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":43,"score":193493.8801828561},{"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":44,"score":193493.88018285614},{"content":"fn load7<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\n\n read_file(&format!(\"{}{}\", prefix, filename))\n\n .filter(move |_| index == 0)\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n let mut elts = line.split('\\t');\n\n ((\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n interner.intern(elts.next().unwrap()),\n\n ), 0, 1)\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":45,"score":192022.71120903429},{"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":46,"score":190945.3846163027},{"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":47,"score":181795.43084477726},{"content":"#[inline(never)]\n\npub fn advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\n\n\n\n // start with no advance\n\n let mut index = 0;\n\n if index < slice.len() && function(&slice[index]) {\n\n\n\n // advance in exponentially growing steps.\n\n let mut step = 1;\n\n while index + step < slice.len() && function(&slice[index + step]) {\n\n index += step;\n\n step = step << 1;\n\n }\n\n\n\n // advance in exponentially shrinking steps.\n\n step = step >> 1;\n\n while step > 0 {\n\n if index + step < slice.len() && function(&slice[index + step]) {\n\n index += step;\n\n }\n\n step = step >> 1;\n\n }\n\n\n\n index += 1;\n\n }\n\n\n\n index\n\n}\n","file_path":"src/trace/implementations/graph.rs","rank":48,"score":179528.36734127984},{"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":49,"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":50,"score":175987.9073013793},{"content":"type Diff = isize;\n\n\n","file_path":"doop/src/main.rs","rank":51,"score":172365.61393865137},{"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":52,"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":53,"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":54,"score":169558.44478451117},{"content":"fn main() {\n\n\n\n let mut args = std::env::args().skip(1);\n\n\n\n let filename = args.next().expect(\"must specify a filename\");\n\n let root: Node = args.next().expect(\"must specify root node\").parse().expect(\"root node must be an integer\");\n\n let batch: usize = args.next().expect(\"must specify batching\").parse().expect(\"batch must be an integer\");\n\n let compression: Time = args.next().expect(\"must specify compression\").parse().expect(\"compression must be an integer\");\n\n let inspect: bool = args.next().expect(\"must specify inspect bit\").parse().expect(\"inspect must be boolean\");\n\n\n\n // define a new computational scope, in which to run BFS\n\n timely::execute_from_args(args, move |worker| {\n\n\n\n let timer = ::std::time::Instant::now();\n\n let index = worker.index();\n\n let peers = worker.peers();\n\n\n\n // define BFS dataflow; return handles to roots and edges inputs\n\n let mut roots = InputSession::new();\n\n let mut graph = InputSession::new();\n","file_path":"examples/stackoverflow.rs","rank":55,"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":56,"score":169558.44478451117},{"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":57,"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":58,"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":59,"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":60,"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":61,"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":62,"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 = ::std::time::Instant::now();\n\n\n\n let peers = worker.peers();\n\n let index = worker.index();\n\n\n\n let query_filename = std::env::args().nth(1).expect(\"Argument 1 (query filename) missing.\");\n\n let query_text = std::fs::read_to_string(query_filename).expect(\"Failed to read query file\");\n\n let query = Query::build_from(query_text.lines());\n\n\n\n let mut relation_map = worker.dataflow::<(),_,_>(|scope| query.render_in(scope));\n\n\n\n if index == 0 { println!(\"{:?}:\\tDataflow assembled for {:?}\", timer.elapsed(), query); }\n\n\n\n // Build a dataflow to report final sizes.\n\n worker.dataflow(|scope| {\n\n for (name, data) in relation_map.iter_mut() {\n","file_path":"examples/graspan.rs","rank":63,"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":64,"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":65,"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":66,"score":169558.44478451117},{"content":"type Time = u32;\n","file_path":"examples/cursors.rs","rank":67,"score":168841.99539805713},{"content":"type Time = u32;\n","file_path":"examples/pagerank.rs","rank":68,"score":168841.99539805713},{"content":"type Node = u32;\n","file_path":"examples/stackoverflow.rs","rank":69,"score":168246.73557631223},{"content":"type Node = u32;\n","file_path":"examples/cursors.rs","rank":70,"score":168246.73557631223},{"content":"type Node = u32;\n","file_path":"examples/bfs.rs","rank":71,"score":168246.73557631223},{"content":"type Node = u32;\n","file_path":"examples/interpreted.rs","rank":72,"score":168246.73557631223},{"content":"type Node = u32;\n","file_path":"examples/pagerank.rs","rank":73,"score":168246.73557631223},{"content":"// A differential version of item-based collaborative filtering using Jaccard similarity for\n\n// comparing item interaction histories. See Algorithm 1 in https://ssc.io/pdf/amnesia.pdf\n\n// for details.\n\nfn main() {\n\n\n\n timely::execute_from_args(std::env::args(), move |worker| {\n\n\n\n let mut interactions_input = InputSession::new();\n\n\n\n let probe = worker.dataflow(|scope| {\n\n\n\n let interactions = interactions_input.to_collection(scope);\n\n\n\n // Find all users with less than 500 interactions\n\n let users_with_enough_interactions = interactions\n\n .map(|(user, _item)| user)\n\n .count_total()\n\n .filter(move |(_user, count): &(u32, isize)| *count < 500)\n\n .map(|(user, _count)| user);\n\n\n\n // Remove users with too many interactions\n\n let remaining_interactions = interactions\n\n .semijoin(&users_with_enough_interactions);\n","file_path":"examples/itembased_cf.rs","rank":74,"score":166740.8485840942},{"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 batching = std::env::args().nth(2).unwrap().parse::<usize>().unwrap();\n\n\n\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\n\n\n\n // let timer = std::time::Instant::now();\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","file_path":"dogsdogsdogs/examples/dogsdogsdogs.rs","rank":75,"score":166736.1804086232},{"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(1), 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 triangles(&Collection::new(edges.to_stream(scope))).inner.count().inspect(|x| println!(\"{:?}\", x));\n\n });\n\n\n\n }).unwrap();\n\n}\n\n\n","file_path":"dogsdogsdogs/examples/ngo.rs","rank":76,"score":166736.1804086232},{"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 topic = std::env::args().nth(4).unwrap();\n\n\n\n let write = std::env::args().any(|x| x == \"write\");\n\n let read = std::env::args().any(|x| x == \"read\");\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 let timer = ::std::time::Instant::now();\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 roots, mut graph, _write_token, _read_token) = worker.dataflow(|scope| {\n\n\n\n let (root_input, roots) = scope.new_collection();\n","file_path":"examples/capture-test.rs","rank":77,"score":166736.1804086232},{"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 weight: u32 = std::env::args().nth(3).unwrap().parse().unwrap();\n\n let batch: u32 = std::env::args().nth(4).unwrap().parse().unwrap();\n\n let rounds: u32 = std::env::args().nth(5).unwrap().parse().unwrap();\n\n let inspect: bool = std::env::args().nth(6).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 let timer = ::std::time::Instant::now();\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 roots, mut graph) = worker.dataflow(|scope| {\n\n\n\n let (root_input, roots) = scope.new_collection();\n\n let (edge_input, graph) = scope.new_collection();\n","file_path":"examples/monoid-bfs.rs","rank":78,"score":166736.1804086232},{"content":"// Returns a weighted collection in which the weight of each node is proportional\n\n// to its PageRank in the input graph `edges`.\n\nfn pagerank<G>(iters: Iter, edges: &Collection<G, Edge, Diff>) -> Collection<G, Node, Diff>\n\nwhere\n\n G: Scope,\n\n G::Timestamp: Lattice,\n\n{\n\n // initialize many surfers at each node.\n\n let nodes =\n\n edges.flat_map(|(x,y)| Some(x).into_iter().chain(Some(y)))\n\n .distinct();\n\n\n\n // snag out-degrees for each node.\n\n let degrs = edges.map(|(src,_dst)| src)\n\n .count();\n\n\n\n edges.scope().iterative::<Iter,_,_>(|inner| {\n\n\n\n // Bring various collections into the scope.\n\n let edges = edges.enter(inner);\n\n let nodes = nodes.enter(inner);\n\n let degrs = degrs.enter(inner);\n","file_path":"examples/pagerank.rs","rank":79,"score":166211.89706630982},{"content":"type Node = u32;\n","file_path":"examples/capture-test.rs","rank":80,"score":165567.92715485458},{"content":"type Node = u32;\n","file_path":"dogsdogsdogs/examples/ngo.rs","rank":81,"score":165567.92715485458},{"content":"type Node = u32;\n","file_path":"examples/monoid-bfs.rs","rank":82,"score":165567.92715485458},{"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 batching = std::env::args().nth(2).unwrap().parse::<usize>().unwrap();\n\n let inspect = std::env::args().any(|x| x == \"inspect\");\n\n\n\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\n\n\n\n let timer = std::time::Instant::now();\n\n let graph = GraphMMap::new(&filename);\n\n\n\n let peers = worker.peers();\n\n let index = worker.index();\n\n\n\n let mut probe = Handle::new();\n\n\n\n let mut input = worker.dataflow::<usize,_,_>(|scope| {\n\n\n\n let (edges_input, edges) = scope.new_collection();\n","file_path":"dogsdogsdogs/examples/delta_query.rs","rank":83,"score":164077.04698340688},{"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 batching = std::env::args().nth(2).unwrap().parse::<usize>().unwrap();\n\n let inspect = std::env::args().any(|x| x == \"inspect\");\n\n\n\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\n\n\n\n let timer = std::time::Instant::now();\n\n let graph = GraphMMap::new(&filename);\n\n\n\n let peers = worker.peers();\n\n let index = worker.index();\n\n\n\n let mut probe = Handle::new();\n\n\n\n let mut input = worker.dataflow::<usize,_,_>(|scope| {\n\n\n\n let (edges_input, edges) = scope.new_collection();\n","file_path":"dogsdogsdogs/examples/delta_query_wcoj.rs","rank":84,"score":161567.29798697718},{"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":85,"score":158895.34830724995},{"content":"/// Sorts and consolidate `vec[offset..]`.\n\n///\n\n/// This method will sort `vec[offset..]` 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_from<T: Ord, R: Semigroup>(vec: &mut Vec<(T, R)>, offset: usize) {\n\n let length = consolidate_slice(&mut vec[offset..]);\n\n vec.truncate(offset + length);\n\n}\n\n\n","file_path":"src/consolidation.rs","rank":86,"score":153561.14397005027},{"content":"type IntegerTrace = OrdValSpine<UnsignedWrapper<u64>, u64, usize, i64>;\n\n\n","file_path":"tests/trace.rs","rank":87,"score":151505.39705640345},{"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":88,"score":151270.98366186125},{"content":"fn load<'a>(filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=Vec<Symbol>>+'a {\n\n use ::std::io::{BufReader, BufRead};\n\n use ::std::fs::File;\n\n let file = BufReader::new(File::open(filename).unwrap());\n\n file.lines()\n\n .filter_map(|line| line.ok())\n\n .map(move |line| {\n\n let mut interner = interner.borrow_mut();\n\n line.split('\\t')\n\n .map(move |string| interner.intern(string))\n\n .collect()\n\n })\n\n}\n\n\n","file_path":"doop/src/main.rs","rank":89,"score":148328.67128585937},{"content":"// type PrimitiveType = Type;\n\ntype ReferenceType = Type;\n","file_path":"doop/src/main.rs","rank":90,"score":147960.5705257153},{"content":"/// Sorts and consolidates a slice, returning the valid prefix length.\n\npub fn consolidate_updates_slice<D: Ord, T: Ord, R: Semigroup>(slice: &mut [(D, 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_unstable_by(|x,y| (&x.0, &x.1).cmp(&(&y.0, &y.1)));\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":91,"score":145630.84312444145},{"content":"/// Reports the number of elements satisfing the predicate.\n\n///\n\n/// This methods *relies strongly* on the assumption that the predicate\n\n/// stays false once it becomes false, a joint property of the predicate\n\n/// and the slice. This allows `advance` to use exponential search to\n\n/// count the number of elements in time logarithmic in the result.\n\npub fn advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\n\n\n\n let small_limit = 8;\n\n\n\n // Exponential seach if the answer isn't within `small_limit`.\n\n if slice.len() > small_limit && function(&slice[small_limit]) {\n\n\n\n // start with no advance\n\n let mut index = small_limit + 1;\n\n if index < slice.len() && function(&slice[index]) {\n\n\n\n // advance in exponentially growing steps.\n\n let mut step = 1;\n\n while index + step < slice.len() && function(&slice[index + step]) {\n\n index += step;\n\n step = step << 1;\n\n }\n\n\n\n // advance in exponentially shrinking steps.\n\n step = step >> 1;\n","file_path":"src/trace/layers/mod.rs","rank":92,"score":145352.54484221904},{"content":"#[inline(never)]\n\npub fn advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\n\n\n\n\t// start with no advance\n\n\tlet mut index = 0;\n\n\tif index < slice.len() && function(&slice[index]) {\n\n\n\n\t\t// advance in exponentially growing steps.\n\n\t\tlet mut step = 1;\n\n\t\twhile index + step < slice.len() && function(&slice[index + step]) {\n\n\t\t\tindex += step;\n\n\t\t\tstep = step << 1;\n\n\t\t}\n\n\n\n\t\t// advance in exponentially shrinking steps.\n\n\t\tstep = step >> 1;\n\n\t\twhile step > 0 {\n\n\t\t\tif index + step < slice.len() && function(&slice[index + step]) {\n\n\t\t\t\tindex += step;\n\n\t\t\t}\n\n\t\t\tstep = step >> 1;\n\n\t\t}\n\n\n\n\t\tindex += 1;\n\n\t}\n\n\n\n\tindex\n\n}\n","file_path":"src/trace/implementations/vec.rs","rank":93,"score":145343.73097004968},{"content":"type Type = Symbol;\n","file_path":"doop/src/main.rs","rank":94,"score":145160.01689609667},{"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":95,"score":143628.04259754592},{"content":"#[inline]\n\npub fn _advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\n\n\n\n\t// start with no advance\n\n\tlet mut index = 0;\n\n\tif index < slice.len() && function(&slice[index]) {\n\n\n\n\t\t// advance in exponentially growing steps.\n\n\t\tlet mut step = 1;\n\n\t\twhile index + step < slice.len() && function(&slice[index + step]) {\n\n\t\t\tindex += step;\n\n\t\t\tstep = step << 1;\n\n\t\t}\n\n\n\n\t\t// advance in exponentially shrinking steps.\n\n\t\tstep = step >> 1;\n\n\t\twhile step > 0 {\n\n\t\t\tif index + step < slice.len() && function(&slice[index + step]) {\n\n\t\t\t\tindex += step;\n\n\t\t\t}\n\n\t\t\tstep = step >> 1;\n\n\t\t}\n\n\n\n\t\tindex += 1;\n\n\t}\n\n\n\n\tindex\n\n}\n","file_path":"src/trace/implementations/merge_batcher.rs","rank":96,"score":143219.05965029498},{"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":97,"score":141244.05750045372},{"content":"/// Sorts and consolidate `vec[offset..]`.\n\n///\n\n/// This method will sort `vec[offset..]` and then consolidate runs of more than one entry with\n\n/// identical first two elements by accumulating the third elements of the triples. Should the final\n\n/// accumulation be zero, the element is discarded.\n\npub fn consolidate_updates_from<D: Ord, T: Ord, R: Semigroup>(vec: &mut Vec<(D, T, R)>, offset: usize) {\n\n let length = consolidate_updates_slice(&mut vec[offset..]);\n\n vec.truncate(offset + length);\n\n}\n\n\n","file_path":"src/consolidation.rs","rank":98,"score":141131.02578606442},{"content":"type ArrayType = ReferenceType;\n","file_path":"doop/src/main.rs","rank":99,"score":138747.00604761273}],"string":"[\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\": 0,\n \"score\": 301682.7572724212\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\": 1,\n \"score\": 285284.3660070641\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\": 2,\n \"score\": 268018.24871702574\n },\n {\n \"content\": \"type TraceBatch = OrdValBatch<usize, usize, RootTime, isize>;\\n\",\n \"file_path\": \"server/src/lib.rs\",\n \"rank\": 3,\n \"score\": 263082.020148068\n },\n {\n \"content\": \"type Node = u32;\\n\\n\\n\",\n \"file_path\": \"src/trace/implementations/graph.rs\",\n \"rank\": 4,\n \"score\": 249343.75661425097\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\": 5,\n \"score\": 248389.92295202703\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\": 6,\n \"score\": 243662.79936214344\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\": 7,\n \"score\": 233140.2729517994\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\": 231454.57601472197\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\": 9,\n \"score\": 231454.57601472197\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\": 231454.57601472197\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\": 11,\n \"score\": 231454.57601472197\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 12,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"examples/bfs.rs\",\n \"rank\": 13,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 14,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"examples/stackoverflow.rs\",\n \"rank\": 15,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"examples/interpreted.rs\",\n \"rank\": 16,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\",\n \"file_path\": \"examples/graspan.rs\",\n \"rank\": 17,\n \"score\": 226348.37484132207\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\": 18,\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\": 19,\n \"score\": 226348.37484132207\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"examples/capture-test.rs\",\n \"rank\": 20,\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\": 21,\n \"score\": 222835.71298371206\n },\n {\n \"content\": \"type Edge = (Node, Node);\\n\\n\\n\",\n \"file_path\": \"dogsdogsdogs/examples/ngo.rs\",\n \"rank\": 22,\n \"score\": 222835.71298371206\n },\n {\n \"content\": \"fn load1<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol), Time, Diff)>+'a {\\n\\n read_file(&format!(\\\"{}{}\\\", prefix, filename))\\n\\n .filter(move |_| index == 0)\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n let mut elts = line.split('\\\\t');\\n\\n ((\\n\\n interner.intern(elts.next().unwrap())\\n\\n ), 0, 1)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 23,\n \"score\": 215977.72634790995\n },\n {\n \"content\": \"type Time = usize;\\n\",\n \"file_path\": \"examples/stackoverflow.rs\",\n \"rank\": 24,\n \"score\": 215198.04432104863\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\": 25,\n \"score\": 214965.4824300761\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\": 26,\n \"score\": 214965.4824300761\n },\n {\n \"content\": \"type Node = usize;\\n\",\n \"file_path\": \"tests/scc.rs\",\n \"rank\": 27,\n \"score\": 214602.78449930373\n },\n {\n \"content\": \"type Node = usize;\\n\",\n \"file_path\": \"tests/bfs.rs\",\n \"rank\": 28,\n \"score\": 214602.7844993037\n },\n {\n \"content\": \"type Node = usize;\\n\",\n \"file_path\": \"examples/graspan.rs\",\n \"rank\": 29,\n \"score\": 214602.78449930373\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\\n\\n\\n\\n\\npub mod kafka {\\n\",\n \"file_path\": \"examples/capture-test.rs\",\n \"rank\": 30,\n \"score\": 212228.71007635424\n },\n {\n \"content\": \"fn load2<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol), Time, Diff)>+'a {\\n\\n read_file(&format!(\\\"{}{}\\\", prefix, filename))\\n\\n .filter(move |_| index == 0)\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n let mut elts = line.split('\\\\t');\\n\\n ((\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n ), 0, 1)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 31,\n \"score\": 211574.36479402508\n },\n {\n \"content\": \"type ArrangedIndex<K, T> = TraceAgent<DefaultValTrace<K, T, usize, isize>>;\\n\\n\\n\\npub struct ArrangementsInScope<G: Scope<Timestamp=usize>> {\\n\\n customer: ArrangedScope<G, usize, Customer>,\\n\\n nation: ArrangedScope<G, usize, Nation>,\\n\\n order: ArrangedScope<G, usize, Order>,\\n\\n part: ArrangedScope<G, usize, Part>,\\n\\n partsupp: ArrangedScope<G, (usize, usize), PartSupp>,\\n\\n region: ArrangedScope<G, usize, Region>,\\n\\n supplier: ArrangedScope<G, usize, Supplier>,\\n\\n}\\n\\n\\n\\npub struct Arrangements {\\n\\n arrange: bool,\\n\\n customer: ArrangedIndex<usize, Customer>,\\n\\n nation: ArrangedIndex<usize, Nation>,\\n\\n order: ArrangedIndex<usize, Order>,\\n\\n part: ArrangedIndex<usize, Part>,\\n\\n partsupp: ArrangedIndex<(usize, usize), PartSupp>,\\n\\n region: ArrangedIndex<usize, Region>,\\n\",\n \"file_path\": \"tpchlike/src/lib.rs\",\n \"rank\": 32,\n \"score\": 211215.77571160402\n },\n {\n \"content\": \"// Type aliases for differential execution.\\n\\ntype Time = u32;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 33,\n \"score\": 211008.44828328883\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\": 34,\n \"score\": 210616.34569801207\n },\n {\n \"content\": \"fn interpret<G: Scope>(edges: &Collection<G, Edge>, relations: &[(usize, usize)]) -> Collection<G, Vec<Node>>\\n\\nwhere G::Timestamp: Lattice+Hash+Ord {\\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 let mut field_present = ::std::collections::HashSet::new();\\n\\n\\n\\n let mut results = edges.map(|(x,y)| vec![x, y]);\\n\\n\\n\\n field_present.insert(0);\\n\\n field_present.insert(1);\\n\\n\\n\\n for &(src, dst) in relations.iter() {\\n\\n\\n\\n let src_present = field_present.contains(&src);\\n\\n let dst_present = field_present.contains(&dst);\\n\",\n \"file_path\": \"examples/interpreted.rs\",\n \"rank\": 35,\n \"score\": 209222.81150483442\n },\n {\n \"content\": \"fn load3<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol), Time, Diff)>+'a {\\n\\n read_file(&format!(\\\"{}{}\\\", prefix, filename))\\n\\n .filter(move |_| index == 0)\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n let mut elts = line.split('\\\\t');\\n\\n ((\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n ), 0, 1)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 36,\n \"score\": 207348.744491083\n },\n {\n \"content\": \"fn load4<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\\n\\n read_file(&format!(\\\"{}{}\\\", prefix, filename))\\n\\n .filter(move |_| index == 0)\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n let mut elts = line.split('\\\\t');\\n\\n ((\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n ), 0, 1)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 37,\n \"score\": 203290.20877422162\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\": 38,\n \"score\": 200829.5973722318\n },\n {\n \"content\": \"fn load5<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\\n\\n read_file(&format!(\\\"{}{}\\\", prefix, filename))\\n\\n .filter(move |_| index == 0)\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n let mut elts = line.split('\\\\t');\\n\\n ((\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n ), 0, 1)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 39,\n \"score\": 199388.94465529663\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\": 40,\n \"score\": 197548.57929519942\n },\n {\n \"content\": \"fn load6<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\\n\\n read_file(&format!(\\\"{}{}\\\", prefix, filename))\\n\\n .filter(move |_| index == 0)\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n let mut elts = line.split('\\\\t');\\n\\n ((\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n ), 0, 1)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 41,\n \"score\": 195635.90014654596\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\": 42,\n \"score\": 194494.05172426775\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\": 43,\n \"score\": 193493.8801828561\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\": 44,\n \"score\": 193493.88018285614\n },\n {\n \"content\": \"fn load7<'a>(index: usize, prefix: &str, filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=((Symbol, Symbol, Symbol, Symbol, Symbol, Symbol, Symbol), Time, Diff)>+'a {\\n\\n read_file(&format!(\\\"{}{}\\\", prefix, filename))\\n\\n .filter(move |_| index == 0)\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n let mut elts = line.split('\\\\t');\\n\\n ((\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n interner.intern(elts.next().unwrap()),\\n\\n ), 0, 1)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 45,\n \"score\": 192022.71120903429\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\": 46,\n \"score\": 190945.3846163027\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\": 47,\n \"score\": 181795.43084477726\n },\n {\n \"content\": \"#[inline(never)]\\n\\npub fn advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\\n\\n\\n\\n // start with no advance\\n\\n let mut index = 0;\\n\\n if index < slice.len() && function(&slice[index]) {\\n\\n\\n\\n // advance in exponentially growing steps.\\n\\n let mut step = 1;\\n\\n while index + step < slice.len() && function(&slice[index + step]) {\\n\\n index += step;\\n\\n step = step << 1;\\n\\n }\\n\\n\\n\\n // advance in exponentially shrinking steps.\\n\\n step = step >> 1;\\n\\n while step > 0 {\\n\\n if index + step < slice.len() && function(&slice[index + step]) {\\n\\n index += step;\\n\\n }\\n\\n step = step >> 1;\\n\\n }\\n\\n\\n\\n index += 1;\\n\\n }\\n\\n\\n\\n index\\n\\n}\\n\",\n \"file_path\": \"src/trace/implementations/graph.rs\",\n \"rank\": 48,\n \"score\": 179528.36734127984\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\": 49,\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\": 50,\n \"score\": 175987.9073013793\n },\n {\n \"content\": \"type Diff = isize;\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 51,\n \"score\": 172365.61393865137\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\": 52,\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\": 53,\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\": 54,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let mut args = std::env::args().skip(1);\\n\\n\\n\\n let filename = args.next().expect(\\\"must specify a filename\\\");\\n\\n let root: Node = args.next().expect(\\\"must specify root node\\\").parse().expect(\\\"root node must be an integer\\\");\\n\\n let batch: usize = args.next().expect(\\\"must specify batching\\\").parse().expect(\\\"batch must be an integer\\\");\\n\\n let compression: Time = args.next().expect(\\\"must specify compression\\\").parse().expect(\\\"compression must be an integer\\\");\\n\\n let inspect: bool = args.next().expect(\\\"must specify inspect bit\\\").parse().expect(\\\"inspect must be boolean\\\");\\n\\n\\n\\n // define a new computational scope, in which to run BFS\\n\\n timely::execute_from_args(args, move |worker| {\\n\\n\\n\\n let timer = ::std::time::Instant::now();\\n\\n let index = worker.index();\\n\\n let peers = worker.peers();\\n\\n\\n\\n // define BFS dataflow; return handles to roots and edges inputs\\n\\n let mut roots = InputSession::new();\\n\\n let mut graph = InputSession::new();\\n\",\n \"file_path\": \"examples/stackoverflow.rs\",\n \"rank\": 55,\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\": 56,\n \"score\": 169558.44478451117\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\": 57,\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\": 58,\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\": 59,\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\": 60,\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\": 61,\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\": 62,\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 = ::std::time::Instant::now();\\n\\n\\n\\n let peers = worker.peers();\\n\\n let index = worker.index();\\n\\n\\n\\n let query_filename = std::env::args().nth(1).expect(\\\"Argument 1 (query filename) missing.\\\");\\n\\n let query_text = std::fs::read_to_string(query_filename).expect(\\\"Failed to read query file\\\");\\n\\n let query = Query::build_from(query_text.lines());\\n\\n\\n\\n let mut relation_map = worker.dataflow::<(),_,_>(|scope| query.render_in(scope));\\n\\n\\n\\n if index == 0 { println!(\\\"{:?}:\\\\tDataflow assembled for {:?}\\\", timer.elapsed(), query); }\\n\\n\\n\\n // Build a dataflow to report final sizes.\\n\\n worker.dataflow(|scope| {\\n\\n for (name, data) in relation_map.iter_mut() {\\n\",\n \"file_path\": \"examples/graspan.rs\",\n \"rank\": 63,\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\": 64,\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\": 65,\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\": 66,\n \"score\": 169558.44478451117\n },\n {\n \"content\": \"type Time = u32;\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 67,\n \"score\": 168841.99539805713\n },\n {\n \"content\": \"type Time = u32;\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 68,\n \"score\": 168841.99539805713\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/stackoverflow.rs\",\n \"rank\": 69,\n \"score\": 168246.73557631223\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/cursors.rs\",\n \"rank\": 70,\n \"score\": 168246.73557631223\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/bfs.rs\",\n \"rank\": 71,\n \"score\": 168246.73557631223\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/interpreted.rs\",\n \"rank\": 72,\n \"score\": 168246.73557631223\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 73,\n \"score\": 168246.73557631223\n },\n {\n \"content\": \"// A differential version of item-based collaborative filtering using Jaccard similarity for\\n\\n// comparing item interaction histories. See Algorithm 1 in https://ssc.io/pdf/amnesia.pdf\\n\\n// for details.\\n\\nfn main() {\\n\\n\\n\\n timely::execute_from_args(std::env::args(), move |worker| {\\n\\n\\n\\n let mut interactions_input = InputSession::new();\\n\\n\\n\\n let probe = worker.dataflow(|scope| {\\n\\n\\n\\n let interactions = interactions_input.to_collection(scope);\\n\\n\\n\\n // Find all users with less than 500 interactions\\n\\n let users_with_enough_interactions = interactions\\n\\n .map(|(user, _item)| user)\\n\\n .count_total()\\n\\n .filter(move |(_user, count): &(u32, isize)| *count < 500)\\n\\n .map(|(user, _count)| user);\\n\\n\\n\\n // Remove users with too many interactions\\n\\n let remaining_interactions = interactions\\n\\n .semijoin(&users_with_enough_interactions);\\n\",\n \"file_path\": \"examples/itembased_cf.rs\",\n \"rank\": 74,\n \"score\": 166740.8485840942\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 batching = std::env::args().nth(2).unwrap().parse::<usize>().unwrap();\\n\\n\\n\\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\\n\\n\\n\\n // let timer = std::time::Instant::now();\\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 \"file_path\": \"dogsdogsdogs/examples/dogsdogsdogs.rs\",\n \"rank\": 75,\n \"score\": 166736.1804086232\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(1), 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 triangles(&Collection::new(edges.to_stream(scope))).inner.count().inspect(|x| println!(\\\"{:?}\\\", x));\\n\\n });\\n\\n\\n\\n }).unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"dogsdogsdogs/examples/ngo.rs\",\n \"rank\": 76,\n \"score\": 166736.1804086232\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 topic = std::env::args().nth(4).unwrap();\\n\\n\\n\\n let write = std::env::args().any(|x| x == \\\"write\\\");\\n\\n let read = std::env::args().any(|x| x == \\\"read\\\");\\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 let timer = ::std::time::Instant::now();\\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 roots, mut graph, _write_token, _read_token) = worker.dataflow(|scope| {\\n\\n\\n\\n let (root_input, roots) = scope.new_collection();\\n\",\n \"file_path\": \"examples/capture-test.rs\",\n \"rank\": 77,\n \"score\": 166736.1804086232\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 weight: u32 = std::env::args().nth(3).unwrap().parse().unwrap();\\n\\n let batch: u32 = std::env::args().nth(4).unwrap().parse().unwrap();\\n\\n let rounds: u32 = std::env::args().nth(5).unwrap().parse().unwrap();\\n\\n let inspect: bool = std::env::args().nth(6).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 let timer = ::std::time::Instant::now();\\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 roots, mut graph) = worker.dataflow(|scope| {\\n\\n\\n\\n let (root_input, roots) = scope.new_collection();\\n\\n let (edge_input, graph) = scope.new_collection();\\n\",\n \"file_path\": \"examples/monoid-bfs.rs\",\n \"rank\": 78,\n \"score\": 166736.1804086232\n },\n {\n \"content\": \"// Returns a weighted collection in which the weight of each node is proportional\\n\\n// to its PageRank in the input graph `edges`.\\n\\nfn pagerank<G>(iters: Iter, edges: &Collection<G, Edge, Diff>) -> Collection<G, Node, Diff>\\n\\nwhere\\n\\n G: Scope,\\n\\n G::Timestamp: Lattice,\\n\\n{\\n\\n // initialize many surfers at each node.\\n\\n let nodes =\\n\\n edges.flat_map(|(x,y)| Some(x).into_iter().chain(Some(y)))\\n\\n .distinct();\\n\\n\\n\\n // snag out-degrees for each node.\\n\\n let degrs = edges.map(|(src,_dst)| src)\\n\\n .count();\\n\\n\\n\\n edges.scope().iterative::<Iter,_,_>(|inner| {\\n\\n\\n\\n // Bring various collections into the scope.\\n\\n let edges = edges.enter(inner);\\n\\n let nodes = nodes.enter(inner);\\n\\n let degrs = degrs.enter(inner);\\n\",\n \"file_path\": \"examples/pagerank.rs\",\n \"rank\": 79,\n \"score\": 166211.89706630982\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/capture-test.rs\",\n \"rank\": 80,\n \"score\": 165567.92715485458\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"dogsdogsdogs/examples/ngo.rs\",\n \"rank\": 81,\n \"score\": 165567.92715485458\n },\n {\n \"content\": \"type Node = u32;\\n\",\n \"file_path\": \"examples/monoid-bfs.rs\",\n \"rank\": 82,\n \"score\": 165567.92715485458\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 batching = std::env::args().nth(2).unwrap().parse::<usize>().unwrap();\\n\\n let inspect = std::env::args().any(|x| x == \\\"inspect\\\");\\n\\n\\n\\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\\n\\n\\n\\n let timer = std::time::Instant::now();\\n\\n let graph = GraphMMap::new(&filename);\\n\\n\\n\\n let peers = worker.peers();\\n\\n let index = worker.index();\\n\\n\\n\\n let mut probe = Handle::new();\\n\\n\\n\\n let mut input = worker.dataflow::<usize,_,_>(|scope| {\\n\\n\\n\\n let (edges_input, edges) = scope.new_collection();\\n\",\n \"file_path\": \"dogsdogsdogs/examples/delta_query.rs\",\n \"rank\": 83,\n \"score\": 164077.04698340688\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 batching = std::env::args().nth(2).unwrap().parse::<usize>().unwrap();\\n\\n let inspect = std::env::args().any(|x| x == \\\"inspect\\\");\\n\\n\\n\\n timely::execute_from_args(std::env::args().skip(2), move |worker| {\\n\\n\\n\\n let timer = std::time::Instant::now();\\n\\n let graph = GraphMMap::new(&filename);\\n\\n\\n\\n let peers = worker.peers();\\n\\n let index = worker.index();\\n\\n\\n\\n let mut probe = Handle::new();\\n\\n\\n\\n let mut input = worker.dataflow::<usize,_,_>(|scope| {\\n\\n\\n\\n let (edges_input, edges) = scope.new_collection();\\n\",\n \"file_path\": \"dogsdogsdogs/examples/delta_query_wcoj.rs\",\n \"rank\": 84,\n \"score\": 161567.29798697718\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\": 85,\n \"score\": 158895.34830724995\n },\n {\n \"content\": \"/// Sorts and consolidate `vec[offset..]`.\\n\\n///\\n\\n/// This method will sort `vec[offset..]` 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_from<T: Ord, R: Semigroup>(vec: &mut Vec<(T, R)>, offset: usize) {\\n\\n let length = consolidate_slice(&mut vec[offset..]);\\n\\n vec.truncate(offset + length);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/consolidation.rs\",\n \"rank\": 86,\n \"score\": 153561.14397005027\n },\n {\n \"content\": \"type IntegerTrace = OrdValSpine<UnsignedWrapper<u64>, u64, usize, i64>;\\n\\n\\n\",\n \"file_path\": \"tests/trace.rs\",\n \"rank\": 87,\n \"score\": 151505.39705640345\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\": 88,\n \"score\": 151270.98366186125\n },\n {\n \"content\": \"fn load<'a>(filename: &str, interner: Rc<RefCell<StringInterner>>) -> impl Iterator<Item=Vec<Symbol>>+'a {\\n\\n use ::std::io::{BufReader, BufRead};\\n\\n use ::std::fs::File;\\n\\n let file = BufReader::new(File::open(filename).unwrap());\\n\\n file.lines()\\n\\n .filter_map(|line| line.ok())\\n\\n .map(move |line| {\\n\\n let mut interner = interner.borrow_mut();\\n\\n line.split('\\\\t')\\n\\n .map(move |string| interner.intern(string))\\n\\n .collect()\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 89,\n \"score\": 148328.67128585937\n },\n {\n \"content\": \"// type PrimitiveType = Type;\\n\\ntype ReferenceType = Type;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 90,\n \"score\": 147960.5705257153\n },\n {\n \"content\": \"/// Sorts and consolidates a slice, returning the valid prefix length.\\n\\npub fn consolidate_updates_slice<D: Ord, T: Ord, R: Semigroup>(slice: &mut [(D, 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_unstable_by(|x,y| (&x.0, &x.1).cmp(&(&y.0, &y.1)));\\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\": 91,\n \"score\": 145630.84312444145\n },\n {\n \"content\": \"/// Reports the number of elements satisfing the predicate.\\n\\n///\\n\\n/// This methods *relies strongly* on the assumption that the predicate\\n\\n/// stays false once it becomes false, a joint property of the predicate\\n\\n/// and the slice. This allows `advance` to use exponential search to\\n\\n/// count the number of elements in time logarithmic in the result.\\n\\npub fn advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\\n\\n\\n\\n let small_limit = 8;\\n\\n\\n\\n // Exponential seach if the answer isn't within `small_limit`.\\n\\n if slice.len() > small_limit && function(&slice[small_limit]) {\\n\\n\\n\\n // start with no advance\\n\\n let mut index = small_limit + 1;\\n\\n if index < slice.len() && function(&slice[index]) {\\n\\n\\n\\n // advance in exponentially growing steps.\\n\\n let mut step = 1;\\n\\n while index + step < slice.len() && function(&slice[index + step]) {\\n\\n index += step;\\n\\n step = step << 1;\\n\\n }\\n\\n\\n\\n // advance in exponentially shrinking steps.\\n\\n step = step >> 1;\\n\",\n \"file_path\": \"src/trace/layers/mod.rs\",\n \"rank\": 92,\n \"score\": 145352.54484221904\n },\n {\n \"content\": \"#[inline(never)]\\n\\npub fn advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\\n\\n\\n\\n\\t// start with no advance\\n\\n\\tlet mut index = 0;\\n\\n\\tif index < slice.len() && function(&slice[index]) {\\n\\n\\n\\n\\t\\t// advance in exponentially growing steps.\\n\\n\\t\\tlet mut step = 1;\\n\\n\\t\\twhile index + step < slice.len() && function(&slice[index + step]) {\\n\\n\\t\\t\\tindex += step;\\n\\n\\t\\t\\tstep = step << 1;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// advance in exponentially shrinking steps.\\n\\n\\t\\tstep = step >> 1;\\n\\n\\t\\twhile step > 0 {\\n\\n\\t\\t\\tif index + step < slice.len() && function(&slice[index + step]) {\\n\\n\\t\\t\\t\\tindex += step;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tstep = step >> 1;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tindex += 1;\\n\\n\\t}\\n\\n\\n\\n\\tindex\\n\\n}\\n\",\n \"file_path\": \"src/trace/implementations/vec.rs\",\n \"rank\": 93,\n \"score\": 145343.73097004968\n },\n {\n \"content\": \"type Type = Symbol;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 94,\n \"score\": 145160.01689609667\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\": 95,\n \"score\": 143628.04259754592\n },\n {\n \"content\": \"#[inline]\\n\\npub fn _advance<T, F: Fn(&T)->bool>(slice: &[T], function: F) -> usize {\\n\\n\\n\\n\\t// start with no advance\\n\\n\\tlet mut index = 0;\\n\\n\\tif index < slice.len() && function(&slice[index]) {\\n\\n\\n\\n\\t\\t// advance in exponentially growing steps.\\n\\n\\t\\tlet mut step = 1;\\n\\n\\t\\twhile index + step < slice.len() && function(&slice[index + step]) {\\n\\n\\t\\t\\tindex += step;\\n\\n\\t\\t\\tstep = step << 1;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\t// advance in exponentially shrinking steps.\\n\\n\\t\\tstep = step >> 1;\\n\\n\\t\\twhile step > 0 {\\n\\n\\t\\t\\tif index + step < slice.len() && function(&slice[index + step]) {\\n\\n\\t\\t\\t\\tindex += step;\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tstep = step >> 1;\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tindex += 1;\\n\\n\\t}\\n\\n\\n\\n\\tindex\\n\\n}\\n\",\n \"file_path\": \"src/trace/implementations/merge_batcher.rs\",\n \"rank\": 96,\n \"score\": 143219.05965029498\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\": 97,\n \"score\": 141244.05750045372\n },\n {\n \"content\": \"/// Sorts and consolidate `vec[offset..]`.\\n\\n///\\n\\n/// This method will sort `vec[offset..]` and then consolidate runs of more than one entry with\\n\\n/// identical first two elements by accumulating the third elements of the triples. Should the final\\n\\n/// accumulation be zero, the element is discarded.\\n\\npub fn consolidate_updates_from<D: Ord, T: Ord, R: Semigroup>(vec: &mut Vec<(D, T, R)>, offset: usize) {\\n\\n let length = consolidate_updates_slice(&mut vec[offset..]);\\n\\n vec.truncate(offset + length);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/consolidation.rs\",\n \"rank\": 98,\n \"score\": 141131.02578606442\n },\n {\n \"content\": \"type ArrayType = ReferenceType;\\n\",\n \"file_path\": \"doop/src/main.rs\",\n \"rank\": 99,\n \"score\": 138747.00604761273\n }\n]","isConversational":false}}},{"rowIdx":2997,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"boa/src/exec/mod.rs"},"repo_name":{"kind":"string","value":"RageKnify/boa"},"commit":{"kind":"string","value":"7d318f0582a2aac5a01af762635000c686452ab4"},"file_code":{"kind":"string","value":"\n\nmod array;\nmod block;\nmod break_node;\nmod call;\nmod conditional;\nmod declaration;\nmod field;\nmod identifier;\nmod iteration;\nmod new;\nmod object;\nmod operator;\nmod return_smt;\nmod spread;\nmod statement_list;\nmod switch;\nmod throw;\nmod try_node;\n\n#[cfg(test)]\nmod tests;\n\nuse crate::{\n syntax::ast::{constant::Const, node::Node},\n BoaProfiler, Context, Result, Value,\n};\n\npub trait Executable {\n \n fn run(&self, interpreter: &mut Context) -> Result<Value>;\n}\n\n#[derive(Debug, Eq, PartialEq)]\npub(crate) enum InterpreterState {\n Executing,\n Return,\n Break(Option<String>),\n Continue(Option<String>),\n}\n\n#[derive(Debug)]\npub struct Interpreter {\n \n state: InterpreterState,\n}\n\nimpl Default for Interpreter {\n fn default() -> Self {\n Self::new()\n }\n}\n\nimpl Interpreter {\n \n pub fn new() -> Self {\n Self {\n state: InterpreterState::Executing,\n }\n }\n\n #[inline]\n pub(crate) fn set_current_state(&mut self, new_state: InterpreterState) {\n self.state = new_state\n }\n\n #[inline]\n pub(crate) fn get_current_state(&self) -> &InterpreterState {\n &self.state\n }\n}\n\nimpl Executable for Node {\n fn run(&self, interpreter: &mut Context) -> Result<Value> {\n let _timer = BoaProfiler::global().start_event(\"Executable\", \"exec\");\n match *self {\n Node::Const(Const::Null) => Ok(Value::null()),\n Node::Const(Const::Num(num)) => Ok(Value::rational(num)),\n Node::Const(Const::Int(num)) => Ok(Value::integer(num)),\n Node::Const(Const::BigInt(ref num)) => Ok(Value::from(num.clone())),\n Node::Const(Const::Undefined) => Ok(Value::Undefined),\n \n \n \n Node::Const(Const::String(ref value)) => Ok(Value::string(value.to_string())),\n Node::Const(Const::Bool(value)) => Ok(Value::boolean(value)),\n Node::Block(ref block) => block.run(interpreter),\n Node::Identifier(ref identifier) => identifier.run(interpreter),\n Node::GetConstField(ref get_const_field_node) => get_const_field_node.run(interpreter),\n Node::GetField(ref get_field) => get_field.run(interpreter),\n Node::Call(ref call) => call.run(interpreter),\n Node::WhileLoop(ref while_loop) => while_loop.run(interpreter),\n Node::DoWhileLoop(ref do_while) => do_while.run(interpreter),\n Node::ForLoop(ref for_loop) => for_loop.run(interpreter),\n Node::If(ref if_smt) => if_smt.run(interpreter),\n Node::ConditionalOp(ref op) => op.run(interpreter),\n Node::Switch(ref switch) => switch.run(interpreter),\n Node::Object(ref obj) => obj.run(interpreter),\n Node::ArrayDecl(ref arr) => arr.run(interpreter),\n \n Node::FunctionDecl(ref decl) => decl.run(interpreter),\n \n Node::FunctionExpr(ref function_expr) => function_expr.run(interpreter),\n Node::ArrowFunctionDecl(ref decl) => decl.run(interpreter),\n Node::BinOp(ref op) => op.run(interpreter),\n Node::UnaryOp(ref op) => op.run(interpreter),\n Node::New(ref call) => call.run(interpreter),\n Node::Return(ref ret) => ret.run(interpreter),\n Node::Throw(ref throw) => throw.run(interpreter),\n Node::Assign(ref op) => op.run(interpreter),\n Node::VarDeclList(ref decl) => decl.run(interpreter),\n Node::LetDeclList(ref decl) => decl.run(interpreter),\n Node::ConstDeclList(ref decl) => decl.run(interpreter),\n Node::Spread(ref spread) => spread.run(interpreter),\n Node::This => {\n \n Ok(interpreter.realm().environment.get_this_binding())\n }\n Node::Try(ref try_node) => try_node.run(interpreter),\n Node::Break(ref break_node) => break_node.run(interpreter),\n Node::Continue(ref continue_node) => continue_node.run(interpreter),\n }\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nmod array;\nmod block;\nmod break_node;\nmod call;\nmod conditional;\nmod declaration;\nmod field;\nmod identifier;\nmod iteration;\nmod new;\nmod object;\nmod operator;\nmod return_smt;\nmod spread;\nmod statement_list;\nmod switch;\nmod throw;\nmod try_node;\n\n#[cfg(test)]\nmod tests;\n\nuse crate::{\n syntax::ast::{constant::Const, node::Node},\n BoaProfiler, Context, Result, Value,\n};\n\npub trait Executable {\n \n fn run(&self, interpreter: &mut Context) -> Result<Value>;\n}\n\n#[derive(Debug, Eq, PartialEq)]\npub(crate) enum InterpreterState {\n Executing,\n Return,\n Break(Option<String>),\n Continue(Option<String>),\n}\n\n#[derive(Debug)]\npub struct Interpreter {\n \n state: InterpreterState,\n}\n\nimpl Default for Interpreter {\n fn default() -> Self {\n Self::new()\n }\n}\n\nimpl Interpreter {\n \n pub fn new() -> Self {\n Self {\n state: InterpreterState::Executing,\n }\n }\n\n #[inline]\n pub(crate) fn set_current_state(&mut self, new_state: InterpreterState) {\n self.state = new_state\n }\n\n #[inline]\n pub(crate) fn get_current_state(&self) -> &InterpreterState {\n &self.state\n }\n}\n\nimpl Executable for Node {\n fn run(&self, interpreter: &mut Context) -> Result<Value> {\n let _timer = BoaProfiler::global().start_event(\"Executable\", \"exec\");\n match *self {\n Node::Const(Const::Null) => Ok(Value::null()),\n Node::Const(Const::Num(num)) => Ok(Value::rational(num)),\n Node::Const(Const::Int(num)) => Ok(Value::integer(num)),\n Node::Const(Const::BigInt(ref num)) => Ok(Value::from(num.clone())),\n Node::Const(Const::Undefined) => Ok(Value::Undefined),\n \n \n \n Node::Const(Const::String(ref value)) => Ok(Value::string(value.to_string())),\n Node::Const(Const::Bool(value)) => Ok(Value::boolean(value)),\n Node::Block(ref block) => block.run(interpreter),\n Node::Identifier(ref identifier) => identifier.run(interpreter),\n Node::GetConstField(ref get_const_field_node) => get_const_field_node.run(interpreter),\n Node::GetField(ref get_field) => get_field.run(interpreter),\n Node::Call(ref call) => call.run(interpreter),\n Node::WhileLoop(ref while_loo"},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"p) => while_loop.run(interpreter),\n Node::DoWhileLoop(ref do_while) => do_while.run(interpreter),\n Node::ForLoop(ref for_loop) => for_loop.run(interpreter),\n Node::If(ref if_smt) => if_smt.run(interpreter),\n Node::ConditionalOp(ref op) => op.run(interpreter),\n Node::Switch(ref switch) => switch.run(interpreter),\n Node::Object(ref obj) => obj.run(interpreter),\n Node::ArrayDecl(ref arr) => arr.run(interpreter),\n \n Node::FunctionDecl(ref decl) => decl.run(interpreter),\n \n Node::FunctionExpr(ref function_expr) => function_expr.run(interpreter),\n Node::ArrowFunctionDecl(ref decl) => decl.run(interpreter),\n Node::BinOp(ref op) => op.run(interpreter),\n Node::UnaryOp(ref op) => op.run(interpreter),\n Node::New(ref call) => call.run(interpreter),\n Node::Return(ref ret) => ret.run(interpreter),\n Node::Throw(ref throw) => throw.run(interpreter),\n Node::Assign(ref op) => op.run(interpreter),\n Node::VarDeclList(ref decl) => decl.run(interpreter),\n Node::LetDeclList(ref decl) => decl.run(interpreter),\n Node::ConstDeclList(ref decl) => decl.run(interpreter),\n Node::Spread(ref spread) => spread.run(interpreter),\n Node::This => {\n \n Ok(interpreter.realm().environment.get_this_binding())\n }\n Node::Try(ref try_node) => try_node.run(interpreter),\n Node::Break(ref break_node) => break_node.run(interpreter),\n Node::Continue(ref continue_node) => continue_node.run(interpreter),\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"#[inline]\n\npub fn this_time_value(value: &Value, ctx: &mut Context) -> Result<Date> {\n\n if let Value::Object(ref object) = value {\n\n if let ObjectData::Date(ref date) = object.borrow().data {\n\n return Ok(*date);\n\n }\n\n }\n\n Err(ctx.construct_type_error(\"'this' is not a Date\"))\n\n}\n","file_path":"boa/src/builtins/date/mod.rs","rank":0,"score":357037.48474957317},{"content":"/// Create new function `[[Construct]]`\n\n///\n\n// This gets called when a new Function() is created.\n\npub fn make_function(this: &Value, _: &[Value], _: &mut Context) -> Result<Value> {\n\n this.set_data(ObjectData::Function(Function::BuiltIn(\n\n BuiltInFunction(|_, _, _| Ok(Value::undefined())),\n\n FunctionFlags::CALLABLE | FunctionFlags::CONSTRUCTABLE,\n\n )));\n\n Ok(this.clone())\n\n}\n\n\n","file_path":"boa/src/builtins/function/mod.rs","rank":1,"score":353623.60809848504},{"content":"/// This represents the `console` formatter.\n\npub fn formatter(data: &[Value], ctx: &mut Context) -> Result<String> {\n\n let target = data.get(0).cloned().unwrap_or_default().to_string(ctx)?;\n\n\n\n match data.len() {\n\n 0 => Ok(String::new()),\n\n 1 => Ok(target.to_string()),\n\n _ => {\n\n let mut formatted = String::new();\n\n let mut arg_index = 1;\n\n let mut chars = target.chars();\n\n while let Some(c) = chars.next() {\n\n if c == '%' {\n\n let fmt = chars.next().unwrap_or('%');\n\n match fmt {\n\n /* integer */\n\n 'd' | 'i' => {\n\n let arg = data\n\n .get(arg_index)\n\n .cloned()\n\n .unwrap_or_default()\n","file_path":"boa/src/builtins/console/mod.rs","rank":2,"score":343234.7963965172},{"content":"#[inline]\n\npub fn init(interpreter: &mut Context) {\n\n let globals = [\n\n // The `Function` global must be initialized before other types.\n\n function::init,\n\n Object::init,\n\n Array::init,\n\n BigInt::init,\n\n Boolean::init,\n\n Date::init,\n\n Json::init,\n\n Map::init,\n\n Math::init,\n\n Number::init,\n\n RegExp::init,\n\n String::init,\n\n Symbol::init,\n\n Console::init,\n\n // Global error types.\n\n Error::init,\n\n RangeError::init,\n","file_path":"boa/src/builtins/mod.rs","rank":3,"score":340734.68303004955},{"content":"#[inline]\n\npub fn init(interpreter: &mut Context) -> (&'static str, Value) {\n\n let global = interpreter.global_object();\n\n let _timer = BoaProfiler::global().start_event(\"function\", \"init\");\n\n let prototype = Value::new_object(Some(global));\n\n\n\n let function_object =\n\n make_constructor_fn(\"Function\", 1, make_function, global, prototype, true, true);\n\n\n\n (\"Function\", function_object)\n\n}\n","file_path":"boa/src/builtins/function/mod.rs","rank":4,"score":338863.86140603875},{"content":"#[test]\n\nfn default_not_taken_switch() {\n\n let scenario = r#\"\n\n let a = 5;\n\n\n\n switch (a) {\n\n case 5:\n\n a = 150;\n\n break;\n\n default:\n\n a = 70;\n\n }\n\n \n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"150\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":6,"score":261862.8602969392},{"content":"#[test]\n\nfn default_taken_switch() {\n\n let scenario = r#\"\n\n let a = 10;\n\n\n\n switch (a) {\n\n case 5:\n\n a = 150;\n\n break;\n\n default:\n\n a = 70;\n\n }\n\n \n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"70\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":7,"score":261862.8602969392},{"content":"#[test]\n\nfn test_result_of_empty_block() {\n\n let scenario = \"{}\";\n\n assert_eq!(&exec(scenario), \"undefined\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":8,"score":261144.09365715494},{"content":"#[test]\n\nfn for_loop_return() {\n\n let scenario = r#\"\n","file_path":"boa/src/exec/iteration/tests.rs","rank":9,"score":255289.82843878862},{"content":"#[test]\n\nfn array_field_set() {\n\n let element_changes = r#\"\n\n let m = [1, 2, 3];\n\n m[1] = 5;\n\n m[1]\n\n \"#;\n\n assert_eq!(&exec(element_changes), \"5\");\n\n\n\n let length_changes = r#\"\n\n let m = [1, 2, 3];\n\n m[10] = 52;\n\n m.length\n\n \"#;\n\n assert_eq!(&exec(length_changes), \"11\");\n\n\n\n let negative_index_wont_affect_length = r#\"\n\n let m = [1, 2, 3];\n\n m[-11] = 5;\n\n m.length\n\n \"#;\n\n assert_eq!(&exec(negative_index_wont_affect_length), \"3\");\n\n\n\n let non_num_key_wont_affect_length = r#\"\n\n let m = [1, 2, 3];\n\n m[\"magic\"] = 5;\n\n m.length\n\n \"#;\n\n assert_eq!(&exec(non_num_key_wont_affect_length), \"3\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":10,"score":255111.44482839562},{"content":"#[test]\n\nfn object_field_set() {\n\n let scenario = r#\"\n\n let m = {};\n\n m['key'] = 22;\n\n m['key']\n\n \"#;\n\n assert_eq!(&exec(scenario), \"22\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":11,"score":255084.24944580358},{"content":"#[test]\n\nfn function_declaration_returns_undefined() {\n\n let scenario = r#\"\n","file_path":"boa/src/exec/tests.rs","rank":12,"score":249586.98632660974},{"content":"#[test]\n\nfn for_loop_continue_out_of_switch() {\n\n let scenario = r#\"\n\n var a = 0, b = 0, c = 0;\n\n for (let i = 0; i < 3; i++) {\n\n a++;\n\n switch (i) {\n\n case 0:\n\n continue;\n\n c++;\n\n case 1:\n\n continue;\n\n case 5:\n\n c++;\n\n }\n\n b++;\n\n }\n\n [a, b, c]\n\n \"#;\n\n assert_eq!(&exec(scenario), \"[ 3, 1, 0 ]\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":13,"score":249555.26039999418},{"content":"#[test]\n\nfn identifier_on_global_object_undefined() {\n\n let scenario = r#\"\n\n try {\n\n bar;\n\n } catch (err) {\n\n err.message\n\n }\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"\\\"bar is not defined\\\"\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":14,"score":249404.8915987378},{"content":"pub fn new_object_environment(object: Value, environment: Option<Environment>) -> Environment {\n\n Gc::new(GcCell::new(Box::new(ObjectEnvironmentRecord {\n\n bindings: object,\n\n outer_env: environment,\n\n /// Object Environment Records created for with statements (13.11)\n\n /// can provide their binding object as an implicit this value for use in function calls.\n\n /// The capability is controlled by a withEnvironment Boolean value that is associated\n\n /// with each object Environment Record. By default, the value of withEnvironment is false\n\n /// for any object Environment Record.\n\n with_environment: false,\n\n })))\n\n}\n\n\n","file_path":"boa/src/environment/lexical_environment.rs","rank":15,"score":248762.0844104546},{"content":"#[test]\n\nfn assignmentoperator_rhs_throws_error() {\n\n let scenario = r#\"\n\n try {\n\n let a;\n\n a += b\n\n } catch (err) {\n\n err.toString()\n\n }\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"\\\"ReferenceError: b is not defined\\\"\");\n\n}\n","file_path":"boa/src/exec/operator/tests.rs","rank":16,"score":244218.82026144036},{"content":"#[test]\n\nfn check_post_state() {\n\n let mut engine = Context::new();\n\n\n\n let brk: Break = Break::new(\"label\");\n\n\n\n brk.run(&mut engine).unwrap();\n\n\n\n assert_eq!(\n\n engine.executor().get_current_state(),\n\n &InterpreterState::Break(Some(\"label\".to_string()))\n\n );\n\n}\n","file_path":"boa/src/exec/break_node/tests.rs","rank":17,"score":244075.88723480213},{"content":"/// Arguments.\n\n///\n\n/// <https://tc39.es/ecma262/#sec-createunmappedargumentsobject>\n\npub fn create_unmapped_arguments_object(arguments_list: &[Value]) -> Value {\n\n let len = arguments_list.len();\n\n let mut obj = Object::default();\n\n // Set length\n\n let length = Property::data_descriptor(\n\n len.into(),\n\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::PERMANENT,\n\n );\n\n // Define length as a property\n\n obj.define_own_property(\"length\", length);\n\n let mut index: usize = 0;\n\n while index < len {\n\n let val = arguments_list.get(index).expect(\"Could not get argument\");\n\n let prop = Property::data_descriptor(\n\n val.clone(),\n\n Attribute::WRITABLE | Attribute::ENUMERABLE | Attribute::CONFIGURABLE,\n\n );\n\n\n\n obj.insert_property(index, prop);\n\n index += 1;\n\n }\n\n\n\n Value::from(obj)\n\n}\n\n\n","file_path":"boa/src/builtins/function/mod.rs","rank":18,"score":243325.69797778988},{"content":"/// Utility to join multiple Nodes into a single string.\n\nfn join_nodes<N>(f: &mut fmt::Formatter<'_>, nodes: &[N]) -> fmt::Result\n\nwhere\n\n N: Display,\n\n{\n\n let mut first = true;\n\n for e in nodes {\n\n if !first {\n\n f.write_str(\", \")?;\n\n }\n\n first = false;\n\n Display::fmt(e, f)?;\n\n }\n\n Ok(())\n\n}\n\n\n\n/// \"Formal parameter\" is a fancy way of saying \"function parameter\".\n\n///\n\n/// In the declaration of a function, the parameters must be identifiers,\n\n/// not any value like numbers, strings, or objects.\n\n///```text\n","file_path":"boa/src/syntax/ast/node/mod.rs","rank":19,"score":241283.65533507115},{"content":"fn assert_throws(engine: &mut Context, src: &str, error_type: &str) {\n\n let result = forward(engine, src);\n\n assert!(result.contains(error_type));\n\n}\n","file_path":"boa/src/builtins/bigint/tests.rs","rank":20,"score":234239.30652085572},{"content":"/// This trait allows Rust types to be passed around as objects.\n\n///\n\n/// This is automatically implemented, when a type implements `Debug`, `Any` and `Trace`.\n\npub trait NativeObject: Debug + Any + Trace {\n\n /// Convert the Rust type which implements `NativeObject` to a `&dyn Any`.\n\n fn as_any(&self) -> &dyn Any;\n\n\n\n /// Convert the Rust type which implements `NativeObject` to a `&mut dyn Any`.\n\n fn as_mut_any(&mut self) -> &mut dyn Any;\n\n}\n\n\n\nimpl<T: Any + Debug + Trace> NativeObject for T {\n\n fn as_any(&self) -> &dyn Any {\n\n self as &dyn Any\n\n }\n\n\n\n fn as_mut_any(&mut self) -> &mut dyn Any {\n\n self as &mut dyn Any\n\n }\n\n}\n\n\n\n/// The internal representation of an JavaScript object.\n\n#[derive(Debug, Trace, Finalize)]\n","file_path":"boa/src/object/mod.rs","rank":21,"score":228419.22638083706},{"content":"fn for_loop_execution(c: &mut Criterion) {\n\n // Create new Realm and interpreter.\n\n let mut engine = Context::new();\n\n\n\n // Parse the AST nodes.\n\n let nodes = Parser::new(FOR_LOOP.as_bytes()).parse_all().unwrap();\n\n\n\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\n\n c.bench_function(\"For loop (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic FIBONACCI: &str = include_str!(\"bench_scripts/fibonacci.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":22,"score":225214.32752933505},{"content":"fn arithmetic_operations(c: &mut Criterion) {\n\n let mut engine = Context::new();\n\n\n\n let nodes = Parser::new(ARITHMETIC_OPERATIONS.as_bytes())\n\n .parse_all()\n\n .unwrap();\n\n\n\n c.bench_function(\"Arithmetic operations (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic CLEAN_JS: &str = include_str!(\"bench_scripts/clean_js.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":23,"score":225029.06655030104},{"content":"fn array_pop(c: &mut Criterion) {\n\n let mut engine = Context::new();\n\n\n\n let nodes = Parser::new(ARRAY_POP.as_bytes()).parse_all().unwrap();\n\n\n\n c.bench_function(\"Array pop (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic STRING_CONCAT: &str = include_str!(\"bench_scripts/string_concat.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":24,"score":224808.754898185},{"content":"fn array_creation(c: &mut Criterion) {\n\n let mut engine = Context::new();\n\n\n\n let nodes = Parser::new(ARRAY_CREATE.as_bytes()).parse_all().unwrap();\n\n\n\n c.bench_function(\"Array creation (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic ARRAY_POP: &str = include_str!(\"bench_scripts/array_pop.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":25,"score":224808.754898185},{"content":"fn array_access(c: &mut Criterion) {\n\n let mut engine = Context::new();\n\n\n\n let nodes = Parser::new(ARRAY_ACCESS.as_bytes()).parse_all().unwrap();\n\n\n\n c.bench_function(\"Array access (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic ARRAY_CREATE: &str = include_str!(\"bench_scripts/array_create.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":26,"score":224808.754898185},{"content":"fn object_creation(c: &mut Criterion) {\n\n // Create new Realm and interpreter.\n\n let mut engine = Context::new();\n\n\n\n // Parse the AST nodes.\n\n let nodes = Parser::new(OBJECT_CREATION.as_bytes()).parse_all().unwrap();\n\n\n\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\n\n c.bench_function(\"Object Creation (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic OBJECT_PROP_ACCESS_CONST: &str = include_str!(\"bench_scripts/object_prop_access_const.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":27,"score":224781.55951559293},{"content":"#[test]\n\nfn string_switch() {\n\n let scenario = r#\"\n\n let a = \"hello\";\n\n\n\n switch (a) {\n\n case \"hello\":\n\n a = \"world\";\n\n break;\n\n default:\n\n a = \"hi\";\n\n }\n\n \n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"\\\"world\\\"\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":28,"score":220918.1755513723},{"content":"#[test]\n\nfn no_cases_switch() {\n\n let scenario = r#\"\n\n let a = 10;\n\n switch (a) {\n\n }\n\n \n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"10\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":29,"score":220918.17555137232},{"content":"#[test]\n\nfn test_conditional_op() {\n\n let scenario = \"1 === 2 ? 'a' : 'b'\";\n\n assert_eq!(&exec(scenario), \"\\\"b\\\"\");\n\n}\n","file_path":"boa/src/exec/tests.rs","rank":30,"score":220424.67482444123},{"content":"fn string_object_access(c: &mut Criterion) {\n\n let mut engine = Context::new();\n\n\n\n let nodes = Parser::new(STRING_OBJECT_ACCESS.as_bytes())\n\n .parse_all()\n\n .unwrap();\n\n\n\n c.bench_function(\"String Object Access (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic ARITHMETIC_OPERATIONS: &str = include_str!(\"bench_scripts/arithmetic_operations.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":31,"score":220201.5514132485},{"content":"fn number_object_access(c: &mut Criterion) {\n\n let mut engine = Context::new();\n\n\n\n let nodes = Parser::new(NUMBER_OBJECT_ACCESS.as_bytes())\n\n .parse_all()\n\n .unwrap();\n\n\n\n c.bench_function(\"Number Object Access (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic BOOLEAN_OBJECT_ACCESS: &str = include_str!(\"bench_scripts/boolean_object_access.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":32,"score":220201.5514132485},{"content":"fn boolean_object_access(c: &mut Criterion) {\n\n let mut engine = Context::new();\n\n\n\n let nodes = Parser::new(BOOLEAN_OBJECT_ACCESS.as_bytes())\n\n .parse_all()\n\n .unwrap();\n\n\n\n c.bench_function(\"Boolean Object Access (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic STRING_OBJECT_ACCESS: &str = include_str!(\"bench_scripts/string_object_access.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":33,"score":220201.5514132485},{"content":"#[test]\n\nfn is_object() {\n\n let val = Value::new_object(None);\n\n assert_eq!(val.is_object(), true);\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":34,"score":218508.02016138643},{"content":"#[test]\n\nfn to_object() {\n\n let mut engine = Context::new();\n\n\n\n assert!(Value::undefined()\n\n .to_object(&mut engine)\n\n .unwrap_err()\n\n .is_object());\n\n assert!(Value::null()\n\n .to_object(&mut engine)\n\n .unwrap_err()\n\n .is_object());\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":35,"score":218481.3150389026},{"content":"#[test]\n\nfn two_case_switch() {\n\n let scenario = r#\"\n\n let a = 10;\n\n switch (a) {\n\n case 5:\n\n a = 15;\n\n break;\n\n case 10:\n\n a = 20;\n\n break;\n\n }\n\n \n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"20\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":36,"score":216619.615200567},{"content":"#[test]\n\nfn no_true_case_switch() {\n\n let scenario = r#\"\n\n let a = 10;\n\n switch (a) {\n\n case 5:\n\n a = 15;\n\n break;\n\n }\n\n \n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"10\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":37,"score":216619.615200567},{"content":"#[test]\n\nfn single_case_switch() {\n\n let scenario = r#\"\n\n let a = 10;\n\n switch (a) {\n\n case 10:\n\n a = 20;\n\n break;\n\n }\n\n \n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"20\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":38,"score":216619.615200567},{"content":"#[test]\n\nfn bigger_switch_example() {\n\n let expected = [\n\n \"\\\"Mon\\\"\",\n\n \"\\\"Tue\\\"\",\n\n \"\\\"Wed\\\"\",\n\n \"\\\"Thurs\\\"\",\n\n \"\\\"Fri\\\"\",\n\n \"\\\"Sat\\\"\",\n\n \"\\\"Sun\\\"\",\n\n ];\n\n\n\n for (i, val) in expected.iter().enumerate() {\n\n let scenario = format!(\n\n r#\"\n\n let a = {};\n\n let b = \"unknown\";\n\n\n\n switch (a) {{\n\n case 0:\n\n b = \"Mon\";\n","file_path":"boa/src/exec/switch/tests.rs","rank":39,"score":216619.615200567},{"content":"fn object_prop_access_const(c: &mut Criterion) {\n\n // Create new Realm and interpreter.\n\n let mut engine = Context::new();\n\n\n\n // Parse the AST nodes.\n\n let nodes = Parser::new(OBJECT_PROP_ACCESS_CONST.as_bytes())\n\n .parse_all()\n\n .unwrap();\n\n\n\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\n\n c.bench_function(\"Static Object Property Access (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic OBJECT_PROP_ACCESS_DYN: &str = include_str!(\"bench_scripts/object_prop_access_dyn.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":40,"score":215845.52491736907},{"content":"fn object_prop_access_dyn(c: &mut Criterion) {\n\n // Create new Realm and interpreter.\n\n let mut engine = Context::new();\n\n\n\n // Parse the AST nodes.\n\n let nodes = Parser::new(OBJECT_PROP_ACCESS_DYN.as_bytes())\n\n .parse_all()\n\n .unwrap();\n\n\n\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\n\n c.bench_function(\"Dynamic Object Property Access (Execution)\", move |b| {\n\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\n\n });\n\n}\n\n\n\nstatic REGEXP_LITERAL_CREATION: &str = include_str!(\"bench_scripts/regexp_literal_creation.js\");\n\n\n","file_path":"boa/benches/exec.rs","rank":41,"score":215845.52491736907},{"content":"#[test]\n\nfn spread_with_arguments() {\n\n let mut engine = Context::new();\n\n\n\n let scenario = r#\"\n\n const a = [1, \"test\", 3, 4];\n","file_path":"boa/src/exec/tests.rs","rank":42,"score":213885.83966416545},{"content":"#[test]\n\nfn early_return() {\n\n let early_return = r#\"\n","file_path":"boa/src/exec/tests.rs","rank":43,"score":213838.15952538123},{"content":"#[test]\n\nfn comma_operator() {\n\n let scenario = r#\"\n\n var a, b;\n\n b = 10;\n\n a = (b++, b);\n\n a\n\n \"#;\n\n assert_eq!(&exec(scenario), \"11\");\n\n\n\n let scenario = r#\"\n\n var a, b;\n\n b = 10;\n\n a = (b += 5, b /= 3, b - 3);\n\n a\n\n \"#;\n\n assert_eq!(&exec(scenario), \"2\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":44,"score":213712.60883103716},{"content":"#[test]\n\nfn tilde_operator() {\n\n let float = r#\"\n\n let f = -1.2;\n\n ~f\n\n \"#;\n\n assert_eq!(&exec(float), \"0\");\n\n\n\n let numeric = r#\"\n\n let f = 1789;\n\n ~f\n\n \"#;\n\n assert_eq!(&exec(numeric), \"-1790\");\n\n\n\n let nan = r#\"\n\n var m = NaN;\n\n ~m\n\n \"#;\n\n assert_eq!(&exec(nan), \"-1\");\n\n\n\n let object = r#\"\n","file_path":"boa/src/exec/tests.rs","rank":45,"score":213712.60883103716},{"content":"#[test]\n\n#[ignore] // TODO: Once objects are printed in a simpler way this test can be simplified and used\n\nfn display_object() {\n\n let mut engine = Context::new();\n\n let d_obj = r#\"\n\n let o = {a: 'a'};\n\n o\n\n \"#;\n\n let value = forward_val(&mut engine, d_obj).unwrap();\n\n assert_eq!(\n\n value.display().to_string(),\n\n r#\"{\n\n a: \"a\",\n\n__proto__: {\n\nconstructor: {\n\nsetPrototypeOf: {\n\n length: 2\n\n },\n\n prototype: [Cycle],\n\n name: \"Object\",\n\n length: 1,\n\ndefineProperty: {\n","file_path":"boa/src/value/tests.rs","rank":46,"score":213495.30302114322},{"content":"#[test]\n\nfn debug_object() {\n\n let mut engine = Context::new();\n\n let value = forward_val(&mut engine, \"new Array([new Date()])\").unwrap();\n\n\n\n // We don't care about the contents of the debug display (it is *debug* after all). In the commit that this test was\n\n // added, this would cause a stack overflow, so executing Debug::fmt is the assertion.\n\n //\n\n // However, we want to make sure that no data is being left in the internal hashset, so executing this twice should\n\n // result in the same output.\n\n assert_eq!(format!(\"{:?}\", value), format!(\"{:?}\", value));\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":47,"score":213484.57106078436},{"content":"#[test]\n\nfn hash_object() {\n\n let object1 = Value::object(Object::default());\n\n assert_eq!(object1, object1);\n\n assert_eq!(object1, object1.clone());\n\n\n\n let object2 = Value::object(Object::default());\n\n assert_ne!(object1, object2);\n\n\n\n assert_eq!(hash_value(&object1), hash_value(&object1.clone()));\n\n assert_ne!(hash_value(&object1), hash_value(&object2));\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":48,"score":213484.57106078434},{"content":"#[test]\n\nfn typeof_object() {\n\n let typeof_object = r#\"\n\n let a = {};\n\n typeof a;\n\n \"#;\n\n assert_eq!(&exec(typeof_object), \"\\\"object\\\"\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":49,"score":213458.57062797187},{"content":"#[test]\n\nfn let_declaration() {\n\n check_parser(\n\n \"let a = 5;\",\n\n vec![LetDeclList::from(vec![LetDecl::new(\"a\", Node::from(Const::from(5)))]).into()],\n\n );\n\n}\n\n\n\n/// Checks `let` declaration parsing with reserved words.\n","file_path":"boa/src/syntax/parser/statement/declaration/tests.rs","rank":50,"score":212938.41448748918},{"content":"#[test]\n\nfn two_case_no_break_switch() {\n\n let scenario = r#\"\n\n let a = 10;\n\n let b = 10;\n\n\n\n switch (a) {\n\n case 10:\n\n a = 150;\n\n case 20:\n\n b = 150;\n\n break;\n\n }\n\n \n\n a + b;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"300\");\n\n}\n\n\n","file_path":"boa/src/exec/switch/tests.rs","rank":51,"score":212514.9819385669},{"content":"#[test]\n\nfn sub_number_object_and_number_object() {\n\n let mut engine = Context::new();\n\n\n\n let value = forward_val(&mut engine, \"new Number(1) - new Number(999)\").unwrap();\n\n let value = value.to_i32(&mut engine).unwrap();\n\n assert_eq!(value, -998);\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":52,"score":212140.0070023422},{"content":"#[test]\n\nfn add_number_object_and_string_object() {\n\n let mut engine = Context::new();\n\n\n\n let value = forward_val(&mut engine, \"new Number(10) + new String(\\\"0\\\")\").unwrap();\n\n let value = value.to_string(&mut engine).unwrap();\n\n assert_eq!(value, \"100\");\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":53,"score":212140.0070023422},{"content":"#[wasm_bindgen]\n\npub fn evaluate(src: &str) -> Result<String, JsValue> {\n\n // Setup executor\n\n let mut engine = Context::new();\n\n\n\n let expr = match parse(src) {\n\n Ok(res) => res,\n\n Err(e) => {\n\n return Err(format!(\n\n \"Uncaught {}\",\n\n engine\n\n .throw_syntax_error(e.to_string())\n\n .expect_err(\"interpreter.throw_syntax_error() did not return an error\")\n\n .display()\n\n )\n\n .into());\n\n }\n\n };\n\n expr.run(&mut engine)\n\n .map_err(|e| JsValue::from(format!(\"Uncaught {}\", e.display())))\n\n .map(|v| v.display().to_string())\n\n}\n","file_path":"boa_wasm/src/lib.rs","rank":54,"score":211406.35155318014},{"content":"#[test]\n\nfn get_set_field() {\n\n let obj = Value::new_object(None);\n\n // Create string and convert it to a Value\n\n let s = Value::from(\"bar\");\n\n obj.set_field(\"foo\", s);\n\n assert_eq!(obj.get_field(\"foo\").display().to_string(), \"\\\"bar\\\"\");\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":55,"score":209126.42456356777},{"content":"#[test]\n\nfn let_declaration_no_spaces() {\n\n check_parser(\n\n \"let a=5;\",\n\n vec![LetDeclList::from(vec![LetDecl::new(\"a\", Node::from(Const::from(5)))]).into()],\n\n );\n\n}\n\n\n\n/// Checks empty `let` declaration parsing.\n","file_path":"boa/src/syntax/parser/statement/declaration/tests.rs","rank":56,"score":209003.47694130227},{"content":"#[test]\n\nfn empty_let_declaration() {\n\n check_parser(\n\n \"let a;\",\n\n vec![LetDeclList::from(vec![LetDecl::new(\"a\", None)]).into()],\n\n );\n\n}\n\n\n\n/// Checks multiple `let` declarations.\n","file_path":"boa/src/syntax/parser/statement/declaration/tests.rs","rank":57,"score":209003.47694130227},{"content":"#[test]\n\nfn multiple_let_declaration() {\n\n check_parser(\n\n \"let a = 5, b, c = 6;\",\n\n vec![LetDeclList::from(vec![\n\n LetDecl::new(\"a\", Node::from(Const::from(5))),\n\n LetDecl::new(\"b\", None),\n\n LetDecl::new(\"c\", Node::from(Const::from(6))),\n\n ])\n\n .into()],\n\n );\n\n}\n\n\n\n/// Checks `const` declaration parsing.\n","file_path":"boa/src/syntax/parser/statement/declaration/tests.rs","rank":58,"score":209003.47694130227},{"content":"#[test]\n\nfn let_declaration_keywords() {\n\n check_parser(\n\n \"let yield = 5;\",\n\n vec![LetDeclList::from(vec![LetDecl::new(\"yield\", Node::from(Const::from(5)))]).into()],\n\n );\n\n\n\n check_parser(\n\n \"let await = 5;\",\n\n vec![LetDeclList::from(vec![LetDecl::new(\"await\", Node::from(Const::from(5)))]).into()],\n\n );\n\n}\n\n\n\n/// Checks `let` declaration parsing with no spaces.\n","file_path":"boa/src/syntax/parser/statement/declaration/tests.rs","rank":59,"score":209003.47694130227},{"content":"#[derive(Debug, Clone, Copy)]\n\nstruct CaseBlock {\n\n allow_yield: AllowYield,\n\n allow_await: AllowAwait,\n\n allow_return: AllowReturn,\n\n}\n\n\n\nimpl CaseBlock {\n\n /// Creates a new `CaseBlock` parser.\n\n fn new<Y, A, R>(allow_yield: Y, allow_await: A, allow_return: R) -> Self\n\n where\n\n Y: Into<AllowYield>,\n\n A: Into<AllowAwait>,\n\n R: Into<AllowReturn>,\n\n {\n\n Self {\n\n allow_yield: allow_yield.into(),\n\n allow_await: allow_await.into(),\n\n allow_return: allow_return.into(),\n\n }\n\n }\n","file_path":"boa/src/syntax/parser/statement/switch/mod.rs","rank":60,"score":208992.26112287797},{"content":"#[test]\n\nfn assign_operator_precedence() {\n\n let src = r#\"\n\n let a = 1;\n\n a = a + 1;\n\n a\n\n \"#;\n\n assert_eq!(&exec(src), \"2\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":61,"score":208941.5966858877},{"content":"#[test]\n\nfn do_while_loop_continue() {\n\n let scenario = r#\"\n\n var i = 0, a = 0, b = 0;\n\n do {\n\n i++;\n\n if (i < 2) {\n\n a++;\n\n continue;\n\n }\n\n b++;\n\n } while (i < 3)\n\n [a, b]\n\n \"#;\n\n assert_eq!(&exec(scenario), \"[ 1, 2 ]\");\n\n}\n","file_path":"boa/src/exec/iteration/tests.rs","rank":62,"score":208936.8416823892},{"content":"#[test]\n\nfn while_loop_continue() {\n\n let scenario = r#\"\n\n var i = 0, a = 0, b = 0;\n\n while (i < 3) {\n\n i++;\n\n if (i < 2) {\n\n a++;\n\n continue;\n\n }\n\n b++;\n\n }\n\n [a, b]\n\n \"#;\n\n assert_eq!(&exec(scenario), \"[ 1, 2 ]\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":63,"score":208936.8416823892},{"content":"#[test]\n\nfn for_loop_break() {\n\n let scenario = r#\"\n\n let a = 1;\n\n for (; a < 5; a++) {\n\n if (a == 3) {\n\n break;\n\n }\n\n }\n\n a;\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"3\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":64,"score":208936.8416823892},{"content":"#[test]\n\nfn finally() {\n\n let scenario = r#\"\n\n let a = 10;\n\n try {\n\n a = 20;\n\n } finally {\n\n a = 30;\n\n }\n\n\n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"30\");\n\n}\n\n\n","file_path":"boa/src/exec/try_node/tests.rs","rank":65,"score":208760.62008816598},{"content":"#[test]\n\nfn catch() {\n\n let scenario = r#\"\n\n let a = 10;\n\n try {\n\n throw \"error\";\n\n } catch {\n\n a = 20;\n\n }\n\n\n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"20\");\n\n}\n\n\n","file_path":"boa/src/exec/try_node/tests.rs","rank":66,"score":208760.62008816595},{"content":"#[test]\n\nfn display_array_string() {\n\n let mut engine = Context::new();\n\n\n\n let value = forward_val(&mut engine, \"[\\\"Hello\\\"]\").unwrap();\n\n assert_eq!(value.display().to_string(), \"[ \\\"Hello\\\" ]\");\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":67,"score":208746.61701120218},{"content":"#[test]\n\nfn includes_value() {\n\n let mut engine = Context::new();\n\n let init = r#\"\n\n var empty = [ ];\n\n var one = [\"a\"];\n\n var many = [\"a\", \"b\", \"c\"];\n\n var duplicates = [\"a\", \"b\", \"c\", \"a\", \"b\"];\n\n var undefined = [undefined];\n\n \"#;\n\n eprintln!(\"{}\", forward(&mut engine, init));\n\n\n\n // Empty\n\n let empty = forward(&mut engine, \"empty.includes('a')\");\n\n assert_eq!(empty, String::from(\"false\"));\n\n\n\n // One\n\n let one = forward(&mut engine, \"one.includes('a')\");\n\n assert_eq!(one, String::from(\"true\"));\n\n // Missing from one\n\n let missing_from_one = forward(&mut engine, \"one.includes('b')\");\n","file_path":"boa/src/builtins/array/tests.rs","rank":68,"score":208746.61701120218},{"content":"#[test]\n\nfn for_each_push_value() {\n\n let mut engine = Context::new();\n\n let init = r#\"\n\n var a = [1, 2, 3, 4];\n","file_path":"boa/src/builtins/array/tests.rs","rank":69,"score":208746.61701120218},{"content":"#[test]\n\nfn assign_to_array_decl() {\n\n let mut engine = Context::new();\n\n\n\n assert!(forward(&mut engine, \"[1] = [2]\").starts_with(\"Uncaught \\\"SyntaxError\\\": \"));\n\n assert!(forward(&mut engine, \"[3, 5] = [7, 8]\").starts_with(\"Uncaught \\\"SyntaxError\\\": \"));\n\n assert!(forward(&mut engine, \"[6, 8] = [2]\").starts_with(\"Uncaught \\\"SyntaxError\\\": \"));\n\n assert!(forward(&mut engine, \"[6] = [2, 9]\").starts_with(\"Uncaught \\\"SyntaxError\\\": \"));\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":70,"score":208721.28503377165},{"content":"#[test]\n\nfn array_rest_with_arguments() {\n\n let mut engine = Context::new();\n\n\n\n let scenario = r#\"\n\n var b = [4, 5, 6]\n\n var a = [1, 2, 3, ...b];\n\n \"#;\n\n forward(&mut engine, scenario);\n\n let one = forward(&mut engine, \"a\");\n\n assert_eq!(one, String::from(\"[ 1, 2, 3, 4, 5, 6 ]\"));\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":71,"score":208721.28503377165},{"content":"#[test]\n\nfn array_pop_benchmark() {\n\n let mut engine = Context::new();\n\n let init = r#\"\n\n (function(){\n\n let testArray = [83, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32,\n\n 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828,\n\n 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62,\n\n 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67,\n\n 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29,\n\n 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28,\n\n 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32,\n\n 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28, 93,\n\n 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93,\n\n 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23,\n\n 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36,\n\n 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32,\n\n 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234,\n\n 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99,\n\n 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32,\n\n 45, 93, 17, 28, 83, 62, 99, 36, 28];\n","file_path":"boa/src/exec/tests.rs","rank":72,"score":208721.28503377165},{"content":"#[test]\n\nfn array_creation_benchmark() {\n\n let mut engine = Context::new();\n\n let init = r#\"\n\n (function(){\n\n let testArr = [];\n\n for (let a = 0; a <= 500; a++) {\n\n testArr[a] = ('p' + a);\n\n }\n\n\n\n return testArr;\n\n })();\n\n \"#;\n\n\n\n assert_eq!(forward(&mut engine, init), \"[ \\\"p0\\\", \\\"p1\\\", \\\"p2\\\", \\\"p3\\\", \\\"p4\\\", \\\"p5\\\", \\\"p6\\\", \\\"p7\\\", \\\"p8\\\", \\\"p9\\\", \\\"p10\\\", \\\"p11\\\", \\\"p12\\\", \\\"p13\\\", \\\"p14\\\", \\\"p15\\\", \\\"p16\\\", \\\"p17\\\", \\\"p18\\\", \\\"p19\\\", \\\"p20\\\", \\\"p21\\\", \\\"p22\\\", \\\"p23\\\", \\\"p24\\\", \\\"p25\\\", \\\"p26\\\", \\\"p27\\\", \\\"p28\\\", \\\"p29\\\", \\\"p30\\\", \\\"p31\\\", \\\"p32\\\", \\\"p33\\\", \\\"p34\\\", \\\"p35\\\", \\\"p36\\\", \\\"p37\\\", \\\"p38\\\", \\\"p39\\\", \\\"p40\\\", \\\"p41\\\", \\\"p42\\\", \\\"p43\\\", \\\"p44\\\", \\\"p45\\\", \\\"p46\\\", \\\"p47\\\", \\\"p48\\\", \\\"p49\\\", \\\"p50\\\", \\\"p51\\\", \\\"p52\\\", \\\"p53\\\", \\\"p54\\\", \\\"p55\\\", \\\"p56\\\", \\\"p57\\\", \\\"p58\\\", \\\"p59\\\", \\\"p60\\\", \\\"p61\\\", \\\"p62\\\", \\\"p63\\\", \\\"p64\\\", \\\"p65\\\", \\\"p66\\\", \\\"p67\\\", \\\"p68\\\", \\\"p69\\\", \\\"p70\\\", \\\"p71\\\", \\\"p72\\\", \\\"p73\\\", \\\"p74\\\", \\\"p75\\\", \\\"p76\\\", \\\"p77\\\", \\\"p78\\\", \\\"p79\\\", \\\"p80\\\", \\\"p81\\\", \\\"p82\\\", \\\"p83\\\", \\\"p84\\\", \\\"p85\\\", \\\"p86\\\", \\\"p87\\\", \\\"p88\\\", \\\"p89\\\", \\\"p90\\\", \\\"p91\\\", \\\"p92\\\", \\\"p93\\\", \\\"p94\\\", \\\"p95\\\", \\\"p96\\\", \\\"p97\\\", \\\"p98\\\", \\\"p99\\\", \\\"p100\\\", \\\"p101\\\", \\\"p102\\\", \\\"p103\\\", \\\"p104\\\", \\\"p105\\\", \\\"p106\\\", \\\"p107\\\", \\\"p108\\\", \\\"p109\\\", \\\"p110\\\", \\\"p111\\\", \\\"p112\\\", \\\"p113\\\", \\\"p114\\\", \\\"p115\\\", \\\"p116\\\", \\\"p117\\\", \\\"p118\\\", \\\"p119\\\", \\\"p120\\\", \\\"p121\\\", \\\"p122\\\", \\\"p123\\\", \\\"p124\\\", \\\"p125\\\", \\\"p126\\\", \\\"p127\\\", \\\"p128\\\", \\\"p129\\\", \\\"p130\\\", \\\"p131\\\", \\\"p132\\\", \\\"p133\\\", \\\"p134\\\", \\\"p135\\\", \\\"p136\\\", \\\"p137\\\", \\\"p138\\\", \\\"p139\\\", \\\"p140\\\", \\\"p141\\\", \\\"p142\\\", \\\"p143\\\", \\\"p144\\\", \\\"p145\\\", \\\"p146\\\", \\\"p147\\\", \\\"p148\\\", \\\"p149\\\", \\\"p150\\\", \\\"p151\\\", \\\"p152\\\", \\\"p153\\\", \\\"p154\\\", \\\"p155\\\", \\\"p156\\\", \\\"p157\\\", \\\"p158\\\", \\\"p159\\\", \\\"p160\\\", \\\"p161\\\", \\\"p162\\\", \\\"p163\\\", \\\"p164\\\", \\\"p165\\\", \\\"p166\\\", \\\"p167\\\", \\\"p168\\\", \\\"p169\\\", \\\"p170\\\", \\\"p171\\\", \\\"p172\\\", \\\"p173\\\", \\\"p174\\\", \\\"p175\\\", \\\"p176\\\", \\\"p177\\\", \\\"p178\\\", \\\"p179\\\", \\\"p180\\\", \\\"p181\\\", \\\"p182\\\", \\\"p183\\\", \\\"p184\\\", \\\"p185\\\", \\\"p186\\\", \\\"p187\\\", \\\"p188\\\", \\\"p189\\\", \\\"p190\\\", \\\"p191\\\", \\\"p192\\\", \\\"p193\\\", \\\"p194\\\", \\\"p195\\\", \\\"p196\\\", \\\"p197\\\", \\\"p198\\\", \\\"p199\\\", \\\"p200\\\", \\\"p201\\\", \\\"p202\\\", \\\"p203\\\", \\\"p204\\\", \\\"p205\\\", \\\"p206\\\", \\\"p207\\\", \\\"p208\\\", \\\"p209\\\", \\\"p210\\\", \\\"p211\\\", \\\"p212\\\", \\\"p213\\\", \\\"p214\\\", \\\"p215\\\", \\\"p216\\\", \\\"p217\\\", \\\"p218\\\", \\\"p219\\\", \\\"p220\\\", \\\"p221\\\", \\\"p222\\\", \\\"p223\\\", \\\"p224\\\", \\\"p225\\\", \\\"p226\\\", \\\"p227\\\", \\\"p228\\\", \\\"p229\\\", \\\"p230\\\", \\\"p231\\\", \\\"p232\\\", \\\"p233\\\", \\\"p234\\\", \\\"p235\\\", \\\"p236\\\", \\\"p237\\\", \\\"p238\\\", \\\"p239\\\", \\\"p240\\\", \\\"p241\\\", \\\"p242\\\", \\\"p243\\\", \\\"p244\\\", \\\"p245\\\", \\\"p246\\\", \\\"p247\\\", \\\"p248\\\", \\\"p249\\\", \\\"p250\\\", \\\"p251\\\", \\\"p252\\\", \\\"p253\\\", \\\"p254\\\", \\\"p255\\\", \\\"p256\\\", \\\"p257\\\", \\\"p258\\\", \\\"p259\\\", \\\"p260\\\", \\\"p261\\\", \\\"p262\\\", \\\"p263\\\", \\\"p264\\\", \\\"p265\\\", \\\"p266\\\", \\\"p267\\\", \\\"p268\\\", \\\"p269\\\", \\\"p270\\\", \\\"p271\\\", \\\"p272\\\", \\\"p273\\\", \\\"p274\\\", \\\"p275\\\", \\\"p276\\\", \\\"p277\\\", \\\"p278\\\", \\\"p279\\\", \\\"p280\\\", \\\"p281\\\", \\\"p282\\\", \\\"p283\\\", \\\"p284\\\", \\\"p285\\\", \\\"p286\\\", \\\"p287\\\", \\\"p288\\\", \\\"p289\\\", \\\"p290\\\", \\\"p291\\\", \\\"p292\\\", \\\"p293\\\", \\\"p294\\\", \\\"p295\\\", \\\"p296\\\", \\\"p297\\\", \\\"p298\\\", \\\"p299\\\", \\\"p300\\\", \\\"p301\\\", \\\"p302\\\", \\\"p303\\\", \\\"p304\\\", \\\"p305\\\", \\\"p306\\\", \\\"p307\\\", \\\"p308\\\", \\\"p309\\\", \\\"p310\\\", \\\"p311\\\", \\\"p312\\\", \\\"p313\\\", \\\"p314\\\", \\\"p315\\\", \\\"p316\\\", \\\"p317\\\", \\\"p318\\\", \\\"p319\\\", \\\"p320\\\", \\\"p321\\\", \\\"p322\\\", \\\"p323\\\", \\\"p324\\\", \\\"p325\\\", \\\"p326\\\", \\\"p327\\\", \\\"p328\\\", \\\"p329\\\", \\\"p330\\\", \\\"p331\\\", \\\"p332\\\", \\\"p333\\\", \\\"p334\\\", \\\"p335\\\", \\\"p336\\\", \\\"p337\\\", \\\"p338\\\", \\\"p339\\\", \\\"p340\\\", \\\"p341\\\", \\\"p342\\\", \\\"p343\\\", \\\"p344\\\", \\\"p345\\\", \\\"p346\\\", \\\"p347\\\", \\\"p348\\\", \\\"p349\\\", \\\"p350\\\", \\\"p351\\\", \\\"p352\\\", \\\"p353\\\", \\\"p354\\\", \\\"p355\\\", \\\"p356\\\", \\\"p357\\\", \\\"p358\\\", \\\"p359\\\", \\\"p360\\\", \\\"p361\\\", \\\"p362\\\", \\\"p363\\\", \\\"p364\\\", \\\"p365\\\", \\\"p366\\\", \\\"p367\\\", \\\"p368\\\", \\\"p369\\\", \\\"p370\\\", \\\"p371\\\", \\\"p372\\\", \\\"p373\\\", \\\"p374\\\", \\\"p375\\\", \\\"p376\\\", \\\"p377\\\", \\\"p378\\\", \\\"p379\\\", \\\"p380\\\", \\\"p381\\\", \\\"p382\\\", \\\"p383\\\", \\\"p384\\\", \\\"p385\\\", \\\"p386\\\", \\\"p387\\\", \\\"p388\\\", \\\"p389\\\", \\\"p390\\\", \\\"p391\\\", \\\"p392\\\", \\\"p393\\\", \\\"p394\\\", \\\"p395\\\", \\\"p396\\\", \\\"p397\\\", \\\"p398\\\", \\\"p399\\\", \\\"p400\\\", \\\"p401\\\", \\\"p402\\\", \\\"p403\\\", \\\"p404\\\", \\\"p405\\\", \\\"p406\\\", \\\"p407\\\", \\\"p408\\\", \\\"p409\\\", \\\"p410\\\", \\\"p411\\\", \\\"p412\\\", \\\"p413\\\", \\\"p414\\\", \\\"p415\\\", \\\"p416\\\", \\\"p417\\\", \\\"p418\\\", \\\"p419\\\", \\\"p420\\\", \\\"p421\\\", \\\"p422\\\", \\\"p423\\\", \\\"p424\\\", \\\"p425\\\", \\\"p426\\\", \\\"p427\\\", \\\"p428\\\", \\\"p429\\\", \\\"p430\\\", \\\"p431\\\", \\\"p432\\\", \\\"p433\\\", \\\"p434\\\", \\\"p435\\\", \\\"p436\\\", \\\"p437\\\", \\\"p438\\\", \\\"p439\\\", \\\"p440\\\", \\\"p441\\\", \\\"p442\\\", \\\"p443\\\", \\\"p444\\\", \\\"p445\\\", \\\"p446\\\", \\\"p447\\\", \\\"p448\\\", \\\"p449\\\", \\\"p450\\\", \\\"p451\\\", \\\"p452\\\", \\\"p453\\\", \\\"p454\\\", \\\"p455\\\", \\\"p456\\\", \\\"p457\\\", \\\"p458\\\", \\\"p459\\\", \\\"p460\\\", \\\"p461\\\", \\\"p462\\\", \\\"p463\\\", \\\"p464\\\", \\\"p465\\\", \\\"p466\\\", \\\"p467\\\", \\\"p468\\\", \\\"p469\\\", \\\"p470\\\", \\\"p471\\\", \\\"p472\\\", \\\"p473\\\", \\\"p474\\\", \\\"p475\\\", \\\"p476\\\", \\\"p477\\\", \\\"p478\\\", \\\"p479\\\", \\\"p480\\\", \\\"p481\\\", \\\"p482\\\", \\\"p483\\\", \\\"p484\\\", \\\"p485\\\", \\\"p486\\\", \\\"p487\\\", \\\"p488\\\", \\\"p489\\\", \\\"p490\\\", \\\"p491\\\", \\\"p492\\\", \\\"p493\\\", \\\"p494\\\", \\\"p495\\\", \\\"p496\\\", \\\"p497\\\", \\\"p498\\\", \\\"p499\\\", \\\"p500\\\" ]\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":73,"score":208721.28503377168},{"content":"#[test]\n\nfn display_number_object() {\n\n let mut engine = Context::new();\n\n let d_obj = r#\"\n\n let num = new Number(3.14);\n\n num\n\n \"#;\n\n let value = forward_val(&mut engine, d_obj).unwrap();\n\n assert_eq!(value.display().to_string(), \"Number { 3.14 }\")\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":74,"score":208719.42162861014},{"content":"#[test]\n\nfn display_boolean_object() {\n\n let mut engine = Context::new();\n\n let d_obj = r#\"\n\n let bool = new Boolean(0);\n\n bool\n\n \"#;\n\n let value = forward_val(&mut engine, d_obj).unwrap();\n\n assert_eq!(value.display().to_string(), \"Boolean { false }\")\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":75,"score":208719.42162861014},{"content":"#[test]\n\nfn assign_to_object_decl() {\n\n let mut engine = Context::new();\n\n\n\n const ERR_MSG: &str =\n\n \"Uncaught \\\"SyntaxError\\\": \\\"expected token \\';\\', got \\':\\' in expression statement at line 1, col 3\\\"\";\n\n\n\n assert_eq!(forward(&mut engine, \"{a: 3} = {a: 5};\"), ERR_MSG);\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":76,"score":208694.08965117962},{"content":"#[test]\n\nfn call_array_constructor_with_one_argument() {\n\n let mut engine = Context::new();\n\n let init = r#\"\n\n var empty = new Array(0);\n\n\n\n var five = new Array(5);\n\n\n\n var one = new Array(\"Hello, world!\");\n\n \"#;\n\n forward(&mut engine, init);\n\n // let result = forward(&mut engine, \"empty.length\");\n\n // assert_eq!(result, \"0\");\n\n\n\n // let result = forward(&mut engine, \"five.length\");\n\n // assert_eq!(result, \"5\");\n\n\n\n // let result = forward(&mut engine, \"one.length\");\n\n // assert_eq!(result, \"1\");\n\n}\n","file_path":"boa/src/builtins/array/tests.rs","rank":77,"score":208674.35465775762},{"content":"pub fn new_global_environment(global: Value, this_value: Value) -> Environment {\n\n let obj_rec = ObjectEnvironmentRecord {\n\n bindings: global,\n\n outer_env: None,\n\n /// Object Environment Records created for with statements (13.11)\n\n /// can provide their binding object as an implicit this value for use in function calls.\n\n /// The capability is controlled by a withEnvironment Boolean value that is associated\n\n /// with each object Environment Record. By default, the value of withEnvironment is false\n\n /// for any object Environment Record.\n\n with_environment: false,\n\n };\n\n\n\n let dcl_rec = DeclarativeEnvironmentRecord {\n\n env_rec: FxHashMap::default(),\n\n outer_env: None,\n\n };\n\n\n\n Gc::new(GcCell::new(Box::new(GlobalEnvironmentRecord {\n\n object_record: obj_rec,\n\n global_this_binding: this_value,\n","file_path":"boa/src/environment/lexical_environment.rs","rank":78,"score":206397.2708233666},{"content":"#[test]\n\nfn check_switch_two_default() {\n\n check_invalid(\n\n r#\"\n\n let a = 10;\n\n switch (a) {\n\n default:\n\n a = 20;\n\n break;\n\n default:\n\n a = 30;\n\n break;\n\n }\n\n \"#,\n\n );\n\n}\n\n\n\n/// Checks parsing malformed switch with no expression.\n","file_path":"boa/src/syntax/parser/statement/switch/tests.rs","rank":79,"score":205349.5002958667},{"content":"#[test]\n\nfn check_switch_seperated_defaults() {\n\n check_invalid(\n\n r#\"\n\n let a = 10;\n\n switch (a) {\n\n default:\n\n a = 20;\n\n break;\n\n case 10:\n\n a = 60;\n\n break;\n\n default:\n\n a = 30;\n\n break;\n\n }\n\n \"#,\n\n );\n\n}\n\n\n\n/// Example of JS code https://jsfiddle.net/zq6jx47h/4/.\n","file_path":"boa/src/syntax/parser/statement/switch/tests.rs","rank":80,"score":205349.5002958667},{"content":"#[test]\n\nfn empty_let_decl_undefined() {\n\n let scenario = r#\"\n\n let a;\n\n a === undefined;\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"true\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":81,"score":204581.10754333768},{"content":"#[test]\n\nfn empty_function_returns_undefined() {\n\n let scenario = \"(function () {}) ()\";\n\n assert_eq!(&exec(scenario), \"undefined\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":82,"score":204529.01211287102},{"content":"#[test]\n\nfn calling_function_with_unspecified_arguments() {\n\n let mut engine = Context::new();\n\n let scenario = r#\"\n","file_path":"boa/src/exec/tests.rs","rank":83,"score":204494.8576495031},{"content":"#[test]\n\nfn assignmentoperator_lhs_not_defined() {\n\n let scenario = r#\"\n\n try {\n\n a += 5\n\n } catch (err) {\n\n err.toString()\n\n }\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"\\\"ReferenceError: a is not defined\\\"\");\n\n}\n\n\n","file_path":"boa/src/exec/operator/tests.rs","rank":84,"score":204409.75527200365},{"content":"#[test]\n\nfn while_loop_late_break() {\n\n // Ordering with statement before the break.\n\n let scenario = r#\"\n\n let a = 1;\n\n while (a < 5) {\n\n a++;\n\n if (a == 3) {\n\n break;\n\n }\n\n }\n\n a;\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"3\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":85,"score":204405.11945261425},{"content":"#[test]\n\nfn while_loop_early_break() {\n\n // Ordering with statements after the break.\n\n let scenario = r#\"\n\n let a = 1;\n\n while (a < 5) {\n\n if (a == 3) {\n\n break;\n\n }\n\n a++;\n\n }\n\n a;\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"3\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":86,"score":204405.11945261425},{"content":"#[test]\n\nfn do_loop_early_break() {\n\n // Ordering with statements after the break.\n\n let scenario = r#\"\n\n let a = 1;\n\n do {\n\n if (a == 3) {\n\n break;\n\n }\n\n a++;\n\n } while (a < 5);\n\n a;\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"3\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":87,"score":204405.11945261425},{"content":"#[test]\n\nfn break_out_of_inner_loop() {\n\n let scenario = r#\"\n\n var a = 0, b = 0;\n\n for (let i = 0; i < 2; i++) {\n\n a++;\n\n for (let j = 0; j < 10; j++) {\n\n b++;\n\n if (j == 3)\n\n break;\n\n }\n\n a++;\n\n }\n\n [a, b]\n\n \"#;\n\n assert_eq!(&exec(scenario), \"[ 4, 8 ]\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":88,"score":204405.11945261425},{"content":"#[test]\n\nfn for_loop_iteration_variable_does_not_leak() {\n\n let inner_scope = r#\"\n\n for (let i = 0;false;) {}\n\n\n\n try {\n\n i\n\n } catch (err) {\n\n err.message\n\n }\n\n \"#;\n\n\n\n assert_eq!(&exec(inner_scope), \"\\\"i is not defined\\\"\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":89,"score":204405.11945261425},{"content":"#[test]\n\nfn do_loop_late_break() {\n\n // Ordering with statement before the break.\n\n let scenario = r#\"\n\n let a = 1;\n\n do {\n\n a++;\n\n if (a == 3) {\n\n break;\n\n }\n\n } while (a < 5);\n\n a;\n\n \"#;\n\n\n\n assert_eq!(&exec(scenario), \"3\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":90,"score":204405.11945261425},{"content":"#[test]\n\nfn continue_inner_loop() {\n\n let scenario = r#\"\n\n var a = 0, b = 0;\n\n for (let i = 0; i < 2; i++) {\n\n a++;\n\n for (let j = 0; j < 10; j++) {\n\n if (j < 3)\n\n continue;\n\n b++;\n\n }\n\n a++;\n\n }\n\n [a, b]\n\n \"#;\n\n assert_eq!(&exec(scenario), \"[ 4, 14 ]\");\n\n}\n\n\n","file_path":"boa/src/exec/iteration/tests.rs","rank":91,"score":204405.11945261425},{"content":"#[test]\n\nfn simple_try() {\n\n let scenario = r#\"\n\n let a = 10;\n\n try {\n\n a = 20;\n\n } catch {\n\n a = 30;\n\n }\n\n\n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"20\");\n\n}\n\n\n","file_path":"boa/src/exec/try_node/tests.rs","rank":92,"score":204233.3148506636},{"content":"#[test]\n\nfn catch_binding() {\n\n let scenario = r#\"\n\n let a = 10;\n\n try {\n\n throw 20;\n\n } catch(err) {\n\n a = err;\n\n }\n\n\n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"20\");\n\n}\n\n\n","file_path":"boa/src/exec/try_node/tests.rs","rank":93,"score":204233.31485066362},{"content":"#[test]\n\nfn catch_finally() {\n\n let scenario = r#\"\n\n let a = 10;\n\n try {\n\n a = 20;\n\n } catch {\n\n a = 40;\n\n } finally {\n\n a = 30;\n\n }\n\n\n\n a;\n\n \"#;\n\n assert_eq!(&exec(scenario), \"30\");\n\n}\n\n\n","file_path":"boa/src/exec/try_node/tests.rs","rank":94,"score":204233.3148506636},{"content":"#[test]\n\nfn add_number_object_and_number() {\n\n let mut engine = Context::new();\n\n\n\n let value = forward_val(&mut engine, \"new Number(10) + 6\").unwrap();\n\n let value = value.to_i32(&mut engine).unwrap();\n\n assert_eq!(value, 16);\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":95,"score":204193.1490300321},{"content":"#[test]\n\nfn display_negative_zero_object() {\n\n let mut engine = Context::new();\n\n let d_obj = r#\"\n\n let num = new Number(-0);\n\n num\n\n \"#;\n\n let value = forward_val(&mut engine, d_obj).unwrap();\n\n assert_eq!(value.display().to_string(), \"Number { -0 }\")\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":96,"score":204193.1490300321},{"content":"#[test]\n\nfn sub_string_and_number_object() {\n\n let mut engine = Context::new();\n\n\n\n let value = forward_val(&mut engine, \"'Hello' - new Number(999)\").unwrap();\n\n let value = value.to_number(&mut engine).unwrap();\n\n assert!(value.is_nan());\n\n}\n\n\n","file_path":"boa/src/value/tests.rs","rank":97,"score":204193.1490300321},{"content":"#[test]\n\nfn check_this_binding_in_object_literal() {\n\n let mut engine = Context::new();\n\n let init = r#\"\n\n var foo = {\n\n a: 3,\n\n bar: function () { return this.a + 5 }\n\n };\n\n\n\n foo.bar()\n\n \"#;\n\n\n\n assert_eq!(forward(&mut engine, init), \"8\");\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":98,"score":204168.4519983303},{"content":"#[test]\n\nfn number_object_access_benchmark() {\n\n let mut engine = Context::new();\n\n let init = r#\"\n\n new Number(\n\n new Number(\n\n new Number(\n\n new Number(100).valueOf() - 10.5\n\n ).valueOf() + 100\n\n ).valueOf() * 1.6\n\n )\n\n \"#;\n\n\n\n assert!(forward_val(&mut engine, init).is_ok());\n\n}\n\n\n","file_path":"boa/src/exec/tests.rs","rank":99,"score":204168.4519983303}],"string":"[\n {\n \"content\": \"#[inline]\\n\\npub fn this_time_value(value: &Value, ctx: &mut Context) -> Result<Date> {\\n\\n if let Value::Object(ref object) = value {\\n\\n if let ObjectData::Date(ref date) = object.borrow().data {\\n\\n return Ok(*date);\\n\\n }\\n\\n }\\n\\n Err(ctx.construct_type_error(\\\"'this' is not a Date\\\"))\\n\\n}\\n\",\n \"file_path\": \"boa/src/builtins/date/mod.rs\",\n \"rank\": 0,\n \"score\": 357037.48474957317\n },\n {\n \"content\": \"/// Create new function `[[Construct]]`\\n\\n///\\n\\n// This gets called when a new Function() is created.\\n\\npub fn make_function(this: &Value, _: &[Value], _: &mut Context) -> Result<Value> {\\n\\n this.set_data(ObjectData::Function(Function::BuiltIn(\\n\\n BuiltInFunction(|_, _, _| Ok(Value::undefined())),\\n\\n FunctionFlags::CALLABLE | FunctionFlags::CONSTRUCTABLE,\\n\\n )));\\n\\n Ok(this.clone())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/builtins/function/mod.rs\",\n \"rank\": 1,\n \"score\": 353623.60809848504\n },\n {\n \"content\": \"/// This represents the `console` formatter.\\n\\npub fn formatter(data: &[Value], ctx: &mut Context) -> Result<String> {\\n\\n let target = data.get(0).cloned().unwrap_or_default().to_string(ctx)?;\\n\\n\\n\\n match data.len() {\\n\\n 0 => Ok(String::new()),\\n\\n 1 => Ok(target.to_string()),\\n\\n _ => {\\n\\n let mut formatted = String::new();\\n\\n let mut arg_index = 1;\\n\\n let mut chars = target.chars();\\n\\n while let Some(c) = chars.next() {\\n\\n if c == '%' {\\n\\n let fmt = chars.next().unwrap_or('%');\\n\\n match fmt {\\n\\n /* integer */\\n\\n 'd' | 'i' => {\\n\\n let arg = data\\n\\n .get(arg_index)\\n\\n .cloned()\\n\\n .unwrap_or_default()\\n\",\n \"file_path\": \"boa/src/builtins/console/mod.rs\",\n \"rank\": 2,\n \"score\": 343234.7963965172\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init(interpreter: &mut Context) {\\n\\n let globals = [\\n\\n // The `Function` global must be initialized before other types.\\n\\n function::init,\\n\\n Object::init,\\n\\n Array::init,\\n\\n BigInt::init,\\n\\n Boolean::init,\\n\\n Date::init,\\n\\n Json::init,\\n\\n Map::init,\\n\\n Math::init,\\n\\n Number::init,\\n\\n RegExp::init,\\n\\n String::init,\\n\\n Symbol::init,\\n\\n Console::init,\\n\\n // Global error types.\\n\\n Error::init,\\n\\n RangeError::init,\\n\",\n \"file_path\": \"boa/src/builtins/mod.rs\",\n \"rank\": 3,\n \"score\": 340734.68303004955\n },\n {\n \"content\": \"#[inline]\\n\\npub fn init(interpreter: &mut Context) -> (&'static str, Value) {\\n\\n let global = interpreter.global_object();\\n\\n let _timer = BoaProfiler::global().start_event(\\\"function\\\", \\\"init\\\");\\n\\n let prototype = Value::new_object(Some(global));\\n\\n\\n\\n let function_object =\\n\\n make_constructor_fn(\\\"Function\\\", 1, make_function, global, prototype, true, true);\\n\\n\\n\\n (\\\"Function\\\", function_object)\\n\\n}\\n\",\n \"file_path\": \"boa/src/builtins/function/mod.rs\",\n \"rank\": 4,\n \"score\": 338863.86140603875\n },\n {\n \"content\": \"#[test]\\n\\nfn default_not_taken_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 5;\\n\\n\\n\\n switch (a) {\\n\\n case 5:\\n\\n a = 150;\\n\\n break;\\n\\n default:\\n\\n a = 70;\\n\\n }\\n\\n \\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"150\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 6,\n \"score\": 261862.8602969392\n },\n {\n \"content\": \"#[test]\\n\\nfn default_taken_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n\\n\\n switch (a) {\\n\\n case 5:\\n\\n a = 150;\\n\\n break;\\n\\n default:\\n\\n a = 70;\\n\\n }\\n\\n \\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"70\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 7,\n \"score\": 261862.8602969392\n },\n {\n \"content\": \"#[test]\\n\\nfn test_result_of_empty_block() {\\n\\n let scenario = \\\"{}\\\";\\n\\n assert_eq!(&exec(scenario), \\\"undefined\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 8,\n \"score\": 261144.09365715494\n },\n {\n \"content\": \"#[test]\\n\\nfn for_loop_return() {\\n\\n let scenario = r#\\\"\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 9,\n \"score\": 255289.82843878862\n },\n {\n \"content\": \"#[test]\\n\\nfn array_field_set() {\\n\\n let element_changes = r#\\\"\\n\\n let m = [1, 2, 3];\\n\\n m[1] = 5;\\n\\n m[1]\\n\\n \\\"#;\\n\\n assert_eq!(&exec(element_changes), \\\"5\\\");\\n\\n\\n\\n let length_changes = r#\\\"\\n\\n let m = [1, 2, 3];\\n\\n m[10] = 52;\\n\\n m.length\\n\\n \\\"#;\\n\\n assert_eq!(&exec(length_changes), \\\"11\\\");\\n\\n\\n\\n let negative_index_wont_affect_length = r#\\\"\\n\\n let m = [1, 2, 3];\\n\\n m[-11] = 5;\\n\\n m.length\\n\\n \\\"#;\\n\\n assert_eq!(&exec(negative_index_wont_affect_length), \\\"3\\\");\\n\\n\\n\\n let non_num_key_wont_affect_length = r#\\\"\\n\\n let m = [1, 2, 3];\\n\\n m[\\\"magic\\\"] = 5;\\n\\n m.length\\n\\n \\\"#;\\n\\n assert_eq!(&exec(non_num_key_wont_affect_length), \\\"3\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 10,\n \"score\": 255111.44482839562\n },\n {\n \"content\": \"#[test]\\n\\nfn object_field_set() {\\n\\n let scenario = r#\\\"\\n\\n let m = {};\\n\\n m['key'] = 22;\\n\\n m['key']\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"22\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 11,\n \"score\": 255084.24944580358\n },\n {\n \"content\": \"#[test]\\n\\nfn function_declaration_returns_undefined() {\\n\\n let scenario = r#\\\"\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 12,\n \"score\": 249586.98632660974\n },\n {\n \"content\": \"#[test]\\n\\nfn for_loop_continue_out_of_switch() {\\n\\n let scenario = r#\\\"\\n\\n var a = 0, b = 0, c = 0;\\n\\n for (let i = 0; i < 3; i++) {\\n\\n a++;\\n\\n switch (i) {\\n\\n case 0:\\n\\n continue;\\n\\n c++;\\n\\n case 1:\\n\\n continue;\\n\\n case 5:\\n\\n c++;\\n\\n }\\n\\n b++;\\n\\n }\\n\\n [a, b, c]\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"[ 3, 1, 0 ]\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 13,\n \"score\": 249555.26039999418\n },\n {\n \"content\": \"#[test]\\n\\nfn identifier_on_global_object_undefined() {\\n\\n let scenario = r#\\\"\\n\\n try {\\n\\n bar;\\n\\n } catch (err) {\\n\\n err.message\\n\\n }\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"\\\\\\\"bar is not defined\\\\\\\"\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 14,\n \"score\": 249404.8915987378\n },\n {\n \"content\": \"pub fn new_object_environment(object: Value, environment: Option<Environment>) -> Environment {\\n\\n Gc::new(GcCell::new(Box::new(ObjectEnvironmentRecord {\\n\\n bindings: object,\\n\\n outer_env: environment,\\n\\n /// Object Environment Records created for with statements (13.11)\\n\\n /// can provide their binding object as an implicit this value for use in function calls.\\n\\n /// The capability is controlled by a withEnvironment Boolean value that is associated\\n\\n /// with each object Environment Record. By default, the value of withEnvironment is false\\n\\n /// for any object Environment Record.\\n\\n with_environment: false,\\n\\n })))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/environment/lexical_environment.rs\",\n \"rank\": 15,\n \"score\": 248762.0844104546\n },\n {\n \"content\": \"#[test]\\n\\nfn assignmentoperator_rhs_throws_error() {\\n\\n let scenario = r#\\\"\\n\\n try {\\n\\n let a;\\n\\n a += b\\n\\n } catch (err) {\\n\\n err.toString()\\n\\n }\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"\\\\\\\"ReferenceError: b is not defined\\\\\\\"\\\");\\n\\n}\\n\",\n \"file_path\": \"boa/src/exec/operator/tests.rs\",\n \"rank\": 16,\n \"score\": 244218.82026144036\n },\n {\n \"content\": \"#[test]\\n\\nfn check_post_state() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let brk: Break = Break::new(\\\"label\\\");\\n\\n\\n\\n brk.run(&mut engine).unwrap();\\n\\n\\n\\n assert_eq!(\\n\\n engine.executor().get_current_state(),\\n\\n &InterpreterState::Break(Some(\\\"label\\\".to_string()))\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"boa/src/exec/break_node/tests.rs\",\n \"rank\": 17,\n \"score\": 244075.88723480213\n },\n {\n \"content\": \"/// Arguments.\\n\\n///\\n\\n/// <https://tc39.es/ecma262/#sec-createunmappedargumentsobject>\\n\\npub fn create_unmapped_arguments_object(arguments_list: &[Value]) -> Value {\\n\\n let len = arguments_list.len();\\n\\n let mut obj = Object::default();\\n\\n // Set length\\n\\n let length = Property::data_descriptor(\\n\\n len.into(),\\n\\n Attribute::WRITABLE | Attribute::NON_ENUMERABLE | Attribute::PERMANENT,\\n\\n );\\n\\n // Define length as a property\\n\\n obj.define_own_property(\\\"length\\\", length);\\n\\n let mut index: usize = 0;\\n\\n while index < len {\\n\\n let val = arguments_list.get(index).expect(\\\"Could not get argument\\\");\\n\\n let prop = Property::data_descriptor(\\n\\n val.clone(),\\n\\n Attribute::WRITABLE | Attribute::ENUMERABLE | Attribute::CONFIGURABLE,\\n\\n );\\n\\n\\n\\n obj.insert_property(index, prop);\\n\\n index += 1;\\n\\n }\\n\\n\\n\\n Value::from(obj)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/builtins/function/mod.rs\",\n \"rank\": 18,\n \"score\": 243325.69797778988\n },\n {\n \"content\": \"/// Utility to join multiple Nodes into a single string.\\n\\nfn join_nodes<N>(f: &mut fmt::Formatter<'_>, nodes: &[N]) -> fmt::Result\\n\\nwhere\\n\\n N: Display,\\n\\n{\\n\\n let mut first = true;\\n\\n for e in nodes {\\n\\n if !first {\\n\\n f.write_str(\\\", \\\")?;\\n\\n }\\n\\n first = false;\\n\\n Display::fmt(e, f)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\\n/// \\\"Formal parameter\\\" is a fancy way of saying \\\"function parameter\\\".\\n\\n///\\n\\n/// In the declaration of a function, the parameters must be identifiers,\\n\\n/// not any value like numbers, strings, or objects.\\n\\n///```text\\n\",\n \"file_path\": \"boa/src/syntax/ast/node/mod.rs\",\n \"rank\": 19,\n \"score\": 241283.65533507115\n },\n {\n \"content\": \"fn assert_throws(engine: &mut Context, src: &str, error_type: &str) {\\n\\n let result = forward(engine, src);\\n\\n assert!(result.contains(error_type));\\n\\n}\\n\",\n \"file_path\": \"boa/src/builtins/bigint/tests.rs\",\n \"rank\": 20,\n \"score\": 234239.30652085572\n },\n {\n \"content\": \"/// This trait allows Rust types to be passed around as objects.\\n\\n///\\n\\n/// This is automatically implemented, when a type implements `Debug`, `Any` and `Trace`.\\n\\npub trait NativeObject: Debug + Any + Trace {\\n\\n /// Convert the Rust type which implements `NativeObject` to a `&dyn Any`.\\n\\n fn as_any(&self) -> &dyn Any;\\n\\n\\n\\n /// Convert the Rust type which implements `NativeObject` to a `&mut dyn Any`.\\n\\n fn as_mut_any(&mut self) -> &mut dyn Any;\\n\\n}\\n\\n\\n\\nimpl<T: Any + Debug + Trace> NativeObject for T {\\n\\n fn as_any(&self) -> &dyn Any {\\n\\n self as &dyn Any\\n\\n }\\n\\n\\n\\n fn as_mut_any(&mut self) -> &mut dyn Any {\\n\\n self as &mut dyn Any\\n\\n }\\n\\n}\\n\\n\\n\\n/// The internal representation of an JavaScript object.\\n\\n#[derive(Debug, Trace, Finalize)]\\n\",\n \"file_path\": \"boa/src/object/mod.rs\",\n \"rank\": 21,\n \"score\": 228419.22638083706\n },\n {\n \"content\": \"fn for_loop_execution(c: &mut Criterion) {\\n\\n // Create new Realm and interpreter.\\n\\n let mut engine = Context::new();\\n\\n\\n\\n // Parse the AST nodes.\\n\\n let nodes = Parser::new(FOR_LOOP.as_bytes()).parse_all().unwrap();\\n\\n\\n\\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\\n\\n c.bench_function(\\\"For loop (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic FIBONACCI: &str = include_str!(\\\"bench_scripts/fibonacci.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 22,\n \"score\": 225214.32752933505\n },\n {\n \"content\": \"fn arithmetic_operations(c: &mut Criterion) {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let nodes = Parser::new(ARITHMETIC_OPERATIONS.as_bytes())\\n\\n .parse_all()\\n\\n .unwrap();\\n\\n\\n\\n c.bench_function(\\\"Arithmetic operations (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic CLEAN_JS: &str = include_str!(\\\"bench_scripts/clean_js.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 23,\n \"score\": 225029.06655030104\n },\n {\n \"content\": \"fn array_pop(c: &mut Criterion) {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let nodes = Parser::new(ARRAY_POP.as_bytes()).parse_all().unwrap();\\n\\n\\n\\n c.bench_function(\\\"Array pop (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic STRING_CONCAT: &str = include_str!(\\\"bench_scripts/string_concat.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 24,\n \"score\": 224808.754898185\n },\n {\n \"content\": \"fn array_creation(c: &mut Criterion) {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let nodes = Parser::new(ARRAY_CREATE.as_bytes()).parse_all().unwrap();\\n\\n\\n\\n c.bench_function(\\\"Array creation (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic ARRAY_POP: &str = include_str!(\\\"bench_scripts/array_pop.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 25,\n \"score\": 224808.754898185\n },\n {\n \"content\": \"fn array_access(c: &mut Criterion) {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let nodes = Parser::new(ARRAY_ACCESS.as_bytes()).parse_all().unwrap();\\n\\n\\n\\n c.bench_function(\\\"Array access (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic ARRAY_CREATE: &str = include_str!(\\\"bench_scripts/array_create.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 26,\n \"score\": 224808.754898185\n },\n {\n \"content\": \"fn object_creation(c: &mut Criterion) {\\n\\n // Create new Realm and interpreter.\\n\\n let mut engine = Context::new();\\n\\n\\n\\n // Parse the AST nodes.\\n\\n let nodes = Parser::new(OBJECT_CREATION.as_bytes()).parse_all().unwrap();\\n\\n\\n\\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\\n\\n c.bench_function(\\\"Object Creation (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic OBJECT_PROP_ACCESS_CONST: &str = include_str!(\\\"bench_scripts/object_prop_access_const.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 27,\n \"score\": 224781.55951559293\n },\n {\n \"content\": \"#[test]\\n\\nfn string_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = \\\"hello\\\";\\n\\n\\n\\n switch (a) {\\n\\n case \\\"hello\\\":\\n\\n a = \\\"world\\\";\\n\\n break;\\n\\n default:\\n\\n a = \\\"hi\\\";\\n\\n }\\n\\n \\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"\\\\\\\"world\\\\\\\"\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 28,\n \"score\": 220918.1755513723\n },\n {\n \"content\": \"#[test]\\n\\nfn no_cases_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n switch (a) {\\n\\n }\\n\\n \\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"10\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 29,\n \"score\": 220918.17555137232\n },\n {\n \"content\": \"#[test]\\n\\nfn test_conditional_op() {\\n\\n let scenario = \\\"1 === 2 ? 'a' : 'b'\\\";\\n\\n assert_eq!(&exec(scenario), \\\"\\\\\\\"b\\\\\\\"\\\");\\n\\n}\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 30,\n \"score\": 220424.67482444123\n },\n {\n \"content\": \"fn string_object_access(c: &mut Criterion) {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let nodes = Parser::new(STRING_OBJECT_ACCESS.as_bytes())\\n\\n .parse_all()\\n\\n .unwrap();\\n\\n\\n\\n c.bench_function(\\\"String Object Access (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic ARITHMETIC_OPERATIONS: &str = include_str!(\\\"bench_scripts/arithmetic_operations.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 31,\n \"score\": 220201.5514132485\n },\n {\n \"content\": \"fn number_object_access(c: &mut Criterion) {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let nodes = Parser::new(NUMBER_OBJECT_ACCESS.as_bytes())\\n\\n .parse_all()\\n\\n .unwrap();\\n\\n\\n\\n c.bench_function(\\\"Number Object Access (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic BOOLEAN_OBJECT_ACCESS: &str = include_str!(\\\"bench_scripts/boolean_object_access.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 32,\n \"score\": 220201.5514132485\n },\n {\n \"content\": \"fn boolean_object_access(c: &mut Criterion) {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let nodes = Parser::new(BOOLEAN_OBJECT_ACCESS.as_bytes())\\n\\n .parse_all()\\n\\n .unwrap();\\n\\n\\n\\n c.bench_function(\\\"Boolean Object Access (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic STRING_OBJECT_ACCESS: &str = include_str!(\\\"bench_scripts/string_object_access.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 33,\n \"score\": 220201.5514132485\n },\n {\n \"content\": \"#[test]\\n\\nfn is_object() {\\n\\n let val = Value::new_object(None);\\n\\n assert_eq!(val.is_object(), true);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 34,\n \"score\": 218508.02016138643\n },\n {\n \"content\": \"#[test]\\n\\nfn to_object() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n assert!(Value::undefined()\\n\\n .to_object(&mut engine)\\n\\n .unwrap_err()\\n\\n .is_object());\\n\\n assert!(Value::null()\\n\\n .to_object(&mut engine)\\n\\n .unwrap_err()\\n\\n .is_object());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 35,\n \"score\": 218481.3150389026\n },\n {\n \"content\": \"#[test]\\n\\nfn two_case_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n switch (a) {\\n\\n case 5:\\n\\n a = 15;\\n\\n break;\\n\\n case 10:\\n\\n a = 20;\\n\\n break;\\n\\n }\\n\\n \\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"20\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 36,\n \"score\": 216619.615200567\n },\n {\n \"content\": \"#[test]\\n\\nfn no_true_case_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n switch (a) {\\n\\n case 5:\\n\\n a = 15;\\n\\n break;\\n\\n }\\n\\n \\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"10\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 37,\n \"score\": 216619.615200567\n },\n {\n \"content\": \"#[test]\\n\\nfn single_case_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n switch (a) {\\n\\n case 10:\\n\\n a = 20;\\n\\n break;\\n\\n }\\n\\n \\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"20\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 38,\n \"score\": 216619.615200567\n },\n {\n \"content\": \"#[test]\\n\\nfn bigger_switch_example() {\\n\\n let expected = [\\n\\n \\\"\\\\\\\"Mon\\\\\\\"\\\",\\n\\n \\\"\\\\\\\"Tue\\\\\\\"\\\",\\n\\n \\\"\\\\\\\"Wed\\\\\\\"\\\",\\n\\n \\\"\\\\\\\"Thurs\\\\\\\"\\\",\\n\\n \\\"\\\\\\\"Fri\\\\\\\"\\\",\\n\\n \\\"\\\\\\\"Sat\\\\\\\"\\\",\\n\\n \\\"\\\\\\\"Sun\\\\\\\"\\\",\\n\\n ];\\n\\n\\n\\n for (i, val) in expected.iter().enumerate() {\\n\\n let scenario = format!(\\n\\n r#\\\"\\n\\n let a = {};\\n\\n let b = \\\"unknown\\\";\\n\\n\\n\\n switch (a) {{\\n\\n case 0:\\n\\n b = \\\"Mon\\\";\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 39,\n \"score\": 216619.615200567\n },\n {\n \"content\": \"fn object_prop_access_const(c: &mut Criterion) {\\n\\n // Create new Realm and interpreter.\\n\\n let mut engine = Context::new();\\n\\n\\n\\n // Parse the AST nodes.\\n\\n let nodes = Parser::new(OBJECT_PROP_ACCESS_CONST.as_bytes())\\n\\n .parse_all()\\n\\n .unwrap();\\n\\n\\n\\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\\n\\n c.bench_function(\\\"Static Object Property Access (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic OBJECT_PROP_ACCESS_DYN: &str = include_str!(\\\"bench_scripts/object_prop_access_dyn.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 40,\n \"score\": 215845.52491736907\n },\n {\n \"content\": \"fn object_prop_access_dyn(c: &mut Criterion) {\\n\\n // Create new Realm and interpreter.\\n\\n let mut engine = Context::new();\\n\\n\\n\\n // Parse the AST nodes.\\n\\n let nodes = Parser::new(OBJECT_PROP_ACCESS_DYN.as_bytes())\\n\\n .parse_all()\\n\\n .unwrap();\\n\\n\\n\\n // Execute the parsed nodes, passing them through a black box, to avoid over-optimizing by the compiler\\n\\n c.bench_function(\\\"Dynamic Object Property Access (Execution)\\\", move |b| {\\n\\n b.iter(|| black_box(&nodes).run(&mut engine).unwrap())\\n\\n });\\n\\n}\\n\\n\\n\\nstatic REGEXP_LITERAL_CREATION: &str = include_str!(\\\"bench_scripts/regexp_literal_creation.js\\\");\\n\\n\\n\",\n \"file_path\": \"boa/benches/exec.rs\",\n \"rank\": 41,\n \"score\": 215845.52491736907\n },\n {\n \"content\": \"#[test]\\n\\nfn spread_with_arguments() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let scenario = r#\\\"\\n\\n const a = [1, \\\"test\\\", 3, 4];\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 42,\n \"score\": 213885.83966416545\n },\n {\n \"content\": \"#[test]\\n\\nfn early_return() {\\n\\n let early_return = r#\\\"\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 43,\n \"score\": 213838.15952538123\n },\n {\n \"content\": \"#[test]\\n\\nfn comma_operator() {\\n\\n let scenario = r#\\\"\\n\\n var a, b;\\n\\n b = 10;\\n\\n a = (b++, b);\\n\\n a\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"11\\\");\\n\\n\\n\\n let scenario = r#\\\"\\n\\n var a, b;\\n\\n b = 10;\\n\\n a = (b += 5, b /= 3, b - 3);\\n\\n a\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"2\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 44,\n \"score\": 213712.60883103716\n },\n {\n \"content\": \"#[test]\\n\\nfn tilde_operator() {\\n\\n let float = r#\\\"\\n\\n let f = -1.2;\\n\\n ~f\\n\\n \\\"#;\\n\\n assert_eq!(&exec(float), \\\"0\\\");\\n\\n\\n\\n let numeric = r#\\\"\\n\\n let f = 1789;\\n\\n ~f\\n\\n \\\"#;\\n\\n assert_eq!(&exec(numeric), \\\"-1790\\\");\\n\\n\\n\\n let nan = r#\\\"\\n\\n var m = NaN;\\n\\n ~m\\n\\n \\\"#;\\n\\n assert_eq!(&exec(nan), \\\"-1\\\");\\n\\n\\n\\n let object = r#\\\"\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 45,\n \"score\": 213712.60883103716\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore] // TODO: Once objects are printed in a simpler way this test can be simplified and used\\n\\nfn display_object() {\\n\\n let mut engine = Context::new();\\n\\n let d_obj = r#\\\"\\n\\n let o = {a: 'a'};\\n\\n o\\n\\n \\\"#;\\n\\n let value = forward_val(&mut engine, d_obj).unwrap();\\n\\n assert_eq!(\\n\\n value.display().to_string(),\\n\\n r#\\\"{\\n\\n a: \\\"a\\\",\\n\\n__proto__: {\\n\\nconstructor: {\\n\\nsetPrototypeOf: {\\n\\n length: 2\\n\\n },\\n\\n prototype: [Cycle],\\n\\n name: \\\"Object\\\",\\n\\n length: 1,\\n\\ndefineProperty: {\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 46,\n \"score\": 213495.30302114322\n },\n {\n \"content\": \"#[test]\\n\\nfn debug_object() {\\n\\n let mut engine = Context::new();\\n\\n let value = forward_val(&mut engine, \\\"new Array([new Date()])\\\").unwrap();\\n\\n\\n\\n // We don't care about the contents of the debug display (it is *debug* after all). In the commit that this test was\\n\\n // added, this would cause a stack overflow, so executing Debug::fmt is the assertion.\\n\\n //\\n\\n // However, we want to make sure that no data is being left in the internal hashset, so executing this twice should\\n\\n // result in the same output.\\n\\n assert_eq!(format!(\\\"{:?}\\\", value), format!(\\\"{:?}\\\", value));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 47,\n \"score\": 213484.57106078436\n },\n {\n \"content\": \"#[test]\\n\\nfn hash_object() {\\n\\n let object1 = Value::object(Object::default());\\n\\n assert_eq!(object1, object1);\\n\\n assert_eq!(object1, object1.clone());\\n\\n\\n\\n let object2 = Value::object(Object::default());\\n\\n assert_ne!(object1, object2);\\n\\n\\n\\n assert_eq!(hash_value(&object1), hash_value(&object1.clone()));\\n\\n assert_ne!(hash_value(&object1), hash_value(&object2));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 48,\n \"score\": 213484.57106078434\n },\n {\n \"content\": \"#[test]\\n\\nfn typeof_object() {\\n\\n let typeof_object = r#\\\"\\n\\n let a = {};\\n\\n typeof a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(typeof_object), \\\"\\\\\\\"object\\\\\\\"\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 49,\n \"score\": 213458.57062797187\n },\n {\n \"content\": \"#[test]\\n\\nfn let_declaration() {\\n\\n check_parser(\\n\\n \\\"let a = 5;\\\",\\n\\n vec![LetDeclList::from(vec![LetDecl::new(\\\"a\\\", Node::from(Const::from(5)))]).into()],\\n\\n );\\n\\n}\\n\\n\\n\\n/// Checks `let` declaration parsing with reserved words.\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/declaration/tests.rs\",\n \"rank\": 50,\n \"score\": 212938.41448748918\n },\n {\n \"content\": \"#[test]\\n\\nfn two_case_no_break_switch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n let b = 10;\\n\\n\\n\\n switch (a) {\\n\\n case 10:\\n\\n a = 150;\\n\\n case 20:\\n\\n b = 150;\\n\\n break;\\n\\n }\\n\\n \\n\\n a + b;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"300\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/switch/tests.rs\",\n \"rank\": 51,\n \"score\": 212514.9819385669\n },\n {\n \"content\": \"#[test]\\n\\nfn sub_number_object_and_number_object() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let value = forward_val(&mut engine, \\\"new Number(1) - new Number(999)\\\").unwrap();\\n\\n let value = value.to_i32(&mut engine).unwrap();\\n\\n assert_eq!(value, -998);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 52,\n \"score\": 212140.0070023422\n },\n {\n \"content\": \"#[test]\\n\\nfn add_number_object_and_string_object() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let value = forward_val(&mut engine, \\\"new Number(10) + new String(\\\\\\\"0\\\\\\\")\\\").unwrap();\\n\\n let value = value.to_string(&mut engine).unwrap();\\n\\n assert_eq!(value, \\\"100\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 53,\n \"score\": 212140.0070023422\n },\n {\n \"content\": \"#[wasm_bindgen]\\n\\npub fn evaluate(src: &str) -> Result<String, JsValue> {\\n\\n // Setup executor\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let expr = match parse(src) {\\n\\n Ok(res) => res,\\n\\n Err(e) => {\\n\\n return Err(format!(\\n\\n \\\"Uncaught {}\\\",\\n\\n engine\\n\\n .throw_syntax_error(e.to_string())\\n\\n .expect_err(\\\"interpreter.throw_syntax_error() did not return an error\\\")\\n\\n .display()\\n\\n )\\n\\n .into());\\n\\n }\\n\\n };\\n\\n expr.run(&mut engine)\\n\\n .map_err(|e| JsValue::from(format!(\\\"Uncaught {}\\\", e.display())))\\n\\n .map(|v| v.display().to_string())\\n\\n}\\n\",\n \"file_path\": \"boa_wasm/src/lib.rs\",\n \"rank\": 54,\n \"score\": 211406.35155318014\n },\n {\n \"content\": \"#[test]\\n\\nfn get_set_field() {\\n\\n let obj = Value::new_object(None);\\n\\n // Create string and convert it to a Value\\n\\n let s = Value::from(\\\"bar\\\");\\n\\n obj.set_field(\\\"foo\\\", s);\\n\\n assert_eq!(obj.get_field(\\\"foo\\\").display().to_string(), \\\"\\\\\\\"bar\\\\\\\"\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 55,\n \"score\": 209126.42456356777\n },\n {\n \"content\": \"#[test]\\n\\nfn let_declaration_no_spaces() {\\n\\n check_parser(\\n\\n \\\"let a=5;\\\",\\n\\n vec![LetDeclList::from(vec![LetDecl::new(\\\"a\\\", Node::from(Const::from(5)))]).into()],\\n\\n );\\n\\n}\\n\\n\\n\\n/// Checks empty `let` declaration parsing.\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/declaration/tests.rs\",\n \"rank\": 56,\n \"score\": 209003.47694130227\n },\n {\n \"content\": \"#[test]\\n\\nfn empty_let_declaration() {\\n\\n check_parser(\\n\\n \\\"let a;\\\",\\n\\n vec![LetDeclList::from(vec![LetDecl::new(\\\"a\\\", None)]).into()],\\n\\n );\\n\\n}\\n\\n\\n\\n/// Checks multiple `let` declarations.\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/declaration/tests.rs\",\n \"rank\": 57,\n \"score\": 209003.47694130227\n },\n {\n \"content\": \"#[test]\\n\\nfn multiple_let_declaration() {\\n\\n check_parser(\\n\\n \\\"let a = 5, b, c = 6;\\\",\\n\\n vec![LetDeclList::from(vec![\\n\\n LetDecl::new(\\\"a\\\", Node::from(Const::from(5))),\\n\\n LetDecl::new(\\\"b\\\", None),\\n\\n LetDecl::new(\\\"c\\\", Node::from(Const::from(6))),\\n\\n ])\\n\\n .into()],\\n\\n );\\n\\n}\\n\\n\\n\\n/// Checks `const` declaration parsing.\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/declaration/tests.rs\",\n \"rank\": 58,\n \"score\": 209003.47694130227\n },\n {\n \"content\": \"#[test]\\n\\nfn let_declaration_keywords() {\\n\\n check_parser(\\n\\n \\\"let yield = 5;\\\",\\n\\n vec![LetDeclList::from(vec![LetDecl::new(\\\"yield\\\", Node::from(Const::from(5)))]).into()],\\n\\n );\\n\\n\\n\\n check_parser(\\n\\n \\\"let await = 5;\\\",\\n\\n vec![LetDeclList::from(vec![LetDecl::new(\\\"await\\\", Node::from(Const::from(5)))]).into()],\\n\\n );\\n\\n}\\n\\n\\n\\n/// Checks `let` declaration parsing with no spaces.\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/declaration/tests.rs\",\n \"rank\": 59,\n \"score\": 209003.47694130227\n },\n {\n \"content\": \"#[derive(Debug, Clone, Copy)]\\n\\nstruct CaseBlock {\\n\\n allow_yield: AllowYield,\\n\\n allow_await: AllowAwait,\\n\\n allow_return: AllowReturn,\\n\\n}\\n\\n\\n\\nimpl CaseBlock {\\n\\n /// Creates a new `CaseBlock` parser.\\n\\n fn new<Y, A, R>(allow_yield: Y, allow_await: A, allow_return: R) -> Self\\n\\n where\\n\\n Y: Into<AllowYield>,\\n\\n A: Into<AllowAwait>,\\n\\n R: Into<AllowReturn>,\\n\\n {\\n\\n Self {\\n\\n allow_yield: allow_yield.into(),\\n\\n allow_await: allow_await.into(),\\n\\n allow_return: allow_return.into(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/switch/mod.rs\",\n \"rank\": 60,\n \"score\": 208992.26112287797\n },\n {\n \"content\": \"#[test]\\n\\nfn assign_operator_precedence() {\\n\\n let src = r#\\\"\\n\\n let a = 1;\\n\\n a = a + 1;\\n\\n a\\n\\n \\\"#;\\n\\n assert_eq!(&exec(src), \\\"2\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 61,\n \"score\": 208941.5966858877\n },\n {\n \"content\": \"#[test]\\n\\nfn do_while_loop_continue() {\\n\\n let scenario = r#\\\"\\n\\n var i = 0, a = 0, b = 0;\\n\\n do {\\n\\n i++;\\n\\n if (i < 2) {\\n\\n a++;\\n\\n continue;\\n\\n }\\n\\n b++;\\n\\n } while (i < 3)\\n\\n [a, b]\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"[ 1, 2 ]\\\");\\n\\n}\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 62,\n \"score\": 208936.8416823892\n },\n {\n \"content\": \"#[test]\\n\\nfn while_loop_continue() {\\n\\n let scenario = r#\\\"\\n\\n var i = 0, a = 0, b = 0;\\n\\n while (i < 3) {\\n\\n i++;\\n\\n if (i < 2) {\\n\\n a++;\\n\\n continue;\\n\\n }\\n\\n b++;\\n\\n }\\n\\n [a, b]\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"[ 1, 2 ]\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 63,\n \"score\": 208936.8416823892\n },\n {\n \"content\": \"#[test]\\n\\nfn for_loop_break() {\\n\\n let scenario = r#\\\"\\n\\n let a = 1;\\n\\n for (; a < 5; a++) {\\n\\n if (a == 3) {\\n\\n break;\\n\\n }\\n\\n }\\n\\n a;\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"3\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 64,\n \"score\": 208936.8416823892\n },\n {\n \"content\": \"#[test]\\n\\nfn finally() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n try {\\n\\n a = 20;\\n\\n } finally {\\n\\n a = 30;\\n\\n }\\n\\n\\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"30\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/try_node/tests.rs\",\n \"rank\": 65,\n \"score\": 208760.62008816598\n },\n {\n \"content\": \"#[test]\\n\\nfn catch() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n try {\\n\\n throw \\\"error\\\";\\n\\n } catch {\\n\\n a = 20;\\n\\n }\\n\\n\\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"20\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/try_node/tests.rs\",\n \"rank\": 66,\n \"score\": 208760.62008816595\n },\n {\n \"content\": \"#[test]\\n\\nfn display_array_string() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let value = forward_val(&mut engine, \\\"[\\\\\\\"Hello\\\\\\\"]\\\").unwrap();\\n\\n assert_eq!(value.display().to_string(), \\\"[ \\\\\\\"Hello\\\\\\\" ]\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 67,\n \"score\": 208746.61701120218\n },\n {\n \"content\": \"#[test]\\n\\nfn includes_value() {\\n\\n let mut engine = Context::new();\\n\\n let init = r#\\\"\\n\\n var empty = [ ];\\n\\n var one = [\\\"a\\\"];\\n\\n var many = [\\\"a\\\", \\\"b\\\", \\\"c\\\"];\\n\\n var duplicates = [\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"a\\\", \\\"b\\\"];\\n\\n var undefined = [undefined];\\n\\n \\\"#;\\n\\n eprintln!(\\\"{}\\\", forward(&mut engine, init));\\n\\n\\n\\n // Empty\\n\\n let empty = forward(&mut engine, \\\"empty.includes('a')\\\");\\n\\n assert_eq!(empty, String::from(\\\"false\\\"));\\n\\n\\n\\n // One\\n\\n let one = forward(&mut engine, \\\"one.includes('a')\\\");\\n\\n assert_eq!(one, String::from(\\\"true\\\"));\\n\\n // Missing from one\\n\\n let missing_from_one = forward(&mut engine, \\\"one.includes('b')\\\");\\n\",\n \"file_path\": \"boa/src/builtins/array/tests.rs\",\n \"rank\": 68,\n \"score\": 208746.61701120218\n },\n {\n \"content\": \"#[test]\\n\\nfn for_each_push_value() {\\n\\n let mut engine = Context::new();\\n\\n let init = r#\\\"\\n\\n var a = [1, 2, 3, 4];\\n\",\n \"file_path\": \"boa/src/builtins/array/tests.rs\",\n \"rank\": 69,\n \"score\": 208746.61701120218\n },\n {\n \"content\": \"#[test]\\n\\nfn assign_to_array_decl() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n assert!(forward(&mut engine, \\\"[1] = [2]\\\").starts_with(\\\"Uncaught \\\\\\\"SyntaxError\\\\\\\": \\\"));\\n\\n assert!(forward(&mut engine, \\\"[3, 5] = [7, 8]\\\").starts_with(\\\"Uncaught \\\\\\\"SyntaxError\\\\\\\": \\\"));\\n\\n assert!(forward(&mut engine, \\\"[6, 8] = [2]\\\").starts_with(\\\"Uncaught \\\\\\\"SyntaxError\\\\\\\": \\\"));\\n\\n assert!(forward(&mut engine, \\\"[6] = [2, 9]\\\").starts_with(\\\"Uncaught \\\\\\\"SyntaxError\\\\\\\": \\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 70,\n \"score\": 208721.28503377165\n },\n {\n \"content\": \"#[test]\\n\\nfn array_rest_with_arguments() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let scenario = r#\\\"\\n\\n var b = [4, 5, 6]\\n\\n var a = [1, 2, 3, ...b];\\n\\n \\\"#;\\n\\n forward(&mut engine, scenario);\\n\\n let one = forward(&mut engine, \\\"a\\\");\\n\\n assert_eq!(one, String::from(\\\"[ 1, 2, 3, 4, 5, 6 ]\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 71,\n \"score\": 208721.28503377165\n },\n {\n \"content\": \"#[test]\\n\\nfn array_pop_benchmark() {\\n\\n let mut engine = Context::new();\\n\\n let init = r#\\\"\\n\\n (function(){\\n\\n let testArray = [83, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32,\\n\\n 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828,\\n\\n 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62,\\n\\n 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67,\\n\\n 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29,\\n\\n 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28,\\n\\n 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32,\\n\\n 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36, 28, 93,\\n\\n 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32, 45, 93,\\n\\n 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234, 23,\\n\\n 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99, 36,\\n\\n 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32,\\n\\n 45, 93, 17, 28, 83, 62, 99, 36, 28, 93, 27, 29, 2828, 234,\\n\\n 23, 56, 32, 56, 67, 77, 32, 45, 93, 17, 28, 83, 62, 99,\\n\\n 36, 28, 93, 27, 29, 2828, 234, 23, 56, 32, 56, 67, 77, 32,\\n\\n 45, 93, 17, 28, 83, 62, 99, 36, 28];\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 72,\n \"score\": 208721.28503377165\n },\n {\n \"content\": \"#[test]\\n\\nfn array_creation_benchmark() {\\n\\n let mut engine = Context::new();\\n\\n let init = r#\\\"\\n\\n (function(){\\n\\n let testArr = [];\\n\\n for (let a = 0; a <= 500; a++) {\\n\\n testArr[a] = ('p' + a);\\n\\n }\\n\\n\\n\\n return testArr;\\n\\n })();\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(forward(&mut engine, init), \\\"[ \\\\\\\"p0\\\\\\\", \\\\\\\"p1\\\\\\\", \\\\\\\"p2\\\\\\\", \\\\\\\"p3\\\\\\\", \\\\\\\"p4\\\\\\\", \\\\\\\"p5\\\\\\\", \\\\\\\"p6\\\\\\\", \\\\\\\"p7\\\\\\\", \\\\\\\"p8\\\\\\\", \\\\\\\"p9\\\\\\\", \\\\\\\"p10\\\\\\\", \\\\\\\"p11\\\\\\\", \\\\\\\"p12\\\\\\\", \\\\\\\"p13\\\\\\\", \\\\\\\"p14\\\\\\\", \\\\\\\"p15\\\\\\\", \\\\\\\"p16\\\\\\\", \\\\\\\"p17\\\\\\\", \\\\\\\"p18\\\\\\\", \\\\\\\"p19\\\\\\\", \\\\\\\"p20\\\\\\\", \\\\\\\"p21\\\\\\\", \\\\\\\"p22\\\\\\\", \\\\\\\"p23\\\\\\\", \\\\\\\"p24\\\\\\\", \\\\\\\"p25\\\\\\\", \\\\\\\"p26\\\\\\\", \\\\\\\"p27\\\\\\\", \\\\\\\"p28\\\\\\\", \\\\\\\"p29\\\\\\\", \\\\\\\"p30\\\\\\\", \\\\\\\"p31\\\\\\\", \\\\\\\"p32\\\\\\\", \\\\\\\"p33\\\\\\\", \\\\\\\"p34\\\\\\\", \\\\\\\"p35\\\\\\\", \\\\\\\"p36\\\\\\\", \\\\\\\"p37\\\\\\\", \\\\\\\"p38\\\\\\\", \\\\\\\"p39\\\\\\\", \\\\\\\"p40\\\\\\\", \\\\\\\"p41\\\\\\\", \\\\\\\"p42\\\\\\\", \\\\\\\"p43\\\\\\\", \\\\\\\"p44\\\\\\\", \\\\\\\"p45\\\\\\\", \\\\\\\"p46\\\\\\\", \\\\\\\"p47\\\\\\\", \\\\\\\"p48\\\\\\\", \\\\\\\"p49\\\\\\\", \\\\\\\"p50\\\\\\\", \\\\\\\"p51\\\\\\\", \\\\\\\"p52\\\\\\\", \\\\\\\"p53\\\\\\\", \\\\\\\"p54\\\\\\\", \\\\\\\"p55\\\\\\\", \\\\\\\"p56\\\\\\\", \\\\\\\"p57\\\\\\\", \\\\\\\"p58\\\\\\\", \\\\\\\"p59\\\\\\\", \\\\\\\"p60\\\\\\\", \\\\\\\"p61\\\\\\\", \\\\\\\"p62\\\\\\\", \\\\\\\"p63\\\\\\\", \\\\\\\"p64\\\\\\\", \\\\\\\"p65\\\\\\\", \\\\\\\"p66\\\\\\\", \\\\\\\"p67\\\\\\\", \\\\\\\"p68\\\\\\\", \\\\\\\"p69\\\\\\\", \\\\\\\"p70\\\\\\\", \\\\\\\"p71\\\\\\\", \\\\\\\"p72\\\\\\\", \\\\\\\"p73\\\\\\\", \\\\\\\"p74\\\\\\\", \\\\\\\"p75\\\\\\\", \\\\\\\"p76\\\\\\\", \\\\\\\"p77\\\\\\\", \\\\\\\"p78\\\\\\\", \\\\\\\"p79\\\\\\\", \\\\\\\"p80\\\\\\\", \\\\\\\"p81\\\\\\\", \\\\\\\"p82\\\\\\\", \\\\\\\"p83\\\\\\\", \\\\\\\"p84\\\\\\\", \\\\\\\"p85\\\\\\\", \\\\\\\"p86\\\\\\\", \\\\\\\"p87\\\\\\\", \\\\\\\"p88\\\\\\\", \\\\\\\"p89\\\\\\\", \\\\\\\"p90\\\\\\\", \\\\\\\"p91\\\\\\\", \\\\\\\"p92\\\\\\\", \\\\\\\"p93\\\\\\\", \\\\\\\"p94\\\\\\\", \\\\\\\"p95\\\\\\\", \\\\\\\"p96\\\\\\\", \\\\\\\"p97\\\\\\\", \\\\\\\"p98\\\\\\\", \\\\\\\"p99\\\\\\\", \\\\\\\"p100\\\\\\\", \\\\\\\"p101\\\\\\\", \\\\\\\"p102\\\\\\\", \\\\\\\"p103\\\\\\\", \\\\\\\"p104\\\\\\\", \\\\\\\"p105\\\\\\\", \\\\\\\"p106\\\\\\\", \\\\\\\"p107\\\\\\\", \\\\\\\"p108\\\\\\\", \\\\\\\"p109\\\\\\\", \\\\\\\"p110\\\\\\\", \\\\\\\"p111\\\\\\\", \\\\\\\"p112\\\\\\\", \\\\\\\"p113\\\\\\\", \\\\\\\"p114\\\\\\\", \\\\\\\"p115\\\\\\\", \\\\\\\"p116\\\\\\\", \\\\\\\"p117\\\\\\\", \\\\\\\"p118\\\\\\\", \\\\\\\"p119\\\\\\\", \\\\\\\"p120\\\\\\\", \\\\\\\"p121\\\\\\\", \\\\\\\"p122\\\\\\\", \\\\\\\"p123\\\\\\\", \\\\\\\"p124\\\\\\\", \\\\\\\"p125\\\\\\\", \\\\\\\"p126\\\\\\\", \\\\\\\"p127\\\\\\\", \\\\\\\"p128\\\\\\\", \\\\\\\"p129\\\\\\\", \\\\\\\"p130\\\\\\\", \\\\\\\"p131\\\\\\\", \\\\\\\"p132\\\\\\\", \\\\\\\"p133\\\\\\\", \\\\\\\"p134\\\\\\\", \\\\\\\"p135\\\\\\\", \\\\\\\"p136\\\\\\\", \\\\\\\"p137\\\\\\\", \\\\\\\"p138\\\\\\\", \\\\\\\"p139\\\\\\\", \\\\\\\"p140\\\\\\\", \\\\\\\"p141\\\\\\\", \\\\\\\"p142\\\\\\\", \\\\\\\"p143\\\\\\\", \\\\\\\"p144\\\\\\\", \\\\\\\"p145\\\\\\\", \\\\\\\"p146\\\\\\\", \\\\\\\"p147\\\\\\\", \\\\\\\"p148\\\\\\\", \\\\\\\"p149\\\\\\\", \\\\\\\"p150\\\\\\\", \\\\\\\"p151\\\\\\\", \\\\\\\"p152\\\\\\\", \\\\\\\"p153\\\\\\\", \\\\\\\"p154\\\\\\\", \\\\\\\"p155\\\\\\\", \\\\\\\"p156\\\\\\\", \\\\\\\"p157\\\\\\\", \\\\\\\"p158\\\\\\\", \\\\\\\"p159\\\\\\\", \\\\\\\"p160\\\\\\\", \\\\\\\"p161\\\\\\\", \\\\\\\"p162\\\\\\\", \\\\\\\"p163\\\\\\\", \\\\\\\"p164\\\\\\\", \\\\\\\"p165\\\\\\\", \\\\\\\"p166\\\\\\\", \\\\\\\"p167\\\\\\\", \\\\\\\"p168\\\\\\\", \\\\\\\"p169\\\\\\\", \\\\\\\"p170\\\\\\\", \\\\\\\"p171\\\\\\\", \\\\\\\"p172\\\\\\\", \\\\\\\"p173\\\\\\\", \\\\\\\"p174\\\\\\\", \\\\\\\"p175\\\\\\\", \\\\\\\"p176\\\\\\\", \\\\\\\"p177\\\\\\\", \\\\\\\"p178\\\\\\\", \\\\\\\"p179\\\\\\\", \\\\\\\"p180\\\\\\\", \\\\\\\"p181\\\\\\\", \\\\\\\"p182\\\\\\\", \\\\\\\"p183\\\\\\\", \\\\\\\"p184\\\\\\\", \\\\\\\"p185\\\\\\\", \\\\\\\"p186\\\\\\\", \\\\\\\"p187\\\\\\\", \\\\\\\"p188\\\\\\\", \\\\\\\"p189\\\\\\\", \\\\\\\"p190\\\\\\\", \\\\\\\"p191\\\\\\\", \\\\\\\"p192\\\\\\\", \\\\\\\"p193\\\\\\\", \\\\\\\"p194\\\\\\\", \\\\\\\"p195\\\\\\\", \\\\\\\"p196\\\\\\\", \\\\\\\"p197\\\\\\\", \\\\\\\"p198\\\\\\\", \\\\\\\"p199\\\\\\\", \\\\\\\"p200\\\\\\\", \\\\\\\"p201\\\\\\\", \\\\\\\"p202\\\\\\\", \\\\\\\"p203\\\\\\\", \\\\\\\"p204\\\\\\\", \\\\\\\"p205\\\\\\\", \\\\\\\"p206\\\\\\\", \\\\\\\"p207\\\\\\\", \\\\\\\"p208\\\\\\\", \\\\\\\"p209\\\\\\\", \\\\\\\"p210\\\\\\\", \\\\\\\"p211\\\\\\\", \\\\\\\"p212\\\\\\\", \\\\\\\"p213\\\\\\\", \\\\\\\"p214\\\\\\\", \\\\\\\"p215\\\\\\\", \\\\\\\"p216\\\\\\\", \\\\\\\"p217\\\\\\\", \\\\\\\"p218\\\\\\\", \\\\\\\"p219\\\\\\\", \\\\\\\"p220\\\\\\\", \\\\\\\"p221\\\\\\\", \\\\\\\"p222\\\\\\\", \\\\\\\"p223\\\\\\\", \\\\\\\"p224\\\\\\\", \\\\\\\"p225\\\\\\\", \\\\\\\"p226\\\\\\\", \\\\\\\"p227\\\\\\\", \\\\\\\"p228\\\\\\\", \\\\\\\"p229\\\\\\\", \\\\\\\"p230\\\\\\\", \\\\\\\"p231\\\\\\\", \\\\\\\"p232\\\\\\\", \\\\\\\"p233\\\\\\\", \\\\\\\"p234\\\\\\\", \\\\\\\"p235\\\\\\\", \\\\\\\"p236\\\\\\\", \\\\\\\"p237\\\\\\\", \\\\\\\"p238\\\\\\\", \\\\\\\"p239\\\\\\\", \\\\\\\"p240\\\\\\\", \\\\\\\"p241\\\\\\\", \\\\\\\"p242\\\\\\\", \\\\\\\"p243\\\\\\\", \\\\\\\"p244\\\\\\\", \\\\\\\"p245\\\\\\\", \\\\\\\"p246\\\\\\\", \\\\\\\"p247\\\\\\\", \\\\\\\"p248\\\\\\\", \\\\\\\"p249\\\\\\\", \\\\\\\"p250\\\\\\\", \\\\\\\"p251\\\\\\\", \\\\\\\"p252\\\\\\\", \\\\\\\"p253\\\\\\\", \\\\\\\"p254\\\\\\\", \\\\\\\"p255\\\\\\\", \\\\\\\"p256\\\\\\\", \\\\\\\"p257\\\\\\\", \\\\\\\"p258\\\\\\\", \\\\\\\"p259\\\\\\\", \\\\\\\"p260\\\\\\\", \\\\\\\"p261\\\\\\\", \\\\\\\"p262\\\\\\\", \\\\\\\"p263\\\\\\\", \\\\\\\"p264\\\\\\\", \\\\\\\"p265\\\\\\\", \\\\\\\"p266\\\\\\\", \\\\\\\"p267\\\\\\\", \\\\\\\"p268\\\\\\\", \\\\\\\"p269\\\\\\\", \\\\\\\"p270\\\\\\\", \\\\\\\"p271\\\\\\\", \\\\\\\"p272\\\\\\\", \\\\\\\"p273\\\\\\\", \\\\\\\"p274\\\\\\\", \\\\\\\"p275\\\\\\\", \\\\\\\"p276\\\\\\\", \\\\\\\"p277\\\\\\\", \\\\\\\"p278\\\\\\\", \\\\\\\"p279\\\\\\\", \\\\\\\"p280\\\\\\\", \\\\\\\"p281\\\\\\\", \\\\\\\"p282\\\\\\\", \\\\\\\"p283\\\\\\\", \\\\\\\"p284\\\\\\\", \\\\\\\"p285\\\\\\\", \\\\\\\"p286\\\\\\\", \\\\\\\"p287\\\\\\\", \\\\\\\"p288\\\\\\\", \\\\\\\"p289\\\\\\\", \\\\\\\"p290\\\\\\\", \\\\\\\"p291\\\\\\\", \\\\\\\"p292\\\\\\\", \\\\\\\"p293\\\\\\\", \\\\\\\"p294\\\\\\\", \\\\\\\"p295\\\\\\\", \\\\\\\"p296\\\\\\\", \\\\\\\"p297\\\\\\\", \\\\\\\"p298\\\\\\\", \\\\\\\"p299\\\\\\\", \\\\\\\"p300\\\\\\\", \\\\\\\"p301\\\\\\\", \\\\\\\"p302\\\\\\\", \\\\\\\"p303\\\\\\\", \\\\\\\"p304\\\\\\\", \\\\\\\"p305\\\\\\\", \\\\\\\"p306\\\\\\\", \\\\\\\"p307\\\\\\\", \\\\\\\"p308\\\\\\\", \\\\\\\"p309\\\\\\\", \\\\\\\"p310\\\\\\\", \\\\\\\"p311\\\\\\\", \\\\\\\"p312\\\\\\\", \\\\\\\"p313\\\\\\\", \\\\\\\"p314\\\\\\\", \\\\\\\"p315\\\\\\\", \\\\\\\"p316\\\\\\\", \\\\\\\"p317\\\\\\\", \\\\\\\"p318\\\\\\\", \\\\\\\"p319\\\\\\\", \\\\\\\"p320\\\\\\\", \\\\\\\"p321\\\\\\\", \\\\\\\"p322\\\\\\\", \\\\\\\"p323\\\\\\\", \\\\\\\"p324\\\\\\\", \\\\\\\"p325\\\\\\\", \\\\\\\"p326\\\\\\\", \\\\\\\"p327\\\\\\\", \\\\\\\"p328\\\\\\\", \\\\\\\"p329\\\\\\\", \\\\\\\"p330\\\\\\\", \\\\\\\"p331\\\\\\\", \\\\\\\"p332\\\\\\\", \\\\\\\"p333\\\\\\\", \\\\\\\"p334\\\\\\\", \\\\\\\"p335\\\\\\\", \\\\\\\"p336\\\\\\\", \\\\\\\"p337\\\\\\\", \\\\\\\"p338\\\\\\\", \\\\\\\"p339\\\\\\\", \\\\\\\"p340\\\\\\\", \\\\\\\"p341\\\\\\\", \\\\\\\"p342\\\\\\\", \\\\\\\"p343\\\\\\\", \\\\\\\"p344\\\\\\\", \\\\\\\"p345\\\\\\\", \\\\\\\"p346\\\\\\\", \\\\\\\"p347\\\\\\\", \\\\\\\"p348\\\\\\\", \\\\\\\"p349\\\\\\\", \\\\\\\"p350\\\\\\\", \\\\\\\"p351\\\\\\\", \\\\\\\"p352\\\\\\\", \\\\\\\"p353\\\\\\\", \\\\\\\"p354\\\\\\\", \\\\\\\"p355\\\\\\\", \\\\\\\"p356\\\\\\\", \\\\\\\"p357\\\\\\\", \\\\\\\"p358\\\\\\\", \\\\\\\"p359\\\\\\\", \\\\\\\"p360\\\\\\\", \\\\\\\"p361\\\\\\\", \\\\\\\"p362\\\\\\\", \\\\\\\"p363\\\\\\\", \\\\\\\"p364\\\\\\\", \\\\\\\"p365\\\\\\\", \\\\\\\"p366\\\\\\\", \\\\\\\"p367\\\\\\\", \\\\\\\"p368\\\\\\\", \\\\\\\"p369\\\\\\\", \\\\\\\"p370\\\\\\\", \\\\\\\"p371\\\\\\\", \\\\\\\"p372\\\\\\\", \\\\\\\"p373\\\\\\\", \\\\\\\"p374\\\\\\\", \\\\\\\"p375\\\\\\\", \\\\\\\"p376\\\\\\\", \\\\\\\"p377\\\\\\\", \\\\\\\"p378\\\\\\\", \\\\\\\"p379\\\\\\\", \\\\\\\"p380\\\\\\\", \\\\\\\"p381\\\\\\\", \\\\\\\"p382\\\\\\\", \\\\\\\"p383\\\\\\\", \\\\\\\"p384\\\\\\\", \\\\\\\"p385\\\\\\\", \\\\\\\"p386\\\\\\\", \\\\\\\"p387\\\\\\\", \\\\\\\"p388\\\\\\\", \\\\\\\"p389\\\\\\\", \\\\\\\"p390\\\\\\\", \\\\\\\"p391\\\\\\\", \\\\\\\"p392\\\\\\\", \\\\\\\"p393\\\\\\\", \\\\\\\"p394\\\\\\\", \\\\\\\"p395\\\\\\\", \\\\\\\"p396\\\\\\\", \\\\\\\"p397\\\\\\\", \\\\\\\"p398\\\\\\\", \\\\\\\"p399\\\\\\\", \\\\\\\"p400\\\\\\\", \\\\\\\"p401\\\\\\\", \\\\\\\"p402\\\\\\\", \\\\\\\"p403\\\\\\\", \\\\\\\"p404\\\\\\\", \\\\\\\"p405\\\\\\\", \\\\\\\"p406\\\\\\\", \\\\\\\"p407\\\\\\\", \\\\\\\"p408\\\\\\\", \\\\\\\"p409\\\\\\\", \\\\\\\"p410\\\\\\\", \\\\\\\"p411\\\\\\\", \\\\\\\"p412\\\\\\\", \\\\\\\"p413\\\\\\\", \\\\\\\"p414\\\\\\\", \\\\\\\"p415\\\\\\\", \\\\\\\"p416\\\\\\\", \\\\\\\"p417\\\\\\\", \\\\\\\"p418\\\\\\\", \\\\\\\"p419\\\\\\\", \\\\\\\"p420\\\\\\\", \\\\\\\"p421\\\\\\\", \\\\\\\"p422\\\\\\\", \\\\\\\"p423\\\\\\\", \\\\\\\"p424\\\\\\\", \\\\\\\"p425\\\\\\\", \\\\\\\"p426\\\\\\\", \\\\\\\"p427\\\\\\\", \\\\\\\"p428\\\\\\\", \\\\\\\"p429\\\\\\\", \\\\\\\"p430\\\\\\\", \\\\\\\"p431\\\\\\\", \\\\\\\"p432\\\\\\\", \\\\\\\"p433\\\\\\\", \\\\\\\"p434\\\\\\\", \\\\\\\"p435\\\\\\\", \\\\\\\"p436\\\\\\\", \\\\\\\"p437\\\\\\\", \\\\\\\"p438\\\\\\\", \\\\\\\"p439\\\\\\\", \\\\\\\"p440\\\\\\\", \\\\\\\"p441\\\\\\\", \\\\\\\"p442\\\\\\\", \\\\\\\"p443\\\\\\\", \\\\\\\"p444\\\\\\\", \\\\\\\"p445\\\\\\\", \\\\\\\"p446\\\\\\\", \\\\\\\"p447\\\\\\\", \\\\\\\"p448\\\\\\\", \\\\\\\"p449\\\\\\\", \\\\\\\"p450\\\\\\\", \\\\\\\"p451\\\\\\\", \\\\\\\"p452\\\\\\\", \\\\\\\"p453\\\\\\\", \\\\\\\"p454\\\\\\\", \\\\\\\"p455\\\\\\\", \\\\\\\"p456\\\\\\\", \\\\\\\"p457\\\\\\\", \\\\\\\"p458\\\\\\\", \\\\\\\"p459\\\\\\\", \\\\\\\"p460\\\\\\\", \\\\\\\"p461\\\\\\\", \\\\\\\"p462\\\\\\\", \\\\\\\"p463\\\\\\\", \\\\\\\"p464\\\\\\\", \\\\\\\"p465\\\\\\\", \\\\\\\"p466\\\\\\\", \\\\\\\"p467\\\\\\\", \\\\\\\"p468\\\\\\\", \\\\\\\"p469\\\\\\\", \\\\\\\"p470\\\\\\\", \\\\\\\"p471\\\\\\\", \\\\\\\"p472\\\\\\\", \\\\\\\"p473\\\\\\\", \\\\\\\"p474\\\\\\\", \\\\\\\"p475\\\\\\\", \\\\\\\"p476\\\\\\\", \\\\\\\"p477\\\\\\\", \\\\\\\"p478\\\\\\\", \\\\\\\"p479\\\\\\\", \\\\\\\"p480\\\\\\\", \\\\\\\"p481\\\\\\\", \\\\\\\"p482\\\\\\\", \\\\\\\"p483\\\\\\\", \\\\\\\"p484\\\\\\\", \\\\\\\"p485\\\\\\\", \\\\\\\"p486\\\\\\\", \\\\\\\"p487\\\\\\\", \\\\\\\"p488\\\\\\\", \\\\\\\"p489\\\\\\\", \\\\\\\"p490\\\\\\\", \\\\\\\"p491\\\\\\\", \\\\\\\"p492\\\\\\\", \\\\\\\"p493\\\\\\\", \\\\\\\"p494\\\\\\\", \\\\\\\"p495\\\\\\\", \\\\\\\"p496\\\\\\\", \\\\\\\"p497\\\\\\\", \\\\\\\"p498\\\\\\\", \\\\\\\"p499\\\\\\\", \\\\\\\"p500\\\\\\\" ]\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 73,\n \"score\": 208721.28503377168\n },\n {\n \"content\": \"#[test]\\n\\nfn display_number_object() {\\n\\n let mut engine = Context::new();\\n\\n let d_obj = r#\\\"\\n\\n let num = new Number(3.14);\\n\\n num\\n\\n \\\"#;\\n\\n let value = forward_val(&mut engine, d_obj).unwrap();\\n\\n assert_eq!(value.display().to_string(), \\\"Number { 3.14 }\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 74,\n \"score\": 208719.42162861014\n },\n {\n \"content\": \"#[test]\\n\\nfn display_boolean_object() {\\n\\n let mut engine = Context::new();\\n\\n let d_obj = r#\\\"\\n\\n let bool = new Boolean(0);\\n\\n bool\\n\\n \\\"#;\\n\\n let value = forward_val(&mut engine, d_obj).unwrap();\\n\\n assert_eq!(value.display().to_string(), \\\"Boolean { false }\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 75,\n \"score\": 208719.42162861014\n },\n {\n \"content\": \"#[test]\\n\\nfn assign_to_object_decl() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n const ERR_MSG: &str =\\n\\n \\\"Uncaught \\\\\\\"SyntaxError\\\\\\\": \\\\\\\"expected token \\\\';\\\\', got \\\\':\\\\' in expression statement at line 1, col 3\\\\\\\"\\\";\\n\\n\\n\\n assert_eq!(forward(&mut engine, \\\"{a: 3} = {a: 5};\\\"), ERR_MSG);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 76,\n \"score\": 208694.08965117962\n },\n {\n \"content\": \"#[test]\\n\\nfn call_array_constructor_with_one_argument() {\\n\\n let mut engine = Context::new();\\n\\n let init = r#\\\"\\n\\n var empty = new Array(0);\\n\\n\\n\\n var five = new Array(5);\\n\\n\\n\\n var one = new Array(\\\"Hello, world!\\\");\\n\\n \\\"#;\\n\\n forward(&mut engine, init);\\n\\n // let result = forward(&mut engine, \\\"empty.length\\\");\\n\\n // assert_eq!(result, \\\"0\\\");\\n\\n\\n\\n // let result = forward(&mut engine, \\\"five.length\\\");\\n\\n // assert_eq!(result, \\\"5\\\");\\n\\n\\n\\n // let result = forward(&mut engine, \\\"one.length\\\");\\n\\n // assert_eq!(result, \\\"1\\\");\\n\\n}\\n\",\n \"file_path\": \"boa/src/builtins/array/tests.rs\",\n \"rank\": 77,\n \"score\": 208674.35465775762\n },\n {\n \"content\": \"pub fn new_global_environment(global: Value, this_value: Value) -> Environment {\\n\\n let obj_rec = ObjectEnvironmentRecord {\\n\\n bindings: global,\\n\\n outer_env: None,\\n\\n /// Object Environment Records created for with statements (13.11)\\n\\n /// can provide their binding object as an implicit this value for use in function calls.\\n\\n /// The capability is controlled by a withEnvironment Boolean value that is associated\\n\\n /// with each object Environment Record. By default, the value of withEnvironment is false\\n\\n /// for any object Environment Record.\\n\\n with_environment: false,\\n\\n };\\n\\n\\n\\n let dcl_rec = DeclarativeEnvironmentRecord {\\n\\n env_rec: FxHashMap::default(),\\n\\n outer_env: None,\\n\\n };\\n\\n\\n\\n Gc::new(GcCell::new(Box::new(GlobalEnvironmentRecord {\\n\\n object_record: obj_rec,\\n\\n global_this_binding: this_value,\\n\",\n \"file_path\": \"boa/src/environment/lexical_environment.rs\",\n \"rank\": 78,\n \"score\": 206397.2708233666\n },\n {\n \"content\": \"#[test]\\n\\nfn check_switch_two_default() {\\n\\n check_invalid(\\n\\n r#\\\"\\n\\n let a = 10;\\n\\n switch (a) {\\n\\n default:\\n\\n a = 20;\\n\\n break;\\n\\n default:\\n\\n a = 30;\\n\\n break;\\n\\n }\\n\\n \\\"#,\\n\\n );\\n\\n}\\n\\n\\n\\n/// Checks parsing malformed switch with no expression.\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/switch/tests.rs\",\n \"rank\": 79,\n \"score\": 205349.5002958667\n },\n {\n \"content\": \"#[test]\\n\\nfn check_switch_seperated_defaults() {\\n\\n check_invalid(\\n\\n r#\\\"\\n\\n let a = 10;\\n\\n switch (a) {\\n\\n default:\\n\\n a = 20;\\n\\n break;\\n\\n case 10:\\n\\n a = 60;\\n\\n break;\\n\\n default:\\n\\n a = 30;\\n\\n break;\\n\\n }\\n\\n \\\"#,\\n\\n );\\n\\n}\\n\\n\\n\\n/// Example of JS code https://jsfiddle.net/zq6jx47h/4/.\\n\",\n \"file_path\": \"boa/src/syntax/parser/statement/switch/tests.rs\",\n \"rank\": 80,\n \"score\": 205349.5002958667\n },\n {\n \"content\": \"#[test]\\n\\nfn empty_let_decl_undefined() {\\n\\n let scenario = r#\\\"\\n\\n let a;\\n\\n a === undefined;\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"true\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 81,\n \"score\": 204581.10754333768\n },\n {\n \"content\": \"#[test]\\n\\nfn empty_function_returns_undefined() {\\n\\n let scenario = \\\"(function () {}) ()\\\";\\n\\n assert_eq!(&exec(scenario), \\\"undefined\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 82,\n \"score\": 204529.01211287102\n },\n {\n \"content\": \"#[test]\\n\\nfn calling_function_with_unspecified_arguments() {\\n\\n let mut engine = Context::new();\\n\\n let scenario = r#\\\"\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 83,\n \"score\": 204494.8576495031\n },\n {\n \"content\": \"#[test]\\n\\nfn assignmentoperator_lhs_not_defined() {\\n\\n let scenario = r#\\\"\\n\\n try {\\n\\n a += 5\\n\\n } catch (err) {\\n\\n err.toString()\\n\\n }\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"\\\\\\\"ReferenceError: a is not defined\\\\\\\"\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/operator/tests.rs\",\n \"rank\": 84,\n \"score\": 204409.75527200365\n },\n {\n \"content\": \"#[test]\\n\\nfn while_loop_late_break() {\\n\\n // Ordering with statement before the break.\\n\\n let scenario = r#\\\"\\n\\n let a = 1;\\n\\n while (a < 5) {\\n\\n a++;\\n\\n if (a == 3) {\\n\\n break;\\n\\n }\\n\\n }\\n\\n a;\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"3\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 85,\n \"score\": 204405.11945261425\n },\n {\n \"content\": \"#[test]\\n\\nfn while_loop_early_break() {\\n\\n // Ordering with statements after the break.\\n\\n let scenario = r#\\\"\\n\\n let a = 1;\\n\\n while (a < 5) {\\n\\n if (a == 3) {\\n\\n break;\\n\\n }\\n\\n a++;\\n\\n }\\n\\n a;\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"3\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 86,\n \"score\": 204405.11945261425\n },\n {\n \"content\": \"#[test]\\n\\nfn do_loop_early_break() {\\n\\n // Ordering with statements after the break.\\n\\n let scenario = r#\\\"\\n\\n let a = 1;\\n\\n do {\\n\\n if (a == 3) {\\n\\n break;\\n\\n }\\n\\n a++;\\n\\n } while (a < 5);\\n\\n a;\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"3\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 87,\n \"score\": 204405.11945261425\n },\n {\n \"content\": \"#[test]\\n\\nfn break_out_of_inner_loop() {\\n\\n let scenario = r#\\\"\\n\\n var a = 0, b = 0;\\n\\n for (let i = 0; i < 2; i++) {\\n\\n a++;\\n\\n for (let j = 0; j < 10; j++) {\\n\\n b++;\\n\\n if (j == 3)\\n\\n break;\\n\\n }\\n\\n a++;\\n\\n }\\n\\n [a, b]\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"[ 4, 8 ]\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 88,\n \"score\": 204405.11945261425\n },\n {\n \"content\": \"#[test]\\n\\nfn for_loop_iteration_variable_does_not_leak() {\\n\\n let inner_scope = r#\\\"\\n\\n for (let i = 0;false;) {}\\n\\n\\n\\n try {\\n\\n i\\n\\n } catch (err) {\\n\\n err.message\\n\\n }\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(inner_scope), \\\"\\\\\\\"i is not defined\\\\\\\"\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 89,\n \"score\": 204405.11945261425\n },\n {\n \"content\": \"#[test]\\n\\nfn do_loop_late_break() {\\n\\n // Ordering with statement before the break.\\n\\n let scenario = r#\\\"\\n\\n let a = 1;\\n\\n do {\\n\\n a++;\\n\\n if (a == 3) {\\n\\n break;\\n\\n }\\n\\n } while (a < 5);\\n\\n a;\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(&exec(scenario), \\\"3\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 90,\n \"score\": 204405.11945261425\n },\n {\n \"content\": \"#[test]\\n\\nfn continue_inner_loop() {\\n\\n let scenario = r#\\\"\\n\\n var a = 0, b = 0;\\n\\n for (let i = 0; i < 2; i++) {\\n\\n a++;\\n\\n for (let j = 0; j < 10; j++) {\\n\\n if (j < 3)\\n\\n continue;\\n\\n b++;\\n\\n }\\n\\n a++;\\n\\n }\\n\\n [a, b]\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"[ 4, 14 ]\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/iteration/tests.rs\",\n \"rank\": 91,\n \"score\": 204405.11945261425\n },\n {\n \"content\": \"#[test]\\n\\nfn simple_try() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n try {\\n\\n a = 20;\\n\\n } catch {\\n\\n a = 30;\\n\\n }\\n\\n\\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"20\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/try_node/tests.rs\",\n \"rank\": 92,\n \"score\": 204233.3148506636\n },\n {\n \"content\": \"#[test]\\n\\nfn catch_binding() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n try {\\n\\n throw 20;\\n\\n } catch(err) {\\n\\n a = err;\\n\\n }\\n\\n\\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"20\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/try_node/tests.rs\",\n \"rank\": 93,\n \"score\": 204233.31485066362\n },\n {\n \"content\": \"#[test]\\n\\nfn catch_finally() {\\n\\n let scenario = r#\\\"\\n\\n let a = 10;\\n\\n try {\\n\\n a = 20;\\n\\n } catch {\\n\\n a = 40;\\n\\n } finally {\\n\\n a = 30;\\n\\n }\\n\\n\\n\\n a;\\n\\n \\\"#;\\n\\n assert_eq!(&exec(scenario), \\\"30\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/try_node/tests.rs\",\n \"rank\": 94,\n \"score\": 204233.3148506636\n },\n {\n \"content\": \"#[test]\\n\\nfn add_number_object_and_number() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let value = forward_val(&mut engine, \\\"new Number(10) + 6\\\").unwrap();\\n\\n let value = value.to_i32(&mut engine).unwrap();\\n\\n assert_eq!(value, 16);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 95,\n \"score\": 204193.1490300321\n },\n {\n \"content\": \"#[test]\\n\\nfn display_negative_zero_object() {\\n\\n let mut engine = Context::new();\\n\\n let d_obj = r#\\\"\\n\\n let num = new Number(-0);\\n\\n num\\n\\n \\\"#;\\n\\n let value = forward_val(&mut engine, d_obj).unwrap();\\n\\n assert_eq!(value.display().to_string(), \\\"Number { -0 }\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 96,\n \"score\": 204193.1490300321\n },\n {\n \"content\": \"#[test]\\n\\nfn sub_string_and_number_object() {\\n\\n let mut engine = Context::new();\\n\\n\\n\\n let value = forward_val(&mut engine, \\\"'Hello' - new Number(999)\\\").unwrap();\\n\\n let value = value.to_number(&mut engine).unwrap();\\n\\n assert!(value.is_nan());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/value/tests.rs\",\n \"rank\": 97,\n \"score\": 204193.1490300321\n },\n {\n \"content\": \"#[test]\\n\\nfn check_this_binding_in_object_literal() {\\n\\n let mut engine = Context::new();\\n\\n let init = r#\\\"\\n\\n var foo = {\\n\\n a: 3,\\n\\n bar: function () { return this.a + 5 }\\n\\n };\\n\\n\\n\\n foo.bar()\\n\\n \\\"#;\\n\\n\\n\\n assert_eq!(forward(&mut engine, init), \\\"8\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 98,\n \"score\": 204168.4519983303\n },\n {\n \"content\": \"#[test]\\n\\nfn number_object_access_benchmark() {\\n\\n let mut engine = Context::new();\\n\\n let init = r#\\\"\\n\\n new Number(\\n\\n new Number(\\n\\n new Number(\\n\\n new Number(100).valueOf() - 10.5\\n\\n ).valueOf() + 100\\n\\n ).valueOf() * 1.6\\n\\n )\\n\\n \\\"#;\\n\\n\\n\\n assert!(forward_val(&mut engine, init).is_ok());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"boa/src/exec/tests.rs\",\n \"rank\": 99,\n \"score\": 204168.4519983303\n }\n]","isConversational":false}}},{"rowIdx":2998,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"term/src/test/csi.rs"},"repo_name":{"kind":"string","value":"bcully/wezterm"},"commit":{"kind":"string","value":"ea401e1f58ca5a088ac5d5e1d7963f36269afb76"},"file_code":{"kind":"string","value":"use super::*;\n\n#[test]\nfn test_vpa() {\n let mut term = TestTerm::new(3, 4, 0);\n term.assert_cursor_pos(0, 0, None);\n term.print(\"a\\r\\nb\\r\\nc\");\n term.assert_cursor_pos(1, 2, None);\n term.print(\"\\x1b[d\");\n term.assert_cursor_pos(1, 0, None);\n term.print(\"\\r\\n\\r\\n\");\n term.assert_cursor_pos(0, 2, None);\n\n \n \n term.print(\"\\x1b[2d\");\n term.assert_cursor_pos(0, 1, None);\n term.print(\"\\x1b[-2d\");\n term.assert_cursor_pos(0, 1, None);\n}\n\n#[test]\nfn test_rep() {\n let mut term = TestTerm::new(3, 4, 0);\n term.print(\"h\");\n term.cup(1, 0);\n term.print(\"\\x1b[2ba\");\n assert_visible_contents(&term, file!(), line!(), &[\"hhha\", \" \", \" \"]);\n}\n\n#[test]\nfn test_irm() {\n let mut term = TestTerm::new(3, 8, 0);\n term.print(\"foo\");\n term.cup(0, 0);\n term.print(\"\\x1b[4hBAR\");\n assert_visible_contents(\n &term,\n file!(),\n line!(),\n &[\"BARfoo \", \" \", \" \"],\n );\n}\n\n#[test]\nfn test_ich() {\n let mut term = TestTerm::new(3, 4, 0);\n term.print(\"hey!wat?\");\n term.cup(1, 0);\n term.print(\"\\x1b[2@\");\n assert_visible_contents(&term, file!(), line!(), &[\"h e\", \"wat?\", \" \"]);\n \n term.print(\"\\x1b[12@\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n term.print(\"\\x1b[-12@\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n}\n\n#[test]\nfn test_ech() {\n let mut term = TestTerm::new(3, 4, 0);\n term.print(\"hey!wat?\");\n term.cup(1, 0);\n term.print(\"\\x1b[2X\");\n assert_visible_contents(&term, file!(), line!(), &[\"h !\", \"wat?\", \" \"]);\n \n term.print(\"\\x1b[12X\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n term.print(\"\\x1b[-12X\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n}\n\n#[test]\nfn test_dch() {\n let mut term = TestTerm::new(1, 12, 0);\n term.print(\"hello world\");\n term.cup(1, 0);\n term.print(\"\\x1b[P\");\n assert_visible_contents(&term, file!(), line!(), &[\"hllo world \"]);\n\n term.cup(4, 0);\n term.print(\"\\x1b[2P\");\n assert_visible_contents(&term, file!(), line!(), &[\"hlloorld \"]);\n\n term.print(\"\\x1b[-2P\");\n assert_visible_contents(&term, file!(), line!(), &[\"hlloorld \"]);\n}\n\n#[test]\nfn test_cup() {\n let mut term = TestTerm::new(3, 4, 0);\n term.cup(1, 1);\n term.assert_cursor_pos(1, 1, None);\n term.cup(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.cup(2, 2);\n term.assert_cursor_pos(2, 2, None);\n term.cup(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.cup(500, 500);\n term.assert_cursor_pos(3, 2, None);\n}\n\n#[test]\nfn test_hvp() {\n let mut term = TestTerm::new(3, 4, 0);\n term.hvp(1, 1);\n term.assert_cursor_pos(1, 1, None);\n term.hvp(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.hvp(2, 2);\n term.assert_cursor_pos(2, 2, None);\n term.hvp(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.hvp(500, 500);\n term.assert_cursor_pos(3, 2, None);\n}\n\n#[test]\nfn test_dl() {\n let mut term = TestTerm::new(3, 1, 0);\n term.print(\"a\\r\\nb\\r\\nc\");\n term.cup(0, 1);\n term.delete_lines(1);\n assert_visible_contents(&term, file!(), line!(), &[\"a\", \"c\", \" \"]);\n term.assert_cursor_pos(0, 1, None);\n term.cup(0, 0);\n term.delete_lines(2);\n assert_visible_contents(&term, file!(), line!(), &[\" \", \" \", \" \"]);\n term.print(\"1\\r\\n2\\r\\n3\");\n term.cup(0, 1);\n term.delete_lines(-2);\n assert_visible_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\"]);\n}\n\n#[test]\nfn test_cha() {\n let mut term = TestTerm::new(3, 4, 0);\n term.cup(1, 1);\n term.assert_cursor_pos(1, 1, None);\n\n term.print(\"\\x1b[G\");\n term.assert_cursor_pos(0, 1, None);\n\n term.print(\"\\x1b[2G\");\n term.assert_cursor_pos(1, 1, None);\n\n term.print(\"\\x1b[0G\");\n term.assert_cursor_pos(0, 1, None);\n\n term.print(\"\\x1b[-1G\");\n term.assert_cursor_pos(0, 1, None);\n\n term.print(\"\\x1b[100G\");\n term.assert_cursor_pos(3, 1, None);\n}\n\n#[test]\nfn test_ed() {\n let mut term = TestTerm::new(3, 3, 0);\n term.print(\"abc\\r\\ndef\\r\\nghi\");\n term.cup(1, 2);\n term.print(\"\\x1b[J\");\n assert_visible_contents(&term, file!(), line!(), &[\"abc\", \"def\", \"g \"]);\n\n \n term.print(\"\\x1b[44m\");\n \n term.print(\"\\x1b[2J\");\n\n \n \n let attr = CellAttributes::default()\n .set_background(color::AnsiColor::Navy)\n .clone();\n let mut line: Line = \" \".into();\n line.fill_range(0..=2, &Cell::new(' ', attr.clone()));\n assert_lines_equal(\n file!(),\n line!(),\n &term.screen().visible_lines(),\n &[line.clone(), line.clone(), line],\n Compare::TEXT | Compare::ATTRS,\n );\n}\n"},"prefix":{"kind":"string","value":"use super::*;\n\n#[test]\nfn test_vpa() {\n let mut term = TestTerm::new(3, 4, 0);\n term.assert_cursor_pos(0, 0, None);\n term.print(\"a\\r\\nb\\r\\nc\");\n term.assert_cursor_pos(1, 2, None);\n term.print(\"\\x1b[d\");\n term.assert_cursor_pos(1, 0, None);\n term.print(\"\\r\\n\\r\\n\");\n term.assert_cursor_pos(0, 2, None);\n\n \n \n term.print(\"\\x1b[2d\");\n term.assert_cursor_pos(0, 1, None);\n term.print(\"\\x1b[-2d\");\n term.assert_cursor_pos(0, 1, None);\n}\n\n#[test]\nfn test_rep() {\n let mut term = TestTerm::new(3, 4, 0);\n term.print(\"h\");\n term.cup(1, 0);\n term.print(\"\\x1b[2ba\");\n assert_visible_contents(&term, file!(), line!(), &[\"hhha\", \" \", \" \"]);\n}\n\n#[test]\nfn test_irm() {\n let mut term = TestTerm::new(3, 8, 0);\n term.print(\"foo\");\n term.cup(0, 0);\n term.print(\"\\x1b[4hBAR\");\n assert_visible_contents(\n &term,\n file!(),\n line!(),\n &[\"BARfoo \", \" \", \" \"],\n );\n}\n\n#[test]\nfn test_ich() {\n let mut term = TestTerm::new(3, 4, 0);\n term.print(\"hey!wat?\");\n term.cup(1, 0);\n term.print(\"\\x1b[2@\");\n "},"suffix":{"kind":"string","value":"\n\n#[test]\nfn test_ech() {\n let mut term = TestTerm::new(3, 4, 0);\n term.print(\"hey!wat?\");\n term.cup(1, 0);\n term.print(\"\\x1b[2X\");\n assert_visible_contents(&term, file!(), line!(), &[\"h !\", \"wat?\", \" \"]);\n \n term.print(\"\\x1b[12X\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n term.print(\"\\x1b[-12X\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n}\n\n#[test]\nfn test_dch() {\n let mut term = TestTerm::new(1, 12, 0);\n term.print(\"hello world\");\n term.cup(1, 0);\n term.print(\"\\x1b[P\");\n assert_visible_contents(&term, file!(), line!(), &[\"hllo world \"]);\n\n term.cup(4, 0);\n term.print(\"\\x1b[2P\");\n assert_visible_contents(&term, file!(), line!(), &[\"hlloorld \"]);\n\n term.print(\"\\x1b[-2P\");\n assert_visible_contents(&term, file!(), line!(), &[\"hlloorld \"]);\n}\n\n#[test]\nfn test_cup() {\n let mut term = TestTerm::new(3, 4, 0);\n term.cup(1, 1);\n term.assert_cursor_pos(1, 1, None);\n term.cup(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.cup(2, 2);\n term.assert_cursor_pos(2, 2, None);\n term.cup(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.cup(500, 500);\n term.assert_cursor_pos(3, 2, None);\n}\n\n#[test]\nfn test_hvp() {\n let mut term = TestTerm::new(3, 4, 0);\n term.hvp(1, 1);\n term.assert_cursor_pos(1, 1, None);\n term.hvp(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.hvp(2, 2);\n term.assert_cursor_pos(2, 2, None);\n term.hvp(-1, -1);\n term.assert_cursor_pos(0, 0, None);\n term.hvp(500, 500);\n term.assert_cursor_pos(3, 2, None);\n}\n\n#[test]\nfn test_dl() {\n let mut term = TestTerm::new(3, 1, 0);\n term.print(\"a\\r\\nb\\r\\nc\");\n term.cup(0, 1);\n term.delete_lines(1);\n assert_visible_contents(&term, file!(), line!(), &[\"a\", \"c\", \" \"]);\n term.assert_cursor_pos(0, 1, None);\n term.cup(0, 0);\n term.delete_lines(2);\n assert_visible_contents(&term, file!(), line!(), &[\" \", \" \", \" \"]);\n term.print(\"1\\r\\n2\\r\\n3\");\n term.cup(0, 1);\n term.delete_lines(-2);\n assert_visible_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\"]);\n}\n\n#[test]\nfn test_cha() {\n let mut term = TestTerm::new(3, 4, 0);\n term.cup(1, 1);\n term.assert_cursor_pos(1, 1, None);\n\n term.print(\"\\x1b[G\");\n term.assert_cursor_pos(0, 1, None);\n\n term.print(\"\\x1b[2G\");\n term.assert_cursor_pos(1, 1, None);\n\n term.print(\"\\x1b[0G\");\n term.assert_cursor_pos(0, 1, None);\n\n term.print(\"\\x1b[-1G\");\n term.assert_cursor_pos(0, 1, None);\n\n term.print(\"\\x1b[100G\");\n term.assert_cursor_pos(3, 1, None);\n}\n\n#[test]\nfn test_ed() {\n let mut term = TestTerm::new(3, 3, 0);\n term.print(\"abc\\r\\ndef\\r\\nghi\");\n term.cup(1, 2);\n term.print(\"\\x1b[J\");\n assert_visible_contents(&term, file!(), line!(), &[\"abc\", \"def\", \"g \"]);\n\n \n term.print(\"\\x1b[44m\");\n \n term.print(\"\\x1b[2J\");\n\n \n \n let attr = CellAttributes::default()\n .set_background(color::AnsiColor::Navy)\n .clone();\n let mut line: Line = \" \".into();\n line.fill_range(0..=2, &Cell::new(' ', attr.clone()));\n assert_lines_equal(\n file!(),\n line!(),\n &term.screen().visible_lines(),\n &[line.clone(), line.clone(), line],\n Compare::TEXT | Compare::ATTRS,\n );\n}\n"},"middle":{"kind":"string","value":"assert_visible_contents(&term, file!(), line!(), &[\"h e\", \"wat?\", \" \"]);\n \n term.print(\"\\x1b[12@\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n term.print(\"\\x1b[-12@\");\n assert_visible_contents(&term, file!(), line!(), &[\"h \", \"wat?\", \" \"]);\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"fn assert_all_contents(term: &Terminal, file: &str, line: u32, expect_lines: &[&str]) {\n\n print_all_lines(&term);\n\n let screen = term.screen();\n\n\n\n let expect: Vec<Line> = expect_lines.iter().map(|s| (*s).into()).collect();\n\n\n\n assert_lines_equal(file, line, &screen.all_lines(), &expect, Compare::TEXT);\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":0,"score":267423.51240122144},{"content":"/// Asserts that the visible lines of the terminal have the\n\n/// same character contents as the expected lines.\n\n/// The other cell attributes are not compared; this is\n\n/// a convenience for writing visually understandable tests.\n\nfn assert_visible_contents(term: &Terminal, file: &str, line: u32, expect_lines: &[&str]) {\n\n print_visible_lines(&term);\n\n let screen = term.screen();\n\n\n\n let expect: Vec<Line> = expect_lines.iter().map(|s| (*s).into()).collect();\n\n\n\n assert_lines_equal(file, line, &screen.visible_lines(), &expect, Compare::TEXT);\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":1,"score":262952.33119507186},{"content":"fn print_all_lines(term: &Terminal) {\n\n let screen = term.screen();\n\n\n\n println!(\"whole screen contents are:\");\n\n for line in screen.lines.iter() {\n\n println!(\"[{}]\", line.as_str());\n\n }\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":2,"score":233244.43729643774},{"content":"fn print_visible_lines(term: &Terminal) {\n\n let screen = term.screen();\n\n\n\n println!(\"screen contents are:\");\n\n for line in screen.visible_lines().iter() {\n\n println!(\"[{}]\", line.as_str());\n\n }\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":3,"score":227902.96493406055},{"content":"#[test]\n\nfn test_delete_lines() {\n\n let mut term = TestTerm::new(5, 3, 0);\n\n\n\n term.print(\"111\\r\\n222\\r\\n333\\r\\n444\\r\\n555\");\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\"111\", \"222\", \"333\", \"444\", \"555\"],\n\n );\n\n term.assert_dirty_lines(&[0, 1, 2, 3, 4], None);\n\n term.cup(0, 1);\n\n term.clean_dirty_lines();\n\n\n\n term.assert_dirty_lines(&[], None);\n\n term.delete_lines(2);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n","file_path":"term/src/test/mod.rs","rank":8,"score":213876.82979000002},{"content":"/// Asserts that both line slices match according to the\n\n/// selected flags.\n\nfn assert_lines_equal(\n\n file: &str,\n\n line_no: u32,\n\n lines: &[Line],\n\n expect_lines: &[Line],\n\n compare: Compare,\n\n) {\n\n let mut expect_iter = expect_lines.iter();\n\n\n\n for (idx, line) in lines.iter().enumerate() {\n\n let expect = expect_iter.next().unwrap();\n\n\n\n if compare.contains(Compare::DIRTY) {\n\n assert_eq!(\n\n line.is_dirty(),\n\n expect.is_dirty(),\n\n \"line {} dirty didn't match\",\n\n idx,\n\n );\n\n }\n","file_path":"term/src/test/mod.rs","rank":9,"score":200558.57679373468},{"content":"fn read_pipe_with_timeout(mut file: FileDescriptor) -> anyhow::Result<String> {\n\n let mut result = Vec::new();\n\n\n\n file.set_non_blocking(true)?;\n\n let mut pfd = libc::pollfd {\n\n fd: file.as_raw_fd(),\n\n events: libc::POLLIN,\n\n revents: 0,\n\n };\n\n\n\n let mut buf = [0u8; 8192];\n\n\n\n loop {\n\n if unsafe { libc::poll(&mut pfd, 1, 3000) == 1 } {\n\n match file.read(&mut buf) {\n\n Ok(size) if size == 0 => {\n\n break;\n\n }\n\n Ok(size) => {\n\n result.extend_from_slice(&buf[..size]);\n","file_path":"window/src/os/wayland/window.rs","rank":10,"score":177149.85756957345},{"content":"#[test]\n\nfn test_ind() {\n\n let mut term = TestTerm::new(4, 4, 0);\n\n term.print(\"a\\r\\nb\\x1bD\");\n\n term.assert_cursor_pos(1, 2, None);\n\n assert_visible_contents(&term, file!(), line!(), &[\"a \", \"b \", \" \", \" \"]);\n\n term.print(\"\\x1bD\");\n\n term.assert_cursor_pos(1, 3, None);\n\n term.print(\"\\x1bD\");\n\n term.assert_cursor_pos(1, 3, None);\n\n assert_visible_contents(&term, file!(), line!(), &[\"b \", \" \", \" \", \" \"]);\n\n}\n\n\n","file_path":"term/src/test/c1.rs","rank":12,"score":176791.41971122747},{"content":"#[test]\n\nfn test_tab() {\n\n let mut term = TestTerm::new(3, 25, 0);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(8, 0, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(16, 0, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(24, 0, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(24, 0, None);\n\n}\n","file_path":"term/src/test/c0.rs","rank":14,"score":176791.4197112275},{"content":"#[test]\n\nfn test_hts() {\n\n let mut term = TestTerm::new(3, 25, 0);\n\n term.print(\"boo\");\n\n term.print(\"\\x1bH\\r\\n\");\n\n term.assert_cursor_pos(0, 1, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(3, 1, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(8, 1, None);\n\n\n\n // Check that tabs are expanded if we resize\n\n term.resize(4, 80, 4 * 16, 80 * 8);\n\n term.cup(0, 1);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(3, 1, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(8, 1, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(16, 1, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(24, 1, None);\n\n term.print(\"\\t\");\n\n term.assert_cursor_pos(32, 1, None);\n\n}\n\n\n","file_path":"term/src/test/c1.rs","rank":16,"score":176791.41971122747},{"content":"#[test]\n\nfn test_bs() {\n\n let mut term = TestTerm::new(3, 4, 0);\n\n term.assert_cursor_pos(0, 0, None);\n\n term.print(\"\\x08\");\n\n term.assert_cursor_pos(0, 0, Some(\"cannot move left of the margin\"));\n\n term.print(\"ab\\x08\");\n\n term.assert_cursor_pos(1, 0, None);\n\n // TODO: when we can set the left margin, we should test that here\n\n}\n\n\n","file_path":"term/src/test/c0.rs","rank":17,"score":176791.41971122747},{"content":"#[test]\n\nfn test_lf() {\n\n let mut term = TestTerm::new(3, 10, 0);\n\n term.print(\"hello\\n\");\n\n term.assert_cursor_pos(5, 1, Some(\"LF moves vertically only\"));\n\n}\n\n\n","file_path":"term/src/test/c0.rs","rank":18,"score":176791.4197112275},{"content":"#[test]\n\nfn test_nel() {\n\n let mut term = TestTerm::new(4, 4, 0);\n\n term.print(\"a\\r\\nb\\x1bE\");\n\n term.assert_cursor_pos(0, 2, None);\n\n term.print(\"\\x1bE\");\n\n term.assert_cursor_pos(0, 3, None);\n\n term.print(\"\\x1bE\");\n\n term.assert_cursor_pos(0, 3, None);\n\n assert_visible_contents(&term, file!(), line!(), &[\"b \", \" \", \" \", \" \"]);\n\n}\n\n\n","file_path":"term/src/test/c1.rs","rank":19,"score":176791.4197112275},{"content":"#[test]\n\nfn test_ri() {\n\n let mut term = TestTerm::new(4, 2, 0);\n\n term.print(\"a\\r\\nb\\r\\nc\\r\\nd.\");\n\n assert_visible_contents(&term, file!(), line!(), &[\"a \", \"b \", \"c \", \"d.\"]);\n\n term.assert_cursor_pos(1, 3, None);\n\n term.print(\"\\x1bM\");\n\n term.assert_cursor_pos(1, 2, None);\n\n term.print(\"\\x1bM\");\n\n term.assert_cursor_pos(1, 1, None);\n\n term.print(\"\\x1bM\");\n\n term.assert_cursor_pos(1, 0, None);\n\n term.print(\"\\x1bM\");\n\n term.assert_cursor_pos(1, 0, None);\n\n assert_visible_contents(&term, file!(), line!(), &[\" \", \"a \", \"b \", \"c \"]);\n\n}\n","file_path":"term/src/test/c1.rs","rank":20,"score":176791.4197112275},{"content":"#[test]\n\nfn test_hyperlinks() {\n\n let mut term = TestTerm::new(3, 5, 0);\n\n let link = Arc::new(Hyperlink::new(\"http://example.com\"));\n\n term.hyperlink(&link);\n\n term.print(\"hello\");\n\n term.hyperlink_off();\n\n\n\n let mut linked = CellAttributes::default();\n\n linked.hyperlink = Some(Arc::clone(&link));\n\n\n\n assert_lines_equal(\n\n file!(),\n\n line!(),\n\n &term.screen().visible_lines(),\n\n &[\n\n Line::from_text_with_wrapped_last_col(\"hello\", &linked),\n\n Line::from_text(\" \", &CellAttributes::default()),\n\n Line::from_text(\" \", &CellAttributes::default()),\n\n ],\n\n Compare::TEXT | Compare::ATTRS,\n","file_path":"term/src/test/mod.rs","rank":22,"score":176791.41971122747},{"content":"#[test]\n\nfn test_cr() {\n\n let mut term = TestTerm::new(3, 10, 0);\n\n term.print(\"hello\\r\");\n\n term.assert_cursor_pos(0, 0, Some(\"CR moves to left margin on current line\"));\n\n // TODO: when we can set the left margin, we should test that here\n\n}\n\n\n","file_path":"term/src/test/c0.rs","rank":23,"score":176791.41971122747},{"content":"#[test]\n\nfn test_scrollup() {\n\n let mut term = TestTerm::new(2, 1, 4);\n\n term.print(\"1\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \" \"]);\n\n assert_eq!(term.screen().visible_row_to_stable_row(0), 0);\n\n\n\n term.print(\"2\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \" \"]);\n\n assert_eq!(term.screen().visible_row_to_stable_row(0), 1);\n\n\n\n term.print(\"3\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\", \" \"]);\n\n assert_eq!(term.screen().visible_row_to_stable_row(0), 2);\n\n\n\n term.print(\"4\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\", \"4\", \" \"]);\n\n assert_eq!(term.screen().visible_row_to_stable_row(0), 3);\n\n\n\n term.print(\"5\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\", \"4\", \"5\", \" \"]);\n","file_path":"term/src/test/mod.rs","rank":26,"score":176791.4197112275},{"content":"#[test]\n\nfn test_emoji_with_modifier() {\n\n let waving_hand = \"\\u{1f44b}\";\n\n let waving_hand_dark_tone = \"\\u{1f44b}\\u{1f3ff}\";\n\n\n\n let mut term = TestTerm::new(3, 5, 0);\n\n term.print(waving_hand);\n\n term.print(\"\\r\\n\");\n\n term.print(waving_hand_dark_tone);\n\n\n\n assert_all_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n &format!(\"{} \", waving_hand),\n\n &format!(\"{} \", waving_hand_dark_tone),\n\n \" \",\n\n ],\n\n );\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":28,"score":172276.3707026871},{"content":"#[test]\n\nfn test_scroll_margins() {\n\n let mut term = TestTerm::new(3, 1, 10);\n\n term.print(\"1\\n2\\n3\\n4\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\", \"4\", \" \"]);\n\n\n\n let margins = CSI::Cursor(termwiz::escape::csi::Cursor::SetTopAndBottomMargins {\n\n top: OneBased::new(1),\n\n bottom: OneBased::new(2),\n\n });\n\n term.print(format!(\"{}\", margins));\n\n\n\n term.print(\"z\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\", \"4\", \"z\"]);\n\n\n\n term.print(\"a\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\", \"4\", \"a\"]);\n\n\n\n term.cup(0, 1);\n\n term.print(\"W\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"1\", \"2\", \"3\", \"W\", \" \", \"a\"]);\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":29,"score":172276.37070268707},{"content":"#[test]\n\nfn test_resize_wrap() {\n\n const LINES: usize = 8;\n\n let mut term = TestTerm::new(LINES, 4, 0);\n\n term.print(\"111\\r\\n2222aa\\r\\n333\\r\\n\");\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222\", \"aa \", \"333 \", \" \", \" \", \" \", \" \",\n\n ],\n\n );\n\n term.resize(LINES, 5, 0, 0);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222a\", \"a\", \"333 \", \" \", \" \", \" \", \" \",\n\n ],\n","file_path":"term/src/test/mod.rs","rank":30,"score":172276.37070268707},{"content":"fn write_pipe_with_timeout(mut file: FileDescriptor, data: &[u8]) -> anyhow::Result<()> {\n\n file.set_non_blocking(true)?;\n\n let mut pfd = libc::pollfd {\n\n fd: file.as_raw_fd(),\n\n events: libc::POLLOUT,\n\n revents: 0,\n\n };\n\n\n\n let mut buf = data;\n\n\n\n while !buf.is_empty() {\n\n if unsafe { libc::poll(&mut pfd, 1, 3000) == 1 } {\n\n match file.write(buf) {\n\n Ok(size) if size == 0 => {\n\n bail!(\"zero byte write\");\n\n }\n\n Ok(size) => {\n\n buf = &buf[size..];\n\n }\n\n Err(e) => bail!(\"error writing to pipe: {}\", e),\n\n }\n\n } else {\n\n bail!(\"timed out writing to pipe\");\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"window/src/os/wayland/window.rs","rank":31,"score":170271.42258807234},{"content":"#[test]\n\nfn basic_output() {\n\n let mut term = TestTerm::new(5, 10, 0);\n\n\n\n term.cup(1, 1);\n\n\n\n term.set_auto_wrap(false);\n\n term.print(\"hello, world!\");\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \" \",\n\n \" hello, w!\",\n\n \" \",\n\n \" \",\n\n \" \",\n\n ],\n\n );\n\n\n","file_path":"term/src/test/mod.rs","rank":32,"score":163694.8357533798},{"content":"#[test]\n\nfn drag_selection() {\n\n let mut term = TestTerm::new(3, 12, 0);\n\n term.print(\"hello world\\r\\n\");\n\n assert_visible_contents(&term, &[\"hello world \", \" \", \" \"]);\n\n\n\n term.drag_select(1, 0, 4, 0);\n\n assert_eq!(term.get_clipboard().unwrap(), \"ello\");\n\n\n\n // Now check that we respect double-width boundaries reasonably sanely;\n\n // here we're dragging from the middle of the skull emoji\n\n term.print(\"\\u{1F480}skull\\r\\n\");\n\n assert_visible_contents(\n\n &term,\n\n &[\"hello world \", \"\\u{1F480}skull \", \" \"],\n\n );\n\n term.drag_select(1, 1, 5, 1);\n\n assert_eq!(term.get_clipboard().unwrap(), \"skul\");\n\n\n\n // Let's include the start of it this time\n\n term.drag_select(0, 1, 5, 1);\n","file_path":"term/src/test/selection.rs","rank":33,"score":163694.8357533798},{"content":"#[test]\n\nfn selection_in_scrollback() {\n\n let mut term = TestTerm::new(2, 2, 4);\n\n term.print(\"1 2 3 4\");\n\n assert_all_contents(&term, &[\"1 \", \"2 \", \"3 \", \"4 \"]);\n\n\n\n // Scroll back one line\n\n term.scroll_viewport(-1);\n\n term.assert_viewport_contents(&[\"2 \", \"3 \"]);\n\n\n\n term.click_n(0, 0, MouseButton::Left, 2);\n\n assert_eq!(term.get_clipboard().unwrap(), \"2\");\n\n\n\n // Clear the click streak\n\n term.click_n(0, 1, MouseButton::Right, 1);\n\n\n\n term.click_n(0, 1, MouseButton::Left, 3);\n\n assert_eq!(term.get_clipboard().unwrap(), \"3\");\n\n\n\n term.drag_select(0, 0, 0, 1);\n\n assert_eq!(term.get_clipboard().unwrap(), \"2\\n3\");\n\n}\n","file_path":"term/src/test/selection.rs","rank":34,"score":163694.8357533798},{"content":"#[test]\n\nfn double_click_selection() {\n\n let mut term = TestTerm::new(3, 10, 0);\n\n term.print(\"hello world\");\n\n\n\n term.click_n(1, 0, MouseButton::Left, 2);\n\n\n\n assert_eq!(term.get_clipboard().unwrap(), \"hello\");\n\n}\n\n\n\n/// Test triple click to select a line\n","file_path":"term/src/test/selection.rs","rank":35,"score":158958.6341923695},{"content":"#[test]\n\nfn cursor_movement_damage() {\n\n let mut term = TestTerm::new(2, 3, 0);\n\n\n\n term.print(\"fooo.\");\n\n assert_visible_contents(&term, file!(), line!(), &[\"foo\", \"o. \"]);\n\n term.assert_cursor_pos(2, 1, None);\n\n term.assert_dirty_lines(&[0, 1], None);\n\n\n\n term.cup(0, 1);\n\n term.clean_dirty_lines();\n\n term.print(\"\\x08\");\n\n term.assert_cursor_pos(0, 1, Some(\"BS doesn't change the line\"));\n\n term.assert_dirty_lines(&[1], None);\n\n term.clean_dirty_lines();\n\n\n\n term.cup(0, 0);\n\n term.assert_dirty_lines(&[0, 1], Some(\"cursor movement dirties old and new lines\"));\n\n}\n\n\n\n/// Replicates a bug I initially found via:\n\n/// $ vim\n\n/// :help\n\n/// PageDown\n","file_path":"term/src/test/mod.rs","rank":36,"score":158958.6341923695},{"content":"#[test]\n\nfn triple_click_selection() {\n\n let mut term = TestTerm::new(3, 10, 0);\n\n term.print(\"hello world\");\n\n assert_visible_contents(&term, &[\"hello worl\", \"d \", \" \"]);\n\n term.click_n(1, 0, MouseButton::Left, 3);\n\n\n\n assert_eq!(term.get_clipboard().unwrap(), \"hello worl\");\n\n}\n\n\n\n/// Test double click on wrapped line selects across the line boundary\n","file_path":"term/src/test/selection.rs","rank":37,"score":158958.6341923695},{"content":"#[test]\n\nfn double_click_wrapped_selection() {\n\n let mut term = TestTerm::new(3, 10, 0);\n\n term.print(\"hello world\");\n\n assert_visible_contents(&term, &[\"hello worl\", \"d \", \" \"]);\n\n term.click_n(7, 0, MouseButton::Left, 2);\n\n\n\n assert_eq!(term.get_clipboard().unwrap(), \"world\");\n\n}\n\n\n\n/// Make sure that we adjust for the viewport offset when scrolling\n","file_path":"term/src/test/selection.rs","rank":38,"score":154558.4110320304},{"content":"fn csi_u_encode(buf: &mut String, c: char, mods: KeyModifiers) -> Result<(), Error> {\n\n if ENABLE_CSI_U {\n\n write!(buf, \"\\x1b[{};{}u\", c as u32, 1 + encode_modifiers(mods))?;\n\n } else {\n\n // FIXME: this ignores the modifiers completely. That's sort of\n\n // OK, but eg: CTRL-SPACE should really send a NUL byte in that\n\n // case, so this isn't great\n\n write!(buf, \"{}\", c)?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"term/src/terminalstate.rs","rank":39,"score":135389.85977449562},{"content":"pub fn poll_for_read(pfd: &mut [pollfd]) {\n\n if let Err(e) = poll(pfd, None) {\n\n log::error!(\"poll failed for {}\", e);\n\n }\n\n}\n","file_path":"src/server/pollable.rs","rank":40,"score":127926.13658303104},{"content":"fn open_log(path: PathBuf) -> anyhow::Result<File> {\n\n create_user_owned_dirs(\n\n path.parent()\n\n .ok_or_else(|| anyhow!(\"path {} has no parent dir!?\", path.display()))?,\n\n )?;\n\n let mut options = OpenOptions::new();\n\n options.write(true).create(true).append(true);\n\n options\n\n .open(&path)\n\n .map_err(|e| anyhow!(\"failed to open log stream: {}: {}\", path.display(), e))\n\n}\n\n\n\nimpl DaemonOptions {\n\n #[cfg_attr(windows, allow(dead_code))]\n\n pub fn pid_file(&self) -> PathBuf {\n\n self.pid_file\n\n .as_ref()\n\n .cloned()\n\n .unwrap_or_else(|| RUNTIME_DIR.join(\"pid\"))\n\n }\n","file_path":"src/config/daemon.rs","rank":41,"score":119403.76991182395},{"content":"fn consume_stream<F: Read, T: Write>(mut from_stream: F, mut to_stream: T) -> anyhow::Result<()> {\n\n let mut buf = [0u8; 8192];\n\n\n\n loop {\n\n let size = from_stream.read(&mut buf)?;\n\n if size == 0 {\n\n break;\n\n }\n\n to_stream.write_all(&buf[0..size])?;\n\n to_stream.flush()?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/main.rs","rank":42,"score":117251.60003303044},{"content":"fn default_term() -> String {\n\n \"xterm-256color\".into()\n\n}\n\n\n","file_path":"src/config/mod.rs","rank":43,"score":117053.10838549751},{"content":"#[allow(dead_code)]\n\npub fn use_default_configuration() {\n\n CONFIG.use_defaults();\n\n}\n\n\n","file_path":"src/config/mod.rs","rank":44,"score":114267.79590253005},{"content":"fn default_scrollback_lines() -> usize {\n\n 3500\n\n}\n\n\n","file_path":"src/config/mod.rs","rank":45,"score":114204.49200503716},{"content":"struct TestTerm {\n\n term: Terminal,\n\n host: TestHost,\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":46,"score":112134.43516741035},{"content":"fn main() -> anyhow::Result<()> {\n\n println!(\"Type `exit` to quit this example, or start a word with `h` and press Tab.\");\n\n let mut terminal = line_editor_terminal()?;\n\n let mut editor = LineEditor::new(&mut terminal);\n\n\n\n let mut host = Host::default();\n\n loop {\n\n if let Some(line) = editor.read_line(&mut host)? {\n\n println!(\"read line: {:?}\", line);\n\n if line == \"exit\" {\n\n break;\n\n }\n\n\n\n host.history().add(&line);\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n","file_path":"termwiz/examples/line_editor.rs","rank":47,"score":111350.13576929475},{"content":"#[derive(Debug)]\n\nstruct TestTermConfig {\n\n scrollback: usize,\n\n}\n\nimpl TerminalConfiguration for TestTermConfig {\n\n fn scrollback_size(&self) -> usize {\n\n self.scrollback\n\n }\n\n\n\n fn color_palette(&self) -> ColorPalette {\n\n ColorPalette::default()\n\n }\n\n}\n\n\n\nimpl TestTerm {\n\n fn new(height: usize, width: usize, scrollback: usize) -> Self {\n\n let mut term = Terminal::new(\n\n height,\n\n width,\n\n height * 16,\n\n width * 8,\n","file_path":"term/src/test/mod.rs","rank":48,"score":109411.96429988781},{"content":"/// This is a conceptually simple function that computes the bounds\n\n/// of the whitespace delimited word at the specified cursor position\n\n/// in the supplied line string.\n\n/// It returns the range and the corresponding slice out of the line.\n\n/// This function is sufficient for example purposes; in a real application\n\n/// the equivalent function would need to be aware of quoting and other\n\n/// application specific context.\n\nfn word_at_cursor(line: &str, cursor_position: usize) -> Option<(std::ops::Range<usize>, &str)> {\n\n let char_indices: Vec<(usize, char)> = line.char_indices().collect();\n\n if char_indices.is_empty() {\n\n return None;\n\n }\n\n let char_position = char_indices\n\n .iter()\n\n .position(|(idx, _)| *idx == cursor_position)\n\n .unwrap_or(char_indices.len());\n\n\n\n // Look back until we find whitespace\n\n let mut start_position = char_position;\n\n while start_position > 0\n\n && start_position <= char_indices.len()\n\n && !char_indices[start_position - 1].1.is_whitespace()\n\n {\n\n start_position -= 1;\n\n }\n\n\n\n // Look forwards until we find whitespace\n","file_path":"termwiz/examples/line_editor.rs","rank":49,"score":109104.05821308118},{"content":"/// Create a pair of connected sockets\n\n///\n\n/// This implementation creates a pair of SOCK_STREAM sockets.\n\npub fn socketpair() -> anyhow::Result<(FileDescriptor, FileDescriptor)> {\n\n socketpair_impl()\n\n}\n","file_path":"filedescriptor/src/lib.rs","rank":50,"score":108473.65640187665},{"content":"#[cfg(not(target_os = \"linux\"))]\n\n#[doc(hidden)]\n\npub fn socketpair_impl() -> anyhow::Result<(FileDescriptor, FileDescriptor)> {\n\n let mut fds = [-1i32; 2];\n\n let res = unsafe { libc::socketpair(libc::PF_LOCAL, libc::SOCK_STREAM, 0, fds.as_mut_ptr()) };\n\n if res == -1 {\n\n bail!(\n\n \"failed to create a socketpair: {:?}\",\n\n std::io::Error::last_os_error()\n\n )\n\n } else {\n\n let mut read = FileDescriptor {\n\n handle: OwnedHandle {\n\n handle: fds[0],\n\n handle_type: (),\n\n },\n\n };\n\n let mut write = FileDescriptor {\n\n handle: OwnedHandle {\n\n handle: fds[1],\n\n handle_type: (),\n\n },\n\n };\n\n read.handle.cloexec()?;\n\n write.handle.cloexec()?;\n\n Ok((read, write))\n\n }\n\n}\n\n\n\npub use libc::{pollfd, POLLERR, POLLHUP, POLLIN, POLLOUT};\n\nuse std::time::Duration;\n\n\n","file_path":"filedescriptor/src/unix.rs","rank":51,"score":106272.86670100283},{"content":"#[doc(hidden)]\n\npub fn socketpair_impl() -> anyhow::Result<(FileDescriptor, FileDescriptor)> {\n\n init_winsock();\n\n\n\n let s = socket(AF_INET, SOCK_STREAM, 0)?;\n\n\n\n let mut in_addr: SOCKADDR_IN = unsafe { std::mem::zeroed() };\n\n in_addr.sin_family = AF_INET as _;\n\n unsafe {\n\n *in_addr.sin_addr.S_un.S_addr_mut() = htonl(INADDR_LOOPBACK);\n\n }\n\n\n\n unsafe {\n\n if bind(\n\n s.as_raw_handle() as _,\n\n std::mem::transmute(&in_addr),\n\n std::mem::size_of_val(&in_addr) as _,\n\n ) != 0\n\n {\n\n bail!(\"bind failed: {}\", IoError::last_os_error());\n\n }\n","file_path":"filedescriptor/src/windows.rs","rank":52,"score":106272.86670100283},{"content":"fn default_ratelimit_line_prefetches_per_second() -> u32 {\n\n 10\n\n}\n\n\n","file_path":"src/config/mod.rs","rank":53,"score":105977.75519086001},{"content":"/// characters that when masked for CTRL could be an ascii control character\n\n/// or could be a key that a user legitimately wants to process in their\n\n/// terminal application\n\nfn is_ambiguous_ascii_ctrl(c: char) -> bool {\n\n match c {\n\n 'i' | 'I' | 'm' | 'M' | '[' | '{' | '@' => true,\n\n _ => false,\n\n }\n\n}\n\n\n\nimpl TerminalState {\n\n pub fn new(\n\n physical_rows: usize,\n\n physical_cols: usize,\n\n pixel_width: usize,\n\n pixel_height: usize,\n\n config: Arc<dyn TerminalConfiguration>,\n\n ) -> TerminalState {\n\n let screen = ScreenOrAlt::new(physical_rows, physical_cols, &config);\n\n\n\n TerminalState {\n\n config,\n\n screen,\n","file_path":"term/src/terminalstate.rs","rank":54,"score":105744.37411514229},{"content":"/// Adjust the color to make it appear disabled.\n\n/// This is not defined on RgbColor itself in order\n\n/// to avoid termwiz requiring a dep on the palette crate.\n\nfn grey_out(color: RgbColor) -> RgbColor {\n\n use palette::{Blend, Lch, Saturate, Srgba};\n\n let color = Srgba::new(color.red, color.green, color.blue, 0xff);\n\n let color: Srgba = color.into_format();\n\n let color = color.into_linear();\n\n\n\n let desaturated = Lch::from(color).desaturate(0.2);\n\n\n\n let tint = Srgba::new(0.2, 0.2, 0.2, 0.6).into_linear();\n\n let result = Srgba::from_linear(tint.over(desaturated.into()));\n\n let result = Srgba::<u8>::from_format(result);\n\n\n\n RgbColor::new(result.red, result.green, result.blue)\n\n}\n\n\n\nimpl fmt::Debug for Palette256 {\n\n fn fmt(&self, fmt: &mut fmt::Formatter) -> Result<(), fmt::Error> {\n\n // If we wanted to dump all of the entries, we'd use this:\n\n // self.0[..].fmt(fmt)\n\n // However, we typically don't care about those and we're interested\n","file_path":"term/src/color.rs","rank":55,"score":103018.73379774296},{"content":"fn encode_modifiers(mods: KeyModifiers) -> u8 {\n\n let mut number = 0;\n\n if mods.contains(KeyModifiers::SHIFT) {\n\n number |= 1;\n\n }\n\n if mods.contains(KeyModifiers::ALT) {\n\n number |= 2;\n\n }\n\n if mods.contains(KeyModifiers::CTRL) {\n\n number |= 4;\n\n }\n\n number\n\n}\n\n\n\n// FIXME: provide an option to enable this, because it is super annoying\n\n// in vim when accidentally pressing shift-space and it emits a sequence\n\n// that undoes some number of commands\n\nconst ENABLE_CSI_U: bool = false;\n\n\n","file_path":"term/src/terminalstate.rs","rank":56,"score":103018.73379774296},{"content":"fn emit_padding_for_terminal(len: usize, spacer: &CellAttributes, output: &mut Vec<Change>) {\n\n if len == 0 {\n\n return;\n\n }\n\n output.push(Change::AllAttributes(spacer.clone()));\n\n let mut s = String::new();\n\n for _ in 0..len {\n\n s.push(' ');\n\n }\n\n output.push(s.into());\n\n}\n\n\n","file_path":"tabout/src/lib.rs","rank":57,"score":102829.11766008072},{"content":"pub fn use_ime(enable: bool) {\n\n USE_IME.store(enable, Ordering::Relaxed);\n\n}\n\n\n","file_path":"window/src/os/macos/window.rs","rank":58,"score":100801.66324230288},{"content":"fn linear_f32_to_srgb8_using_table(f: f32) -> u8 {\n\n let minval = f32::from_bits(MINVAL);\n\n let almost_one = f32::from_bits(ALMOST_ONE);\n\n\n\n let f = if f < minval {\n\n minval\n\n } else if f > almost_one {\n\n almost_one\n\n } else {\n\n f\n\n };\n\n\n\n let f_bits = f.to_bits();\n\n let tab = unsafe { *F32_TO_U8_TABLE.get_unchecked(((f_bits - MINVAL) >> 20) as usize) };\n\n let bias = (tab >> 16) << 9;\n\n let scale = tab & 0xffff;\n\n\n\n let t = (f_bits >> 12) & 0xff;\n\n\n\n ((bias + scale * t) >> 16) as u8\n\n}\n\n\n","file_path":"window/src/color.rs","rank":59,"score":100801.66324230288},{"content":"/// Examines a set of FileDescriptors to see if some of them are ready for I/O,\n\n/// or if certain events have occurred on them.\n\n///\n\n/// This uses the system native readiness checking mechanism, which on Windows\n\n/// means that it does NOT use IOCP and that this only works with sockets on\n\n/// Windows. If you need IOCP then the `mio` crate is recommended for a much\n\n/// more scalable solution.\n\n///\n\n/// On macOS, the `poll(2)` implementation has problems when used with eg: pty\n\n/// descriptors, so this implementation of poll uses the `select(2)` interface\n\n/// under the covers. That places a limit on the maximum file descriptor value\n\n/// that can be passed to poll. If a file descriptor is out of range then an\n\n/// error will returned. This limitation could potentially be lifted in the\n\n/// future.\n\n///\n\n/// On Windows, `WSAPoll` is used to implement readiness checking, which has\n\n/// the consequence that it can only be used with sockets.\n\n///\n\n/// If `duration` is `None`, then `poll` will block until any of the requested\n\n/// events are ready. Otherwise, `duration` specifies how long to wait for\n\n/// readiness before giving up.\n\n///\n\n/// The return value is the number of entries that were satisfied; `0` means\n\n/// that none were ready after waiting for the specified duration.\n\n///\n\n/// The `pfd` array is mutated and the `revents` field is updated to indicate\n\n/// which of the events were received.\n\npub fn poll(pfd: &mut [pollfd], duration: Option<Duration>) -> anyhow::Result<usize> {\n\n poll_impl(pfd, duration)\n\n}\n\n\n","file_path":"filedescriptor/src/lib.rs","rank":60,"score":100629.55070995117},{"content":"/// Read a single leb128 encoded value from the stream\n\nfn read_u64<R: std::io::Read>(mut r: R) -> anyhow::Result<u64> {\n\n leb128::read::unsigned(&mut r)\n\n .map_err(|err| match err {\n\n leb128::read::Error::IoError(ioerr) => anyhow::Error::new(ioerr),\n\n err => anyhow::Error::new(err),\n\n })\n\n .context(\"reading leb128\")\n\n}\n\n\n","file_path":"src/server/codec.rs","rank":61,"score":100615.83608699101},{"content":"/// Decode a frame.\n\n/// See encode_raw() for the frame format.\n\nfn decode_raw<R: std::io::Read>(mut r: R) -> anyhow::Result<Decoded> {\n\n let len = read_u64(r.by_ref()).context(\"reading PDU length\")?;\n\n let (len, is_compressed) = if (len & COMPRESSED_MASK) != 0 {\n\n (len & !COMPRESSED_MASK, true)\n\n } else {\n\n (len, false)\n\n };\n\n let serial = read_u64(r.by_ref()).context(\"reading PDU serial\")?;\n\n let ident = read_u64(r.by_ref()).context(\"reading PDU ident\")?;\n\n let data_len = len as usize - (encoded_length(ident) + encoded_length(serial));\n\n\n\n if is_compressed {\n\n metrics::value!(\"pdu.decode.compressed.size\", data_len as u64);\n\n } else {\n\n metrics::value!(\"pdu.decode.size\", data_len as u64);\n\n }\n\n\n\n let mut data = vec![0u8; data_len];\n\n r.read_exact(&mut data).with_context(|| {\n\n format!(\n","file_path":"src/server/codec.rs","rank":62,"score":100615.83608699101},{"content":"struct TestHost {}\n\n\n\nimpl TestHost {\n\n fn new() -> Self {\n\n Self {}\n\n }\n\n}\n\n\n\nimpl std::io::Write for TestHost {\n\n fn write(&mut self, _buf: &[u8]) -> Result<usize, std::io::Error> {\n\n panic!(\"no writer support in TestHost\");\n\n }\n\n fn flush(&mut self) -> Result<(), std::io::Error> {\n\n panic!(\"no writer support in TestHost\");\n\n }\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":63,"score":99120.10965244782},{"content":"#[doc(hidden)]\n\npub fn poll_impl(pfd: &mut [pollfd], duration: Option<Duration>) -> anyhow::Result<usize> {\n\n let poll_result = unsafe {\n\n WSAPoll(\n\n pfd.as_mut_ptr(),\n\n pfd.len() as _,\n\n duration\n\n .map(|wait| wait.as_millis() as libc::c_int)\n\n .unwrap_or(-1),\n\n )\n\n };\n\n if poll_result < 0 {\n\n Err(std::io::Error::last_os_error().into())\n\n } else {\n\n Ok(poll_result as usize)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use std::io::{Read, Write};\n","file_path":"filedescriptor/src/windows.rs","rank":64,"score":98743.77729103202},{"content":"#[cfg(not(target_os = \"macos\"))]\n\n#[doc(hidden)]\n\npub fn poll_impl(pfd: &mut [pollfd], duration: Option<Duration>) -> anyhow::Result<usize> {\n\n let poll_result = unsafe {\n\n libc::poll(\n\n pfd.as_mut_ptr(),\n\n pfd.len() as _,\n\n duration\n\n .map(|wait| wait.as_millis() as libc::c_int)\n\n .unwrap_or(-1),\n\n )\n\n };\n\n if poll_result < 0 {\n\n Err(std::io::Error::last_os_error().into())\n\n } else {\n\n Ok(poll_result as usize)\n\n }\n\n}\n\n\n\n// macOS has a broken poll(2) implementation, so we introduce a layer to deal with that here\n\n#[cfg(target_os = \"macos\")]\n\nmod macos {\n","file_path":"filedescriptor/src/unix.rs","rank":65,"score":98743.77729103202},{"content":"fn read_from_tab_pty(tab_id: TabId, mut reader: Box<dyn std::io::Read>) {\n\n const BUFSIZE: usize = 32 * 1024;\n\n let mut buf = [0; BUFSIZE];\n\n\n\n let mut lim = RateLimiter::new(|config| config.ratelimit_output_bytes_per_second);\n\n\n\n loop {\n\n match reader.read(&mut buf) {\n\n Ok(size) if size == 0 => {\n\n error!(\"read_pty EOF: tab_id {}\", tab_id);\n\n break;\n\n }\n\n Err(err) => {\n\n error!(\"read_pty failed: tab {} {:?}\", tab_id, err);\n\n break;\n\n }\n\n Ok(size) => {\n\n let buf = &buf[..size];\n\n let mut pos = 0;\n\n\n","file_path":"src/mux/mod.rs","rank":66,"score":97230.86505699012},{"content":"pub fn allocate(width: usize, height: usize) -> (TermWizTerminal, TermWizTerminalTab) {\n\n let (render_tx, render_rx) = channel();\n\n let (input_tx, input_rx) = channel();\n\n\n\n let tw_term = TermWizTerminal {\n\n render_tx,\n\n input_rx,\n\n screen_size: ScreenSize {\n\n cols: width,\n\n rows: height,\n\n xpixel: 0,\n\n ypixel: 0,\n\n },\n\n };\n\n\n\n let domain_id = 0;\n\n let tab = TermWizTerminalTab::new(domain_id, width, height, input_tx, render_rx);\n\n (tw_term, tab)\n\n}\n\n\n","file_path":"src/termwiztermtab.rs","rank":67,"score":97128.30741846663},{"content":"\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\"111\", \"aaa\", \" \", \" \", \"bbb\"],\n\n );\n\n term.assert_dirty_lines(&[1, 2, 3], None);\n\n\n\n // expand the scroll region to fill the screen\n\n term.set_scroll_region(0, 4);\n\n term.clean_dirty_lines();\n\n term.delete_lines(1);\n\n\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\"111\", \" \", \" \", \"bbb\", \" \"],\n\n );\n\n term.assert_dirty_lines(&[1, 2, 3, 4], None);\n\n}\n\n\n\n/// Test the behavior of wrapped lines when we resize the terminal\n\n/// wider and then narrower.\n","file_path":"term/src/test/mod.rs","rank":68,"score":93156.81608048585},{"content":" &[\"111\", \"444\", \"555\", \" \", \" \"],\n\n );\n\n term.assert_dirty_lines(&[1, 2, 3, 4], None);\n\n term.clean_dirty_lines();\n\n\n\n term.cup(0, 3);\n\n term.print(\"aaa\\r\\nbbb\");\n\n term.cup(0, 1);\n\n term.clean_dirty_lines();\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\"111\", \"444\", \"555\", \"aaa\", \"bbb\"],\n\n );\n\n\n\n // test with a scroll region smaller than the screen\n\n term.set_scroll_region(1, 3);\n\n print_all_lines(&term);\n\n term.delete_lines(2);\n","file_path":"term/src/test/mod.rs","rank":69,"score":93156.08543655663},{"content":" reason\n\n );\n\n }\n\n}\n\n\n\nimpl Deref for TestTerm {\n\n type Target = Terminal;\n\n\n\n fn deref(&self) -> &Terminal {\n\n &self.term\n\n }\n\n}\n\n\n\nimpl DerefMut for TestTerm {\n\n fn deref_mut(&mut self) -> &mut Terminal {\n\n &mut self.term\n\n }\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":70,"score":93153.92944312253},{"content":"use super::*;\n\nuse pretty_assertions::assert_eq;\n\n\n\n/// Test basic dragging to select some text\n\n#[test]\n","file_path":"term/src/test/selection.rs","rank":71,"score":93152.41188910279},{"content":"//! Testing C0 control characters\n\n\n\nuse super::*;\n\n\n\n#[test]\n","file_path":"term/src/test/c0.rs","rank":72,"score":93152.40793970044},{"content":"//! Testing C1 control sequences\n\n\n\nuse super::*;\n\n\n\n#[test]\n","file_path":"term/src/test/c1.rs","rank":73,"score":93152.40793970044},{"content":" Arc::new(TestTermConfig { scrollback }),\n\n );\n\n let clip: Arc<dyn Clipboard> = Arc::new(LocalClip::new());\n\n term.set_clipboard(&clip);\n\n\n\n let mut term = Self {\n\n term,\n\n host: TestHost::new(),\n\n };\n\n\n\n term.set_auto_wrap(true);\n\n\n\n term\n\n }\n\n\n\n fn print<B: AsRef<[u8]>>(&mut self, bytes: B) {\n\n self.term.advance_bytes(bytes, &mut self.host);\n\n }\n\n\n\n #[allow(dead_code)]\n","file_path":"term/src/test/mod.rs","rank":75,"score":93151.84668969616},{"content":"//! Various tests of the terminal model and escape sequence\n\n//! processing routines.\n\n\n\nuse super::*;\n\nmod c0;\n\nuse bitflags::bitflags;\n\nmod c1;\n\nmod csi;\n\n// mod selection; FIXME: port to render layer\n\nuse crate::color::ColorPalette;\n\nuse pretty_assertions::assert_eq;\n\nuse std::cell::RefCell;\n\nuse std::sync::Arc;\n\nuse termwiz::escape::csi::{Edit, EraseInDisplay, EraseInLine};\n\nuse termwiz::escape::{OneBased, OperatingSystemCommand, CSI};\n\nuse termwiz::surface::CursorShape;\n\n\n","file_path":"term/src/test/mod.rs","rank":76,"score":93150.89985944514},{"content":" let otherlink = Arc::new(Hyperlink::new_with_id(\"http://example.com/other\", \"w00t\"));\n\n\n\n // Switching link and turning it off\n\n term.hyperlink(&otherlink);\n\n term.print(\"wo\");\n\n // soft reset also disables hyperlink attribute\n\n term.soft_reset();\n\n term.print(\"00t\");\n\n\n\n let mut partial_line =\n\n Line::from_text_with_wrapped_last_col(\"wo00t\", &CellAttributes::default());\n\n partial_line.set_cell(\n\n 0,\n\n Cell::new(\n\n 'w',\n\n CellAttributes::default()\n\n .set_hyperlink(Some(Arc::clone(&otherlink)))\n\n .clone(),\n\n ),\n\n );\n","file_path":"term/src/test/mod.rs","rank":77,"score":93149.34020892378},{"content":" );\n\n term.resize(LINES, 6, 0, 0);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222aa\", \"333 \", \" \", \" \", \" \", \" \", \" \",\n\n ],\n\n );\n\n term.resize(LINES, 7, 0, 0);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222aa\", \"333 \", \" \", \" \", \" \", \" \", \" \",\n\n ],\n\n );\n\n term.resize(LINES, 8, 0, 0);\n","file_path":"term/src/test/mod.rs","rank":78,"score":93148.61943205952},{"content":" file!(),\n\n line!(),\n\n &[\n\n \" \",\n\n \" \",\n\n \" \",\n\n \" \",\n\n \" \",\n\n ],\n\n );\n\n\n\n term.cup(0, 2);\n\n term.print(\"woot\");\n\n term.cup(2, 2);\n\n term.erase_in_line(EraseInLine::EraseToEndOfLine);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n","file_path":"term/src/test/mod.rs","rank":79,"score":93148.61943205952},{"content":" assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222aa\", \"333 \", \" \", \" \", \" \", \" \", \" \",\n\n ],\n\n );\n\n term.resize(LINES, 5, 0, 0);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222a\", \"a\", \"333 \", \" \", \" \", \" \", \" \",\n\n ],\n\n );\n\n term.resize(LINES, 4, 0, 0);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\"111 \", \"2222\", \"aa\", \"333 \", \" \", \" \", \" \", \" \"],\n\n );\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":80,"score":93148.48802199158},{"content":" assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222aa\", \"333 \", \" \", \" \", \" \", \" \", \" \",\n\n ],\n\n );\n\n\n\n // Resize smaller again\n\n term.resize(LINES, 7, 0, 0);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \"111 \", \"2222aa\", \"333 \", \" \", \" \", \" \", \" \", \" \",\n\n ],\n\n );\n\n term.resize(LINES, 6, 0, 0);\n","file_path":"term/src/test/mod.rs","rank":81,"score":93148.24973923026},{"content":" );\n\n\n\n term.hyperlink(&link);\n\n term.print(\"he\");\n\n // Resetting pen should not reset the link\n\n term.print(\"\\x1b[m\");\n\n term.print(\"y!!\");\n\n\n\n assert_lines_equal(\n\n file!(),\n\n line!(),\n\n &term.screen().visible_lines(),\n\n &[\n\n Line::from_text_with_wrapped_last_col(\"hello\", &linked),\n\n Line::from_text_with_wrapped_last_col(\"hey!!\", &linked),\n\n \" \".into(),\n\n ],\n\n Compare::TEXT | Compare::ATTRS,\n\n );\n\n\n","file_path":"term/src/test/mod.rs","rank":82,"score":93147.86681099296},{"content":" assert_eq!(term.screen().visible_row_to_stable_row(0), 4);\n\n\n\n term.print(\"6\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"2\", \"3\", \"4\", \"5\", \"6\", \" \"]);\n\n assert_eq!(term.screen().visible_row_to_stable_row(0), 5);\n\n\n\n term.print(\"7\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"3\", \"4\", \"5\", \"6\", \"7\", \" \"]);\n\n assert_eq!(term.screen().visible_row_to_stable_row(0), 6);\n\n\n\n term.print(\"8\\n\");\n\n assert_all_contents(&term, file!(), line!(), &[\"4\", \"5\", \"6\", \"7\", \"8\", \" \"]);\n\n assert_eq!(term.screen().visible_row_to_stable_row(0), 7);\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":83,"score":93147.37662957575},{"content":" assert_eq!(term.get_clipboard().unwrap(), \"\\u{1F480}skul\");\n\n\n\n // Multi-line selection\n\n term.drag_select(1, 0, 6, 1);\n\n assert_eq!(term.get_clipboard().unwrap(), \"ello world\\n\\u{1F480}skull\");\n\n\n\n // This next one drags off the bottom; this is technically out of bounds\n\n // but we want to make sure we handle this without panicking. See the\n\n // comment in TerminalState::mouse_event for more info.\n\n term.drag_select(0, 0, 15, 3);\n\n assert_eq!(\n\n term.get_clipboard().unwrap(),\n\n \"hello world\\n\\u{1F480}skull\\n\"\n\n );\n\n\n\n term.drag_select(6, 0, 3, 1);\n\n assert_eq!(term.get_clipboard().unwrap(), \"world\\n\\u{1F480}sk\");\n\n}\n\n\n\n/// Test double click to select a word\n","file_path":"term/src/test/selection.rs","rank":84,"score":93147.28869964382},{"content":" \" \",\n\n \" \",\n\n \"wo \",\n\n \" \",\n\n \" \",\n\n ],\n\n );\n\n\n\n term.erase_in_line(EraseInLine::EraseToStartOfLine);\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \" \",\n\n \" \",\n\n \" \",\n\n \" \",\n\n \" \",\n\n ],\n\n );\n\n}\n\n\n\n/// Ensure that we dirty lines as the cursor is moved around, otherwise\n\n/// the renderer won't draw the cursor in the right place\n","file_path":"term/src/test/mod.rs","rank":85,"score":93147.21822048264},{"content":"\n\n fn cup(&mut self, col: isize, row: isize) {\n\n self.print(CSI);\n\n self.print(format!(\"{};{}H\", row + 1, col + 1));\n\n }\n\n\n\n fn hvp(&mut self, col: isize, row: isize) {\n\n self.print(CSI);\n\n self.print(format!(\"{};{}f\", row + 1, col + 1));\n\n }\n\n\n\n fn erase_in_display(&mut self, erase: EraseInDisplay) {\n\n let csi = CSI::Edit(Edit::EraseInDisplay(erase));\n\n self.print(format!(\"{}\", csi));\n\n }\n\n\n\n fn erase_in_line(&mut self, erase: EraseInLine) {\n\n let csi = CSI::Edit(Edit::EraseInLine(erase));\n\n self.print(format!(\"{}\", csi));\n\n }\n","file_path":"term/src/test/mod.rs","rank":86,"score":93145.78879602136},{"content":" term.set_auto_wrap(true);\n\n term.erase_in_display(EraseInDisplay::EraseToStartOfDisplay);\n\n term.cup(1, 1);\n\n term.print(\"hello, world!\");\n\n assert_visible_contents(\n\n &term,\n\n file!(),\n\n line!(),\n\n &[\n\n \" \",\n\n \" hello, wo\",\n\n \"rld! \",\n\n \" \",\n\n \" \",\n\n ],\n\n );\n\n\n\n term.erase_in_display(EraseInDisplay::EraseToStartOfDisplay);\n\n assert_visible_contents(\n\n &term,\n","file_path":"term/src/test/mod.rs","rank":87,"score":93145.59716930808},{"content":" partial_line.set_cell(\n\n 1,\n\n Cell::new(\n\n 'o',\n\n CellAttributes::default()\n\n .set_hyperlink(Some(Arc::clone(&otherlink)))\n\n .clone(),\n\n ),\n\n );\n\n\n\n assert_lines_equal(\n\n file!(),\n\n line!(),\n\n &term.screen().visible_lines(),\n\n &[\n\n Line::from_text_with_wrapped_last_col(\"hello\", &linked),\n\n Line::from_text_with_wrapped_last_col(\"hey!!\", &linked),\n\n partial_line,\n\n ],\n\n Compare::TEXT | Compare::ATTRS,\n\n );\n\n}\n","file_path":"term/src/test/mod.rs","rank":88,"score":93145.37098083475},{"content":" .borrow()\n\n .as_ref()\n\n .map(|c| c.clone())\n\n .ok_or_else(|| anyhow::anyhow!(\"no clipboard\"))\n\n }\n\n}\n\n\n\nimpl TerminalHost for TestHost {\n\n fn writer(&mut self) -> &mut dyn std::io::Write {\n\n self\n\n }\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":89,"score":93145.04603031323},{"content":" shape: CursorShape::Default,\n\n };\n\n assert_eq!(\n\n cursor, expect,\n\n \"actual cursor (left) didn't match expected cursor (right) reason={:?}\",\n\n reason\n\n );\n\n }\n\n\n\n fn assert_dirty_lines(&self, expected: &[usize], reason: Option<&str>) {\n\n let dirty_indices: Vec<usize> = self\n\n .screen()\n\n .lines\n\n .iter()\n\n .enumerate()\n\n .filter_map(|(i, line)| if line.is_dirty() { Some(i) } else { None })\n\n .collect();\n\n assert_eq!(\n\n &dirty_indices, &expected,\n\n \"actual dirty lines (left) didn't match expected dirty lines (right) reason={:?}\",\n","file_path":"term/src/test/mod.rs","rank":90,"score":93144.5845906837},{"content":" fn set_mode(&mut self, mode: &str, enable: bool) {\n\n self.print(CSI);\n\n self.print(mode);\n\n self.print(if enable { b\"h\" } else { b\"l\" });\n\n }\n\n\n\n fn set_auto_wrap(&mut self, enable: bool) {\n\n self.set_mode(\"?7\", enable);\n\n }\n\n\n\n #[allow(dead_code)]\n\n fn set_scroll_region(&mut self, top: usize, bottom: usize) {\n\n self.print(CSI);\n\n self.print(format!(\"{};{}r\", top + 1, bottom + 1));\n\n }\n\n\n\n fn delete_lines(&mut self, n: isize) {\n\n self.print(CSI);\n\n self.print(format!(\"{}M\", n));\n\n }\n","file_path":"term/src/test/mod.rs","rank":91,"score":93144.144504337},{"content":" \"{}:{}: line {} text didn't match '{}' vs '{}'\",\n\n file,\n\n line_no,\n\n idx,\n\n line_str.escape_default(),\n\n expect_str.escape_default()\n\n );\n\n }\n\n }\n\n\n\n assert_eq!(\n\n lines.len(),\n\n expect_lines.len(),\n\n \"{}:{}: expectation has wrong number of lines\",\n\n file,\n\n line_no\n\n );\n\n}\n\n\n\nbitflags! {\n\n struct Compare : u8{\n\n const TEXT = 1;\n\n const ATTRS = 2;\n\n const DIRTY = 4;\n\n }\n\n}\n\n\n","file_path":"term/src/test/mod.rs","rank":92,"score":93141.7470849403},{"content":"\n\n if compare.contains(Compare::ATTRS) {\n\n let line_attrs: Vec<_> = line.cells().iter().map(|c| c.attrs().clone()).collect();\n\n let expect_attrs: Vec<_> = expect.cells().iter().map(|c| c.attrs().clone()).collect();\n\n assert_eq!(\n\n expect_attrs,\n\n line_attrs,\n\n \"{}:{}: line {} `{}` attrs didn't match (left=expected, right=actual)\",\n\n file,\n\n line_no,\n\n idx,\n\n line.as_str()\n\n );\n\n }\n\n if compare.contains(Compare::TEXT) {\n\n let line_str = line.as_str();\n\n let expect_str = expect.as_str();\n\n assert_eq!(\n\n line_str,\n\n expect_str,\n","file_path":"term/src/test/mod.rs","rank":93,"score":93141.60901158437},{"content":"\n\n fn hyperlink(&mut self, link: &Arc<Hyperlink>) {\n\n let osc = OperatingSystemCommand::SetHyperlink(Some(link.as_ref().clone()));\n\n self.print(format!(\"{}\", osc));\n\n }\n\n\n\n fn hyperlink_off(&mut self) {\n\n self.print(\"\\x1b]8;;\\x1b\\\\\");\n\n }\n\n\n\n fn soft_reset(&mut self) {\n\n self.print(CSI);\n\n self.print(\"!p\");\n\n }\n\n\n\n fn assert_cursor_pos(&self, x: usize, y: i64, reason: Option<&str>) {\n\n let cursor = self.cursor_pos();\n\n let expect = CursorPosition {\n\n x,\n\n y,\n","file_path":"term/src/test/mod.rs","rank":94,"score":93140.28062796021},{"content":"/// Create a `Terminal` with the recommended settings for use with\n\n/// a `LineEditor`.\n\npub fn line_editor_terminal() -> anyhow::Result<impl Terminal> {\n\n let hints = ProbeHints::new_from_env().mouse_reporting(Some(false));\n\n let caps = Capabilities::new_with_hints(hints)?;\n\n new_terminal(caps)\n\n}\n","file_path":"termwiz/src/lineedit/mod.rs","rank":95,"score":92384.67775038579},{"content":"#[derive(Debug)]\n\nstruct LocalClip {\n\n clip: RefCell<Option<String>>,\n\n}\n\n\n\nimpl LocalClip {\n\n fn new() -> Self {\n\n Self {\n\n clip: RefCell::new(None),\n\n }\n\n }\n\n}\n\n\n\nimpl Clipboard for LocalClip {\n\n fn set_contents(&self, clip: Option<String>) -> anyhow::Result<()> {\n\n *self.clip.borrow_mut() = clip;\n\n Ok(())\n\n }\n\n\n\n fn get_contents(&self) -> anyhow::Result<String> {\n\n self.clip\n","file_path":"term/src/test/mod.rs","rank":96,"score":86023.52569460013},{"content":"fn main() {\n\n let mut flags = ConstantsFlags::all();\n\n flags.remove(ConstantsFlags::SEMVER_FROM_CARGO_PKG);\n\n // Generate the 'cargo:' key output\n\n generate_cargo_keys(ConstantsFlags::all()).expect(\"Unable to generate the cargo keys!\");\n\n\n\n // If a file named `.tag` is present, we'll take its contents for the\n\n // version number that we report in wezterm -h.\n\n let mut ci_tag = String::new();\n\n if let Ok(tag) = std::fs::read(\".tag\") {\n\n if let Ok(s) = String::from_utf8(tag) {\n\n ci_tag = s.trim().to_string();\n\n println!(\"cargo:rerun-if-changed=.tag\");\n\n }\n\n }\n\n println!(\"cargo:rustc-env=WEZTERM_CI_TAG={}\", ci_tag);\n\n println!(\"cargo:rustc-env=MACOSX_DEPLOYMENT_TARGET=10.9\");\n\n\n\n #[cfg(windows)]\n\n {\n","file_path":"build.rs","rank":97,"score":85373.9169417209},{"content":"fn scrollback_size(config: &Arc<dyn TerminalConfiguration>, allow_scrollback: bool) -> usize {\n\n if allow_scrollback {\n\n config.scrollback_size()\n\n } else {\n\n 0\n\n }\n\n}\n\n\n\nimpl Screen {\n\n /// Create a new Screen with the specified dimensions.\n\n /// The Cells in the viewable portion of the screen are set to the\n\n /// default cell attributes.\n\n pub fn new(\n\n physical_rows: usize,\n\n physical_cols: usize,\n\n config: &Arc<dyn TerminalConfiguration>,\n\n allow_scrollback: bool,\n\n ) -> Screen {\n\n let physical_rows = physical_rows.max(1);\n\n let physical_cols = physical_cols.max(1);\n","file_path":"term/src/screen.rs","rank":98,"score":85239.77752300375},{"content":"<!-- cargo-sync-readme start -->\n\n\n\nThe purpose of this crate is to make it a bit more ergonomic for portable\n\napplications that need to work with the platform level `RawFd` and\n\n`RawHandle` types.\n\n\n\nRather than conditionally using `RawFd` and `RawHandle`, the `FileDescriptor`\n\ntype can be used to manage ownership, duplicate, read and write.\n\n\n\n## FileDescriptor\n\n\n\nThis is a bit of a contrived example, but demonstrates how to avoid\n\nthe conditional code that would otherwise be required to deal with\n\ncalling `as_raw_fd` and `as_raw_handle`:\n\n\n\n```\n\nuse filedescriptor::{FileDescriptor, FromRawFileDescriptor};\n\nuse std::io::Write;\n\n\n\nfn get_stdout() -> anyhow::Result<FileDescriptor> {\n\n let stdout = std::io::stdout();\n\n let handle = stdout.lock();\n\n FileDescriptor::dup(&handle)\n\n}\n\n\n\nfn print_something() -> anyhow::Result<()> {\n\n get_stdout()?.write(b\"hello\")?;\n\n Ok(())\n\n}\n\n```\n\n\n\n## Pipe\n\nThe `Pipe` type makes it more convenient to create a pipe and manage\n\nthe lifetime of both the read and write ends of that pipe.\n\n\n\n```\n\nuse filedescriptor::Pipe;\n\nuse std::io::{Read, Write};\n\nuse anyhow::Error;\n\n\n\nlet mut pipe = Pipe::new()?;\n\npipe.write.write(b\"hello\")?;\n\ndrop(pipe.write);\n\n\n\nlet mut s = String::new();\n\npipe.read.read_to_string(&mut s)?;\n\nassert_eq!(s, \"hello\");\n\n```\n\n\n\n## Socketpair\n\nThe `socketpair` function returns a pair of connected `SOCK_STREAM`\n\nsockets and functions both on posix and windows systems.\n\n\n\n```\n\nuse std::io::{Read, Write};\n\nuse anyhow::Error;\n\n\n\nlet (mut a, mut b) = filedescriptor::socketpair()?;\n\na.write(b\"hello\")?;\n\ndrop(a);\n\n\n\nlet mut s = String::new();\n\nb.read_to_string(&mut s)?;\n\nassert_eq!(s, \"hello\");\n","file_path":"filedescriptor/README.md","rank":99,"score":23.197002051962063}],"string":"[\n {\n \"content\": \"fn assert_all_contents(term: &Terminal, file: &str, line: u32, expect_lines: &[&str]) {\\n\\n print_all_lines(&term);\\n\\n let screen = term.screen();\\n\\n\\n\\n let expect: Vec<Line> = expect_lines.iter().map(|s| (*s).into()).collect();\\n\\n\\n\\n assert_lines_equal(file, line, &screen.all_lines(), &expect, Compare::TEXT);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 0,\n \"score\": 267423.51240122144\n },\n {\n \"content\": \"/// Asserts that the visible lines of the terminal have the\\n\\n/// same character contents as the expected lines.\\n\\n/// The other cell attributes are not compared; this is\\n\\n/// a convenience for writing visually understandable tests.\\n\\nfn assert_visible_contents(term: &Terminal, file: &str, line: u32, expect_lines: &[&str]) {\\n\\n print_visible_lines(&term);\\n\\n let screen = term.screen();\\n\\n\\n\\n let expect: Vec<Line> = expect_lines.iter().map(|s| (*s).into()).collect();\\n\\n\\n\\n assert_lines_equal(file, line, &screen.visible_lines(), &expect, Compare::TEXT);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 1,\n \"score\": 262952.33119507186\n },\n {\n \"content\": \"fn print_all_lines(term: &Terminal) {\\n\\n let screen = term.screen();\\n\\n\\n\\n println!(\\\"whole screen contents are:\\\");\\n\\n for line in screen.lines.iter() {\\n\\n println!(\\\"[{}]\\\", line.as_str());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 2,\n \"score\": 233244.43729643774\n },\n {\n \"content\": \"fn print_visible_lines(term: &Terminal) {\\n\\n let screen = term.screen();\\n\\n\\n\\n println!(\\\"screen contents are:\\\");\\n\\n for line in screen.visible_lines().iter() {\\n\\n println!(\\\"[{}]\\\", line.as_str());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 3,\n \"score\": 227902.96493406055\n },\n {\n \"content\": \"#[test]\\n\\nfn test_delete_lines() {\\n\\n let mut term = TestTerm::new(5, 3, 0);\\n\\n\\n\\n term.print(\\\"111\\\\r\\\\n222\\\\r\\\\n333\\\\r\\\\n444\\\\r\\\\n555\\\");\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\\"111\\\", \\\"222\\\", \\\"333\\\", \\\"444\\\", \\\"555\\\"],\\n\\n );\\n\\n term.assert_dirty_lines(&[0, 1, 2, 3, 4], None);\\n\\n term.cup(0, 1);\\n\\n term.clean_dirty_lines();\\n\\n\\n\\n term.assert_dirty_lines(&[], None);\\n\\n term.delete_lines(2);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 8,\n \"score\": 213876.82979000002\n },\n {\n \"content\": \"/// Asserts that both line slices match according to the\\n\\n/// selected flags.\\n\\nfn assert_lines_equal(\\n\\n file: &str,\\n\\n line_no: u32,\\n\\n lines: &[Line],\\n\\n expect_lines: &[Line],\\n\\n compare: Compare,\\n\\n) {\\n\\n let mut expect_iter = expect_lines.iter();\\n\\n\\n\\n for (idx, line) in lines.iter().enumerate() {\\n\\n let expect = expect_iter.next().unwrap();\\n\\n\\n\\n if compare.contains(Compare::DIRTY) {\\n\\n assert_eq!(\\n\\n line.is_dirty(),\\n\\n expect.is_dirty(),\\n\\n \\\"line {} dirty didn't match\\\",\\n\\n idx,\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 9,\n \"score\": 200558.57679373468\n },\n {\n \"content\": \"fn read_pipe_with_timeout(mut file: FileDescriptor) -> anyhow::Result<String> {\\n\\n let mut result = Vec::new();\\n\\n\\n\\n file.set_non_blocking(true)?;\\n\\n let mut pfd = libc::pollfd {\\n\\n fd: file.as_raw_fd(),\\n\\n events: libc::POLLIN,\\n\\n revents: 0,\\n\\n };\\n\\n\\n\\n let mut buf = [0u8; 8192];\\n\\n\\n\\n loop {\\n\\n if unsafe { libc::poll(&mut pfd, 1, 3000) == 1 } {\\n\\n match file.read(&mut buf) {\\n\\n Ok(size) if size == 0 => {\\n\\n break;\\n\\n }\\n\\n Ok(size) => {\\n\\n result.extend_from_slice(&buf[..size]);\\n\",\n \"file_path\": \"window/src/os/wayland/window.rs\",\n \"rank\": 10,\n \"score\": 177149.85756957345\n },\n {\n \"content\": \"#[test]\\n\\nfn test_ind() {\\n\\n let mut term = TestTerm::new(4, 4, 0);\\n\\n term.print(\\\"a\\\\r\\\\nb\\\\x1bD\\\");\\n\\n term.assert_cursor_pos(1, 2, None);\\n\\n assert_visible_contents(&term, file!(), line!(), &[\\\"a \\\", \\\"b \\\", \\\" \\\", \\\" \\\"]);\\n\\n term.print(\\\"\\\\x1bD\\\");\\n\\n term.assert_cursor_pos(1, 3, None);\\n\\n term.print(\\\"\\\\x1bD\\\");\\n\\n term.assert_cursor_pos(1, 3, None);\\n\\n assert_visible_contents(&term, file!(), line!(), &[\\\"b \\\", \\\" \\\", \\\" \\\", \\\" \\\"]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/c1.rs\",\n \"rank\": 12,\n \"score\": 176791.41971122747\n },\n {\n \"content\": \"#[test]\\n\\nfn test_tab() {\\n\\n let mut term = TestTerm::new(3, 25, 0);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(8, 0, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(16, 0, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(24, 0, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(24, 0, None);\\n\\n}\\n\",\n \"file_path\": \"term/src/test/c0.rs\",\n \"rank\": 14,\n \"score\": 176791.4197112275\n },\n {\n \"content\": \"#[test]\\n\\nfn test_hts() {\\n\\n let mut term = TestTerm::new(3, 25, 0);\\n\\n term.print(\\\"boo\\\");\\n\\n term.print(\\\"\\\\x1bH\\\\r\\\\n\\\");\\n\\n term.assert_cursor_pos(0, 1, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(3, 1, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(8, 1, None);\\n\\n\\n\\n // Check that tabs are expanded if we resize\\n\\n term.resize(4, 80, 4 * 16, 80 * 8);\\n\\n term.cup(0, 1);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(3, 1, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(8, 1, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(16, 1, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(24, 1, None);\\n\\n term.print(\\\"\\\\t\\\");\\n\\n term.assert_cursor_pos(32, 1, None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/c1.rs\",\n \"rank\": 16,\n \"score\": 176791.41971122747\n },\n {\n \"content\": \"#[test]\\n\\nfn test_bs() {\\n\\n let mut term = TestTerm::new(3, 4, 0);\\n\\n term.assert_cursor_pos(0, 0, None);\\n\\n term.print(\\\"\\\\x08\\\");\\n\\n term.assert_cursor_pos(0, 0, Some(\\\"cannot move left of the margin\\\"));\\n\\n term.print(\\\"ab\\\\x08\\\");\\n\\n term.assert_cursor_pos(1, 0, None);\\n\\n // TODO: when we can set the left margin, we should test that here\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/c0.rs\",\n \"rank\": 17,\n \"score\": 176791.41971122747\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lf() {\\n\\n let mut term = TestTerm::new(3, 10, 0);\\n\\n term.print(\\\"hello\\\\n\\\");\\n\\n term.assert_cursor_pos(5, 1, Some(\\\"LF moves vertically only\\\"));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/c0.rs\",\n \"rank\": 18,\n \"score\": 176791.4197112275\n },\n {\n \"content\": \"#[test]\\n\\nfn test_nel() {\\n\\n let mut term = TestTerm::new(4, 4, 0);\\n\\n term.print(\\\"a\\\\r\\\\nb\\\\x1bE\\\");\\n\\n term.assert_cursor_pos(0, 2, None);\\n\\n term.print(\\\"\\\\x1bE\\\");\\n\\n term.assert_cursor_pos(0, 3, None);\\n\\n term.print(\\\"\\\\x1bE\\\");\\n\\n term.assert_cursor_pos(0, 3, None);\\n\\n assert_visible_contents(&term, file!(), line!(), &[\\\"b \\\", \\\" \\\", \\\" \\\", \\\" \\\"]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/c1.rs\",\n \"rank\": 19,\n \"score\": 176791.4197112275\n },\n {\n \"content\": \"#[test]\\n\\nfn test_ri() {\\n\\n let mut term = TestTerm::new(4, 2, 0);\\n\\n term.print(\\\"a\\\\r\\\\nb\\\\r\\\\nc\\\\r\\\\nd.\\\");\\n\\n assert_visible_contents(&term, file!(), line!(), &[\\\"a \\\", \\\"b \\\", \\\"c \\\", \\\"d.\\\"]);\\n\\n term.assert_cursor_pos(1, 3, None);\\n\\n term.print(\\\"\\\\x1bM\\\");\\n\\n term.assert_cursor_pos(1, 2, None);\\n\\n term.print(\\\"\\\\x1bM\\\");\\n\\n term.assert_cursor_pos(1, 1, None);\\n\\n term.print(\\\"\\\\x1bM\\\");\\n\\n term.assert_cursor_pos(1, 0, None);\\n\\n term.print(\\\"\\\\x1bM\\\");\\n\\n term.assert_cursor_pos(1, 0, None);\\n\\n assert_visible_contents(&term, file!(), line!(), &[\\\" \\\", \\\"a \\\", \\\"b \\\", \\\"c \\\"]);\\n\\n}\\n\",\n \"file_path\": \"term/src/test/c1.rs\",\n \"rank\": 20,\n \"score\": 176791.4197112275\n },\n {\n \"content\": \"#[test]\\n\\nfn test_hyperlinks() {\\n\\n let mut term = TestTerm::new(3, 5, 0);\\n\\n let link = Arc::new(Hyperlink::new(\\\"http://example.com\\\"));\\n\\n term.hyperlink(&link);\\n\\n term.print(\\\"hello\\\");\\n\\n term.hyperlink_off();\\n\\n\\n\\n let mut linked = CellAttributes::default();\\n\\n linked.hyperlink = Some(Arc::clone(&link));\\n\\n\\n\\n assert_lines_equal(\\n\\n file!(),\\n\\n line!(),\\n\\n &term.screen().visible_lines(),\\n\\n &[\\n\\n Line::from_text_with_wrapped_last_col(\\\"hello\\\", &linked),\\n\\n Line::from_text(\\\" \\\", &CellAttributes::default()),\\n\\n Line::from_text(\\\" \\\", &CellAttributes::default()),\\n\\n ],\\n\\n Compare::TEXT | Compare::ATTRS,\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 22,\n \"score\": 176791.41971122747\n },\n {\n \"content\": \"#[test]\\n\\nfn test_cr() {\\n\\n let mut term = TestTerm::new(3, 10, 0);\\n\\n term.print(\\\"hello\\\\r\\\");\\n\\n term.assert_cursor_pos(0, 0, Some(\\\"CR moves to left margin on current line\\\"));\\n\\n // TODO: when we can set the left margin, we should test that here\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/c0.rs\",\n \"rank\": 23,\n \"score\": 176791.41971122747\n },\n {\n \"content\": \"#[test]\\n\\nfn test_scrollup() {\\n\\n let mut term = TestTerm::new(2, 1, 4);\\n\\n term.print(\\\"1\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\" \\\"]);\\n\\n assert_eq!(term.screen().visible_row_to_stable_row(0), 0);\\n\\n\\n\\n term.print(\\\"2\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\" \\\"]);\\n\\n assert_eq!(term.screen().visible_row_to_stable_row(0), 1);\\n\\n\\n\\n term.print(\\\"3\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\" \\\"]);\\n\\n assert_eq!(term.screen().visible_row_to_stable_row(0), 2);\\n\\n\\n\\n term.print(\\\"4\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\" \\\"]);\\n\\n assert_eq!(term.screen().visible_row_to_stable_row(0), 3);\\n\\n\\n\\n term.print(\\\"5\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\", \\\" \\\"]);\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 26,\n \"score\": 176791.4197112275\n },\n {\n \"content\": \"#[test]\\n\\nfn test_emoji_with_modifier() {\\n\\n let waving_hand = \\\"\\\\u{1f44b}\\\";\\n\\n let waving_hand_dark_tone = \\\"\\\\u{1f44b}\\\\u{1f3ff}\\\";\\n\\n\\n\\n let mut term = TestTerm::new(3, 5, 0);\\n\\n term.print(waving_hand);\\n\\n term.print(\\\"\\\\r\\\\n\\\");\\n\\n term.print(waving_hand_dark_tone);\\n\\n\\n\\n assert_all_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n &format!(\\\"{} \\\", waving_hand),\\n\\n &format!(\\\"{} \\\", waving_hand_dark_tone),\\n\\n \\\" \\\",\\n\\n ],\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 28,\n \"score\": 172276.3707026871\n },\n {\n \"content\": \"#[test]\\n\\nfn test_scroll_margins() {\\n\\n let mut term = TestTerm::new(3, 1, 10);\\n\\n term.print(\\\"1\\\\n2\\\\n3\\\\n4\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\" \\\"]);\\n\\n\\n\\n let margins = CSI::Cursor(termwiz::escape::csi::Cursor::SetTopAndBottomMargins {\\n\\n top: OneBased::new(1),\\n\\n bottom: OneBased::new(2),\\n\\n });\\n\\n term.print(format!(\\\"{}\\\", margins));\\n\\n\\n\\n term.print(\\\"z\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"z\\\"]);\\n\\n\\n\\n term.print(\\\"a\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"a\\\"]);\\n\\n\\n\\n term.cup(0, 1);\\n\\n term.print(\\\"W\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"1\\\", \\\"2\\\", \\\"3\\\", \\\"W\\\", \\\" \\\", \\\"a\\\"]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 29,\n \"score\": 172276.37070268707\n },\n {\n \"content\": \"#[test]\\n\\nfn test_resize_wrap() {\\n\\n const LINES: usize = 8;\\n\\n let mut term = TestTerm::new(LINES, 4, 0);\\n\\n term.print(\\\"111\\\\r\\\\n2222aa\\\\r\\\\n333\\\\r\\\\n\\\");\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222\\\", \\\"aa \\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\\n );\\n\\n term.resize(LINES, 5, 0, 0);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222a\\\", \\\"a\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 30,\n \"score\": 172276.37070268707\n },\n {\n \"content\": \"fn write_pipe_with_timeout(mut file: FileDescriptor, data: &[u8]) -> anyhow::Result<()> {\\n\\n file.set_non_blocking(true)?;\\n\\n let mut pfd = libc::pollfd {\\n\\n fd: file.as_raw_fd(),\\n\\n events: libc::POLLOUT,\\n\\n revents: 0,\\n\\n };\\n\\n\\n\\n let mut buf = data;\\n\\n\\n\\n while !buf.is_empty() {\\n\\n if unsafe { libc::poll(&mut pfd, 1, 3000) == 1 } {\\n\\n match file.write(buf) {\\n\\n Ok(size) if size == 0 => {\\n\\n bail!(\\\"zero byte write\\\");\\n\\n }\\n\\n Ok(size) => {\\n\\n buf = &buf[size..];\\n\\n }\\n\\n Err(e) => bail!(\\\"error writing to pipe: {}\\\", e),\\n\\n }\\n\\n } else {\\n\\n bail!(\\\"timed out writing to pipe\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"window/src/os/wayland/window.rs\",\n \"rank\": 31,\n \"score\": 170271.42258807234\n },\n {\n \"content\": \"#[test]\\n\\nfn basic_output() {\\n\\n let mut term = TestTerm::new(5, 10, 0);\\n\\n\\n\\n term.cup(1, 1);\\n\\n\\n\\n term.set_auto_wrap(false);\\n\\n term.print(\\\"hello, world!\\\");\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\" \\\",\\n\\n \\\" hello, w!\\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n ],\\n\\n );\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 32,\n \"score\": 163694.8357533798\n },\n {\n \"content\": \"#[test]\\n\\nfn drag_selection() {\\n\\n let mut term = TestTerm::new(3, 12, 0);\\n\\n term.print(\\\"hello world\\\\r\\\\n\\\");\\n\\n assert_visible_contents(&term, &[\\\"hello world \\\", \\\" \\\", \\\" \\\"]);\\n\\n\\n\\n term.drag_select(1, 0, 4, 0);\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"ello\\\");\\n\\n\\n\\n // Now check that we respect double-width boundaries reasonably sanely;\\n\\n // here we're dragging from the middle of the skull emoji\\n\\n term.print(\\\"\\\\u{1F480}skull\\\\r\\\\n\\\");\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n &[\\\"hello world \\\", \\\"\\\\u{1F480}skull \\\", \\\" \\\"],\\n\\n );\\n\\n term.drag_select(1, 1, 5, 1);\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"skul\\\");\\n\\n\\n\\n // Let's include the start of it this time\\n\\n term.drag_select(0, 1, 5, 1);\\n\",\n \"file_path\": \"term/src/test/selection.rs\",\n \"rank\": 33,\n \"score\": 163694.8357533798\n },\n {\n \"content\": \"#[test]\\n\\nfn selection_in_scrollback() {\\n\\n let mut term = TestTerm::new(2, 2, 4);\\n\\n term.print(\\\"1 2 3 4\\\");\\n\\n assert_all_contents(&term, &[\\\"1 \\\", \\\"2 \\\", \\\"3 \\\", \\\"4 \\\"]);\\n\\n\\n\\n // Scroll back one line\\n\\n term.scroll_viewport(-1);\\n\\n term.assert_viewport_contents(&[\\\"2 \\\", \\\"3 \\\"]);\\n\\n\\n\\n term.click_n(0, 0, MouseButton::Left, 2);\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"2\\\");\\n\\n\\n\\n // Clear the click streak\\n\\n term.click_n(0, 1, MouseButton::Right, 1);\\n\\n\\n\\n term.click_n(0, 1, MouseButton::Left, 3);\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"3\\\");\\n\\n\\n\\n term.drag_select(0, 0, 0, 1);\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"2\\\\n3\\\");\\n\\n}\\n\",\n \"file_path\": \"term/src/test/selection.rs\",\n \"rank\": 34,\n \"score\": 163694.8357533798\n },\n {\n \"content\": \"#[test]\\n\\nfn double_click_selection() {\\n\\n let mut term = TestTerm::new(3, 10, 0);\\n\\n term.print(\\\"hello world\\\");\\n\\n\\n\\n term.click_n(1, 0, MouseButton::Left, 2);\\n\\n\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"hello\\\");\\n\\n}\\n\\n\\n\\n/// Test triple click to select a line\\n\",\n \"file_path\": \"term/src/test/selection.rs\",\n \"rank\": 35,\n \"score\": 158958.6341923695\n },\n {\n \"content\": \"#[test]\\n\\nfn cursor_movement_damage() {\\n\\n let mut term = TestTerm::new(2, 3, 0);\\n\\n\\n\\n term.print(\\\"fooo.\\\");\\n\\n assert_visible_contents(&term, file!(), line!(), &[\\\"foo\\\", \\\"o. \\\"]);\\n\\n term.assert_cursor_pos(2, 1, None);\\n\\n term.assert_dirty_lines(&[0, 1], None);\\n\\n\\n\\n term.cup(0, 1);\\n\\n term.clean_dirty_lines();\\n\\n term.print(\\\"\\\\x08\\\");\\n\\n term.assert_cursor_pos(0, 1, Some(\\\"BS doesn't change the line\\\"));\\n\\n term.assert_dirty_lines(&[1], None);\\n\\n term.clean_dirty_lines();\\n\\n\\n\\n term.cup(0, 0);\\n\\n term.assert_dirty_lines(&[0, 1], Some(\\\"cursor movement dirties old and new lines\\\"));\\n\\n}\\n\\n\\n\\n/// Replicates a bug I initially found via:\\n\\n/// $ vim\\n\\n/// :help\\n\\n/// PageDown\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 36,\n \"score\": 158958.6341923695\n },\n {\n \"content\": \"#[test]\\n\\nfn triple_click_selection() {\\n\\n let mut term = TestTerm::new(3, 10, 0);\\n\\n term.print(\\\"hello world\\\");\\n\\n assert_visible_contents(&term, &[\\\"hello worl\\\", \\\"d \\\", \\\" \\\"]);\\n\\n term.click_n(1, 0, MouseButton::Left, 3);\\n\\n\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"hello worl\\\");\\n\\n}\\n\\n\\n\\n/// Test double click on wrapped line selects across the line boundary\\n\",\n \"file_path\": \"term/src/test/selection.rs\",\n \"rank\": 37,\n \"score\": 158958.6341923695\n },\n {\n \"content\": \"#[test]\\n\\nfn double_click_wrapped_selection() {\\n\\n let mut term = TestTerm::new(3, 10, 0);\\n\\n term.print(\\\"hello world\\\");\\n\\n assert_visible_contents(&term, &[\\\"hello worl\\\", \\\"d \\\", \\\" \\\"]);\\n\\n term.click_n(7, 0, MouseButton::Left, 2);\\n\\n\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"world\\\");\\n\\n}\\n\\n\\n\\n/// Make sure that we adjust for the viewport offset when scrolling\\n\",\n \"file_path\": \"term/src/test/selection.rs\",\n \"rank\": 38,\n \"score\": 154558.4110320304\n },\n {\n \"content\": \"fn csi_u_encode(buf: &mut String, c: char, mods: KeyModifiers) -> Result<(), Error> {\\n\\n if ENABLE_CSI_U {\\n\\n write!(buf, \\\"\\\\x1b[{};{}u\\\", c as u32, 1 + encode_modifiers(mods))?;\\n\\n } else {\\n\\n // FIXME: this ignores the modifiers completely. That's sort of\\n\\n // OK, but eg: CTRL-SPACE should really send a NUL byte in that\\n\\n // case, so this isn't great\\n\\n write!(buf, \\\"{}\\\", c)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/terminalstate.rs\",\n \"rank\": 39,\n \"score\": 135389.85977449562\n },\n {\n \"content\": \"pub fn poll_for_read(pfd: &mut [pollfd]) {\\n\\n if let Err(e) = poll(pfd, None) {\\n\\n log::error!(\\\"poll failed for {}\\\", e);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/server/pollable.rs\",\n \"rank\": 40,\n \"score\": 127926.13658303104\n },\n {\n \"content\": \"fn open_log(path: PathBuf) -> anyhow::Result<File> {\\n\\n create_user_owned_dirs(\\n\\n path.parent()\\n\\n .ok_or_else(|| anyhow!(\\\"path {} has no parent dir!?\\\", path.display()))?,\\n\\n )?;\\n\\n let mut options = OpenOptions::new();\\n\\n options.write(true).create(true).append(true);\\n\\n options\\n\\n .open(&path)\\n\\n .map_err(|e| anyhow!(\\\"failed to open log stream: {}: {}\\\", path.display(), e))\\n\\n}\\n\\n\\n\\nimpl DaemonOptions {\\n\\n #[cfg_attr(windows, allow(dead_code))]\\n\\n pub fn pid_file(&self) -> PathBuf {\\n\\n self.pid_file\\n\\n .as_ref()\\n\\n .cloned()\\n\\n .unwrap_or_else(|| RUNTIME_DIR.join(\\\"pid\\\"))\\n\\n }\\n\",\n \"file_path\": \"src/config/daemon.rs\",\n \"rank\": 41,\n \"score\": 119403.76991182395\n },\n {\n \"content\": \"fn consume_stream<F: Read, T: Write>(mut from_stream: F, mut to_stream: T) -> anyhow::Result<()> {\\n\\n let mut buf = [0u8; 8192];\\n\\n\\n\\n loop {\\n\\n let size = from_stream.read(&mut buf)?;\\n\\n if size == 0 {\\n\\n break;\\n\\n }\\n\\n to_stream.write_all(&buf[0..size])?;\\n\\n to_stream.flush()?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 42,\n \"score\": 117251.60003303044\n },\n {\n \"content\": \"fn default_term() -> String {\\n\\n \\\"xterm-256color\\\".into()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 43,\n \"score\": 117053.10838549751\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn use_default_configuration() {\\n\\n CONFIG.use_defaults();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 44,\n \"score\": 114267.79590253005\n },\n {\n \"content\": \"fn default_scrollback_lines() -> usize {\\n\\n 3500\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 45,\n \"score\": 114204.49200503716\n },\n {\n \"content\": \"struct TestTerm {\\n\\n term: Terminal,\\n\\n host: TestHost,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 46,\n \"score\": 112134.43516741035\n },\n {\n \"content\": \"fn main() -> anyhow::Result<()> {\\n\\n println!(\\\"Type `exit` to quit this example, or start a word with `h` and press Tab.\\\");\\n\\n let mut terminal = line_editor_terminal()?;\\n\\n let mut editor = LineEditor::new(&mut terminal);\\n\\n\\n\\n let mut host = Host::default();\\n\\n loop {\\n\\n if let Some(line) = editor.read_line(&mut host)? {\\n\\n println!(\\\"read line: {:?}\\\", line);\\n\\n if line == \\\"exit\\\" {\\n\\n break;\\n\\n }\\n\\n\\n\\n host.history().add(&line);\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"termwiz/examples/line_editor.rs\",\n \"rank\": 47,\n \"score\": 111350.13576929475\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct TestTermConfig {\\n\\n scrollback: usize,\\n\\n}\\n\\nimpl TerminalConfiguration for TestTermConfig {\\n\\n fn scrollback_size(&self) -> usize {\\n\\n self.scrollback\\n\\n }\\n\\n\\n\\n fn color_palette(&self) -> ColorPalette {\\n\\n ColorPalette::default()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TestTerm {\\n\\n fn new(height: usize, width: usize, scrollback: usize) -> Self {\\n\\n let mut term = Terminal::new(\\n\\n height,\\n\\n width,\\n\\n height * 16,\\n\\n width * 8,\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 48,\n \"score\": 109411.96429988781\n },\n {\n \"content\": \"/// This is a conceptually simple function that computes the bounds\\n\\n/// of the whitespace delimited word at the specified cursor position\\n\\n/// in the supplied line string.\\n\\n/// It returns the range and the corresponding slice out of the line.\\n\\n/// This function is sufficient for example purposes; in a real application\\n\\n/// the equivalent function would need to be aware of quoting and other\\n\\n/// application specific context.\\n\\nfn word_at_cursor(line: &str, cursor_position: usize) -> Option<(std::ops::Range<usize>, &str)> {\\n\\n let char_indices: Vec<(usize, char)> = line.char_indices().collect();\\n\\n if char_indices.is_empty() {\\n\\n return None;\\n\\n }\\n\\n let char_position = char_indices\\n\\n .iter()\\n\\n .position(|(idx, _)| *idx == cursor_position)\\n\\n .unwrap_or(char_indices.len());\\n\\n\\n\\n // Look back until we find whitespace\\n\\n let mut start_position = char_position;\\n\\n while start_position > 0\\n\\n && start_position <= char_indices.len()\\n\\n && !char_indices[start_position - 1].1.is_whitespace()\\n\\n {\\n\\n start_position -= 1;\\n\\n }\\n\\n\\n\\n // Look forwards until we find whitespace\\n\",\n \"file_path\": \"termwiz/examples/line_editor.rs\",\n \"rank\": 49,\n \"score\": 109104.05821308118\n },\n {\n \"content\": \"/// Create a pair of connected sockets\\n\\n///\\n\\n/// This implementation creates a pair of SOCK_STREAM sockets.\\n\\npub fn socketpair() -> anyhow::Result<(FileDescriptor, FileDescriptor)> {\\n\\n socketpair_impl()\\n\\n}\\n\",\n \"file_path\": \"filedescriptor/src/lib.rs\",\n \"rank\": 50,\n \"score\": 108473.65640187665\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"linux\\\"))]\\n\\n#[doc(hidden)]\\n\\npub fn socketpair_impl() -> anyhow::Result<(FileDescriptor, FileDescriptor)> {\\n\\n let mut fds = [-1i32; 2];\\n\\n let res = unsafe { libc::socketpair(libc::PF_LOCAL, libc::SOCK_STREAM, 0, fds.as_mut_ptr()) };\\n\\n if res == -1 {\\n\\n bail!(\\n\\n \\\"failed to create a socketpair: {:?}\\\",\\n\\n std::io::Error::last_os_error()\\n\\n )\\n\\n } else {\\n\\n let mut read = FileDescriptor {\\n\\n handle: OwnedHandle {\\n\\n handle: fds[0],\\n\\n handle_type: (),\\n\\n },\\n\\n };\\n\\n let mut write = FileDescriptor {\\n\\n handle: OwnedHandle {\\n\\n handle: fds[1],\\n\\n handle_type: (),\\n\\n },\\n\\n };\\n\\n read.handle.cloexec()?;\\n\\n write.handle.cloexec()?;\\n\\n Ok((read, write))\\n\\n }\\n\\n}\\n\\n\\n\\npub use libc::{pollfd, POLLERR, POLLHUP, POLLIN, POLLOUT};\\n\\nuse std::time::Duration;\\n\\n\\n\",\n \"file_path\": \"filedescriptor/src/unix.rs\",\n \"rank\": 51,\n \"score\": 106272.86670100283\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub fn socketpair_impl() -> anyhow::Result<(FileDescriptor, FileDescriptor)> {\\n\\n init_winsock();\\n\\n\\n\\n let s = socket(AF_INET, SOCK_STREAM, 0)?;\\n\\n\\n\\n let mut in_addr: SOCKADDR_IN = unsafe { std::mem::zeroed() };\\n\\n in_addr.sin_family = AF_INET as _;\\n\\n unsafe {\\n\\n *in_addr.sin_addr.S_un.S_addr_mut() = htonl(INADDR_LOOPBACK);\\n\\n }\\n\\n\\n\\n unsafe {\\n\\n if bind(\\n\\n s.as_raw_handle() as _,\\n\\n std::mem::transmute(&in_addr),\\n\\n std::mem::size_of_val(&in_addr) as _,\\n\\n ) != 0\\n\\n {\\n\\n bail!(\\\"bind failed: {}\\\", IoError::last_os_error());\\n\\n }\\n\",\n \"file_path\": \"filedescriptor/src/windows.rs\",\n \"rank\": 52,\n \"score\": 106272.86670100283\n },\n {\n \"content\": \"fn default_ratelimit_line_prefetches_per_second() -> u32 {\\n\\n 10\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/config/mod.rs\",\n \"rank\": 53,\n \"score\": 105977.75519086001\n },\n {\n \"content\": \"/// characters that when masked for CTRL could be an ascii control character\\n\\n/// or could be a key that a user legitimately wants to process in their\\n\\n/// terminal application\\n\\nfn is_ambiguous_ascii_ctrl(c: char) -> bool {\\n\\n match c {\\n\\n 'i' | 'I' | 'm' | 'M' | '[' | '{' | '@' => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TerminalState {\\n\\n pub fn new(\\n\\n physical_rows: usize,\\n\\n physical_cols: usize,\\n\\n pixel_width: usize,\\n\\n pixel_height: usize,\\n\\n config: Arc<dyn TerminalConfiguration>,\\n\\n ) -> TerminalState {\\n\\n let screen = ScreenOrAlt::new(physical_rows, physical_cols, &config);\\n\\n\\n\\n TerminalState {\\n\\n config,\\n\\n screen,\\n\",\n \"file_path\": \"term/src/terminalstate.rs\",\n \"rank\": 54,\n \"score\": 105744.37411514229\n },\n {\n \"content\": \"/// Adjust the color to make it appear disabled.\\n\\n/// This is not defined on RgbColor itself in order\\n\\n/// to avoid termwiz requiring a dep on the palette crate.\\n\\nfn grey_out(color: RgbColor) -> RgbColor {\\n\\n use palette::{Blend, Lch, Saturate, Srgba};\\n\\n let color = Srgba::new(color.red, color.green, color.blue, 0xff);\\n\\n let color: Srgba = color.into_format();\\n\\n let color = color.into_linear();\\n\\n\\n\\n let desaturated = Lch::from(color).desaturate(0.2);\\n\\n\\n\\n let tint = Srgba::new(0.2, 0.2, 0.2, 0.6).into_linear();\\n\\n let result = Srgba::from_linear(tint.over(desaturated.into()));\\n\\n let result = Srgba::<u8>::from_format(result);\\n\\n\\n\\n RgbColor::new(result.red, result.green, result.blue)\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Palette256 {\\n\\n fn fmt(&self, fmt: &mut fmt::Formatter) -> Result<(), fmt::Error> {\\n\\n // If we wanted to dump all of the entries, we'd use this:\\n\\n // self.0[..].fmt(fmt)\\n\\n // However, we typically don't care about those and we're interested\\n\",\n \"file_path\": \"term/src/color.rs\",\n \"rank\": 55,\n \"score\": 103018.73379774296\n },\n {\n \"content\": \"fn encode_modifiers(mods: KeyModifiers) -> u8 {\\n\\n let mut number = 0;\\n\\n if mods.contains(KeyModifiers::SHIFT) {\\n\\n number |= 1;\\n\\n }\\n\\n if mods.contains(KeyModifiers::ALT) {\\n\\n number |= 2;\\n\\n }\\n\\n if mods.contains(KeyModifiers::CTRL) {\\n\\n number |= 4;\\n\\n }\\n\\n number\\n\\n}\\n\\n\\n\\n// FIXME: provide an option to enable this, because it is super annoying\\n\\n// in vim when accidentally pressing shift-space and it emits a sequence\\n\\n// that undoes some number of commands\\n\\nconst ENABLE_CSI_U: bool = false;\\n\\n\\n\",\n \"file_path\": \"term/src/terminalstate.rs\",\n \"rank\": 56,\n \"score\": 103018.73379774296\n },\n {\n \"content\": \"fn emit_padding_for_terminal(len: usize, spacer: &CellAttributes, output: &mut Vec<Change>) {\\n\\n if len == 0 {\\n\\n return;\\n\\n }\\n\\n output.push(Change::AllAttributes(spacer.clone()));\\n\\n let mut s = String::new();\\n\\n for _ in 0..len {\\n\\n s.push(' ');\\n\\n }\\n\\n output.push(s.into());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tabout/src/lib.rs\",\n \"rank\": 57,\n \"score\": 102829.11766008072\n },\n {\n \"content\": \"pub fn use_ime(enable: bool) {\\n\\n USE_IME.store(enable, Ordering::Relaxed);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"window/src/os/macos/window.rs\",\n \"rank\": 58,\n \"score\": 100801.66324230288\n },\n {\n \"content\": \"fn linear_f32_to_srgb8_using_table(f: f32) -> u8 {\\n\\n let minval = f32::from_bits(MINVAL);\\n\\n let almost_one = f32::from_bits(ALMOST_ONE);\\n\\n\\n\\n let f = if f < minval {\\n\\n minval\\n\\n } else if f > almost_one {\\n\\n almost_one\\n\\n } else {\\n\\n f\\n\\n };\\n\\n\\n\\n let f_bits = f.to_bits();\\n\\n let tab = unsafe { *F32_TO_U8_TABLE.get_unchecked(((f_bits - MINVAL) >> 20) as usize) };\\n\\n let bias = (tab >> 16) << 9;\\n\\n let scale = tab & 0xffff;\\n\\n\\n\\n let t = (f_bits >> 12) & 0xff;\\n\\n\\n\\n ((bias + scale * t) >> 16) as u8\\n\\n}\\n\\n\\n\",\n \"file_path\": \"window/src/color.rs\",\n \"rank\": 59,\n \"score\": 100801.66324230288\n },\n {\n \"content\": \"/// Examines a set of FileDescriptors to see if some of them are ready for I/O,\\n\\n/// or if certain events have occurred on them.\\n\\n///\\n\\n/// This uses the system native readiness checking mechanism, which on Windows\\n\\n/// means that it does NOT use IOCP and that this only works with sockets on\\n\\n/// Windows. If you need IOCP then the `mio` crate is recommended for a much\\n\\n/// more scalable solution.\\n\\n///\\n\\n/// On macOS, the `poll(2)` implementation has problems when used with eg: pty\\n\\n/// descriptors, so this implementation of poll uses the `select(2)` interface\\n\\n/// under the covers. That places a limit on the maximum file descriptor value\\n\\n/// that can be passed to poll. If a file descriptor is out of range then an\\n\\n/// error will returned. This limitation could potentially be lifted in the\\n\\n/// future.\\n\\n///\\n\\n/// On Windows, `WSAPoll` is used to implement readiness checking, which has\\n\\n/// the consequence that it can only be used with sockets.\\n\\n///\\n\\n/// If `duration` is `None`, then `poll` will block until any of the requested\\n\\n/// events are ready. Otherwise, `duration` specifies how long to wait for\\n\\n/// readiness before giving up.\\n\\n///\\n\\n/// The return value is the number of entries that were satisfied; `0` means\\n\\n/// that none were ready after waiting for the specified duration.\\n\\n///\\n\\n/// The `pfd` array is mutated and the `revents` field is updated to indicate\\n\\n/// which of the events were received.\\n\\npub fn poll(pfd: &mut [pollfd], duration: Option<Duration>) -> anyhow::Result<usize> {\\n\\n poll_impl(pfd, duration)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"filedescriptor/src/lib.rs\",\n \"rank\": 60,\n \"score\": 100629.55070995117\n },\n {\n \"content\": \"/// Read a single leb128 encoded value from the stream\\n\\nfn read_u64<R: std::io::Read>(mut r: R) -> anyhow::Result<u64> {\\n\\n leb128::read::unsigned(&mut r)\\n\\n .map_err(|err| match err {\\n\\n leb128::read::Error::IoError(ioerr) => anyhow::Error::new(ioerr),\\n\\n err => anyhow::Error::new(err),\\n\\n })\\n\\n .context(\\\"reading leb128\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/server/codec.rs\",\n \"rank\": 61,\n \"score\": 100615.83608699101\n },\n {\n \"content\": \"/// Decode a frame.\\n\\n/// See encode_raw() for the frame format.\\n\\nfn decode_raw<R: std::io::Read>(mut r: R) -> anyhow::Result<Decoded> {\\n\\n let len = read_u64(r.by_ref()).context(\\\"reading PDU length\\\")?;\\n\\n let (len, is_compressed) = if (len & COMPRESSED_MASK) != 0 {\\n\\n (len & !COMPRESSED_MASK, true)\\n\\n } else {\\n\\n (len, false)\\n\\n };\\n\\n let serial = read_u64(r.by_ref()).context(\\\"reading PDU serial\\\")?;\\n\\n let ident = read_u64(r.by_ref()).context(\\\"reading PDU ident\\\")?;\\n\\n let data_len = len as usize - (encoded_length(ident) + encoded_length(serial));\\n\\n\\n\\n if is_compressed {\\n\\n metrics::value!(\\\"pdu.decode.compressed.size\\\", data_len as u64);\\n\\n } else {\\n\\n metrics::value!(\\\"pdu.decode.size\\\", data_len as u64);\\n\\n }\\n\\n\\n\\n let mut data = vec![0u8; data_len];\\n\\n r.read_exact(&mut data).with_context(|| {\\n\\n format!(\\n\",\n \"file_path\": \"src/server/codec.rs\",\n \"rank\": 62,\n \"score\": 100615.83608699101\n },\n {\n \"content\": \"struct TestHost {}\\n\\n\\n\\nimpl TestHost {\\n\\n fn new() -> Self {\\n\\n Self {}\\n\\n }\\n\\n}\\n\\n\\n\\nimpl std::io::Write for TestHost {\\n\\n fn write(&mut self, _buf: &[u8]) -> Result<usize, std::io::Error> {\\n\\n panic!(\\\"no writer support in TestHost\\\");\\n\\n }\\n\\n fn flush(&mut self) -> Result<(), std::io::Error> {\\n\\n panic!(\\\"no writer support in TestHost\\\");\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 63,\n \"score\": 99120.10965244782\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub fn poll_impl(pfd: &mut [pollfd], duration: Option<Duration>) -> anyhow::Result<usize> {\\n\\n let poll_result = unsafe {\\n\\n WSAPoll(\\n\\n pfd.as_mut_ptr(),\\n\\n pfd.len() as _,\\n\\n duration\\n\\n .map(|wait| wait.as_millis() as libc::c_int)\\n\\n .unwrap_or(-1),\\n\\n )\\n\\n };\\n\\n if poll_result < 0 {\\n\\n Err(std::io::Error::last_os_error().into())\\n\\n } else {\\n\\n Ok(poll_result as usize)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use std::io::{Read, Write};\\n\",\n \"file_path\": \"filedescriptor/src/windows.rs\",\n \"rank\": 64,\n \"score\": 98743.77729103202\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"macos\\\"))]\\n\\n#[doc(hidden)]\\n\\npub fn poll_impl(pfd: &mut [pollfd], duration: Option<Duration>) -> anyhow::Result<usize> {\\n\\n let poll_result = unsafe {\\n\\n libc::poll(\\n\\n pfd.as_mut_ptr(),\\n\\n pfd.len() as _,\\n\\n duration\\n\\n .map(|wait| wait.as_millis() as libc::c_int)\\n\\n .unwrap_or(-1),\\n\\n )\\n\\n };\\n\\n if poll_result < 0 {\\n\\n Err(std::io::Error::last_os_error().into())\\n\\n } else {\\n\\n Ok(poll_result as usize)\\n\\n }\\n\\n}\\n\\n\\n\\n// macOS has a broken poll(2) implementation, so we introduce a layer to deal with that here\\n\\n#[cfg(target_os = \\\"macos\\\")]\\n\\nmod macos {\\n\",\n \"file_path\": \"filedescriptor/src/unix.rs\",\n \"rank\": 65,\n \"score\": 98743.77729103202\n },\n {\n \"content\": \"fn read_from_tab_pty(tab_id: TabId, mut reader: Box<dyn std::io::Read>) {\\n\\n const BUFSIZE: usize = 32 * 1024;\\n\\n let mut buf = [0; BUFSIZE];\\n\\n\\n\\n let mut lim = RateLimiter::new(|config| config.ratelimit_output_bytes_per_second);\\n\\n\\n\\n loop {\\n\\n match reader.read(&mut buf) {\\n\\n Ok(size) if size == 0 => {\\n\\n error!(\\\"read_pty EOF: tab_id {}\\\", tab_id);\\n\\n break;\\n\\n }\\n\\n Err(err) => {\\n\\n error!(\\\"read_pty failed: tab {} {:?}\\\", tab_id, err);\\n\\n break;\\n\\n }\\n\\n Ok(size) => {\\n\\n let buf = &buf[..size];\\n\\n let mut pos = 0;\\n\\n\\n\",\n \"file_path\": \"src/mux/mod.rs\",\n \"rank\": 66,\n \"score\": 97230.86505699012\n },\n {\n \"content\": \"pub fn allocate(width: usize, height: usize) -> (TermWizTerminal, TermWizTerminalTab) {\\n\\n let (render_tx, render_rx) = channel();\\n\\n let (input_tx, input_rx) = channel();\\n\\n\\n\\n let tw_term = TermWizTerminal {\\n\\n render_tx,\\n\\n input_rx,\\n\\n screen_size: ScreenSize {\\n\\n cols: width,\\n\\n rows: height,\\n\\n xpixel: 0,\\n\\n ypixel: 0,\\n\\n },\\n\\n };\\n\\n\\n\\n let domain_id = 0;\\n\\n let tab = TermWizTerminalTab::new(domain_id, width, height, input_tx, render_rx);\\n\\n (tw_term, tab)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/termwiztermtab.rs\",\n \"rank\": 67,\n \"score\": 97128.30741846663\n },\n {\n \"content\": \"\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\\"111\\\", \\\"aaa\\\", \\\" \\\", \\\" \\\", \\\"bbb\\\"],\\n\\n );\\n\\n term.assert_dirty_lines(&[1, 2, 3], None);\\n\\n\\n\\n // expand the scroll region to fill the screen\\n\\n term.set_scroll_region(0, 4);\\n\\n term.clean_dirty_lines();\\n\\n term.delete_lines(1);\\n\\n\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\\"111\\\", \\\" \\\", \\\" \\\", \\\"bbb\\\", \\\" \\\"],\\n\\n );\\n\\n term.assert_dirty_lines(&[1, 2, 3, 4], None);\\n\\n}\\n\\n\\n\\n/// Test the behavior of wrapped lines when we resize the terminal\\n\\n/// wider and then narrower.\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 68,\n \"score\": 93156.81608048585\n },\n {\n \"content\": \" &[\\\"111\\\", \\\"444\\\", \\\"555\\\", \\\" \\\", \\\" \\\"],\\n\\n );\\n\\n term.assert_dirty_lines(&[1, 2, 3, 4], None);\\n\\n term.clean_dirty_lines();\\n\\n\\n\\n term.cup(0, 3);\\n\\n term.print(\\\"aaa\\\\r\\\\nbbb\\\");\\n\\n term.cup(0, 1);\\n\\n term.clean_dirty_lines();\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\\"111\\\", \\\"444\\\", \\\"555\\\", \\\"aaa\\\", \\\"bbb\\\"],\\n\\n );\\n\\n\\n\\n // test with a scroll region smaller than the screen\\n\\n term.set_scroll_region(1, 3);\\n\\n print_all_lines(&term);\\n\\n term.delete_lines(2);\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 69,\n \"score\": 93156.08543655663\n },\n {\n \"content\": \" reason\\n\\n );\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Deref for TestTerm {\\n\\n type Target = Terminal;\\n\\n\\n\\n fn deref(&self) -> &Terminal {\\n\\n &self.term\\n\\n }\\n\\n}\\n\\n\\n\\nimpl DerefMut for TestTerm {\\n\\n fn deref_mut(&mut self) -> &mut Terminal {\\n\\n &mut self.term\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 70,\n \"score\": 93153.92944312253\n },\n {\n \"content\": \"use super::*;\\n\\nuse pretty_assertions::assert_eq;\\n\\n\\n\\n/// Test basic dragging to select some text\\n\\n#[test]\\n\",\n \"file_path\": \"term/src/test/selection.rs\",\n \"rank\": 71,\n \"score\": 93152.41188910279\n },\n {\n \"content\": \"//! Testing C0 control characters\\n\\n\\n\\nuse super::*;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"term/src/test/c0.rs\",\n \"rank\": 72,\n \"score\": 93152.40793970044\n },\n {\n \"content\": \"//! Testing C1 control sequences\\n\\n\\n\\nuse super::*;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"term/src/test/c1.rs\",\n \"rank\": 73,\n \"score\": 93152.40793970044\n },\n {\n \"content\": \" Arc::new(TestTermConfig { scrollback }),\\n\\n );\\n\\n let clip: Arc<dyn Clipboard> = Arc::new(LocalClip::new());\\n\\n term.set_clipboard(&clip);\\n\\n\\n\\n let mut term = Self {\\n\\n term,\\n\\n host: TestHost::new(),\\n\\n };\\n\\n\\n\\n term.set_auto_wrap(true);\\n\\n\\n\\n term\\n\\n }\\n\\n\\n\\n fn print<B: AsRef<[u8]>>(&mut self, bytes: B) {\\n\\n self.term.advance_bytes(bytes, &mut self.host);\\n\\n }\\n\\n\\n\\n #[allow(dead_code)]\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 75,\n \"score\": 93151.84668969616\n },\n {\n \"content\": \"//! Various tests of the terminal model and escape sequence\\n\\n//! processing routines.\\n\\n\\n\\nuse super::*;\\n\\nmod c0;\\n\\nuse bitflags::bitflags;\\n\\nmod c1;\\n\\nmod csi;\\n\\n// mod selection; FIXME: port to render layer\\n\\nuse crate::color::ColorPalette;\\n\\nuse pretty_assertions::assert_eq;\\n\\nuse std::cell::RefCell;\\n\\nuse std::sync::Arc;\\n\\nuse termwiz::escape::csi::{Edit, EraseInDisplay, EraseInLine};\\n\\nuse termwiz::escape::{OneBased, OperatingSystemCommand, CSI};\\n\\nuse termwiz::surface::CursorShape;\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 76,\n \"score\": 93150.89985944514\n },\n {\n \"content\": \" let otherlink = Arc::new(Hyperlink::new_with_id(\\\"http://example.com/other\\\", \\\"w00t\\\"));\\n\\n\\n\\n // Switching link and turning it off\\n\\n term.hyperlink(&otherlink);\\n\\n term.print(\\\"wo\\\");\\n\\n // soft reset also disables hyperlink attribute\\n\\n term.soft_reset();\\n\\n term.print(\\\"00t\\\");\\n\\n\\n\\n let mut partial_line =\\n\\n Line::from_text_with_wrapped_last_col(\\\"wo00t\\\", &CellAttributes::default());\\n\\n partial_line.set_cell(\\n\\n 0,\\n\\n Cell::new(\\n\\n 'w',\\n\\n CellAttributes::default()\\n\\n .set_hyperlink(Some(Arc::clone(&otherlink)))\\n\\n .clone(),\\n\\n ),\\n\\n );\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 77,\n \"score\": 93149.34020892378\n },\n {\n \"content\": \" );\\n\\n term.resize(LINES, 6, 0, 0);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222aa\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\\n );\\n\\n term.resize(LINES, 7, 0, 0);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222aa\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\\n );\\n\\n term.resize(LINES, 8, 0, 0);\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 78,\n \"score\": 93148.61943205952\n },\n {\n \"content\": \" file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n ],\\n\\n );\\n\\n\\n\\n term.cup(0, 2);\\n\\n term.print(\\\"woot\\\");\\n\\n term.cup(2, 2);\\n\\n term.erase_in_line(EraseInLine::EraseToEndOfLine);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 79,\n \"score\": 93148.61943205952\n },\n {\n \"content\": \" assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222aa\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\\n );\\n\\n term.resize(LINES, 5, 0, 0);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222a\\\", \\\"a\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\\n );\\n\\n term.resize(LINES, 4, 0, 0);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\\"111 \\\", \\\"2222\\\", \\\"aa\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\"],\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 80,\n \"score\": 93148.48802199158\n },\n {\n \"content\": \" assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222aa\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\\n );\\n\\n\\n\\n // Resize smaller again\\n\\n term.resize(LINES, 7, 0, 0);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\"111 \\\", \\\"2222aa\\\", \\\"333 \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\",\\n\\n ],\\n\\n );\\n\\n term.resize(LINES, 6, 0, 0);\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 81,\n \"score\": 93148.24973923026\n },\n {\n \"content\": \" );\\n\\n\\n\\n term.hyperlink(&link);\\n\\n term.print(\\\"he\\\");\\n\\n // Resetting pen should not reset the link\\n\\n term.print(\\\"\\\\x1b[m\\\");\\n\\n term.print(\\\"y!!\\\");\\n\\n\\n\\n assert_lines_equal(\\n\\n file!(),\\n\\n line!(),\\n\\n &term.screen().visible_lines(),\\n\\n &[\\n\\n Line::from_text_with_wrapped_last_col(\\\"hello\\\", &linked),\\n\\n Line::from_text_with_wrapped_last_col(\\\"hey!!\\\", &linked),\\n\\n \\\" \\\".into(),\\n\\n ],\\n\\n Compare::TEXT | Compare::ATTRS,\\n\\n );\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 82,\n \"score\": 93147.86681099296\n },\n {\n \"content\": \" assert_eq!(term.screen().visible_row_to_stable_row(0), 4);\\n\\n\\n\\n term.print(\\\"6\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"2\\\", \\\"3\\\", \\\"4\\\", \\\"5\\\", \\\"6\\\", \\\" \\\"]);\\n\\n assert_eq!(term.screen().visible_row_to_stable_row(0), 5);\\n\\n\\n\\n term.print(\\\"7\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"3\\\", \\\"4\\\", \\\"5\\\", \\\"6\\\", \\\"7\\\", \\\" \\\"]);\\n\\n assert_eq!(term.screen().visible_row_to_stable_row(0), 6);\\n\\n\\n\\n term.print(\\\"8\\\\n\\\");\\n\\n assert_all_contents(&term, file!(), line!(), &[\\\"4\\\", \\\"5\\\", \\\"6\\\", \\\"7\\\", \\\"8\\\", \\\" \\\"]);\\n\\n assert_eq!(term.screen().visible_row_to_stable_row(0), 7);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 83,\n \"score\": 93147.37662957575\n },\n {\n \"content\": \" assert_eq!(term.get_clipboard().unwrap(), \\\"\\\\u{1F480}skul\\\");\\n\\n\\n\\n // Multi-line selection\\n\\n term.drag_select(1, 0, 6, 1);\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"ello world\\\\n\\\\u{1F480}skull\\\");\\n\\n\\n\\n // This next one drags off the bottom; this is technically out of bounds\\n\\n // but we want to make sure we handle this without panicking. See the\\n\\n // comment in TerminalState::mouse_event for more info.\\n\\n term.drag_select(0, 0, 15, 3);\\n\\n assert_eq!(\\n\\n term.get_clipboard().unwrap(),\\n\\n \\\"hello world\\\\n\\\\u{1F480}skull\\\\n\\\"\\n\\n );\\n\\n\\n\\n term.drag_select(6, 0, 3, 1);\\n\\n assert_eq!(term.get_clipboard().unwrap(), \\\"world\\\\n\\\\u{1F480}sk\\\");\\n\\n}\\n\\n\\n\\n/// Test double click to select a word\\n\",\n \"file_path\": \"term/src/test/selection.rs\",\n \"rank\": 84,\n \"score\": 93147.28869964382\n },\n {\n \"content\": \" \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\"wo \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n ],\\n\\n );\\n\\n\\n\\n term.erase_in_line(EraseInLine::EraseToStartOfLine);\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n ],\\n\\n );\\n\\n}\\n\\n\\n\\n/// Ensure that we dirty lines as the cursor is moved around, otherwise\\n\\n/// the renderer won't draw the cursor in the right place\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 85,\n \"score\": 93147.21822048264\n },\n {\n \"content\": \"\\n\\n fn cup(&mut self, col: isize, row: isize) {\\n\\n self.print(CSI);\\n\\n self.print(format!(\\\"{};{}H\\\", row + 1, col + 1));\\n\\n }\\n\\n\\n\\n fn hvp(&mut self, col: isize, row: isize) {\\n\\n self.print(CSI);\\n\\n self.print(format!(\\\"{};{}f\\\", row + 1, col + 1));\\n\\n }\\n\\n\\n\\n fn erase_in_display(&mut self, erase: EraseInDisplay) {\\n\\n let csi = CSI::Edit(Edit::EraseInDisplay(erase));\\n\\n self.print(format!(\\\"{}\\\", csi));\\n\\n }\\n\\n\\n\\n fn erase_in_line(&mut self, erase: EraseInLine) {\\n\\n let csi = CSI::Edit(Edit::EraseInLine(erase));\\n\\n self.print(format!(\\\"{}\\\", csi));\\n\\n }\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 86,\n \"score\": 93145.78879602136\n },\n {\n \"content\": \" term.set_auto_wrap(true);\\n\\n term.erase_in_display(EraseInDisplay::EraseToStartOfDisplay);\\n\\n term.cup(1, 1);\\n\\n term.print(\\\"hello, world!\\\");\\n\\n assert_visible_contents(\\n\\n &term,\\n\\n file!(),\\n\\n line!(),\\n\\n &[\\n\\n \\\" \\\",\\n\\n \\\" hello, wo\\\",\\n\\n \\\"rld! \\\",\\n\\n \\\" \\\",\\n\\n \\\" \\\",\\n\\n ],\\n\\n );\\n\\n\\n\\n term.erase_in_display(EraseInDisplay::EraseToStartOfDisplay);\\n\\n assert_visible_contents(\\n\\n &term,\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 87,\n \"score\": 93145.59716930808\n },\n {\n \"content\": \" partial_line.set_cell(\\n\\n 1,\\n\\n Cell::new(\\n\\n 'o',\\n\\n CellAttributes::default()\\n\\n .set_hyperlink(Some(Arc::clone(&otherlink)))\\n\\n .clone(),\\n\\n ),\\n\\n );\\n\\n\\n\\n assert_lines_equal(\\n\\n file!(),\\n\\n line!(),\\n\\n &term.screen().visible_lines(),\\n\\n &[\\n\\n Line::from_text_with_wrapped_last_col(\\\"hello\\\", &linked),\\n\\n Line::from_text_with_wrapped_last_col(\\\"hey!!\\\", &linked),\\n\\n partial_line,\\n\\n ],\\n\\n Compare::TEXT | Compare::ATTRS,\\n\\n );\\n\\n}\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 88,\n \"score\": 93145.37098083475\n },\n {\n \"content\": \" .borrow()\\n\\n .as_ref()\\n\\n .map(|c| c.clone())\\n\\n .ok_or_else(|| anyhow::anyhow!(\\\"no clipboard\\\"))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TerminalHost for TestHost {\\n\\n fn writer(&mut self) -> &mut dyn std::io::Write {\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 89,\n \"score\": 93145.04603031323\n },\n {\n \"content\": \" shape: CursorShape::Default,\\n\\n };\\n\\n assert_eq!(\\n\\n cursor, expect,\\n\\n \\\"actual cursor (left) didn't match expected cursor (right) reason={:?}\\\",\\n\\n reason\\n\\n );\\n\\n }\\n\\n\\n\\n fn assert_dirty_lines(&self, expected: &[usize], reason: Option<&str>) {\\n\\n let dirty_indices: Vec<usize> = self\\n\\n .screen()\\n\\n .lines\\n\\n .iter()\\n\\n .enumerate()\\n\\n .filter_map(|(i, line)| if line.is_dirty() { Some(i) } else { None })\\n\\n .collect();\\n\\n assert_eq!(\\n\\n &dirty_indices, &expected,\\n\\n \\\"actual dirty lines (left) didn't match expected dirty lines (right) reason={:?}\\\",\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 90,\n \"score\": 93144.5845906837\n },\n {\n \"content\": \" fn set_mode(&mut self, mode: &str, enable: bool) {\\n\\n self.print(CSI);\\n\\n self.print(mode);\\n\\n self.print(if enable { b\\\"h\\\" } else { b\\\"l\\\" });\\n\\n }\\n\\n\\n\\n fn set_auto_wrap(&mut self, enable: bool) {\\n\\n self.set_mode(\\\"?7\\\", enable);\\n\\n }\\n\\n\\n\\n #[allow(dead_code)]\\n\\n fn set_scroll_region(&mut self, top: usize, bottom: usize) {\\n\\n self.print(CSI);\\n\\n self.print(format!(\\\"{};{}r\\\", top + 1, bottom + 1));\\n\\n }\\n\\n\\n\\n fn delete_lines(&mut self, n: isize) {\\n\\n self.print(CSI);\\n\\n self.print(format!(\\\"{}M\\\", n));\\n\\n }\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 91,\n \"score\": 93144.144504337\n },\n {\n \"content\": \" \\\"{}:{}: line {} text didn't match '{}' vs '{}'\\\",\\n\\n file,\\n\\n line_no,\\n\\n idx,\\n\\n line_str.escape_default(),\\n\\n expect_str.escape_default()\\n\\n );\\n\\n }\\n\\n }\\n\\n\\n\\n assert_eq!(\\n\\n lines.len(),\\n\\n expect_lines.len(),\\n\\n \\\"{}:{}: expectation has wrong number of lines\\\",\\n\\n file,\\n\\n line_no\\n\\n );\\n\\n}\\n\\n\\n\\nbitflags! {\\n\\n struct Compare : u8{\\n\\n const TEXT = 1;\\n\\n const ATTRS = 2;\\n\\n const DIRTY = 4;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 92,\n \"score\": 93141.7470849403\n },\n {\n \"content\": \"\\n\\n if compare.contains(Compare::ATTRS) {\\n\\n let line_attrs: Vec<_> = line.cells().iter().map(|c| c.attrs().clone()).collect();\\n\\n let expect_attrs: Vec<_> = expect.cells().iter().map(|c| c.attrs().clone()).collect();\\n\\n assert_eq!(\\n\\n expect_attrs,\\n\\n line_attrs,\\n\\n \\\"{}:{}: line {} `{}` attrs didn't match (left=expected, right=actual)\\\",\\n\\n file,\\n\\n line_no,\\n\\n idx,\\n\\n line.as_str()\\n\\n );\\n\\n }\\n\\n if compare.contains(Compare::TEXT) {\\n\\n let line_str = line.as_str();\\n\\n let expect_str = expect.as_str();\\n\\n assert_eq!(\\n\\n line_str,\\n\\n expect_str,\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 93,\n \"score\": 93141.60901158437\n },\n {\n \"content\": \"\\n\\n fn hyperlink(&mut self, link: &Arc<Hyperlink>) {\\n\\n let osc = OperatingSystemCommand::SetHyperlink(Some(link.as_ref().clone()));\\n\\n self.print(format!(\\\"{}\\\", osc));\\n\\n }\\n\\n\\n\\n fn hyperlink_off(&mut self) {\\n\\n self.print(\\\"\\\\x1b]8;;\\\\x1b\\\\\\\\\\\");\\n\\n }\\n\\n\\n\\n fn soft_reset(&mut self) {\\n\\n self.print(CSI);\\n\\n self.print(\\\"!p\\\");\\n\\n }\\n\\n\\n\\n fn assert_cursor_pos(&self, x: usize, y: i64, reason: Option<&str>) {\\n\\n let cursor = self.cursor_pos();\\n\\n let expect = CursorPosition {\\n\\n x,\\n\\n y,\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 94,\n \"score\": 93140.28062796021\n },\n {\n \"content\": \"/// Create a `Terminal` with the recommended settings for use with\\n\\n/// a `LineEditor`.\\n\\npub fn line_editor_terminal() -> anyhow::Result<impl Terminal> {\\n\\n let hints = ProbeHints::new_from_env().mouse_reporting(Some(false));\\n\\n let caps = Capabilities::new_with_hints(hints)?;\\n\\n new_terminal(caps)\\n\\n}\\n\",\n \"file_path\": \"termwiz/src/lineedit/mod.rs\",\n \"rank\": 95,\n \"score\": 92384.67775038579\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct LocalClip {\\n\\n clip: RefCell<Option<String>>,\\n\\n}\\n\\n\\n\\nimpl LocalClip {\\n\\n fn new() -> Self {\\n\\n Self {\\n\\n clip: RefCell::new(None),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clipboard for LocalClip {\\n\\n fn set_contents(&self, clip: Option<String>) -> anyhow::Result<()> {\\n\\n *self.clip.borrow_mut() = clip;\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n fn get_contents(&self) -> anyhow::Result<String> {\\n\\n self.clip\\n\",\n \"file_path\": \"term/src/test/mod.rs\",\n \"rank\": 96,\n \"score\": 86023.52569460013\n },\n {\n \"content\": \"fn main() {\\n\\n let mut flags = ConstantsFlags::all();\\n\\n flags.remove(ConstantsFlags::SEMVER_FROM_CARGO_PKG);\\n\\n // Generate the 'cargo:' key output\\n\\n generate_cargo_keys(ConstantsFlags::all()).expect(\\\"Unable to generate the cargo keys!\\\");\\n\\n\\n\\n // If a file named `.tag` is present, we'll take its contents for the\\n\\n // version number that we report in wezterm -h.\\n\\n let mut ci_tag = String::new();\\n\\n if let Ok(tag) = std::fs::read(\\\".tag\\\") {\\n\\n if let Ok(s) = String::from_utf8(tag) {\\n\\n ci_tag = s.trim().to_string();\\n\\n println!(\\\"cargo:rerun-if-changed=.tag\\\");\\n\\n }\\n\\n }\\n\\n println!(\\\"cargo:rustc-env=WEZTERM_CI_TAG={}\\\", ci_tag);\\n\\n println!(\\\"cargo:rustc-env=MACOSX_DEPLOYMENT_TARGET=10.9\\\");\\n\\n\\n\\n #[cfg(windows)]\\n\\n {\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 97,\n \"score\": 85373.9169417209\n },\n {\n \"content\": \"fn scrollback_size(config: &Arc<dyn TerminalConfiguration>, allow_scrollback: bool) -> usize {\\n\\n if allow_scrollback {\\n\\n config.scrollback_size()\\n\\n } else {\\n\\n 0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Screen {\\n\\n /// Create a new Screen with the specified dimensions.\\n\\n /// The Cells in the viewable portion of the screen are set to the\\n\\n /// default cell attributes.\\n\\n pub fn new(\\n\\n physical_rows: usize,\\n\\n physical_cols: usize,\\n\\n config: &Arc<dyn TerminalConfiguration>,\\n\\n allow_scrollback: bool,\\n\\n ) -> Screen {\\n\\n let physical_rows = physical_rows.max(1);\\n\\n let physical_cols = physical_cols.max(1);\\n\",\n \"file_path\": \"term/src/screen.rs\",\n \"rank\": 98,\n \"score\": 85239.77752300375\n },\n {\n \"content\": \"<!-- cargo-sync-readme start -->\\n\\n\\n\\nThe purpose of this crate is to make it a bit more ergonomic for portable\\n\\napplications that need to work with the platform level `RawFd` and\\n\\n`RawHandle` types.\\n\\n\\n\\nRather than conditionally using `RawFd` and `RawHandle`, the `FileDescriptor`\\n\\ntype can be used to manage ownership, duplicate, read and write.\\n\\n\\n\\n## FileDescriptor\\n\\n\\n\\nThis is a bit of a contrived example, but demonstrates how to avoid\\n\\nthe conditional code that would otherwise be required to deal with\\n\\ncalling `as_raw_fd` and `as_raw_handle`:\\n\\n\\n\\n```\\n\\nuse filedescriptor::{FileDescriptor, FromRawFileDescriptor};\\n\\nuse std::io::Write;\\n\\n\\n\\nfn get_stdout() -> anyhow::Result<FileDescriptor> {\\n\\n let stdout = std::io::stdout();\\n\\n let handle = stdout.lock();\\n\\n FileDescriptor::dup(&handle)\\n\\n}\\n\\n\\n\\nfn print_something() -> anyhow::Result<()> {\\n\\n get_stdout()?.write(b\\\"hello\\\")?;\\n\\n Ok(())\\n\\n}\\n\\n```\\n\\n\\n\\n## Pipe\\n\\nThe `Pipe` type makes it more convenient to create a pipe and manage\\n\\nthe lifetime of both the read and write ends of that pipe.\\n\\n\\n\\n```\\n\\nuse filedescriptor::Pipe;\\n\\nuse std::io::{Read, Write};\\n\\nuse anyhow::Error;\\n\\n\\n\\nlet mut pipe = Pipe::new()?;\\n\\npipe.write.write(b\\\"hello\\\")?;\\n\\ndrop(pipe.write);\\n\\n\\n\\nlet mut s = String::new();\\n\\npipe.read.read_to_string(&mut s)?;\\n\\nassert_eq!(s, \\\"hello\\\");\\n\\n```\\n\\n\\n\\n## Socketpair\\n\\nThe `socketpair` function returns a pair of connected `SOCK_STREAM`\\n\\nsockets and functions both on posix and windows systems.\\n\\n\\n\\n```\\n\\nuse std::io::{Read, Write};\\n\\nuse anyhow::Error;\\n\\n\\n\\nlet (mut a, mut b) = filedescriptor::socketpair()?;\\n\\na.write(b\\\"hello\\\")?;\\n\\ndrop(a);\\n\\n\\n\\nlet mut s = String::new();\\n\\nb.read_to_string(&mut s)?;\\n\\nassert_eq!(s, \\\"hello\\\");\\n\",\n \"file_path\": \"filedescriptor/README.md\",\n \"rank\": 99,\n \"score\": 23.197002051962063\n }\n]","isConversational":false}}},{"rowIdx":2999,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/materialized/src/bin/materialized/sys.rs"},"repo_name":{"kind":"string","value":"bobbyiliev/materialize"},"commit":{"kind":"string","value":"44e3bcae151179075232ad436ae72f5883361fd1"},"file_code":{"kind":"string","value":"\n\nuse std::alloc::{self, Layout};\nuse std::io::{self, Write};\nuse std::process;\nuse std::ptr;\nuse std::sync::atomic::{AtomicUsize, Ordering};\n\nuse anyhow::{bail, Context};\nuse nix::errno;\nuse nix::sys::signal;\nuse tracing::trace;\n\n#[cfg(not(any(target_os = \"macos\", target_os = \"linux\", target_os = \"ios\")))]\npub fn adjust_rlimits() {\n trace!(\"rlimit crate does not support this OS; not adjusting nofile limit\");\n}\n\n#[cfg(any(target_os = \"macos\", target_os = \"linux\", target_os = \"ios\"))]\npub fn adjust_rlimits() {\n use rlimit::Resource;\n use tracing::warn;\n\n \n \n \n \n\n let (soft, hard) = match Resource::NOFILE.get() {\n Ok(limits) => limits,\n Err(e) => {\n trace!(\"unable to read initial nofile rlimit: {}\", e);\n return;\n }\n };\n trace!(\"initial nofile rlimit: ({}, {})\", soft, hard);\n\n #[cfg(target_os = \"macos\")]\n let hard = {\n use mz_ore::result::ResultExt;\n use std::cmp;\n use sysctl::Sysctl;\n\n \n \n \n \n let res = sysctl::Ctl::new(\"kern.maxfilesperproc\")\n .and_then(|ctl| ctl.value())\n .map_err_to_string()\n .and_then(|v| match v {\n sysctl::CtlValue::Int(v) => u64::try_from(v)\n .map_err(|_| format!(\"kern.maxfilesperproc unexpectedly negative: {}\", v)),\n o => Err(format!(\"unexpected sysctl value type: {:?}\", o)),\n });\n match res {\n Ok(v) => {\n trace!(\"sysctl kern.maxfilesperproc hard limit: {}\", v);\n cmp::min(v, hard)\n }\n Err(e) => {\n trace!(\"error while reading sysctl: {}\", e);\n hard\n }\n }\n };\n\n trace!(\"attempting to adjust nofile rlimit to ({0}, {0})\", hard);\n if let Err(e) = Resource::NOFILE.set(hard, hard) {\n trace!(\"error adjusting nofile rlimit: {}\", e);\n return;\n }\n\n \n \n let (soft, hard) = match Resource::NOFILE.get() {\n Ok(limits) => limits,\n Err(e) => {\n trace!(\"unable to read adjusted nofile rlimit: {}\", e);\n return;\n }\n };\n trace!(\"adjusted nofile rlimit: ({}, {})\", soft, hard);\n\n const RECOMMENDED_SOFT: u64 = 1024;\n if soft < RECOMMENDED_SOFT {\n warn!(\n \"soft nofile rlimit ({}) is dangerously low; at least {} is recommended\",\n soft, RECOMMENDED_SOFT\n )\n }\n}\n\npub fn enable_sigbus_sigsegv_backtraces() -> Result<(), anyhow::Error> {\n \n \n \n \n \n \n\n \n \n \n \n \n const STACK_SIZE: usize = 2 << 20;\n\n \n \n const STACK_ALIGN: usize = 16;\n\n \n let buf_layout =\n Layout::from_size_align(STACK_SIZE, STACK_ALIGN).expect(\"layout known to be valid\");\n \n \n let buf = unsafe { alloc::alloc(buf_layout) };\n\n \n let stack = libc::stack_t {\n ss_sp: buf as *mut libc::c_void,\n ss_flags: 0,\n ss_size: STACK_SIZE,\n };\n \n \n let ret = unsafe { libc::sigaltstack(&stack, ptr::null_mut()) };\n if ret == -1 {\n let errno = errno::from_i32(errno::errno());\n bail!(\"failed to configure alternate signal stack: {}\", errno);\n }\n\n \n let action = signal::SigAction::new(\n signal::SigHandler::Handler(handle_sigbus_sigsegv),\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n \n unsafe { signal::sigaction(signal::SIGBUS, &action) }\n .context(\"failed to install SIGBUS handler\")?;\n unsafe { signal::sigaction(signal::SIGSEGV, &action) }\n .context(\"failed to install SIGSEGV handler\")?;\n Ok(())\n}\n\npub fn enable_sigusr2_coverage_dump() -> Result<(), anyhow::Error> {\n let action = signal::SigAction::new(\n signal::SigHandler::Handler(handle_sigusr2_signal),\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n\n unsafe { signal::sigaction(signal::SIGUSR2, &action) }\n .context(\"failed to install SIGUSR2 handler\")?;\n\n Ok(())\n}\n\nextern \"C\" fn handle_sigbus_sigsegv(_: i32) {\n \n \n \n \n \n \n \n \n \n \n\n static SEEN: AtomicUsize = AtomicUsize::new(0);\n match SEEN.fetch_add(1, Ordering::SeqCst) {\n 0 => {\n \n \n panic!(\"received SIGSEGV or SIGBUS (maybe a stack overflow?)\");\n }\n _ => {\n \n \n \n \n let _ = io::stderr().write_all(b\"SIGBUS or SIGSEGV while handling SIGSEGV or SIGBUS\\n\");\n let _ = io::stderr().write_all(b\"(maybe a stack overflow while allocating?)\\n\");\n process::abort();\n }\n }\n}\n\npub fn enable_termination_signal_cleanup() -> Result<(), anyhow::Error> {\n let action = signal::SigAction::new(\n signal::SigHandler::Handler(handle_termination_signal),\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n\n for signum in &[\n signal::SIGHUP,\n signal::SIGINT,\n signal::SIGALRM,\n signal::SIGTERM,\n signal::SIGUSR1,\n ] {\n unsafe { signal::sigaction(*signum, &action) }\n .with_context(|| format!(\"failed to install handler for {}\", signum))?;\n }\n\n Ok(())\n}\n\nextern \"C\" {\n fn __llvm_profile_write_file() -> libc::c_int;\n}\n\nextern \"C\" fn handle_sigusr2_signal(_: i32) {\n let _ = unsafe { __llvm_profile_write_file() };\n}\n\nextern \"C\" fn handle_termination_signal(signum: i32) {\n let _ = unsafe { __llvm_profile_write_file() };\n\n let action = signal::SigAction::new(\n signal::SigHandler::SigDfl,\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n unsafe { signal::sigaction(signum.try_into().unwrap(), &action) }\n .unwrap_or_else(|_| panic!(\"failed to uninstall handler for {}\", signum));\n\n let ret = unsafe { libc::raise(signum) };\n if ret == -1 {\n let errno = errno::from_i32(errno::errno());\n panic!(\"failed to re-raise signal {}: {}\", signum, errno);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse std::alloc::{self, Layout};\nuse std::io::{self, Write};\nuse std::process;\nuse std::ptr;\nuse std::sync::atomic::{AtomicUsize, Ordering};\n\nuse anyhow::{bail, Context};\nuse nix::errno;\nuse nix::sys::signal;\nuse tracing::trace;\n\n#[cfg(not(any(target_os = \"macos\", target_os = \"linux\", target_os = \"ios\")))]\npub fn adjust_rlimits() {\n trace!(\"rlimit crate does not support this OS; not adjusting nofile limit\");\n}\n\n#[cfg(any(target_os = \"macos\", target_os = \"linux\", target_os = \"ios\"))]\npub fn adjust_rlimits() {\n use rlimit::Resource;\n use tracing::warn;\n\n \n \n \n \n\n let (soft, hard) = match Resource::NOFILE.get() {\n Ok(limits) => limits,\n Err(e) => {\n trace!(\"unable to read initial nofile rlimit: {}\", e);\n return;\n }\n };\n trace!(\"initial nofile rlimit: ({}, {})\", soft, hard);\n\n #[cfg(target_os = \"macos\")]\n let hard = {\n use mz_ore::result::ResultExt;\n use std::cmp;\n use sysctl::Sysctl;\n\n \n \n \n \n let res = sysctl::Ctl::new(\"kern.maxfilesperproc\")\n .and_then(|ctl| ctl.value())\n .map_err_to_string()\n .and_then(|v| match v {\n sysctl::CtlValue::Int(v) => u64::try_from(v)\n .map_err(|_| format!(\"kern.maxfilesperproc unexpectedly negative: {}\", v)),\n o => Err(format!(\"unexpected sysctl value type: {:?}\", o)),\n });\n match res {\n Ok(v) => {\n trace!(\"sysctl kern.maxfilesperproc hard limit: {}\", v);\n cmp::min(v, hard)\n }\n Err(e) => {\n trace!(\"error while reading sysctl: {}\", e);\n hard\n }\n }\n };\n\n trace!(\"attempting to adjust nofile rlimit to ({0}, {0})\", hard);\n if let Err(e) = Resource::NOFILE.set(hard, hard) {\n trace!(\"error adjusting nofile rlimit: {}\", e);\n return;\n }\n\n \n \n let (soft, hard) = match Resource::NOFILE.get() {\n Ok(limits) => limits,\n Err(e) => {\n trace!(\"unable to read adjusted nofile rlimit: {}\", e);\n return;\n }\n };\n trace!(\"adjusted nofile rlimit: ({}, {})\", soft, hard);\n\n const RECOMMENDED_SOFT: u64 = 1024;\n if soft < RECOMMENDED_SOFT {\n warn!(\n \"soft nofile rlimit ({}) is dangerously low; at least {} is recommended\",\n soft, RECOMMENDED_SOFT\n )\n }\n}\n\npub fn enable_sigbus_sigsegv_backtraces() -> Result<(), anyhow::Error> {\n \n \n \n \n \n \n\n \n \n \n \n \n const STACK_SIZE: usize = 2 << 20;\n\n \n \n const STACK_ALIGN: usize = 16;\n\n \n let buf_layout =\n Layout::from_size_align(STACK_SIZE, STACK_ALIGN).expect(\"layout known to be valid\");\n \n \n let buf = unsafe { alloc::alloc(buf_layout) };\n\n \n let stack = libc::stack_"},"suffix":{"kind":"string","value":"\n\npub fn enable_sigusr2_coverage_dump() -> Result<(), anyhow::Error> {\n let action = signal::SigAction::new(\n signal::SigHandler::Handler(handle_sigusr2_signal),\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n\n unsafe { signal::sigaction(signal::SIGUSR2, &action) }\n .context(\"failed to install SIGUSR2 handler\")?;\n\n Ok(())\n}\n\nextern \"C\" fn handle_sigbus_sigsegv(_: i32) {\n \n \n \n \n \n \n \n \n \n \n\n static SEEN: AtomicUsize = AtomicUsize::new(0);\n match SEEN.fetch_add(1, Ordering::SeqCst) {\n 0 => {\n \n \n panic!(\"received SIGSEGV or SIGBUS (maybe a stack overflow?)\");\n }\n _ => {\n \n \n \n \n let _ = io::stderr().write_all(b\"SIGBUS or SIGSEGV while handling SIGSEGV or SIGBUS\\n\");\n let _ = io::stderr().write_all(b\"(maybe a stack overflow while allocating?)\\n\");\n process::abort();\n }\n }\n}\n\npub fn enable_termination_signal_cleanup() -> Result<(), anyhow::Error> {\n let action = signal::SigAction::new(\n signal::SigHandler::Handler(handle_termination_signal),\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n\n for signum in &[\n signal::SIGHUP,\n signal::SIGINT,\n signal::SIGALRM,\n signal::SIGTERM,\n signal::SIGUSR1,\n ] {\n unsafe { signal::sigaction(*signum, &action) }\n .with_context(|| format!(\"failed to install handler for {}\", signum))?;\n }\n\n Ok(())\n}\n\nextern \"C\" {\n fn __llvm_profile_write_file() -> libc::c_int;\n}\n\nextern \"C\" fn handle_sigusr2_signal(_: i32) {\n let _ = unsafe { __llvm_profile_write_file() };\n}\n\nextern \"C\" fn handle_termination_signal(signum: i32) {\n let _ = unsafe { __llvm_profile_write_file() };\n\n let action = signal::SigAction::new(\n signal::SigHandler::SigDfl,\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n unsafe { signal::sigaction(signum.try_into().unwrap(), &action) }\n .unwrap_or_else(|_| panic!(\"failed to uninstall handler for {}\", signum));\n\n let ret = unsafe { libc::raise(signum) };\n if ret == -1 {\n let errno = errno::from_i32(errno::errno());\n panic!(\"failed to re-raise signal {}: {}\", signum, errno);\n }\n}\n"},"middle":{"kind":"string","value":"t {\n ss_sp: buf as *mut libc::c_void,\n ss_flags: 0,\n ss_size: STACK_SIZE,\n };\n \n \n let ret = unsafe { libc::sigaltstack(&stack, ptr::null_mut()) };\n if ret == -1 {\n let errno = errno::from_i32(errno::errno());\n bail!(\"failed to configure alternate signal stack: {}\", errno);\n }\n\n \n let action = signal::SigAction::new(\n signal::SigHandler::Handler(handle_sigbus_sigsegv),\n signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,\n signal::SigSet::empty(),\n );\n \n unsafe { signal::sigaction(signal::SIGBUS, &action) }\n .context(\"failed to install SIGBUS handler\")?;\n unsafe { signal::sigaction(signal::SIGSEGV, &action) }\n .context(\"failed to install SIGSEGV handler\")?;\n Ok(())\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"fn encode_element(buf: &mut BytesMut, elem: Option<&Value>, ty: &Type) -> Result<(), io::Error> {\n\n match elem {\n\n None => buf.put_i32(-1),\n\n Some(elem) => {\n\n let base = buf.len();\n\n buf.put_i32(0);\n\n elem.encode_binary(ty, buf)?;\n\n let len = pg_len(\"encoded element\", buf.len() - base - 4)?;\n\n buf[base..base + 4].copy_from_slice(&len.to_be_bytes());\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/pgrepr/src/value.rs","rank":0,"score":414098.36710431543},{"content":"/// Parse a jemalloc profile file, producing a vector of stack traces along with their weights.\n\npub fn parse_jeheap<R: BufRead>(r: R) -> anyhow::Result<StackProfile> {\n\n let mut cur_stack = None;\n\n let mut profile = <StackProfile as Default>::default();\n\n let mut lines = r.lines();\n\n let first_line = match lines.next() {\n\n Some(s) => s,\n\n None => bail!(\"Heap dump file was empty\"),\n\n }?;\n\n // The first line of the file should be e.g. \"heap_v2/524288\", where the trailing\n\n // number is the inverse probability of a byte being sampled.\n\n let sampling_rate = str::parse::<usize>(first_line.trim_start_matches(\"heap_v2/\"))? as f64;\n\n for line in lines {\n\n let line = line?;\n\n let line = line.trim();\n\n let words = line.split_ascii_whitespace().collect::<Vec<_>>();\n\n if words.len() > 0 && words[0] == \"@\" {\n\n if cur_stack.is_some() {\n\n bail!(\"Stack without corresponding weight!\")\n\n }\n\n let mut addrs = words[1..]\n","file_path":"src/prof/src/jemalloc.rs","rank":1,"score":372974.714509532},{"content":"// HACK: This should be a method on StreamReadHandle that actually queries the\n\n// runtime.\n\n//\n\n// TODO: We're slightly better, now that we have `get_seal()`. Maybe that's already enough?\n\nfn sealed_ts<K: Data, V: Data>(read: &StreamReadHandle<K, V>) -> Result<u64, Box<dyn Error>> {\n\n let seal_ts = read.snapshot()?.get_seal();\n\n\n\n if let Some(sealed) = seal_ts.first() {\n\n Ok(*sealed)\n\n } else {\n\n Ok(0)\n\n }\n\n}\n\n\n","file_path":"src/persist/examples/kafka_upsert.rs","rank":2,"score":372544.3580027561},{"content":"pub fn parse_map<'a, V, E>(\n\n s: &'a str,\n\n is_value_type_map: bool,\n\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<V, E>,\n\n) -> Result<BTreeMap<String, V>, ParseError>\n\nwhere\n\n E: fmt::Display,\n\n{\n\n parse_map_inner(s, is_value_type_map, gen_elem)\n\n .map_err(|details| ParseError::invalid_input_syntax(\"map\", s).with_details(details))\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":3,"score":366892.6948497694},{"content":"// From postgres-types/src/private.rs.\n\nfn read_value<'a, T>(type_: &PgType, buf: &mut &'a [u8]) -> Result<T, Box<dyn Error + Sync + Send>>\n\nwhere\n\n T: FromSql<'a>,\n\n{\n\n let len = read_be_i32(buf)?;\n\n let value = if len < 0 {\n\n None\n\n } else {\n\n if len as usize > buf.len() {\n\n return Err(\"invalid buffer size\".into());\n\n }\n\n let (head, tail) = buf.split_at(len as usize);\n\n *buf = tail;\n\n Some(head)\n\n };\n\n T::from_sql_nullable(type_, value)\n\n}\n\n\n","file_path":"src/sqllogictest/src/runner.rs","rank":4,"score":339400.8669043597},{"content":"fn decode_copy_data(mut buf: Cursor, frame_len: usize) -> Result<FrontendMessage, io::Error> {\n\n let mut data = Vec::with_capacity(frame_len);\n\n for _ in 0..frame_len {\n\n data.push(buf.read_byte()?);\n\n }\n\n Ok(FrontendMessage::CopyData(data))\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":5,"score":337133.7503261285},{"content":"fn pg_len(what: &str, len: usize) -> Result<i32, io::Error> {\n\n len.try_into().map_err(|_| {\n\n io::Error::new(\n\n io::ErrorKind::Other,\n\n format!(\"{} does not fit into an i32\", what),\n\n )\n\n })\n\n}\n\n\n","file_path":"src/pgrepr/src/value.rs","rank":6,"score":336659.7391818324},{"content":"pub fn extract_protobuf_header(buf: &[u8]) -> Result<(i32, &[u8])> {\n\n let (schema_id, buf) = extract_schema_id(buf, \"protobuf\")?;\n\n\n\n match buf.get(0) {\n\n Some(0) => Ok((schema_id, &buf[1..])),\n\n Some(message_id) => bail!(\n\n \"unsupported Confluent-style protobuf message descriptor id: \\\n\n expected 0, but found: {}. \\\n\n See https://github.com/MaterializeInc/materialize/issues/9250\",\n\n message_id\n\n ),\n\n None => bail!(\n\n \"Confluent-style protobuf datum is too few bytes: expected a message id after magic \\\n\n and schema id, got a buffer of length {}\",\n\n buf.len()\n\n ),\n\n }\n\n}\n","file_path":"src/interchange/src/confluent.rs","rank":7,"score":330304.71741876623},{"content":"pub fn extract_avro_header(buf: &[u8]) -> Result<(i32, &[u8])> {\n\n extract_schema_id(buf, \"avro\")\n\n}\n\n\n","file_path":"src/interchange/src/confluent.rs","rank":8,"score":330304.71741876623},{"content":"/// Reports whether the given stream begins with a pgwire handshake.\n\n///\n\n/// To avoid false negatives, there must be at least eight bytes in `buf`.\n\npub fn match_handshake(buf: &[u8]) -> bool {\n\n // The pgwire StartupMessage looks like this:\n\n //\n\n // i32 - Length of entire message.\n\n // i32 - Protocol version number.\n\n // [String] - Arbitrary key-value parameters of any length.\n\n //\n\n // Since arbitrary parameters can be included in the StartupMessage, the\n\n // first Int32 is worthless, since the message could have any length.\n\n // Instead, we sniff the protocol version number.\n\n if buf.len() < 8 {\n\n return false;\n\n }\n\n let version = NetworkEndian::read_i32(&buf[4..8]);\n\n VERSIONS.contains(&version)\n\n}\n\n\n\n/// Parameters for the [`run`] function.\n\npub struct RunParams<'a, A> {\n\n /// The TLS mode of the pgwire server.\n","file_path":"src/pgwire/src/protocol.rs","rank":9,"score":323402.1849503311},{"content":"fn decode_query(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n Ok(FrontendMessage::Query {\n\n sql: buf.read_cstr()?.to_string(),\n\n })\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":10,"score":319910.1005898536},{"content":"fn decode_close(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n match buf.read_byte()? {\n\n b'S' => Ok(FrontendMessage::CloseStatement {\n\n name: buf.read_cstr()?.to_owned(),\n\n }),\n\n b'P' => Ok(FrontendMessage::ClosePortal {\n\n name: buf.read_cstr()?.to_owned(),\n\n }),\n\n b => Err(input_err(format!(\n\n \"invalid type byte in close message: {}\",\n\n b\n\n ))),\n\n }\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":11,"score":319910.1005898536},{"content":"fn decode_password(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n Ok(FrontendMessage::Password {\n\n password: buf.read_cstr()?.to_owned(),\n\n })\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":12,"score":319910.1005898536},{"content":"fn decode_execute(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n let portal_name = buf.read_cstr()?.to_string();\n\n let max_rows = buf.read_i32()?;\n\n Ok(FrontendMessage::Execute {\n\n portal_name,\n\n max_rows,\n\n })\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":13,"score":319910.1005898536},{"content":"fn decode_parse(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n let name = buf.read_cstr()?;\n\n let sql = buf.read_cstr()?;\n\n\n\n let mut param_types = vec![];\n\n for _ in 0..buf.read_i16()? {\n\n param_types.push(buf.read_u32()?);\n\n }\n\n\n\n Ok(FrontendMessage::Parse {\n\n name: name.into(),\n\n sql: sql.into(),\n\n param_types,\n\n })\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":14,"score":319910.1005898536},{"content":"fn decode_describe(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n let first_char = buf.read_byte()?;\n\n let name = buf.read_cstr()?.to_string();\n\n match first_char {\n\n b'S' => Ok(FrontendMessage::DescribeStatement { name }),\n\n b'P' => Ok(FrontendMessage::DescribePortal { name }),\n\n other => Err(input_err(format!(\"Invalid describe type: {:#x?}\", other))),\n\n }\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":15,"score":319910.1005898536},{"content":"fn decode_bind(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n let portal_name = buf.read_cstr()?.to_string();\n\n let statement_name = buf.read_cstr()?.to_string();\n\n\n\n let mut param_formats = Vec::new();\n\n for _ in 0..buf.read_i16()? {\n\n param_formats.push(buf.read_format()?);\n\n }\n\n\n\n let mut raw_params = Vec::new();\n\n for _ in 0..buf.read_i16()? {\n\n let len = buf.read_i32()?;\n\n if len == -1 {\n\n raw_params.push(None); // NULL\n\n } else {\n\n // TODO(benesch): this should use bytes::Bytes to avoid the copy.\n\n let mut value = Vec::new();\n\n for _ in 0..len {\n\n value.push(buf.read_byte()?);\n\n }\n","file_path":"src/pgwire/src/codec.rs","rank":16,"score":319910.1005898536},{"content":"/// Blocking logic to read from a file, intended for its own thread.\n\npub fn read_file_task<Ctor, I, Err>(\n\n path: PathBuf,\n\n tx: std::sync::mpsc::SyncSender<Result<MessagePayload, anyhow::Error>>,\n\n activator: Option<SyncActivator>,\n\n read_style: FileReadStyle,\n\n compression: Compression,\n\n iter_ctor: Ctor,\n\n) where\n\n I: IntoIterator<Item = Result<MessagePayload, Err>> + Send + 'static,\n\n Ctor: FnOnce(Box<dyn AvroRead + Send>) -> Result<I, Err>,\n\n Err: Into<anyhow::Error>,\n\n{\n\n trace!(\"reading file {}\", path.display());\n\n let file = match std::fs::File::open(&path).with_context(|| {\n\n format!(\n\n \"file source: unable to open file at path {}\",\n\n path.to_string_lossy(),\n\n )\n\n }) {\n\n Ok(file) => file,\n","file_path":"src/storage/src/source/file.rs","rank":17,"score":318658.8776285278},{"content":"fn decode_copy_fail(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n Ok(FrontendMessage::CopyFail(buf.read_cstr()?.to_string()))\n\n}\n\n\n\n/// Decodes data within pgwire messages.\n\n///\n\n/// The API provided is very similar to [`bytes::Buf`], but operations return\n\n/// errors rather than panicking. This is important for safety, as we don't want\n\n/// to crash if the user sends us malformed pgwire messages.\n\n///\n\n/// There are also some special-purpose methods, like [`Cursor::read_cstr`],\n\n/// that are specific to pgwire messages.\n","file_path":"src/pgwire/src/codec.rs","rank":18,"score":315885.5259265753},{"content":"pub fn read_long<R: Read>(reader: &mut R) -> Result<i64, AvroError> {\n\n zag_i64(reader)\n\n}\n\n\n","file_path":"src/avro/src/util.rs","rank":19,"score":314861.3406713669},{"content":"pub fn safe_len(len: usize) -> Result<usize, AvroError> {\n\n let max_bytes = max_allocation_bytes(512 * 1024 * 1024);\n\n\n\n if len <= max_bytes {\n\n Ok(len)\n\n } else {\n\n Err(AvroError::Allocation {\n\n attempted: len,\n\n allowed: max_bytes,\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_zigzag() {\n\n let mut a = Vec::new();\n","file_path":"src/avro/src/util.rs","rank":20,"score":312025.6450356312},{"content":"fn decode_variable<R: Read>(reader: &mut R) -> Result<u64, AvroError> {\n\n let mut i = 0u64;\n\n let mut buf = [0u8; 1];\n\n\n\n let mut j = 0;\n\n loop {\n\n if j > 9 {\n\n // if j * 7 > 64\n\n return Err(AvroError::Decode(DecodeError::IntDecodeOverflow));\n\n }\n\n reader.read_exact(&mut buf[..])?;\n\n i |= (u64::from(buf[0] & 0x7F)) << (j * 7);\n\n if (buf[0] >> 7) == 0 {\n\n break;\n\n } else {\n\n j += 1;\n\n }\n\n }\n\n\n\n Ok(i)\n\n}\n\n\n","file_path":"src/avro/src/util.rs","rank":21,"score":309442.56051757664},{"content":"#[inline]\n\nfn decode_long_nonneg<R: Read>(reader: &mut R) -> Result<u64, AvroError> {\n\n let u = match zag_i64(reader)? {\n\n i if i >= 0 => i as u64,\n\n i => return Err(AvroError::Decode(DecodeError::ExpectedNonnegInteger(i))),\n\n };\n\n Ok(u)\n\n}\n\n\n","file_path":"src/avro/src/decode.rs","rank":22,"score":305581.9401427486},{"content":"pub fn give_value<D: AvroDecode>(d: D, v: &Value) -> Result<D::Out, AvroError> {\n\n use ValueOrReader::Value as V;\n\n match v {\n\n Value::Null => d.scalar(Scalar::Null),\n\n Value::Boolean(val) => d.scalar(Scalar::Boolean(*val)),\n\n Value::Int(val) => d.scalar(Scalar::Int(*val)),\n\n Value::Long(val) => d.scalar(Scalar::Long(*val)),\n\n Value::Float(val) => d.scalar(Scalar::Float(*val)),\n\n Value::Double(val) => d.scalar(Scalar::Double(*val)),\n\n Value::Date(val) => d.scalar(Scalar::Date(*val)),\n\n Value::Timestamp(val) => d.scalar(Scalar::Timestamp(*val)),\n\n // The &[u8] parameter here (and elsewhere in this function) is arbitrary, but we have to put in something in order for the function\n\n // to type-check\n\n Value::Decimal(val) => d.decimal::<&[u8]>(val.precision, val.scale, V(&val.unscaled)),\n\n Value::Bytes(val) => d.bytes::<&[u8]>(V(val)),\n\n Value::String(val) => d.string::<&[u8]>(V(val)),\n\n Value::Fixed(_len, val) => d.fixed::<&[u8]>(V(val)),\n\n Value::Enum(idx, symbol) => d.enum_variant(symbol, *idx as usize),\n\n Value::Union {\n\n index,\n","file_path":"src/avro/src/decode.rs","rank":23,"score":304756.19793467264},{"content":"pub fn plan_read_then_write(\n\n kind: MutationKind,\n\n scx: &StatementContext,\n\n params: &Params,\n\n query::ReadThenWritePlan {\n\n id,\n\n mut selection,\n\n finishing,\n\n assignments,\n\n }: query::ReadThenWritePlan,\n\n) -> Result<Plan, anyhow::Error> {\n\n selection.bind_parameters(¶ms)?;\n\n let selection = selection.optimize_and_lower(&scx.into())?;\n\n let mut assignments_outer = HashMap::new();\n\n for (idx, mut set) in assignments {\n\n set.bind_parameters(¶ms)?;\n\n let set = set.lower_uncorrelated()?;\n\n assignments_outer.insert(idx, set);\n\n }\n\n\n\n Ok(Plan::ReadThenWrite(ReadThenWritePlan {\n\n id,\n\n selection,\n\n finishing,\n\n assignments: assignments_outer,\n\n kind,\n\n }))\n\n}\n\n\n","file_path":"src/sql/src/plan/statement/dml.rs","rank":24,"score":302666.7648534512},{"content":"#[test]\n\nfn test_no_default_value() -> Result<(), String> {\n\n let reader_schema = Schema::from_str(\n\n r#\"{\n\n \"type\": \"record\",\n\n \"name\": \"Test\",\n\n \"fields\": [\n\n {\"name\": \"H\", \"type\": \"int\"}\n\n ]\n\n }\"#,\n\n )\n\n .unwrap();\n\n let resolved_schema = resolve_schemas(&LONG_RECORD_SCHEMA, &reader_schema);\n\n match resolved_schema {\n\n Ok(_) => Err(String::from(\"Expected SchemaResolutionError, got Ok\")),\n\n Err(ref e) => {\n\n if let AvroError::ResolveSchema(_) = e {\n\n Ok(())\n\n } else {\n\n Err(format!(\"Expected SchemaResultionError, got {}\", e))\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"src/avro/tests/io.rs","rank":25,"score":301530.57087251055},{"content":"#[test]\n\nfn test_type_exception() -> Result<(), String> {\n\n let writer_schema = Schema::from_str(\n\n r#\"\n\n {\n\n \"type\": \"record\",\n\n \"name\": \"Test\",\n\n \"fields\": [\n\n {\"name\": \"F\", \"type\": \"int\"},\n\n {\"name\": \"E\", \"type\": \"int\"}\n\n ]\n\n }\n\n \"#,\n\n )\n\n .unwrap();\n\n let datum_to_write = Value::Record(vec![\n\n (\"E\".to_string(), Value::Int(5)),\n\n (\"F\".to_string(), Value::String(String::from(\"Bad\"))),\n\n ]);\n\n let encoded = to_avro_datum(&writer_schema, datum_to_write);\n\n match encoded {\n\n Ok(_) => Err(String::from(\"Expected ValidationError, got Ok\")),\n\n Err(ref e) => match e.downcast_ref::<ValidationError>() {\n\n Some(_) => Ok(()),\n\n None => Err(format!(\"Expected ValidationError, got {}\", e)),\n\n },\n\n }\n\n}\n\n\n","file_path":"src/avro/tests/io.rs","rank":26,"score":301276.21926094155},{"content":"/// Validate that the string is an allowed variable name (lowercase letters, numbers and dashes)\n\npub fn validate_ident(name: &str) -> Result<(), anyhow::Error> {\n\n lazy_static! {\n\n static ref VALID_KEY_REGEX: Regex = Regex::new(\"^[a-z0-9\\\\-]*$\").unwrap();\n\n }\n\n if !VALID_KEY_REGEX.is_match(name) {\n\n bail!(\n\n \"invalid builtin argument name '{}': \\\n\n only lowercase letters, numbers, and hyphens allowed\",\n\n name\n\n );\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/testdrive/src/parser.rs","rank":27,"score":300697.267059566},{"content":"pub fn zag_i32<R: Read>(reader: &mut R) -> Result<i32, AvroError> {\n\n let i = zag_i64(reader)?;\n\n if i < i64::from(i32::min_value()) || i > i64::from(i32::max_value()) {\n\n Err(AvroError::Decode(DecodeError::I32OutOfRange(i)))\n\n } else {\n\n Ok(i as i32)\n\n }\n\n}\n\n\n","file_path":"src/avro/src/util.rs","rank":28,"score":298814.4013601596},{"content":"pub fn zag_i64<R: Read>(reader: &mut R) -> Result<i64, AvroError> {\n\n let z = decode_variable(reader)?;\n\n Ok(if z & 0x1 == 0 {\n\n (z >> 1) as i64\n\n } else {\n\n !(z >> 1) as i64\n\n })\n\n}\n\n\n","file_path":"src/avro/src/util.rs","rank":29,"score":298814.4013601596},{"content":"fn parse_frame_len(src: &[u8]) -> Result<usize, io::Error> {\n\n let n = usize::cast_from(NetworkEndian::read_u32(src));\n\n if n > netio::MAX_FRAME_SIZE {\n\n return Err(io::Error::new(\n\n io::ErrorKind::InvalidData,\n\n netio::FrameTooBig,\n\n ));\n\n } else if n < 4 {\n\n return Err(io::Error::new(\n\n io::ErrorKind::InvalidInput,\n\n \"invalid frame length\",\n\n ));\n\n }\n\n Ok(n - 4)\n\n}\n\n\n\nimpl Decoder for Codec {\n\n type Item = FrontendMessage;\n\n type Error = io::Error;\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":30,"score":297351.0688079734},{"content":"fn analyze_type(ty: &syn::Type) -> Result<Type> {\n\n match ty {\n\n syn::Type::Path(syn::TypePath { qself: None, path }) => match path.segments.len() {\n\n 2 => {\n\n let name = path.segments.iter().map(|s| s.ident.to_string()).join(\"::\");\n\n Ok(Type::Abstract(name))\n\n }\n\n 1 => {\n\n let segment = path.segments.last().unwrap();\n\n let segment_name = segment.ident.to_string();\n\n\n\n let container = |construct_ty: fn(Box<Type>) -> Type| match &segment.arguments {\n\n syn::PathArguments::AngleBracketed(args) if args.args.len() == 1 => {\n\n match args.args.last().unwrap() {\n\n syn::GenericArgument::Type(ty) => {\n\n let inner = Box::new(analyze_type(ty)?);\n\n Ok(construct_ty(inner))\n\n }\n\n _ => bail!(\"Container type argument is not a basic (i.e., non-lifetime, non-constraint) type argument: {}\", ty.into_token_stream()),\n\n }\n","file_path":"src/walkabout/src/ir.rs","rank":31,"score":296840.9994950369},{"content":"/// Parses a SQL string containing a single data type.\n\npub fn parse_data_type(sql: &str) -> Result<UnresolvedDataType, ParserError> {\n\n let tokens = lexer::lex(sql)?;\n\n let mut parser = Parser::new(sql, tokens);\n\n let data_type = parser.parse_data_type()?;\n\n if parser.next_token().is_some() {\n\n parser_err!(\n\n parser,\n\n parser.peek_prev_pos(),\n\n \"extra token after data type\"\n\n )\n\n } else {\n\n Ok(data_type)\n\n }\n\n}\n\n\n\nmacro_rules! maybe {\n\n ($e:expr) => {{\n\n if let Some(v) = $e {\n\n return Ok(v);\n\n }\n\n }};\n\n}\n\n\n","file_path":"src/sql-parser/src/parser.rs","rank":32,"score":296358.3271745347},{"content":"pub fn neg_interval(a: Datum) -> Result<Datum, EvalError> {\n\n neg_interval_inner(a).map(Datum::from)\n\n}\n\n\n","file_path":"src/expr/src/scalar/func.rs","rank":33,"score":296340.1864413796},{"content":"/// Decode a `Value` encoded in Avro format given its `Schema` and anything implementing `io::Read`\n\n/// to read from.\n\n///\n\n/// In case a reader `Schema` is provided, schema resolution will also be performed.\n\n///\n\n/// **NOTE** This function has a quite small niche of usage and does NOT take care of reading the\n\n/// header and consecutive data blocks; use [`Reader`](struct.Reader.html) if you don't know what\n\n/// you are doing, instead.\n\npub fn from_avro_datum<R: AvroRead>(schema: &Schema, reader: &mut R) -> Result<Value, AvroError> {\n\n let value = decode(schema.top_node(), reader)?;\n\n Ok(value)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::types::{Record, ToAvro};\n\n use crate::Reader;\n\n\n\n use std::io::Cursor;\n\n\n\n static SCHEMA: &str = r#\"\n\n {\n\n \"type\": \"record\",\n\n \"name\": \"test\",\n\n \"fields\": [\n\n {\"name\": \"a\", \"type\": \"long\", \"default\": 42},\n\n {\"name\": \"b\", \"type\": \"string\"}\n","file_path":"src/avro/src/reader.rs","rank":34,"score":295430.20924510364},{"content":"/// Escapes a list, record, or map element in place.\n\n///\n\n/// The element must start at `start` and extend to the end of the buffer. The\n\n/// buffer will be resized if escaping is necessary to account for the\n\n/// additional escape characters.\n\n///\n\n/// The `needs_escaping` function is used to determine whether an element needs\n\n/// to be escaped. It is provided with the bytes of each element and should\n\n/// return whether the element needs to be escaped.\n\nfn escape_elem<F, E>(buf: &mut F, start: usize)\n\nwhere\n\n F: FormatBuffer,\n\n E: ElementEscaper,\n\n{\n\n let elem = &buf.as_ref()[start..];\n\n if !E::needs_escaping(elem) {\n\n return;\n\n }\n\n\n\n // We'll need two extra bytes for the quotes at the start and end of the\n\n // element, plus an extra byte for each quote and backslash.\n\n let extras = 2 + elem.iter().filter(|b| matches!(b, b'\"' | b'\\\\')).count();\n\n let orig_end = buf.len();\n\n let new_end = buf.len() + extras;\n\n\n\n // Pad the buffer to the new length. These characters will all be\n\n // overwritten.\n\n //\n\n // NOTE(benesch): we never read these characters, so we could instead use\n","file_path":"src/repr/src/strconv.rs","rank":35,"score":292442.9627873262},{"content":"fn decode_terminate(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n // Nothing more to decode.\n\n Ok(FrontendMessage::Terminate)\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":36,"score":287758.9564038578},{"content":"fn decode_sync(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n // Nothing more to decode.\n\n Ok(FrontendMessage::Sync)\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":37,"score":287758.9564038578},{"content":"fn decode_flush(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n // Nothing more to decode.\n\n Ok(FrontendMessage::Flush)\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":38,"score":287758.9564038578},{"content":"pub fn parse_numeric(s: &str) -> Result<OrderedDecimal<Numeric>, ParseError> {\n\n let mut cx = numeric::cx_datum();\n\n let mut n = match cx.parse(s.trim()) {\n\n Ok(n) => n,\n\n Err(..) => {\n\n return Err(ParseError::invalid_input_syntax(\"numeric\", s));\n\n }\n\n };\n\n\n\n let cx_status = cx.status();\n\n\n\n // Check for values that can only be generated by invalid syntax.\n\n if (n.is_infinite() && !cx_status.overflow())\n\n || (n.is_nan() && n.is_negative())\n\n || n.is_signaling_nan()\n\n {\n\n return Err(ParseError::invalid_input_syntax(\"numeric\", s));\n\n }\n\n\n\n // Process value; only errors if value is out of range of numeric's max precision.\n","file_path":"src/repr/src/strconv.rs","rank":39,"score":286790.9766378891},{"content":"/// Plans a slice of expressions.\n\n///\n\n/// This function is a simple convenience function for mapping [`plan_expr`]\n\n/// over a slice of expressions. The planned expressions are returned in the\n\n/// same order as the input. If any of the expressions fail to plan, returns an\n\n/// error instead.\n\nfn plan_exprs<E>(ecx: &ExprContext, exprs: &[E]) -> Result<Vec<CoercibleScalarExpr>, PlanError>\n\nwhere\n\n E: std::borrow::Borrow<Expr<Aug>>,\n\n{\n\n let mut out = vec![];\n\n for expr in exprs {\n\n out.push(plan_expr(ecx, expr.borrow())?);\n\n }\n\n Ok(out)\n\n}\n\n\n","file_path":"src/sql/src/plan/query.rs","rank":40,"score":286460.63313526195},{"content":"fn decode_copy_done(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\n\n // Nothing more to decode.\n\n Ok(FrontendMessage::CopyDone)\n\n}\n\n\n","file_path":"src/pgwire/src/codec.rs","rank":41,"score":283734.3817405795},{"content":"fn parse_map_inner<'a, V, E>(\n\n s: &'a str,\n\n is_value_type_map: bool,\n\n mut gen_elem: impl FnMut(Cow<'a, str>) -> Result<V, E>,\n\n) -> Result<BTreeMap<String, V>, String>\n\nwhere\n\n E: fmt::Display,\n\n{\n\n let mut map = BTreeMap::new();\n\n let buf = &mut LexBuf::new(s);\n\n\n\n // Consume opening paren.\n\n if !buf.consume('{') {\n\n bail!(\n\n \"expected '{{', found {}\",\n\n match buf.next() {\n\n Some(c) => format!(\"{}\", c),\n\n None => \"empty string\".to_string(),\n\n }\n\n )\n","file_path":"src/repr/src/strconv.rs","rank":42,"score":283143.0009626483},{"content":"/// Returns `n`'s precision, i.e. the total number of digits represented by `n`\n\n/// in standard notation not including a zero in the \"one's place\" in (-1,1).\n\npub fn get_precision<const N: usize>(n: &Decimal<N>) -> u32 {\n\n let e = n.exponent();\n\n if e >= 0 {\n\n // Positive exponent\n\n n.digits() + u32::try_from(e).unwrap()\n\n } else {\n\n // Negative exponent\n\n let d = n.digits();\n\n let e = u32::try_from(e.abs()).unwrap();\n\n // Precision is...\n\n // - d if decimal point splits numbers\n\n // - e if e dominates number of digits\n\n std::cmp::max(d, e)\n\n }\n\n}\n\n\n","file_path":"src/repr/src/adt/numeric.rs","rank":43,"score":282507.8693858553},{"content":"// This function is derived from code in the avro_rs project. Update the license\n\n// header on this file accordingly if you move it to a new home.\n\npub fn from_json(json: &JsonValue, schema: SchemaNode) -> Result<Value, anyhow::Error> {\n\n match (json, schema.inner) {\n\n (JsonValue::Null, SchemaPiece::Null) => Ok(Value::Null),\n\n (JsonValue::Bool(b), SchemaPiece::Boolean) => Ok(Value::Boolean(*b)),\n\n (JsonValue::Number(ref n), SchemaPiece::Int) => {\n\n Ok(Value::Int(n.as_i64().unwrap().try_into()?))\n\n }\n\n (JsonValue::Number(ref n), SchemaPiece::Long) => Ok(Value::Long(n.as_i64().unwrap())),\n\n (JsonValue::Number(ref n), SchemaPiece::Float) => {\n\n Ok(Value::Float(n.as_f64().unwrap() as f32))\n\n }\n\n (JsonValue::Number(ref n), SchemaPiece::Double) => Ok(Value::Double(n.as_f64().unwrap())),\n\n (JsonValue::Number(ref n), SchemaPiece::Date) => Ok(Value::Date(\n\n chrono::NaiveDate::from_ymd(1970, 1, 1) + chrono::Duration::days(n.as_i64().unwrap()),\n\n )),\n\n (JsonValue::Number(ref n), SchemaPiece::TimestampMilli) => {\n\n let ts = n.as_i64().unwrap();\n\n Ok(Value::Timestamp(chrono::NaiveDateTime::from_timestamp(\n\n ts / 1_000,\n\n ((ts % 1_000) * 1_000_000) as u32,\n","file_path":"src/testdrive/src/format/avro.rs","rank":44,"score":282170.60964756244},{"content":"/// Encodes an BlobUnsealedBatch into the Arrow file format.\n\n///\n\n/// NB: This is currently unused, but it's here because we may want to use it\n\n/// for the local cache and so we can easily compare arrow vs parquet.\n\npub fn encode_unsealed_arrow<W: Write>(w: &mut W, batch: &BlobUnsealedBatch) -> Result<(), Error> {\n\n let mut metadata = BTreeMap::new();\n\n metadata.insert(\n\n INLINE_METADATA_KEY.into(),\n\n encode_unsealed_inline_meta(batch, ProtoBatchFormat::ArrowKvtd),\n\n );\n\n let schema = Schema::from(SCHEMA_ARROW_KVTD.fields.clone()).with_metadata(metadata);\n\n let options = WriteOptions { compression: None };\n\n let mut writer = FileWriter::try_new(w, &schema, None, options)?;\n\n for records in batch.updates.iter() {\n\n writer.write(&encode_arrow_batch_kvtd(records), None)?;\n\n }\n\n writer.finish()?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/persist/src/indexed/columnar/arrow.rs","rank":45,"score":279601.2005028077},{"content":"/// Decodes a BlobUnsealedBatch from the Arrow file format.\n\n///\n\n/// NB: This is currently unused, but it's here because we may want to use it\n\n/// for the local cache and so we can easily compare arrow vs parquet.\n\npub fn decode_unsealed_arrow<R: Read + Seek>(r: &mut R) -> Result<BlobUnsealedBatch, Error> {\n\n let file_meta = read_file_metadata(r)?;\n\n let (format, meta) =\n\n decode_unsealed_inline_meta(file_meta.schema.metadata.get(INLINE_METADATA_KEY))?;\n\n\n\n let updates = match format {\n\n ProtoBatchFormat::Unknown => return Err(\"unknown format\".into()),\n\n ProtoBatchFormat::ArrowKvtd => decode_arrow_file_kvtd(r, file_meta)?,\n\n ProtoBatchFormat::ParquetKvtd => {\n\n return Err(\"ParquetKvtd format not supported in arrow\".into())\n\n }\n\n };\n\n\n\n let ret = BlobUnsealedBatch {\n\n desc: SeqNo(meta.seqno_lower)..SeqNo(meta.seqno_upper),\n\n updates,\n\n };\n\n ret.validate()?;\n\n Ok(ret)\n\n}\n\n\n","file_path":"src/persist/src/indexed/columnar/arrow.rs","rank":46,"score":279572.1217076591},{"content":"/// Decodes a BlobUnsealedBatch from the Parquet format.\n\npub fn decode_unsealed_parquet<R: Read + Seek>(r: &mut R) -> Result<BlobUnsealedBatch, Error> {\n\n let metadata = read_metadata(r).map_err(|err| err.to_string())?;\n\n let metadata = metadata\n\n .key_value_metadata()\n\n .as_ref()\n\n .and_then(|x| x.iter().find(|x| x.key == INLINE_METADATA_KEY));\n\n let (format, meta) = decode_unsealed_inline_meta(metadata.and_then(|x| x.value.as_ref()))?;\n\n\n\n let updates = match format {\n\n ProtoBatchFormat::Unknown => return Err(\"unknown format\".into()),\n\n ProtoBatchFormat::ArrowKvtd => {\n\n return Err(\"ArrowKvtd format not supported in parquet\".into())\n\n }\n\n ProtoBatchFormat::ParquetKvtd => decode_parquet_file_kvtd(r)?,\n\n };\n\n\n\n let ret = BlobUnsealedBatch {\n\n desc: SeqNo(meta.seqno_lower)..SeqNo(meta.seqno_upper),\n\n updates,\n\n };\n\n ret.validate()?;\n\n Ok(ret)\n\n}\n\n\n","file_path":"src/persist/src/indexed/columnar/parquet.rs","rank":47,"score":279565.86272884463},{"content":"/// Parses a buffer of two's complement digits in big-endian order and converts\n\n/// them to [`Decimal<N>`].\n\npub fn twos_complement_be_to_numeric_inner<D: Dec<N>, const N: usize>(\n\n input: &mut [u8],\n\n) -> Result<Decimal<N>, anyhow::Error> {\n\n let is_neg = if (input[0] & 0x80) != 0 {\n\n // byte-level negate all negative values, guaranteeing all bytes are\n\n // readable as unsigned.\n\n negate_twos_complement_le(input.iter_mut().rev());\n\n true\n\n } else {\n\n false\n\n };\n\n\n\n let head = input.len() % 16;\n\n let i = twos_complement_be_to_u128(&input[0..head]);\n\n let mut cx = D::context();\n\n let mut d = cx.from_u128(i);\n\n\n\n for c in input[head..].chunks(16) {\n\n assert_eq!(c.len(), 16);\n\n // essentially d << 128\n","file_path":"src/repr/src/adt/numeric.rs","rank":48,"score":279443.4619689743},{"content":"#[inline]\n\nfn decode_len<R: Read>(reader: &mut R) -> Result<usize, AvroError> {\n\n zag_i64(reader).and_then(|i| safe_len(i as usize))\n\n}\n\n\n","file_path":"src/avro/src/decode.rs","rank":49,"score":278888.0889103903},{"content":"pub fn format_pg_legacy_char<B>(buf: &mut B, c: u8) -> Result<(), EvalError>\n\nwhere\n\n B: FormatBuffer,\n\n{\n\n // PostgreSQL is willing to hold invalid UTF-8 in a `Datum::String`, but\n\n // we are not.\n\n match str::from_utf8(&[c]) {\n\n Ok(s) => {\n\n buf.write_str(s);\n\n Ok(())\n\n }\n\n Err(_) => Err(EvalError::InvalidByteSequence {\n\n byte_sequence: format!(\"{:#02x}\", c),\n\n encoding_name: \"UTF8\".into(),\n\n }),\n\n }\n\n}\n\n\n\nsqlfunc!(\n\n #[sqlname = \"pglegacychartostr\"]\n","file_path":"src/expr/src/scalar/func/impls/pg_legacy_char.rs","rank":50,"score":278591.83369244554},{"content":"/// Lexes a SQL query.\n\n///\n\n/// Returns a list of tokens alongside their corresponding byte offset in the\n\n/// input string. Returns an error if the SQL query is lexically invalid.\n\n///\n\n/// See the module documentation for more information about the lexical\n\n/// structure of SQL.\n\npub fn lex(query: &str) -> Result<Vec<(Token, usize)>, ParserError> {\n\n let buf = &mut LexBuf::new(query);\n\n let mut tokens = vec![];\n\n while let Some(ch) = buf.next() {\n\n let pos = buf.pos() - ch.len_utf8();\n\n let token = match ch {\n\n _ if ch.is_ascii_whitespace() => continue,\n\n '-' if buf.consume('-') => {\n\n lex_line_comment(buf);\n\n continue;\n\n }\n\n '/' if buf.consume('*') => {\n\n lex_multiline_comment(buf)?;\n\n continue;\n\n }\n\n '\\'' => Token::String(lex_string(buf)?),\n\n 'x' | 'X' if buf.consume('\\'') => Token::HexString(lex_string(buf)?),\n\n 'e' | 'E' if buf.consume('\\'') => lex_extended_string(buf)?,\n\n 'A'..='Z' | 'a'..='z' | '_' | '\\u{80}'..=char::MAX => lex_ident(buf),\n\n '\"' => lex_quoted_ident(buf)?,\n","file_path":"src/sql-parser/src/lexer.rs","rank":51,"score":277970.7177351316},{"content":"/// Returns a new context appropriate for operating on numeric datums.\n\npub fn cx_datum() -> Context<Numeric> {\n\n CX_DATUM.clone()\n\n}\n\n\n","file_path":"src/repr/src/adt/numeric.rs","rank":52,"score":277755.896766486},{"content":"/// Constructs a sink that consumes its input and sends it nowhere.\n\npub fn dev_null<T, E>() -> DevNull<T, E> {\n\n DevNull(PhantomData, PhantomData)\n\n}\n\n\n\n/// A sink that consumes its input and sends it nowhere.\n\n///\n\n/// Primarily useful as a base sink when folding multiple sinks into one using\n\n/// [`futures::sink::SinkExt::fanout`].\n\n#[derive(Debug)]\n\npub struct DevNull<T, E>(PhantomData<T>, PhantomData<E>);\n\n\n\nimpl<T, E> Sink<T> for DevNull<T, E> {\n\n type Error = E;\n\n\n\n fn poll_ready(self: Pin<&mut Self>, _: &mut Context) -> Poll<Result<(), Self::Error>> {\n\n Poll::Ready(Ok(()))\n\n }\n\n\n\n fn start_send(self: Pin<&mut Self>, _: T) -> Result<(), Self::Error> {\n\n Ok(())\n","file_path":"src/ore/src/future.rs","rank":53,"score":276976.8531052865},{"content":"/// Check a const-sized array of `constraints` against a sequence of `quantifiers`,\n\n/// and call `on_failure` for constraints that are not satisfied by the sequence.\n\n///\n\n/// A `constraint[i]` is violated iff one of the following conditions are met:\n\n/// - The number of `quantifiers` with satisfied type is within the given range.\n\n/// - All `quantifiers` with satisfied type also satisfy the quantifier box constraints.\n\nfn check_constraints<'a, const N: usize>(\n\n constraints: &[QuantifierConstraint; N],\n\n quantifiers: impl Iterator<Item = BoundRef<'a, Quantifier>>,\n\n model: &'a Model,\n\n mut on_failure: impl FnMut(&QuantifierConstraint) -> (),\n\n) {\n\n // count quantifiers with satisfied type and associated box types\n\n let mut q_type_counts = [0; N];\n\n let mut b_type_counts = [0; N];\n\n for q in quantifiers {\n\n for i in 0..N {\n\n if constraints[i].satisfies_q_type(&q) {\n\n q_type_counts[i] += 1;\n\n b_type_counts[i] += constraints[i].satisfies_b_type(&q, model) as usize;\n\n }\n\n }\n\n }\n\n // call on_failure for violated constraints\n\n for i in 0..N {\n\n let q_type_count_ok = constraints[i].contains(&q_type_counts[i]);\n","file_path":"src/sql/src/query_model/validator/quantifier.rs","rank":54,"score":276805.6734944304},{"content":"/// Encodes an BlobTraceBatchPart into the Arrow file format.\n\n///\n\n/// NB: This is currently unused, but it's here because we may want to use it\n\n/// for the local cache and so we can easily compare arrow vs parquet.\n\npub fn encode_trace_arrow<W: Write>(w: &mut W, batch: &BlobTraceBatchPart) -> Result<(), Error> {\n\n let mut metadata = BTreeMap::new();\n\n metadata.insert(\n\n INLINE_METADATA_KEY.into(),\n\n encode_trace_inline_meta(batch, ProtoBatchFormat::ArrowKvtd),\n\n );\n\n let schema = Schema::from(SCHEMA_ARROW_KVTD.fields.clone()).with_metadata(metadata);\n\n let options = WriteOptions { compression: None };\n\n let mut writer = FileWriter::try_new(w, &schema, None, options)?;\n\n for records in batch.updates.iter() {\n\n writer.write(&encode_arrow_batch_kvtd(&records), None)?;\n\n }\n\n writer.finish()?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/persist/src/indexed/columnar/arrow.rs","rank":55,"score":276431.06377151294},{"content":"/// Encodes an BlobTraceBatchPart into the Parquet format.\n\npub fn encode_trace_parquet<W: Write>(w: &mut W, batch: &BlobTraceBatchPart) -> Result<(), Error> {\n\n encode_parquet_kvtd(\n\n w,\n\n encode_trace_inline_meta(batch, ProtoBatchFormat::ParquetKvtd),\n\n &batch.updates,\n\n )\n\n}\n\n\n","file_path":"src/persist/src/indexed/columnar/parquet.rs","rank":56,"score":276424.8380122322},{"content":"/// Decodes a BlobTraceBatchPart from the Arrow file format.\n\n///\n\n/// NB: This is currently unused, but it's here because we may want to use it\n\n/// for the local cache and so we can easily compare arrow vs parquet.\n\npub fn decode_trace_arrow<R: Read + Seek>(r: &mut R) -> Result<BlobTraceBatchPart, Error> {\n\n let file_meta = read_file_metadata(r)?;\n\n let (format, meta) =\n\n decode_trace_inline_meta(file_meta.schema.metadata.get(INLINE_METADATA_KEY))?;\n\n\n\n let updates = match format {\n\n ProtoBatchFormat::Unknown => return Err(\"unknown format\".into()),\n\n ProtoBatchFormat::ArrowKvtd => decode_arrow_file_kvtd(r, file_meta)?,\n\n ProtoBatchFormat::ParquetKvtd => {\n\n return Err(\"ParquetKvtd format not supported in arrow\".into())\n\n }\n\n };\n\n\n\n let ret = BlobTraceBatchPart {\n\n desc: meta.desc.map_or_else(\n\n || {\n\n Description::new(\n\n Antichain::from_elem(u64::minimum()),\n\n Antichain::from_elem(u64::minimum()),\n\n Antichain::from_elem(u64::minimum()),\n","file_path":"src/persist/src/indexed/columnar/arrow.rs","rank":57,"score":276402.2864706712},{"content":"/// Decodes a BlobTraceBatchPart from the Parquet format.\n\npub fn decode_trace_parquet<R: Read + Seek>(r: &mut R) -> Result<BlobTraceBatchPart, Error> {\n\n let metadata = read_metadata(r).map_err(|err| err.to_string())?;\n\n let metadata = metadata\n\n .key_value_metadata()\n\n .as_ref()\n\n .and_then(|x| x.iter().find(|x| x.key == INLINE_METADATA_KEY));\n\n let (format, meta) = decode_trace_inline_meta(metadata.and_then(|x| x.value.as_ref()))?;\n\n\n\n let updates = match format {\n\n ProtoBatchFormat::Unknown => return Err(\"unknown format\".into()),\n\n ProtoBatchFormat::ArrowKvtd => {\n\n return Err(\"ArrowKVTD format not supported in parquet\".into())\n\n }\n\n ProtoBatchFormat::ParquetKvtd => decode_parquet_file_kvtd(r)?,\n\n };\n\n\n\n let ret = BlobTraceBatchPart {\n\n desc: meta.desc.map_or_else(\n\n || {\n\n Description::new(\n","file_path":"src/persist/src/indexed/columnar/parquet.rs","rank":58,"score":276396.0607113904},{"content":"fn write_error_heading(stream: &mut StandardStream, color_spec: &ColorSpec) -> io::Result<()> {\n\n stream.set_color(color_spec.clone().set_fg(Some(Color::Red)))?;\n\n write!(stream, \"error: \")?;\n\n stream.set_color(color_spec)\n\n}\n\n\n\nimpl From<anyhow::Error> for Error {\n\n fn from(source: anyhow::Error) -> Error {\n\n Error {\n\n source,\n\n location: None,\n\n }\n\n }\n\n}\n\n\n\npub(crate) struct ErrorLocation {\n\n filename: PathBuf,\n\n snippet: String,\n\n line: usize,\n\n col: usize,\n","file_path":"src/testdrive/src/error.rs","rank":59,"score":276172.2595662848},{"content":"/// Returns a new context appropriate for operating on numeric aggregates.\n\npub fn cx_agg() -> Context<NumericAgg> {\n\n CX_AGG.clone()\n\n}\n\n\n","file_path":"src/repr/src/adt/numeric.rs","rank":60,"score":274173.2544184305},{"content":"pub fn parse_list<'a, T, E>(\n\n s: &'a str,\n\n is_element_type_list: bool,\n\n make_null: impl FnMut() -> T,\n\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\n\n) -> Result<Vec<T>, ParseError>\n\nwhere\n\n E: fmt::Display,\n\n{\n\n parse_list_inner(s, is_element_type_list, make_null, gen_elem)\n\n .map_err(|details| ParseError::invalid_input_syntax(\"list\", s).with_details(details))\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":61,"score":274171.6110194943},{"content":"pub fn parse_array<'a, T, E>(\n\n s: &'a str,\n\n make_null: impl FnMut() -> T,\n\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\n\n) -> Result<Vec<T>, ParseError>\n\nwhere\n\n E: fmt::Display,\n\n{\n\n parse_array_inner(s, make_null, gen_elem)\n\n .map_err(|details| ParseError::invalid_input_syntax(\"array\", s).with_details(details))\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":62,"score":274171.6110194943},{"content":"pub fn format_numeric<F>(buf: &mut F, n: &OrderedDecimal<Numeric>) -> Nestable\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n write!(buf, \"{}\", n.0.to_standard_notation_string());\n\n Nestable::Yes\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":63,"score":274067.91431316116},{"content":"/// Extracts the schema_id placed in front of the serialized message by the confluent stack\n\n/// Optionally expect an empty\n\n///\n\n/// This function returns the schema_id and a subslice of the rest of the buffer\n\nfn extract_schema_id<'buf>(buf: &'buf [u8], protocol: &str) -> Result<(i32, &'buf [u8])> {\n\n // The first byte is a magic byte (0) that indicates the Confluent\n\n // serialization format version, and the next four bytes are a big\n\n // endian 32-bit schema ID.\n\n //\n\n // https://docs.confluent.io/current/schema-registry/docs/serializer-formatter.html#wire-format\n\n //\n\n // For formats like protobuf, confluent adds additional information related to\n\n // which message in the proto file\n\n\n\n let expected_len = 5;\n\n\n\n if buf.len() < expected_len {\n\n bail!(\n\n \"Confluent-style {} datum is too few bytes: expected at least {} bytes, got {}\",\n\n protocol,\n\n expected_len,\n\n buf.len()\n\n );\n\n }\n","file_path":"src/interchange/src/confluent.rs","rank":64,"score":273911.34707834804},{"content":"pub fn ensure() -> Result<(), anyhow::Error> {\n\n println!(\"ensuring all npm packages are up-to-date...\");\n\n\n\n let client = reqwest::blocking::Client::new();\n\n for pkg in NPM_PACKAGES {\n\n if pkg.compute_digest().ok().as_deref() == Some(&pkg.digest) {\n\n println!(\"{} is up-to-date\", pkg.name);\n\n continue;\n\n } else {\n\n println!(\"{} needs updating...\", pkg.name);\n\n }\n\n\n\n let url = format!(\n\n \"https://registry.npmjs.org/{}/-/{}-{}.tgz\",\n\n pkg.name,\n\n pkg.name.split('/').last().unwrap(),\n\n pkg.version,\n\n );\n\n let res = client\n\n .get(&url)\n","file_path":"src/npm/src/lib.rs","rank":65,"score":273572.5695458639},{"content":"/// Creates a temporary copy of Materialize's mzdata databases\n\n///\n\n/// This is useful because running validations against the catalog can conflict with the running\n\n/// Materialize instance. Therefore it's better to run validations on a copy of the catalog.\n\npub fn mzdata_copy(catalog_path: &PathBuf) -> Result<TempDir, anyhow::Error> {\n\n let temp_dir = tempfile::tempdir()?;\n\n fs::copy(\n\n catalog_path.join(STASH_DB_NAME),\n\n temp_dir.path().join(STASH_DB_NAME),\n\n )?;\n\n fs::copy(\n\n catalog_path.join(STORAGE_DB_NAME),\n\n temp_dir.path().join(STORAGE_DB_NAME),\n\n )?;\n\n Ok(temp_dir)\n\n}\n\n\n","file_path":"src/testdrive/src/util/mz_data.rs","rank":66,"score":271654.15370653145},{"content":"/// Creates a temporary copy of Materialize's mzdata's catalog databases\n\n///\n\n/// This is useful because running validations against the catalog can conflict with the running\n\n/// Materialize instance. Therefore it's better to run validations on a copy of the catalog.\n\npub fn catalog_copy(catalog_path: &PathBuf) -> Result<TempDir, anyhow::Error> {\n\n let temp_dir = tempfile::tempdir()?;\n\n fs::copy(\n\n catalog_path.join(STASH_DB_NAME),\n\n temp_dir.path().join(STASH_DB_NAME),\n\n )?;\n\n Ok(temp_dir)\n\n}\n","file_path":"src/testdrive/src/util/mz_data.rs","rank":67,"score":271654.09641721443},{"content":"/// Converts a Materialize row into a vector of PostgreSQL values.\n\n///\n\n/// Calling this function is equivalent to mapping [`Value::from_datum`] over\n\n/// every datum in `row`.\n\npub fn values_from_row(row: Row, typ: &RelationType) -> Vec<Option<Value>> {\n\n row.iter()\n\n .zip(typ.column_types.iter())\n\n .map(|(col, typ)| Value::from_datum(col, &typ.scalar_type))\n\n .collect()\n\n}\n","file_path":"src/pgrepr/src/value.rs","rank":68,"score":271563.4928089844},{"content":"/// Encodes an BlobUnsealedBatch into the Parquet format.\n\npub fn encode_unsealed_parquet<W: Write>(\n\n w: &mut W,\n\n batch: &BlobUnsealedBatch,\n\n) -> Result<(), Error> {\n\n encode_parquet_kvtd(\n\n w,\n\n encode_unsealed_inline_meta(batch, ProtoBatchFormat::ParquetKvtd),\n\n &batch.updates,\n\n )\n\n}\n\n\n","file_path":"src/persist/src/indexed/columnar/parquet.rs","rank":69,"score":271131.95713067387},{"content":"/// Creates a future which will read exactly enough bytes to fill `buf`, unless\n\n/// EOF is reached first. If a short read should be considered an error, use\n\n/// [`tokio::io::AsyncReadExt::read_exact`] instead.\n\n///\n\n/// The returned future will resolve to the number of bytes read.\n\n///\n\n/// In the case of an error the contents of the buffer are unspecified.\n\npub fn read_exact_or_eof<'a, A>(reader: &'a mut A, buf: &'a mut [u8]) -> ReadExactOrEof<'a, A>\n\nwhere\n\n A: AsyncRead,\n\n{\n\n ReadExactOrEof {\n\n reader,\n\n buf,\n\n pos: 0,\n\n }\n\n}\n\n\n\nimpl<A> Future for ReadExactOrEof<'_, A>\n\nwhere\n\n A: AsyncRead + Unpin,\n\n{\n\n type Output = io::Result<usize>;\n\n\n\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Self::Output> {\n\n while self.pos < self.buf.len() {\n\n let me = &mut *self;\n","file_path":"src/ore/src/netio/read_exact.rs","rank":70,"score":270905.58084841294},{"content":"/// Writes each `elem` into `buf`, separating the elems with `sep`.\n\npub fn format_elems<F, T, E>(\n\n buf: &mut F,\n\n elems: impl IntoIterator<Item = T>,\n\n mut format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\n\n sep: char,\n\n) -> Result<(), E>\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n let mut elems = elems.into_iter().peekable();\n\n while let Some(elem) = elems.next() {\n\n let start = buf.len();\n\n if let Nestable::MayNeedEscaping = format_elem(ListElementWriter(buf), elem)? {\n\n escape_elem::<_, ListElementEscaper>(buf, start);\n\n }\n\n if elems.peek().is_some() {\n\n buf.write_char(sep)\n\n }\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":71,"score":270422.2419014008},{"content":"pub fn format_record<F, T, E>(\n\n buf: &mut F,\n\n elems: impl IntoIterator<Item = T>,\n\n mut format_elem: impl FnMut(RecordElementWriter<F>, T) -> Result<Nestable, E>,\n\n) -> Result<Nestable, E>\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n buf.write_char('(');\n\n let mut elems = elems.into_iter().peekable();\n\n while let Some(elem) = elems.next() {\n\n let start = buf.len();\n\n if let Nestable::MayNeedEscaping = format_elem(RecordElementWriter(buf), elem)? {\n\n escape_elem::<_, RecordElementEscaper>(buf, start);\n\n }\n\n if elems.peek().is_some() {\n\n buf.write_char(',')\n\n }\n\n }\n\n buf.write_char(')');\n","file_path":"src/repr/src/strconv.rs","rank":72,"score":270408.3594141735},{"content":"pub fn format_list<F, T, E>(\n\n buf: &mut F,\n\n elems: impl IntoIterator<Item = T>,\n\n format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\n\n) -> Result<Nestable, E>\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n buf.write_char('{');\n\n format_elems(buf, elems, format_elem, ',')?;\n\n buf.write_char('}');\n\n Ok(Nestable::Yes)\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":73,"score":270408.3594141735},{"content":"pub fn format_map<F, T, E>(\n\n buf: &mut F,\n\n elems: impl IntoIterator<Item = (impl AsRef<str>, T)>,\n\n mut format_elem: impl FnMut(MapValueWriter<F>, T) -> Result<Nestable, E>,\n\n) -> Result<Nestable, E>\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n buf.write_char('{');\n\n let mut elems = elems.into_iter().peekable();\n\n while let Some((key, value)) = elems.next() {\n\n // Map key values are always Strings, which always evaluate to\n\n // Nestable::MayNeedEscaping.\n\n let key_start = buf.len();\n\n buf.write_str(key.as_ref());\n\n escape_elem::<_, MapElementEscaper>(buf, key_start);\n\n\n\n buf.write_str(\"=>\");\n\n\n\n let value_start = buf.len();\n","file_path":"src/repr/src/strconv.rs","rank":74,"score":270408.3594141735},{"content":"pub fn format_array<F, T, E>(\n\n buf: &mut F,\n\n dims: &[ArrayDimension],\n\n elems: impl IntoIterator<Item = T>,\n\n mut format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\n\n) -> Result<Nestable, E>\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n format_array_inner(buf, dims, &mut elems.into_iter(), &mut format_elem)?;\n\n Ok(Nestable::Yes)\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":75,"score":270408.3594141735},{"content":"pub fn parse_legacy_vector<'a, T, E>(\n\n s: &'a str,\n\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\n\n) -> Result<Vec<T>, ParseError>\n\nwhere\n\n E: fmt::Display,\n\n{\n\n parse_legacy_vector_inner(s, gen_elem)\n\n .map_err(|details| ParseError::invalid_input_syntax(\"int2vector\", s).with_details(details))\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":76,"score":270408.3594141735},{"content":"pub fn format_array_inner<F, T, E>(\n\n buf: &mut F,\n\n dims: &[ArrayDimension],\n\n elems: &mut impl Iterator<Item = T>,\n\n format_elem: &mut impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\n\n) -> Result<(), E>\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n if dims.is_empty() {\n\n buf.write_str(\"{}\");\n\n return Ok(());\n\n }\n\n\n\n buf.write_char('{');\n\n for j in 0..dims[0].length {\n\n if j > 0 {\n\n buf.write_char(',');\n\n }\n\n if dims.len() == 1 {\n","file_path":"src/repr/src/strconv.rs","rank":77,"score":266815.89958670345},{"content":"pub fn format_legacy_vector<F, T, E>(\n\n buf: &mut F,\n\n elems: impl IntoIterator<Item = T>,\n\n format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\n\n) -> Result<Nestable, E>\n\nwhere\n\n F: FormatBuffer,\n\n{\n\n format_elems(buf, elems, format_elem, ' ')?;\n\n Ok(Nestable::MayNeedEscaping)\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":78,"score":266815.89958670345},{"content":"pub fn parse_legacy_vector_inner<'a, T, E>(\n\n s: &'a str,\n\n mut gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\n\n) -> Result<Vec<T>, String>\n\nwhere\n\n E: fmt::Display,\n\n{\n\n let mut elems = vec![];\n\n let buf = &mut LexBuf::new(s);\n\n\n\n let mut gen = |elem| gen_elem(elem).map_err_to_string();\n\n\n\n loop {\n\n buf.take_while(|ch| ch.is_ascii_whitespace());\n\n match buf.peek() {\n\n Some(_) => {\n\n let elem = buf.take_while(|ch| !ch.is_ascii_whitespace());\n\n elems.push(gen(elem.into())?);\n\n }\n\n None => break,\n\n }\n\n }\n\n\n\n Ok(elems)\n\n}\n\n\n","file_path":"src/repr/src/strconv.rs","rank":79,"score":266815.89958670345},{"content":"// From postgres-types/src/private.rs.\n\nfn read_be_i32(buf: &mut &[u8]) -> Result<i32, Box<dyn Error + Sync + Send>> {\n\n if buf.len() < 4 {\n\n return Err(\"invalid buffer size\".into());\n\n }\n\n let mut bytes = [0; 4];\n\n bytes.copy_from_slice(&buf[..4]);\n\n *buf = &buf[4..];\n\n Ok(i32::from_be_bytes(bytes))\n\n}\n\n\n","file_path":"src/sqllogictest/src/runner.rs","rank":80,"score":266671.7644493747},{"content":"fn lex_multiline_comment(buf: &mut LexBuf) -> Result<(), ParserError> {\n\n let pos = buf.pos() - 2;\n\n let mut nesting = 0;\n\n while let Some(ch) = buf.next() {\n\n match ch {\n\n '*' if buf.consume('/') => {\n\n if nesting == 0 {\n\n return Ok(());\n\n } else {\n\n nesting -= 1;\n\n }\n\n }\n\n '/' if buf.consume('*') => nesting += 1,\n\n _ => (),\n\n }\n\n }\n\n bail!(pos, \"unterminated multiline comment\")\n\n}\n\n\n","file_path":"src/sql-parser/src/lexer.rs","rank":81,"score":263569.57831026113},{"content":"/// Transforms a vector containing indexes of needed columns into one containing\n\n/// the \"skips\" an iterator over a Row would need to perform to see those values.\n\n///\n\n/// This function requires that all of the elements in `indexes` are strictly\n\n/// increasing.\n\n/// E.g. [3, 6, 10, 15] turns into [3, 3, 4, 5]\n\npub fn convert_indexes_to_skips(mut indexes: Vec<usize>) -> Vec<usize> {\n\n for i in 1..indexes.len() {\n\n soft_assert_or_log!(\n\n indexes[i - 1] < indexes[i],\n\n \"convert_indexes_to_skip needs indexes to be strictly increasing. Received: {:?}\",\n\n indexes,\n\n );\n\n }\n\n\n\n for i in (1..indexes.len()).rev() {\n\n indexes[i] -= indexes[i - 1];\n\n indexes[i] -= 1;\n\n }\n\n\n\n indexes\n\n}\n\n\n","file_path":"src/dataflow-types/src/plan/reduce.rs","rank":82,"score":263026.9869039868},{"content":"pub fn plan_raise(scx: &StatementContext, r: RaiseStatement) -> Result<Plan, anyhow::Error> {\n\n scx.require_experimental_mode(\"RAISE statement\")?;\n\n Ok(Plan::Raise(RaisePlan {\n\n severity: r.severity,\n\n }))\n\n}\n","file_path":"src/sql/src/plan/statement/raise.rs","rank":83,"score":262164.65591907944},{"content":"fn typecheck_debezium(value_desc: &RelationDesc) -> Result<(usize, usize), anyhow::Error> {\n\n let (before_idx, before_ty) = value_desc\n\n .get_by_name(&\"before\".into())\n\n .ok_or_else(|| anyhow!(\"'before' column missing from debezium input\"))?;\n\n let (after_idx, after_ty) = value_desc\n\n .get_by_name(&\"after\".into())\n\n .ok_or_else(|| anyhow!(\"'after' column missing from debezium input\"))?;\n\n if !matches!(before_ty.scalar_type, ScalarType::Record { .. }) {\n\n bail!(\"'before' column must be of type record\");\n\n }\n\n if before_ty != after_ty {\n\n bail!(\"'before' type differs from 'after' column\");\n\n }\n\n Ok((before_idx, after_idx))\n\n}\n\n\n","file_path":"src/sql/src/plan/statement/ddl.rs","rank":84,"score":260085.88778193673},{"content":"fn write_value_ref(schema: &Schema, value: &Value, buffer: &mut Vec<u8>) -> Result<(), Error> {\n\n if !value.validate(schema.top_node()) {\n\n return Err(ValidationError::new(\"value does not match schema\").into());\n\n }\n\n encode_ref(value, schema.top_node(), buffer);\n\n Ok(())\n\n}\n\n\n","file_path":"src/avro/src/writer.rs","rank":85,"score":259659.32849585736},{"content":"pub fn transform_expr(scx: &StatementContext, expr: &mut Expr<Aug>) -> Result<(), PlanError> {\n\n run_transforms(scx, |t, expr| t.visit_expr_mut(expr), expr)\n\n}\n\n\n\npub(crate) fn run_transforms<F, A>(\n\n scx: &StatementContext,\n\n mut f: F,\n\n ast: &mut A,\n\n) -> Result<(), PlanError>\n\nwhere\n\n F: for<'ast> FnMut(&mut dyn VisitMut<'ast, Aug>, &'ast mut A),\n\n{\n\n let mut func_rewriter = FuncRewriter::new(scx);\n\n f(&mut func_rewriter, ast);\n\n func_rewriter.status?;\n\n\n\n let mut desugarer = Desugarer::new();\n\n f(&mut desugarer, ast);\n\n desugarer.status\n\n}\n\n\n","file_path":"src/sql/src/plan/transform_ast.rs","rank":86,"score":258750.68152212107},{"content":"/// Extension methods for [`std::result::Result`].\n\npub trait ResultExt<T, E> {\n\n /// Applies [`Into::into`] to a contained [`Err`] value, leaving an [`Ok`]\n\n /// value untouched.\n\n fn err_into<E2>(self) -> Result<T, E2>\n\n where\n\n E: Into<E2>;\n\n\n\n /// Formats an [`Err`] value as a detailed error message, preserving any context information.\n\n ///\n\n /// This is equivalent to `format!(\"{:#}\", err)`, except that it's easier to type.\n\n fn err_to_string(&self) -> Option<String>\n\n where\n\n E: std::fmt::Display;\n\n\n\n /// Maps a `Result<T, E>` to `Result<T, String>` by converting the [`Err`] result into a string\n\n /// using the \"alternate\" formatting.\n\n fn map_err_to_string(self) -> Result<T, String>\n\n where\n\n E: std::fmt::Display;\n\n}\n","file_path":"src/ore/src/result.rs","rank":87,"score":258569.36739093816},{"content":"/// Encode a compatible value (implementing the `ToAvro` trait) into Avro format, also\n\n/// performing schema validation.\n\n///\n\n/// **NOTE** This function has a quite small niche of usage and does NOT generate headers and sync\n\n/// markers; use [`Writer`](struct.Writer.html) to be fully Avro-compatible if you don't know what\n\n/// you are doing, instead.\n\npub fn to_avro_datum<T: ToAvro>(schema: &Schema, value: T) -> Result<Vec<u8>, Error> {\n\n let mut buffer = Vec::new();\n\n write_avro_datum(schema, value, &mut buffer)?;\n\n Ok(buffer)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use std::io::Cursor;\n\n use std::str::FromStr;\n\n\n\n use serde::{Deserialize, Serialize};\n\n\n\n use super::*;\n\n use crate::types::Record;\n\n use crate::util::zig_i64;\n\n use crate::Reader;\n\n\n\n static SCHEMA: &str = r#\"\n\n {\n","file_path":"src/avro/src/writer.rs","rank":88,"score":258560.32316749258},{"content":"/// Plans an expression in the AS OF position of a `SELECT` or `TAIL` statement.\n\npub fn plan_as_of(scx: &StatementContext, expr: Option<Expr<Aug>>) -> Result<QueryWhen, PlanError> {\n\n let mut expr = match expr {\n\n None => return Ok(QueryWhen::Immediately),\n\n Some(expr) => expr,\n\n };\n\n\n\n let scope = Scope::empty();\n\n let desc = RelationDesc::empty();\n\n let qcx = QueryContext::root(scx, QueryLifetime::OneShot(scx.pcx()?));\n\n\n\n transform_ast::transform_expr(scx, &mut expr)?;\n\n\n\n let ecx = &ExprContext {\n\n qcx: &qcx,\n\n name: \"AS OF\",\n\n scope: &scope,\n\n relation_type: &desc.typ(),\n\n allow_aggregates: false,\n\n allow_subqueries: false,\n\n allow_windows: false,\n\n };\n\n let expr = plan_expr(ecx, &expr)?\n\n .type_as_any(ecx)?\n\n .lower_uncorrelated()?;\n\n Ok(QueryWhen::AtTimestamp(expr))\n\n}\n\n\n","file_path":"src/sql/src/plan/query.rs","rank":89,"score":258238.66708929458},{"content":"/// Parse a query result type string into a vec of expected types\n\nfn parse_types(input: &str) -> Result<Vec<Type>, anyhow::Error> {\n\n input\n\n .chars()\n\n .map(|char| {\n\n Ok(match char {\n\n 'T' => Type::Text,\n\n 'I' => Type::Integer,\n\n 'R' => Type::Real,\n\n 'B' => Type::Bool,\n\n 'O' => Type::Oid,\n\n _ => bail!(\"Unexpected type char {} in: {}\", char, input),\n\n })\n\n })\n\n .collect()\n\n}\n\n\n\nlazy_static! {\n\n static ref WHITESPACE_REGEX: Regex = Regex::new(r\"\\s+\").unwrap();\n\n}\n\n\n","file_path":"src/sqllogictest/src/parser.rs","rank":90,"score":257768.23139841945},{"content":"/// Computes the hash of an object implementing [`Hash`].\n\npub fn hash<T: Hash>(t: &T) -> u64 {\n\n let mut hasher = DefaultHasher::new();\n\n t.hash(&mut hasher);\n\n hasher.finish()\n\n}\n","file_path":"src/ore/src/hash.rs","rank":91,"score":257605.21697320484},{"content":"fn lex_parameter(buf: &mut LexBuf) -> Result<Token, ParserError> {\n\n let pos = buf.pos() - 1;\n\n let n = buf\n\n .take_while(|ch| matches!(ch, '0'..='9'))\n\n .parse()\n\n .map_err(|_| ParserError::new(pos, \"invalid parameter number\"))?;\n\n Ok(Token::Parameter(n))\n\n}\n\n\n","file_path":"src/sql-parser/src/lexer.rs","rank":92,"score":257529.96324445802},{"content":"fn lex_string(buf: &mut LexBuf) -> Result<String, ParserError> {\n\n let mut s = String::new();\n\n loop {\n\n let pos = buf.pos() - 1;\n\n loop {\n\n match buf.next() {\n\n Some('\\'') if buf.consume('\\'') => s.push('\\''),\n\n Some('\\'') => break,\n\n Some(c) => s.push(c),\n\n None => bail!(pos, \"unterminated quoted string\"),\n\n }\n\n }\n\n if !lex_to_adjacent_string(buf) {\n\n return Ok(s);\n\n }\n\n }\n\n}\n\n\n","file_path":"src/sql-parser/src/lexer.rs","rank":93,"score":257529.96324445802},{"content":"fn lex_op(buf: &mut LexBuf) -> Result<Token, ParserError> {\n\n buf.prev();\n\n let mut s = String::new();\n\n\n\n // In PostgreSQL, operators might be composed of any of the characters in\n\n // the set below...\n\n while let Some(ch) = buf.next() {\n\n match ch {\n\n // ...except the sequences `--` and `/*` start comments, even within\n\n // what would otherwise be an operator...\n\n '-' if buf.consume('-') => lex_line_comment(buf),\n\n '/' if buf.consume('*') => lex_multiline_comment(buf)?,\n\n #[rustfmt::skip]\n\n '+'|'-'|'*'|'/'|'<'|'>'|'='|'~'|'!'|'@'|'#'|'%'|'^'|'&'|'|'|'`'|'?' => s.push(ch),\n\n _ => {\n\n buf.prev();\n\n break;\n\n }\n\n }\n\n }\n","file_path":"src/sql-parser/src/lexer.rs","rank":94,"score":257529.96324445802},{"content":"fn lex_number(buf: &mut LexBuf) -> Result<Token, ParserError> {\n\n buf.prev();\n\n let mut s = buf.take_while(|ch| matches!(ch, '0'..='9')).to_owned();\n\n\n\n // Optional decimal component.\n\n if buf.consume('.') {\n\n s.push('.');\n\n s.push_str(buf.take_while(|ch| matches!(ch, '0'..='9')));\n\n }\n\n\n\n // Optional exponent.\n\n if buf.consume('e') || buf.consume('E') {\n\n s.push('E');\n\n let require_exp = if buf.consume('-') {\n\n s.push('-');\n\n true\n\n } else {\n\n buf.consume('+')\n\n };\n\n let exp = buf.take_while(|ch| matches!(ch, '0'..='9'));\n","file_path":"src/sql-parser/src/lexer.rs","rank":95,"score":257529.96324445802},{"content":"/// Given some stack traces, generate a map of addresses to their\n\n/// corresponding symbols.\n\n///\n\n/// Each address could correspond to more than one symbol, because\n\n/// of inlining. (E.g. if 0x1234 comes from \"g\", which is inlined in \"f\", the corresponding vec of symbols will be [\"f\", \"g\"].)\n\npub fn symbolicate(profile: &StackProfile) -> HashMap<usize, Vec<String>> {\n\n let mut all_addrs = vec![];\n\n for (stack, _annotation) in profile.stacks.iter() {\n\n all_addrs.extend(stack.addrs.iter().cloned());\n\n }\n\n // Sort so addresses from the same images are together,\n\n // to avoid thrashing `backtrace::resolve`'s cache of\n\n // parsed images.\n\n all_addrs.sort_unstable();\n\n all_addrs.dedup();\n\n all_addrs\n\n .into_iter()\n\n .map(|addr| {\n\n let mut syms = vec![];\n\n backtrace::resolve(addr as *mut c_void, |sym| {\n\n let name = sym\n\n .name()\n\n .map(|sn| sn.to_string())\n\n .unwrap_or_else(|| \"???\".to_string());\n\n syms.push(name);\n\n });\n\n syms.reverse();\n\n (addr, syms)\n\n })\n\n .collect()\n\n}\n","file_path":"src/prof/src/lib.rs","rank":96,"score":255120.70581956595},{"content":"fn lex_dollar_string(buf: &mut LexBuf) -> Result<Token, ParserError> {\n\n let pos = buf.pos() - 1;\n\n let tag = format!(\"${}$\", buf.take_while(|ch| ch != '$'));\n\n let _ = buf.next();\n\n if let Some(s) = buf.take_to_delimiter(&tag) {\n\n Ok(Token::String(s.into()))\n\n } else {\n\n Err(ParserError::new(pos, \"unterminated dollar-quoted string\"))\n\n }\n\n}\n\n\n","file_path":"src/sql-parser/src/lexer.rs","rank":97,"score":254735.9099650499},{"content":"fn lex_quoted_ident(buf: &mut LexBuf) -> Result<Token, ParserError> {\n\n let mut s = String::new();\n\n let pos = buf.pos() - 1;\n\n loop {\n\n match buf.next() {\n\n Some('\"') if buf.consume('\"') => s.push('\"'),\n\n Some('\"') => break,\n\n Some(c) => s.push(c),\n\n None => bail!(pos, \"unterminated quoted identifier\"),\n\n }\n\n }\n\n Ok(Token::Ident(s))\n\n}\n\n\n","file_path":"src/sql-parser/src/lexer.rs","rank":98,"score":254735.9099650499},{"content":"fn lex_extended_string(buf: &mut LexBuf) -> Result<Token, ParserError> {\n\n fn lex_unicode_escape(buf: &mut LexBuf, n: usize) -> Result<char, ParserError> {\n\n let pos = buf.pos() - 2;\n\n buf.next_n(n)\n\n .and_then(|s| u32::from_str_radix(s, 16).ok())\n\n .and_then(|codepoint| char::try_from(codepoint).ok())\n\n .ok_or_else(|| ParserError::new(pos, \"invalid unicode escape\"))\n\n }\n\n\n\n // We do not support octal (\\o) or hexadecimal (\\x) escapes, since it is\n\n // possible to construct invalid UTF-8 with these escapes. We could check\n\n // for and reject invalid UTF-8, of course, but it is too annoying to be\n\n // worth doing right now. We still lex the escapes to produce nice error\n\n // messages.\n\n\n\n fn lex_octal_escape(buf: &mut LexBuf) -> ParserError {\n\n let pos = buf.pos() - 2;\n\n buf.take_while(|ch| matches!(ch, '0'..='7'));\n\n ParserError::new(pos, \"octal escapes are not supported\")\n\n }\n","file_path":"src/sql-parser/src/lexer.rs","rank":99,"score":254735.9099650499}],"string":"[\n {\n \"content\": \"fn encode_element(buf: &mut BytesMut, elem: Option<&Value>, ty: &Type) -> Result<(), io::Error> {\\n\\n match elem {\\n\\n None => buf.put_i32(-1),\\n\\n Some(elem) => {\\n\\n let base = buf.len();\\n\\n buf.put_i32(0);\\n\\n elem.encode_binary(ty, buf)?;\\n\\n let len = pg_len(\\\"encoded element\\\", buf.len() - base - 4)?;\\n\\n buf[base..base + 4].copy_from_slice(&len.to_be_bytes());\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgrepr/src/value.rs\",\n \"rank\": 0,\n \"score\": 414098.36710431543\n },\n {\n \"content\": \"/// Parse a jemalloc profile file, producing a vector of stack traces along with their weights.\\n\\npub fn parse_jeheap<R: BufRead>(r: R) -> anyhow::Result<StackProfile> {\\n\\n let mut cur_stack = None;\\n\\n let mut profile = <StackProfile as Default>::default();\\n\\n let mut lines = r.lines();\\n\\n let first_line = match lines.next() {\\n\\n Some(s) => s,\\n\\n None => bail!(\\\"Heap dump file was empty\\\"),\\n\\n }?;\\n\\n // The first line of the file should be e.g. \\\"heap_v2/524288\\\", where the trailing\\n\\n // number is the inverse probability of a byte being sampled.\\n\\n let sampling_rate = str::parse::<usize>(first_line.trim_start_matches(\\\"heap_v2/\\\"))? as f64;\\n\\n for line in lines {\\n\\n let line = line?;\\n\\n let line = line.trim();\\n\\n let words = line.split_ascii_whitespace().collect::<Vec<_>>();\\n\\n if words.len() > 0 && words[0] == \\\"@\\\" {\\n\\n if cur_stack.is_some() {\\n\\n bail!(\\\"Stack without corresponding weight!\\\")\\n\\n }\\n\\n let mut addrs = words[1..]\\n\",\n \"file_path\": \"src/prof/src/jemalloc.rs\",\n \"rank\": 1,\n \"score\": 372974.714509532\n },\n {\n \"content\": \"// HACK: This should be a method on StreamReadHandle that actually queries the\\n\\n// runtime.\\n\\n//\\n\\n// TODO: We're slightly better, now that we have `get_seal()`. Maybe that's already enough?\\n\\nfn sealed_ts<K: Data, V: Data>(read: &StreamReadHandle<K, V>) -> Result<u64, Box<dyn Error>> {\\n\\n let seal_ts = read.snapshot()?.get_seal();\\n\\n\\n\\n if let Some(sealed) = seal_ts.first() {\\n\\n Ok(*sealed)\\n\\n } else {\\n\\n Ok(0)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/persist/examples/kafka_upsert.rs\",\n \"rank\": 2,\n \"score\": 372544.3580027561\n },\n {\n \"content\": \"pub fn parse_map<'a, V, E>(\\n\\n s: &'a str,\\n\\n is_value_type_map: bool,\\n\\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<V, E>,\\n\\n) -> Result<BTreeMap<String, V>, ParseError>\\n\\nwhere\\n\\n E: fmt::Display,\\n\\n{\\n\\n parse_map_inner(s, is_value_type_map, gen_elem)\\n\\n .map_err(|details| ParseError::invalid_input_syntax(\\\"map\\\", s).with_details(details))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 3,\n \"score\": 366892.6948497694\n },\n {\n \"content\": \"// From postgres-types/src/private.rs.\\n\\nfn read_value<'a, T>(type_: &PgType, buf: &mut &'a [u8]) -> Result<T, Box<dyn Error + Sync + Send>>\\n\\nwhere\\n\\n T: FromSql<'a>,\\n\\n{\\n\\n let len = read_be_i32(buf)?;\\n\\n let value = if len < 0 {\\n\\n None\\n\\n } else {\\n\\n if len as usize > buf.len() {\\n\\n return Err(\\\"invalid buffer size\\\".into());\\n\\n }\\n\\n let (head, tail) = buf.split_at(len as usize);\\n\\n *buf = tail;\\n\\n Some(head)\\n\\n };\\n\\n T::from_sql_nullable(type_, value)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sqllogictest/src/runner.rs\",\n \"rank\": 4,\n \"score\": 339400.8669043597\n },\n {\n \"content\": \"fn decode_copy_data(mut buf: Cursor, frame_len: usize) -> Result<FrontendMessage, io::Error> {\\n\\n let mut data = Vec::with_capacity(frame_len);\\n\\n for _ in 0..frame_len {\\n\\n data.push(buf.read_byte()?);\\n\\n }\\n\\n Ok(FrontendMessage::CopyData(data))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 5,\n \"score\": 337133.7503261285\n },\n {\n \"content\": \"fn pg_len(what: &str, len: usize) -> Result<i32, io::Error> {\\n\\n len.try_into().map_err(|_| {\\n\\n io::Error::new(\\n\\n io::ErrorKind::Other,\\n\\n format!(\\\"{} does not fit into an i32\\\", what),\\n\\n )\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgrepr/src/value.rs\",\n \"rank\": 6,\n \"score\": 336659.7391818324\n },\n {\n \"content\": \"pub fn extract_protobuf_header(buf: &[u8]) -> Result<(i32, &[u8])> {\\n\\n let (schema_id, buf) = extract_schema_id(buf, \\\"protobuf\\\")?;\\n\\n\\n\\n match buf.get(0) {\\n\\n Some(0) => Ok((schema_id, &buf[1..])),\\n\\n Some(message_id) => bail!(\\n\\n \\\"unsupported Confluent-style protobuf message descriptor id: \\\\\\n\\n expected 0, but found: {}. \\\\\\n\\n See https://github.com/MaterializeInc/materialize/issues/9250\\\",\\n\\n message_id\\n\\n ),\\n\\n None => bail!(\\n\\n \\\"Confluent-style protobuf datum is too few bytes: expected a message id after magic \\\\\\n\\n and schema id, got a buffer of length {}\\\",\\n\\n buf.len()\\n\\n ),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/interchange/src/confluent.rs\",\n \"rank\": 7,\n \"score\": 330304.71741876623\n },\n {\n \"content\": \"pub fn extract_avro_header(buf: &[u8]) -> Result<(i32, &[u8])> {\\n\\n extract_schema_id(buf, \\\"avro\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/interchange/src/confluent.rs\",\n \"rank\": 8,\n \"score\": 330304.71741876623\n },\n {\n \"content\": \"/// Reports whether the given stream begins with a pgwire handshake.\\n\\n///\\n\\n/// To avoid false negatives, there must be at least eight bytes in `buf`.\\n\\npub fn match_handshake(buf: &[u8]) -> bool {\\n\\n // The pgwire StartupMessage looks like this:\\n\\n //\\n\\n // i32 - Length of entire message.\\n\\n // i32 - Protocol version number.\\n\\n // [String] - Arbitrary key-value parameters of any length.\\n\\n //\\n\\n // Since arbitrary parameters can be included in the StartupMessage, the\\n\\n // first Int32 is worthless, since the message could have any length.\\n\\n // Instead, we sniff the protocol version number.\\n\\n if buf.len() < 8 {\\n\\n return false;\\n\\n }\\n\\n let version = NetworkEndian::read_i32(&buf[4..8]);\\n\\n VERSIONS.contains(&version)\\n\\n}\\n\\n\\n\\n/// Parameters for the [`run`] function.\\n\\npub struct RunParams<'a, A> {\\n\\n /// The TLS mode of the pgwire server.\\n\",\n \"file_path\": \"src/pgwire/src/protocol.rs\",\n \"rank\": 9,\n \"score\": 323402.1849503311\n },\n {\n \"content\": \"fn decode_query(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n Ok(FrontendMessage::Query {\\n\\n sql: buf.read_cstr()?.to_string(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 10,\n \"score\": 319910.1005898536\n },\n {\n \"content\": \"fn decode_close(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n match buf.read_byte()? {\\n\\n b'S' => Ok(FrontendMessage::CloseStatement {\\n\\n name: buf.read_cstr()?.to_owned(),\\n\\n }),\\n\\n b'P' => Ok(FrontendMessage::ClosePortal {\\n\\n name: buf.read_cstr()?.to_owned(),\\n\\n }),\\n\\n b => Err(input_err(format!(\\n\\n \\\"invalid type byte in close message: {}\\\",\\n\\n b\\n\\n ))),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 11,\n \"score\": 319910.1005898536\n },\n {\n \"content\": \"fn decode_password(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n Ok(FrontendMessage::Password {\\n\\n password: buf.read_cstr()?.to_owned(),\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 12,\n \"score\": 319910.1005898536\n },\n {\n \"content\": \"fn decode_execute(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n let portal_name = buf.read_cstr()?.to_string();\\n\\n let max_rows = buf.read_i32()?;\\n\\n Ok(FrontendMessage::Execute {\\n\\n portal_name,\\n\\n max_rows,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 13,\n \"score\": 319910.1005898536\n },\n {\n \"content\": \"fn decode_parse(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n let name = buf.read_cstr()?;\\n\\n let sql = buf.read_cstr()?;\\n\\n\\n\\n let mut param_types = vec![];\\n\\n for _ in 0..buf.read_i16()? {\\n\\n param_types.push(buf.read_u32()?);\\n\\n }\\n\\n\\n\\n Ok(FrontendMessage::Parse {\\n\\n name: name.into(),\\n\\n sql: sql.into(),\\n\\n param_types,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 14,\n \"score\": 319910.1005898536\n },\n {\n \"content\": \"fn decode_describe(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n let first_char = buf.read_byte()?;\\n\\n let name = buf.read_cstr()?.to_string();\\n\\n match first_char {\\n\\n b'S' => Ok(FrontendMessage::DescribeStatement { name }),\\n\\n b'P' => Ok(FrontendMessage::DescribePortal { name }),\\n\\n other => Err(input_err(format!(\\\"Invalid describe type: {:#x?}\\\", other))),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 15,\n \"score\": 319910.1005898536\n },\n {\n \"content\": \"fn decode_bind(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n let portal_name = buf.read_cstr()?.to_string();\\n\\n let statement_name = buf.read_cstr()?.to_string();\\n\\n\\n\\n let mut param_formats = Vec::new();\\n\\n for _ in 0..buf.read_i16()? {\\n\\n param_formats.push(buf.read_format()?);\\n\\n }\\n\\n\\n\\n let mut raw_params = Vec::new();\\n\\n for _ in 0..buf.read_i16()? {\\n\\n let len = buf.read_i32()?;\\n\\n if len == -1 {\\n\\n raw_params.push(None); // NULL\\n\\n } else {\\n\\n // TODO(benesch): this should use bytes::Bytes to avoid the copy.\\n\\n let mut value = Vec::new();\\n\\n for _ in 0..len {\\n\\n value.push(buf.read_byte()?);\\n\\n }\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 16,\n \"score\": 319910.1005898536\n },\n {\n \"content\": \"/// Blocking logic to read from a file, intended for its own thread.\\n\\npub fn read_file_task<Ctor, I, Err>(\\n\\n path: PathBuf,\\n\\n tx: std::sync::mpsc::SyncSender<Result<MessagePayload, anyhow::Error>>,\\n\\n activator: Option<SyncActivator>,\\n\\n read_style: FileReadStyle,\\n\\n compression: Compression,\\n\\n iter_ctor: Ctor,\\n\\n) where\\n\\n I: IntoIterator<Item = Result<MessagePayload, Err>> + Send + 'static,\\n\\n Ctor: FnOnce(Box<dyn AvroRead + Send>) -> Result<I, Err>,\\n\\n Err: Into<anyhow::Error>,\\n\\n{\\n\\n trace!(\\\"reading file {}\\\", path.display());\\n\\n let file = match std::fs::File::open(&path).with_context(|| {\\n\\n format!(\\n\\n \\\"file source: unable to open file at path {}\\\",\\n\\n path.to_string_lossy(),\\n\\n )\\n\\n }) {\\n\\n Ok(file) => file,\\n\",\n \"file_path\": \"src/storage/src/source/file.rs\",\n \"rank\": 17,\n \"score\": 318658.8776285278\n },\n {\n \"content\": \"fn decode_copy_fail(mut buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n Ok(FrontendMessage::CopyFail(buf.read_cstr()?.to_string()))\\n\\n}\\n\\n\\n\\n/// Decodes data within pgwire messages.\\n\\n///\\n\\n/// The API provided is very similar to [`bytes::Buf`], but operations return\\n\\n/// errors rather than panicking. This is important for safety, as we don't want\\n\\n/// to crash if the user sends us malformed pgwire messages.\\n\\n///\\n\\n/// There are also some special-purpose methods, like [`Cursor::read_cstr`],\\n\\n/// that are specific to pgwire messages.\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 18,\n \"score\": 315885.5259265753\n },\n {\n \"content\": \"pub fn read_long<R: Read>(reader: &mut R) -> Result<i64, AvroError> {\\n\\n zag_i64(reader)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/src/util.rs\",\n \"rank\": 19,\n \"score\": 314861.3406713669\n },\n {\n \"content\": \"pub fn safe_len(len: usize) -> Result<usize, AvroError> {\\n\\n let max_bytes = max_allocation_bytes(512 * 1024 * 1024);\\n\\n\\n\\n if len <= max_bytes {\\n\\n Ok(len)\\n\\n } else {\\n\\n Err(AvroError::Allocation {\\n\\n attempted: len,\\n\\n allowed: max_bytes,\\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_zigzag() {\\n\\n let mut a = Vec::new();\\n\",\n \"file_path\": \"src/avro/src/util.rs\",\n \"rank\": 20,\n \"score\": 312025.6450356312\n },\n {\n \"content\": \"fn decode_variable<R: Read>(reader: &mut R) -> Result<u64, AvroError> {\\n\\n let mut i = 0u64;\\n\\n let mut buf = [0u8; 1];\\n\\n\\n\\n let mut j = 0;\\n\\n loop {\\n\\n if j > 9 {\\n\\n // if j * 7 > 64\\n\\n return Err(AvroError::Decode(DecodeError::IntDecodeOverflow));\\n\\n }\\n\\n reader.read_exact(&mut buf[..])?;\\n\\n i |= (u64::from(buf[0] & 0x7F)) << (j * 7);\\n\\n if (buf[0] >> 7) == 0 {\\n\\n break;\\n\\n } else {\\n\\n j += 1;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/src/util.rs\",\n \"rank\": 21,\n \"score\": 309442.56051757664\n },\n {\n \"content\": \"#[inline]\\n\\nfn decode_long_nonneg<R: Read>(reader: &mut R) -> Result<u64, AvroError> {\\n\\n let u = match zag_i64(reader)? {\\n\\n i if i >= 0 => i as u64,\\n\\n i => return Err(AvroError::Decode(DecodeError::ExpectedNonnegInteger(i))),\\n\\n };\\n\\n Ok(u)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/src/decode.rs\",\n \"rank\": 22,\n \"score\": 305581.9401427486\n },\n {\n \"content\": \"pub fn give_value<D: AvroDecode>(d: D, v: &Value) -> Result<D::Out, AvroError> {\\n\\n use ValueOrReader::Value as V;\\n\\n match v {\\n\\n Value::Null => d.scalar(Scalar::Null),\\n\\n Value::Boolean(val) => d.scalar(Scalar::Boolean(*val)),\\n\\n Value::Int(val) => d.scalar(Scalar::Int(*val)),\\n\\n Value::Long(val) => d.scalar(Scalar::Long(*val)),\\n\\n Value::Float(val) => d.scalar(Scalar::Float(*val)),\\n\\n Value::Double(val) => d.scalar(Scalar::Double(*val)),\\n\\n Value::Date(val) => d.scalar(Scalar::Date(*val)),\\n\\n Value::Timestamp(val) => d.scalar(Scalar::Timestamp(*val)),\\n\\n // The &[u8] parameter here (and elsewhere in this function) is arbitrary, but we have to put in something in order for the function\\n\\n // to type-check\\n\\n Value::Decimal(val) => d.decimal::<&[u8]>(val.precision, val.scale, V(&val.unscaled)),\\n\\n Value::Bytes(val) => d.bytes::<&[u8]>(V(val)),\\n\\n Value::String(val) => d.string::<&[u8]>(V(val)),\\n\\n Value::Fixed(_len, val) => d.fixed::<&[u8]>(V(val)),\\n\\n Value::Enum(idx, symbol) => d.enum_variant(symbol, *idx as usize),\\n\\n Value::Union {\\n\\n index,\\n\",\n \"file_path\": \"src/avro/src/decode.rs\",\n \"rank\": 23,\n \"score\": 304756.19793467264\n },\n {\n \"content\": \"pub fn plan_read_then_write(\\n\\n kind: MutationKind,\\n\\n scx: &StatementContext,\\n\\n params: &Params,\\n\\n query::ReadThenWritePlan {\\n\\n id,\\n\\n mut selection,\\n\\n finishing,\\n\\n assignments,\\n\\n }: query::ReadThenWritePlan,\\n\\n) -> Result<Plan, anyhow::Error> {\\n\\n selection.bind_parameters(¶ms)?;\\n\\n let selection = selection.optimize_and_lower(&scx.into())?;\\n\\n let mut assignments_outer = HashMap::new();\\n\\n for (idx, mut set) in assignments {\\n\\n set.bind_parameters(¶ms)?;\\n\\n let set = set.lower_uncorrelated()?;\\n\\n assignments_outer.insert(idx, set);\\n\\n }\\n\\n\\n\\n Ok(Plan::ReadThenWrite(ReadThenWritePlan {\\n\\n id,\\n\\n selection,\\n\\n finishing,\\n\\n assignments: assignments_outer,\\n\\n kind,\\n\\n }))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql/src/plan/statement/dml.rs\",\n \"rank\": 24,\n \"score\": 302666.7648534512\n },\n {\n \"content\": \"#[test]\\n\\nfn test_no_default_value() -> Result<(), String> {\\n\\n let reader_schema = Schema::from_str(\\n\\n r#\\\"{\\n\\n \\\"type\\\": \\\"record\\\",\\n\\n \\\"name\\\": \\\"Test\\\",\\n\\n \\\"fields\\\": [\\n\\n {\\\"name\\\": \\\"H\\\", \\\"type\\\": \\\"int\\\"}\\n\\n ]\\n\\n }\\\"#,\\n\\n )\\n\\n .unwrap();\\n\\n let resolved_schema = resolve_schemas(&LONG_RECORD_SCHEMA, &reader_schema);\\n\\n match resolved_schema {\\n\\n Ok(_) => Err(String::from(\\\"Expected SchemaResolutionError, got Ok\\\")),\\n\\n Err(ref e) => {\\n\\n if let AvroError::ResolveSchema(_) = e {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(format!(\\\"Expected SchemaResultionError, got {}\\\", e))\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/tests/io.rs\",\n \"rank\": 25,\n \"score\": 301530.57087251055\n },\n {\n \"content\": \"#[test]\\n\\nfn test_type_exception() -> Result<(), String> {\\n\\n let writer_schema = Schema::from_str(\\n\\n r#\\\"\\n\\n {\\n\\n \\\"type\\\": \\\"record\\\",\\n\\n \\\"name\\\": \\\"Test\\\",\\n\\n \\\"fields\\\": [\\n\\n {\\\"name\\\": \\\"F\\\", \\\"type\\\": \\\"int\\\"},\\n\\n {\\\"name\\\": \\\"E\\\", \\\"type\\\": \\\"int\\\"}\\n\\n ]\\n\\n }\\n\\n \\\"#,\\n\\n )\\n\\n .unwrap();\\n\\n let datum_to_write = Value::Record(vec![\\n\\n (\\\"E\\\".to_string(), Value::Int(5)),\\n\\n (\\\"F\\\".to_string(), Value::String(String::from(\\\"Bad\\\"))),\\n\\n ]);\\n\\n let encoded = to_avro_datum(&writer_schema, datum_to_write);\\n\\n match encoded {\\n\\n Ok(_) => Err(String::from(\\\"Expected ValidationError, got Ok\\\")),\\n\\n Err(ref e) => match e.downcast_ref::<ValidationError>() {\\n\\n Some(_) => Ok(()),\\n\\n None => Err(format!(\\\"Expected ValidationError, got {}\\\", e)),\\n\\n },\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/tests/io.rs\",\n \"rank\": 26,\n \"score\": 301276.21926094155\n },\n {\n \"content\": \"/// Validate that the string is an allowed variable name (lowercase letters, numbers and dashes)\\n\\npub fn validate_ident(name: &str) -> Result<(), anyhow::Error> {\\n\\n lazy_static! {\\n\\n static ref VALID_KEY_REGEX: Regex = Regex::new(\\\"^[a-z0-9\\\\\\\\-]*$\\\").unwrap();\\n\\n }\\n\\n if !VALID_KEY_REGEX.is_match(name) {\\n\\n bail!(\\n\\n \\\"invalid builtin argument name '{}': \\\\\\n\\n only lowercase letters, numbers, and hyphens allowed\\\",\\n\\n name\\n\\n );\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/testdrive/src/parser.rs\",\n \"rank\": 27,\n \"score\": 300697.267059566\n },\n {\n \"content\": \"pub fn zag_i32<R: Read>(reader: &mut R) -> Result<i32, AvroError> {\\n\\n let i = zag_i64(reader)?;\\n\\n if i < i64::from(i32::min_value()) || i > i64::from(i32::max_value()) {\\n\\n Err(AvroError::Decode(DecodeError::I32OutOfRange(i)))\\n\\n } else {\\n\\n Ok(i as i32)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/src/util.rs\",\n \"rank\": 28,\n \"score\": 298814.4013601596\n },\n {\n \"content\": \"pub fn zag_i64<R: Read>(reader: &mut R) -> Result<i64, AvroError> {\\n\\n let z = decode_variable(reader)?;\\n\\n Ok(if z & 0x1 == 0 {\\n\\n (z >> 1) as i64\\n\\n } else {\\n\\n !(z >> 1) as i64\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/src/util.rs\",\n \"rank\": 29,\n \"score\": 298814.4013601596\n },\n {\n \"content\": \"fn parse_frame_len(src: &[u8]) -> Result<usize, io::Error> {\\n\\n let n = usize::cast_from(NetworkEndian::read_u32(src));\\n\\n if n > netio::MAX_FRAME_SIZE {\\n\\n return Err(io::Error::new(\\n\\n io::ErrorKind::InvalidData,\\n\\n netio::FrameTooBig,\\n\\n ));\\n\\n } else if n < 4 {\\n\\n return Err(io::Error::new(\\n\\n io::ErrorKind::InvalidInput,\\n\\n \\\"invalid frame length\\\",\\n\\n ));\\n\\n }\\n\\n Ok(n - 4)\\n\\n}\\n\\n\\n\\nimpl Decoder for Codec {\\n\\n type Item = FrontendMessage;\\n\\n type Error = io::Error;\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 30,\n \"score\": 297351.0688079734\n },\n {\n \"content\": \"fn analyze_type(ty: &syn::Type) -> Result<Type> {\\n\\n match ty {\\n\\n syn::Type::Path(syn::TypePath { qself: None, path }) => match path.segments.len() {\\n\\n 2 => {\\n\\n let name = path.segments.iter().map(|s| s.ident.to_string()).join(\\\"::\\\");\\n\\n Ok(Type::Abstract(name))\\n\\n }\\n\\n 1 => {\\n\\n let segment = path.segments.last().unwrap();\\n\\n let segment_name = segment.ident.to_string();\\n\\n\\n\\n let container = |construct_ty: fn(Box<Type>) -> Type| match &segment.arguments {\\n\\n syn::PathArguments::AngleBracketed(args) if args.args.len() == 1 => {\\n\\n match args.args.last().unwrap() {\\n\\n syn::GenericArgument::Type(ty) => {\\n\\n let inner = Box::new(analyze_type(ty)?);\\n\\n Ok(construct_ty(inner))\\n\\n }\\n\\n _ => bail!(\\\"Container type argument is not a basic (i.e., non-lifetime, non-constraint) type argument: {}\\\", ty.into_token_stream()),\\n\\n }\\n\",\n \"file_path\": \"src/walkabout/src/ir.rs\",\n \"rank\": 31,\n \"score\": 296840.9994950369\n },\n {\n \"content\": \"/// Parses a SQL string containing a single data type.\\n\\npub fn parse_data_type(sql: &str) -> Result<UnresolvedDataType, ParserError> {\\n\\n let tokens = lexer::lex(sql)?;\\n\\n let mut parser = Parser::new(sql, tokens);\\n\\n let data_type = parser.parse_data_type()?;\\n\\n if parser.next_token().is_some() {\\n\\n parser_err!(\\n\\n parser,\\n\\n parser.peek_prev_pos(),\\n\\n \\\"extra token after data type\\\"\\n\\n )\\n\\n } else {\\n\\n Ok(data_type)\\n\\n }\\n\\n}\\n\\n\\n\\nmacro_rules! maybe {\\n\\n ($e:expr) => {{\\n\\n if let Some(v) = $e {\\n\\n return Ok(v);\\n\\n }\\n\\n }};\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql-parser/src/parser.rs\",\n \"rank\": 32,\n \"score\": 296358.3271745347\n },\n {\n \"content\": \"pub fn neg_interval(a: Datum) -> Result<Datum, EvalError> {\\n\\n neg_interval_inner(a).map(Datum::from)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/expr/src/scalar/func.rs\",\n \"rank\": 33,\n \"score\": 296340.1864413796\n },\n {\n \"content\": \"/// Decode a `Value` encoded in Avro format given its `Schema` and anything implementing `io::Read`\\n\\n/// to read from.\\n\\n///\\n\\n/// In case a reader `Schema` is provided, schema resolution will also be performed.\\n\\n///\\n\\n/// **NOTE** This function has a quite small niche of usage and does NOT take care of reading the\\n\\n/// header and consecutive data blocks; use [`Reader`](struct.Reader.html) if you don't know what\\n\\n/// you are doing, instead.\\n\\npub fn from_avro_datum<R: AvroRead>(schema: &Schema, reader: &mut R) -> Result<Value, AvroError> {\\n\\n let value = decode(schema.top_node(), reader)?;\\n\\n Ok(value)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::types::{Record, ToAvro};\\n\\n use crate::Reader;\\n\\n\\n\\n use std::io::Cursor;\\n\\n\\n\\n static SCHEMA: &str = r#\\\"\\n\\n {\\n\\n \\\"type\\\": \\\"record\\\",\\n\\n \\\"name\\\": \\\"test\\\",\\n\\n \\\"fields\\\": [\\n\\n {\\\"name\\\": \\\"a\\\", \\\"type\\\": \\\"long\\\", \\\"default\\\": 42},\\n\\n {\\\"name\\\": \\\"b\\\", \\\"type\\\": \\\"string\\\"}\\n\",\n \"file_path\": \"src/avro/src/reader.rs\",\n \"rank\": 34,\n \"score\": 295430.20924510364\n },\n {\n \"content\": \"/// Escapes a list, record, or map element in place.\\n\\n///\\n\\n/// The element must start at `start` and extend to the end of the buffer. The\\n\\n/// buffer will be resized if escaping is necessary to account for the\\n\\n/// additional escape characters.\\n\\n///\\n\\n/// The `needs_escaping` function is used to determine whether an element needs\\n\\n/// to be escaped. It is provided with the bytes of each element and should\\n\\n/// return whether the element needs to be escaped.\\n\\nfn escape_elem<F, E>(buf: &mut F, start: usize)\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n E: ElementEscaper,\\n\\n{\\n\\n let elem = &buf.as_ref()[start..];\\n\\n if !E::needs_escaping(elem) {\\n\\n return;\\n\\n }\\n\\n\\n\\n // We'll need two extra bytes for the quotes at the start and end of the\\n\\n // element, plus an extra byte for each quote and backslash.\\n\\n let extras = 2 + elem.iter().filter(|b| matches!(b, b'\\\"' | b'\\\\\\\\')).count();\\n\\n let orig_end = buf.len();\\n\\n let new_end = buf.len() + extras;\\n\\n\\n\\n // Pad the buffer to the new length. These characters will all be\\n\\n // overwritten.\\n\\n //\\n\\n // NOTE(benesch): we never read these characters, so we could instead use\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 35,\n \"score\": 292442.9627873262\n },\n {\n \"content\": \"fn decode_terminate(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n // Nothing more to decode.\\n\\n Ok(FrontendMessage::Terminate)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 36,\n \"score\": 287758.9564038578\n },\n {\n \"content\": \"fn decode_sync(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n // Nothing more to decode.\\n\\n Ok(FrontendMessage::Sync)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 37,\n \"score\": 287758.9564038578\n },\n {\n \"content\": \"fn decode_flush(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n // Nothing more to decode.\\n\\n Ok(FrontendMessage::Flush)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 38,\n \"score\": 287758.9564038578\n },\n {\n \"content\": \"pub fn parse_numeric(s: &str) -> Result<OrderedDecimal<Numeric>, ParseError> {\\n\\n let mut cx = numeric::cx_datum();\\n\\n let mut n = match cx.parse(s.trim()) {\\n\\n Ok(n) => n,\\n\\n Err(..) => {\\n\\n return Err(ParseError::invalid_input_syntax(\\\"numeric\\\", s));\\n\\n }\\n\\n };\\n\\n\\n\\n let cx_status = cx.status();\\n\\n\\n\\n // Check for values that can only be generated by invalid syntax.\\n\\n if (n.is_infinite() && !cx_status.overflow())\\n\\n || (n.is_nan() && n.is_negative())\\n\\n || n.is_signaling_nan()\\n\\n {\\n\\n return Err(ParseError::invalid_input_syntax(\\\"numeric\\\", s));\\n\\n }\\n\\n\\n\\n // Process value; only errors if value is out of range of numeric's max precision.\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 39,\n \"score\": 286790.9766378891\n },\n {\n \"content\": \"/// Plans a slice of expressions.\\n\\n///\\n\\n/// This function is a simple convenience function for mapping [`plan_expr`]\\n\\n/// over a slice of expressions. The planned expressions are returned in the\\n\\n/// same order as the input. If any of the expressions fail to plan, returns an\\n\\n/// error instead.\\n\\nfn plan_exprs<E>(ecx: &ExprContext, exprs: &[E]) -> Result<Vec<CoercibleScalarExpr>, PlanError>\\n\\nwhere\\n\\n E: std::borrow::Borrow<Expr<Aug>>,\\n\\n{\\n\\n let mut out = vec![];\\n\\n for expr in exprs {\\n\\n out.push(plan_expr(ecx, expr.borrow())?);\\n\\n }\\n\\n Ok(out)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql/src/plan/query.rs\",\n \"rank\": 40,\n \"score\": 286460.63313526195\n },\n {\n \"content\": \"fn decode_copy_done(mut _buf: Cursor) -> Result<FrontendMessage, io::Error> {\\n\\n // Nothing more to decode.\\n\\n Ok(FrontendMessage::CopyDone)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pgwire/src/codec.rs\",\n \"rank\": 41,\n \"score\": 283734.3817405795\n },\n {\n \"content\": \"fn parse_map_inner<'a, V, E>(\\n\\n s: &'a str,\\n\\n is_value_type_map: bool,\\n\\n mut gen_elem: impl FnMut(Cow<'a, str>) -> Result<V, E>,\\n\\n) -> Result<BTreeMap<String, V>, String>\\n\\nwhere\\n\\n E: fmt::Display,\\n\\n{\\n\\n let mut map = BTreeMap::new();\\n\\n let buf = &mut LexBuf::new(s);\\n\\n\\n\\n // Consume opening paren.\\n\\n if !buf.consume('{') {\\n\\n bail!(\\n\\n \\\"expected '{{', found {}\\\",\\n\\n match buf.next() {\\n\\n Some(c) => format!(\\\"{}\\\", c),\\n\\n None => \\\"empty string\\\".to_string(),\\n\\n }\\n\\n )\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 42,\n \"score\": 283143.0009626483\n },\n {\n \"content\": \"/// Returns `n`'s precision, i.e. the total number of digits represented by `n`\\n\\n/// in standard notation not including a zero in the \\\"one's place\\\" in (-1,1).\\n\\npub fn get_precision<const N: usize>(n: &Decimal<N>) -> u32 {\\n\\n let e = n.exponent();\\n\\n if e >= 0 {\\n\\n // Positive exponent\\n\\n n.digits() + u32::try_from(e).unwrap()\\n\\n } else {\\n\\n // Negative exponent\\n\\n let d = n.digits();\\n\\n let e = u32::try_from(e.abs()).unwrap();\\n\\n // Precision is...\\n\\n // - d if decimal point splits numbers\\n\\n // - e if e dominates number of digits\\n\\n std::cmp::max(d, e)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/adt/numeric.rs\",\n \"rank\": 43,\n \"score\": 282507.8693858553\n },\n {\n \"content\": \"// This function is derived from code in the avro_rs project. Update the license\\n\\n// header on this file accordingly if you move it to a new home.\\n\\npub fn from_json(json: &JsonValue, schema: SchemaNode) -> Result<Value, anyhow::Error> {\\n\\n match (json, schema.inner) {\\n\\n (JsonValue::Null, SchemaPiece::Null) => Ok(Value::Null),\\n\\n (JsonValue::Bool(b), SchemaPiece::Boolean) => Ok(Value::Boolean(*b)),\\n\\n (JsonValue::Number(ref n), SchemaPiece::Int) => {\\n\\n Ok(Value::Int(n.as_i64().unwrap().try_into()?))\\n\\n }\\n\\n (JsonValue::Number(ref n), SchemaPiece::Long) => Ok(Value::Long(n.as_i64().unwrap())),\\n\\n (JsonValue::Number(ref n), SchemaPiece::Float) => {\\n\\n Ok(Value::Float(n.as_f64().unwrap() as f32))\\n\\n }\\n\\n (JsonValue::Number(ref n), SchemaPiece::Double) => Ok(Value::Double(n.as_f64().unwrap())),\\n\\n (JsonValue::Number(ref n), SchemaPiece::Date) => Ok(Value::Date(\\n\\n chrono::NaiveDate::from_ymd(1970, 1, 1) + chrono::Duration::days(n.as_i64().unwrap()),\\n\\n )),\\n\\n (JsonValue::Number(ref n), SchemaPiece::TimestampMilli) => {\\n\\n let ts = n.as_i64().unwrap();\\n\\n Ok(Value::Timestamp(chrono::NaiveDateTime::from_timestamp(\\n\\n ts / 1_000,\\n\\n ((ts % 1_000) * 1_000_000) as u32,\\n\",\n \"file_path\": \"src/testdrive/src/format/avro.rs\",\n \"rank\": 44,\n \"score\": 282170.60964756244\n },\n {\n \"content\": \"/// Encodes an BlobUnsealedBatch into the Arrow file format.\\n\\n///\\n\\n/// NB: This is currently unused, but it's here because we may want to use it\\n\\n/// for the local cache and so we can easily compare arrow vs parquet.\\n\\npub fn encode_unsealed_arrow<W: Write>(w: &mut W, batch: &BlobUnsealedBatch) -> Result<(), Error> {\\n\\n let mut metadata = BTreeMap::new();\\n\\n metadata.insert(\\n\\n INLINE_METADATA_KEY.into(),\\n\\n encode_unsealed_inline_meta(batch, ProtoBatchFormat::ArrowKvtd),\\n\\n );\\n\\n let schema = Schema::from(SCHEMA_ARROW_KVTD.fields.clone()).with_metadata(metadata);\\n\\n let options = WriteOptions { compression: None };\\n\\n let mut writer = FileWriter::try_new(w, &schema, None, options)?;\\n\\n for records in batch.updates.iter() {\\n\\n writer.write(&encode_arrow_batch_kvtd(records), None)?;\\n\\n }\\n\\n writer.finish()?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/arrow.rs\",\n \"rank\": 45,\n \"score\": 279601.2005028077\n },\n {\n \"content\": \"/// Decodes a BlobUnsealedBatch from the Arrow file format.\\n\\n///\\n\\n/// NB: This is currently unused, but it's here because we may want to use it\\n\\n/// for the local cache and so we can easily compare arrow vs parquet.\\n\\npub fn decode_unsealed_arrow<R: Read + Seek>(r: &mut R) -> Result<BlobUnsealedBatch, Error> {\\n\\n let file_meta = read_file_metadata(r)?;\\n\\n let (format, meta) =\\n\\n decode_unsealed_inline_meta(file_meta.schema.metadata.get(INLINE_METADATA_KEY))?;\\n\\n\\n\\n let updates = match format {\\n\\n ProtoBatchFormat::Unknown => return Err(\\\"unknown format\\\".into()),\\n\\n ProtoBatchFormat::ArrowKvtd => decode_arrow_file_kvtd(r, file_meta)?,\\n\\n ProtoBatchFormat::ParquetKvtd => {\\n\\n return Err(\\\"ParquetKvtd format not supported in arrow\\\".into())\\n\\n }\\n\\n };\\n\\n\\n\\n let ret = BlobUnsealedBatch {\\n\\n desc: SeqNo(meta.seqno_lower)..SeqNo(meta.seqno_upper),\\n\\n updates,\\n\\n };\\n\\n ret.validate()?;\\n\\n Ok(ret)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/arrow.rs\",\n \"rank\": 46,\n \"score\": 279572.1217076591\n },\n {\n \"content\": \"/// Decodes a BlobUnsealedBatch from the Parquet format.\\n\\npub fn decode_unsealed_parquet<R: Read + Seek>(r: &mut R) -> Result<BlobUnsealedBatch, Error> {\\n\\n let metadata = read_metadata(r).map_err(|err| err.to_string())?;\\n\\n let metadata = metadata\\n\\n .key_value_metadata()\\n\\n .as_ref()\\n\\n .and_then(|x| x.iter().find(|x| x.key == INLINE_METADATA_KEY));\\n\\n let (format, meta) = decode_unsealed_inline_meta(metadata.and_then(|x| x.value.as_ref()))?;\\n\\n\\n\\n let updates = match format {\\n\\n ProtoBatchFormat::Unknown => return Err(\\\"unknown format\\\".into()),\\n\\n ProtoBatchFormat::ArrowKvtd => {\\n\\n return Err(\\\"ArrowKvtd format not supported in parquet\\\".into())\\n\\n }\\n\\n ProtoBatchFormat::ParquetKvtd => decode_parquet_file_kvtd(r)?,\\n\\n };\\n\\n\\n\\n let ret = BlobUnsealedBatch {\\n\\n desc: SeqNo(meta.seqno_lower)..SeqNo(meta.seqno_upper),\\n\\n updates,\\n\\n };\\n\\n ret.validate()?;\\n\\n Ok(ret)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/parquet.rs\",\n \"rank\": 47,\n \"score\": 279565.86272884463\n },\n {\n \"content\": \"/// Parses a buffer of two's complement digits in big-endian order and converts\\n\\n/// them to [`Decimal<N>`].\\n\\npub fn twos_complement_be_to_numeric_inner<D: Dec<N>, const N: usize>(\\n\\n input: &mut [u8],\\n\\n) -> Result<Decimal<N>, anyhow::Error> {\\n\\n let is_neg = if (input[0] & 0x80) != 0 {\\n\\n // byte-level negate all negative values, guaranteeing all bytes are\\n\\n // readable as unsigned.\\n\\n negate_twos_complement_le(input.iter_mut().rev());\\n\\n true\\n\\n } else {\\n\\n false\\n\\n };\\n\\n\\n\\n let head = input.len() % 16;\\n\\n let i = twos_complement_be_to_u128(&input[0..head]);\\n\\n let mut cx = D::context();\\n\\n let mut d = cx.from_u128(i);\\n\\n\\n\\n for c in input[head..].chunks(16) {\\n\\n assert_eq!(c.len(), 16);\\n\\n // essentially d << 128\\n\",\n \"file_path\": \"src/repr/src/adt/numeric.rs\",\n \"rank\": 48,\n \"score\": 279443.4619689743\n },\n {\n \"content\": \"#[inline]\\n\\nfn decode_len<R: Read>(reader: &mut R) -> Result<usize, AvroError> {\\n\\n zag_i64(reader).and_then(|i| safe_len(i as usize))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/src/decode.rs\",\n \"rank\": 49,\n \"score\": 278888.0889103903\n },\n {\n \"content\": \"pub fn format_pg_legacy_char<B>(buf: &mut B, c: u8) -> Result<(), EvalError>\\n\\nwhere\\n\\n B: FormatBuffer,\\n\\n{\\n\\n // PostgreSQL is willing to hold invalid UTF-8 in a `Datum::String`, but\\n\\n // we are not.\\n\\n match str::from_utf8(&[c]) {\\n\\n Ok(s) => {\\n\\n buf.write_str(s);\\n\\n Ok(())\\n\\n }\\n\\n Err(_) => Err(EvalError::InvalidByteSequence {\\n\\n byte_sequence: format!(\\\"{:#02x}\\\", c),\\n\\n encoding_name: \\\"UTF8\\\".into(),\\n\\n }),\\n\\n }\\n\\n}\\n\\n\\n\\nsqlfunc!(\\n\\n #[sqlname = \\\"pglegacychartostr\\\"]\\n\",\n \"file_path\": \"src/expr/src/scalar/func/impls/pg_legacy_char.rs\",\n \"rank\": 50,\n \"score\": 278591.83369244554\n },\n {\n \"content\": \"/// Lexes a SQL query.\\n\\n///\\n\\n/// Returns a list of tokens alongside their corresponding byte offset in the\\n\\n/// input string. Returns an error if the SQL query is lexically invalid.\\n\\n///\\n\\n/// See the module documentation for more information about the lexical\\n\\n/// structure of SQL.\\n\\npub fn lex(query: &str) -> Result<Vec<(Token, usize)>, ParserError> {\\n\\n let buf = &mut LexBuf::new(query);\\n\\n let mut tokens = vec![];\\n\\n while let Some(ch) = buf.next() {\\n\\n let pos = buf.pos() - ch.len_utf8();\\n\\n let token = match ch {\\n\\n _ if ch.is_ascii_whitespace() => continue,\\n\\n '-' if buf.consume('-') => {\\n\\n lex_line_comment(buf);\\n\\n continue;\\n\\n }\\n\\n '/' if buf.consume('*') => {\\n\\n lex_multiline_comment(buf)?;\\n\\n continue;\\n\\n }\\n\\n '\\\\'' => Token::String(lex_string(buf)?),\\n\\n 'x' | 'X' if buf.consume('\\\\'') => Token::HexString(lex_string(buf)?),\\n\\n 'e' | 'E' if buf.consume('\\\\'') => lex_extended_string(buf)?,\\n\\n 'A'..='Z' | 'a'..='z' | '_' | '\\\\u{80}'..=char::MAX => lex_ident(buf),\\n\\n '\\\"' => lex_quoted_ident(buf)?,\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 51,\n \"score\": 277970.7177351316\n },\n {\n \"content\": \"/// Returns a new context appropriate for operating on numeric datums.\\n\\npub fn cx_datum() -> Context<Numeric> {\\n\\n CX_DATUM.clone()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/adt/numeric.rs\",\n \"rank\": 52,\n \"score\": 277755.896766486\n },\n {\n \"content\": \"/// Constructs a sink that consumes its input and sends it nowhere.\\n\\npub fn dev_null<T, E>() -> DevNull<T, E> {\\n\\n DevNull(PhantomData, PhantomData)\\n\\n}\\n\\n\\n\\n/// A sink that consumes its input and sends it nowhere.\\n\\n///\\n\\n/// Primarily useful as a base sink when folding multiple sinks into one using\\n\\n/// [`futures::sink::SinkExt::fanout`].\\n\\n#[derive(Debug)]\\n\\npub struct DevNull<T, E>(PhantomData<T>, PhantomData<E>);\\n\\n\\n\\nimpl<T, E> Sink<T> for DevNull<T, E> {\\n\\n type Error = E;\\n\\n\\n\\n fn poll_ready(self: Pin<&mut Self>, _: &mut Context) -> Poll<Result<(), Self::Error>> {\\n\\n Poll::Ready(Ok(()))\\n\\n }\\n\\n\\n\\n fn start_send(self: Pin<&mut Self>, _: T) -> Result<(), Self::Error> {\\n\\n Ok(())\\n\",\n \"file_path\": \"src/ore/src/future.rs\",\n \"rank\": 53,\n \"score\": 276976.8531052865\n },\n {\n \"content\": \"/// Check a const-sized array of `constraints` against a sequence of `quantifiers`,\\n\\n/// and call `on_failure` for constraints that are not satisfied by the sequence.\\n\\n///\\n\\n/// A `constraint[i]` is violated iff one of the following conditions are met:\\n\\n/// - The number of `quantifiers` with satisfied type is within the given range.\\n\\n/// - All `quantifiers` with satisfied type also satisfy the quantifier box constraints.\\n\\nfn check_constraints<'a, const N: usize>(\\n\\n constraints: &[QuantifierConstraint; N],\\n\\n quantifiers: impl Iterator<Item = BoundRef<'a, Quantifier>>,\\n\\n model: &'a Model,\\n\\n mut on_failure: impl FnMut(&QuantifierConstraint) -> (),\\n\\n) {\\n\\n // count quantifiers with satisfied type and associated box types\\n\\n let mut q_type_counts = [0; N];\\n\\n let mut b_type_counts = [0; N];\\n\\n for q in quantifiers {\\n\\n for i in 0..N {\\n\\n if constraints[i].satisfies_q_type(&q) {\\n\\n q_type_counts[i] += 1;\\n\\n b_type_counts[i] += constraints[i].satisfies_b_type(&q, model) as usize;\\n\\n }\\n\\n }\\n\\n }\\n\\n // call on_failure for violated constraints\\n\\n for i in 0..N {\\n\\n let q_type_count_ok = constraints[i].contains(&q_type_counts[i]);\\n\",\n \"file_path\": \"src/sql/src/query_model/validator/quantifier.rs\",\n \"rank\": 54,\n \"score\": 276805.6734944304\n },\n {\n \"content\": \"/// Encodes an BlobTraceBatchPart into the Arrow file format.\\n\\n///\\n\\n/// NB: This is currently unused, but it's here because we may want to use it\\n\\n/// for the local cache and so we can easily compare arrow vs parquet.\\n\\npub fn encode_trace_arrow<W: Write>(w: &mut W, batch: &BlobTraceBatchPart) -> Result<(), Error> {\\n\\n let mut metadata = BTreeMap::new();\\n\\n metadata.insert(\\n\\n INLINE_METADATA_KEY.into(),\\n\\n encode_trace_inline_meta(batch, ProtoBatchFormat::ArrowKvtd),\\n\\n );\\n\\n let schema = Schema::from(SCHEMA_ARROW_KVTD.fields.clone()).with_metadata(metadata);\\n\\n let options = WriteOptions { compression: None };\\n\\n let mut writer = FileWriter::try_new(w, &schema, None, options)?;\\n\\n for records in batch.updates.iter() {\\n\\n writer.write(&encode_arrow_batch_kvtd(&records), None)?;\\n\\n }\\n\\n writer.finish()?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/arrow.rs\",\n \"rank\": 55,\n \"score\": 276431.06377151294\n },\n {\n \"content\": \"/// Encodes an BlobTraceBatchPart into the Parquet format.\\n\\npub fn encode_trace_parquet<W: Write>(w: &mut W, batch: &BlobTraceBatchPart) -> Result<(), Error> {\\n\\n encode_parquet_kvtd(\\n\\n w,\\n\\n encode_trace_inline_meta(batch, ProtoBatchFormat::ParquetKvtd),\\n\\n &batch.updates,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/parquet.rs\",\n \"rank\": 56,\n \"score\": 276424.8380122322\n },\n {\n \"content\": \"/// Decodes a BlobTraceBatchPart from the Arrow file format.\\n\\n///\\n\\n/// NB: This is currently unused, but it's here because we may want to use it\\n\\n/// for the local cache and so we can easily compare arrow vs parquet.\\n\\npub fn decode_trace_arrow<R: Read + Seek>(r: &mut R) -> Result<BlobTraceBatchPart, Error> {\\n\\n let file_meta = read_file_metadata(r)?;\\n\\n let (format, meta) =\\n\\n decode_trace_inline_meta(file_meta.schema.metadata.get(INLINE_METADATA_KEY))?;\\n\\n\\n\\n let updates = match format {\\n\\n ProtoBatchFormat::Unknown => return Err(\\\"unknown format\\\".into()),\\n\\n ProtoBatchFormat::ArrowKvtd => decode_arrow_file_kvtd(r, file_meta)?,\\n\\n ProtoBatchFormat::ParquetKvtd => {\\n\\n return Err(\\\"ParquetKvtd format not supported in arrow\\\".into())\\n\\n }\\n\\n };\\n\\n\\n\\n let ret = BlobTraceBatchPart {\\n\\n desc: meta.desc.map_or_else(\\n\\n || {\\n\\n Description::new(\\n\\n Antichain::from_elem(u64::minimum()),\\n\\n Antichain::from_elem(u64::minimum()),\\n\\n Antichain::from_elem(u64::minimum()),\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/arrow.rs\",\n \"rank\": 57,\n \"score\": 276402.2864706712\n },\n {\n \"content\": \"/// Decodes a BlobTraceBatchPart from the Parquet format.\\n\\npub fn decode_trace_parquet<R: Read + Seek>(r: &mut R) -> Result<BlobTraceBatchPart, Error> {\\n\\n let metadata = read_metadata(r).map_err(|err| err.to_string())?;\\n\\n let metadata = metadata\\n\\n .key_value_metadata()\\n\\n .as_ref()\\n\\n .and_then(|x| x.iter().find(|x| x.key == INLINE_METADATA_KEY));\\n\\n let (format, meta) = decode_trace_inline_meta(metadata.and_then(|x| x.value.as_ref()))?;\\n\\n\\n\\n let updates = match format {\\n\\n ProtoBatchFormat::Unknown => return Err(\\\"unknown format\\\".into()),\\n\\n ProtoBatchFormat::ArrowKvtd => {\\n\\n return Err(\\\"ArrowKVTD format not supported in parquet\\\".into())\\n\\n }\\n\\n ProtoBatchFormat::ParquetKvtd => decode_parquet_file_kvtd(r)?,\\n\\n };\\n\\n\\n\\n let ret = BlobTraceBatchPart {\\n\\n desc: meta.desc.map_or_else(\\n\\n || {\\n\\n Description::new(\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/parquet.rs\",\n \"rank\": 58,\n \"score\": 276396.0607113904\n },\n {\n \"content\": \"fn write_error_heading(stream: &mut StandardStream, color_spec: &ColorSpec) -> io::Result<()> {\\n\\n stream.set_color(color_spec.clone().set_fg(Some(Color::Red)))?;\\n\\n write!(stream, \\\"error: \\\")?;\\n\\n stream.set_color(color_spec)\\n\\n}\\n\\n\\n\\nimpl From<anyhow::Error> for Error {\\n\\n fn from(source: anyhow::Error) -> Error {\\n\\n Error {\\n\\n source,\\n\\n location: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) struct ErrorLocation {\\n\\n filename: PathBuf,\\n\\n snippet: String,\\n\\n line: usize,\\n\\n col: usize,\\n\",\n \"file_path\": \"src/testdrive/src/error.rs\",\n \"rank\": 59,\n \"score\": 276172.2595662848\n },\n {\n \"content\": \"/// Returns a new context appropriate for operating on numeric aggregates.\\n\\npub fn cx_agg() -> Context<NumericAgg> {\\n\\n CX_AGG.clone()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/adt/numeric.rs\",\n \"rank\": 60,\n \"score\": 274173.2544184305\n },\n {\n \"content\": \"pub fn parse_list<'a, T, E>(\\n\\n s: &'a str,\\n\\n is_element_type_list: bool,\\n\\n make_null: impl FnMut() -> T,\\n\\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\\n\\n) -> Result<Vec<T>, ParseError>\\n\\nwhere\\n\\n E: fmt::Display,\\n\\n{\\n\\n parse_list_inner(s, is_element_type_list, make_null, gen_elem)\\n\\n .map_err(|details| ParseError::invalid_input_syntax(\\\"list\\\", s).with_details(details))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 61,\n \"score\": 274171.6110194943\n },\n {\n \"content\": \"pub fn parse_array<'a, T, E>(\\n\\n s: &'a str,\\n\\n make_null: impl FnMut() -> T,\\n\\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\\n\\n) -> Result<Vec<T>, ParseError>\\n\\nwhere\\n\\n E: fmt::Display,\\n\\n{\\n\\n parse_array_inner(s, make_null, gen_elem)\\n\\n .map_err(|details| ParseError::invalid_input_syntax(\\\"array\\\", s).with_details(details))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 62,\n \"score\": 274171.6110194943\n },\n {\n \"content\": \"pub fn format_numeric<F>(buf: &mut F, n: &OrderedDecimal<Numeric>) -> Nestable\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n write!(buf, \\\"{}\\\", n.0.to_standard_notation_string());\\n\\n Nestable::Yes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 63,\n \"score\": 274067.91431316116\n },\n {\n \"content\": \"/// Extracts the schema_id placed in front of the serialized message by the confluent stack\\n\\n/// Optionally expect an empty\\n\\n///\\n\\n/// This function returns the schema_id and a subslice of the rest of the buffer\\n\\nfn extract_schema_id<'buf>(buf: &'buf [u8], protocol: &str) -> Result<(i32, &'buf [u8])> {\\n\\n // The first byte is a magic byte (0) that indicates the Confluent\\n\\n // serialization format version, and the next four bytes are a big\\n\\n // endian 32-bit schema ID.\\n\\n //\\n\\n // https://docs.confluent.io/current/schema-registry/docs/serializer-formatter.html#wire-format\\n\\n //\\n\\n // For formats like protobuf, confluent adds additional information related to\\n\\n // which message in the proto file\\n\\n\\n\\n let expected_len = 5;\\n\\n\\n\\n if buf.len() < expected_len {\\n\\n bail!(\\n\\n \\\"Confluent-style {} datum is too few bytes: expected at least {} bytes, got {}\\\",\\n\\n protocol,\\n\\n expected_len,\\n\\n buf.len()\\n\\n );\\n\\n }\\n\",\n \"file_path\": \"src/interchange/src/confluent.rs\",\n \"rank\": 64,\n \"score\": 273911.34707834804\n },\n {\n \"content\": \"pub fn ensure() -> Result<(), anyhow::Error> {\\n\\n println!(\\\"ensuring all npm packages are up-to-date...\\\");\\n\\n\\n\\n let client = reqwest::blocking::Client::new();\\n\\n for pkg in NPM_PACKAGES {\\n\\n if pkg.compute_digest().ok().as_deref() == Some(&pkg.digest) {\\n\\n println!(\\\"{} is up-to-date\\\", pkg.name);\\n\\n continue;\\n\\n } else {\\n\\n println!(\\\"{} needs updating...\\\", pkg.name);\\n\\n }\\n\\n\\n\\n let url = format!(\\n\\n \\\"https://registry.npmjs.org/{}/-/{}-{}.tgz\\\",\\n\\n pkg.name,\\n\\n pkg.name.split('/').last().unwrap(),\\n\\n pkg.version,\\n\\n );\\n\\n let res = client\\n\\n .get(&url)\\n\",\n \"file_path\": \"src/npm/src/lib.rs\",\n \"rank\": 65,\n \"score\": 273572.5695458639\n },\n {\n \"content\": \"/// Creates a temporary copy of Materialize's mzdata databases\\n\\n///\\n\\n/// This is useful because running validations against the catalog can conflict with the running\\n\\n/// Materialize instance. Therefore it's better to run validations on a copy of the catalog.\\n\\npub fn mzdata_copy(catalog_path: &PathBuf) -> Result<TempDir, anyhow::Error> {\\n\\n let temp_dir = tempfile::tempdir()?;\\n\\n fs::copy(\\n\\n catalog_path.join(STASH_DB_NAME),\\n\\n temp_dir.path().join(STASH_DB_NAME),\\n\\n )?;\\n\\n fs::copy(\\n\\n catalog_path.join(STORAGE_DB_NAME),\\n\\n temp_dir.path().join(STORAGE_DB_NAME),\\n\\n )?;\\n\\n Ok(temp_dir)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/testdrive/src/util/mz_data.rs\",\n \"rank\": 66,\n \"score\": 271654.15370653145\n },\n {\n \"content\": \"/// Creates a temporary copy of Materialize's mzdata's catalog databases\\n\\n///\\n\\n/// This is useful because running validations against the catalog can conflict with the running\\n\\n/// Materialize instance. Therefore it's better to run validations on a copy of the catalog.\\n\\npub fn catalog_copy(catalog_path: &PathBuf) -> Result<TempDir, anyhow::Error> {\\n\\n let temp_dir = tempfile::tempdir()?;\\n\\n fs::copy(\\n\\n catalog_path.join(STASH_DB_NAME),\\n\\n temp_dir.path().join(STASH_DB_NAME),\\n\\n )?;\\n\\n Ok(temp_dir)\\n\\n}\\n\",\n \"file_path\": \"src/testdrive/src/util/mz_data.rs\",\n \"rank\": 67,\n \"score\": 271654.09641721443\n },\n {\n \"content\": \"/// Converts a Materialize row into a vector of PostgreSQL values.\\n\\n///\\n\\n/// Calling this function is equivalent to mapping [`Value::from_datum`] over\\n\\n/// every datum in `row`.\\n\\npub fn values_from_row(row: Row, typ: &RelationType) -> Vec<Option<Value>> {\\n\\n row.iter()\\n\\n .zip(typ.column_types.iter())\\n\\n .map(|(col, typ)| Value::from_datum(col, &typ.scalar_type))\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"src/pgrepr/src/value.rs\",\n \"rank\": 68,\n \"score\": 271563.4928089844\n },\n {\n \"content\": \"/// Encodes an BlobUnsealedBatch into the Parquet format.\\n\\npub fn encode_unsealed_parquet<W: Write>(\\n\\n w: &mut W,\\n\\n batch: &BlobUnsealedBatch,\\n\\n) -> Result<(), Error> {\\n\\n encode_parquet_kvtd(\\n\\n w,\\n\\n encode_unsealed_inline_meta(batch, ProtoBatchFormat::ParquetKvtd),\\n\\n &batch.updates,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/persist/src/indexed/columnar/parquet.rs\",\n \"rank\": 69,\n \"score\": 271131.95713067387\n },\n {\n \"content\": \"/// Creates a future which will read exactly enough bytes to fill `buf`, unless\\n\\n/// EOF is reached first. If a short read should be considered an error, use\\n\\n/// [`tokio::io::AsyncReadExt::read_exact`] instead.\\n\\n///\\n\\n/// The returned future will resolve to the number of bytes read.\\n\\n///\\n\\n/// In the case of an error the contents of the buffer are unspecified.\\n\\npub fn read_exact_or_eof<'a, A>(reader: &'a mut A, buf: &'a mut [u8]) -> ReadExactOrEof<'a, A>\\n\\nwhere\\n\\n A: AsyncRead,\\n\\n{\\n\\n ReadExactOrEof {\\n\\n reader,\\n\\n buf,\\n\\n pos: 0,\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<A> Future for ReadExactOrEof<'_, A>\\n\\nwhere\\n\\n A: AsyncRead + Unpin,\\n\\n{\\n\\n type Output = io::Result<usize>;\\n\\n\\n\\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Self::Output> {\\n\\n while self.pos < self.buf.len() {\\n\\n let me = &mut *self;\\n\",\n \"file_path\": \"src/ore/src/netio/read_exact.rs\",\n \"rank\": 70,\n \"score\": 270905.58084841294\n },\n {\n \"content\": \"/// Writes each `elem` into `buf`, separating the elems with `sep`.\\n\\npub fn format_elems<F, T, E>(\\n\\n buf: &mut F,\\n\\n elems: impl IntoIterator<Item = T>,\\n\\n mut format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\\n\\n sep: char,\\n\\n) -> Result<(), E>\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n let mut elems = elems.into_iter().peekable();\\n\\n while let Some(elem) = elems.next() {\\n\\n let start = buf.len();\\n\\n if let Nestable::MayNeedEscaping = format_elem(ListElementWriter(buf), elem)? {\\n\\n escape_elem::<_, ListElementEscaper>(buf, start);\\n\\n }\\n\\n if elems.peek().is_some() {\\n\\n buf.write_char(sep)\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 71,\n \"score\": 270422.2419014008\n },\n {\n \"content\": \"pub fn format_record<F, T, E>(\\n\\n buf: &mut F,\\n\\n elems: impl IntoIterator<Item = T>,\\n\\n mut format_elem: impl FnMut(RecordElementWriter<F>, T) -> Result<Nestable, E>,\\n\\n) -> Result<Nestable, E>\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n buf.write_char('(');\\n\\n let mut elems = elems.into_iter().peekable();\\n\\n while let Some(elem) = elems.next() {\\n\\n let start = buf.len();\\n\\n if let Nestable::MayNeedEscaping = format_elem(RecordElementWriter(buf), elem)? {\\n\\n escape_elem::<_, RecordElementEscaper>(buf, start);\\n\\n }\\n\\n if elems.peek().is_some() {\\n\\n buf.write_char(',')\\n\\n }\\n\\n }\\n\\n buf.write_char(')');\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 72,\n \"score\": 270408.3594141735\n },\n {\n \"content\": \"pub fn format_list<F, T, E>(\\n\\n buf: &mut F,\\n\\n elems: impl IntoIterator<Item = T>,\\n\\n format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\\n\\n) -> Result<Nestable, E>\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n buf.write_char('{');\\n\\n format_elems(buf, elems, format_elem, ',')?;\\n\\n buf.write_char('}');\\n\\n Ok(Nestable::Yes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 73,\n \"score\": 270408.3594141735\n },\n {\n \"content\": \"pub fn format_map<F, T, E>(\\n\\n buf: &mut F,\\n\\n elems: impl IntoIterator<Item = (impl AsRef<str>, T)>,\\n\\n mut format_elem: impl FnMut(MapValueWriter<F>, T) -> Result<Nestable, E>,\\n\\n) -> Result<Nestable, E>\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n buf.write_char('{');\\n\\n let mut elems = elems.into_iter().peekable();\\n\\n while let Some((key, value)) = elems.next() {\\n\\n // Map key values are always Strings, which always evaluate to\\n\\n // Nestable::MayNeedEscaping.\\n\\n let key_start = buf.len();\\n\\n buf.write_str(key.as_ref());\\n\\n escape_elem::<_, MapElementEscaper>(buf, key_start);\\n\\n\\n\\n buf.write_str(\\\"=>\\\");\\n\\n\\n\\n let value_start = buf.len();\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 74,\n \"score\": 270408.3594141735\n },\n {\n \"content\": \"pub fn format_array<F, T, E>(\\n\\n buf: &mut F,\\n\\n dims: &[ArrayDimension],\\n\\n elems: impl IntoIterator<Item = T>,\\n\\n mut format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\\n\\n) -> Result<Nestable, E>\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n format_array_inner(buf, dims, &mut elems.into_iter(), &mut format_elem)?;\\n\\n Ok(Nestable::Yes)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 75,\n \"score\": 270408.3594141735\n },\n {\n \"content\": \"pub fn parse_legacy_vector<'a, T, E>(\\n\\n s: &'a str,\\n\\n gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\\n\\n) -> Result<Vec<T>, ParseError>\\n\\nwhere\\n\\n E: fmt::Display,\\n\\n{\\n\\n parse_legacy_vector_inner(s, gen_elem)\\n\\n .map_err(|details| ParseError::invalid_input_syntax(\\\"int2vector\\\", s).with_details(details))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 76,\n \"score\": 270408.3594141735\n },\n {\n \"content\": \"pub fn format_array_inner<F, T, E>(\\n\\n buf: &mut F,\\n\\n dims: &[ArrayDimension],\\n\\n elems: &mut impl Iterator<Item = T>,\\n\\n format_elem: &mut impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\\n\\n) -> Result<(), E>\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n if dims.is_empty() {\\n\\n buf.write_str(\\\"{}\\\");\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n buf.write_char('{');\\n\\n for j in 0..dims[0].length {\\n\\n if j > 0 {\\n\\n buf.write_char(',');\\n\\n }\\n\\n if dims.len() == 1 {\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 77,\n \"score\": 266815.89958670345\n },\n {\n \"content\": \"pub fn format_legacy_vector<F, T, E>(\\n\\n buf: &mut F,\\n\\n elems: impl IntoIterator<Item = T>,\\n\\n format_elem: impl FnMut(ListElementWriter<F>, T) -> Result<Nestable, E>,\\n\\n) -> Result<Nestable, E>\\n\\nwhere\\n\\n F: FormatBuffer,\\n\\n{\\n\\n format_elems(buf, elems, format_elem, ' ')?;\\n\\n Ok(Nestable::MayNeedEscaping)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 78,\n \"score\": 266815.89958670345\n },\n {\n \"content\": \"pub fn parse_legacy_vector_inner<'a, T, E>(\\n\\n s: &'a str,\\n\\n mut gen_elem: impl FnMut(Cow<'a, str>) -> Result<T, E>,\\n\\n) -> Result<Vec<T>, String>\\n\\nwhere\\n\\n E: fmt::Display,\\n\\n{\\n\\n let mut elems = vec![];\\n\\n let buf = &mut LexBuf::new(s);\\n\\n\\n\\n let mut gen = |elem| gen_elem(elem).map_err_to_string();\\n\\n\\n\\n loop {\\n\\n buf.take_while(|ch| ch.is_ascii_whitespace());\\n\\n match buf.peek() {\\n\\n Some(_) => {\\n\\n let elem = buf.take_while(|ch| !ch.is_ascii_whitespace());\\n\\n elems.push(gen(elem.into())?);\\n\\n }\\n\\n None => break,\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(elems)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/repr/src/strconv.rs\",\n \"rank\": 79,\n \"score\": 266815.89958670345\n },\n {\n \"content\": \"// From postgres-types/src/private.rs.\\n\\nfn read_be_i32(buf: &mut &[u8]) -> Result<i32, Box<dyn Error + Sync + Send>> {\\n\\n if buf.len() < 4 {\\n\\n return Err(\\\"invalid buffer size\\\".into());\\n\\n }\\n\\n let mut bytes = [0; 4];\\n\\n bytes.copy_from_slice(&buf[..4]);\\n\\n *buf = &buf[4..];\\n\\n Ok(i32::from_be_bytes(bytes))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sqllogictest/src/runner.rs\",\n \"rank\": 80,\n \"score\": 266671.7644493747\n },\n {\n \"content\": \"fn lex_multiline_comment(buf: &mut LexBuf) -> Result<(), ParserError> {\\n\\n let pos = buf.pos() - 2;\\n\\n let mut nesting = 0;\\n\\n while let Some(ch) = buf.next() {\\n\\n match ch {\\n\\n '*' if buf.consume('/') => {\\n\\n if nesting == 0 {\\n\\n return Ok(());\\n\\n } else {\\n\\n nesting -= 1;\\n\\n }\\n\\n }\\n\\n '/' if buf.consume('*') => nesting += 1,\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n bail!(pos, \\\"unterminated multiline comment\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 81,\n \"score\": 263569.57831026113\n },\n {\n \"content\": \"/// Transforms a vector containing indexes of needed columns into one containing\\n\\n/// the \\\"skips\\\" an iterator over a Row would need to perform to see those values.\\n\\n///\\n\\n/// This function requires that all of the elements in `indexes` are strictly\\n\\n/// increasing.\\n\\n/// E.g. [3, 6, 10, 15] turns into [3, 3, 4, 5]\\n\\npub fn convert_indexes_to_skips(mut indexes: Vec<usize>) -> Vec<usize> {\\n\\n for i in 1..indexes.len() {\\n\\n soft_assert_or_log!(\\n\\n indexes[i - 1] < indexes[i],\\n\\n \\\"convert_indexes_to_skip needs indexes to be strictly increasing. Received: {:?}\\\",\\n\\n indexes,\\n\\n );\\n\\n }\\n\\n\\n\\n for i in (1..indexes.len()).rev() {\\n\\n indexes[i] -= indexes[i - 1];\\n\\n indexes[i] -= 1;\\n\\n }\\n\\n\\n\\n indexes\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/dataflow-types/src/plan/reduce.rs\",\n \"rank\": 82,\n \"score\": 263026.9869039868\n },\n {\n \"content\": \"pub fn plan_raise(scx: &StatementContext, r: RaiseStatement) -> Result<Plan, anyhow::Error> {\\n\\n scx.require_experimental_mode(\\\"RAISE statement\\\")?;\\n\\n Ok(Plan::Raise(RaisePlan {\\n\\n severity: r.severity,\\n\\n }))\\n\\n}\\n\",\n \"file_path\": \"src/sql/src/plan/statement/raise.rs\",\n \"rank\": 83,\n \"score\": 262164.65591907944\n },\n {\n \"content\": \"fn typecheck_debezium(value_desc: &RelationDesc) -> Result<(usize, usize), anyhow::Error> {\\n\\n let (before_idx, before_ty) = value_desc\\n\\n .get_by_name(&\\\"before\\\".into())\\n\\n .ok_or_else(|| anyhow!(\\\"'before' column missing from debezium input\\\"))?;\\n\\n let (after_idx, after_ty) = value_desc\\n\\n .get_by_name(&\\\"after\\\".into())\\n\\n .ok_or_else(|| anyhow!(\\\"'after' column missing from debezium input\\\"))?;\\n\\n if !matches!(before_ty.scalar_type, ScalarType::Record { .. }) {\\n\\n bail!(\\\"'before' column must be of type record\\\");\\n\\n }\\n\\n if before_ty != after_ty {\\n\\n bail!(\\\"'before' type differs from 'after' column\\\");\\n\\n }\\n\\n Ok((before_idx, after_idx))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql/src/plan/statement/ddl.rs\",\n \"rank\": 84,\n \"score\": 260085.88778193673\n },\n {\n \"content\": \"fn write_value_ref(schema: &Schema, value: &Value, buffer: &mut Vec<u8>) -> Result<(), Error> {\\n\\n if !value.validate(schema.top_node()) {\\n\\n return Err(ValidationError::new(\\\"value does not match schema\\\").into());\\n\\n }\\n\\n encode_ref(value, schema.top_node(), buffer);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/avro/src/writer.rs\",\n \"rank\": 85,\n \"score\": 259659.32849585736\n },\n {\n \"content\": \"pub fn transform_expr(scx: &StatementContext, expr: &mut Expr<Aug>) -> Result<(), PlanError> {\\n\\n run_transforms(scx, |t, expr| t.visit_expr_mut(expr), expr)\\n\\n}\\n\\n\\n\\npub(crate) fn run_transforms<F, A>(\\n\\n scx: &StatementContext,\\n\\n mut f: F,\\n\\n ast: &mut A,\\n\\n) -> Result<(), PlanError>\\n\\nwhere\\n\\n F: for<'ast> FnMut(&mut dyn VisitMut<'ast, Aug>, &'ast mut A),\\n\\n{\\n\\n let mut func_rewriter = FuncRewriter::new(scx);\\n\\n f(&mut func_rewriter, ast);\\n\\n func_rewriter.status?;\\n\\n\\n\\n let mut desugarer = Desugarer::new();\\n\\n f(&mut desugarer, ast);\\n\\n desugarer.status\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql/src/plan/transform_ast.rs\",\n \"rank\": 86,\n \"score\": 258750.68152212107\n },\n {\n \"content\": \"/// Extension methods for [`std::result::Result`].\\n\\npub trait ResultExt<T, E> {\\n\\n /// Applies [`Into::into`] to a contained [`Err`] value, leaving an [`Ok`]\\n\\n /// value untouched.\\n\\n fn err_into<E2>(self) -> Result<T, E2>\\n\\n where\\n\\n E: Into<E2>;\\n\\n\\n\\n /// Formats an [`Err`] value as a detailed error message, preserving any context information.\\n\\n ///\\n\\n /// This is equivalent to `format!(\\\"{:#}\\\", err)`, except that it's easier to type.\\n\\n fn err_to_string(&self) -> Option<String>\\n\\n where\\n\\n E: std::fmt::Display;\\n\\n\\n\\n /// Maps a `Result<T, E>` to `Result<T, String>` by converting the [`Err`] result into a string\\n\\n /// using the \\\"alternate\\\" formatting.\\n\\n fn map_err_to_string(self) -> Result<T, String>\\n\\n where\\n\\n E: std::fmt::Display;\\n\\n}\\n\",\n \"file_path\": \"src/ore/src/result.rs\",\n \"rank\": 87,\n \"score\": 258569.36739093816\n },\n {\n \"content\": \"/// Encode a compatible value (implementing the `ToAvro` trait) into Avro format, also\\n\\n/// performing schema validation.\\n\\n///\\n\\n/// **NOTE** This function has a quite small niche of usage and does NOT generate headers and sync\\n\\n/// markers; use [`Writer`](struct.Writer.html) to be fully Avro-compatible if you don't know what\\n\\n/// you are doing, instead.\\n\\npub fn to_avro_datum<T: ToAvro>(schema: &Schema, value: T) -> Result<Vec<u8>, Error> {\\n\\n let mut buffer = Vec::new();\\n\\n write_avro_datum(schema, value, &mut buffer)?;\\n\\n Ok(buffer)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use std::io::Cursor;\\n\\n use std::str::FromStr;\\n\\n\\n\\n use serde::{Deserialize, Serialize};\\n\\n\\n\\n use super::*;\\n\\n use crate::types::Record;\\n\\n use crate::util::zig_i64;\\n\\n use crate::Reader;\\n\\n\\n\\n static SCHEMA: &str = r#\\\"\\n\\n {\\n\",\n \"file_path\": \"src/avro/src/writer.rs\",\n \"rank\": 88,\n \"score\": 258560.32316749258\n },\n {\n \"content\": \"/// Plans an expression in the AS OF position of a `SELECT` or `TAIL` statement.\\n\\npub fn plan_as_of(scx: &StatementContext, expr: Option<Expr<Aug>>) -> Result<QueryWhen, PlanError> {\\n\\n let mut expr = match expr {\\n\\n None => return Ok(QueryWhen::Immediately),\\n\\n Some(expr) => expr,\\n\\n };\\n\\n\\n\\n let scope = Scope::empty();\\n\\n let desc = RelationDesc::empty();\\n\\n let qcx = QueryContext::root(scx, QueryLifetime::OneShot(scx.pcx()?));\\n\\n\\n\\n transform_ast::transform_expr(scx, &mut expr)?;\\n\\n\\n\\n let ecx = &ExprContext {\\n\\n qcx: &qcx,\\n\\n name: \\\"AS OF\\\",\\n\\n scope: &scope,\\n\\n relation_type: &desc.typ(),\\n\\n allow_aggregates: false,\\n\\n allow_subqueries: false,\\n\\n allow_windows: false,\\n\\n };\\n\\n let expr = plan_expr(ecx, &expr)?\\n\\n .type_as_any(ecx)?\\n\\n .lower_uncorrelated()?;\\n\\n Ok(QueryWhen::AtTimestamp(expr))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql/src/plan/query.rs\",\n \"rank\": 89,\n \"score\": 258238.66708929458\n },\n {\n \"content\": \"/// Parse a query result type string into a vec of expected types\\n\\nfn parse_types(input: &str) -> Result<Vec<Type>, anyhow::Error> {\\n\\n input\\n\\n .chars()\\n\\n .map(|char| {\\n\\n Ok(match char {\\n\\n 'T' => Type::Text,\\n\\n 'I' => Type::Integer,\\n\\n 'R' => Type::Real,\\n\\n 'B' => Type::Bool,\\n\\n 'O' => Type::Oid,\\n\\n _ => bail!(\\\"Unexpected type char {} in: {}\\\", char, input),\\n\\n })\\n\\n })\\n\\n .collect()\\n\\n}\\n\\n\\n\\nlazy_static! {\\n\\n static ref WHITESPACE_REGEX: Regex = Regex::new(r\\\"\\\\s+\\\").unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sqllogictest/src/parser.rs\",\n \"rank\": 90,\n \"score\": 257768.23139841945\n },\n {\n \"content\": \"/// Computes the hash of an object implementing [`Hash`].\\n\\npub fn hash<T: Hash>(t: &T) -> u64 {\\n\\n let mut hasher = DefaultHasher::new();\\n\\n t.hash(&mut hasher);\\n\\n hasher.finish()\\n\\n}\\n\",\n \"file_path\": \"src/ore/src/hash.rs\",\n \"rank\": 91,\n \"score\": 257605.21697320484\n },\n {\n \"content\": \"fn lex_parameter(buf: &mut LexBuf) -> Result<Token, ParserError> {\\n\\n let pos = buf.pos() - 1;\\n\\n let n = buf\\n\\n .take_while(|ch| matches!(ch, '0'..='9'))\\n\\n .parse()\\n\\n .map_err(|_| ParserError::new(pos, \\\"invalid parameter number\\\"))?;\\n\\n Ok(Token::Parameter(n))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 92,\n \"score\": 257529.96324445802\n },\n {\n \"content\": \"fn lex_string(buf: &mut LexBuf) -> Result<String, ParserError> {\\n\\n let mut s = String::new();\\n\\n loop {\\n\\n let pos = buf.pos() - 1;\\n\\n loop {\\n\\n match buf.next() {\\n\\n Some('\\\\'') if buf.consume('\\\\'') => s.push('\\\\''),\\n\\n Some('\\\\'') => break,\\n\\n Some(c) => s.push(c),\\n\\n None => bail!(pos, \\\"unterminated quoted string\\\"),\\n\\n }\\n\\n }\\n\\n if !lex_to_adjacent_string(buf) {\\n\\n return Ok(s);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 93,\n \"score\": 257529.96324445802\n },\n {\n \"content\": \"fn lex_op(buf: &mut LexBuf) -> Result<Token, ParserError> {\\n\\n buf.prev();\\n\\n let mut s = String::new();\\n\\n\\n\\n // In PostgreSQL, operators might be composed of any of the characters in\\n\\n // the set below...\\n\\n while let Some(ch) = buf.next() {\\n\\n match ch {\\n\\n // ...except the sequences `--` and `/*` start comments, even within\\n\\n // what would otherwise be an operator...\\n\\n '-' if buf.consume('-') => lex_line_comment(buf),\\n\\n '/' if buf.consume('*') => lex_multiline_comment(buf)?,\\n\\n #[rustfmt::skip]\\n\\n '+'|'-'|'*'|'/'|'<'|'>'|'='|'~'|'!'|'@'|'#'|'%'|'^'|'&'|'|'|'`'|'?' => s.push(ch),\\n\\n _ => {\\n\\n buf.prev();\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 94,\n \"score\": 257529.96324445802\n },\n {\n \"content\": \"fn lex_number(buf: &mut LexBuf) -> Result<Token, ParserError> {\\n\\n buf.prev();\\n\\n let mut s = buf.take_while(|ch| matches!(ch, '0'..='9')).to_owned();\\n\\n\\n\\n // Optional decimal component.\\n\\n if buf.consume('.') {\\n\\n s.push('.');\\n\\n s.push_str(buf.take_while(|ch| matches!(ch, '0'..='9')));\\n\\n }\\n\\n\\n\\n // Optional exponent.\\n\\n if buf.consume('e') || buf.consume('E') {\\n\\n s.push('E');\\n\\n let require_exp = if buf.consume('-') {\\n\\n s.push('-');\\n\\n true\\n\\n } else {\\n\\n buf.consume('+')\\n\\n };\\n\\n let exp = buf.take_while(|ch| matches!(ch, '0'..='9'));\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 95,\n \"score\": 257529.96324445802\n },\n {\n \"content\": \"/// Given some stack traces, generate a map of addresses to their\\n\\n/// corresponding symbols.\\n\\n///\\n\\n/// Each address could correspond to more than one symbol, because\\n\\n/// of inlining. (E.g. if 0x1234 comes from \\\"g\\\", which is inlined in \\\"f\\\", the corresponding vec of symbols will be [\\\"f\\\", \\\"g\\\"].)\\n\\npub fn symbolicate(profile: &StackProfile) -> HashMap<usize, Vec<String>> {\\n\\n let mut all_addrs = vec![];\\n\\n for (stack, _annotation) in profile.stacks.iter() {\\n\\n all_addrs.extend(stack.addrs.iter().cloned());\\n\\n }\\n\\n // Sort so addresses from the same images are together,\\n\\n // to avoid thrashing `backtrace::resolve`'s cache of\\n\\n // parsed images.\\n\\n all_addrs.sort_unstable();\\n\\n all_addrs.dedup();\\n\\n all_addrs\\n\\n .into_iter()\\n\\n .map(|addr| {\\n\\n let mut syms = vec![];\\n\\n backtrace::resolve(addr as *mut c_void, |sym| {\\n\\n let name = sym\\n\\n .name()\\n\\n .map(|sn| sn.to_string())\\n\\n .unwrap_or_else(|| \\\"???\\\".to_string());\\n\\n syms.push(name);\\n\\n });\\n\\n syms.reverse();\\n\\n (addr, syms)\\n\\n })\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"src/prof/src/lib.rs\",\n \"rank\": 96,\n \"score\": 255120.70581956595\n },\n {\n \"content\": \"fn lex_dollar_string(buf: &mut LexBuf) -> Result<Token, ParserError> {\\n\\n let pos = buf.pos() - 1;\\n\\n let tag = format!(\\\"${}$\\\", buf.take_while(|ch| ch != '$'));\\n\\n let _ = buf.next();\\n\\n if let Some(s) = buf.take_to_delimiter(&tag) {\\n\\n Ok(Token::String(s.into()))\\n\\n } else {\\n\\n Err(ParserError::new(pos, \\\"unterminated dollar-quoted string\\\"))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 97,\n \"score\": 254735.9099650499\n },\n {\n \"content\": \"fn lex_quoted_ident(buf: &mut LexBuf) -> Result<Token, ParserError> {\\n\\n let mut s = String::new();\\n\\n let pos = buf.pos() - 1;\\n\\n loop {\\n\\n match buf.next() {\\n\\n Some('\\\"') if buf.consume('\\\"') => s.push('\\\"'),\\n\\n Some('\\\"') => break,\\n\\n Some(c) => s.push(c),\\n\\n None => bail!(pos, \\\"unterminated quoted identifier\\\"),\\n\\n }\\n\\n }\\n\\n Ok(Token::Ident(s))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 98,\n \"score\": 254735.9099650499\n },\n {\n \"content\": \"fn lex_extended_string(buf: &mut LexBuf) -> Result<Token, ParserError> {\\n\\n fn lex_unicode_escape(buf: &mut LexBuf, n: usize) -> Result<char, ParserError> {\\n\\n let pos = buf.pos() - 2;\\n\\n buf.next_n(n)\\n\\n .and_then(|s| u32::from_str_radix(s, 16).ok())\\n\\n .and_then(|codepoint| char::try_from(codepoint).ok())\\n\\n .ok_or_else(|| ParserError::new(pos, \\\"invalid unicode escape\\\"))\\n\\n }\\n\\n\\n\\n // We do not support octal (\\\\o) or hexadecimal (\\\\x) escapes, since it is\\n\\n // possible to construct invalid UTF-8 with these escapes. We could check\\n\\n // for and reject invalid UTF-8, of course, but it is too annoying to be\\n\\n // worth doing right now. We still lex the escapes to produce nice error\\n\\n // messages.\\n\\n\\n\\n fn lex_octal_escape(buf: &mut LexBuf) -> ParserError {\\n\\n let pos = buf.pos() - 2;\\n\\n buf.take_while(|ch| matches!(ch, '0'..='7'));\\n\\n ParserError::new(pos, \\\"octal escapes are not supported\\\")\\n\\n }\\n\",\n \"file_path\": \"src/sql-parser/src/lexer.rs\",\n \"rank\": 99,\n \"score\": 254735.9099650499\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":29,"numItemsPerPage":100,"numTotalItems":13489,"offset":2900,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3NTUxNzQ2OSwic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3NzU1MjEwNjksImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.QRcAdr2V8n_z-kRiT_Xj03feAVC2K3zcrzcAQM5shSQwA8LgvyI-_DhsFrepMfv4K413zCFufsGhdIJEWtt2CQ","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 | crates/mun_codegen/src/ir/function.rs | tdejager/mun | 769bfe5a3a921bcc5289217e692f7f8cf19648ab | use super::try_convert_any_to_basic;
use crate::ir::dispatch_table::DispatchTable;
use crate::values::{
BasicValueEnum, CallSiteValue, FloatValue, FunctionValue, InstructionOpcode, IntValue,
};
use crate::{IrDatabase, Module, OptimizationLevel};
use inkwell::builder::Builder;
use inkwell::passes::{PassManager, PassManagerBuilder};
use inkwell::types::{AnyTypeEnum, BasicTypeEnum};
use inkwell::{FloatPredicate, IntPredicate};
use mun_hir::{
self as hir, ArithOp, BinaryOp, Body, CmpOp, Expr, ExprId, HirDisplay, InferenceResult,
Literal, Ordering, Pat, PatId, Path, Resolution, Resolver, Statement, TypeCtor,
};
use std::collections::HashMap;
use std::mem;
use std::sync::Arc;
pub(crate) fn create_pass_manager(
module: &Module,
optimization_lvl: OptimizationLevel,
) -> PassManager<FunctionValue> {
let pass_builder = PassManagerBuilder::create();
pass_builder.set_optimization_level(optimization_lvl);
let function_pass_manager = PassManager::create(module);
pass_builder.populate_function_pass_manager(&function_pass_manager);
function_pass_manager.initialize();
function_pass_manager
}
pub(crate) fn gen_signature(
db: &impl IrDatabase,
f: hir::Function,
module: &Module,
) -> FunctionValue {
let name = f.name(db).to_string();
if let AnyTypeEnum::FunctionType(ty) = db.type_ir(f.ty(db)) {
module.add_function(&name, ty, None)
} else {
panic!("not a function type")
}
}
pub(crate) fn gen_body<'a, 'b, D: IrDatabase>(
db: &'a D,
hir_function: hir::Function,
llvm_function: FunctionValue,
module: &'a Module,
llvm_functions: &'a HashMap<mun_hir::Function, FunctionValue>,
dispatch_table: &'b DispatchTable,
) -> FunctionValue {
let context = db.context();
let builder = context.create_builder();
let body_ir = context.append_basic_block(&llvm_function, "body");
builder.position_at_end(&body_ir);
let mut code_gen = BodyIrGenerator::new(
db,
module,
hir_function,
llvm_function,
llvm_functions,
builder,
dispatch_table,
);
code_gen.gen_fn_body();
llvm_function
}
struct BodyIrGenerator<'a, 'b, D: IrDatabase> {
db: &'a D,
module: &'a Module,
body: Arc<Body>,
infer: Arc<InferenceResult>,
builder: Builder,
fn_value: FunctionValue,
pat_to_param: HashMap<PatId, inkwell::values::BasicValueEnum>,
pat_to_local: HashMap<PatId, inkwell::values::PointerValue>,
pat_to_name: HashMap<PatId, String>,
function_map: &'a HashMap<mun_hir::Function, FunctionValue>,
dispatch_table: &'b DispatchTable,
}
impl<'a, 'b, D: IrDatabase> BodyIrGenerator<'a, 'b, D> {
fn new(
db: &'a D,
module: &'a Module,
f: hir::Function,
fn_value: FunctionValue,
function_map: &'a HashMap<mun_hir::Function, FunctionValue>,
builder: Builder,
dispatch_table: &'b DispatchTable,
) -> Self {
let body = f.body(db);
let infer = f.infer(db);
BodyIrGenerator {
db,
module,
body,
infer,
builder,
fn_value,
pat_to_param: HashMap::default(),
pat_to_local: HashMap::default(),
pat_to_name: HashMap::default(),
function_map,
dispatch_table,
}
}
fn gen_fn_body(&mut self) {
for (i, (pat, _ty)) in self.body.params().iter().enumerate() {
let body = self.body.clone();
match &body[*pat] {
Pat::Bind { name } => {
let name = name.to_string();
let param = self.fn_value.get_nth_param(i as u32).unwrap();
param.set_name(&name);
self.pat_to_param.insert(*pat, param);
self.pat_to_name.insert(*pat, name);
}
Pat::Wild => {}
Pat::Missing | Pat::Path(_) => unreachable!(),
}
}
let ret_value = self.gen_expr(self.body.body_expr());
if let Some(value) = ret_value {
self.builder.build_return(Some(&value));
} else {
self.builder.build_return(None);
}
}
fn gen_expr(&mut self, expr: ExprId) -> Option<inkwell::values::BasicValueEnum> {
let body = self.body.clone();
let mut value = match &body[expr] {
&Expr::Block {
ref statements,
tail,
} => {
for statement in statements.iter() {
match statement {
Statement::Let {
pat, initializer, ..
} => {
self.gen_let_statement(*pat, *initializer);
}
Statement::Expr(expr) => {
self.gen_expr(*expr);
}
};
}
tail.and_then(|expr| self.gen_expr(expr))
}
Expr::Path(ref p) => {
let resolver = mun_hir::resolver_for_expr(self.body.clone(), self.db, expr);
Some(self.gen_path_expr(p, expr, &resolver))
}
Expr::Literal(lit) => match lit {
Literal::Int(v) => Some(
self.module
.get_context()
.i64_type()
.const_int(unsafe { mem::transmute::<i64, u64>(*v) }, true)
.into(),
),
Literal::Float(v) => Some(
self.module
.get_context()
.f64_type()
.const_float(*v as f64)
.into(),
),
Literal::String(_) | Literal::Bool(_) => unreachable!(),
},
&Expr::BinaryOp { lhs, rhs, op } => {
Some(self.gen_binary_op(lhs, rhs, op.expect("missing op")))
}
Expr::Call {
ref callee,
ref args,
} => self.gen_call(*callee, &args).try_as_basic_value().left(),
_ => unreachable!("unimplemented expr type"),
};
value = value.map(|value| {
match (
value.get_type(),
try_convert_any_to_basic(self.db.type_ir(self.infer[expr].clone())),
) {
(BasicTypeEnum::IntType(_), Some(target @ BasicTypeEnum::FloatType(_))) => self
.builder
.build_cast(InstructionOpcode::SIToFP, value, target, "implicit_cast"),
(a, Some(b)) if a == b => value,
_ => unreachable!("could not perform implicit cast"),
}
});
value
}
fn new_alloca_builder(&self) -> Builder {
let temp_builder = Builder::create();
let block = self
.builder
.get_insert_block()
.expect("at this stage there must be a block");
if let Some(first_instruction) = block.get_first_instruction() {
temp_builder.position_before(&first_instruction);
} else {
temp_builder.position_at_end(&block);
}
temp_builder
}
fn gen_let_statement(&mut self, pat: PatId, initializer: Option<ExprId>) {
let initializer = initializer.and_then(|expr| self.gen_expr(expr));
match &self.body[pat] {
Pat::Bind { name } => {
let builder = self.new_alloca_builder();
let ty = try_convert_any_to_basic(self.db.type_ir(self.infer[pat].clone()))
.expect("expected basic type");
let ptr = builder.build_alloca(ty, &name.to_string());
self.pat_to_local.insert(pat, ptr);
self.pat_to_name.insert(pat, name.to_string());
if let Some(value) = initializer {
self.builder.build_store(ptr, value);
};
}
Pat::Wild => {}
Pat::Missing | Pat::Path(_) => unreachable!(),
}
}
fn gen_path_expr(
&self,
path: &Path,
_expr: ExprId,
resolver: &Resolver,
) -> inkwell::values::BasicValueEnum {
let resolution = resolver
.resolve_path_without_assoc_items(self.db, path)
.take_values()
.expect("unknown path");
match resolution {
Resolution::LocalBinding(pat) => {
if let Some(param) = self.pat_to_param.get(&pat) {
*param
} else if let Some(ptr) = self.pat_to_local.get(&pat) {
let name = self.pat_to_name.get(&pat).expect("could not find pat name");
self.builder.build_load(*ptr, &name)
} else {
unreachable!("could not find the pattern..");
}
}
Resolution::Def(_) => panic!("no support for module definitions"),
}
}
fn gen_binary_op(&mut self, lhs: ExprId, rhs: ExprId, op: BinaryOp) -> BasicValueEnum {
let lhs_value = self.gen_expr(lhs).expect("no lhs value");
let rhs_value = self.gen_expr(rhs).expect("no rhs value");
let lhs_type = self.infer[lhs].clone();
let rhs_type = self.infer[rhs].clone();
match lhs_type.as_simple() {
Some(TypeCtor::Float) => self.gen_binary_op_float(
*lhs_value.as_float_value(),
*rhs_value.as_float_value(),
op,
),
Some(TypeCtor::Int) => {
self.gen_binary_op_int(*lhs_value.as_int_value(), *rhs_value.as_int_value(), op)
}
_ => unreachable!(
"Unsupported operation {0}op{1}",
lhs_type.display(self.db),
rhs_type.display(self.db)
),
}
}
fn gen_binary_op_float(
&mut self,
lhs: FloatValue,
rhs: FloatValue,
op: BinaryOp,
) -> BasicValueEnum {
match op {
BinaryOp::ArithOp(ArithOp::Add) => self.builder.build_float_add(lhs, rhs, "add").into(),
BinaryOp::ArithOp(ArithOp::Subtract) => {
self.builder.build_float_sub(lhs, rhs, "sub").into()
}
BinaryOp::ArithOp(ArithOp::Divide) => {
self.builder.build_float_div(lhs, rhs, "div").into()
}
BinaryOp::ArithOp(ArithOp::Multiply) => {
self.builder.build_float_mul(lhs, rhs, "mul").into()
}
BinaryOp::CmpOp(op) => {
let (name, predicate) = match op {
CmpOp::Eq { negated: false } => ("eq", FloatPredicate::OEQ),
CmpOp::Eq { negated: true } => ("neq", FloatPredicate::ONE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: false,
} => ("lesseq", FloatPredicate::OLE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: true,
} => ("less", FloatPredicate::OLT),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: false,
} => ("greatereq", FloatPredicate::OGE),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: true,
} => ("greater", FloatPredicate::OGT),
};
self.builder
.build_float_compare(predicate, lhs, rhs, name)
.into()
}
_ => unreachable!(),
}
}
fn gen_binary_op_int(&mut self, lhs: IntValue, rhs: IntValue, op: BinaryOp) -> BasicValueEnum {
match op {
BinaryOp::ArithOp(ArithOp::Add) => self.builder.build_int_add(lhs, rhs, "add").into(),
BinaryOp::ArithOp(ArithOp::Subtract) => {
self.builder.build_int_sub(lhs, rhs, "sub").into()
}
BinaryOp::ArithOp(ArithOp::Divide) => {
self.builder.build_int_signed_div(lhs, rhs, "div").into()
}
BinaryOp::ArithOp(ArithOp::Multiply) => {
self.builder.build_int_mul(lhs, rhs, "mul").into()
}
BinaryOp::CmpOp(op) => {
let (name, predicate) = match op {
CmpOp::Eq { negated: false } => ("eq", IntPredicate::EQ),
CmpOp::Eq { negated: true } => ("neq", IntPredicate::NE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: false,
} => ("lesseq", IntPredicate::SLE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: true,
} => ("less", IntPredicate::SLT),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: false,
} => ("greatereq", IntPredicate::SGE),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: true,
} => ("greater", IntPredicate::SGT),
};
self.builder
.build_int_compare(predicate, lhs, rhs, name)
.into()
}
_ => unreachable!(),
}
}
fn should_use_dispatch_table(&self) -> bool {
true
}
fn gen_call(&mut self, callee: ExprId, args: &[ExprId]) -> CallSiteValue {
let function = self.infer[callee]
.as_function_def()
.expect("expected a function expression");
let args: Vec<BasicValueEnum> = args
.iter()
.map(|expr| self.gen_expr(*expr).expect("expected a value"))
.collect();
if self.should_use_dispatch_table() {
let ptr_value =
self.dispatch_table
.gen_function_lookup(self.db, &self.builder, function);
self.builder
.build_call(ptr_value, &args, &function.name(self.db).to_string())
} else {
let llvm_function = self
.function_map
.get(&function)
.expect("missing function value for hir function");
self.builder
.build_call(*llvm_function, &args, &function.name(self.db).to_string())
}
}
}
trait OptName {
fn get_name(&self) -> Option<&str>;
fn set_name<T: AsRef<str>>(&self, name: T);
}
impl OptName for BasicValueEnum {
fn get_name(&self) -> Option<&str> {
match self {
BasicValueEnum::ArrayValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::IntValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::FloatValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::PointerValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::StructValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::VectorValue(v) => v.get_name().to_str().ok(),
}
}
fn set_name<T: AsRef<str>>(&self, name: T) {
match self {
BasicValueEnum::ArrayValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::IntValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::FloatValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::PointerValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::StructValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::VectorValue(v) => v.set_name(name.as_ref()),
};
}
}
| use super::try_convert_any_to_basic;
use crate::ir::dispatch_table::DispatchTable;
use crate::values::{
BasicValueEnum, CallSiteValue, FloatValue, FunctionValue, InstructionOpcode, IntValue,
};
use crate::{IrDatabase, Module, OptimizationLevel};
use inkwell::builder::Builder;
use inkwell::passes::{PassManager, PassManagerBuilder};
use inkwell::types::{AnyTypeEnum, BasicTypeEnum};
use inkwell::{FloatPredicate, IntPredicate};
use mun_hir::{
self as hir, ArithOp, BinaryOp, Body, CmpOp, Expr, ExprId, HirDisplay, InferenceResult,
Literal, Ordering, Pat, PatId, Path, Resolution, Resolver, Statement, TypeCtor,
};
use std::collections::HashMap;
use std::mem;
use std::sync::Arc;
pub(crate) fn create_pass_manager(
module: &Module,
optimization_lvl: OptimizationLevel,
) -> PassManager<FunctionValue> {
let pass_builder = PassManagerBuilder::create();
pass_builder.set_optimization_level(optimization_lvl);
let function_pass_manager = PassManager::create(module);
pass_builder.populate_function_pass_manager(&function_pass_manager);
function_pass_manager.initialize();
function_pass_manager
}
pub(crate) fn gen_signature(
db: &impl IrDatabase,
f: hir::Function,
module: &Module,
) -> FunctionValue {
let name = f.name(db).to_string();
if let AnyTypeEnum::FunctionType(ty) = db.type_ir(f.ty(db)) {
module.add_function(&name, ty, None)
} else {
panic!("not a function type")
}
}
pub(crate) fn gen_body<'a, 'b, D: IrDatabase>(
db: &'a D,
hir_function: hir::Function,
llvm_function: FunctionValue,
module: &'a Module,
llvm_functions: &'a HashMap<mun_hir::Function, FunctionValue>,
dispatch_table: &'b DispatchTable,
) -> FunctionValue {
let context = db.context();
let builder = context.create_builder();
let body_ir = context.append_basic_block(&llvm_function, "body");
builder.position_at_end(&body_ir);
let mut code_gen = BodyIrGenerator::new(
db,
module,
hir_function,
llvm_function,
llvm_functions,
builder,
dispatch_table,
);
code_gen.gen_fn_body();
llvm_function
}
struct BodyIrGenerator<'a, 'b, D: IrDatabase> {
db: &'a D,
module: &'a Module,
body: Arc<Body>,
infer: Arc<InferenceResult>,
builder: Builder,
fn_value: FunctionValue,
pat_to_param: HashMap<PatId, inkwell::values::BasicValueEnum>,
pat_to_local: HashMap<PatId, inkwell::values::PointerValue>,
pat_to_name: HashMap<PatId, String>,
function_map: &'a HashMap<mun_hir::Function, FunctionValue>,
dispatch_table: &'b DispatchTable,
}
impl<'a, 'b, D: IrDatabase> BodyIrGenerator<'a, 'b, D> {
fn new(
db: &'a D,
module: &'a Module,
f: hir::Function,
fn_value: FunctionValue,
function_map: &'a HashMap<mun_hir::Function, FunctionValue>,
builder: Builder,
dispatch_table: &'b DispatchTable,
) -> Self {
let body = f.body(db);
let infer = f.infer(db);
BodyIrGenerator {
db,
module,
body,
infer,
builder,
fn_value,
pat_to_param: HashMap::default(),
pat_to_local: HashMap::default(),
pat_to_name: HashMap::default(),
function_map,
dispatch_table,
}
}
fn gen_fn_body(&mut self) {
for (i, (pat, _ty)) in self.body.params().iter().enumerate() {
let body = self.body.clone();
match &body[*pat] {
Pat::Bind { name } => {
let name = name.to_string();
let param = self.fn_value.get_nth_param(i as u32).unwrap();
param.set_name(&name);
self.pat_to_param.insert(*pat, param);
self.pat_to_name.insert(*pat, name);
}
Pat::Wild => {}
Pat::Missing | Pat::Path(_) => unreachable!(),
}
}
let ret_value = self.gen_expr(self.body.body_expr());
if let Some(value) = ret_value {
self.builder.build_return(Some(&value));
} else {
self.builder.build_return(None);
}
}
fn gen_expr(&mut self, expr: ExprId) -> Option<inkwell::values::BasicValueEnum> {
let body = self.body.clone();
let mut value = match &body[expr] {
&Expr::Block {
ref statements,
tail,
} => {
for statement in statements.iter() {
match statement {
Statement::Let {
pat, initializer, ..
} => {
self.gen_let_statement(*pat, *initializer);
}
Statement::Expr(expr) => {
self.gen_expr(*expr);
}
};
}
tail.and_then(|expr| self.gen_expr(expr))
}
Expr::Path(ref p) => {
let resolver = mun_hir::resolver_for_expr(self.body.clone(), self.db, expr);
Some(self.gen_path_expr(p, expr, &resolver))
}
Expr::Literal(lit) => match lit {
Literal::Int(v) => Some(
self.module
.get_context()
.i64_type()
.const_int(unsafe { mem::transmute::<i64, u64>(*v) }, true)
.into(),
),
Literal::Float(v) => Some(
self.module
.get_context()
.f64_type()
.const_float(*v as f64)
.into(),
),
Literal::String(_) | Literal::Bool(_) => unreachable!(),
},
&Expr::BinaryOp { lhs, rhs, op } => {
Some(self.gen_binary_op(lhs, rhs, op.expect("missing op")))
}
Expr::Call {
ref callee,
ref args,
} => self.gen_call(*callee, &args).try_as_basic_value().left(),
_ => unreachable!("unimplemented expr type"),
};
value = value.map(|value| {
match (
value.get_type(),
try_convert_any_to_basic(self.db.type_ir(self.infer[expr].clone())),
) {
(BasicTypeEnum::IntType(_), Some(target @ BasicTypeEnum::FloatType(_))) => self
.builder
.build_cast(InstructionOpcode::SIToFP, value, target, "implicit_cast"),
(a, Some(b)) if a == b => value,
_ => unreachable!("could not perform implicit cast"),
}
});
value
}
fn new_alloca_builder(&self) -> Builder {
let temp_builder = Builder::create();
let block = self
.builder
.get_insert_blo | Resolution::Def(_) => panic!("no support for module definitions"),
}
}
fn gen_binary_op(&mut self, lhs: ExprId, rhs: ExprId, op: BinaryOp) -> BasicValueEnum {
let lhs_value = self.gen_expr(lhs).expect("no lhs value");
let rhs_value = self.gen_expr(rhs).expect("no rhs value");
let lhs_type = self.infer[lhs].clone();
let rhs_type = self.infer[rhs].clone();
match lhs_type.as_simple() {
Some(TypeCtor::Float) => self.gen_binary_op_float(
*lhs_value.as_float_value(),
*rhs_value.as_float_value(),
op,
),
Some(TypeCtor::Int) => {
self.gen_binary_op_int(*lhs_value.as_int_value(), *rhs_value.as_int_value(), op)
}
_ => unreachable!(
"Unsupported operation {0}op{1}",
lhs_type.display(self.db),
rhs_type.display(self.db)
),
}
}
fn gen_binary_op_float(
&mut self,
lhs: FloatValue,
rhs: FloatValue,
op: BinaryOp,
) -> BasicValueEnum {
match op {
BinaryOp::ArithOp(ArithOp::Add) => self.builder.build_float_add(lhs, rhs, "add").into(),
BinaryOp::ArithOp(ArithOp::Subtract) => {
self.builder.build_float_sub(lhs, rhs, "sub").into()
}
BinaryOp::ArithOp(ArithOp::Divide) => {
self.builder.build_float_div(lhs, rhs, "div").into()
}
BinaryOp::ArithOp(ArithOp::Multiply) => {
self.builder.build_float_mul(lhs, rhs, "mul").into()
}
BinaryOp::CmpOp(op) => {
let (name, predicate) = match op {
CmpOp::Eq { negated: false } => ("eq", FloatPredicate::OEQ),
CmpOp::Eq { negated: true } => ("neq", FloatPredicate::ONE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: false,
} => ("lesseq", FloatPredicate::OLE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: true,
} => ("less", FloatPredicate::OLT),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: false,
} => ("greatereq", FloatPredicate::OGE),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: true,
} => ("greater", FloatPredicate::OGT),
};
self.builder
.build_float_compare(predicate, lhs, rhs, name)
.into()
}
_ => unreachable!(),
}
}
fn gen_binary_op_int(&mut self, lhs: IntValue, rhs: IntValue, op: BinaryOp) -> BasicValueEnum {
match op {
BinaryOp::ArithOp(ArithOp::Add) => self.builder.build_int_add(lhs, rhs, "add").into(),
BinaryOp::ArithOp(ArithOp::Subtract) => {
self.builder.build_int_sub(lhs, rhs, "sub").into()
}
BinaryOp::ArithOp(ArithOp::Divide) => {
self.builder.build_int_signed_div(lhs, rhs, "div").into()
}
BinaryOp::ArithOp(ArithOp::Multiply) => {
self.builder.build_int_mul(lhs, rhs, "mul").into()
}
BinaryOp::CmpOp(op) => {
let (name, predicate) = match op {
CmpOp::Eq { negated: false } => ("eq", IntPredicate::EQ),
CmpOp::Eq { negated: true } => ("neq", IntPredicate::NE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: false,
} => ("lesseq", IntPredicate::SLE),
CmpOp::Ord {
ordering: Ordering::Less,
strict: true,
} => ("less", IntPredicate::SLT),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: false,
} => ("greatereq", IntPredicate::SGE),
CmpOp::Ord {
ordering: Ordering::Greater,
strict: true,
} => ("greater", IntPredicate::SGT),
};
self.builder
.build_int_compare(predicate, lhs, rhs, name)
.into()
}
_ => unreachable!(),
}
}
fn should_use_dispatch_table(&self) -> bool {
true
}
fn gen_call(&mut self, callee: ExprId, args: &[ExprId]) -> CallSiteValue {
let function = self.infer[callee]
.as_function_def()
.expect("expected a function expression");
let args: Vec<BasicValueEnum> = args
.iter()
.map(|expr| self.gen_expr(*expr).expect("expected a value"))
.collect();
if self.should_use_dispatch_table() {
let ptr_value =
self.dispatch_table
.gen_function_lookup(self.db, &self.builder, function);
self.builder
.build_call(ptr_value, &args, &function.name(self.db).to_string())
} else {
let llvm_function = self
.function_map
.get(&function)
.expect("missing function value for hir function");
self.builder
.build_call(*llvm_function, &args, &function.name(self.db).to_string())
}
}
}
trait OptName {
fn get_name(&self) -> Option<&str>;
fn set_name<T: AsRef<str>>(&self, name: T);
}
impl OptName for BasicValueEnum {
fn get_name(&self) -> Option<&str> {
match self {
BasicValueEnum::ArrayValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::IntValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::FloatValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::PointerValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::StructValue(v) => v.get_name().to_str().ok(),
BasicValueEnum::VectorValue(v) => v.get_name().to_str().ok(),
}
}
fn set_name<T: AsRef<str>>(&self, name: T) {
match self {
BasicValueEnum::ArrayValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::IntValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::FloatValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::PointerValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::StructValue(v) => v.set_name(name.as_ref()),
BasicValueEnum::VectorValue(v) => v.set_name(name.as_ref()),
};
}
}
| ck()
.expect("at this stage there must be a block");
if let Some(first_instruction) = block.get_first_instruction() {
temp_builder.position_before(&first_instruction);
} else {
temp_builder.position_at_end(&block);
}
temp_builder
}
fn gen_let_statement(&mut self, pat: PatId, initializer: Option<ExprId>) {
let initializer = initializer.and_then(|expr| self.gen_expr(expr));
match &self.body[pat] {
Pat::Bind { name } => {
let builder = self.new_alloca_builder();
let ty = try_convert_any_to_basic(self.db.type_ir(self.infer[pat].clone()))
.expect("expected basic type");
let ptr = builder.build_alloca(ty, &name.to_string());
self.pat_to_local.insert(pat, ptr);
self.pat_to_name.insert(pat, name.to_string());
if let Some(value) = initializer {
self.builder.build_store(ptr, value);
};
}
Pat::Wild => {}
Pat::Missing | Pat::Path(_) => unreachable!(),
}
}
fn gen_path_expr(
&self,
path: &Path,
_expr: ExprId,
resolver: &Resolver,
) -> inkwell::values::BasicValueEnum {
let resolution = resolver
.resolve_path_without_assoc_items(self.db, path)
.take_values()
.expect("unknown path");
match resolution {
Resolution::LocalBinding(pat) => {
if let Some(param) = self.pat_to_param.get(&pat) {
*param
} else if let Some(ptr) = self.pat_to_local.get(&pat) {
let name = self.pat_to_name.get(&pat).expect("could not find pat name");
self.builder.build_load(*ptr, &name)
} else {
unreachable!("could not find the pattern..");
}
}
| random | [
{
"content": "/// Build the declared type of a function. This should not need to look at the\n\n/// function body.\n\nfn type_for_fn(_db: &impl HirDatabase, def: Function) -> Ty {\n\n Ty::simple(TypeCtor::FnDef(def))\n\n}\n\n\n",
"file_path": "crates/mun_hir/src/ty/lower.rs",
"rank": 0,
"score": ... |
Rust | src/algebra.rs | doxxx/raytracer | 21c92437ffd07d0434f8e095ce787fe23f42658c | /*
Transcribed from http://cosinekitty.com/raytrace/rtsource.zip.
Original written by Don Cross.
Adapted to Rust by Gordon Tyler.
*/
#![allow(non_snake_case)]
use num_complex::Complex;
use std::f64::consts::PI;
const TOLERANCE: f64 = 1.0e-8;
const TWO_PI: f64 = 2.0 * PI;
fn complex(re: f64) -> Complex<f64> {
Complex { re, im: 0.0 }
}
fn complex2(re: f64, im: f64) -> Complex<f64> {
Complex { re, im }
}
fn is_zero(c: Complex<f64>) -> bool {
c.re.abs() < TOLERANCE && c.im.abs() < TOLERANCE
}
fn filter_real(c: Vec<Complex<f64>>) -> Vec<f64> {
c.into_iter().filter(|c| c.im.abs() < TOLERANCE).map(|c| c.re).collect()
}
fn cbrt(c: Complex<f64>, n: isize) -> Complex<f64> {
let rho = c.norm().powf(1.0 / 3.0);
let theta = ((TWO_PI * n as f64) + c.arg()) / 3.0;
complex2(
rho * theta.cos(),
rho * theta.sin(),
)
}
pub fn solve_quadratic(a: Complex<f64>, b: Complex<f64>, c: Complex<f64>) -> Vec<Complex<f64>> {
if is_zero(a) {
if is_zero(b) {
Vec::with_capacity(0)
} else {
vec![-c / b]
}
} else {
let radicand = b * b - 4.0 * a * c;
if is_zero(radicand) {
vec![-b / (2.0 * a)]
} else {
let r = radicand.sqrt();
let d = 2.0 * a;
vec![(-b + r) / d, (-b - r) / d]
}
}
}
pub fn solve_cubic(a: Complex<f64>, b: Complex<f64>, c: Complex<f64>, d: Complex<f64>) -> Vec<Complex<f64>> {
if is_zero(a) {
solve_quadratic(b, c, d)
} else {
let b = b / a;
let c = c / a;
let d = d / a;
let S = b / 3.0;
let D = c / 3.0 - S * S;
let E = S * S * S + (d - S * c) / 2.0;
let F_root = (E * E + D * D * D).sqrt();
let mut F = -F_root - E;
if is_zero(F) {
F = F_root - E;
}
(0..3).into_iter().map(|i| {
let G = cbrt(F, i);
G - D / G - S
}).collect()
}
}
pub fn solve_quartic(
a: Complex<f64>,
b: Complex<f64>,
c: Complex<f64>,
d: Complex<f64>,
e: Complex<f64>,
) -> Vec<Complex<f64>> {
if is_zero(a) {
solve_cubic(b, c, d, e)
} else {
let b = b / a;
let c = c / a;
let d = d / a;
let e = e / a;
let b2 = b * b;
let b3 = b * b2;
let b4 = b * b3;
let alpha = (-3.0 / 8.0) * b2 + c;
let beta = b3 / 8.0 - b * c / 2.0 + d;
let gamma = (-3.0 / 256.0) * b4 + b2 * c / 16.0 - b * d / 4.0 + e;
let alpha2 = alpha * alpha;
let t = -b / 4.0;
if is_zero(beta) {
let rad = (alpha2 - 4.0 * gamma).sqrt();
let r1 = ((-alpha + rad) / 2.0).sqrt();
let r2 = ((-alpha - rad) / 2.0).sqrt();
vec![t + r1, t - r1, t + r2, t - r2]
} else {
let alpha3 = alpha * alpha2;
let P = -(alpha2 / 12.0 + gamma);
let Q = -alpha3 / 108.0 + alpha * gamma / 3.0 - beta * beta / 8.0;
let R = -Q / 2.0 + (Q * Q / 4.0 + P * P * P / 27.0).sqrt();
let U = cbrt(R, 0);
let mut y = (-5.0 / 6.0) * alpha + U;
if is_zero(U) {
y -= cbrt(Q, 0);
} else {
y -= P / (3.0 * U);
}
let W = (alpha + 2.0 * y).sqrt();
let r1 = (-(3.0 * alpha + 2.0 * y + 2.0 * beta / W)).sqrt();
let r2 = (-(3.0 * alpha + 2.0 * y - 2.0 * beta / W)).sqrt();
vec![
t + (W - r1) / 2.0,
t + (W + r1) / 2.0,
t + (-W - r2) / 2.0,
t + (-W + r2) / 2.0,
]
}
}
}
pub fn solve_quartic_f64(a: f64, b: f64, c: f64, d: f64, e: f64) -> Vec<f64> {
filter_real(solve_quartic(
complex(a),
complex(b),
complex(c),
complex(d),
complex(e),
))
}
#[cfg(test)]
mod tests {
use super::*;
fn check_roots(known: &[Complex<f64>], found: &[Complex<f64>]) {
const MAX_ROOTS: usize = 4;
assert!(found.len() <= MAX_ROOTS, "num roots out of bounds: {}", found.len());
let mut used = [false, false, false, false];
for k in 0..found.len() {
let mut ok = false;
for f in 0..found.len() {
if !used[f] && is_zero(known[k] - found[f]) {
ok = true;
used[f] = true;
break;
}
}
if !ok {
panic!(
"Solver produced incorrect root value(s)\n\
Known correct roots: {:?}\n\
Found roots: {:?}",
known, found
);
}
}
}
fn validate_polynomial(order: usize, poly: &[Complex<f64>], root: Complex<f64>) {
let mut power = complex2(1.0, 0.0);
let mut sum = complex2(0.0, 0.0);
for i in 0..order {
sum += poly[i] * power;
power *= root;
}
assert!(is_zero(sum), "invalid polynomial");
}
fn test_known_quadratic_roots(M: Complex<f64>, K: Complex<f64>, L: Complex<f64>) {
let a = M;
let b = -M * (K + L);
let c = M * K * L;
let poly = [c, b, a];
validate_polynomial(3, &poly, K);
validate_polynomial(3, &poly, L);
let found = solve_quadratic(a, b, c);
let expected_roots = if is_zero(K - L) { 1 } else { 2 };
assert_eq!(expected_roots, found.len());
let known = [K, L];
check_roots(&known, &found);
}
fn test_known_cubic_roots(M: Complex<f64>, K: Complex<f64>, L: Complex<f64>, N: Complex<f64>)
{
let a = M;
let b = -M*(K+L+N);
let c = M*(K*L + N*K + N*L);
let d = -M*K*L*N;
let poly = [d, c, b, a];
validate_polynomial(4, &poly, K);
validate_polynomial(4, &poly, L);
validate_polynomial(4, &poly, N);
let found = solve_cubic(a, b, c, d);
let expected_roots = 3;
assert_eq!(expected_roots, found.len());
let known = [K, L, N];
check_roots(&known, &found);
}
fn test_known_quartic_roots(m: Complex<f64>, a: Complex<f64>, b: Complex<f64>, c: Complex<f64>, d: Complex<f64>) {
let A = m;
let B = -m*(a + b + c + d);
let C = m*(a*b + c*d + (a + b)*(c + d));
let D = -m*(c*d*(a + b) + a*b*(c + d));
let E = m*a*b*c*d;
let poly = [E, D, C, B, A];
validate_polynomial(5, &poly, a);
validate_polynomial(5, &poly, b);
validate_polynomial(5, &poly, c);
validate_polynomial(5, &poly, d);
let found = solve_quartic(A, B, C, D, E);
let expected_roots = 4;
assert_eq!(expected_roots, found.len());
let known = [a, b, c, d];
check_roots(&known, &found);
}
#[test]
pub fn quadratic() {
test_known_quadratic_roots(complex2(-2.3,4.8), complex2(3.2,-4.1), complex2(-2.5,7.7));
test_known_quadratic_roots(complex2(5.5,4.4), complex2(8.2,-2.1), complex2(8.2,-2.1));
}
#[test]
pub fn cubic() {
test_known_cubic_roots(complex(1.0), complex(2.0), complex(3.0), complex(4.0));
test_known_cubic_roots(complex2(-2.3,4.8), complex2(3.2,-4.1), complex2(-2.5,7.7), complex2(53.0,-23.9));
}
#[test]
pub fn quartic() {
test_known_quartic_roots(complex(1.0), complex(2.0), complex(3.0), complex(4.0), complex(5.0));
test_known_quartic_roots(complex(1.0), complex(3.2), complex(2.5), complex(53.0), complex(-8.7));
test_known_quartic_roots(complex2(-2.3,4.8), complex2(3.2,-4.1), complex2(-2.5,7.7), complex2(53.0,-23.9), complex2(-9.2,-8.7));
}
}
| /*
Transcribed from http://cosinekitty.com/raytrace/rtsource.zip.
Original written by Don Cross.
Adapted to Rust by Gordon Tyler.
*/
#![allow(non_snake_case)]
use num_complex::Complex;
use std::f64::consts::PI;
const TOLERANCE: f64 = 1.0e-8;
const TWO_PI: f64 = 2.0 * PI;
fn complex(re: f64) -> Complex<f64> {
Complex { re, im: 0.0 }
}
fn complex2(re: f64, im: f64) -> Complex<f64> {
Complex { re, im }
}
fn is_zero(c: Complex<f64>) -> bool {
c.re.abs() < TOLERANCE && c.im.abs() < TOLERANCE
}
fn filter_real(c: Vec<Complex<f64>>) -> Vec<f64> {
c.into_iter().filter(|c| c.im.abs() < TOLERANCE).map(|c| c.re).collect()
}
fn cbrt(c: Complex<f64>, n: isize) -> Complex<f64> {
let rho = c.norm().powf(1.0 / 3.0);
let theta = ((TWO_PI * n as f64) + c.arg()) / 3.0;
complex2(
rho * theta.cos(),
rho * theta.sin(),
)
}
pub fn solve_quadratic(a: Complex<f64>, b: Complex<f64>, c: Complex<f64>) -> Vec<Complex<f64>> {
if is_zero(a) {
if is_zero(b) {
Vec::with_capacity(0)
} else {
vec![-c / b]
}
} else {
let radicand = b * b - 4.0 * a * c;
if is_zero(radicand) {
vec![-b / (2.0 * a)]
} else {
let r = radicand.sqrt();
let d = 2.0 * a;
vec![(-b + r) / d, (-b - r) / d]
}
}
}
pub fn solve_cubic(a: Complex<f64>, b: Complex<f64>, c: Complex<f64>, d: Complex<f64>) -> Vec<Complex<f64>> {
if is_zero(a) {
solve_quadratic(b, c, d)
} else {
let b = b / a;
let c = c / a;
let d = d / a;
let S = b / 3.0;
let D = c / 3.0 - S * S;
let E = S * S * S + (d - S * c) / 2.0;
let F_root = (E * E + D * D * D).sqrt();
let mut F = -F_root - E;
if is_zero(F) {
F = F_root - E;
}
(0..3).into_iter().map(|i| {
let G = cbrt(F, i);
G - D / G - S
}).collect()
}
}
pub fn solve_quartic(
a: Complex<f64>,
b: Complex<f64>,
c: Complex<f64>,
d: Complex<f64>,
e: Complex<f64>,
) -> Vec<Complex<f64>> {
if is_zero(a) {
solve_cubic(b, c, d, e)
} else {
let b = b / a;
let c = c / a;
let d = d / a;
let e = e / a;
let b2 = b * b;
let b3 = b * b2;
let b4 = b * b3;
let alpha = (-3.0 / 8.0) * b2 + c;
let beta = b3 / 8.0 - b * c / 2.0 + d;
let gamma = (-3.0 / 256.0) * b4 + b2 * c / 16.0 - b * d / 4.0 + e;
let alpha2 = alpha * alpha;
let t = -b / 4.0;
if is_zero(beta) {
let rad = (alpha2 - 4.0 * gamma).sqrt();
let r1 = ((-alpha + rad) / 2.0).sqrt();
let r2 = ((-alpha - rad) / 2.0).sqrt();
vec![t + r1, t - r1, t + r2, t - r2]
} else {
let alpha3 = alpha * alpha2;
let P = -(alpha2 / 12.0 + gamma);
let Q = -alpha3 / 108.0 + alpha * gamma / 3.0 - beta * beta / 8.0;
let R = -Q / 2.0 + (Q * Q / 4.0 + P * P * P / 27.0).sqrt();
let U = cbrt(R, 0);
let mut y = (-5.0 / 6.0) * alpha + U;
if is_zero(U) {
y -= cbrt(Q, 0);
} else {
y -= P / (3.0 * U);
}
let W = (alpha + 2.0 * y).sqrt();
let r1 = (-(3.0 * alpha + 2.0 * y + 2.0 * beta / W)).sqrt();
let r2 = (-(3.0 * alpha + 2.0 * y - 2.0 * beta / W)).sqrt();
vec![
t + (W - r1) / 2.0,
t + (W + r1) / 2.0,
t + (-W - r2) / 2.0,
t + (-W + r2) / 2.0,
]
}
}
}
pub fn solve_quartic_f64(a: f64, b: f64, c: f64, d: f64, e: f64) -> Vec<f64> {
filter_real(solve_quartic(
complex(a),
complex(b),
complex(c),
complex(d),
complex(e),
))
}
#[cfg(test)]
mod tests {
use super::*;
fn check_roots(known: &[Complex<f64>], found: &[Complex<f64>]) {
const MAX_ROOTS: usize = 4;
assert!(found.len() <= MAX_ROOTS, "num roots out of bounds: {}", found.len());
let mut used = [false, false, false, false];
for k in 0..found.len() {
let mut ok = false;
for f in 0..found.len() {
if !used[f] && is_zero(known[k] - found[f]) {
ok = true;
used[f] = true;
break;
}
}
if !ok {
panic!(
"Solver produced incorrect root value(s)\n\
Known correct roots: {:?}\n\
Found roots: {:?}",
known, found
);
}
}
}
fn validate_polynomial(order: usize, poly: &[Complex<f64>], root: Complex<f64>) {
let mut power = complex2(1.0, 0.0);
let mut sum = complex2(0.0, 0.0);
for i in 0..order {
sum += poly[i] * power;
power *= root;
}
assert!(is_zero(sum), "invalid polynomial");
}
fn test_known_quadratic_roots(M: Complex<f64>, K: Complex<f64>, L: Complex<f64>) {
let a = M;
let b = -M * (K + L);
let c = M * K * L;
let poly = [c, b, a];
validate_polynomial(3, &poly, K);
validate_polynomial(3, &poly, L);
let found = solve_quadratic(a, b, c);
let expected_roots = if is_zero(K - L) { 1 } else { 2 };
assert_eq!(expected_roots, found.len());
let known = [K, L];
check_roots(&known, &found);
}
fn test_known_cubic_roots(M: Complex<f64>, K: Complex<f64>, L: Complex<f64>, N: Complex<f64>)
{
let a = M;
let b = -M*(K+L+N);
let c = M*(K*L + N*K + N*L);
let d = -M*K*L*N;
let poly = [d, c, b, a];
validate_polynomial(4, &poly, K);
validate_polynomial(4, &poly, L);
validate_polynomial(4, &poly, N);
let found = solve_cubic(a, b, c, d);
let expected_roots = 3;
assert_eq!(expected_roots, found.len());
let known = [K, L, N];
check_roots(&known, &found);
}
fn test_known_quartic_roots(m: Complex<f64>, a: Complex<f64>, b: Complex<f64>, c: Complex<f64>, d: Complex<f64>) {
let A = m;
let B = -m*(a + b + c + d);
let C = m*(a*b + c*d + (a + b)*(c + d));
let D = -m*(c*d*(a + b) + a*b*(c + d));
let E = m*a*b*c*d;
let poly = [E, D, C, B, A];
validate_polynomial(5, &poly, a);
validate_polynomial(5, &poly, b);
validate_polynomial(5, &poly, c);
validate_polynomial(5, &poly, d);
let found = solve_quartic(A, B, C, D, E);
let expected_roots = 4;
assert_eq!(expected_roots, found.len());
let known = [a, b, c, d];
check_roots(&known, &found);
}
#[test]
pub fn quadratic() {
test_known_quadratic_roots(complex2(-2.3,4.8), complex2(3.2,-4.1), complex2(-2.5,7.7));
test_known_quadratic_roots(complex2(5.5,4.4), complex2(8.2,-2.1), complex2(8.2,-2.1));
}
#[test]
pub fn cubic() {
test_known_cubic_roots(complex(1.0), complex(2.0), complex(3. | complex(5.0));
test_known_quartic_roots(complex(1.0), complex(3.2), complex(2.5), complex(53.0), complex(-8.7));
test_known_quartic_roots(complex2(-2.3,4.8), complex2(3.2,-4.1), complex2(-2.5,7.7), complex2(53.0,-23.9), complex2(-9.2,-8.7));
}
}
| 0), complex(4.0));
test_known_cubic_roots(complex2(-2.3,4.8), complex2(3.2,-4.1), complex2(-2.5,7.7), complex2(53.0,-23.9));
}
#[test]
pub fn quartic() {
test_known_quartic_roots(complex(1.0), complex(2.0), complex(3.0), complex(4.0), | random | [
{
"content": "fn solve_quadratic(a: f64, b: f64, c: f64) -> Option<(f64, f64)> {\n\n let discr = b * b - 4.0 * a * c;\n\n if discr < 0.0 {\n\n return None;\n\n } else if discr == 0.0 {\n\n let x = -0.5 * b / a;\n\n return Some((x, x));\n\n } else {\n\n let q = if b > 0.0 ... |
Rust | src/tables/parts.rs | jaredwolff/eagle-plm | aae5fd8f0ca6d30d295af99eed038b2195fa073b | extern crate diesel;
use prettytable::{row, Table};
use serde::Deserialize;
use crate::{models::*, *};
use diesel::prelude::*;
use std::fs::File;
use std::io::BufReader;
#[derive(Debug, Deserialize)]
struct Record {
pn: String,
mpn: String,
desc: String,
}
pub fn create(app: &mut crate::Application) {
let pn = app.prompt.ask_text_entry("Part Number: ");
let mpn = app.prompt.ask_text_entry("Manufacturer Part Number: ");
let desc = app.prompt.ask_text_entry("Description: ");
let ver = app.prompt.ask_text_entry("Version: ");
let ver: i32 = ver.trim().parse().expect("Invalid version number!");
let part = NewUpdatePart {
pn: &pn,
mpn: &mpn,
descr: &desc,
ver: &ver,
mqty: &1,
};
let found = find_part_by_pn(&app.conn, &pn);
if let Ok(found) = found {
let question = format!("{} already exists! Would you like to update it?", pn);
let update = app.prompt.ask_yes_no_question(&question);
if update {
update_part(&app.conn, &found.id, &part).expect("Unable to update part!");
println!("{} updated!", pn);
}
} else {
create_part(&app.conn, &part).expect("Unable to create part!");
}
}
pub fn rename(app: &mut crate::Application) {
let pn = app.prompt.ask_text_entry("Part Number: ");
let newpn = app.prompt.ask_text_entry("New Part Number: ");
rename_part(&app.conn, &pn, &newpn).expect("Unable to change pn");
}
pub fn create_by_csv(app: &mut crate::Application, filename: &str) {
let file = File::open(filename).unwrap();
let file = BufReader::new(file);
let mut records: Vec<Record> = Vec::new();
let mut rdr = csv::Reader::from_reader(file);
for result in rdr.deserialize() {
let record: Record = result.expect("Unable to deserialize.");
println!("Processing: {:?}", record);
records.push(record);
}
for record in records {
let part = models::NewUpdatePart {
pn: &record.pn,
mpn: &record.mpn,
descr: &record.desc,
ver: &1,
mqty: &1,
};
let found = find_part_by_pn(&app.conn, &part.pn);
if let Ok(found) = found {
if found.mpn != part.mpn || found.descr != part.descr || found.ver != *part.ver {
let question = format!("{} already exists! Would you like to update it?", part.pn);
let mut table = Table::new();
table.add_row(row![
"Current:",
found.pn,
found.mpn,
found.descr,
found.ver
]);
table.add_row(row!["Change to:", part.pn, part.mpn, part.descr, part.ver]);
table.printstd();
let update = app.prompt.ask_yes_no_question(&question);
if update {
update_part(&app.conn, &found.id, &part).expect("Unable to update part!");
println!("{} updated!", part.pn);
}
}
} else {
println!("Creating: {:?}", part);
create_part(&app.conn, &part).expect("Unable to create part!");
}
}
}
pub fn delete(app: &mut crate::Application) {
let part = app.prompt.ask_text_entry("Part Number: ");
let part = find_part_by_pn(&app.conn, &part).expect("Unable to find part!");
let question = format!("Would you like to delete {}?", part.pn);
let delete = app.prompt.ask_yes_no_question(&question);
if delete {
let res = delete_part(&app.conn, &part.id);
if res.is_err() {
panic!("Error deleting part {}.", part.pn);
} else {
println!("Deleted {}", part.pn);
}
}
}
pub fn show(app: &mut crate::Application) {
use crate::schema::*;
let mut table = Table::new();
let results = parts::dsl::parts
.load::<models::Part>(&app.conn)
.expect("Error loading parts");
println!("Displaying {} parts", results.len());
table.add_row(row!["PN", "MPN", "Desc", "Mqty", "Ver"]);
for part in results {
table.add_row(row![part.pn, part.mpn, part.descr, part.mqty, part.ver]);
}
table.printstd();
}
| extern crate diesel;
use prettytable::{row, Table};
use serde::Deserialize;
use crate::{models::*, *};
use diesel::prelude::*;
use std::fs::File;
use std::io::BufReader;
#[derive(Debug, Deserialize)]
struct Record {
pn: String,
mpn: String,
desc: String,
}
pub fn create(app: &mut crate::Application) {
let pn = app.prompt.ask_text_entry("Part Number: ");
let mpn = app.prompt.ask_text_entry("Manufacturer Part Number: ");
let desc = app.prompt.ask_text_entry("Description: ");
let ver = app.prompt.ask_text_entry("Version: ");
let ver: i32 = ver.trim().parse().expect("Invalid version number!");
let part = NewUpdatePart {
pn: &pn,
mpn: &mpn,
descr: &desc,
ver: &ver,
mqty: &1,
};
let found = find_part_by_pn(&app.conn, &pn);
if let Ok(found) = found {
let question = format!("{} already exists! Would you like to update it?", pn);
let update = app.prompt.ask_yes_no_question(&question);
if update {
update_part(&app.conn, &found.id, &part).expect("Unable to update part!");
println!("{} updated!", pn);
}
} else {
create_part(&app.conn, &part).expect("Unable to create part!");
}
}
pub fn rename(app: &mut crate::Application) {
let pn = app.prompt.ask_text_entry("Part Number: ");
let newpn = app.prompt.ask_text_entry("New Part Number: ");
rename_part(&app.conn, &pn, &newpn).expect("Unable to change pn");
}
pub fn create_by_csv(app: &mut crate::Application, filename: &str) {
let file = File::open(filename).unwrap();
let file = BufReader::new(file);
let mut records: Vec<Record> = Vec::new();
let mut rdr = csv::Reader::from_reader(file);
for result in rdr.deserialize() {
let record: Record = result.expect("Unable to deserialize.");
println!("Processing: {:?}", record);
records.push(record);
}
for record in records {
let part = models::NewUpdatePart {
pn: &record.pn,
mpn: &record.mpn,
descr: &record.desc,
ver: &1,
mqty: &1,
};
let found = find_part_by_pn(&app.conn, &part.pn);
if let Ok(found) = found {
if found.mpn != part.mpn || found.descr != part.descr || found.ver != *part.ver {
let question = format!("{} already exists! Would you like to update it?", part.pn);
let mut table = Table::new();
table.add_row(row![
"Current:",
found.pn,
found.mpn,
found.descr,
found.ver
]);
table.add_row(row!["Change to:", part.pn, part.mpn, part.descr, part.ver]);
table.printstd();
let update = app.prompt.ask_yes_no_question(&question);
if update {
|
pub fn delete(app: &mut crate::Application) {
let part = app.prompt.ask_text_entry("Part Number: ");
let part = find_part_by_pn(&app.conn, &part).expect("Unable to find part!");
let question = format!("Would you like to delete {}?", part.pn);
let delete = app.prompt.ask_yes_no_question(&question);
if delete {
let res = delete_part(&app.conn, &part.id);
if res.is_err() {
panic!("Error deleting part {}.", part.pn);
} else {
println!("Deleted {}", part.pn);
}
}
}
pub fn show(app: &mut crate::Application) {
use crate::schema::*;
let mut table = Table::new();
let results = parts::dsl::parts
.load::<models::Part>(&app.conn)
.expect("Error loading parts");
println!("Displaying {} parts", results.len());
table.add_row(row!["PN", "MPN", "Desc", "Mqty", "Ver"]);
for part in results {
table.add_row(row![part.pn, part.mpn, part.descr, part.mqty, part.ver]);
}
table.printstd();
}
| update_part(&app.conn, &found.id, &part).expect("Unable to update part!");
println!("{} updated!", part.pn);
}
}
} else {
println!("Creating: {:?}", part);
create_part(&app.conn, &part).expect("Unable to create part!");
}
}
} | function_block-function_prefix_line | [
{
"content": "/// Function used to show parts in BOM\n\npub fn show(app: &mut crate::Application, part_number: &str, version: &Option<i32>) {\n\n use crate::schema::*;\n\n\n\n // Find the part\n\n let part = find_part_by_pn(&app.conn, &part_number);\n\n\n\n if part.is_err() {\n\n println!(\"{... |
Rust | 2018/dec03/rs/src/main.rs | henrywallace/advent-of-code | f50d00b47603117e25c18d4f645fadd451fb6be2 | extern crate clap;
#[macro_use]
extern crate lazy_static;
extern crate regex;
use std::error::Error;
use std::fs::File;
use std::io::{BufReader, BufRead};
use clap::{Arg, App};
use std::collections::{HashMap, HashSet};
use std::str::FromStr;
use regex::Regex;
#[derive(Debug)]
struct Claim {
id: u32,
offset: (u32, u32),
size: (u32, u32),
}
impl FromStr for Claim {
type Err = Box<Error>;
fn from_str(s: &str) -> Result<Self, Self::Err> {
lazy_static! {
static ref RE: Regex = Regex::new(r"(?x)
\#(?P<id>\d+)\s+@\s+
(?P<x>\d+),(?P<y>\d+):\s+
(?P<w>\d+)x(?P<h>\d+)
").unwrap();
}
match RE.captures(s) {
Some(caps) => {
Ok(Claim{
id: caps["id"].parse()?,
offset: (caps["x"].parse()?, caps["y"].parse()?),
size: (caps["w"].parse()?, caps["h"].parse()?),
})
},
None => Err(Box::<Error>::from(format!("failed to create claim from: {:?}", s))),
}
}
}
impl Claim {
fn update_fabric(&self, fabric: &mut Fabric) {
for i in self.offset.0..(self.offset.0+self.size.0) {
for j in self.offset.1..(self.offset.1+self.size.1) {
fabric.entry((i, j))
.or_insert(vec![])
.push(self.id);
}
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_fabric_one_simple() {
let claim: Claim = "#1 @ 1,2: 1x2".parse().unwrap();
let mut actual = Fabric::new();
claim.update_fabric(&mut actual);
let expect: Fabric = [
((1, 2), vec![1]),
((1, 3), vec![1]),
].iter().cloned().collect();
assert_eq!(expect, actual);
}
#[test]
fn test_fabric_two_overlap() {
let claim1: Claim = "#1 @ 0,0: 2x1".parse().unwrap();
let claim2: Claim = "#2 @ 1,0: 2x1".parse().unwrap();
let mut actual = Fabric::new();
claim1.update_fabric(&mut actual);
claim2.update_fabric(&mut actual);
let expect: Fabric = [
((0, 0), vec![1]), ((1, 0), vec![1, 2]), ((2, 0), vec![2]),
].iter().cloned().collect();
assert_eq!(expect, actual);
}
}
type Fabric = HashMap<(u32, u32), Vec<u32>>;
fn part1(input: &str) -> Result<(), Box<Error>> {
let mut fabric = Fabric::new();
let f = File::open(input)?;
let buf = BufReader::new(f);
for line in buf.lines() {
let claim: Claim = line?.parse()?;
claim.update_fabric(&mut fabric);
}
let mut total = 0;
for v in fabric.values() {
if v.len() > 1 {
total += 1;
}
}
println!("{}", total);
Ok(())
}
fn part2(input: &str) -> Result<(), Box<Error>> {
let mut fabric = Fabric::new();
let f = File::open(input)?;
let buf = BufReader::new(f);
for line in buf.lines() {
let claim: Claim = line?.parse()?;
claim.update_fabric(&mut fabric);
}
let mut alone: HashSet<u32> = HashSet::new();
let mut not_alone: HashSet<u32> = HashSet::new();
for v in fabric.values() {
if v.len() == 1 {
alone.insert(v[0]);
} else {
for id in v.iter() {
not_alone.insert(*id);
}
}
}
println!("{:?}", alone.difference(¬_alone));
Ok(())
}
fn main() {
let matches = App::new("dec01")
.arg(Arg::with_name("input").required(true))
.arg(Arg::with_name("part").long("part").required(true)
.takes_value(true)
.possible_values(&["1", "2"]))
.get_matches();
let input = matches.value_of("input").unwrap();
match matches.value_of("part").unwrap() {
"1" => part1(input).unwrap(),
"2" => part2(input).unwrap(),
_ => unreachable!(),
}
}
| extern crate clap;
#[macro_use]
extern crate lazy_static;
extern crate regex;
use std::error::Error;
use std::fs::File;
use std::io::{BufReader, BufRead};
use clap::{Arg, App};
use std::collections::{HashMap, HashSet};
use std::str::FromStr;
use regex::Regex;
#[derive(Debug)]
struct Claim {
id: u32,
offset: (u32, u32),
size: (u32, u32),
}
impl FromStr for Claim {
type Err = Box<Error>;
fn from_str(s: &str) -> Result<Self, Self::Err> {
lazy_static! {
static ref RE: Regex = Regex::new(r"(?x)
\#(?P<id>\d+)\s+@\s+
(?P<x>\d+),(?P<y>\d+):\s+
(?P<w>\d+)x(?P<h>\d+)
").unwrap();
}
match RE.captures(s) {
Some(caps) => {
Ok(Claim{
id: caps["id"].parse()?,
offset: (caps["x"].parse()?, caps["y"].parse()?),
size: (caps["w"].parse()?, caps["h"].parse()?),
})
},
None => Err(Box::<Error>::from(format!("failed to create claim from: {:?}", s))),
}
}
}
impl Claim {
fn update_fabric(&self, fabric: &mut Fabric) {
for i in self.offset.0..(self.offset.0+self.size.0) {
for j in self.offset.1..(self.offset.1+self.size.1) {
fabric.entry((i, j))
.or_insert(vec![])
.push(self.id);
}
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_fabric_one_simple() {
let claim: Claim = "#1 @ 1,2: 1x2".parse().unwrap();
let mut actual = Fabric::new();
claim.update_fabric(&mut actual);
let expect: Fabric = [
((1, 2), vec![1]),
((1, 3), vec![1]),
].iter().cloned().collect();
assert_eq!(expect, actual);
}
#[test]
fn test_fabric_two_overlap() {
let claim1: Claim = "#1 @ 0,0: 2x1".parse().unwrap();
let claim2: Claim = "#2 @ 1,0: 2x1".parse().unwrap();
let mut actual = Fabric::new();
claim1.update_fabric(&mut actual);
claim2.update_fabric(&mut actual);
let expect: Fabric = [
((0, 0), vec![1]), ((1, 0), vec![1, 2]), ((2, 0), vec![2]),
].iter().cloned().collect();
assert_eq!(expect, actual);
}
}
type Fabric = HashMap<(u32, u32), Vec<u32>>;
fn part1(input: &str) -> Result<(), Box<Error>> {
let mut fabric = Fabric::new();
let f = File::open(input)?;
let buf = BufReader::new(f);
for line in buf.lines() {
let claim: Claim = line?.parse()?;
claim.update_fabric(&mut fabric);
}
let mut total = 0;
for v in fabric.values() {
if v.len() > 1 {
total += 1;
}
}
println!("{}", total);
Ok(())
}
fn part2(input: &str) -> Result<(), Box<Error>> {
let mut fabric = Fabric::new();
let f = File::open(input)?;
let buf = BufReader::new(f);
for line in buf.lines() {
let claim: Claim = line?.parse()?;
claim.update_fabric(&mut fabric);
}
let mut alone: HashSet<u32> = HashSet::new();
let mut |
}
println!("{:?}", alone.difference(¬_alone));
Ok(())
}
fn main() {
let matches = App::new("dec01")
.arg(Arg::with_name("input").required(true))
.arg(Arg::with_name("part").long("part").required(true)
.takes_value(true)
.possible_values(&["1", "2"]))
.get_matches();
let input = matches.value_of("input").unwrap();
match matches.value_of("part").unwrap() {
"1" => part1(input).unwrap(),
"2" => part2(input).unwrap(),
_ => unreachable!(),
}
}
| not_alone: HashSet<u32> = HashSet::new();
for v in fabric.values() {
if v.len() == 1 {
alone.insert(v[0]);
} else {
for id in v.iter() {
not_alone.insert(*id);
}
} | function_block-random_span | [
{
"content": "type GuardID = u32;\n\n\n",
"file_path": "2018/dec04/rs/src/main.rs",
"rank": 1,
"score": 92777.30177134293
},
{
"content": "fn part1(input: &str) -> Result<(), Box<Error>> {\n\n let f = File::open(input)?;\n\n let buf = BufReader::new(f);\n\n let mut records = vec![];... |
Rust | src/post.rs | Lonami/pagong | bb5b24c733c435e8c041e5a91112e3ae5ad8cacc | use crate::config::{
Config, DATE_FMT, META_KEY_CATEGORY, META_KEY_CREATION_DATE, META_KEY_MODIFIED_DATE,
META_KEY_TAGS, META_KEY_TEMPLATE, META_KEY_TITLE, META_TAG_SEPARATOR, META_VALUE_SEPARATOR,
SOURCE_META_KEY,
};
use pulldown_cmark::{CodeBlockKind, Event, Parser, Tag};
use std::collections::HashMap;
use std::fs;
use std::io;
use std::path::{Path, PathBuf};
use std::time::UNIX_EPOCH;
use chrono::offset::Local;
use chrono::{Date, NaiveDate, NaiveDateTime, TimeZone};
const ZWNBSP: &str = "\u{FEFF}";
#[derive(Debug, Clone)]
pub struct Post {
pub path: PathBuf,
pub markdown: String,
pub meta: HashMap<String, String>,
pub title: String,
pub date: Date<Local>,
pub updated: Date<Local>,
pub category: String,
pub tags: Vec<String>,
pub template: Option<PathBuf>,
pub uri: String,
pub toc: Vec<(String, u8)>,
}
impl Post {
pub fn new(config: &Config, root: &Path, path: PathBuf) -> io::Result<Self> {
let mut markdown = fs::read_to_string(&path)?.replace(ZWNBSP, "");
let mut meta = HashMap::new();
if let Some((Event::Start(Tag::CodeBlock(CodeBlockKind::Fenced(lang))), start_range)) =
Parser::new(&markdown).into_offset_iter().next()
{
if lang.as_ref() == SOURCE_META_KEY {
meta.extend(markdown[start_range.clone()].lines().filter_map(|line| {
let mut kv = line.splitn(2, META_VALUE_SEPARATOR);
kv.next()
.zip(kv.next())
.map(|(k, v)| (k.trim().to_owned(), v.trim().to_owned()))
}));
markdown.replace_range(start_range, "");
}
}
let title = meta
.get(META_KEY_TITLE)
.cloned()
.or_else(|| {
let mut wait_title = false;
Parser::new(&markdown).find_map(|event| {
match event {
Event::Start(Tag::Heading(1)) => wait_title = true,
Event::Text(s) if wait_title => {
return Some(s.to_string());
}
_ => {}
}
None
})
})
.unwrap_or_else(|| {
path.file_name()
.unwrap()
.to_str()
.expect("bad md file name")
.to_owned()
});
let metadata = fs::metadata(&path)?;
let date = meta
.get(META_KEY_CREATION_DATE)
.and_then(|date| NaiveDate::parse_from_str(date, DATE_FMT).ok())
.or_else(|| {
metadata
.created()
.ok()
.and_then(|date| date.duration_since(UNIX_EPOCH).ok())
.map(|duration| {
NaiveDateTime::from_timestamp(
duration.as_secs() as i64,
duration.subsec_nanos(),
)
.date()
})
})
.and_then(|date| Local.from_local_date(&date).latest())
.unwrap_or_else(|| Local::now().date());
let updated = meta
.get(META_KEY_MODIFIED_DATE)
.and_then(|date| NaiveDate::parse_from_str(date, DATE_FMT).ok())
.or_else(|| {
metadata
.modified()
.ok()
.and_then(|date| date.duration_since(UNIX_EPOCH).ok())
.map(|duration| {
NaiveDateTime::from_timestamp(
duration.as_secs() as i64,
duration.subsec_nanos(),
)
.date()
})
})
.and_then(|date| Local.from_local_date(&date).latest())
.unwrap_or(date);
let category = meta.get(META_KEY_CATEGORY).cloned().unwrap_or_else(|| {
path.parent()
.expect("post file had no parent")
.file_name()
.expect("post parent had no name")
.to_str()
.expect("post parent had non-utf8 name")
.to_owned()
});
let tags = meta
.get(META_KEY_TAGS)
.map(|tags| {
tags.split(META_TAG_SEPARATOR)
.map(|s| s.trim().to_owned())
.collect()
})
.unwrap_or_else(Vec::new);
let template = meta
.get(META_KEY_TEMPLATE)
.map(|s| crate::utils::get_abs_path(root, &path, s));
let uri = crate::utils::path_to_uri(root, &path.with_extension(&config.dist_ext));
let toc = {
let mut toc_depth = None;
Parser::new(&markdown)
.filter_map(|event| {
match event {
Event::Start(Tag::Heading(depth)) => toc_depth = Some(depth as u8),
Event::Text(s) if toc_depth.is_some() => {
return Some((s.to_string(), toc_depth.take().unwrap()));
}
_ => {}
}
None
})
.collect()
};
Ok(Self {
path,
markdown,
meta,
title,
date,
updated,
category,
tags,
template,
uri,
toc,
})
}
}
| use crate::config::{
Config, DATE_FMT, META_KEY_CATEGORY, META_KEY_CREATION_DATE, META_KEY_MODIFIED_DATE,
META_KEY_TAGS, META_KEY_TEMPLATE, META_KEY_TITLE, META_TAG_SEPARATOR, META_VALUE_SEPARATOR,
SOURCE_META_KEY,
};
use pulldown_cmark::{CodeBlockKind, Event, Parser, Tag};
use std::collections::HashMap;
use std::fs;
use std::io;
use std::path::{Path, PathBuf};
use std::time::UNIX_EPOCH;
use chrono::offset::Local;
use chrono::{Date, NaiveDate, NaiveDateTime, TimeZone};
const ZWNBSP: &str = "\u{FEFF}";
#[derive(Debug, Clone)]
pub struct Post {
pub path: PathBuf,
pub markdown: String,
pub meta: HashMap<String, String>,
pub title: String,
pub date: Date<Local>,
pub updated: Date<Local>,
pub category: String,
pub tags: Vec<String>,
pub template: Option<PathBuf>,
pub uri: String,
pub toc: Vec<(String, u8)>,
}
impl Post {
|
}
| pub fn new(config: &Config, root: &Path, path: PathBuf) -> io::Result<Self> {
let mut markdown = fs::read_to_string(&path)?.replace(ZWNBSP, "");
let mut meta = HashMap::new();
if let Some((Event::Start(Tag::CodeBlock(CodeBlockKind::Fenced(lang))), start_range)) =
Parser::new(&markdown).into_offset_iter().next()
{
if lang.as_ref() == SOURCE_META_KEY {
meta.extend(markdown[start_range.clone()].lines().filter_map(|line| {
let mut kv = line.splitn(2, META_VALUE_SEPARATOR);
kv.next()
.zip(kv.next())
.map(|(k, v)| (k.trim().to_owned(), v.trim().to_owned()))
}));
markdown.replace_range(start_range, "");
}
}
let title = meta
.get(META_KEY_TITLE)
.cloned()
.or_else(|| {
let mut wait_title = false;
Parser::new(&markdown).find_map(|event| {
match event {
Event::Start(Tag::Heading(1)) => wait_title = true,
Event::Text(s) if wait_title => {
return Some(s.to_string());
}
_ => {}
}
None
})
})
.unwrap_or_else(|| {
path.file_name()
.unwrap()
.to_str()
.expect("bad md file name")
.to_owned()
});
let metadata = fs::metadata(&path)?;
let date = meta
.get(META_KEY_CREATION_DATE)
.and_then(|date| NaiveDate::parse_from_str(date, DATE_FMT).ok())
.or_else(|| {
metadata
.created()
.ok()
.and_then(|date| date.duration_since(UNIX_EPOCH).ok())
.map(|duration| {
NaiveDateTime::from_timestamp(
duration.as_secs() as i64,
duration.subsec_nanos(),
)
.date()
})
})
.and_then(|date| Local.from_local_date(&date).latest())
.unwrap_or_else(|| Local::now().date());
let updated = meta
.get(META_KEY_MODIFIED_DATE)
.and_then(|date| NaiveDate::parse_from_str(date, DATE_FMT).ok())
.or_else(|| {
metadata
.modified()
.ok()
.and_then(|date| date.duration_since(UNIX_EPOCH).ok())
.map(|duration| {
NaiveDateTime::from_timestamp(
duration.as_secs() as i64,
duration.subsec_nanos(),
)
.date()
})
})
.and_then(|date| Local.from_local_date(&date).latest())
.unwrap_or(date);
let category = meta.get(META_KEY_CATEGORY).cloned().unwrap_or_else(|| {
path.parent()
.expect("post file had no parent")
.file_name()
.expect("post parent had no name")
.to_str()
.expect("post parent had non-utf8 name")
.to_owned()
});
let tags = meta
.get(META_KEY_TAGS)
.map(|tags| {
tags.split(META_TAG_SEPARATOR)
.map(|s| s.trim().to_owned())
.collect()
})
.unwrap_or_else(Vec::new);
let template = meta
.get(META_KEY_TEMPLATE)
.map(|s| crate::utils::get_abs_path(root, &path, s));
let uri = crate::utils::path_to_uri(root, &path.with_extension(&config.dist_ext));
let toc = {
let mut toc_depth = None;
Parser::new(&markdown)
.filter_map(|event| {
match event {
Event::Start(Tag::Heading(depth)) => toc_depth = Some(depth as u8),
Event::Text(s) if toc_depth.is_some() => {
return Some((s.to_string(), toc_depth.take().unwrap()));
}
_ => {}
}
None
})
.collect()
};
Ok(Self {
path,
markdown,
meta,
title,
date,
updated,
category,
tags,
template,
uri,
toc,
})
} | function_block-full_function | [
{
"content": "pub fn get_relative_uri(relative_to: &str, uri: &str) -> String {\n\n let relative_to = relative_to.as_bytes();\n\n let uri = uri.as_bytes();\n\n\n\n let mut count_after = relative_to.len();\n\n let mut last_shared_slash = 0;\n\n for i in 0..relative_to.len().max(uri.len()) {\n\n ... |
Rust | src/args/arg_builder/flag.rs | Nemo157/clap-rs | 01994467d5808903907012c26953ebde72594137 |
use std::convert::From;
use std::fmt::{Display, Formatter, Result};
use std::rc::Rc;
use std::result::Result as StdResult;
use vec_map::VecMap;
use Arg;
use args::{AnyArg, DispOrder};
use args::settings::{ArgFlags, ArgSettings};
#[derive(Debug)]
#[doc(hidden)]
pub struct FlagBuilder<'n, 'e> {
pub name: &'n str,
pub long: Option<&'e str>,
pub aliases: Option<Vec<(&'e str, bool)>>,
pub help: Option<&'e str>,
pub blacklist: Option<Vec<&'e str>>,
pub requires: Option<Vec<&'e str>>,
pub short: Option<char>,
pub overrides: Option<Vec<&'e str>>,
pub settings: ArgFlags,
pub disp_ord: usize,
}
impl<'n, 'e> Default for FlagBuilder<'n, 'e> {
fn default() -> Self {
FlagBuilder {
name: "",
long: None,
aliases: None,
help: None,
blacklist: None,
requires: None,
short: None,
overrides: None,
settings: ArgFlags::new(),
disp_ord: 999,
}
}
}
impl<'n, 'e> FlagBuilder<'n, 'e> {
pub fn new(name: &'n str) -> Self {
FlagBuilder { name: name, ..Default::default() }
}
}
impl<'a, 'b, 'z> From<&'z Arg<'a, 'b>> for FlagBuilder<'a, 'b> {
fn from(a: &'z Arg<'a, 'b>) -> Self {
assert!(a.validator.is_none(),
format!("The argument '{}' has a validator set, yet was parsed as a flag. Ensure \
.takes_value(true) or .index(u64) is set.",
a.name));
assert!(a.possible_vals.is_none(),
format!("The argument '{}' cannot have a specific value set because it doesn't \
have takes_value(true) set",
a.name));
assert!(!a.is_set(ArgSettings::Required),
format!("The argument '{}' cannot be required because it's a flag, perhaps you \
forgot takes_value(true)?",
a.name));
FlagBuilder {
name: a.name,
short: a.short,
long: a.long,
aliases: a.aliases.clone(),
help: a.help,
blacklist: a.blacklist.clone(),
overrides: a.overrides.clone(),
requires: a.requires.clone(),
settings: a.settings,
disp_ord: a.disp_ord,
}
}
}
impl<'n, 'e> Display for FlagBuilder<'n, 'e> {
fn fmt(&self, f: &mut Formatter) -> Result {
if let Some(l) = self.long {
try!(write!(f, "--{}", l));
} else {
try!(write!(f, "-{}", self.short.unwrap()));
}
Ok(())
}
}
impl<'n, 'e> Clone for FlagBuilder<'n, 'e> {
fn clone(&self) -> Self {
FlagBuilder {
name: self.name,
short: self.short,
long: self.long,
aliases: self.aliases.clone(),
help: self.help,
blacklist: self.blacklist.clone(),
overrides: self.overrides.clone(),
requires: self.requires.clone(),
settings: self.settings,
disp_ord: self.disp_ord,
}
}
}
impl<'n, 'e> AnyArg<'n, 'e> for FlagBuilder<'n, 'e> {
fn name(&self) -> &'n str {
self.name
}
fn overrides(&self) -> Option<&[&'e str]> {
self.overrides.as_ref().map(|o| &o[..])
}
fn requires(&self) -> Option<&[&'e str]> {
self.requires.as_ref().map(|o| &o[..])
}
fn blacklist(&self) -> Option<&[&'e str]> {
self.blacklist.as_ref().map(|o| &o[..])
}
fn required_unless(&self) -> Option<&[&'e str]> {
None
}
fn is_set(&self, s: ArgSettings) -> bool {
self.settings.is_set(s)
}
fn has_switch(&self) -> bool {
true
}
fn takes_value(&self) -> bool {
false
}
fn set(&mut self, s: ArgSettings) {
self.settings.set(s)
}
fn max_vals(&self) -> Option<u64> {
None
}
fn val_names(&self) -> Option<&VecMap<&'e str>> {
None
}
fn num_vals(&self) -> Option<u64> {
None
}
fn possible_vals(&self) -> Option<&[&'e str]> {
None
}
fn validator(&self) -> Option<&Rc<Fn(String) -> StdResult<(), String>>> {
None
}
fn min_vals(&self) -> Option<u64> {
None
}
fn short(&self) -> Option<char> {
self.short
}
fn long(&self) -> Option<&'e str> {
self.long
}
fn val_delim(&self) -> Option<char> {
None
}
fn help(&self) -> Option<&'e str> {
self.help
}
fn default_val(&self) -> Option<&'n str> {
None
}
fn longest_filter(&self) -> bool {
self.long.is_some()
}
fn aliases(&self) -> Option<Vec<&'e str>> {
if let Some(ref aliases) = self.aliases {
let vis_aliases: Vec<_> =
aliases.iter()
.filter_map(|&(n, v)| if v { Some(n) } else { None })
.collect();
if vis_aliases.is_empty() {
None
} else {
Some(vis_aliases)
}
} else {
None
}
}
}
impl<'n, 'e> DispOrder for FlagBuilder<'n, 'e> {
fn disp_ord(&self) -> usize {
self.disp_ord
}
}
#[cfg(test)]
mod test {
use args::settings::ArgSettings;
use super::FlagBuilder;
#[test]
fn flagbuilder_display() {
let mut f = FlagBuilder::new("flg");
f.settings.set(ArgSettings::Multiple);
f.long = Some("flag");
assert_eq!(&*format!("{}", f), "--flag");
let mut f2 = FlagBuilder::new("flg");
f2.short = Some('f');
assert_eq!(&*format!("{}", f2), "-f");
}
#[test]
fn flagbuilder_display_single_alias() {
let mut f = FlagBuilder::new("flg");
f.long = Some("flag");
f.aliases = Some(vec![("als", true)]);
assert_eq!(&*format!("{}", f), "--flag");
}
#[test]
fn flagbuilder_display_multiple_aliases() {
let mut f = FlagBuilder::new("flg");
f.short = Some('f');
f.aliases = Some(vec![
("alias_not_visible", false),
("f2", true),
("f3", true),
("f4", true)
]);
assert_eq!(&*format!("{}", f), "-f");
}
}
|
use std::convert::From;
use std::fmt::{Display, Formatter, Result};
use std::rc::Rc;
use std::result::Result as StdResult;
use vec_map::VecMap;
use Arg;
use args::{AnyArg, DispOrder};
use args::settings::{ArgFlags, ArgSettings};
#[derive(Debug)]
#[doc(hidden)]
pub struct FlagBuilder<'n, 'e> {
pub name: &'n str,
pub long: Option<&'e str>,
pub aliases: Option<Vec<(&'e str, bool)>>,
pub help: Option<&'e str>,
pub blacklist: Option<Vec<&'e str>>,
pub requires: Option<Vec<&'e str>>,
pub short: Option<char>,
pub overrides: Option<Vec<&'e str>>,
pub settings: ArgFlags,
pub disp_ord: usize,
}
impl<'n, 'e> Default for FlagBuilder<'n, 'e> {
fn default() -> Self {
FlagBuilder {
name: "",
long: None,
aliases: None,
help: None,
blacklist: None,
requires: None,
short: None,
overrides: None,
settings: ArgFlags::new(),
disp_ord: 999,
}
}
}
impl<'n, 'e> FlagBuilder<'n, 'e> {
pub fn new(name: &'n str) -> Self {
FlagBuilder { name: name, ..Default::default() }
}
}
impl<'a, 'b, 'z> From<&'z Arg<'a, 'b>> for FlagBuilder<'a, 'b> {
fn from(a: &'z Arg<'a, 'b>) -> Self {
assert!(a.validator.is_none(),
format!("The argument '{}' has a validator set, yet was parsed as a flag. Ensure \
.takes_value(true) or .index(u64) is set.",
a.name));
assert!(a.possible_vals.is_none(),
format!("The argument '{}' cannot have a specific value set because it doesn't \
have takes_value(true) set",
a.name));
assert!(!a.is_set(ArgSettings::Required),
format!("The argument '{}' cannot be required because it's a flag, perhaps you \
forgot takes_value(true)?",
a.name));
FlagBuilder {
name: a.name,
short: a.short,
long: a.long,
aliases: a.aliases.clone(),
help: a.help,
blacklist: a.blacklist.clone(),
overrides: a.overrides.clone(),
requires: a.requires.clone(),
settings: a.settings,
disp_ord: a.disp_ord,
}
}
}
impl<'n, 'e> Display for FlagBuilder<'n, 'e> {
fn fmt(&self, f: &mut Formatter) -> Result {
if let Some(l) = self.long {
try!(write!(f, "--{}", l));
} else {
try!(write!(f, "-{}", self.short.unwrap()));
}
Ok(())
}
}
impl<'n, 'e> Clone for FlagBuilder<'n, 'e> {
fn clone(&self) -> Self {
FlagBuilder {
name: self.name,
short: self.short,
long: self.long,
aliases: self.aliases.clone(),
help: self.help,
blacklist: self.blacklist.clone(),
overrides: self.overrides.clone(),
requires: self.requires.clone(),
settings: self.settings,
disp_ord: self.disp_ord,
}
}
}
impl<'n, 'e> AnyArg<'n, 'e> for FlagBuilder<'n, 'e> {
fn name(&self) -> &'n str {
self.name
}
fn overrides(&self) -> Option<&[&'e str]> {
self.overrides.as_ref().map(|o| &o[..])
}
fn requires(&self) -> Option<&[&'e str]> {
self.requires.as_ref().map(|o| &o[..])
}
fn blacklist(&self) -> Option<&[&'e str]> {
self.blacklist.as_ref().map(|o| &o[..])
}
fn required_unless(&self) -> Option<&[&'e str]> {
None
}
fn is_set(&self, s: ArgSettings) -> bool {
self.settings.is_set(s)
}
fn has_switch(&self) -> bool {
true
}
fn takes_value(&self) -> bool {
false
}
fn set(&mut self, s: ArgSettings) {
self.settings.set(s)
}
fn max_vals(&self) -> Option<u64> {
None
}
fn val_names(&self) -> Option<&VecMap<&'e str>> {
None
}
fn num_vals(&self) -> Option<u64> {
None
}
fn possible_vals(&self) -> Option<&[&'e str]> {
None
}
fn validator(&self) -> Option<&Rc<Fn(String) -> StdResult<(), String>>> {
None
}
fn min_vals(&self) -> Option<u64> {
None
}
fn short(&self) -> Option<char> {
self.short
}
fn long(&self) -> Option<&'e str> {
self.long
}
fn val_delim(&self) -> Option<char> {
None
}
fn help(&self) -> Option<&'e str> {
self.help
}
fn default_val(&self) -> Option<&'n str> {
None
}
fn longest_filter(&self) -> bool {
self.long.is_some()
}
fn aliases(&self) -> Option<Vec<&'e str>> {
if let Some(ref aliases) = self.aliases {
let vis_aliases: Vec<_> =
aliases.iter()
.filter_map(|&(n, v)| if v { Some(n) } else { None })
.collect();
if vis_aliases.is_empty() {
None
} else {
Some(vis_aliases)
}
} else {
None
}
}
}
impl<'n, 'e> DispOrder for FlagBuilder<'n, 'e> {
fn disp_ord(&self) -> usize {
self.disp_ord
}
}
#[cfg(test)]
mod test {
use args::settings::ArgSettings;
use super::FlagBuilder;
#[test]
fn flagbuilder_display() {
let mut f = FlagBuilder::new("flg");
f.settings.set(ArgSettings::Multiple);
f.long = Some("flag");
assert_eq!(&*format!("{}", f), "--flag");
let mut f2 = FlagBuilder::new("flg");
f2.short = Some('f');
assert_eq!(&*format!("{}", f2), "-f");
}
#[test]
fn flagbuilder_display_single_alias() {
let mut f = FlagBuilder::new("flg");
f.long = Some("flag");
f.aliases = Some(vec![("als", true)]);
assert_eq!(&*format!("{}", f), "--flag");
}
#[test]
fn flagbuilder_display_multiple_aliases() {
let mut f = FlagBuilder::new("flg");
f.short = Some('f');
f.aliases = | ;
assert_eq!(&*format!("{}", f), "-f");
}
}
| Some(vec![
("alias_not_visible", false),
("f2", true),
("f3", true),
("f4", true)
]) | call_expression | [
{
"content": "fn compare_app_str(l: &App, right: &str) -> bool {\n\n let left = build_new_help(&l);\n\n // Strip out any mismatching \\r character on windows that might sneak in on either side\n\n let b = left.trim().replace(\"\\r\", \"\") == right.replace(\"\\r\", \"\");\n\n if !b {\n\n prin... |
Rust | src/rest_api/routes/consortium.rs | arsulegai/splinter-admin-ops-daemon | 8511d0ce2505eb9bfe4bfa973a31bbf87b1f4bf4 |
use std::collections::HashMap;
use actix_web::{client::Client, error, http::StatusCode, web, Error, HttpResponse};
use futures::{Future, IntoFuture};
use openssl::hash::{hash, MessageDigest};
use protobuf::Message;
use splinter::admin::messages::{
AuthorizationType, CreateCircuit, DurabilityType, PersistenceType, RouteType, SplinterNode,
SplinterService,
};
use splinter::node_registry::Node;
use splinter::protos::admin::{
CircuitManagementPayload, CircuitManagementPayload_Action as Action,
CircuitManagementPayload_Header as Header,
};
use uuid::Uuid;
use crate::application_metadata::ApplicationMetadata;
use crate::rest_api::{ConsortiumData, RestApiResponseError};
use super::{
get_response_paging_info, validate_limit, ErrorResponse, SuccessResponse, DEFAULT_LIMIT,
DEFAULT_OFFSET,
};
use db_models::models::Consortium;
#[derive(Debug, Serialize, Deserialize)]
pub struct CreateConsortiumForm {
alias: String,
members: Vec<String>,
}
pub fn propose_consortium(
create_consortium: web::Json<CreateConsortiumForm>,
node_info: web::Data<Node>,
client: web::Data<Client>,
splinterd_url: web::Data<String>,
consortium_data: web::Data<ConsortiumData>,
) -> impl Future<Item = HttpResponse, Error = Error> {
fetch_node_information(&create_consortium.members, &splinterd_url, client).then(move |resp| {
let nodes = match resp {
Ok(nodes) => nodes,
Err(err) => match err {
RestApiResponseError::BadRequest(message) => {
return HttpResponse::BadRequest()
.json(ErrorResponse::bad_request(&message.to_string()))
.into_future();
}
_ => {
debug!("Failed to fetch node information: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
},
};
let mut members = nodes
.iter()
.map(|node| SplinterNode {
node_id: node.identity.to_string(),
endpoint: node
.metadata
.get("endpoint")
.unwrap_or(&"".to_string())
.to_string(),
})
.collect::<Vec<SplinterNode>>();
members.push(SplinterNode {
node_id: node_info.identity.to_string(),
endpoint: node_info
.metadata
.get("endpoint")
.unwrap_or(&"".to_string())
.to_string(),
});
let partial_circuit_id = members.iter().fold(String::new(), |mut acc, member| {
acc.push_str(&format!("::{}", member.node_id));
acc
});
let scabbard_admin_keys = vec![consortium_data.get_ref().public_key.clone()];
let mut scabbard_args = vec![];
scabbard_args.push((
"admin_keys".into(),
match serde_json::to_string(&scabbard_admin_keys) {
Ok(s) => s,
Err(err) => {
debug!("Failed to serialize scabbard admin keys: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
},
));
let mut roster = vec![];
for node in members.iter() {
let peer_services = match serde_json::to_string(
&members
.iter()
.filter_map(|other_node| {
if other_node.node_id != node.node_id {
Some(format!("consortium_{}", other_node.node_id))
} else {
None
}
})
.collect::<Vec<_>>(),
) {
Ok(s) => s,
Err(err) => {
debug!("Failed to serialize peer services: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
};
let mut service_args = scabbard_args.clone();
service_args.push(("peer_services".into(), peer_services));
roster.push(SplinterService {
service_id: format!("consortium_{}", node.node_id),
service_type: "scabbard".to_string(),
allowed_nodes: vec![node.node_id.to_string()],
arguments: service_args,
});
}
let application_metadata = match ApplicationMetadata::new(&create_consortium.alias, &scabbard_admin_keys)
.to_bytes()
{
Ok(bytes) => bytes,
Err(err) => {
debug!("Failed to serialize application metadata: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
};
let create_request = CreateCircuit {
circuit_id: format!(
"consortium{}::{}",
partial_circuit_id,
Uuid::new_v4().to_string()
),
roster,
members,
authorization_type: AuthorizationType::Trust,
persistence: PersistenceType::Any,
durability: DurabilityType::NoDurability,
routes: RouteType::Any,
circuit_management_type: "consortium".to_string(),
application_metadata,
};
let payload_bytes = match make_payload(create_request, node_info.identity.to_string()) {
Ok(bytes) => bytes,
Err(err) => {
debug!("Failed to make circuit management payload: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
};
HttpResponse::Ok()
.json(SuccessResponse::new(json!({
"payload_bytes": payload_bytes
})))
.into_future()
})
}
fn fetch_node_information(
node_ids: &[String],
splinterd_url: &str,
client: web::Data<Client>,
) -> Box<dyn Future<Item = Vec<Node>, Error = RestApiResponseError>> {
let node_ids = node_ids.to_owned();
Box::new(
client
.get(&format!("{}/nodes?limit={}", splinterd_url, std::i64::MAX))
.send()
.map_err(|err| {
RestApiResponseError::InternalError(format!("Failed to send request {}", err))
})
.and_then(move |mut resp| {
let body = resp.body().wait().map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to receive response body {}",
err
))
})?;
match resp.status() {
StatusCode::OK => {
let list_reponse: SuccessResponse<Vec<Node>> =
serde_json::from_slice(&body).map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to parse response body {}",
err
))
})?;
let nodes = node_ids.into_iter().try_fold(vec![], |mut acc, node_id| {
if let Some(node) = list_reponse
.data
.iter()
.find(|node| node.identity == node_id)
{
acc.push(node.clone());
Ok(acc)
} else {
Err(RestApiResponseError::BadRequest(format!(
"Could not find node with id {}",
node_id
)))
}
})?;
Ok(nodes)
}
StatusCode::BAD_REQUEST => {
let message: String = serde_json::from_slice(&body).map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to parse response body {}",
err
))
})?;
Err(RestApiResponseError::BadRequest(message))
}
_ => {
let message: String = serde_json::from_slice(&body).map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to parse response body {}",
err
))
})?;
Err(RestApiResponseError::InternalError(message))
}
}
}),
)
}
fn make_payload(
create_request: CreateCircuit,
local_node: String,
) -> Result<Vec<u8>, RestApiResponseError> {
let circuit_proto = create_request.into_proto()?;
let circuit_bytes = circuit_proto.write_to_bytes()?;
let hashed_bytes = hash(MessageDigest::sha512(), &circuit_bytes)?;
let mut header = Header::new();
header.set_action(Action::CIRCUIT_CREATE_REQUEST);
header.set_payload_sha512(hashed_bytes.to_vec());
header.set_requester_node_id(local_node);
let header_bytes = header.write_to_bytes()?;
let mut circuit_management_payload = CircuitManagementPayload::new();
circuit_management_payload.set_header(header_bytes);
circuit_management_payload.set_circuit_create_request(circuit_proto);
let payload_bytes = circuit_management_payload.write_to_bytes()?;
Ok(payload_bytes)
}
|
use std::collections::HashMap;
use actix_web::{client::Client, error, http::StatusCode, web, Error, HttpResponse};
use futures::{Future, IntoFuture};
use openssl::hash::{hash, MessageDigest};
use protobuf::Message;
use splinter::admin::messages::{
AuthorizationType, CreateCircuit, DurabilityType, PersistenceType, RouteType, SplinterNode,
SplinterService,
};
use splinter::node_registry::Node;
use splinter::protos::admin::{
CircuitManagementPayload, CircuitManagementPayload_Action as Action,
CircuitManagementPayload_Header as Header,
};
use uuid::Uuid;
use crate::application_metadata::ApplicationMetadata;
use crate::rest_api::{ConsortiumData, RestApiResponseError};
use super::{
get_response_paging_info, validate_limit, ErrorResponse, SuccessResponse, DEFAULT_LIMIT,
DEFAULT_OFFSET,
};
use db_models::models::Consortium;
#[derive(Debug, Serialize, Deserialize)]
pub struct CreateConsortiumForm {
alias: String,
members: Vec<String>,
}
pub fn propose_consortium(
create_consortium: web::Json<CreateConsortiumForm>,
node_info: web::Data<Node>,
client: web::Data<Client>,
splinterd_url: web::Data<String>,
consortium_data: web::Data<ConsortiumData>,
) -> impl Future<Item = HttpResponse, Error = Error> {
fetch_node_information(&create_consortium.members, &splinterd_url, client).then(move |resp| {
let nodes = match resp {
Ok(nodes) => nodes,
Err(err) => match err {
RestApiResponseError::BadRequest(message) => {
return HttpResponse::BadRequest()
.json(ErrorResponse::bad_request(&message.to_string()))
.into_future();
}
_ => {
debug!("Failed to fetch node information: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
},
};
let mut members = nodes
.iter()
.map(|node| SplinterNode {
node_id: node.identity.to_string(),
endpoint: node
.metadata
.get("endpoint")
.unwrap_or(&"".to_string())
.to_string(),
})
.collect::<Vec<SplinterNode>>();
members.push(SplinterNode {
node_id: node_info.identity.to_string(),
endpoint: node_info
.metadata
.get("endpoint")
.unwrap_or(&"".to_string())
.to_string(),
});
let partial_circuit_id = members.iter().fold(String::new(), |mut acc, member| {
acc.push_str(&format!("::{}", member.node_id));
acc
});
let scabbard_admin_keys = vec![consortium_data.get_ref().public_key.clone()];
let mut scabbard_args = vec![];
scabbard_args.push((
"admin_keys".into(),
match serde_json::to_string(&scabbard_admin_keys) {
Ok(s) => s,
Err(err) => {
debug!("Failed to serialize scabbard admin keys: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
},
));
let mut roster = vec![];
for node in members.iter() {
let peer_services = match serde_json::to_string(
&members
.iter()
.filter_map(|other_node| {
if other_node.node_id != node.node_id {
Some(format!("consortium_{}", other_node.node_id))
} else {
None
}
})
.collect::<Vec<_>>(),
) {
Ok(s) => s,
Err(err) => {
debug!("Failed to serialize peer services: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
};
let mut service_args = scabbard_args.clone();
service_args.push(("peer_services".into(), peer_services));
roster.push(SplinterService {
service_id: format!("consortium_{}", node.node_id),
service_type: "scabbard".to_string(),
allowed_nodes: vec![node.node_id.to_string()],
arguments: service_args,
});
}
let application_metadata = match ApplicationMetadata::new(&create_consortium.alias, &scabbard_admin_keys)
.to_bytes()
{
Ok(bytes) => bytes,
Err(err) => {
debug!("Failed to serialize application metadata: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
};
let create_request = CreateCircuit {
circuit_id: format!(
"consortium{}::{}",
partial_circuit_ |
fn fetch_node_information(
node_ids: &[String],
splinterd_url: &str,
client: web::Data<Client>,
) -> Box<dyn Future<Item = Vec<Node>, Error = RestApiResponseError>> {
let node_ids = node_ids.to_owned();
Box::new(
client
.get(&format!("{}/nodes?limit={}", splinterd_url, std::i64::MAX))
.send()
.map_err(|err| {
RestApiResponseError::InternalError(format!("Failed to send request {}", err))
})
.and_then(move |mut resp| {
let body = resp.body().wait().map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to receive response body {}",
err
))
})?;
match resp.status() {
StatusCode::OK => {
let list_reponse: SuccessResponse<Vec<Node>> =
serde_json::from_slice(&body).map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to parse response body {}",
err
))
})?;
let nodes = node_ids.into_iter().try_fold(vec![], |mut acc, node_id| {
if let Some(node) = list_reponse
.data
.iter()
.find(|node| node.identity == node_id)
{
acc.push(node.clone());
Ok(acc)
} else {
Err(RestApiResponseError::BadRequest(format!(
"Could not find node with id {}",
node_id
)))
}
})?;
Ok(nodes)
}
StatusCode::BAD_REQUEST => {
let message: String = serde_json::from_slice(&body).map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to parse response body {}",
err
))
})?;
Err(RestApiResponseError::BadRequest(message))
}
_ => {
let message: String = serde_json::from_slice(&body).map_err(|err| {
RestApiResponseError::InternalError(format!(
"Failed to parse response body {}",
err
))
})?;
Err(RestApiResponseError::InternalError(message))
}
}
}),
)
}
fn make_payload(
create_request: CreateCircuit,
local_node: String,
) -> Result<Vec<u8>, RestApiResponseError> {
let circuit_proto = create_request.into_proto()?;
let circuit_bytes = circuit_proto.write_to_bytes()?;
let hashed_bytes = hash(MessageDigest::sha512(), &circuit_bytes)?;
let mut header = Header::new();
header.set_action(Action::CIRCUIT_CREATE_REQUEST);
header.set_payload_sha512(hashed_bytes.to_vec());
header.set_requester_node_id(local_node);
let header_bytes = header.write_to_bytes()?;
let mut circuit_management_payload = CircuitManagementPayload::new();
circuit_management_payload.set_header(header_bytes);
circuit_management_payload.set_circuit_create_request(circuit_proto);
let payload_bytes = circuit_management_payload.write_to_bytes()?;
Ok(payload_bytes)
}
| id,
Uuid::new_v4().to_string()
),
roster,
members,
authorization_type: AuthorizationType::Trust,
persistence: PersistenceType::Any,
durability: DurabilityType::NoDurability,
routes: RouteType::Any,
circuit_management_type: "consortium".to_string(),
application_metadata,
};
let payload_bytes = match make_payload(create_request, node_info.identity.to_string()) {
Ok(bytes) => bytes,
Err(err) => {
debug!("Failed to make circuit management payload: {}", err);
return HttpResponse::InternalServerError()
.json(ErrorResponse::internal_error())
.into_future();
}
};
HttpResponse::Ok()
.json(SuccessResponse::new(json!({
"payload_bytes": payload_bytes
})))
.into_future()
})
} | function_block-function_prefixed | [
{
"content": "pub fn fetch_node(\n\n identity: web::Path<String>,\n\n client: web::Data<Client>,\n\n splinterd_url: web::Data<String>,\n\n) -> impl Future<Item = HttpResponse, Error = Error> {\n\n client\n\n .get(&format!(\"{}/nodes/{}\", splinterd_url.get_ref(), identity))\n\n .send()... |
Rust | src/lib.rs | pudnax/chonker | dff08090f23322631ea60fe13d5dd3789f926577 | #![feature(get_mut_unchecked)]
use std::{
path::{Path, PathBuf},
time::Instant,
};
pub mod camera;
pub mod context;
mod utils;
mod watcher;
pub use camera::{Camera, CameraBinding};
pub use context::{
Context, GlobalUniformBinding, HdrBackBuffer, PipelineHandle, Uniform, VolumeTexture,
};
pub use utils::{dispatch_optimal, shader_compiler, NonZeroSized};
pub use watcher::{ReloadablePipeline, Watcher};
use color_eyre::eyre::Result;
use pollster::FutureExt;
use utils::{frame_counter::FrameCounter, input::Input, recorder::RecordEvent};
use winit::{
dpi::{PhysicalPosition, PhysicalSize},
event::{
DeviceEvent, ElementState, Event, KeyboardInput, MouseScrollDelta, VirtualKeyCode,
WindowEvent,
},
event_loop::{ControlFlow, EventLoop},
window::Window,
};
const SHADER_FOLDER: &str = "shaders";
const SCREENSHOTS_FOLDER: &str = "screenshots";
const VIDEO_FOLDER: &str = "recordings";
pub trait Demo: 'static + Sized {
fn init(ctx: &mut Context) -> Self;
fn resize(&mut self, _: &wgpu::Device, _: &wgpu::Queue, _: &wgpu::SurfaceConfiguration) {}
fn update(&mut self, _: &mut Context) {}
fn update_input(&mut self, _: WindowEvent) {}
fn render(&mut self, _: &Context) {}
}
pub fn run<D: Demo>(
event_loop: EventLoop<(PathBuf, wgpu::ShaderModule)>,
window: Window,
camera: Option<Camera>,
) -> Result<()> {
color_eyre::install()?;
env_logger::init();
let mut context = Context::new(&window, &event_loop, camera).block_on()?;
let mut recording_status = false;
let recorder = utils::recorder::Recorder::new();
print_help(context.get_info(), &recorder.ffmpeg_version);
let mut frame_counter = FrameCounter::new();
let mut input = Input::new();
let mut mouse_dragged = false;
let rotate_speed = 0.0025;
let zoom_speed = 0.002;
let mut demo = D::init(&mut context);
let mut main_window_focused = false;
event_loop.run(move |event, _, control_flow| {
*control_flow = ControlFlow::Wait;
match event {
Event::MainEventsCleared => {
context.update(&frame_counter, &input);
demo.update(&mut context);
window.request_redraw();
}
Event::WindowEvent {
event, window_id, ..
} if window.id() == window_id => {
input.update(&event, &window);
match event {
WindowEvent::Focused(focused) => main_window_focused = focused,
WindowEvent::CloseRequested
| WindowEvent::KeyboardInput {
input:
KeyboardInput {
virtual_keycode: Some(VirtualKeyCode::Escape),
state: ElementState::Pressed,
..
},
..
} => *control_flow = ControlFlow::Exit,
WindowEvent::Resized(PhysicalSize { width, height })
| WindowEvent::ScaleFactorChanged {
new_inner_size: &mut PhysicalSize { width, height },
..
} => {
if width != 0 && height != 0 {
context.resize(width, height);
demo.resize(&context.device, &context.queue, &context.surface_config);
}
if recording_status {
println!("Stop recording. Resolution has been changed.",);
recording_status = false;
recorder.send(RecordEvent::Finish);
}
}
WindowEvent::KeyboardInput {
input:
KeyboardInput {
state: ElementState::Pressed,
virtual_keycode: Some(keycode),
..
},
..
} => {
if VirtualKeyCode::F11 == keycode {
let now = Instant::now();
let frame = context.capture_frame();
eprintln!("Capture image: {:#.2?}", now.elapsed());
recorder.send(RecordEvent::Screenshot(frame));
}
if recorder.ffmpeg_installed() && VirtualKeyCode::F12 == keycode {
if !recording_status {
recorder
.send(RecordEvent::Start(context.capture_image_dimentions()));
} else {
recorder.send(RecordEvent::Finish);
}
recording_status = !recording_status;
}
}
_ => {}
}
demo.update_input(event);
}
Event::DeviceEvent { ref event, .. } if main_window_focused => match event {
DeviceEvent::Button {
#[cfg(target_os = "macos")]
button: 0,
#[cfg(not(target_os = "macos"))]
button: 1,
state: statee,
} => {
let is_pressed = *statee == ElementState::Pressed;
mouse_dragged = is_pressed;
}
DeviceEvent::MouseWheel { delta, .. } => {
let scroll_amount = -match delta {
MouseScrollDelta::LineDelta(_, scroll) => scroll * 1.0,
MouseScrollDelta::PixelDelta(PhysicalPosition { y: scroll, .. }) => {
*scroll as f32
}
};
context.camera.add_zoom(scroll_amount * zoom_speed);
}
DeviceEvent::MouseMotion { delta } => {
if mouse_dragged {
context.camera.add_yaw(-delta.0 as f32 * rotate_speed);
context.camera.add_pitch(delta.1 as f32 * rotate_speed);
}
}
_ => (),
},
Event::RedrawRequested(_) => {
frame_counter.record();
demo.render(&context);
match context.render() {
Ok(_) => {}
Err(wgpu::SurfaceError::Lost) => {
context.resize(context.width, context.height);
window.request_redraw();
}
Err(wgpu::SurfaceError::OutOfMemory) => *control_flow = ControlFlow::Exit,
Err(e) => {
eprintln!("{:?}", e);
window.request_redraw();
}
}
if recording_status {
let (frame, _) = context.capture_frame();
recorder.send(RecordEvent::Record(frame));
}
}
Event::UserEvent((path, shader)) => context.register_shader_change(path, shader),
Event::LoopDestroyed => {
println!("\n// End from the loop. Bye bye~⏎ ");
}
_ => {}
}
})
}
pub fn print_help(info: impl std::fmt::Display, ffmpeg_version: &str) {
println!("{}", info);
println!("{}", ffmpeg_version);
println!(
"Default shader path:\n\t{}\n",
Path::new(SHADER_FOLDER).canonicalize().unwrap().display()
);
println!("- `F11`: Take Screenshot");
println!("- `F12`: Start/Stop record video");
println!("- `ESC`: Exit the application");
println!();
println!("// Set up our new world⏎ ");
println!("// And let's begin the⏎ ");
println!("\tSIMULATION⏎ \n");
}
| #![feature(get_mut_unchecked)]
use std::{
path::{Path, PathBuf},
time::Instant,
};
pub mod camera;
pub mod context;
mod utils;
mod watcher;
pub use camera::{Camera, CameraBinding};
pub use context::{
Context, GlobalUniformBinding, HdrBackBuffer, PipelineHandle, Uniform, VolumeTexture,
};
pub use utils::{dispatch_optimal, shader_compiler, NonZeroSized};
pub use watcher::{ReloadablePipeline, Watcher};
use color_eyre::eyre::Result;
use pollster::FutureExt;
use utils::{frame_counter::FrameCounter, input::Input, recorder::RecordEvent};
use winit::{
dpi::{PhysicalPosition, PhysicalSize},
event::{
DeviceEvent, ElementState, Event, KeyboardInput, MouseScrollDelta, VirtualKeyCode,
WindowEvent,
},
event_loop::{ControlFlow, EventLoop},
window::Window,
};
const SHADER_FOLDER: &str = "shaders";
const SCREENSHOTS_FOLDER: &str = "screenshots";
const VIDEO_FOLDER: &str = "recordings";
pub trait Demo: 'static + Sized {
fn init(ctx: &mut Context) -> Self;
fn resize(&mut self, _: &wgpu::Device, _: &wgpu::Queue, _: &wgpu::SurfaceConfiguration) {}
fn update(&mut self, _: &mut Context) {}
fn update_input(&mut self, _: WindowEvent) {}
fn render(&mut self, _: &Context) {}
}
pub fn run<D: Demo>(
event_loop: EventLoop<(PathBuf, wgpu::ShaderModule)>,
window: Window,
camera: Option<Camera>,
) -> Result<()> {
color_eyre::install()?;
env_logger::init();
let mut context = Context::new(&window, &event_loop, camera).block_on()?;
let mut recording_status = false;
let recorder = utils::recorder::Recorder::new();
print_help(context.get_info(), &recorder.ffmpeg_version);
let mut frame_counter = FrameCounter::new();
let mut input = Input::new();
let mut mouse_dragged = false;
let rotate_speed = 0.0025;
let zoom_speed = 0.002;
let mut demo = D::init(&mut context);
let mut main_window_focused = false;
event_loop.run(move |event, _, control_flow| {
*control_flow = ControlFlow::Wait;
match event {
Event::MainEventsCleared => {
context.update(&frame_counter, &input);
demo.update(&mut context);
window.request_redraw();
}
Event::WindowEvent {
event, window_id, ..
} if window.id() == window_id => {
input.update(&event, &window);
match event {
WindowEvent::Focused(focused) => main_window_focused = focused,
WindowEvent::CloseRequested
| WindowEvent::KeyboardInput {
input:
KeyboardInput {
virtual_keycode: Some(VirtualKeyCode::Escape),
state: ElementState::Pressed,
..
},
..
} => *control_flow = ControlFlow::Exit,
WindowEvent::Resized(PhysicalSize { width, height })
| WindowEvent::ScaleFactorChanged {
new_inner_size: &mut PhysicalSize { width, height },
..
} => {
if width != 0 && height != 0 {
context.resize(width, height);
demo.resize(&context.device, &context.queue, &context.surface_config);
}
if recording_status {
println!("Stop recording. Resolution has been changed.",);
recording_status = false;
recorder.send(RecordEvent::Finish);
}
}
WindowEvent::KeyboardInput {
input:
KeyboardInput {
state: ElementState::Pressed,
virtual_keycode: Some(keycode),
..
},
..
} => {
if VirtualKeyCode::F11 == keycode {
let now = Instant::now();
let frame = context.capture_frame();
eprintln!("Capture image: {:#.2?}", now.elapsed());
recorder.send(RecordEvent::Screenshot(frame));
}
if recorder.ffmpeg_installed() && VirtualKeyCode::F12 == keycode {
if !recording_status {
recorder
.send(RecordEvent::Start(context.capture_image_dimentions()));
} else {
recorder.send(RecordEvent::Finish);
}
recording_status = !recording_status;
}
}
_ => {}
}
demo.update_input(event);
}
Event::DeviceEvent { ref event, .. } if main_window_focused => match event {
DeviceEvent::Button {
#[cfg(target_os = "macos")]
button: 0,
#[cfg(not(target_os = "macos"))]
button: 1,
state: statee,
} => {
let is_pressed = *statee == ElementState::Pressed;
mouse_dragged = is_pressed;
}
DeviceEvent::MouseWheel { delta, .. } => {
let scroll_amount = -match delta {
MouseScrollDelta::LineDelta(_, scroll) => scroll * 1.0,
MouseScrollDelta::PixelDelta(PhysicalPosition { y: scroll, .. }) => {
*scroll as f32
}
};
context.camera.add_zoom(scroll_amount * zoom_speed);
}
DeviceEvent::MouseMotion { delta } => {
if mouse_dragged {
context.camera.add_yaw(-delta.0 as f32 * rotate_speed);
context.camera.add_pitch(delta.1 as f32 * rotate_speed);
}
}
_ => (),
},
Event::RedrawRequested(_) => {
frame_counter.record();
demo.render(&context);
match context.render() {
Ok(_) => {}
Err(wgpu::SurfaceError::Lost) => {
context.resize(context.width, context.height);
window.request_redraw();
}
Err(wgpu::SurfaceError::OutOfMemory) => *control_flow = ControlFlow::Exit,
Err(e) => {
eprintln!("{:?}", e);
window.request_redraw();
}
}
if recording_status {
let (frame, _) = context.capture_frame();
recorder.send(RecordEvent::Record(frame));
}
}
Event::UserEvent((path, shader)) => context.register_shader_change(path, shader),
Event::LoopDestroyed => {
println!("\n// End from the loop. Bye bye~⏎ ");
}
_ => {}
}
})
}
| pub fn print_help(info: impl std::fmt::Display, ffmpeg_version: &str) {
println!("{}", info);
println!("{}", ffmpeg_version);
println!(
"Default shader path:\n\t{}\n",
Path::new(SHADER_FOLDER).canonicalize().unwrap().display()
);
println!("- `F11`: Take Screenshot");
println!("- `F12`: Start/Stop record video");
println!("- `ESC`: Exit the application");
println!();
println!("// Set up our new world⏎ ");
println!("// And let's begin the⏎ ");
println!("\tSIMULATION⏎ \n");
} | function_block-full_function | [
{
"content": "pub fn save_screenshot(frame: Vec<u8>, image_dimentions: ImageDimentions) -> Result<()> {\n\n let now = Instant::now();\n\n let screenshots_folder = Path::new(SCREENSHOTS_FOLDER);\n\n create_folder(screenshots_folder)?;\n\n let path = screenshots_folder.join(format!(\n\n \"scree... | |
Rust | benches/crit_bench.rs | arthurprs/lz4_flex | 4953936f618dc7b644b2f30a612149d466005718 | extern crate criterion;
use self::criterion::*;
use lz4::block::compress as lz4_linked_block_compress;
use lz_fear::raw::compress2;
use lz_fear::raw::decompress_raw;
use lz_fear::raw::U16Table;
use lz_fear::raw::U32Table;
const COMPRESSION1K: &'static [u8] = include_bytes!("compression_1k.txt");
const COMPRESSION34K: &'static [u8] = include_bytes!("compression_34k.txt");
const COMPRESSION65K: &'static [u8] = include_bytes!("compression_65k.txt");
const COMPRESSION66K: &'static [u8] = include_bytes!("compression_66k_JSON.txt");
const COMPRESSION95K_VERY_GOOD_LOGO: &'static [u8] = include_bytes!("../logo.jpg");
const ALL: &[&[u8]] = &[
COMPRESSION1K as &[u8],
COMPRESSION34K as &[u8],
];
fn compress_lz4_fear(input: &[u8]) -> Vec<u8> {
let mut buf = Vec::new();
if input.len() <= 0xFFFF {
compress2(input, 0, &mut U16Table::default(), &mut buf).unwrap();
} else {
compress2(input, 0, &mut U32Table::default(), &mut buf).unwrap();
}
buf
}
fn bench_compression_throughput(c: &mut Criterion) {
let plot_config = PlotConfiguration::default().summary_scale(AxisScale::Linear);
let mut group = c.benchmark_group("Compress");
group.plot_config(plot_config);
for input in ALL.iter() {
let input_bytes = input.len() as u64;
group.throughput(Throughput::Bytes(input_bytes));
group.bench_with_input(
BenchmarkId::new("lz4_flexx_rust", input_bytes),
&input,
|b, i| b.iter(|| lz4_flex::compress(&i)),
);
}
group.finish();
}
pub fn decompress_fear(input: &[u8]) -> Vec<u8> {
let mut vec = Vec::new();
decompress_raw(input, &[], &mut vec, std::usize::MAX).unwrap();
vec
}
fn bench_decompression_throughput(c: &mut Criterion) {
let plot_config = PlotConfiguration::default().summary_scale(AxisScale::Linear);
let mut group = c.benchmark_group("Decompress");
group.plot_config(plot_config);
for input in ALL.iter() {
let input_bytes = input.len() as u64;
group.throughput(Throughput::Bytes(input_bytes));
let comp_lz4 = lz4::block::compress(&input, None, false).unwrap();
group.bench_with_input(
BenchmarkId::new("lz4_flexx_rust", input_bytes),
&comp_lz4,
|b, i| b.iter(|| lz4_flex::decompress(&i, input.len())),
);
}
group.finish();
}
criterion_group!(
benches,
bench_decompression_throughput,
bench_compression_throughput
);
criterion_main!(benches);
| extern crate criterion;
use self::criterion::*;
use lz4::block::compress as lz4_linked_block_compress;
use lz_fear::raw::compress2;
use lz_fear::raw::decompress_raw;
use lz_fear::raw::U16Table;
use lz_f | g = PlotConfiguration::default().summary_scale(AxisScale::Linear);
let mut group = c.benchmark_group("Decompress");
group.plot_config(plot_config);
for input in ALL.iter() {
let input_bytes = input.len() as u64;
group.throughput(Throughput::Bytes(input_bytes));
let comp_lz4 = lz4::block::compress(&input, None, false).unwrap();
group.bench_with_input(
BenchmarkId::new("lz4_flexx_rust", input_bytes),
&comp_lz4,
|b, i| b.iter(|| lz4_flex::decompress(&i, input.len())),
);
}
group.finish();
}
criterion_group!(
benches,
bench_decompression_throughput,
bench_compression_throughput
);
criterion_main!(benches);
| ear::raw::U32Table;
const COMPRESSION1K: &'static [u8] = include_bytes!("compression_1k.txt");
const COMPRESSION34K: &'static [u8] = include_bytes!("compression_34k.txt");
const COMPRESSION65K: &'static [u8] = include_bytes!("compression_65k.txt");
const COMPRESSION66K: &'static [u8] = include_bytes!("compression_66k_JSON.txt");
const COMPRESSION95K_VERY_GOOD_LOGO: &'static [u8] = include_bytes!("../logo.jpg");
const ALL: &[&[u8]] = &[
COMPRESSION1K as &[u8],
COMPRESSION34K as &[u8],
];
fn compress_lz4_fear(input: &[u8]) -> Vec<u8> {
let mut buf = Vec::new();
if input.len() <= 0xFFFF {
compress2(input, 0, &mut U16Table::default(), &mut buf).unwrap();
} else {
compress2(input, 0, &mut U32Table::default(), &mut buf).unwrap();
}
buf
}
fn bench_compression_throughput(c: &mut Criterion) {
let plot_config = PlotConfiguration::default().summary_scale(AxisScale::Linear);
let mut group = c.benchmark_group("Compress");
group.plot_config(plot_config);
for input in ALL.iter() {
let input_bytes = input.len() as u64;
group.throughput(Throughput::Bytes(input_bytes));
group.bench_with_input(
BenchmarkId::new("lz4_flexx_rust", input_bytes),
&input,
|b, i| b.iter(|| lz4_flex::compress(&i)),
);
}
group.finish();
}
pub fn decompress_fear(input: &[u8]) -> Vec<u8> {
let mut vec = Vec::new();
decompress_raw(input, &[], &mut vec, std::usize::MAX).unwrap();
vec
}
fn bench_decompression_throughput(c: &mut Criterion) {
let plot_confi | random | [
{
"content": "use lz4_flex::block::DecompressError;\n\nuse tokio::fs::File;\n\nuse tokio::prelude::*; // for write_all()\n\nuse argh::FromArgs;\n\n\n\n#[macro_use]\n\nextern crate quick_error;\n\n\n\n#[derive(FromArgs, Debug)]\n\n/// Reach new heights.\n",
"file_path": "lz4_bin/src/main.rs",
"rank": 2,
... |
Rust | src/record.rs | phip1611/beat-detector | ad00de5348bb0325298abd5a1e31d59d5f34845e | /*
MIT License
Copyright (c) 2021 Philipp Schuster
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, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
use crate::{BeatInfo, StrategyKind};
use cpal::traits::{DeviceTrait, HostTrait, StreamTrait};
use cpal::{BufferSize, Device, Host, InputCallbackInfo, SampleFormat, StreamConfig, StreamError};
use std::collections::{BTreeMap, HashMap};
use std::sync::atomic::{AtomicBool, Ordering};
use std::sync::Arc;
use std::thread::{spawn, JoinHandle};
use std::time::Instant;
pub fn start_listening(
on_beat_cb: impl Fn(BeatInfo) + Send + 'static,
input_dev: Option<Device>,
strategy: StrategyKind,
keep_recording: Arc<AtomicBool>,
) -> Result<JoinHandle<()>, String> {
if !keep_recording.load(Ordering::SeqCst) {
return Err("Variable keep_recording is false from the beginning!?".to_string());
}
let in_dev = input_dev.map(Ok).unwrap_or_else(|| {
let host = cpal::default_host();
host.default_input_device()
.ok_or_else(|| "Must have input device!".to_string())
})?;
let in_dev_cfg = in_dev.default_input_config().unwrap();
let sampling_rate = in_dev_cfg.sample_rate();
let sample_format = in_dev_cfg.sample_format();
eprintln!("Using input device: {:?}", in_dev.name().unwrap());
eprintln!(" sampling_rate: {}", sampling_rate.0);
eprintln!(" sample_format: {:?}", sample_format);
let err_cb = |err: StreamError| {
eprintln!("Record error occurred: {:#?}", err);
};
#[cfg(not(target_os = "linux"))]
let preferred_window_length = 1024;
let in_stream_cfg = StreamConfig {
channels: 1,
sample_rate: sampling_rate,
#[cfg(not(target_os = "linux"))]
buffer_size: BufferSize::Fixed(preferred_window_length),
#[cfg(target_os = "linux")]
buffer_size: BufferSize::Default,
};
let detector = strategy.detector(sampling_rate.0);
let handle = spawn(move || {
let stream = match sample_format {
SampleFormat::F32 => in_dev.build_input_stream(
&in_stream_cfg,
move |data: &[f32], _info: &InputCallbackInfo| {
let now = Instant::now();
if let Some(info) = detector.is_beat(&f32_data_to_i16(data)) {
on_beat_cb(info);
}
let millis = now.elapsed().as_millis();
if millis > 20 {
eprintln!("calculation took {}ms", millis);
}
},
err_cb,
),
SampleFormat::I16 => in_dev.build_input_stream(
&in_stream_cfg,
move |data: &[i16], _info: &InputCallbackInfo| {
let now = Instant::now();
if let Some(info) = detector.is_beat(data) {
on_beat_cb(info);
}
let millis = now.elapsed().as_millis();
if millis > 20 {
eprintln!("calculation took {}ms", millis);
}
},
err_cb,
),
SampleFormat::U16 => in_dev.build_input_stream(
&in_stream_cfg,
move |data: &[u16], _info: &InputCallbackInfo| {
let now = Instant::now();
if let Some(info) = detector.is_beat(&u16_data_to_i16(data)) {
on_beat_cb(info);
}
let millis = now.elapsed().as_millis();
if millis > 20 {
eprintln!("calculation took {}ms", millis);
}
},
err_cb,
),
}
.map_err(|err| format!("Can't open stream: {:?}", err))
.unwrap();
stream.play().unwrap();
loop {
if !keep_recording.load(Ordering::SeqCst) {
break;
}
}
});
Ok(handle)
}
#[inline(always)]
fn u16_data_to_i16(data: &[u16]) -> Vec<i16> {
data.iter()
.map(|x| *x as i32)
.map(|x| x - i16::MAX as i32 / 2)
.map(|x| x as i16)
.collect()
}
#[inline(always)]
fn f32_data_to_i16(data: &[f32]) -> Vec<i16> {
data.iter()
.map(|x| x * i16::MAX as f32)
.map(|x| x as i16)
.collect()
}
pub fn audio_input_device_list() -> BTreeMap<String, Device> {
let host = cpal::default_host();
let mut map = BTreeMap::new();
for (i, dev) in host.input_devices().unwrap().enumerate() {
map.insert(dev.name().unwrap_or(format!("Unknown device #{}", i)), dev);
}
map
}
pub fn print_audio_input_device_configs() {
let host = cpal::default_host();
for (i, dev) in host.input_devices().unwrap().enumerate() {
eprintln!("--------");
let name = dev.name().unwrap_or(format!("Unknown device #{}", i));
eprintln!("[{}] default config:", name);
eprintln!("{:#?}", dev.default_input_config().unwrap());
}
}
pub fn get_backends() -> HashMap<String, Host> {
cpal::available_hosts()
.into_iter()
.map(|id| (format!("{:?}", id), cpal::host_from_id(id).unwrap()))
.collect::<HashMap<_, _>>()
}
#[cfg(test)]
mod tests {
use super::*;
}
| /*
MIT License
Copyright (c) 2021 Philipp Schuster
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, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
use crate::{BeatInfo, StrategyKind};
use cpal::traits::{DeviceTrait, HostTrait, StreamTrait};
use cpal::{BufferSize, Device, Host, InputCallbackInfo, SampleFormat, StreamConfig, StreamError};
use std::collections::{BTreeMap, HashMap};
use std::sync::atomic::{AtomicBool, Ordering};
use std::sync::Arc;
use std::thread::{spawn, JoinHandle};
use std::time::Instant;
pub fn start_listening(
on_beat_cb: impl Fn(BeatInfo) + Send + 'static,
input_dev: Option<Device>,
strategy: StrategyKind,
keep_recording: Arc<AtomicBool>,
) -> Result<JoinHandle<()>, String> {
if !keep_recording.load(Ordering::SeqCst) {
return Err("Variable keep_recording is false from the beginning!?".to_string());
}
let in_dev = input_dev.map(Ok).unwrap_or_else(|| {
let host = cpal::default_host();
host.default_input_device()
.ok_or_else(|| "Must have input device!".to_string())
})?;
let in_dev_cfg = in_dev.default_input_config().unwrap();
let sampling_rate = in_dev_cfg.sample_rate();
let sample_format = in_dev_cfg.sample_format();
eprintln!("Using input device: {:?}", in_dev.name().unwrap());
eprintln!(" sampling_rate: {}", sampling_rate.0);
eprintln!(" sample_format: {:?}", sample_format);
let err_cb = |err: StreamError| {
eprintln!("Record error occurred: {:#?}", err);
};
#[cfg(not(target_os = "linux"))]
let preferred_window_length = 1024;
let in_stream_cfg = StreamConfig {
channels: 1,
sample_rate: sampling_rate,
#[cfg(not(target_os = "linux"))]
buffer_size: BufferSize::Fixed(preferred_window_length),
#[cfg(target_os = "linux")]
buffer_size: BufferSize::Default,
};
let detector = strategy.detector(sampling_rate.0);
let handle = spawn(move || {
let stream = match sample_format {
SampleFormat::F32 => in_dev.build_input_stream(
&in_stream_cfg,
move |data: &[f32], _info: &InputCallbackInfo| {
let now = Instant::now();
if let Some(info) = detector.is_beat(&f32_data_to_i16(data)) {
on_beat_cb(info);
}
let millis = now.elapsed().as_millis();
if millis > 20 {
eprintln!("calculation took {}ms", millis);
}
},
err_cb,
),
SampleFormat::I16 => in_dev.build_input_stream(
&in_stream_cfg,
move |data: &[i16], _info: &InputCallbackInfo| {
let now = Instant::now();
if let Some(info) = detector.is_beat(data) {
on_beat_cb(info);
}
let millis = now.elapsed().as_millis();
if millis > 20 {
eprintln!("calculation took {}ms", millis);
}
},
err_cb,
),
SampleFormat::U16 => in_dev.build_input_stream(
&in_stream_cfg,
move |data: &[u16], _info: &InputCallbackInfo| {
let now = Instant::now();
if let Some(info) = detector.is_beat(&u16_data_to_i16(data)) {
on_beat_cb(info);
}
let millis = now.elapsed().as_millis();
if millis > 20 {
eprintln!("calculation took {}ms", millis);
}
},
err_cb,
),
}
.map_err(|err| format!("Can't open stream: {:?}", err))
.unwrap();
|
#[inline(always)]
fn u16_data_to_i16(data: &[u16]) -> Vec<i16> {
data.iter()
.map(|x| *x as i32)
.map(|x| x - i16::MAX as i32 / 2)
.map(|x| x as i16)
.collect()
}
#[inline(always)]
fn f32_data_to_i16(data: &[f32]) -> Vec<i16> {
data.iter()
.map(|x| x * i16::MAX as f32)
.map(|x| x as i16)
.collect()
}
pub fn audio_input_device_list() -> BTreeMap<String, Device> {
let host = cpal::default_host();
let mut map = BTreeMap::new();
for (i, dev) in host.input_devices().unwrap().enumerate() {
map.insert(dev.name().unwrap_or(format!("Unknown device #{}", i)), dev);
}
map
}
pub fn print_audio_input_device_configs() {
let host = cpal::default_host();
for (i, dev) in host.input_devices().unwrap().enumerate() {
eprintln!("--------");
let name = dev.name().unwrap_or(format!("Unknown device #{}", i));
eprintln!("[{}] default config:", name);
eprintln!("{:#?}", dev.default_input_config().unwrap());
}
}
pub fn get_backends() -> HashMap<String, Host> {
cpal::available_hosts()
.into_iter()
.map(|id| (format!("{:?}", id), cpal::host_from_id(id).unwrap()))
.collect::<HashMap<_, _>>()
}
#[cfg(test)]
mod tests {
use super::*;
}
| stream.play().unwrap();
loop {
if !keep_recording.load(Ordering::SeqCst) {
break;
}
}
});
Ok(handle)
} | function_block-function_prefix_line | [
{
"content": "fn select_strategy() -> StrategyKind {\n\n println!(\"Available beat detection strategies:\");\n\n StrategyKind::values()\n\n .into_iter()\n\n .enumerate()\n\n .for_each(|(i, s)| {\n\n println!(\" [{}] {} - {}\", i, s.name(), s.description());\n\n });\... |
Rust | tests/defaults_encode_decode.rs | OragonEfreet/sage_mqtt | 092cf0494e5c602d712591a4fb87e5cd713b7282 | use sage_mqtt::{
Auth, ConnAck, Connect, Disconnect, Error, Packet, PubAck, PubComp, PubRec, PubRel, Publish,
ReasonCode, SubAck, Subscribe, UnSubAck, UnSubscribe,
};
use std::io::Cursor;
#[tokio::test]
async fn default_connect() {
let mut encoded = Vec::new();
let send_packet: Packet = Connect::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Connect packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Connect");
if let Packet::Connect(receive_packet) = receive_result {
assert_eq!(receive_packet, Connect::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn connect_with_default_auth() {
let mut encoded = Vec::new();
let send_packet: Packet = Connect {
authentication: Some(Default::default()),
..Default::default()
}
.into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Connect packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Connect");
if let Packet::Connect(receive_packet) = receive_result {
assert_eq!(
receive_packet,
Connect {
authentication: Some(Default::default()),
..Default::default()
}
);
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_connack() {
let mut encoded = Vec::new();
let send_packet: Packet = ConnAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode ConnAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode ConnAck");
if let Packet::ConnAck(receive_packet) = receive_result {
assert_eq!(receive_packet, ConnAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_publish() {
let mut encoded = Vec::new();
let send_packet: Packet = Publish::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Publish packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Publish");
if let Packet::Publish(receive_packet) = receive_result {
assert_eq!(receive_packet, Publish::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_puback() {
let mut encoded = Vec::new();
let send_packet: Packet = PubAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubAck");
if let Packet::PubAck(receive_packet) = receive_result {
assert_eq!(receive_packet, PubAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pubrec() {
let mut encoded = Vec::new();
let send_packet: Packet = PubRec::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubRec packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubRec");
if let Packet::PubRec(receive_packet) = receive_result {
assert_eq!(receive_packet, PubRec::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pubrel() {
let mut encoded = Vec::new();
let send_packet: Packet = PubRel::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubRel packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubRel");
if let Packet::PubRel(receive_packet) = receive_result {
assert_eq!(receive_packet, PubRel::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pubcomp() {
let mut encoded = Vec::new();
let send_packet: Packet = PubComp::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubComp packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubComp");
if let Packet::PubComp(receive_packet) = receive_result {
assert_eq!(receive_packet, PubComp::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_subscribe() {
let mut encoded = Vec::new();
let send_packet: Packet = Subscribe::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Subscribe packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor).await;
assert!(matches!(
receive_result,
Err(Error::Reason(ReasonCode::ProtocolError))
));
}
#[tokio::test]
async fn default_suback() {
let mut encoded = Vec::new();
let send_packet: Packet = SubAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode SubAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode SubAck");
if let Packet::SubAck(receive_packet) = receive_result {
assert_eq!(receive_packet, SubAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_unsubscribe() {
let mut encoded = Vec::new();
let send_packet: Packet = UnSubscribe::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode UnSubscribe packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor).await;
assert!(matches!(
receive_result,
Err(Error::Reason(ReasonCode::ProtocolError))
));
}
#[tokio::test]
async fn default_unsuback() {
let mut encoded = Vec::new();
let send_packet: Packet = UnSubAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode UnSubAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode UnSubAck");
if let Packet::UnSubAck(receive_packet) = receive_result {
assert_eq!(receive_packet, UnSubAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pingreq() {
let mut encoded = Vec::new();
let send_size = Packet::PingReq
.encode(&mut encoded)
.await
.expect("Cannot encode PingReq packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PingReq");
assert!(matches!(receive_result, Packet::PingReq));
}
#[tokio::test]
async fn default_pingresp() {
let mut encoded = Vec::new();
let send_size = Packet::PingResp
.encode(&mut encoded)
.await
.expect("Cannot encode PingResp packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PingResp");
assert!(matches!(receive_result, Packet::PingResp));
}
#[tokio::test]
async fn default_disconnect() {
let mut encoded = Vec::new();
let send_packet: Packet = Disconnect::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Disconnect packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Disconnect");
if let Packet::Disconnect(receive_packet) = receive_result {
assert_eq!(receive_packet, Disconnect::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_auth() {
let mut encoded = Vec::new();
let send_packet: Packet = Auth::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Auth packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Auth");
if let Packet::Auth(receive_packet) = receive_result {
assert_eq!(receive_packet, Auth::default());
} else {
panic!("Incorrect packet type");
}
}
| use sage_mqtt::{
Auth, ConnAck, Connect, Disconnect, Error, Packet, PubAck, PubComp, PubRec, PubRel, Publish,
ReasonCode, SubAck, Subscribe, UnSubAck, UnSubscribe,
};
use std::io::Cursor;
#[tokio::test]
async fn default_connect() {
let mut encoded = Vec::new();
let send_packet: Packet = Connect::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Connect packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Connect");
if let Packet::Connect(receive_packet) = receive_result {
assert_eq!(receive_packet, Connect::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn connect_with_default_auth() {
let mut encoded = Vec::new();
let send_packet: Packet = Connect {
authentication: Some(Default::default()),
..Default::default()
}
.into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Connect packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Connect");
|
}
#[tokio::test]
async fn default_connack() {
let mut encoded = Vec::new();
let send_packet: Packet = ConnAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode ConnAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode ConnAck");
if let Packet::ConnAck(receive_packet) = receive_result {
assert_eq!(receive_packet, ConnAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_publish() {
let mut encoded = Vec::new();
let send_packet: Packet = Publish::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Publish packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Publish");
if let Packet::Publish(receive_packet) = receive_result {
assert_eq!(receive_packet, Publish::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_puback() {
let mut encoded = Vec::new();
let send_packet: Packet = PubAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubAck");
if let Packet::PubAck(receive_packet) = receive_result {
assert_eq!(receive_packet, PubAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pubrec() {
let mut encoded = Vec::new();
let send_packet: Packet = PubRec::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubRec packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubRec");
if let Packet::PubRec(receive_packet) = receive_result {
assert_eq!(receive_packet, PubRec::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pubrel() {
let mut encoded = Vec::new();
let send_packet: Packet = PubRel::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubRel packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubRel");
if let Packet::PubRel(receive_packet) = receive_result {
assert_eq!(receive_packet, PubRel::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pubcomp() {
let mut encoded = Vec::new();
let send_packet: Packet = PubComp::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode PubComp packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PubComp");
if let Packet::PubComp(receive_packet) = receive_result {
assert_eq!(receive_packet, PubComp::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_subscribe() {
let mut encoded = Vec::new();
let send_packet: Packet = Subscribe::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Subscribe packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor).await;
assert!(matches!(
receive_result,
Err(Error::Reason(ReasonCode::ProtocolError))
));
}
#[tokio::test]
async fn default_suback() {
let mut encoded = Vec::new();
let send_packet: Packet = SubAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode SubAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode SubAck");
if let Packet::SubAck(receive_packet) = receive_result {
assert_eq!(receive_packet, SubAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_unsubscribe() {
let mut encoded = Vec::new();
let send_packet: Packet = UnSubscribe::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode UnSubscribe packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor).await;
assert!(matches!(
receive_result,
Err(Error::Reason(ReasonCode::ProtocolError))
));
}
#[tokio::test]
async fn default_unsuback() {
let mut encoded = Vec::new();
let send_packet: Packet = UnSubAck::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode UnSubAck packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode UnSubAck");
if let Packet::UnSubAck(receive_packet) = receive_result {
assert_eq!(receive_packet, UnSubAck::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_pingreq() {
let mut encoded = Vec::new();
let send_size = Packet::PingReq
.encode(&mut encoded)
.await
.expect("Cannot encode PingReq packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PingReq");
assert!(matches!(receive_result, Packet::PingReq));
}
#[tokio::test]
async fn default_pingresp() {
let mut encoded = Vec::new();
let send_size = Packet::PingResp
.encode(&mut encoded)
.await
.expect("Cannot encode PingResp packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode PingResp");
assert!(matches!(receive_result, Packet::PingResp));
}
#[tokio::test]
async fn default_disconnect() {
let mut encoded = Vec::new();
let send_packet: Packet = Disconnect::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Disconnect packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Disconnect");
if let Packet::Disconnect(receive_packet) = receive_result {
assert_eq!(receive_packet, Disconnect::default());
} else {
panic!("Incorrect packet type");
}
}
#[tokio::test]
async fn default_auth() {
let mut encoded = Vec::new();
let send_packet: Packet = Auth::default().into();
let send_size = send_packet
.encode(&mut encoded)
.await
.expect("Cannot encode Auth packet");
assert!(send_size > 0);
let mut cursor = Cursor::new(encoded);
let receive_result = Packet::decode(&mut cursor)
.await
.expect("Cannot decode Auth");
if let Packet::Auth(receive_packet) = receive_result {
assert_eq!(receive_packet, Auth::default());
} else {
panic!("Incorrect packet type");
}
}
| if let Packet::Connect(receive_packet) = receive_result {
assert_eq!(
receive_packet,
Connect {
authentication: Some(Default::default()),
..Default::default()
}
);
} else {
panic!("Incorrect packet type");
} | if_condition | [
{
"content": "use crate::QoS;\n\n\n\n/// The control packet type is present as the first element of the fixed header\n\n/// in an MQTT paquet. It is encoded in a 8bit flag set where the 4 most\n\n/// significant bits represent the type of the paquet and the 4 least are flags\n\n/// where values depend on the ty... |
Rust | exchanges/binance/src/exchange.rs | rcjmurillo/crypto-portfolio | 3032bb100159875b5730da440b008d1e46df7539 | use chrono::{DateTime, Utc};
use std::collections::HashSet;
use anyhow::Result;
use async_trait::async_trait;
use futures::future::join_all;
use crate::{
api_model::{Deposit, FiatOrder, MarginLoan, MarginRepay, Trade, Withdraw},
client::{BinanceFetcher, EndpointsGlobal, EndpointsUs, RegionGlobal, RegionUs},
};
use exchange::{self, AssetPair, AssetsInfo, ExchangeDataFetcher, ExchangeClient, Candle};
impl From<FiatOrder> for exchange::Deposit {
fn from(d: FiatOrder) -> Self {
Self {
source_id: d.id,
source: "binance".to_string(),
asset: d.fiat_currency,
amount: d.amount,
fee: Some(d.platform_fee),
time: d.create_time,
is_fiat: true,
}
}
}
impl From<FiatOrder> for exchange::Withdraw {
fn from(d: FiatOrder) -> Self {
Self {
source_id: d.id,
source: "binance".to_string(),
asset: d.fiat_currency,
amount: d.amount,
fee: d.transaction_fee + d.platform_fee,
time: d.create_time,
}
}
}
impl From<Deposit> for exchange::Deposit {
fn from(d: Deposit) -> Self {
Self {
source_id: d.id,
source: "binance".to_string(),
asset: d.coin,
amount: d.amount,
fee: None,
time: d.insert_time,
is_fiat: false,
}
}
}
impl From<Withdraw> for exchange::Withdraw {
fn from(w: Withdraw) -> Self {
Self {
source_id: w.id,
source: "binance".to_string(),
asset: w.coin,
amount: w.amount,
time: w.apply_time,
fee: w.transaction_fee,
}
}
}
impl From<Trade> for exchange::Trade {
fn from(t: Trade) -> Self {
Self {
source_id: t.id.to_string(),
source: "binance".to_string(),
symbol: t.symbol,
base_asset: t.base_asset,
quote_asset: t.quote_asset,
price: t.price,
amount: t.qty,
fee: t.commission,
fee_asset: t.commission_asset,
time: t.time,
side: if t.is_buyer {
exchange::TradeSide::Buy
} else {
exchange::TradeSide::Sell
},
}
}
}
impl From<MarginLoan> for exchange::Loan {
fn from(m: MarginLoan) -> Self {
Self {
source_id: m.tx_id.to_string(),
source: "binance".to_string(),
asset: m.asset,
amount: m.principal,
time: m.timestamp,
status: match m.status.as_str() {
"CONFIRMED" => exchange::Status::Success,
_ => exchange::Status::Failure,
},
}
}
}
impl From<MarginRepay> for exchange::Repay {
fn from(r: MarginRepay) -> Self {
Self {
source_id: r.tx_id.to_string(),
source: "binance".to_string(),
asset: r.asset,
amount: r.principal,
interest: r.interest,
time: r.timestamp,
status: match r.status.as_str() {
"CONFIRMED" => exchange::Status::Success,
_ => exchange::Status::Failure,
},
}
}
}
#[async_trait]
impl ExchangeDataFetcher for BinanceFetcher<RegionGlobal> {
async fn trades(&self) -> Result<Vec<exchange::Trade>> {
let all_symbols: Vec<String> = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?
.into_iter()
.map(|x| x.symbol)
.collect();
let mut trades: Vec<Result<Vec<Trade>>> = Vec::new();
let endpoint = EndpointsGlobal::Trades.to_string();
let mut handles = Vec::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
handles.push(self.fetch_trades(&endpoint, symbol));
if handles.len() >= 10 {
trades.extend(join_all(handles).await);
handles = Vec::new();
}
}
}
if handles.len() > 0 {
trades.extend(join_all(handles).await);
}
flatten_results(trades)
}
async fn margin_trades(&self) -> Result<Vec<exchange::Trade>> {
let all_symbols: Vec<String> = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?
.into_iter()
.map(|x| x.symbol)
.collect();
let mut handles = Vec::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
handles.push(self.fetch_margin_trades(symbol));
}
}
flatten_results(join_all(handles).await)
}
async fn loans(&self) -> Result<Vec<exchange::Loan>> {
let mut handles = Vec::new();
let exchange_symbols = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?;
let all_symbols: Vec<String> = exchange_symbols.iter().map(|x| x.symbol.clone()).collect();
let mut processed_assets = HashSet::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
if !processed_assets.contains(&symbol.base) {
handles.push(self.fetch_margin_loans(&symbol.base, None));
processed_assets.insert(&symbol.base);
}
handles.push(self.fetch_margin_loans(&symbol.base, Some(symbol)));
}
}
flatten_results(join_all(handles).await)
}
async fn repays(&self) -> Result<Vec<exchange::Repay>> {
let mut handles = Vec::new();
let exchange_symbols = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?;
let all_symbols: Vec<String> = exchange_symbols.iter().map(|x| x.symbol.clone()).collect();
let mut processed_assets = HashSet::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
if !processed_assets.contains(&symbol.base) {
handles.push(self.fetch_margin_repays(&symbol.base, None));
processed_assets.insert(symbol.base.clone());
}
handles.push(self.fetch_margin_repays(&symbol.base, Some(symbol)));
}
}
flatten_results(join_all(handles).await)
}
async fn deposits(&self) -> Result<Vec<exchange::Deposit>> {
let mut deposits = Vec::new();
deposits.extend(
self.fetch_fiat_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
deposits.extend(
self.fetch_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
Ok(deposits)
}
async fn withdraws(&self) -> Result<Vec<exchange::Withdraw>> {
let mut withdraws = Vec::new();
withdraws.extend(
self.fetch_fiat_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
withdraws.extend(
self.fetch_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
Ok(withdraws)
}
}
#[async_trait]
impl ExchangeClient for BinanceFetcher<RegionGlobal> {
async fn prices(
&self,
asset_pair: &AssetPair,
start: DateTime<Utc>,
end: DateTime<Utc>,
) -> Result<Vec<Candle>> {
self.fetch_prices_in_range(
&EndpointsGlobal::Klines.to_string(),
&asset_pair.join(""),
start.timestamp_millis().try_into()?,
end.timestamp_millis().try_into()?,
).await
}
}
#[async_trait]
impl ExchangeDataFetcher for BinanceFetcher<RegionUs> {
async fn trades(&self) -> Result<Vec<exchange::Trade>> {
let all_symbols: Vec<String> = self
.fetch_exchange_symbols(&EndpointsUs::ExchangeInfo.to_string())
.await?
.into_iter()
.map(|x| x.symbol)
.collect();
let endpoint = EndpointsUs::Trades.to_string();
let mut handles = Vec::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
handles.push(self.fetch_trades(&endpoint, &symbol));
}
}
flatten_results(join_all(handles).await)
}
async fn margin_trades(&self) -> Result<Vec<exchange::Trade>> {
Ok(Vec::new())
}
async fn loans(&self) -> Result<Vec<exchange::Loan>> {
Ok(Vec::new())
}
async fn repays(&self) -> Result<Vec<exchange::Repay>> {
Ok(Vec::new())
}
async fn deposits(&self) -> Result<Vec<exchange::Deposit>> {
let mut deposits = Vec::new();
deposits.extend(
self.fetch_fiat_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
deposits.extend(
self.fetch_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
Ok(deposits)
}
async fn withdraws(&self) -> Result<Vec<exchange::Withdraw>> {
let mut withdraws = Vec::new();
withdraws.extend(
self.fetch_fiat_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
withdraws.extend(
self.fetch_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
Ok(withdraws)
}
}
#[async_trait]
impl AssetsInfo for BinanceFetcher<RegionGlobal> {
async fn price_at(&self, asset_pair: &AssetPair, time: &DateTime<Utc>) -> Result<f64> {
self.fetch_price_at(
&EndpointsGlobal::Prices.to_string(),
&asset_pair.join(""),
time,
)
.await
}
}
fn flatten_results<T, U>(results: Vec<Result<Vec<T>>>) -> Result<Vec<U>>
where
T: Into<U>,
{
Ok(results
.into_iter()
.collect::<Result<Vec<Vec<T>>>>()?
.into_iter()
.flatten()
.map(|x| x.into())
.collect())
}
| use chrono::{DateTime, Utc};
use std::collections::HashSet;
use anyhow::Result;
use async_trait::async_trait;
use futures::future::join_all;
use crate::{
api_model::{Deposit, FiatOrder, MarginLoan, MarginRepay, Trade, Withdraw},
client::{BinanceFetcher, EndpointsGlobal, EndpointsUs, RegionGlobal, RegionUs},
};
use exchange::{self, AssetPair, AssetsInfo, ExchangeDataFetcher, ExchangeClient, Candle};
impl From<FiatOrder> for exchange::Deposit {
fn from(d: FiatOrder) -> Self {
Self {
source_id: d.id,
source: "binance".to_string(),
as | ance".to_string(),
asset: r.asset,
amount: r.principal,
interest: r.interest,
time: r.timestamp,
status: match r.status.as_str() {
"CONFIRMED" => exchange::Status::Success,
_ => exchange::Status::Failure,
},
}
}
}
#[async_trait]
impl ExchangeDataFetcher for BinanceFetcher<RegionGlobal> {
async fn trades(&self) -> Result<Vec<exchange::Trade>> {
let all_symbols: Vec<String> = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?
.into_iter()
.map(|x| x.symbol)
.collect();
let mut trades: Vec<Result<Vec<Trade>>> = Vec::new();
let endpoint = EndpointsGlobal::Trades.to_string();
let mut handles = Vec::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
handles.push(self.fetch_trades(&endpoint, symbol));
if handles.len() >= 10 {
trades.extend(join_all(handles).await);
handles = Vec::new();
}
}
}
if handles.len() > 0 {
trades.extend(join_all(handles).await);
}
flatten_results(trades)
}
async fn margin_trades(&self) -> Result<Vec<exchange::Trade>> {
let all_symbols: Vec<String> = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?
.into_iter()
.map(|x| x.symbol)
.collect();
let mut handles = Vec::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
handles.push(self.fetch_margin_trades(symbol));
}
}
flatten_results(join_all(handles).await)
}
async fn loans(&self) -> Result<Vec<exchange::Loan>> {
let mut handles = Vec::new();
let exchange_symbols = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?;
let all_symbols: Vec<String> = exchange_symbols.iter().map(|x| x.symbol.clone()).collect();
let mut processed_assets = HashSet::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
if !processed_assets.contains(&symbol.base) {
handles.push(self.fetch_margin_loans(&symbol.base, None));
processed_assets.insert(&symbol.base);
}
handles.push(self.fetch_margin_loans(&symbol.base, Some(symbol)));
}
}
flatten_results(join_all(handles).await)
}
async fn repays(&self) -> Result<Vec<exchange::Repay>> {
let mut handles = Vec::new();
let exchange_symbols = self
.fetch_exchange_symbols(&EndpointsGlobal::ExchangeInfo.to_string())
.await?;
let all_symbols: Vec<String> = exchange_symbols.iter().map(|x| x.symbol.clone()).collect();
let mut processed_assets = HashSet::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
if !processed_assets.contains(&symbol.base) {
handles.push(self.fetch_margin_repays(&symbol.base, None));
processed_assets.insert(symbol.base.clone());
}
handles.push(self.fetch_margin_repays(&symbol.base, Some(symbol)));
}
}
flatten_results(join_all(handles).await)
}
async fn deposits(&self) -> Result<Vec<exchange::Deposit>> {
let mut deposits = Vec::new();
deposits.extend(
self.fetch_fiat_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
deposits.extend(
self.fetch_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
Ok(deposits)
}
async fn withdraws(&self) -> Result<Vec<exchange::Withdraw>> {
let mut withdraws = Vec::new();
withdraws.extend(
self.fetch_fiat_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
withdraws.extend(
self.fetch_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
Ok(withdraws)
}
}
#[async_trait]
impl ExchangeClient for BinanceFetcher<RegionGlobal> {
async fn prices(
&self,
asset_pair: &AssetPair,
start: DateTime<Utc>,
end: DateTime<Utc>,
) -> Result<Vec<Candle>> {
self.fetch_prices_in_range(
&EndpointsGlobal::Klines.to_string(),
&asset_pair.join(""),
start.timestamp_millis().try_into()?,
end.timestamp_millis().try_into()?,
).await
}
}
#[async_trait]
impl ExchangeDataFetcher for BinanceFetcher<RegionUs> {
async fn trades(&self) -> Result<Vec<exchange::Trade>> {
let all_symbols: Vec<String> = self
.fetch_exchange_symbols(&EndpointsUs::ExchangeInfo.to_string())
.await?
.into_iter()
.map(|x| x.symbol)
.collect();
let endpoint = EndpointsUs::Trades.to_string();
let mut handles = Vec::new();
for symbol in self.symbols().iter() {
if all_symbols.contains(&symbol.join("")) {
handles.push(self.fetch_trades(&endpoint, &symbol));
}
}
flatten_results(join_all(handles).await)
}
async fn margin_trades(&self) -> Result<Vec<exchange::Trade>> {
Ok(Vec::new())
}
async fn loans(&self) -> Result<Vec<exchange::Loan>> {
Ok(Vec::new())
}
async fn repays(&self) -> Result<Vec<exchange::Repay>> {
Ok(Vec::new())
}
async fn deposits(&self) -> Result<Vec<exchange::Deposit>> {
let mut deposits = Vec::new();
deposits.extend(
self.fetch_fiat_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
deposits.extend(
self.fetch_deposits()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Deposit>>(),
);
Ok(deposits)
}
async fn withdraws(&self) -> Result<Vec<exchange::Withdraw>> {
let mut withdraws = Vec::new();
withdraws.extend(
self.fetch_fiat_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
withdraws.extend(
self.fetch_withdraws()
.await?
.into_iter()
.map(|x| x.into())
.collect::<Vec<exchange::Withdraw>>(),
);
Ok(withdraws)
}
}
#[async_trait]
impl AssetsInfo for BinanceFetcher<RegionGlobal> {
async fn price_at(&self, asset_pair: &AssetPair, time: &DateTime<Utc>) -> Result<f64> {
self.fetch_price_at(
&EndpointsGlobal::Prices.to_string(),
&asset_pair.join(""),
time,
)
.await
}
}
fn flatten_results<T, U>(results: Vec<Result<Vec<T>>>) -> Result<Vec<U>>
where
T: Into<U>,
{
Ok(results
.into_iter()
.collect::<Result<Vec<Vec<T>>>>()?
.into_iter()
.flatten()
.map(|x| x.into())
.collect())
}
| set: d.fiat_currency,
amount: d.amount,
fee: Some(d.platform_fee),
time: d.create_time,
is_fiat: true,
}
}
}
impl From<FiatOrder> for exchange::Withdraw {
fn from(d: FiatOrder) -> Self {
Self {
source_id: d.id,
source: "binance".to_string(),
asset: d.fiat_currency,
amount: d.amount,
fee: d.transaction_fee + d.platform_fee,
time: d.create_time,
}
}
}
impl From<Deposit> for exchange::Deposit {
fn from(d: Deposit) -> Self {
Self {
source_id: d.id,
source: "binance".to_string(),
asset: d.coin,
amount: d.amount,
fee: None,
time: d.insert_time,
is_fiat: false,
}
}
}
impl From<Withdraw> for exchange::Withdraw {
fn from(w: Withdraw) -> Self {
Self {
source_id: w.id,
source: "binance".to_string(),
asset: w.coin,
amount: w.amount,
time: w.apply_time,
fee: w.transaction_fee,
}
}
}
impl From<Trade> for exchange::Trade {
fn from(t: Trade) -> Self {
Self {
source_id: t.id.to_string(),
source: "binance".to_string(),
symbol: t.symbol,
base_asset: t.base_asset,
quote_asset: t.quote_asset,
price: t.price,
amount: t.qty,
fee: t.commission,
fee_asset: t.commission_asset,
time: t.time,
side: if t.is_buyer {
exchange::TradeSide::Buy
} else {
exchange::TradeSide::Sell
},
}
}
}
impl From<MarginLoan> for exchange::Loan {
fn from(m: MarginLoan) -> Self {
Self {
source_id: m.tx_id.to_string(),
source: "binance".to_string(),
asset: m.asset,
amount: m.principal,
time: m.timestamp,
status: match m.status.as_str() {
"CONFIRMED" => exchange::Status::Success,
_ => exchange::Status::Failure,
},
}
}
}
impl From<MarginRepay> for exchange::Repay {
fn from(r: MarginRepay) -> Self {
Self {
source_id: r.tx_id.to_string(),
source: "bin | random | [
{
"content": "pub fn get_asset_price_bucket(bucket: u16, asset: &AssetPair) -> Result<Option<Vec<Candle>>> {\n\n let conn = Connection::open(DB_NAME)?;\n\n\n\n let mut stmt =\n\n conn.prepare(\"SELECT prices FROM asset_price_buckets WHERE bucket = ?1 AND asset = ?2\")?;\n\n let mut iter = stmt.q... |
Rust | deps/stb-image/image.rs | tomaka/declmagic | df3abdcd89cd1515f93c369401ac93581c3d4382 |
use stb_image::bindgen::*;
use std::any::Any;
use libc;
use libc::{c_void, c_int};
use std::slice::raw::buf_as_slice;
pub struct Image<T> {
pub width : uint,
pub height : uint,
pub depth : uint,
pub data : Vec<T>,
}
pub fn new_image<T>(width: uint, height: uint, depth: uint, data: Vec<T>) -> Image<T> {
Image::<T> {
width : width,
height : height,
depth : depth,
data : data,
}
}
pub enum LoadResult {
Error(String),
ImageU8(Image<u8>),
ImageF32(Image<f32>),
}
impl LoadResult {
pub fn from_result(res: Result<LoadResult,Box<Any>>)-> LoadResult {
match res {
Ok(res) => res,
Err(e) => Error(e.to_string()),
}
}
}
pub fn load(path: &Path) -> LoadResult {
let force_depth = 0;
load_with_depth(path, force_depth, false)
}
fn load_internal<T: Clone>(buf : *const T, w : c_int, h : c_int, d : c_int) -> Image<T> {
unsafe {
let data = buf_as_slice(buf, (w * h * d) as uint, |s| { Vec::from_slice(s) });
libc::free(buf as *mut c_void);
Image::<T>{
width : w as uint,
height : h as uint,
depth : d as uint,
data : data}
}
}
pub fn load_with_depth(path: &Path, force_depth: uint, convert_hdr: bool) -> LoadResult {
unsafe {
let mut width = 0 as c_int;
let mut height = 0 as c_int;
let mut depth = 0 as c_int;
let path_as_str = match path.as_str() {
Some(s) => s,
None => return Error("path is not valid utf8".to_string()),
};
path_as_str.with_c_str(|bytes| {
if !convert_hdr && stbi_is_hdr(bytes)!=0 {
let buffer = stbi_loadf(bytes,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_loadf failed".to_string())
} else {
ImageF32(load_internal(buffer, width, height, depth))
}
} else {
let buffer = stbi_load(bytes,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_load failed".to_string())
} else {
ImageU8(load_internal(buffer, width, height, depth))
}
}
})
}
}
pub fn load_from_memory(buffer: &[u8]) -> LoadResult {
let force_depth = 0;
load_from_memory_with_depth(buffer, force_depth, false)
}
pub fn load_from_memory_with_depth(buffer: &[u8], force_depth: uint, convert_hdr:bool) -> LoadResult {
unsafe {
let mut width = 0 as c_int;
let mut height = 0 as c_int;
let mut depth = 0 as c_int;
if !convert_hdr && stbi_is_hdr_from_memory(buffer.as_ptr(), buffer.len() as c_int) != 0 {
let buffer = stbi_loadf_from_memory(buffer.as_ptr(),
buffer.len() as c_int,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_loadf_from_memory failed".to_string())
} else {
let actual_depth = if force_depth != 0 { force_depth as c_int } else { depth };
ImageF32(load_internal(buffer, width, height, actual_depth))
}
} else {
let buffer = stbi_load_from_memory(buffer.as_ptr(),
buffer.len() as c_int,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_load_from_memory failed".to_string())
} else {
let actual_depth = if force_depth != 0 { force_depth as c_int } else { depth };
ImageU8(load_internal(buffer, width, height, actual_depth))
}
}
}
}
|
use stb_image::bindgen::*;
use std::any::Any;
use libc;
use libc::{c_void, c_int};
use std::slice::raw::buf_as_slice;
pub struct Image<T> {
pub width : uint,
pub height : uint,
pub depth : uint,
pub data : Vec<T>,
}
pub fn new_image<T>(width: uint, height: uint, depth: uint, data: Vec<T>) -> Image<T> {
Image::<T> {
width : width,
height : height,
depth : depth,
data : data,
}
}
pub enum LoadResult {
Error(String),
ImageU8(Image<u8>),
ImageF32(Image<f32>),
}
impl LoadResult {
pub fn from_result(res: Result<LoadResult,Box<Any>>)-> LoadResult {
match res {
Ok(res) => res,
Err(e) => Error(e.to_string()),
}
}
}
pub fn load(path: &Path) -> LoadResult {
let force_depth = 0;
load_with_depth(path, force_depth, false)
}
fn load_internal<T: Clone>(buf : *const T, w : c_int, h : c_int, d : c_int) -> Image<T> {
unsafe {
let data = buf_as_slice(buf, (w * h * d) as uint, |s| { Vec::from_slice(s) });
|
pub fn load_with_depth(path: &Path, force_depth: uint, convert_hdr: bool) -> LoadResult {
unsafe {
let mut width = 0 as c_int;
let mut height = 0 as c_int;
let mut depth = 0 as c_int;
let path_as_str = match path.as_str() {
Some(s) => s,
None => return Error("path is not valid utf8".to_string()),
};
path_as_str.with_c_str(|bytes| {
if !convert_hdr && stbi_is_hdr(bytes)!=0 {
let buffer = stbi_loadf(bytes,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_loadf failed".to_string())
} else {
ImageF32(load_internal(buffer, width, height, depth))
}
} else {
let buffer = stbi_load(bytes,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_load failed".to_string())
} else {
ImageU8(load_internal(buffer, width, height, depth))
}
}
})
}
}
pub fn load_from_memory(buffer: &[u8]) -> LoadResult {
let force_depth = 0;
load_from_memory_with_depth(buffer, force_depth, false)
}
pub fn load_from_memory_with_depth(buffer: &[u8], force_depth: uint, convert_hdr:bool) -> LoadResult {
unsafe {
let mut width = 0 as c_int;
let mut height = 0 as c_int;
let mut depth = 0 as c_int;
if !convert_hdr && stbi_is_hdr_from_memory(buffer.as_ptr(), buffer.len() as c_int) != 0 {
let buffer = stbi_loadf_from_memory(buffer.as_ptr(),
buffer.len() as c_int,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_loadf_from_memory failed".to_string())
} else {
let actual_depth = if force_depth != 0 { force_depth as c_int } else { depth };
ImageF32(load_internal(buffer, width, height, actual_depth))
}
} else {
let buffer = stbi_load_from_memory(buffer.as_ptr(),
buffer.len() as c_int,
&mut width,
&mut height,
&mut depth,
force_depth as c_int);
if buffer.is_null() {
Error("stbi_load_from_memory failed".to_string())
} else {
let actual_depth = if force_depth != 0 { force_depth as c_int } else { depth };
ImageU8(load_internal(buffer, width, height, actual_depth))
}
}
}
}
| libc::free(buf as *mut c_void);
Image::<T>{
width : w as uint,
height : h as uint,
depth : d as uint,
data : data}
}
} | function_block-function_prefixed | [
{
"content": "/// Load each OpenGL symbol using a custom load function. This allows for the\n\n/// use of functions like `glfwGetProcAddress` or `SDL_GL_GetProcAddress`.\n\n///\n\n/// ~~~\n\n/// let gl = gl::load_with(glfw::get_proc_address);\n\n/// ~~~\n\npub fn load_with(loadfn: |symbol: &str| -> *const libc:... |
Rust | keyvalues-parser/src/text/parse.rs | LovecraftianHorror/vdf-pest | a9f3966b7ec7b389a18351d6469749ce8c93253d |
#![allow(renamed_and_removed_lints)]
#![allow(clippy::unknown_clippy_lints)]
#![allow(clippy::upper_case_acronyms)]
use pest::{iterators::Pair as PestPair, Parser};
use pest_derive::Parser;
use std::borrow::Cow;
use crate::{error::Result, Obj, PartialVdf as Vdf, Value};
macro_rules! common_parsing {
($parser:ty, $rule:ty, $parse_escaped:expr) => {
pub fn parse<'a>(s: &'a str) -> Result<Vdf<'a>> {
let mut full_grammar = <$parser>::parse(<$rule>::vdf, s)?;
let mut bases = Vec::new();
loop {
let pair = full_grammar.next().unwrap();
if let <$rule>::base_macro = pair.as_rule() {
let base_path_string = pair.into_inner().next().unwrap();
let base_path = match base_path_string.as_rule() {
<$rule>::quoted_raw_string => base_path_string.into_inner().next().unwrap(),
<$rule>::unquoted_string => base_path_string,
_ => unreachable!("Prevented by grammar"),
}
.as_str();
bases.push(Cow::from(base_path));
} else {
let (key, value) = parse_pair(pair);
return Ok(Vdf { key, value, bases });
}
}
}
fn parse_pair(grammar_pair: PestPair<'_, $rule>) -> (Cow<'_, str>, Value<'_>) {
if let <$rule>::pair = grammar_pair.as_rule() {
let mut grammar_pair_innards = grammar_pair.into_inner();
let grammar_string = grammar_pair_innards.next().unwrap();
let key = parse_string(grammar_string);
let grammar_value = grammar_pair_innards.next().unwrap();
let value = Value::from(grammar_value);
(key, value)
} else {
unreachable!("Prevented by grammar");
}
}
fn parse_string(grammar_string: PestPair<'_, $rule>) -> Cow<'_, str> {
match grammar_string.as_rule() {
<$rule>::quoted_string => {
let quoted_inner = grammar_string.into_inner().next().unwrap();
if $parse_escaped {
parse_escaped_string(quoted_inner)
} else {
Cow::from(quoted_inner.as_str())
}
}
<$rule>::unquoted_string => {
let s = grammar_string.as_str();
Cow::from(s)
}
_ => unreachable!("Prevented by grammar"),
}
}
fn parse_escaped_string(inner: PestPair<'_, $rule>) -> Cow<'_, str> {
let s = inner.as_str();
if s.contains('\\') {
let mut escaped = String::with_capacity(s.len());
let mut it = s.chars();
while let Some(ch) = it.next() {
if ch == '\\' {
match it.next() {
Some('n') => escaped.push('\n'),
Some('r') => escaped.push('\r'),
Some('t') => escaped.push('\t'),
Some('\\') => escaped.push('\\'),
Some('\"') => escaped.push('\"'),
_ => unreachable!("Prevented by grammar"),
}
} else {
escaped.push(ch)
}
}
Cow::from(escaped)
} else {
Cow::from(s)
}
}
impl<'a> From<PestPair<'a, $rule>> for Value<'a> {
fn from(grammar_value: PestPair<'a, $rule>) -> Self {
match grammar_value.as_rule() {
<$rule>::quoted_string | <$rule>::unquoted_string => {
Self::Str(parse_string(grammar_value))
}
<$rule>::obj => {
let mut obj = Obj::new();
for grammar_pair in grammar_value.into_inner() {
let (key, value) = parse_pair(grammar_pair);
let entry = obj.entry(key).or_default();
(*entry).push(value);
}
Self::Obj(obj)
}
_ => unreachable!("Prevented by grammar"),
}
}
}
};
}
pub use escaped::{parse as escaped_parse, PestError as EscapedPestError};
pub use raw::{parse as raw_parse, PestError as RawPestError};
impl<'a> Vdf<'a> {
pub fn parse(s: &'a str) -> Result<Self> {
escaped_parse(s)
}
pub fn parse_raw(s: &'a str) -> Result<Self> {
raw_parse(s)
}
}
impl<'a> crate::Vdf<'a> {
pub fn parse(s: &'a str) -> Result<Self> {
Ok(crate::Vdf::from(Vdf::parse(s)?))
}
pub fn parse_raw(s: &'a str) -> Result<Self> {
Ok(crate::Vdf::from(Vdf::parse_raw(s)?))
}
}
mod escaped {
use super::*;
#[derive(Parser)]
#[grammar = "grammars/escaped.pest"]
struct EscapedParser;
pub type PestError = pest::error::Error<Rule>;
common_parsing!(EscapedParser, Rule, true);
}
mod raw {
use super::*;
#[derive(Parser)]
#[grammar = "grammars/raw.pest"]
struct RawParser;
pub type PestError = pest::error::Error<Rule>;
common_parsing!(RawParser, Rule, false);
}
|
#![allow(renamed_and_removed_lints)]
#![allow(clippy::unknown_clippy_lints)]
#![allow(clippy::upper_case_acronyms)]
use pest::{iterators::Pair as PestPair, Parser};
use pest_derive::Parser;
use std::borrow::Cow;
use crate::{error::Result, Obj, PartialVdf as Vdf, Value};
macro_rules! common_parsing {
($parser:ty, $rule:ty, $parse_escaped:expr) => {
pub fn parse<'a>(s: &'a str) -> Result<Vdf<'a>> {
let mut full_grammar = <$parser>::parse(<$rule>::vdf, s)?;
let mut bases = Vec::new();
loop {
let pair = full_grammar.next().unwrap();
if let <$rule>::base_macro = pair.as_rule() {
let base_path_string = pair.into_inner().next().unwrap();
let base_path = match base_path_string.as_rule() {
<$rule>::quoted_raw_string => base_path_string.into_inner().next().unwrap(),
<$rule>::unquoted_string => base_path_string,
_ => unreachable!("Prevented by grammar"),
}
.as_str();
bases.push(Cow::from(base_path));
} else {
let (key, value) = parse_pair(pair);
return Ok(Vdf { key, value, bases });
}
}
}
fn parse_pair(grammar_pair: PestPair<'_, $rule>) -> (Cow<'_, str>, Value<'_>) {
if let <$rule>::pair = grammar_pair.as_rule() {
let mut grammar_pair_innards = grammar_pair.into_inner();
let grammar_string = grammar_pair_innards.next().unwrap();
let key = parse_string(grammar_string);
let grammar_value = grammar_pair_innards.next().unwrap();
let value = Value::from(grammar_value);
(key, value)
} else {
unreachable!("Prevented by grammar");
}
}
fn parse_string(grammar_string: PestPair<'_, $rule>) -> Cow<'_, str> {
match grammar_string.as_rule() {
<$rule>::quoted_string => {
let quoted_inner = grammar_string.into_inner().next().unwrap();
if $parse_escaped {
parse_escaped_string(quoted_inner)
} else {
Cow::from(quoted_inner.as_str())
}
}
<$rule>::unquoted_string => {
let s = grammar_string.as_str();
Cow::from(s)
}
_ => unreachable!("Prevented by grammar"),
}
}
fn parse_escaped_string(inner: PestPair<'_, $rule>) -> Cow<'_, str> {
let s = inner.as_str();
if s.contains('\\') {
let mut escaped = String::with_capacity(s.len());
let mut it = s.chars();
while let Some(ch) = it.next() {
if ch == '\\' {
match it.next() {
Some('n') => escaped.push('\n'),
Some('r') => escaped. | rser)]
#[grammar = "grammars/escaped.pest"]
struct EscapedParser;
pub type PestError = pest::error::Error<Rule>;
common_parsing!(EscapedParser, Rule, true);
}
mod raw {
use super::*;
#[derive(Parser)]
#[grammar = "grammars/raw.pest"]
struct RawParser;
pub type PestError = pest::error::Error<Rule>;
common_parsing!(RawParser, Rule, false);
}
| push('\r'),
Some('t') => escaped.push('\t'),
Some('\\') => escaped.push('\\'),
Some('\"') => escaped.push('\"'),
_ => unreachable!("Prevented by grammar"),
}
} else {
escaped.push(ch)
}
}
Cow::from(escaped)
} else {
Cow::from(s)
}
}
impl<'a> From<PestPair<'a, $rule>> for Value<'a> {
fn from(grammar_value: PestPair<'a, $rule>) -> Self {
match grammar_value.as_rule() {
<$rule>::quoted_string | <$rule>::unquoted_string => {
Self::Str(parse_string(grammar_value))
}
<$rule>::obj => {
let mut obj = Obj::new();
for grammar_pair in grammar_value.into_inner() {
let (key, value) = parse_pair(grammar_pair);
let entry = obj.entry(key).or_default();
(*entry).push(value);
}
Self::Obj(obj)
}
_ => unreachable!("Prevented by grammar"),
}
}
}
};
}
pub use escaped::{parse as escaped_parse, PestError as EscapedPestError};
pub use raw::{parse as raw_parse, PestError as RawPestError};
impl<'a> Vdf<'a> {
pub fn parse(s: &'a str) -> Result<Self> {
escaped_parse(s)
}
pub fn parse_raw(s: &'a str) -> Result<Self> {
raw_parse(s)
}
}
impl<'a> crate::Vdf<'a> {
pub fn parse(s: &'a str) -> Result<Self> {
Ok(crate::Vdf::from(Vdf::parse(s)?))
}
pub fn parse_raw(s: &'a str) -> Result<Self> {
Ok(crate::Vdf::from(Vdf::parse_raw(s)?))
}
}
mod escaped {
use super::*;
#[derive(Pa | random | [
{
"content": "/// Serialize the `value` into an IO stream of VDF text with a custom top level VDF key\n\n///\n\n/// # Errors\n\n///\n\n/// This will return an error if the input can't be represented with valid VDF\n\npub fn to_writer_with_key<W, T>(writer: &mut W, value: &T, key: &str) -> Result<()>\n\nwhere\n\... |
Rust | agent/test-agent/tests/mock.rs | webern/bottlerocket-test-system | 6b523be719c79449784ae75b7bc18056d857aa89 | /*!
The purpose of this test is to demonstrate the mocking of a [`Client`] and a [`Bootstrap`] in order
to test a [`Runner`] with the [`TestAgent`].
!*/
use async_trait::async_trait;
use model::{Configuration, Outcome};
use serde::{Deserialize, Serialize};
use std::fmt::{Debug, Display};
use std::path::PathBuf;
use tempfile::{tempdir, TempDir};
use test_agent::{BootstrapData, Client, Runner};
use test_agent::{Spec, TestResults};
use tokio::time::{sleep, Duration};
struct MyRunner {
_spec: Spec<MyConfig>,
}
#[derive(Debug, Default, Clone, Copy, Serialize, Deserialize)]
struct MyConfig {}
impl Configuration for MyConfig {}
#[async_trait]
impl Runner for MyRunner {
type C = MyConfig;
type E = String;
async fn new(spec: Spec<Self::C>) -> Result<Self, Self::E> {
Ok(Self { _spec: spec })
}
async fn run(&mut self) -> Result<TestResults, Self::E> {
println!("MyRunner::run");
for i in 1..=5 {
println!("Hello {}", i);
sleep(Duration::from_millis(50)).await;
}
Ok(TestResults {
outcome: Outcome::Pass,
..TestResults::default()
})
}
async fn terminate(&mut self) -> Result<(), Self::E> {
println!("MyRunner::terminate");
Ok(())
}
}
struct MockClient {
results_dir: TempDir,
results_file: TempDir,
}
#[async_trait]
impl Client for MockClient {
type E = String;
async fn new(_: BootstrapData) -> Result<Self, Self::E> {
Ok(Self {
results_dir: tempdir().unwrap(),
results_file: tempdir().unwrap(),
})
}
async fn spec<C>(&self) -> Result<Spec<C>, Self::E>
where
C: Configuration,
{
println!("MockClient::get");
Ok(Spec {
name: "mock-test".into(),
configuration: C::default(),
secrets: Default::default(),
results_dir: Default::default(),
})
}
async fn send_test_starting(&self) -> Result<(), Self::E> {
println!("MockClient::send_test_starting");
Ok(())
}
async fn send_test_done(&self, results: TestResults) -> Result<(), Self::E> {
println!("MockClient::send_test_done: {:?}", results);
Ok(())
}
async fn send_test_results(&self, results: TestResults) -> Result<(), Self::E> {
println!("MockClient::send_test_results: {:?}", results);
Ok(())
}
async fn send_error<E>(&self, error: E) -> Result<(), Self::E>
where
E: Debug + Display + Send + Sync,
{
println!("MockClient::send_error {}", error);
Ok(())
}
async fn keep_running(&self) -> Result<bool, Self::E> {
Ok(false)
}
async fn results_directory(&self) -> Result<PathBuf, Self::E> {
Ok(self.results_dir.path().to_path_buf())
}
async fn results_file(&self) -> Result<PathBuf, Self::E> {
Ok(self.results_file.path().join("result.tar.gz"))
}
async fn retries(&self) -> Result<u32, Self::E> {
Ok(0)
}
}
#[tokio::test]
async fn mock_test() -> std::io::Result<()> {
let mut agent_main = test_agent::TestAgent::<MockClient, MyRunner>::new(BootstrapData {
test_name: String::from("hello-test"),
})
.await
.unwrap();
agent_main.run().await.unwrap();
assert!(std::path::Path::new(&agent_main.results_file().await.unwrap()).is_file());
Ok(())
}
| /*!
The purpose of this test is to demonstrate the mocking of a [`Client`] and a [`Bootstrap`] in order
to test a [`Runner`] with the [`TestAgent`].
!*/
use async_trait::async_trait;
use model::{Configuration, Outcome};
use serde::{Deserialize, Serialize};
use std::fmt::{Debug, Display};
use std::path::PathBuf;
use tempfile::{tempdir, TempDir};
use test_agent::{BootstrapData, Client, Runner};
use test_agent::{Spec, TestResults};
use tokio::time::{sleep, Duration};
struct MyRunner {
_spec: Spec<MyConfig>,
}
#[derive(Debug, Default, Clone, Copy, Serialize, Deserialize)]
struct MyConfig {}
impl Configuration for MyConfig {}
#[async_trait]
impl Runner for MyRunner {
type C = MyConfig;
type E = String;
async fn new(spec: Spec<Self::C>) -> Result<Self, Self::E> {
Ok(Self { _spec: spec })
}
async fn run(&mut self) -> Result<Tes | _main.run().await.unwrap();
assert!(std::path::Path::new(&agent_main.results_file().await.unwrap()).is_file());
Ok(())
}
| tResults, Self::E> {
println!("MyRunner::run");
for i in 1..=5 {
println!("Hello {}", i);
sleep(Duration::from_millis(50)).await;
}
Ok(TestResults {
outcome: Outcome::Pass,
..TestResults::default()
})
}
async fn terminate(&mut self) -> Result<(), Self::E> {
println!("MyRunner::terminate");
Ok(())
}
}
struct MockClient {
results_dir: TempDir,
results_file: TempDir,
}
#[async_trait]
impl Client for MockClient {
type E = String;
async fn new(_: BootstrapData) -> Result<Self, Self::E> {
Ok(Self {
results_dir: tempdir().unwrap(),
results_file: tempdir().unwrap(),
})
}
async fn spec<C>(&self) -> Result<Spec<C>, Self::E>
where
C: Configuration,
{
println!("MockClient::get");
Ok(Spec {
name: "mock-test".into(),
configuration: C::default(),
secrets: Default::default(),
results_dir: Default::default(),
})
}
async fn send_test_starting(&self) -> Result<(), Self::E> {
println!("MockClient::send_test_starting");
Ok(())
}
async fn send_test_done(&self, results: TestResults) -> Result<(), Self::E> {
println!("MockClient::send_test_done: {:?}", results);
Ok(())
}
async fn send_test_results(&self, results: TestResults) -> Result<(), Self::E> {
println!("MockClient::send_test_results: {:?}", results);
Ok(())
}
async fn send_error<E>(&self, error: E) -> Result<(), Self::E>
where
E: Debug + Display + Send + Sync,
{
println!("MockClient::send_error {}", error);
Ok(())
}
async fn keep_running(&self) -> Result<bool, Self::E> {
Ok(false)
}
async fn results_directory(&self) -> Result<PathBuf, Self::E> {
Ok(self.results_dir.path().to_path_buf())
}
async fn results_file(&self) -> Result<PathBuf, Self::E> {
Ok(self.results_file.path().join("result.tar.gz"))
}
async fn retries(&self) -> Result<u32, Self::E> {
Ok(0)
}
}
#[tokio::test]
async fn mock_test() -> std::io::Result<()> {
let mut agent_main = test_agent::TestAgent::<MockClient, MyRunner>::new(BootstrapData {
test_name: String::from("hello-test"),
})
.await
.unwrap();
agent | random | [
{
"content": "/// Print a value using `serde_json` `to_string_pretty` for types that implement Serialize.\n\npub fn json_display<T: Serialize>(object: T) -> String {\n\n serde_json::to_string_pretty(&object).unwrap_or_else(|e| format!(\"Serialization failed: {}\", e))\n\n}\n\n\n\n/// Implement `Display` usin... |
Rust | demo/src/features/mesh/jobs/write.rs | jlowry/rafx | 515aeeae3e57e1c520e320316197326294fc099e | use rafx::render_feature_write_job_prelude::*;
use rafx::api::RafxPrimitiveTopology;
use rafx::framework::{VertexDataLayout, VertexDataSetLayout};
use serde::{Deserialize, Serialize};
#[derive(Copy, Clone, Debug, Serialize, Deserialize, Default)]
#[repr(C)]
pub struct MeshVertex {
pub position: [f32; 3],
pub normal: [f32; 3],
pub tangent: [f32; 4],
pub tex_coord: [f32; 2],
}
lazy_static::lazy_static! {
pub static ref MESH_VERTEX_LAYOUT : VertexDataSetLayout = {
use rafx::api::RafxFormat;
VertexDataLayout::build_vertex_layout(&MeshVertex::default(), |builder, vertex| {
builder.add_member(&vertex.position, "POSITION", RafxFormat::R32G32B32_SFLOAT);
builder.add_member(&vertex.normal, "NORMAL", RafxFormat::R32G32B32_SFLOAT);
builder.add_member(&vertex.tangent, "TANGENT", RafxFormat::R32G32B32A32_SFLOAT);
builder.add_member(&vertex.tex_coord, "TEXCOORD", RafxFormat::R32G32_SFLOAT);
}).into_set(RafxPrimitiveTopology::TriangleList)
};
}
use super::ExtractedFrameNodeMeshData;
use rafx::api::{RafxIndexBufferBinding, RafxIndexType, RafxVertexBufferBinding};
use rafx::framework::{DescriptorSetArc, MaterialPassResource, ResourceArc};
use rafx::nodes::{FrameNodeIndex, PerViewNode};
struct PreparedSubmitNodeMeshData {
material_pass_resource: ResourceArc<MaterialPassResource>,
per_view_descriptor_set: DescriptorSetArc,
per_material_descriptor_set: Option<DescriptorSetArc>,
per_instance_descriptor_set: DescriptorSetArc,
frame_node_index: FrameNodeIndex,
mesh_part_index: usize,
}
impl std::fmt::Debug for PreparedSubmitNodeMeshData {
fn fmt(
&self,
f: &mut std::fmt::Formatter<'_>,
) -> std::fmt::Result {
f.debug_struct("PreparedSubmitNodeMeshData")
.field("frame_node_index", &self.frame_node_index)
.field("mesh_part_index", &self.mesh_part_index)
.finish()
}
}
pub struct MeshWriteJob {
extracted_frame_node_mesh_data: Vec<Option<ExtractedFrameNodeMeshData>>,
prepared_submit_node_mesh_data: Vec<PreparedSubmitNodeMeshData>,
}
impl MeshWriteJob {
pub fn new() -> Self {
MeshWriteJob {
extracted_frame_node_mesh_data: Default::default(),
prepared_submit_node_mesh_data: Default::default(),
}
}
pub fn push_submit_node(
&mut self,
view_node: &PerViewNode,
per_view_descriptor_set: DescriptorSetArc,
per_material_descriptor_set: Option<DescriptorSetArc>,
per_instance_descriptor_set: DescriptorSetArc,
mesh_part_index: usize,
material_pass_resource: ResourceArc<MaterialPassResource>,
) -> usize {
let submit_node_index = self.prepared_submit_node_mesh_data.len();
self.prepared_submit_node_mesh_data
.push(PreparedSubmitNodeMeshData {
material_pass_resource: material_pass_resource.clone(),
per_view_descriptor_set,
per_material_descriptor_set,
per_instance_descriptor_set,
frame_node_index: view_node.frame_node_index(),
mesh_part_index,
});
submit_node_index
}
pub fn set_extracted_frame_node_mesh_data(
&mut self,
extracted_frame_node_mesh_data: Vec<Option<ExtractedFrameNodeMeshData>>,
) {
self.extracted_frame_node_mesh_data = extracted_frame_node_mesh_data;
}
}
impl WriteJob for MeshWriteJob {
fn render_element(
&self,
write_context: &mut RenderJobWriteContext,
_view: &RenderView,
render_phase_index: RenderPhaseIndex,
index: SubmitNodeId,
) -> RafxResult<()> {
profiling::scope!(super::RENDER_ELEMENT_SCOPE_NAME);
let command_buffer = &write_context.command_buffer;
let render_node_data = &self.prepared_submit_node_mesh_data[index as usize];
let frame_node_data: &ExtractedFrameNodeMeshData = self.extracted_frame_node_mesh_data
[render_node_data.frame_node_index as usize]
.as_ref()
.unwrap();
let mesh_part = &frame_node_data.mesh_asset.inner.mesh_parts
[render_node_data.mesh_part_index]
.as_ref()
.unwrap();
let pipeline = write_context
.resource_context
.graphics_pipeline_cache()
.get_or_create_graphics_pipeline(
render_phase_index,
&render_node_data.material_pass_resource,
&write_context.render_target_meta,
&*MESH_VERTEX_LAYOUT,
)?;
command_buffer.cmd_bind_pipeline(&pipeline.get_raw().pipeline)?;
render_node_data
.per_view_descriptor_set
.bind(command_buffer)?;
if let Some(per_material_descriptor_set) = &render_node_data.per_material_descriptor_set {
per_material_descriptor_set.bind(command_buffer).unwrap();
}
render_node_data
.per_instance_descriptor_set
.bind(command_buffer)?;
command_buffer.cmd_bind_vertex_buffers(
0,
&[RafxVertexBufferBinding {
buffer: &frame_node_data
.mesh_asset
.inner
.vertex_buffer
.get_raw()
.buffer,
byte_offset: mesh_part.vertex_buffer_offset_in_bytes as u64,
}],
)?;
command_buffer.cmd_bind_index_buffer(&RafxIndexBufferBinding {
buffer: &frame_node_data
.mesh_asset
.inner
.index_buffer
.get_raw()
.buffer,
byte_offset: mesh_part.index_buffer_offset_in_bytes as u64,
index_type: RafxIndexType::Uint16,
})?;
command_buffer.cmd_draw_indexed(
mesh_part.index_buffer_size_in_bytes / 2,
0,
0,
)?;
Ok(())
}
fn feature_debug_name(&self) -> &'static str {
super::render_feature_debug_name()
}
fn feature_index(&self) -> RenderFeatureIndex {
super::render_feature_index()
}
}
| use rafx::render_feature_write_job_prelude::*;
use rafx::api::RafxPrimitiveTopology;
use rafx::framework::{VertexDataLayout, VertexDataSetLayout};
use serde::{Deserialize, Serialize};
#[derive(Copy, Clone, Debug, Serialize, Deserialize, Default)]
#[repr(C)]
pub struct MeshVertex {
pub position: [f32; 3],
pub normal: [f32; 3],
pub tangent: [f32; 4],
pub tex_coord: [f32; 2],
}
lazy_static::lazy_static! {
pub static ref MESH_VERTEX_LAYOUT : VertexDataSetLayout = {
use rafx::api::RafxFormat;
VertexDataLayout::build_vertex_layout(&MeshVertex::default(), |builder, vertex| {
builder.add_member(&vertex.position, "POSITION", RafxFormat::R32G32B32_SFLOAT);
builder.add_member(&vertex.normal, "NORMAL", RafxFormat::R32G32B32_SFLOAT);
builder.add_member(&vertex.tangent, "TANGENT", RafxFormat::R32G32B32A32_SFLOAT);
builder.add_member(&vertex.tex_coord, "TEXCOORD", RafxFormat::R32G32_SFLOAT);
}).into_set(RafxPrimitiveTopology::TriangleList)
};
}
use super::ExtractedFrameNodeMeshData;
use rafx::api::{RafxIndexBufferBinding, RafxIndexType, RafxVertexBufferBinding};
use rafx::framework::{DescriptorSetArc, MaterialPassResource, ResourceArc};
use rafx::nodes::{FrameNodeIndex, PerViewNode};
struct PreparedSubmitNodeMeshData {
material_pass_resource: ResourceArc<MaterialPassResource>,
per_view_descriptor_set: DescriptorSetArc,
per_material_descriptor_set: Option<DescriptorSetArc>,
per_instance_descriptor_set: DescriptorSetArc,
frame_node_index: FrameNodeIndex,
mesh_part_index: usize,
}
impl std::fmt::Debug for PreparedSubmitNodeMeshData {
fn fmt(
&self,
f: &mut std::fmt::Formatter<'_>,
) -> std::fmt::Result {
f.debug_struct("PreparedSubmitNodeMeshData")
.field("frame_node_index", &self.frame_node_index)
.field("mesh_part_index", &self.mesh_part_index)
.finish()
}
}
pub struct MeshWriteJob {
extracted_frame_node_mesh_data: Vec<Option<ExtractedFrameNodeMeshData>>,
prepared_submit_node_mesh_data: Vec<PreparedSubmitNodeMeshData>,
}
impl MeshWriteJob {
pub fn new() -> Self {
MeshWriteJob {
extracted_frame_node_mesh_data: Default::default(),
prepared_submit_node_mesh_data: Default::default(),
}
}
pub fn push_submit_node(
&mut self,
view_node: &PerViewNode,
per_view_descriptor_set: DescriptorSetArc,
per_material_descriptor_set: Option<DescriptorSetArc>,
per_instance_descriptor_set: DescriptorSetArc,
mesh_part_index: usize,
material_pass_resource: ResourceArc<MaterialPassResource>,
) -> usize {
let submit_node_index = self.prepared_submit_node_mesh_data.len();
self.prepared_submit_node_mesh_data
.push(PreparedSubmitNodeMeshData {
material_pass_resource: material_pass_resource.clone(),
per_view_descriptor_set,
per_material_descriptor_set,
per_instance_descriptor_set,
frame_node_index: view_node.frame_node_index(),
mesh_part_index,
});
submit_node_index
}
|
}
impl WriteJob for MeshWriteJob {
fn render_element(
&self,
write_context: &mut RenderJobWriteContext,
_view: &RenderView,
render_phase_index: RenderPhaseIndex,
index: SubmitNodeId,
) -> RafxResult<()> {
profiling::scope!(super::RENDER_ELEMENT_SCOPE_NAME);
let command_buffer = &write_context.command_buffer;
let render_node_data = &self.prepared_submit_node_mesh_data[index as usize];
let frame_node_data: &ExtractedFrameNodeMeshData = self.extracted_frame_node_mesh_data
[render_node_data.frame_node_index as usize]
.as_ref()
.unwrap();
let mesh_part = &frame_node_data.mesh_asset.inner.mesh_parts
[render_node_data.mesh_part_index]
.as_ref()
.unwrap();
let pipeline = write_context
.resource_context
.graphics_pipeline_cache()
.get_or_create_graphics_pipeline(
render_phase_index,
&render_node_data.material_pass_resource,
&write_context.render_target_meta,
&*MESH_VERTEX_LAYOUT,
)?;
command_buffer.cmd_bind_pipeline(&pipeline.get_raw().pipeline)?;
render_node_data
.per_view_descriptor_set
.bind(command_buffer)?;
if let Some(per_material_descriptor_set) = &render_node_data.per_material_descriptor_set {
per_material_descriptor_set.bind(command_buffer).unwrap();
}
render_node_data
.per_instance_descriptor_set
.bind(command_buffer)?;
command_buffer.cmd_bind_vertex_buffers(
0,
&[RafxVertexBufferBinding {
buffer: &frame_node_data
.mesh_asset
.inner
.vertex_buffer
.get_raw()
.buffer,
byte_offset: mesh_part.vertex_buffer_offset_in_bytes as u64,
}],
)?;
command_buffer.cmd_bind_index_buffer(&RafxIndexBufferBinding {
buffer: &frame_node_data
.mesh_asset
.inner
.index_buffer
.get_raw()
.buffer,
byte_offset: mesh_part.index_buffer_offset_in_bytes as u64,
index_type: RafxIndexType::Uint16,
})?;
command_buffer.cmd_draw_indexed(
mesh_part.index_buffer_size_in_bytes / 2,
0,
0,
)?;
Ok(())
}
fn feature_debug_name(&self) -> &'static str {
super::render_feature_debug_name()
}
fn feature_index(&self) -> RenderFeatureIndex {
super::render_feature_index()
}
}
| pub fn set_extracted_frame_node_mesh_data(
&mut self,
extracted_frame_node_mesh_data: Vec<Option<ExtractedFrameNodeMeshData>>,
) {
self.extracted_frame_node_mesh_data = extracted_frame_node_mesh_data;
} | function_block-full_function | [
{
"content": "pub fn default_daemon() -> distill::daemon::AssetDaemon {\n\n use crate::assets::*;\n\n\n\n distill::daemon::AssetDaemon::default()\n\n .with_importer(\"sampler\", SamplerImporter)\n\n .with_importer(\"material\", MaterialImporter)\n\n .with_importer(\"materialinstance\"... |
Rust | src/transforms/rename_fields.rs | zcapper/vector | 560fd106fc9a60c12ddf2c32e31ad4f2031ff1f5 | use super::Transform;
use crate::{
event::Event,
topology::config::{DataType, TransformConfig, TransformContext, TransformDescription},
};
use indexmap::map::IndexMap;
use serde::{Deserialize, Serialize};
use snafu::Snafu;
use string_cache::DefaultAtom as Atom;
use toml::value::Value as TomlValue;
#[derive(Deserialize, Serialize, Debug)]
#[serde(deny_unknown_fields)]
pub struct RenameFieldsConfig {
pub fields: IndexMap<String, TomlValue>,
}
pub struct RenameFields {
fields: IndexMap<Atom, Atom>,
}
inventory::submit! {
TransformDescription::new_without_default::<RenameFieldsConfig>("rename_fields")
}
#[typetag::serde(name = "rename_fields")]
impl TransformConfig for RenameFieldsConfig {
fn build(&self, _exec: TransformContext) -> crate::Result<Box<dyn Transform>> {
Ok(Box::new(RenameFields::new(self.fields.clone())?))
}
fn input_type(&self) -> DataType {
DataType::Log
}
fn output_type(&self) -> DataType {
DataType::Log
}
fn transform_type(&self) -> &'static str {
"rename_fields"
}
}
impl RenameFields {
pub fn new(fields: IndexMap<String, TomlValue>) -> crate::Result<Self> {
Ok(RenameFields {
fields: fields
.into_iter()
.map(|kv| flatten(kv, None))
.collect::<crate::Result<_>>()?,
})
}
}
#[derive(Debug, Eq, PartialEq, Snafu)]
enum FlattenError {
#[snafu(display(
"The key {:?} cannot be flattened. Is it a plain string or a `a.b.c` style map?",
key
))]
CannotFlatten { key: String },
}
fn flatten(kv: (String, TomlValue), prequel: Option<String>) -> crate::Result<(Atom, Atom)> {
let (k, v) = kv;
match v {
TomlValue::String(s) => match prequel {
Some(prequel) => Ok((format!("{}.{}", prequel, k).into(), s.into())),
None => Ok((k.into(), s.into())),
},
TomlValue::Table(map) => {
if map.len() > 1 {
Err(Box::new(FlattenError::CannotFlatten { key: k }))
} else {
let sub_kv = map.into_iter().next().expect("Map of len 1 has no values");
let key = match prequel {
Some(prequel) => format!("{}.{}", prequel, k),
None => k,
};
flatten(sub_kv, Some(key))
}
}
TomlValue::Integer(_)
| TomlValue::Float(_)
| TomlValue::Boolean(_)
| TomlValue::Datetime(_)
| TomlValue::Array(_) => Err(Box::new(FlattenError::CannotFlatten { key: k })),
}
}
impl Transform for RenameFields {
fn transform(&mut self, mut event: Event) -> Option<Event> {
for (old_key, new_key) in &self.fields {
let log = event.as_mut_log();
if let Some(v) = log.remove(&old_key) {
log.insert(new_key.clone(), v)
}
}
Some(event)
}
}
#[cfg(test)]
mod tests {
use super::RenameFields;
use crate::{event::Event, transforms::Transform};
use indexmap::map::IndexMap;
#[test]
fn rename_fields() {
let mut event = Event::from("message");
event.as_mut_log().insert("to_move", "some value");
event.as_mut_log().insert("do_not_move", "not moved");
let mut fields = IndexMap::new();
fields.insert("to_move".into(), "moved".into());
fields.insert("not_present".into(), "should_not_exist".into());
let mut transform = RenameFields::new(fields).unwrap();
let new_event = transform.transform(event).unwrap();
assert!(new_event.as_log().get(&"to_move".into()).is_none());
assert_eq!(new_event.as_log()[&"moved".into()], "some value".into());
assert!(new_event.as_log().get(&"not_present".into()).is_none());
assert!(new_event.as_log().get(&"should_not_exist".into()).is_none());
assert_eq!(
new_event.as_log()[&"do_not_move".into()],
"not moved".into()
);
}
}
| use super::Transform;
use crate::{
event::Event,
topology::config::{DataType, TransformConfig, TransformContext, TransformDescription},
};
use indexmap::map::IndexMap;
use serde::{Deserialize, Serialize};
use snafu::Snafu;
use string_cache::DefaultAtom as Atom;
use toml::value::Value as TomlValue;
#[derive(Deserialize, Serialize, Debug)]
#[serde(deny_unknown_fields)]
pub struct RenameFieldsConfig {
pub fields: IndexMap<String, TomlValue>,
}
pub struct RenameFields {
fields: IndexMap<Atom, Atom>,
}
inventory::submit! {
TransformDescription::new_without_default::<RenameFieldsConfig>("rename_fields")
}
#[typetag::serde(name = "rename_fields")]
impl TransformConfig for RenameFieldsConfig {
fn build(&self, _exec: TransformContext) -> crate::Result<Box<dyn Transform>> {
Ok(Box::new(RenameFields::new(self.fields.clone())?))
}
fn input_type(&self) -> DataType {
DataType::Log
}
fn output_type(&self) -> DataType {
DataType::Log
}
fn transform_type(&self) -> &'static str {
"rename_fields"
}
}
impl RenameFields {
pub fn new(fields: IndexMap<String, TomlValue>) -> crate::Result<Self> {
|
}
}
#[derive(Debug, Eq, PartialEq, Snafu)]
enum FlattenError {
#[snafu(display(
"The key {:?} cannot be flattened. Is it a plain string or a `a.b.c` style map?",
key
))]
CannotFlatten { key: String },
}
fn flatten(kv: (String, TomlValue), prequel: Option<String>) -> crate::Result<(Atom, Atom)> {
let (k, v) = kv;
match v {
TomlValue::String(s) => match prequel {
Some(prequel) => Ok((format!("{}.{}", prequel, k).into(), s.into())),
None => Ok((k.into(), s.into())),
},
TomlValue::Table(map) => {
if map.len() > 1 {
Err(Box::new(FlattenError::CannotFlatten { key: k }))
} else {
let sub_kv = map.into_iter().next().expect("Map of len 1 has no values");
let key = match prequel {
Some(prequel) => format!("{}.{}", prequel, k),
None => k,
};
flatten(sub_kv, Some(key))
}
}
TomlValue::Integer(_)
| TomlValue::Float(_)
| TomlValue::Boolean(_)
| TomlValue::Datetime(_)
| TomlValue::Array(_) => Err(Box::new(FlattenError::CannotFlatten { key: k })),
}
}
impl Transform for RenameFields {
fn transform(&mut self, mut event: Event) -> Option<Event> {
for (old_key, new_key) in &self.fields {
let log = event.as_mut_log();
if let Some(v) = log.remove(&old_key) {
log.insert(new_key.clone(), v)
}
}
Some(event)
}
}
#[cfg(test)]
mod tests {
use super::RenameFields;
use crate::{event::Event, transforms::Transform};
use indexmap::map::IndexMap;
#[test]
fn rename_fields() {
let mut event = Event::from("message");
event.as_mut_log().insert("to_move", "some value");
event.as_mut_log().insert("do_not_move", "not moved");
let mut fields = IndexMap::new();
fields.insert("to_move".into(), "moved".into());
fields.insert("not_present".into(), "should_not_exist".into());
let mut transform = RenameFields::new(fields).unwrap();
let new_event = transform.transform(event).unwrap();
assert!(new_event.as_log().get(&"to_move".into()).is_none());
assert_eq!(new_event.as_log()[&"moved".into()], "some value".into());
assert!(new_event.as_log().get(&"not_present".into()).is_none());
assert!(new_event.as_log().get(&"should_not_exist".into()).is_none());
assert_eq!(
new_event.as_log()[&"do_not_move".into()],
"not moved".into()
);
}
}
| Ok(RenameFields {
fields: fields
.into_iter()
.map(|kv| flatten(kv, None))
.collect::<crate::Result<_>>()?,
}) | call_expression | [
{
"content": "/// Iterates over all paths in form \"a.b[0].c[1]\" in alphabetical order.\n\n/// It is implemented as a wrapper around `all_fields` to reduce code\n\n/// duplication.\n\npub fn keys<'a>(fields: &'a BTreeMap<Atom, Value>) -> impl Iterator<Item = Atom> + 'a {\n\n all_fields(fields).map(|(k, _)| ... |
Rust | src/netlink-generic/message.rs | qinqon/nispor | 86e8a54cba6ad8161bfa78fa683bd114a3ed7799 |
use anyhow::Context;
use netlink_packet_core::{
DecodeError, NetlinkDeserializable, NetlinkHeader, NetlinkPayload,
NetlinkSerializable,
};
use netlink_packet_utils::{
nla::{DefaultNla, NlasIterator},
Emitable, Parseable, ParseableParametrized,
};
use crate::{
buffer::GENL_ID_CTRL, CtrlAttr, GenericNetlinkHeader,
GenericNetlinkMessageBuffer,
};
#[derive(Debug, PartialEq, Eq, Clone)]
pub enum GenericNetlinkAttr {
Ctrl(Vec<CtrlAttr>),
Other(Vec<DefaultNla>),
}
#[derive(Debug, PartialEq, Eq, Clone)]
pub struct GenericNetlinkMessage {
pub message_type: u16,
pub header: GenericNetlinkHeader,
pub nlas: GenericNetlinkAttr,
}
impl Emitable for GenericNetlinkMessage {
fn buffer_len(&self) -> usize {
self.header.buffer_len()
+ match &self.nlas {
GenericNetlinkAttr::Ctrl(nlas) => nlas.as_slice().buffer_len(),
GenericNetlinkAttr::Other(nlas) => nlas.as_slice().buffer_len(),
}
}
fn emit(&self, buffer: &mut [u8]) {
self.header.emit(buffer);
match &self.nlas {
GenericNetlinkAttr::Ctrl(nlas) => nlas
.as_slice()
.emit(&mut buffer[self.header.buffer_len()..]),
GenericNetlinkAttr::Other(nlas) => nlas
.as_slice()
.emit(&mut buffer[self.header.buffer_len()..]),
}
}
}
impl NetlinkSerializable<GenericNetlinkMessage> for GenericNetlinkMessage {
fn message_type(&self) -> u16 {
self.message_type
}
fn buffer_len(&self) -> usize {
<Self as Emitable>::buffer_len(self)
}
fn serialize(&self, buffer: &mut [u8]) {
self.emit(buffer)
}
}
impl NetlinkDeserializable<GenericNetlinkMessage> for GenericNetlinkMessage {
type Error = DecodeError;
fn deserialize(
header: &NetlinkHeader,
payload: &[u8],
) -> Result<Self, Self::Error> {
let buf = GenericNetlinkMessageBuffer::new(payload);
GenericNetlinkMessage::parse_with_param(&buf, header.message_type)
}
}
impl<'a, T: AsRef<[u8]> + ?Sized>
ParseableParametrized<GenericNetlinkMessageBuffer<&'a T>, u16>
for GenericNetlinkMessage
{
fn parse_with_param(
buf: &GenericNetlinkMessageBuffer<&'a T>,
message_type: u16,
) -> Result<Self, DecodeError> {
let header = GenericNetlinkHeader::parse(buf)
.context("failed to parse generic netlink message header")?;
match message_type {
GENL_ID_CTRL => {
match GenericNetlinkMessageBuffer::new_checked(&buf.inner()) {
Ok(buf) => Ok(GenericNetlinkMessage {
message_type,
header,
nlas: {
let mut nlas = Vec::new();
let error_msg =
"failed to parse control message attributes";
for nla in NlasIterator::new(buf.payload()) {
let nla = &nla.context(error_msg)?;
let parsed =
CtrlAttr::parse(nla).context(error_msg)?;
nlas.push(parsed);
}
GenericNetlinkAttr::Ctrl(nlas)
},
}),
Err(e) => Err(e),
}
}
_ => Err(format!("Unknown message type: {}", message_type).into()),
}
}
}
impl From<GenericNetlinkMessage> for NetlinkPayload<GenericNetlinkMessage> {
fn from(message: GenericNetlinkMessage) -> Self {
NetlinkPayload::InnerMessage(message)
}
}
|
use anyhow::Context;
use netlink_packet_core::{
DecodeError, NetlinkDeserializable, NetlinkHeader, NetlinkPayload,
NetlinkSerializable,
};
use netlink_packet_utils::{
nla::{DefaultNla, NlasIterator},
Emitable, Parseable, ParseableParametrized,
};
use crate::{
buffer::GENL_ID_CTRL, CtrlAttr, GenericNetlinkHeader,
GenericNetlinkMessageBuffer,
};
#[derive(Debug, PartialEq, Eq, Clone)]
pub enum GenericNetlinkAttr {
Ctrl(Vec<CtrlAttr>),
Other(Vec<DefaultNla>),
}
#[derive(Debug, PartialEq, Eq, Clone)]
pub struct GenericNetlinkMessage {
pub message_type: u16,
pub header: GenericNetlinkHeader,
pub nlas: GenericNetlinkAttr,
}
impl Emitable for GenericNetlinkMessage {
fn buffer_len(&self) -> usize {
self.header.buffer_len()
+ match &self.nlas {
GenericNetlinkAttr::Ctrl(nlas) => nlas.as_slice().buffer_len(),
GenericNetlinkAttr::Other(nlas) => nlas.as_slice().buffer_len(),
}
}
fn emit(&self, buffer: &mut [u8]) {
self.header.emit(b |
}
}
}
impl NetlinkSerializable<GenericNetlinkMessage> for GenericNetlinkMessage {
fn message_type(&self) -> u16 {
self.message_type
}
fn buffer_len(&self) -> usize {
<Self as Emitable>::buffer_len(self)
}
fn serialize(&self, buffer: &mut [u8]) {
self.emit(buffer)
}
}
impl NetlinkDeserializable<GenericNetlinkMessage> for GenericNetlinkMessage {
type Error = DecodeError;
fn deserialize(
header: &NetlinkHeader,
payload: &[u8],
) -> Result<Self, Self::Error> {
let buf = GenericNetlinkMessageBuffer::new(payload);
GenericNetlinkMessage::parse_with_param(&buf, header.message_type)
}
}
impl<'a, T: AsRef<[u8]> + ?Sized>
ParseableParametrized<GenericNetlinkMessageBuffer<&'a T>, u16>
for GenericNetlinkMessage
{
fn parse_with_param(
buf: &GenericNetlinkMessageBuffer<&'a T>,
message_type: u16,
) -> Result<Self, DecodeError> {
let header = GenericNetlinkHeader::parse(buf)
.context("failed to parse generic netlink message header")?;
match message_type {
GENL_ID_CTRL => {
match GenericNetlinkMessageBuffer::new_checked(&buf.inner()) {
Ok(buf) => Ok(GenericNetlinkMessage {
message_type,
header,
nlas: {
let mut nlas = Vec::new();
let error_msg =
"failed to parse control message attributes";
for nla in NlasIterator::new(buf.payload()) {
let nla = &nla.context(error_msg)?;
let parsed =
CtrlAttr::parse(nla).context(error_msg)?;
nlas.push(parsed);
}
GenericNetlinkAttr::Ctrl(nlas)
},
}),
Err(e) => Err(e),
}
}
_ => Err(format!("Unknown message type: {}", message_type).into()),
}
}
}
impl From<GenericNetlinkMessage> for NetlinkPayload<GenericNetlinkMessage> {
fn from(message: GenericNetlinkMessage) -> Self {
NetlinkPayload::InnerMessage(message)
}
}
| uffer);
match &self.nlas {
GenericNetlinkAttr::Ctrl(nlas) => nlas
.as_slice()
.emit(&mut buffer[self.header.buffer_len()..]),
GenericNetlinkAttr::Other(nlas) => nlas
.as_slice()
.emit(&mut buffer[self.header.buffer_len()..]), | function_block-random_span | [
{
"content": "fn feature_bits_emit(_feature_bits: &[FeatureBit], _buffer: &mut [u8]) {\n\n todo!(\"Does not support changing ethtool feature yet\")\n\n}\n\n\n\n#[derive(Debug, PartialEq, Eq, Clone)]\n\npub enum FeatureAttr {\n\n Header(Vec<EthtoolHeader>),\n\n Hw(Vec<FeatureBit>),\n\n Wanted(Vec<Fea... |
Rust | src/response/mod.rs | ferrum-rs/ferrum | 2bda0743d84632e95925d687d8cc03ef15e0ecc4 |
use std::fmt::{self, Debug};
use std::mem::replace;
use mime::Mime;
use typemap::{TypeMap, TypeMapInner};
use plugin::Extensible;
use hyper::{Body, HttpVersion};
use hyper::header::{ContentLength, ContentType, Location, Raw};
use {Plugin, Header, Headers, StatusCode};
pub use hyper::Response as HyperResponse;
pub mod content;
pub use self::content::*;
pub struct Response {
pub status: StatusCode,
pub headers: Headers,
pub body: Option<Body>,
pub extensions: TypeMap<TypeMapInner>,
}
impl Response {
#[inline]
pub fn new() -> Response {
Response {
status: Default::default(),
headers: Headers::new(),
body: None,
extensions: TypeMap::custom()
}
}
#[inline]
pub fn new_redirect<R: Into<Raw>>(location: R) -> Response {
let mut headers = Headers::new();
headers.set(Location::parse_header(&location.into()).unwrap());
Response {
status: StatusCode::Found,
headers,
body: None,
extensions: TypeMap::custom()
}
}
#[inline]
pub fn with_status(mut self, status: StatusCode) -> Self {
self.status = status;
self
}
#[inline]
pub fn with_header<H: Header>(mut self, header: H) -> Self {
self.headers.set(header);
self
}
#[inline]
pub fn with_headers(mut self, headers: Headers) -> Self {
self.headers = headers;
self
}
#[inline]
pub fn with_body<T: Into<Body>>(mut self, body: T) -> Self {
self.body = Some(body.into());
self
}
#[inline]
pub fn with_content<C: Into<Content>>(mut self, content: C, mime: Mime) -> Self {
self.set_content(content, mime);
self
}
#[inline]
pub fn set_content<C: Into<Content>>(&mut self, content: C, mime: Mime) {
let content = content.into();
self.headers.set(ContentType(mime));
self.headers.set(ContentLength(content.len() as u64));
self.body = Some(content.into());
self.status = StatusCode::Ok;
}
#[inline]
pub fn with_mime(mut self, mime: Mime) -> Self {
self.set_mime(mime);
self
}
#[inline]
pub fn set_mime(&mut self, mime: Mime) {
self.headers.set(ContentType(mime));
}
}
impl From<HyperResponse> for Response {
fn from(mut from_response: HyperResponse) -> Response {
Response {
status: from_response.status(),
headers: replace(from_response.headers_mut(), Headers::new()),
body: if from_response.body_ref().is_some() { Some(from_response.body()) } else { None },
extensions: TypeMap::custom()
}
}
}
impl From<Response> for HyperResponse {
fn from(from_response: Response) -> HyperResponse {
HyperResponse::new()
.with_status(from_response.status)
.with_headers(from_response.headers)
.with_body(from_response.body.unwrap_or_default())
}
}
impl Debug for Response {
fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
writeln!(formatter, "{} {}\n{}",
HttpVersion::default(),
self.status,
self.headers
)
}
}
impl fmt::Display for Response {
fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
Debug::fmt(self, formatter)
}
}
impl Extensible<TypeMapInner> for Response {
fn extensions(&self) -> &TypeMap<TypeMapInner> {
&self.extensions
}
fn extensions_mut(&mut self) -> &mut TypeMap<TypeMapInner> {
&mut self.extensions
}
}
impl Plugin for Response {}
#[cfg(test)]
mod test {
use super::*;
use hyper::header::{ContentType};
use futures::stream::Stream;
use futures::{future, Future};
use mime;
use std::str::from_utf8;
#[test]
fn test_create_response() {
let response = Response::new();
assert_eq!(response.status, StatusCode::Ok);
assert_eq!(response.headers, Headers::new());
assert!(response.body.is_none());
}
#[test]
fn test_response_from_hyper_response() {
let mut headers = Headers::new();
headers.set(ContentType(mime::TEXT_HTML));
let response = Response::from(
HyperResponse::new()
.with_status(StatusCode::NotFound)
.with_headers(headers.clone())
.with_body("Error")
);
assert_eq!(response.status, StatusCode::NotFound);
assert_eq!(response.headers, headers);
assert!(response.body.is_some());
let body = response.body.unwrap()
.concat2()
.and_then(|chunk| {
future::ok(String::from(from_utf8(&chunk).unwrap()))
})
.wait().unwrap();
assert_eq!(body, "Error");
}
#[test]
fn test_hyper_response_from_response() {
let mut headers = Headers::new();
headers.set(ContentType(mime::TEXT_HTML));
let response = HyperResponse::from(
Response {
status: StatusCode::NotFound,
headers: headers.clone(),
body: Some("Error".into()),
extensions: TypeMap::custom()
}
);
assert_eq!(response.status(), StatusCode::NotFound);
assert_eq!(response.headers(), &headers);
assert!(response.body_ref().is_some());
let body = response.body()
.concat2()
.and_then(|chunk| {
future::ok(String::from(from_utf8(&chunk).unwrap()))
})
.wait().unwrap();
assert_eq!(body, "Error");
}
} |
use std::fmt::{self, Debug};
use std::mem::replace;
use mime::Mime;
use typemap::{TypeMap, TypeMapInner};
use plugin::Extensible;
use hyper::{Body, HttpVersion};
use hyper::header::{ContentLength, ContentType, Location, Raw};
use {Plugin, Header, Headers, StatusCode};
pub use hyper::Response as HyperResponse;
pub mod content;
pub use self::content::*;
pub struct Response {
pub status: StatusCode,
pub headers: Headers,
pub body: Option<Body>,
pub extensions: TypeMap<TypeMapInner>,
}
impl Response {
#[inline]
pub fn new() -> Response {
Response {
status: Default::default(),
headers: Headers::new(),
body: None,
extensions: TypeMap::custom()
}
}
#[inline]
pub fn new_redirect<R: Into<Raw>>(location: R) -> Response {
let mut headers = Headers::new();
headers.set(Location::parse_header(&location.into()).unwrap());
Response {
status: StatusCode::Found,
headers,
body: None,
extensions: TypeMap::custom()
}
}
#[inline]
pub fn with_status(mut self, status: StatusCode) -> Self {
self.status = status;
self
}
#[inline]
pub fn with_header<H: Header>(mut self, header: H) -> Self {
self.headers.set(header);
self
}
#[inline]
pub fn with_headers(mut self, headers: Headers) -> Self {
self.headers = headers;
self
}
#[inline]
pub fn with_body<T: Into<Body>>(mut self, body: T) -> Self {
self.body = Some(body.into());
self
}
#[inline]
pub fn with_content<C: Into<Content>>(mut self, content: C, mime: Mime) -> Self {
self.set_content(content, mime);
self
}
#[inline]
|
#[inline]
pub fn with_mime(mut self, mime: Mime) -> Self {
self.set_mime(mime);
self
}
#[inline]
pub fn set_mime(&mut self, mime: Mime) {
self.headers.set(ContentType(mime));
}
}
impl From<HyperResponse> for Response {
fn from(mut from_response: HyperResponse) -> Response {
Response {
status: from_response.status(),
headers: replace(from_response.headers_mut(), Headers::new()),
body: if from_response.body_ref().is_some() { Some(from_response.body()) } else { None },
extensions: TypeMap::custom()
}
}
}
impl From<Response> for HyperResponse {
fn from(from_response: Response) -> HyperResponse {
HyperResponse::new()
.with_status(from_response.status)
.with_headers(from_response.headers)
.with_body(from_response.body.unwrap_or_default())
}
}
impl Debug for Response {
fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
writeln!(formatter, "{} {}\n{}",
HttpVersion::default(),
self.status,
self.headers
)
}
}
impl fmt::Display for Response {
fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
Debug::fmt(self, formatter)
}
}
impl Extensible<TypeMapInner> for Response {
fn extensions(&self) -> &TypeMap<TypeMapInner> {
&self.extensions
}
fn extensions_mut(&mut self) -> &mut TypeMap<TypeMapInner> {
&mut self.extensions
}
}
impl Plugin for Response {}
#[cfg(test)]
mod test {
use super::*;
use hyper::header::{ContentType};
use futures::stream::Stream;
use futures::{future, Future};
use mime;
use std::str::from_utf8;
#[test]
fn test_create_response() {
let response = Response::new();
assert_eq!(response.status, StatusCode::Ok);
assert_eq!(response.headers, Headers::new());
assert!(response.body.is_none());
}
#[test]
fn test_response_from_hyper_response() {
let mut headers = Headers::new();
headers.set(ContentType(mime::TEXT_HTML));
let response = Response::from(
HyperResponse::new()
.with_status(StatusCode::NotFound)
.with_headers(headers.clone())
.with_body("Error")
);
assert_eq!(response.status, StatusCode::NotFound);
assert_eq!(response.headers, headers);
assert!(response.body.is_some());
let body = response.body.unwrap()
.concat2()
.and_then(|chunk| {
future::ok(String::from(from_utf8(&chunk).unwrap()))
})
.wait().unwrap();
assert_eq!(body, "Error");
}
#[test]
fn test_hyper_response_from_response() {
let mut headers = Headers::new();
headers.set(ContentType(mime::TEXT_HTML));
let response = HyperResponse::from(
Response {
status: StatusCode::NotFound,
headers: headers.clone(),
body: Some("Error".into()),
extensions: TypeMap::custom()
}
);
assert_eq!(response.status(), StatusCode::NotFound);
assert_eq!(response.headers(), &headers);
assert!(response.body_ref().is_some());
let body = response.body()
.concat2()
.and_then(|chunk| {
future::ok(String::from(from_utf8(&chunk).unwrap()))
})
.wait().unwrap();
assert_eq!(body, "Error");
}
} | pub fn set_content<C: Into<Content>>(&mut self, content: C, mime: Mime) {
let content = content.into();
self.headers.set(ContentType(mime));
self.headers.set(ContentLength(content.len() as u64));
self.body = Some(content.into());
self.status = StatusCode::Ok;
} | function_block-full_function | [
{
"content": "struct DefaultContentType;\n\n\n\nimpl AfterMiddleware for DefaultContentType {\n\n // This is run for every requests, AFTER all handlers have been executed\n\n fn after(&self, _: &mut Request, mut response: Response) -> FerrumResult<Response> {\n\n if response.headers.get::<ContentTy... |
Rust | src/scu_reset/prclr1.rs | austinglaser/xmc4700 | 12e1d2b638af5ff0e7088605a4299590a2cd60eb | #[doc = "Writer for register PRCLR1"]
pub type W = crate::W<u32, super::PRCLR1>;
#[doc = "Register PRCLR1 `reset()`'s with value 0"]
impl crate::ResetValue for super::PRCLR1 {
type Type = u32;
#[inline(always)]
fn reset_value() -> Self::Type {
0
}
}
#[doc = "CCU43 Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum CCU43RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<CCU43RS_AW> for bool {
#[inline(always)]
fn from(variant: CCU43RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `CCU43RS`"]
pub struct CCU43RS_W<'a> {
w: &'a mut W,
}
impl<'a> CCU43RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: CCU43RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(CCU43RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(CCU43RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !0x01) | ((value as u32) & 0x01);
self.w
}
}
#[doc = "LEDTS Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum LEDTSCU0RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<LEDTSCU0RS_AW> for bool {
#[inline(always)]
fn from(variant: LEDTSCU0RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `LEDTSCU0RS`"]
pub struct LEDTSCU0RS_W<'a> {
w: &'a mut W,
}
impl<'a> LEDTSCU0RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: LEDTSCU0RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(LEDTSCU0RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(LEDTSCU0RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 3)) | (((value as u32) & 0x01) << 3);
self.w
}
}
#[doc = "MultiCAN Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum MCAN0RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<MCAN0RS_AW> for bool {
#[inline(always)]
fn from(variant: MCAN0RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `MCAN0RS`"]
pub struct MCAN0RS_W<'a> {
w: &'a mut W,
}
impl<'a> MCAN0RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: MCAN0RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(MCAN0RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(MCAN0RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 4)) | (((value as u32) & 0x01) << 4);
self.w
}
}
#[doc = "DAC Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum DACRS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<DACRS_AW> for bool {
#[inline(always)]
fn from(variant: DACRS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `DACRS`"]
pub struct DACRS_W<'a> {
w: &'a mut W,
}
impl<'a> DACRS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: DACRS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(DACRS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(DACRS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 5)) | (((value as u32) & 0x01) << 5);
self.w
}
}
#[doc = "MMC Interface Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum MMCIRS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<MMCIRS_AW> for bool {
#[inline(always)]
fn from(variant: MMCIRS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `MMCIRS`"]
pub struct MMCIRS_W<'a> {
w: &'a mut W,
}
impl<'a> MMCIRS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: MMCIRS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(MMCIRS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(MMCIRS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 6)) | (((value as u32) & 0x01) << 6);
self.w
}
}
#[doc = "USIC1 Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum USIC1RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<USIC1RS_AW> for bool {
#[inline(always)]
fn from(variant: USIC1RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `USIC1RS`"]
pub struct USIC1RS_W<'a> {
w: &'a mut W,
}
impl<'a> USIC1RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: USIC1RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(USIC1RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(USIC1RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 7)) | (((value as u32) & 0x01) << 7);
self.w
}
}
#[doc = "USIC2 Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum USIC2RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<USIC2RS_AW> for bool {
#[inline(always)]
fn from(variant: USIC2RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `USIC2RS`"]
pub struct USIC2RS_W<'a> {
w: &'a mut W,
}
impl<'a> USIC2RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: USIC2RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(USIC2RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(USIC2RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 8)) | (((value as u32) & 0x01) << 8);
self.w
}
}
#[doc = "PORTS Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum PPORTSRS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<PPORTSRS_AW> for bool {
#[inline(always)]
fn from(variant: PPORTSRS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `PPORTSRS`"]
pub struct PPORTSRS_W<'a> {
w: &'a mut W,
}
impl<'a> PPORTSRS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: PPORTSRS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(PPORTSRS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(PPORTSRS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 9)) | (((value as u32) & 0x01) << 9);
self.w
}
}
impl W {
#[doc = "Bit 0 - CCU43 Reset Clear"]
#[inline(always)]
pub fn ccu43rs(&mut self) -> CCU43RS_W {
CCU43RS_W { w: self }
}
#[doc = "Bit 3 - LEDTS Reset Clear"]
#[inline(always)]
pub fn ledtscu0rs(&mut self) -> LEDTSCU0RS_W {
LEDTSCU0RS_W { w: self }
}
#[doc = "Bit 4 - MultiCAN Reset Clear"]
#[inline(always)]
pub fn mcan0rs(&mut self) -> MCAN0RS_W {
MCAN0RS_W { w: self }
}
#[doc = "Bit 5 - DAC Reset Clear"]
#[inline(always)]
pub fn dacrs(&mut self) -> DACRS_W {
DACRS_W { w: self }
}
#[doc = "Bit 6 - MMC Interface Reset Clear"]
#[inline(always)]
pub fn mmcirs(&mut self) -> MMCIRS_W {
MMCIRS_W { w: self }
}
#[doc = "Bit 7 - USIC1 Reset Clear"]
#[inline(always)]
pub fn usic1rs(&mut self) -> USIC1RS_W {
USIC1RS_W { w: self }
}
#[doc = "Bit 8 - USIC2 Reset Clear"]
#[inline(always)]
pub fn usic2rs(&mut self) -> USIC2RS_W {
USIC2RS_W { w: self }
}
#[doc = "Bit 9 - PORTS Reset Clear"]
#[inline(always)]
pub fn pportsrs(&mut self) -> PPORTSRS_W {
PPORTSRS_W { w: self }
}
}
| #[doc = "Writer for register PRCLR1"]
pub type W = crate::W<u32, super::PRCLR1>;
#[doc = "Register PRCLR1 `reset()`'s with value 0"]
impl crate::ResetValue for super::PRCLR1 {
type Type = u32;
#[inline(always)]
fn reset_value() -> Self::Type {
0
}
}
#[doc = "CCU43 Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum CCU43RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<CCU43RS_AW> for bool {
#[inline(always)]
fn from(variant: CCU43RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `CCU43RS`"]
pub struct CCU43RS_W<'a> {
w: &'a mut W,
}
impl<'a> CCU43RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: CCU43RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(CCU43RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(CCU43RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !0x01) | ((value as u32) & 0x01);
self.w
}
}
#[doc = "LEDTS Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum LEDTSCU0RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<LEDTSCU0RS_AW> for bool {
#[inline(always)]
fn from(variant: LEDTSCU0RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `LEDTSCU0RS`"]
pub struct LEDTSCU0RS_W<'a> {
w: &'a mut W,
}
impl<'a> LEDTSCU0RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: LEDTSCU0RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(LEDTSCU0RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(LEDTSCU0RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << | "USIC1 Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum USIC1RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<USIC1RS_AW> for bool {
#[inline(always)]
fn from(variant: USIC1RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `USIC1RS`"]
pub struct USIC1RS_W<'a> {
w: &'a mut W,
}
impl<'a> USIC1RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: USIC1RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(USIC1RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(USIC1RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 7)) | (((value as u32) & 0x01) << 7);
self.w
}
}
#[doc = "USIC2 Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum USIC2RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<USIC2RS_AW> for bool {
#[inline(always)]
fn from(variant: USIC2RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `USIC2RS`"]
pub struct USIC2RS_W<'a> {
w: &'a mut W,
}
impl<'a> USIC2RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: USIC2RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(USIC2RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(USIC2RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 8)) | (((value as u32) & 0x01) << 8);
self.w
}
}
#[doc = "PORTS Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum PPORTSRS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<PPORTSRS_AW> for bool {
#[inline(always)]
fn from(variant: PPORTSRS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `PPORTSRS`"]
pub struct PPORTSRS_W<'a> {
w: &'a mut W,
}
impl<'a> PPORTSRS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: PPORTSRS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(PPORTSRS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(PPORTSRS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 9)) | (((value as u32) & 0x01) << 9);
self.w
}
}
impl W {
#[doc = "Bit 0 - CCU43 Reset Clear"]
#[inline(always)]
pub fn ccu43rs(&mut self) -> CCU43RS_W {
CCU43RS_W { w: self }
}
#[doc = "Bit 3 - LEDTS Reset Clear"]
#[inline(always)]
pub fn ledtscu0rs(&mut self) -> LEDTSCU0RS_W {
LEDTSCU0RS_W { w: self }
}
#[doc = "Bit 4 - MultiCAN Reset Clear"]
#[inline(always)]
pub fn mcan0rs(&mut self) -> MCAN0RS_W {
MCAN0RS_W { w: self }
}
#[doc = "Bit 5 - DAC Reset Clear"]
#[inline(always)]
pub fn dacrs(&mut self) -> DACRS_W {
DACRS_W { w: self }
}
#[doc = "Bit 6 - MMC Interface Reset Clear"]
#[inline(always)]
pub fn mmcirs(&mut self) -> MMCIRS_W {
MMCIRS_W { w: self }
}
#[doc = "Bit 7 - USIC1 Reset Clear"]
#[inline(always)]
pub fn usic1rs(&mut self) -> USIC1RS_W {
USIC1RS_W { w: self }
}
#[doc = "Bit 8 - USIC2 Reset Clear"]
#[inline(always)]
pub fn usic2rs(&mut self) -> USIC2RS_W {
USIC2RS_W { w: self }
}
#[doc = "Bit 9 - PORTS Reset Clear"]
#[inline(always)]
pub fn pportsrs(&mut self) -> PPORTSRS_W {
PPORTSRS_W { w: self }
}
}
| 3)) | (((value as u32) & 0x01) << 3);
self.w
}
}
#[doc = "MultiCAN Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum MCAN0RS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<MCAN0RS_AW> for bool {
#[inline(always)]
fn from(variant: MCAN0RS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `MCAN0RS`"]
pub struct MCAN0RS_W<'a> {
w: &'a mut W,
}
impl<'a> MCAN0RS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: MCAN0RS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(MCAN0RS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(MCAN0RS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 4)) | (((value as u32) & 0x01) << 4);
self.w
}
}
#[doc = "DAC Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum DACRS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<DACRS_AW> for bool {
#[inline(always)]
fn from(variant: DACRS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `DACRS`"]
pub struct DACRS_W<'a> {
w: &'a mut W,
}
impl<'a> DACRS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: DACRS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(DACRS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(DACRS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 5)) | (((value as u32) & 0x01) << 5);
self.w
}
}
#[doc = "MMC Interface Reset Clear\n\nValue on reset: 0"]
#[derive(Clone, Copy, Debug, PartialEq)]
pub enum MMCIRS_AW {
#[doc = "0: No effect"]
VALUE1 = 0,
#[doc = "1: De-assert reset"]
VALUE2 = 1,
}
impl From<MMCIRS_AW> for bool {
#[inline(always)]
fn from(variant: MMCIRS_AW) -> Self {
variant as u8 != 0
}
}
#[doc = "Write proxy for field `MMCIRS`"]
pub struct MMCIRS_W<'a> {
w: &'a mut W,
}
impl<'a> MMCIRS_W<'a> {
#[doc = r"Writes `variant` to the field"]
#[inline(always)]
pub fn variant(self, variant: MMCIRS_AW) -> &'a mut W {
{
self.bit(variant.into())
}
}
#[doc = "No effect"]
#[inline(always)]
pub fn value1(self) -> &'a mut W {
self.variant(MMCIRS_AW::VALUE1)
}
#[doc = "De-assert reset"]
#[inline(always)]
pub fn value2(self) -> &'a mut W {
self.variant(MMCIRS_AW::VALUE2)
}
#[doc = r"Sets the field bit"]
#[inline(always)]
pub fn set_bit(self) -> &'a mut W {
self.bit(true)
}
#[doc = r"Clears the field bit"]
#[inline(always)]
pub fn clear_bit(self) -> &'a mut W {
self.bit(false)
}
#[doc = r"Writes raw bits to the field"]
#[inline(always)]
pub fn bit(self, value: bool) -> &'a mut W {
self.w.bits = (self.w.bits & !(0x01 << 6)) | (((value as u32) & 0x01) << 6);
self.w
}
}
#[doc = | 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/main.rs | 0x4c37373230/BDumper | fac8b161d544bccdc26f9f3607ebcafcf3c53f39 | #![windows_subsystem = "windows"]
extern crate native_windows_derive as nwd;
extern crate native_windows_gui as nwg;
use {
bedrock_dumper::*,
nwd::NwgUi,
nwg::{CheckBoxState, NativeUi},
};
#[derive(Default, NwgUi)]
pub struct BedrockDumper {
#[nwg_control(size: (590, 225), position: (300, 300), title: "BDumper", flags: "WINDOW|VISIBLE")]
#[nwg_events( OnWindowClose: [BedrockDumper::exit_program] )]
window: nwg::Window,
#[nwg_control(text: "BDumper is a .pdb file dumper made in Rust by Luke7720 designed to extract \
function prototypes and RVAs (Relative Virtual Addresses) and export them into either text \
or C++ header files. It can also find specific functions within the pdb\n\
-----------------------------------------------------------------------\
-----------------------------------------------------------------------
", size: (580, 70), position: (10, 10))]
label: nwg::Label,
#[nwg_control(text: "Input your .pdb file path here", size: (280, 25), position: (10, 80))]
label2: nwg::Label,
#[nwg_control(text: "", size: (280, 25), position: (10, 100))]
pdb_path: nwg::TextInput,
#[nwg_control(text: "Input your file type (.hpp or .txt) here", size: (280, 25), position: (300, 80))]
label3: nwg::Label,
#[nwg_control(text: "", size: (280, 25), position: (300, 100))]
file_type: nwg::TextInput,
#[nwg_control(text: "Input a function's name here", size: (280, 25), position: (10, 130))]
label4: nwg::Label,
#[nwg_control(text: "", size: (280, 25), position: (10, 150))]
func_name: nwg::TextInput,
#[nwg_control(text: "Include demangled function prototypes", size: (280, 25), position: (300, 150))]
should_demangle: nwg::CheckBox,
#[nwg_control(text: "Dump Data", size: (185, 30), position: (10, 180))]
#[nwg_events( OnButtonClick: [BedrockDumper::dump] )]
dump: nwg::Button,
#[nwg_control(text: "Find Function", size: (185, 30), position: (200, 180))]
#[nwg_events( OnButtonClick: [BedrockDumper::find] )]
find: nwg::Button,
#[nwg_control(text: "Filtered Dump", size: (185, 30), position: (390, 180))]
#[nwg_events( OnButtonClick: [BedrockDumper::filtered_dump] )]
find_filtered: nwg::Button,
}
impl BedrockDumper {
fn dump(&self) {
let pdb_path: &str = &self.pdb_path.text();
let file_type: &str = &self.file_type.text();
let demangle = if &self.should_demangle.check_state() == &CheckBoxState::Checked {
true
} else {
false
};
match setup::dump_init(pdb_path, file_type) {
Ok(dump_file) => pdb::pdb_dump(pdb_path, file_type, dump_file, demangle)
.expect("ERROR: Failed to dump pdb contents"),
Err(str) => {
nwg::simple_message("Error", &str);
return;
}
}
}
fn find(&self) {
match pdb::find_function(&self.pdb_path.text(), &self.func_name.text()) {
Ok(bds_func) => nwg::simple_message(
"Found a match",
&format!(
"Function name: {}\nSymbol: {}\nRVA: {}",
bds_func.name, bds_func.symbol, bds_func.rva
),
),
Err(str) => nwg::simple_message("Error", &str),
};
}
fn filtered_dump(&self) {
let pdb_path: &str = &self.pdb_path.text();
let file_type: &str = &self.file_type.text();
match setup::dump_init(pdb_path, file_type) {
Ok(dump_file) => match pdb::find_functions(pdb_path, file_type, dump_file) {
Err(str) => {
nwg::simple_message("Error", &str);
}
_ => {}
},
Err(str) => {
nwg::simple_message("Error", &str);
}
}
}
fn exit_program(&self) {
nwg::stop_thread_dispatch();
}
}
fn main() {
nwg::init().expect("Failed to init Native Windows GUI");
setup::filter_manager();
let _app = BedrockDumper::build_ui(Default::default()).expect("Failed to build UI");
nwg::dispatch_thread_events();
}
| #![windows_subsystem = "windows"]
extern crate native_windows_derive as nwd;
extern crate native_windows_gui as nwg;
use {
bedrock_dumper::*,
nwd::NwgUi,
nwg::{CheckBoxState, NativeUi},
};
#[derive(Default, NwgUi)]
pub struct BedrockDumper {
#[nwg_control(size: (590, 225), position: (300, 300), title: "BDumper", flags: "WINDOW|VISIBLE")]
#[nwg_events( OnWindowClose: [BedrockDumper::exit_program] )]
window: nwg::Window,
#[nwg_control(text: "BDumper is a .pdb file dumper made in Rust by Luke7720 designed to extract \
function prototypes and RVAs (Relative Virtual Addresses) and export them into either text \
or C++ header files. It can also find specific functions within the pdb\n\
-----------------------------------------------------------------------\
-----------------------------------------------------------------------
", size: (580, 70), position: (10, 10))]
label: nwg::Label,
#[nwg_control(text: "Input your .pdb file path here", size: (280, 25), position: (10, 80))]
label2: nwg::Label,
#[nwg_control(text: "", size: (280, 25), position: (10, 100))]
pdb_path: nwg::TextInput,
#[nwg_control(text: "Input your file type (.hpp or .txt) here", size: (280, 25), position: (300, 80))]
label3: nwg::Label,
#[nwg_control(text: "", size: (280, 25), position: (300, 100))]
file_type: nwg::TextInput,
#[nwg_control(text: "Input a function's name here", size: (280, 25), position: (10, 130))]
label4: nwg::Label,
#[nwg_control(text: "", size: (280, 25), position: (10, 150))]
func_name: nwg::TextInput,
#[nwg_control(text: "Include demangled function prototypes", size: (280, 25), position: (300, 150))]
should_demangle: nwg::CheckBox,
#[nwg_control(text: "Dump Data", size: (185, 30), position: (10, 180))]
#[nwg_events( OnButtonClick: [BedrockDumper::dump] )]
dump: nwg::Button,
#[nwg_control(text: "Find Function", size: (185, 30), position: (200, 180))]
#[nwg_events( OnButtonClick: [BedrockDumper::find] )]
find: nwg::Button,
#[nwg_control(text: "Filtered Dump", size: (185, 30), position: (390, 180))]
#[nwg_events( OnButtonClick: [BedrockDumper::filtered_dump] )]
find_filtered: nwg::Button,
| ath, file_type, dump_file) {
Err(str) => {
nwg::simple_message("Error", &str);
}
_ => {}
},
Err(str) => {
nwg::simple_message("Error", &str);
}
}
}
fn exit_program(&self) {
nwg::stop_thread_dispatch();
}
}
fn main() {
nwg::init().expect("Failed to init Native Windows GUI");
setup::filter_manager();
let _app = BedrockDumper::build_ui(Default::default()).expect("Failed to build UI");
nwg::dispatch_thread_events();
}
| }
impl BedrockDumper {
fn dump(&self) {
let pdb_path: &str = &self.pdb_path.text();
let file_type: &str = &self.file_type.text();
let demangle = if &self.should_demangle.check_state() == &CheckBoxState::Checked {
true
} else {
false
};
match setup::dump_init(pdb_path, file_type) {
Ok(dump_file) => pdb::pdb_dump(pdb_path, file_type, dump_file, demangle)
.expect("ERROR: Failed to dump pdb contents"),
Err(str) => {
nwg::simple_message("Error", &str);
return;
}
}
}
fn find(&self) {
match pdb::find_function(&self.pdb_path.text(), &self.func_name.text()) {
Ok(bds_func) => nwg::simple_message(
"Found a match",
&format!(
"Function name: {}\nSymbol: {}\nRVA: {}",
bds_func.name, bds_func.symbol, bds_func.rva
),
),
Err(str) => nwg::simple_message("Error", &str),
};
}
fn filtered_dump(&self) {
let pdb_path: &str = &self.pdb_path.text();
let file_type: &str = &self.file_type.text();
match setup::dump_init(pdb_path, file_type) {
Ok(dump_file) => match pdb::find_functions(pdb_p | random | [
{
"content": "# BDumper\n\nA windows BDS .pdb dumper written in rust which dumps symbols, reconstructed function prototypes from demangled symbols and RVAs (Relative Virtual Addresses) into either a C++ header (.hpp) or a text file (.txt) and can also find data corresponding to specific functions. This project ... |
Rust | kosem-gui/src/work_on_procedure.rs | idanarye/kosem | c72198c1f78855cfd49d1d0fa1bc848ac0c8f9cc | use actix::prelude::*;
use gtk::prelude::*;
use kosem_webapi::Uuid;
use kosem_webapi::pairing_messages;
use kosem_webapi::phase_control_messages;
use crate::internal_messages::gui_control::{
ProcedureScreenAttach,
UserClickedButton,
ShowJoinMenu,
};
#[derive(woab::Factories)]
pub struct WorkOnProcedureFactories {
pub app_work_on_procedure_window: woab::BuilderFactory,
row_phase: woab::BuilderFactory,
cld_caption: woab::BuilderFactory,
cld_button: woab::BuilderFactory,
}
#[derive(typed_builder::TypedBuilder)]
pub struct WorkOnProcedureActor {
factories: crate::Factories,
widgets: WorkOnProcedureWidgets,
join_menu: Addr<crate::join_menu::JoinMenuActor>,
gui_client: Addr<crate::client::GuiClientActor>,
server_idx: usize,
procedure: pairing_messages::AvailableProcedure,
#[builder(default, setter(skip))]
phases: std::collections::HashMap<Uuid, PhaseRow>,
}
impl Actor for WorkOnProcedureActor {
type Context = Context<Self>;
fn started(&mut self, ctx: &mut Self::Context) {
self.widgets.lbl_title.set_text(&self.procedure.name);
self.widgets.app_work_on_procedure_window.show_all();
self.gui_client.do_send(ProcedureScreenAttach {
server_idx: self.server_idx,
request_uid: self.procedure.uid,
addr: ctx.address(),
});
}
}
#[derive(woab::WidgetsFromBuilder)]
pub struct WorkOnProcedureWidgets {
app_work_on_procedure_window: gtk::ApplicationWindow,
lst_phases: gtk::ListBox,
lbl_title: gtk::Label,
}
impl actix::Handler<woab::Signal> for WorkOnProcedureActor {
type Result = woab::SignalResult;
fn handle(&mut self, msg: woab::Signal, _ctx: &mut Self::Context) -> Self::Result {
Ok(match msg.name() {
"close" => {
self.join_menu.do_send(ShowJoinMenu);
None
}
_ => msg.cant_handle()?,
})
}
}
impl Handler<phase_control_messages::PhasePushed> for WorkOnProcedureActor {
type Result = ();
fn handle(&mut self, msg: phase_control_messages::PhasePushed, ctx: &mut Self::Context) -> Self::Result {
let phase_widgets: PhaseWidgets = self.factories.work_on_procedure.row_phase.instantiate().widgets().unwrap();
self.widgets.lst_phases.add(&phase_widgets.row_phase);
for (i, component) in msg.components.iter().enumerate() {
match &component.params {
phase_control_messages::ComponentParams::Caption { text } => {
let widgets: ComponentCaptionWidgets = self.factories.work_on_procedure.cld_caption.instantiate().widgets().unwrap();
widgets.lbl_caption.set_text(&text);
phase_widgets.box_components.add(&widgets.cld_caption);
}
phase_control_messages::ComponentParams::Button { text } => {
let widgets: ComponentButtonWidgets = self.factories.work_on_procedure.cld_button.instantiate()
.connect_to(((msg.phase_uid, i), ctx.address()))
.widgets().unwrap();
widgets.btn_button.set_label(&text);
phase_widgets.box_components.add(&widgets.cld_button);
}
}
}
self.phases.insert(msg.phase_uid, PhaseRow {
widgets: phase_widgets,
msg,
});
}
}
impl Handler<phase_control_messages::PhasePopped> for WorkOnProcedureActor {
type Result = ();
fn handle(&mut self, msg: phase_control_messages::PhasePopped, _ctx: &mut Self::Context) -> Self::Result {
let phase_row = if let Some(p) = self.phases.get(&msg.phase_uid) {
p
} else {
log::warn!("Unknown phase {}", msg.phase_uid);
return;
};
self.widgets.lst_phases.remove(&phase_row.widgets.row_phase);
}
}
impl Handler<pairing_messages::ProcedureFinished> for WorkOnProcedureActor {
type Result = ();
fn handle(&mut self, _msg: pairing_messages::ProcedureFinished, _ctx: &mut Self::Context) -> Self::Result {
self.widgets.app_work_on_procedure_window.close();
}
}
struct PhaseRow {
widgets: PhaseWidgets,
msg: phase_control_messages::PhasePushed,
}
#[derive(woab::WidgetsFromBuilder)]
struct PhaseWidgets {
row_phase: gtk::ListBoxRow,
box_components: gtk::FlowBox,
}
#[derive(woab::WidgetsFromBuilder)]
struct ComponentCaptionWidgets {
cld_caption: gtk::FlowBoxChild,
lbl_caption: gtk::Label,
}
#[derive(woab::WidgetsFromBuilder)]
struct ComponentButtonWidgets {
cld_button: gtk::FlowBoxChild,
btn_button: gtk::Button,
}
impl actix::Handler<woab::Signal<(Uuid, usize)>> for WorkOnProcedureActor {
type Result = woab::SignalResult;
fn handle(&mut self, msg: woab::Signal<(Uuid, usize)>, _ctx: &mut Self::Context) -> Self::Result {
let (phase_uid, component_ordinal) = *msg.tag();
let phase_row = if let Some(p) = self.phases.get(&phase_uid) {
p
} else {
log::warn!("Unknown phase {}", phase_uid);
return Ok(None);
};
let component = if let Some(c) = phase_row.msg.components.get(component_ordinal) {
c
} else {
log::warn!("Phase {} only has {} components - cannot access component {}", phase_uid, phase_row.msg.components.len(), component_ordinal);
return Ok(None);
};
Ok(match msg.name() {
"button_clicked" => {
self.gui_client.do_send(UserClickedButton {
server_idx: self.server_idx,
request_uid: self.procedure.uid,
phase_uid,
button_name: component.name.clone(),
});
None
}
_ => msg.cant_handle()?,
})
}
}
| use actix::prelude::*;
use gtk::prelude::*;
use kosem_webapi::Uuid;
use kosem_webapi::pairing_messages;
use kosem_webapi::phase_control_messages;
use crate::internal_messages::gui_control::{
ProcedureScreenAttach,
UserClickedButton,
ShowJoinMenu,
};
#[derive(woab::Factories)]
pub struct WorkOnProcedureFactories {
pub app_work_on_procedure_window: woab::BuilderFactory,
row_phase: woab::BuilderFactory,
cld_caption: woab::BuilderFactory,
cld_button: woab::BuilderFactory,
}
#[derive(typed_builder::TypedBuilder)]
pub struct WorkOnProcedureActor {
factories: crate::Factories,
widgets: WorkOnProcedureWidgets,
join_menu: Addr<crate::join_menu::JoinMenuActor>,
gui_client: Addr<crate::client::GuiClientActor>,
server_idx: usize,
procedure: pairing_messages::AvailableProcedure,
#[builder(default, setter(skip))]
phases: std::collections::HashMap<Uuid, PhaseRow>,
}
impl Actor for WorkOnProcedureActor {
type Context = Context<Self>;
fn started(&mut self, ctx: &mut Self::Context) {
self.widgets.lbl_title.set_text(&self.procedure.name);
self.widgets.app_work_on_procedure_window.show_all();
self.gui_client.do_send(ProcedureScreenAttach {
server_idx: self.server_idx,
request_uid: self.procedure.uid,
addr: ctx.address(),
});
}
}
#[derive(woab::WidgetsFromBuilder)]
pub struct WorkOnProcedureWidgets {
app_work_on_procedure_window: gtk::ApplicationWindow,
lst_phases: gtk::ListBox,
lbl_title: gtk::Label,
}
impl actix::Handler<woab::Signal> for WorkOnProcedureActor {
type Result = woab::SignalResult;
fn handle(&mut self, msg: woab::Signal, _ctx: &mut Self::Context) -> Self::Result {
Ok(match msg.name() {
"close" => {
self.join_menu.do_send(ShowJoinMenu);
None
}
_ => msg.cant_handle()?,
})
}
}
impl Handler<phase_control_messages::PhasePushed> for WorkOnProcedureActor {
type Result = ();
fn handle(&mut self, msg: phase_control_messages::PhasePushed, ctx: &mut Self::Context) -> Self::Result {
let phase_widgets: PhaseWidgets = self.factories.work_on_procedure.row_phase.instantiate().widgets().unwrap();
self.widgets.lst_phases.add(&phase_widgets.row_phase);
for (i, component) in msg.components.iter().enumerate() {
match &component.params {
phase_control_messages::ComponentParams::Caption { text } => {
let widgets: ComponentCaptionWidgets = self.factories.work_on_procedure.cld_caption.instantiate().widgets().unwrap();
widgets.lbl_caption.set_text(&text);
phase_widgets.box_components.add(&widgets.cld_caption);
}
phase_control_messages::ComponentParams::Button { text } => {
let widgets: ComponentButtonWidgets = self.factories.work_on_procedure.cld_button.instantiate()
.connect_to(((msg.phase_uid, i), ctx.address()))
.widgets().unwrap();
widgets.btn_button.set_label(&text);
phase_widgets.box_components.add(&widgets.cld_button);
}
}
}
self.phases.insert(msg.phase_uid, PhaseRow {
widgets: phase_widgets,
msg,
});
}
}
impl Handler<phase_control_messages::PhasePopped> for WorkOnProcedureActor {
type Result = ();
fn handle(&mut self, msg: phase_control_messages::PhasePopped, _ctx: &mut Self::Context) -> Self::Result {
let phase_row = if let Some(p) = self.phases.get(&msg.phase_uid) {
p
} else {
log::warn!("Unknown phase {}", msg.phase_uid);
return;
};
self.widgets.lst_phases.remove(&phase_row.widgets.row_phase);
}
}
impl Handler<pairing_messages::ProcedureFinished> for WorkOnProcedureActor {
type Result = ();
fn handle(&mut self, _msg: pairing_messages::ProcedureFinished, _ctx: &mut Self::Context) -> Self::Result {
self.widgets.app_work_on_procedure_window.close();
}
}
struct PhaseRow {
widgets: PhaseWidgets,
msg: phase_control_messages::PhasePushed,
}
#[derive(woab::WidgetsFromBuilder)]
struct PhaseWidgets {
row_phase: gtk::ListBoxRow,
box_components: gtk::FlowBox,
}
#[derive(woab::WidgetsFromBuilder)]
struct ComponentCaptionWidgets {
cld_caption: gtk::FlowBoxChild,
lbl_caption: gtk::Label,
}
#[derive(woab::WidgetsFromBuilder)]
struct ComponentButtonWidgets {
cld_button: gtk::FlowBoxChild,
btn_button: gtk::Button,
}
impl actix::Handler<woab::Signal<(Uuid, usize)>> for WorkOnProcedureActor {
type Result = woab::SignalResult;
fn handle(&mut self, msg: woab::Signal<(Uuid, usize)>, _ctx: &mut Self::Context) -> Self::Result {
let (phase_uid, component_ |
}
| ordinal) = *msg.tag();
let phase_row = if let Some(p) = self.phases.get(&phase_uid) {
p
} else {
log::warn!("Unknown phase {}", phase_uid);
return Ok(None);
};
let component = if let Some(c) = phase_row.msg.components.get(component_ordinal) {
c
} else {
log::warn!("Phase {} only has {} components - cannot access component {}", phase_uid, phase_row.msg.components.len(), component_ordinal);
return Ok(None);
};
Ok(match msg.name() {
"button_clicked" => {
self.gui_client.do_send(UserClickedButton {
server_idx: self.server_idx,
request_uid: self.procedure.uid,
phase_uid,
button_name: component.name.clone(),
});
None
}
_ => msg.cant_handle()?,
})
} | function_block-function_prefixed | [
{
"content": "pub fn start_gtk(settings: client_config::ClientConfig) -> anyhow::Result<()> {\n\n let factories = Factories::new(FactoriesInner {\n\n join_menu: join_menu::JoinMenuFactories::read(&*Asset::get(\"join_menu.glade\").unwrap())?,\n\n work_on_procedure: work_on_procedure::WorkOnProce... |
Rust | src/main.rs | codahale/veil-rs | 45e3a32ad522b4ce68425442a39ccc76d92bf43c | use std::ffi::{OsStr, OsString};
use std::path::{Path, PathBuf};
use std::{fs, result};
use anyhow::Result;
use clap::{App, IntoApp, Parser};
use clap::{AppSettings, Subcommand, ValueHint};
use clap_complete::generate_to;
use clap_complete::Shell;
use clio::{Input, Output};
use mimalloc::MiMalloc;
use veil::{PublicKey, PublicKeyError, SecretKey, Signature};
#[global_allocator]
static GLOBAL: MiMalloc = MiMalloc;
fn main() -> Result<()> {
let opts: Opts = Opts::parse();
match opts.cmd {
Command::SecretKey(cmd) => cmd.run(),
Command::PublicKey(cmd) => cmd.run(),
Command::DeriveKey(cmd) => cmd.run(),
Command::Encrypt(cmd) => cmd.run(),
Command::Decrypt(cmd) => cmd.run(),
Command::Sign(cmd) => cmd.run(),
Command::Verify(cmd) => cmd.run(),
Command::Complete(cmd) => cmd.run(),
}
}
#[derive(Debug, Parser)]
#[clap(author, version, about)]
#[clap(setting = AppSettings::SubcommandRequired)]
struct Opts {
#[clap(subcommand)]
cmd: Command,
}
trait Cmd {
fn run(self) -> Result<()>;
}
#[derive(Debug, Subcommand)]
#[clap(setting = AppSettings::DeriveDisplayOrder)]
enum Command {
SecretKey(SecretKeyArgs),
PublicKey(PublicKeyArgs),
DeriveKey(DeriveKeyArgs),
Encrypt(EncryptArgs),
Decrypt(DecryptArgs),
Sign(SignArgs),
Verify(VerifyArgs),
Complete(CompleteArgs),
}
#[derive(Debug, Parser)]
struct SecretKeyArgs {
#[clap(value_hint = ValueHint::FilePath)]
output: PathBuf,
#[clap(long, default_value = "128")]
time: u32,
#[clap(long, default_value = "1024")]
space: u32,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for SecretKeyArgs {
fn run(self) -> Result<()> {
let passphrase = prompt_passphrase(&self.passphrase_file)?;
let secret_key = SecretKey::new();
let ciphertext = secret_key.encrypt(&passphrase, self.time, self.space);
fs::write(self.output, ciphertext)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct PublicKeyArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath, default_value="-")]
output: Output,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for PublicKeyArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let public_key = secret_key.public_key(self.key_id.to_string_lossy().as_ref());
write!(self.output.lock(), "{}", public_key)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct DeriveKeyArgs {
public_key: OsString,
sub_key_id: OsString,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath, default_value="-")]
output: Output,
}
impl Cmd for DeriveKeyArgs {
fn run(mut self) -> Result<()> {
let root = self.public_key.to_string_lossy().as_ref().parse::<PublicKey>()?;
let public_key = root.derive(self.sub_key_id.to_string_lossy().as_ref());
write!(self.output.lock(), "{}", public_key)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct EncryptArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
plaintext: Input,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath)]
ciphertext: Output,
#[clap(required = true)]
recipients: Vec<OsString>,
#[clap(long, default_value = "0")]
fakes: usize,
#[clap(long, default_value = "0")]
padding: u64,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for EncryptArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let private_key = secret_key.private_key(self.key_id.to_string_lossy().as_ref());
let pks = self
.recipients
.iter()
.map(|s| s.to_string_lossy().as_ref().parse::<PublicKey>())
.collect::<result::Result<Vec<PublicKey>, PublicKeyError>>()?;
private_key.encrypt(
&mut self.plaintext.lock(),
&mut self.ciphertext.lock(),
pks,
self.fakes,
self.padding,
)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct DecryptArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
ciphertext: Input,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath)]
plaintext: Output,
sender: OsString,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for DecryptArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let private_key = secret_key.private_key(self.key_id.to_string_lossy().as_ref());
let sender = self.sender.to_string_lossy().parse()?;
private_key.decrypt(&mut self.ciphertext.lock(), &mut self.plaintext.lock(), &sender)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct SignArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
message: Input,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath, default_value="-")]
output: Output,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for SignArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let private_key = secret_key.private_key(self.key_id.to_string_lossy().as_ref());
let sig = private_key.sign(&mut self.message.lock())?;
write!(self.output.lock(), "{}", sig)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct VerifyArgs {
public_key: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
message: Input,
signature: OsString,
}
impl Cmd for VerifyArgs {
fn run(mut self) -> Result<()> {
let signer = self.public_key.to_string_lossy().as_ref().parse::<PublicKey>()?;
let sig = self.signature.to_string_lossy().as_ref().parse::<Signature>()?;
signer.verify(&mut self.message.lock(), &sig)?;
Ok(())
}
}
#[derive(Debug, Parser)]
#[clap(setting = AppSettings::Hidden)]
struct CompleteArgs {
shell: Shell,
#[clap(value_hint = ValueHint::DirPath)]
output: OsString,
}
impl Cmd for CompleteArgs {
fn run(self) -> Result<()> {
let mut app: App = Opts::into_app();
generate_to(self.shell, &mut app, "veil", &self.output)?;
Ok(())
}
}
fn decrypt_secret_key(passphrase_file: &Option<PathBuf>, path: &Path) -> Result<SecretKey> {
let passphrase = prompt_passphrase(passphrase_file)?;
let ciphertext = fs::read(path)?;
let sk = SecretKey::decrypt(&passphrase, &ciphertext)?;
Ok(sk)
}
fn prompt_passphrase(passphrase_file: &Option<PathBuf>) -> Result<String> {
match passphrase_file {
Some(p) => Ok(fs::read_to_string(p)?),
None => Ok(rpassword::read_password_from_tty(Some("Enter passphrase: "))?),
}
}
fn input_from_os_str(path: &OsStr) -> Result<Input, String> {
Input::new(path).map_err(|e| e.to_string())
}
fn output_from_os_str(path: &OsStr) -> Result<Output, String> {
Output::new(path).map_err(|e| e.to_string())
}
| use std::ffi::{OsStr, OsString};
use std::path::{Path, PathBuf};
use std::{fs, result};
use anyhow::Result;
use clap::{App, IntoApp, Parser};
use clap::{AppSettings, Subcommand, ValueHint};
use clap_complete::generate_to;
use clap_complete::Shell;
use clio::{Input, Output};
use mimalloc::MiMalloc;
use veil::{PublicKey, PublicKeyError, SecretKey, Signature};
#[global_allocator]
static GLOBAL: MiMalloc = MiMalloc;
fn main() -> Result<()> {
let opts: Opts = Opts::parse();
match opts.cmd {
Command::SecretKey(cmd) => cmd.run(),
Command::PublicKey(cmd) => cmd.run(),
Command::DeriveKey(cmd) => cmd.run(),
Command::Encrypt(cmd) => cmd.run(),
Command::Decrypt(cmd) => cmd.run(),
Command::Sign(cmd) => cmd.run(),
Command::Verify(cmd) => cmd.run(),
Command::Complete(cmd) => cmd.run(),
}
}
#[derive(Debug, Parser)]
#[clap(author, version, about)]
#[clap(setting = AppSettings::SubcommandRequired)]
struct Opts {
#[clap(subcommand)]
cmd: Command,
}
trait Cmd {
fn run(self) -> Result<()>;
}
#[derive(Debug, Subcommand)]
#[clap(setting = AppSettings::DeriveDisplayOrder)]
enum Command {
SecretKey(SecretKeyArgs),
PublicKey(PublicKeyArgs),
DeriveKey(DeriveKeyArgs),
Encrypt(EncryptArgs),
Decrypt(DecryptArgs),
Sign(SignArgs),
Verify(VerifyArgs),
Complete(CompleteArgs),
}
#[derive(Debug, Parser)]
struct SecretKeyArgs {
#[clap(value_hint = ValueHint::FilePath)]
output: PathBuf,
#[clap(long, default_value = "128")]
time: u32,
#[clap(long, default_value = "1024")]
space: u32,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for SecretKeyArgs {
|
}
#[derive(Debug, Parser)]
struct PublicKeyArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath, default_value="-")]
output: Output,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for PublicKeyArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let public_key = secret_key.public_key(self.key_id.to_string_lossy().as_ref());
write!(self.output.lock(), "{}", public_key)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct DeriveKeyArgs {
public_key: OsString,
sub_key_id: OsString,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath, default_value="-")]
output: Output,
}
impl Cmd for DeriveKeyArgs {
fn run(mut self) -> Result<()> {
let root = self.public_key.to_string_lossy().as_ref().parse::<PublicKey>()?;
let public_key = root.derive(self.sub_key_id.to_string_lossy().as_ref());
write!(self.output.lock(), "{}", public_key)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct EncryptArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
plaintext: Input,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath)]
ciphertext: Output,
#[clap(required = true)]
recipients: Vec<OsString>,
#[clap(long, default_value = "0")]
fakes: usize,
#[clap(long, default_value = "0")]
padding: u64,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for EncryptArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let private_key = secret_key.private_key(self.key_id.to_string_lossy().as_ref());
let pks = self
.recipients
.iter()
.map(|s| s.to_string_lossy().as_ref().parse::<PublicKey>())
.collect::<result::Result<Vec<PublicKey>, PublicKeyError>>()?;
private_key.encrypt(
&mut self.plaintext.lock(),
&mut self.ciphertext.lock(),
pks,
self.fakes,
self.padding,
)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct DecryptArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
ciphertext: Input,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath)]
plaintext: Output,
sender: OsString,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for DecryptArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let private_key = secret_key.private_key(self.key_id.to_string_lossy().as_ref());
let sender = self.sender.to_string_lossy().parse()?;
private_key.decrypt(&mut self.ciphertext.lock(), &mut self.plaintext.lock(), &sender)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct SignArgs {
#[clap(value_hint = ValueHint::FilePath)]
secret_key: PathBuf,
key_id: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
message: Input,
#[clap(parse(try_from_os_str = output_from_os_str), value_hint = ValueHint::FilePath, default_value="-")]
output: Output,
#[clap(long, value_hint = ValueHint::FilePath)]
passphrase_file: Option<PathBuf>,
}
impl Cmd for SignArgs {
fn run(mut self) -> Result<()> {
let secret_key = decrypt_secret_key(&self.passphrase_file, &self.secret_key)?;
let private_key = secret_key.private_key(self.key_id.to_string_lossy().as_ref());
let sig = private_key.sign(&mut self.message.lock())?;
write!(self.output.lock(), "{}", sig)?;
Ok(())
}
}
#[derive(Debug, Parser)]
struct VerifyArgs {
public_key: OsString,
#[clap(parse(try_from_os_str = input_from_os_str), value_hint = ValueHint::FilePath)]
message: Input,
signature: OsString,
}
impl Cmd for VerifyArgs {
fn run(mut self) -> Result<()> {
let signer = self.public_key.to_string_lossy().as_ref().parse::<PublicKey>()?;
let sig = self.signature.to_string_lossy().as_ref().parse::<Signature>()?;
signer.verify(&mut self.message.lock(), &sig)?;
Ok(())
}
}
#[derive(Debug, Parser)]
#[clap(setting = AppSettings::Hidden)]
struct CompleteArgs {
shell: Shell,
#[clap(value_hint = ValueHint::DirPath)]
output: OsString,
}
impl Cmd for CompleteArgs {
fn run(self) -> Result<()> {
let mut app: App = Opts::into_app();
generate_to(self.shell, &mut app, "veil", &self.output)?;
Ok(())
}
}
fn decrypt_secret_key(passphrase_file: &Option<PathBuf>, path: &Path) -> Result<SecretKey> {
let passphrase = prompt_passphrase(passphrase_file)?;
let ciphertext = fs::read(path)?;
let sk = SecretKey::decrypt(&passphrase, &ciphertext)?;
Ok(sk)
}
fn prompt_passphrase(passphrase_file: &Option<PathBuf>) -> Result<String> {
match passphrase_file {
Some(p) => Ok(fs::read_to_string(p)?),
None => Ok(rpassword::read_password_from_tty(Some("Enter passphrase: "))?),
}
}
fn input_from_os_str(path: &OsStr) -> Result<Input, String> {
Input::new(path).map_err(|e| e.to_string())
}
fn output_from_os_str(path: &OsStr) -> Result<Output, String> {
Output::new(path).map_err(|e| e.to_string())
}
| fn run(self) -> Result<()> {
let passphrase = prompt_passphrase(&self.passphrase_file)?;
let secret_key = SecretKey::new();
let ciphertext = secret_key.encrypt(&passphrase, self.time, self.space);
fs::write(self.output, ciphertext)?;
Ok(())
} | function_block-function_prefix_line | [
{
"content": "fn init(passphrase: &[u8], salt: &[u8], time: u32, space: u32) -> Strobe {\n\n let mut pbenc = Strobe::new(b\"veil.pbenc\", SecParam::B128);\n\n\n\n // Initialize protocol with metadata.\n\n pbenc.meta_ad_u32(DELTA as u32);\n\n pbenc.meta_ad_u32(N as u32);\n\n pbenc.meta_ad_u32(MAC_... |
Rust | src/lib.rs | phaylon/resorb | 4b36e3da17b66c97e28b86ee23f7db9d77d8a38d |
use std::rc;
use std::sync;
use std::error;
use std::fmt;
macro_rules! assert_parse_ok {
($parser:expr, $input:expr, $expected:expr $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Ok($expected)
);
drop(input);
}}
}
macro_rules! assert_parse_no_match {
($parser:expr, $input:expr $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Err(::ApplyError::NoMatch)
);
drop(input);
}}
}
macro_rules! assert_parse_fail {
($parser:expr, $input:expr, $value:expr, ($($l:tt)+) $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Err(::ApplyError::Fail(::Error::new(::Location::new($($l)+), $value)))
);
drop(input);
}}
}
macro_rules! assert_parse_partial {
($parser:expr, $input:expr, $value:expr, $rest:expr, ($($l:tt)+) $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Err(::ApplyError::Unparsed($value, ::Location::new($($l)+), $rest))
);
drop(input);
}}
}
pub mod util;
pub mod parse;
pub fn apply<'src, P>(input: &'src str, options: Options, parser: P)
-> Result<P::Output, ApplyError<'src, P::Output, P::Error>>
where P: Parser<'src> {
let depth_limit = options.depth_limit;
let ctx = Context {
options: options,
depth: 1,
};
let input = Input {
rest: input,
location: Location {
line: 1,
column: 1,
offset: 0,
},
};
match parser.parse(input, ctx) {
Ok((value, input)) => match input.unpack_if_nonempty() {
None => Ok(value),
Some((location, rest)) => Err(ApplyError::Unparsed(value, location, rest)),
},
Err(Fail::NoMatch) =>
Err(ApplyError::NoMatch),
Err(Fail::DepthLimit(location)) =>
Err(ApplyError::DepthLimit(location, depth_limit.unwrap())),
Err(Fail::Error(error)) =>
Err(ApplyError::Fail(error)),
Err(Fail::ZeroLengthRepeat(location)) =>
Err(ApplyError::ZeroLengthRepeat(location)),
}
}
#[derive( Debug, Clone )]
pub struct Context {
options: Options,
depth: usize,
}
impl Context {
pub fn descend<'src, E>(&self, input: &Input<'src>) -> Result<Context, Fail<E>> {
let new_depth = self.depth + 1;
if let Some(limit) = self.options.depth_limit {
if new_depth > limit {
return Err(Fail::DepthLimit(input.location));
}
}
Ok(Context {
options: self.options.clone(),
depth: new_depth,
})
}
}
#[derive( Debug, Clone )]
pub struct Options {
pub depth_limit: Option<usize>,
}
impl Default for Options {
fn default() -> Options {
Options {
depth_limit: Some(64),
}
}
}
#[derive( Debug, Clone, PartialEq, Eq )]
pub enum ApplyError<'src, T, E> {
NoMatch,
Fail(Error<E>),
DepthLimit(Location, usize),
Unparsed(T, Location, &'src str),
ZeroLengthRepeat(Location),
}
pub type Outcome<'src, O, E> = Result<(O, Input<'src>), Fail<E>>;
pub trait Parser<'src> {
type Output;
type Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error>;
}
impl<'src, P> Parser<'src> for sync::Arc<P> where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
impl<'src, P> Parser<'src> for rc::Rc<P> where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
impl<'src, P> Parser<'src> for Box<P> where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
impl<'src, 'p, P> Parser<'src> for &'p P where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
#[derive( Debug, Clone, PartialEq, Eq )]
pub enum Fail<E> {
NoMatch,
Error(Error<E>),
DepthLimit(Location),
ZeroLengthRepeat(Location),
}
#[derive( Debug, Clone, Copy, PartialEq, Eq )]
pub struct Location {
line: usize,
column: usize,
offset: usize,
}
impl Location {
pub fn new(line: usize, column: usize, offset: usize) -> Location {
Location {
line: line,
column: column,
offset: offset,
}
}
pub fn line(&self) -> usize { self.line }
pub fn column(&self) -> usize { self.column }
pub fn offset(&self) -> usize { self.offset }
fn advance(&self, parsed: &str) -> Location {
let nl_count = parsed
.chars()
.filter(|c| *c == '\n')
.count();
let last_line = parsed
.rfind('\n')
.map(|nl_pos| &parsed[(nl_pos+1)..])
.unwrap_or(&parsed);
let last_line_chars = last_line
.chars()
.count();
Location {
offset: self.offset + parsed.len(),
line: self.line + nl_count,
column: last_line_chars + if nl_count > 0 { 1 } else { self.column },
}
}
}
#[derive( Debug, Clone )]
pub struct Input<'src> {
rest: &'src str,
location: Location,
}
impl<'src> Input<'src> {
pub fn location(&self) -> Location { self.location }
pub fn consume_len_via<F>(self, find_len: F) -> Option<(&'src str, Input<'src>)>
where F: FnOnce(&'src str) -> Option<usize> {
let len = match find_len(self.rest) {
None => return None,
Some(len) => len,
};
let consumed = &self.rest[..len];
Some((consumed, self.advance(len)))
}
pub fn consume_char(self) -> Option<(char, Input<'src>)> {
let chr = match self.rest.chars().nth(0) {
None => return None,
Some(chr) => chr,
};
Some((chr, self.advance(chr.len_utf8())))
}
fn advance(self, len: usize) -> Input<'src> {
let consumed = &self.rest[..len];
let new_rest = &self.rest[len..];
let new_location = self.location.advance(consumed);
Input {
rest: new_rest,
location: new_location,
}
}
fn unpack_if_nonempty(self) -> Option<(Location, &'src str)> {
if self.rest.len() > 0 {
Some((self.location, self.rest))
}
else {
None
}
}
}
#[derive( Debug, Clone, PartialEq, Eq )]
pub struct Error<E> {
location: Location,
value: E,
cause: Option<Box<Error<E>>>,
}
impl<E> Error<E> {
pub fn new(location: Location, value: E) -> Error<E> {
Error {
location: location,
value: value,
cause: None,
}
}
pub fn new_with_cause(location: Location, value: E, cause: Error<E>) -> Error<E> {
Error {
location: location,
value: value,
cause: Some(Box::new(cause)),
}
}
pub fn location(&self) -> Location { self.location }
pub fn value(&self) -> &E { &self.value }
pub fn cause(&self) -> Option<&Error<E>> {
match self.cause {
Some(ref error) => Some(&*error),
None => None,
}
}
}
impl<E> fmt::Display for Error<E> where E: fmt::Display {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(&self.value, fmt)
}
}
impl<E> error::Error for Error<E> where E: error::Error {
fn description(&self) -> &str {
self.value.description()
}
fn cause(&self) -> Option<&error::Error> {
match self.cause {
Some(ref error) => Some(&*error),
None => None,
}
}
}
#[cfg(test)]
mod tests {
use parse;
#[test]
fn apply() {
#[derive( Debug, Clone, PartialEq, Eq )]
struct ErrMarker;
let parser = parse::pair(
parse::exact_str("foo"),
parse::require(parse::exact_str("bar"), || ErrMarker),
);
assert_parse_ok!(&parser, "foobar", ("foo", "bar"));
assert_parse_no_match!(&parser, "qux");
assert_parse_fail!(&parser, "fooqux", ErrMarker, (1, 4, 3));
}
#[test]
fn pointers() {
use std::rc::Rc;
use std::sync::Arc;
let plain = parse::no_custom_error(parse::exact_str("foo"));
assert_eq!(::apply("foo", ::Options::default(), &plain), Ok("foo"));
let boxed = Box::new(parse::no_custom_error(parse::exact_str("foo")));
assert_eq!(::apply("foo", ::Options::default(), boxed), Ok("foo"));
let rced = Rc::new(parse::no_custom_error(parse::exact_str("foo")));
assert_eq!(::apply("foo", ::Options::default(), rced), Ok("foo"));
let arced = Arc::new(parse::no_custom_error(parse::exact_str("foo")));
assert_eq!(::apply("foo", ::Options::default(), arced), Ok("foo"));
}
#[test]
fn location() {
use super::Location as L;
let loc = L::new(1, 1, 0).advance("foo");
assert_eq!(loc, L::new(1, 4, 3));
let loc = loc.advance(" \t");
assert_eq!(loc, L::new(1, 6, 5));
let loc = loc.advance("\n");
assert_eq!(loc, L::new(2, 1, 6));
let loc = loc.advance("a\nb\nc");
assert_eq!(loc, L::new(4, 2, 11));
}
}
|
use std::rc;
use std::sync;
use std::error;
use std::fmt;
macro_rules! assert_parse_ok {
($parser:expr, $input:expr, $expected:expr $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Ok($expected)
);
drop(input);
}}
}
macro_rules! assert_parse_no_match {
($parser:expr, $input:expr $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Err(::ApplyError::NoMatch)
);
drop(input);
}}
}
macro_rules! assert_parse_fail {
($parser:expr, $input:expr, $value:expr, ($($l:tt)+) $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Err(::ApplyError::Fail(::Error::new(::Location::new($($l)+), $value)))
);
drop(input);
}}
}
macro_rules! assert_parse_partial {
($parser:expr, $input:expr, $value:expr, $rest:expr, ($($l:tt)+) $(,)*) => {{
let input: String = ($input).into();
assert_eq!(
::apply(&input, ::Options::default(), $parser),
Err(::ApplyError::Unparsed($value, ::Location::new($($l)+), $rest))
);
drop(input);
}}
}
pub mod util;
pub mod parse;
pub fn apply<'src, P>(input: &'src str, options: Options, parser: P)
-> Result<P::Output, ApplyError<'src, P::Output, P::Error>>
where P: Parser<'src> {
let depth_limit = options.depth_limit;
let ctx = Context {
options: options,
depth: 1,
};
let input = Input {
rest: input,
location: Location {
line: 1,
column: 1,
offset: 0,
},
};
match parser.parse(input, ctx) {
Ok((value, input)) => match input.unpack_if_nonempty() {
None => Ok(value),
Some((location, rest)) => Err(ApplyError::Unparsed(value, location, rest)),
},
Err(Fail::NoMatch) =>
Err(ApplyError::NoMatch),
Err(Fail::DepthLimit(location)) =>
Err(ApplyError::DepthLimit(location, depth_limit.unwrap())),
Err(Fail::Error(error)) =>
Err(ApplyError::Fail(error)),
Err(Fail::ZeroLengthRepeat(location)) =>
Err(ApplyError::ZeroLengthRepeat(location)),
}
}
#[derive( Debug, Clone )]
pub struct Context {
options: Options,
depth: usize,
}
impl Context {
pub fn descend<'src, E>(&self, input: &Input<'src>) -> Result<Context, Fail<E>> {
let new_depth = self.depth + 1;
if let Some(limit) = self.options.depth_limit {
if new_depth > limit {
return Err(Fail::DepthLimit(input.location));
}
}
Ok(Context {
options: self.options.clone(),
depth: new_depth,
})
}
}
#[derive( Debug, Clone )]
pub struct Options {
pub depth_limit: Option<usize>,
}
impl Default for Options {
fn default() -> Options {
Options {
depth_limit: Some(64),
}
}
}
#[derive( Debug, Clone, PartialEq, Eq )]
pub enum ApplyError<'src, T, E> {
NoMatch,
Fail(Error<E>),
DepthLimit(Location, usize),
Unparsed(T, Location, &'src str),
ZeroLengthRepeat(Location),
}
pub type Outcome<'src, O, E> = Result<(O, Input<'src>), Fail<E>>;
pub trait Parser<'src> {
type Output;
type Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error>;
}
impl<'src, P> Parser<'src> for sync::Arc<P> where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
impl<'src, P> Parser<'src> for rc::Rc<P> where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
impl<'src, P> Parser<'src> for Box<P> where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
impl<'src, 'p, P> Parser<'src> for &'p P where P: Parser<'src> {
type Output = P::Output;
type Error = P::Error;
fn parse(&self, input: Input<'src>, ctx: Context)
-> Outcome<'src, Self::Output, Self::Error> {
(**self).parse(input, ctx)
}
}
#[derive( Debug, Clone, PartialEq, Eq )]
pub enum Fail<E> {
NoMatch,
Error(Error<E>),
DepthLimit(Location),
ZeroLengthRepeat(Location),
}
#[derive( Debug, Clone, Copy, PartialEq, Eq )]
pub struct Location {
line: usize,
column: usize,
offset: usize,
}
impl Location {
|
pub fn line(&self) -> usize { self.line }
pub fn column(&self) -> usize { self.column }
pub fn offset(&self) -> usize { self.offset }
fn advance(&self, parsed: &str) -> Location {
let nl_count = parsed
.chars()
.filter(|c| *c == '\n')
.count();
let last_line = parsed
.rfind('\n')
.map(|nl_pos| &parsed[(nl_pos+1)..])
.unwrap_or(&parsed);
let last_line_chars = last_line
.chars()
.count();
Location {
offset: self.offset + parsed.len(),
line: self.line + nl_count,
column: last_line_chars + if nl_count > 0 { 1 } else { self.column },
}
}
}
#[derive( Debug, Clone )]
pub struct Input<'src> {
rest: &'src str,
location: Location,
}
impl<'src> Input<'src> {
pub fn location(&self) -> Location { self.location }
pub fn consume_len_via<F>(self, find_len: F) -> Option<(&'src str, Input<'src>)>
where F: FnOnce(&'src str) -> Option<usize> {
let len = match find_len(self.rest) {
None => return None,
Some(len) => len,
};
let consumed = &self.rest[..len];
Some((consumed, self.advance(len)))
}
pub fn consume_char(self) -> Option<(char, Input<'src>)> {
let chr = match self.rest.chars().nth(0) {
None => return None,
Some(chr) => chr,
};
Some((chr, self.advance(chr.len_utf8())))
}
fn advance(self, len: usize) -> Input<'src> {
let consumed = &self.rest[..len];
let new_rest = &self.rest[len..];
let new_location = self.location.advance(consumed);
Input {
rest: new_rest,
location: new_location,
}
}
fn unpack_if_nonempty(self) -> Option<(Location, &'src str)> {
if self.rest.len() > 0 {
Some((self.location, self.rest))
}
else {
None
}
}
}
#[derive( Debug, Clone, PartialEq, Eq )]
pub struct Error<E> {
location: Location,
value: E,
cause: Option<Box<Error<E>>>,
}
impl<E> Error<E> {
pub fn new(location: Location, value: E) -> Error<E> {
Error {
location: location,
value: value,
cause: None,
}
}
pub fn new_with_cause(location: Location, value: E, cause: Error<E>) -> Error<E> {
Error {
location: location,
value: value,
cause: Some(Box::new(cause)),
}
}
pub fn location(&self) -> Location { self.location }
pub fn value(&self) -> &E { &self.value }
pub fn cause(&self) -> Option<&Error<E>> {
match self.cause {
Some(ref error) => Some(&*error),
None => None,
}
}
}
impl<E> fmt::Display for Error<E> where E: fmt::Display {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(&self.value, fmt)
}
}
impl<E> error::Error for Error<E> where E: error::Error {
fn description(&self) -> &str {
self.value.description()
}
fn cause(&self) -> Option<&error::Error> {
match self.cause {
Some(ref error) => Some(&*error),
None => None,
}
}
}
#[cfg(test)]
mod tests {
use parse;
#[test]
fn apply() {
#[derive( Debug, Clone, PartialEq, Eq )]
struct ErrMarker;
let parser = parse::pair(
parse::exact_str("foo"),
parse::require(parse::exact_str("bar"), || ErrMarker),
);
assert_parse_ok!(&parser, "foobar", ("foo", "bar"));
assert_parse_no_match!(&parser, "qux");
assert_parse_fail!(&parser, "fooqux", ErrMarker, (1, 4, 3));
}
#[test]
fn pointers() {
use std::rc::Rc;
use std::sync::Arc;
let plain = parse::no_custom_error(parse::exact_str("foo"));
assert_eq!(::apply("foo", ::Options::default(), &plain), Ok("foo"));
let boxed = Box::new(parse::no_custom_error(parse::exact_str("foo")));
assert_eq!(::apply("foo", ::Options::default(), boxed), Ok("foo"));
let rced = Rc::new(parse::no_custom_error(parse::exact_str("foo")));
assert_eq!(::apply("foo", ::Options::default(), rced), Ok("foo"));
let arced = Arc::new(parse::no_custom_error(parse::exact_str("foo")));
assert_eq!(::apply("foo", ::Options::default(), arced), Ok("foo"));
}
#[test]
fn location() {
use super::Location as L;
let loc = L::new(1, 1, 0).advance("foo");
assert_eq!(loc, L::new(1, 4, 3));
let loc = loc.advance(" \t");
assert_eq!(loc, L::new(1, 6, 5));
let loc = loc.advance("\n");
assert_eq!(loc, L::new(2, 1, 6));
let loc = loc.advance("a\nb\nc");
assert_eq!(loc, L::new(4, 2, 11));
}
}
| pub fn new(line: usize, column: usize, offset: usize) -> Location {
Location {
line: line,
column: column,
offset: offset,
}
} | function_block-full_function | [
{
"content": "pub fn fail<E>(location: ::Location, error: E) -> ::Fail<E> {\n\n ::Fail::Error(::Error::new(location, error))\n\n}\n",
"file_path": "src/util.rs",
"rank": 0,
"score": 211455.97158554505
},
{
"content": "pub fn no_custom_error<'src, P>(parser: P) -> P where P: ::Parser<'src,... |
Rust | src/config.rs | drogue-iot/drogue-event-source | 6f96f14d95de0bd914f523c6cb2b284bd24cf57b | use anyhow::Result;
use reqwest::Method;
use serde::Deserialize;
use serde_with::serde_as;
use std::collections::HashMap;
use std::time::Duration;
pub trait ConfigFromEnv<'de>: Sized + Deserialize<'de> {
fn from_env() -> Result<Self, config::ConfigError> {
Self::from(config::Environment::default())
}
fn from_env_source(source: HashMap<String, String>) -> Result<Self, config::ConfigError> {
Self::from(config::Environment::default().source(Some(source)))
}
fn from_env_prefix<S: AsRef<str>>(prefix: S) -> Result<Self, config::ConfigError> {
Self::from(config::Environment::with_prefix(prefix.as_ref()))
}
fn from(env: config::Environment) -> Result<Self, config::ConfigError>;
}
impl<'de, T: Deserialize<'de> + Sized> ConfigFromEnv<'de> for T {
fn from(env: config::Environment) -> Result<T, config::ConfigError> {
let cfg = config::Config::builder()
.add_source(env.separator("__"))
.build()?;
cfg.try_deserialize()
}
}
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
#[serde(tag = "mode")]
#[serde(rename_all = "lowercase")]
pub enum Mode {
Kafka(KafkaConfig),
#[serde(alias = "ws")]
Websocket(WebsocketConfig),
}
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
pub struct KafkaConfig {
pub topic: String,
pub bootstrap_servers: String,
#[serde(default)]
pub properties: HashMap<String, String>,
}
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
pub struct WebsocketConfig {
pub drogue_endpoint: String,
pub drogue_app: String,
pub drogue_user: String,
pub drogue_token: String,
}
#[derive(Clone, Debug, Deserialize)]
pub struct Config {
#[serde(default)]
pub endpoint: EndpointConfig,
pub k_sink: String,
#[serde(flatten)]
pub mode: Mode,
}
#[serde_as]
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
pub struct EndpointConfig {
#[serde(default = "default_method")]
#[serde_as(as = "serde_with::DisplayFromStr")]
pub method: Method,
#[serde(default)]
pub username: Option<String>,
#[serde(default)]
pub password: Option<String>,
#[serde(default)]
pub token: Option<String>,
#[serde(default)]
pub tls_insecure: bool,
#[serde(default)]
pub tls_certificate: Option<String>,
#[serde(default)]
pub headers: HashMap<String, String>,
#[serde(default, with = "humantime_serde")]
pub timeout: Option<Duration>,
#[serde(default = "default_error_delay", with = "humantime_serde")]
pub error_delay: Duration,
#[serde(default = "default_retries")]
pub retries: usize,
}
impl Default for EndpointConfig {
fn default() -> Self {
Self {
method: default_method(),
username: None,
password: None,
token: None,
tls_insecure: false,
tls_certificate: None,
headers: Default::default(),
timeout: None,
error_delay: default_error_delay(),
retries: default_retries(),
}
}
}
const fn default_error_delay() -> Duration {
Duration::from_secs(1)
}
const fn default_retries() -> usize {
5
}
const fn default_method() -> Method {
Method::POST
}
#[cfg(test)]
mod test {
use super::*;
use maplit::*;
#[test]
fn test_cfg_kafka() {
let env = convert_args!(hashmap!(
"MODE" => "kafka",
"BOOTSTRAP_SERVERS" => "bootstrap:9091",
"TOPIC" => "topic",
"PROPERTIES__FOO_BAR" => "baz",
"K_SINK" => "http://localhost",
));
let cfg = Config::from_env_source(env).unwrap();
assert_eq!(
cfg.mode,
Mode::Kafka(KafkaConfig {
topic: "topic".to_string(),
bootstrap_servers: "bootstrap:9091".into(),
properties: convert_args!(hashmap!(
"foo_bar" => "baz",
))
})
);
}
#[test]
fn test_cfg_ws() {
let env = convert_args!(hashmap!(
"MODE" => "ws",
"DROGUE_APP" => "app",
"DROGUE_ENDPOINT" => "endpoint",
"DROGUE_USER" => "user",
"DROGUE_TOKEN" => "token",
"K_SINK" => "http://localhost",
));
let cfg = Config::from_env_source(env).unwrap();
assert_eq!(
cfg.mode,
Mode::Websocket(WebsocketConfig {
drogue_app: "app".into(),
drogue_endpoint: "endpoint".into(),
drogue_user: "user".into(),
drogue_token: "token".into(),
})
);
}
#[test]
fn test_cfg_endpoint() {
let env = convert_args!(hashmap!(
"MODE" => "ws",
"DROGUE_APP" => "app",
"DROGUE_ENDPOINT" => "endpoint",
"DROGUE_USER" => "user",
"DROGUE_TOKEN" => "token",
"K_SINK" => "http://localhost",
"ENDPOINT__METHOD" => "GET",
"ENDPOINT__HEADERS__foo" => "bar",
));
let cfg = Config::from_env_source(env).unwrap();
assert_eq!(
cfg.endpoint,
EndpointConfig {
method: Method::GET,
username: None,
password: None,
token: None,
tls_insecure: false,
tls_certificate: None,
headers: convert_args!(hashmap!(
"foo" => "bar"
)),
timeout: None,
error_delay: default_error_delay(),
retries: 5
}
);
}
}
| use anyhow::Result;
use reqwest::Method;
use serde::Deserialize;
use serde_with::serde_as;
use std::collections::HashMap;
use std::time::Duration;
pub trait ConfigFromEnv<'de>: Sized + Deserialize<'de> {
fn from_env() -> Result<Self, config::ConfigError> {
Self::from(config::Environment::default())
}
fn from_env_source(source: HashMap<String, String>) -> Result<Self, config::ConfigError> {
Self::from(config::Environment::default().source(Some(source)))
}
fn from_env_prefix<S: AsRef<str>>(prefix: S) -> Result<Self, config::ConfigError> {
Self::from(config::Environment::with_prefix(prefix.as_ref()))
}
fn from(env: config::Environment) -> Result<Self, config::ConfigError>;
}
impl<'de, T: Deserialize<'de> + Sized> ConfigFromEnv<'de> for T {
fn from(env: config::Environment) -> Result<T, config::ConfigError> {
|
}
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
#[serde(tag = "mode")]
#[serde(rename_all = "lowercase")]
pub enum Mode {
Kafka(KafkaConfig),
#[serde(alias = "ws")]
Websocket(WebsocketConfig),
}
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
pub struct KafkaConfig {
pub topic: String,
pub bootstrap_servers: String,
#[serde(default)]
pub properties: HashMap<String, String>,
}
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
pub struct WebsocketConfig {
pub drogue_endpoint: String,
pub drogue_app: String,
pub drogue_user: String,
pub drogue_token: String,
}
#[derive(Clone, Debug, Deserialize)]
pub struct Config {
#[serde(default)]
pub endpoint: EndpointConfig,
pub k_sink: String,
#[serde(flatten)]
pub mode: Mode,
}
#[serde_as]
#[derive(Clone, Debug, Deserialize, Eq, PartialEq)]
pub struct EndpointConfig {
#[serde(default = "default_method")]
#[serde_as(as = "serde_with::DisplayFromStr")]
pub method: Method,
#[serde(default)]
pub username: Option<String>,
#[serde(default)]
pub password: Option<String>,
#[serde(default)]
pub token: Option<String>,
#[serde(default)]
pub tls_insecure: bool,
#[serde(default)]
pub tls_certificate: Option<String>,
#[serde(default)]
pub headers: HashMap<String, String>,
#[serde(default, with = "humantime_serde")]
pub timeout: Option<Duration>,
#[serde(default = "default_error_delay", with = "humantime_serde")]
pub error_delay: Duration,
#[serde(default = "default_retries")]
pub retries: usize,
}
impl Default for EndpointConfig {
fn default() -> Self {
Self {
method: default_method(),
username: None,
password: None,
token: None,
tls_insecure: false,
tls_certificate: None,
headers: Default::default(),
timeout: None,
error_delay: default_error_delay(),
retries: default_retries(),
}
}
}
const fn default_error_delay() -> Duration {
Duration::from_secs(1)
}
const fn default_retries() -> usize {
5
}
const fn default_method() -> Method {
Method::POST
}
#[cfg(test)]
mod test {
use super::*;
use maplit::*;
#[test]
fn test_cfg_kafka() {
let env = convert_args!(hashmap!(
"MODE" => "kafka",
"BOOTSTRAP_SERVERS" => "bootstrap:9091",
"TOPIC" => "topic",
"PROPERTIES__FOO_BAR" => "baz",
"K_SINK" => "http://localhost",
));
let cfg = Config::from_env_source(env).unwrap();
assert_eq!(
cfg.mode,
Mode::Kafka(KafkaConfig {
topic: "topic".to_string(),
bootstrap_servers: "bootstrap:9091".into(),
properties: convert_args!(hashmap!(
"foo_bar" => "baz",
))
})
);
}
#[test]
fn test_cfg_ws() {
let env = convert_args!(hashmap!(
"MODE" => "ws",
"DROGUE_APP" => "app",
"DROGUE_ENDPOINT" => "endpoint",
"DROGUE_USER" => "user",
"DROGUE_TOKEN" => "token",
"K_SINK" => "http://localhost",
));
let cfg = Config::from_env_source(env).unwrap();
assert_eq!(
cfg.mode,
Mode::Websocket(WebsocketConfig {
drogue_app: "app".into(),
drogue_endpoint: "endpoint".into(),
drogue_user: "user".into(),
drogue_token: "token".into(),
})
);
}
#[test]
fn test_cfg_endpoint() {
let env = convert_args!(hashmap!(
"MODE" => "ws",
"DROGUE_APP" => "app",
"DROGUE_ENDPOINT" => "endpoint",
"DROGUE_USER" => "user",
"DROGUE_TOKEN" => "token",
"K_SINK" => "http://localhost",
"ENDPOINT__METHOD" => "GET",
"ENDPOINT__HEADERS__foo" => "bar",
));
let cfg = Config::from_env_source(env).unwrap();
assert_eq!(
cfg.endpoint,
EndpointConfig {
method: Method::GET,
username: None,
password: None,
token: None,
tls_insecure: false,
tls_certificate: None,
headers: convert_args!(hashmap!(
"foo" => "bar"
)),
timeout: None,
error_delay: default_error_delay(),
retries: 5
}
);
}
}
| let cfg = config::Config::builder()
.add_source(env.separator("__"))
.build()?;
cfg.try_deserialize()
} | function_block-function_prefix_line | [
{
"content": "use crate::EndpointConfig;\n\nuse anyhow::bail;\n\nuse cloudevents::binding::reqwest::RequestBuilderExt;\n\nuse reqwest::{Certificate, Url};\n\nuse std::time::Duration;\n\nuse thiserror::Error;\n\n\n\npub struct Sender {\n\n config: EndpointConfig,\n\n url: Url,\n\n client: reqwest::Clien... |
Rust | src/lib.rs | DomWilliams0/panik-rs | 493ac556522b245c54e070bc44119fc1c99a488c |
use backtrace::Backtrace;
use std::borrow::Cow;
use std::fmt::Debug;
use std::panic::{PanicInfo, UnwindSafe};
use std::thread::ThreadId;
use std::cmp::Ordering;
use std::ops::DerefMut;
#[cfg(feature = "use-parking-lot")]
use parking_lot::Mutex;
#[cfg(not(feature = "use-parking-lot"))]
use std::sync::Mutex;
const DEFAULT_BACKTRACE_RESOLUTION_LIMIT: usize = 8;
lazy_static::lazy_static! {
static ref STATE: Mutex<State> = Mutex::new(State::default());
}
macro_rules! log_warn {
($state:expr, $($arg:tt)+) => {
#[cfg(feature = "use-slog")]
slog::warn!(&$state.slogger, $($arg)+);
#[cfg(feature = "use-log")]
log::warn!($($arg)+);
#[cfg(feature = "use-stderr")]
eprintln!($($arg)+);
}
}
macro_rules! log_error {
($state:expr, $($arg:tt)+) => {
#[cfg(feature = "use-slog")]
slog::error!(&$state.slogger, $($arg)+);
#[cfg(feature = "use-log")]
log::error!($($arg)+);
#[cfg(feature = "use-stderr")]
eprintln!($($arg)+);
}
}
macro_rules! log_crit {
($state:expr, $($arg:tt)+) => {
#[cfg(feature = "use-slog")]
slog::crit!(&$state.slogger, $($arg)+);
#[cfg(feature = "use-log")]
log::error!($($arg)+);
#[cfg(feature = "use-stderr")]
eprintln!($($arg)+);
}
}
struct State {
panics: Vec<Panic>,
backtrace_resolution_limit: usize,
is_running: bool,
#[cfg(feature = "use-slog")]
slogger: slog::Logger,
}
#[derive(Debug, Clone)]
pub struct Panic {
message: String,
thread_id: ThreadId,
thread: String,
backtrace: Backtrace,
backtrace_resolved: bool,
}
#[derive(Clone)]
pub struct Builder {
#[cfg(feature = "use-slog")]
slogger: Option<slog::Logger>,
backtrace_resolution_limit: usize,
}
struct GlobalStateGuard;
impl Builder {
pub fn new() -> Self {
Builder {
#[cfg(feature = "use-slog")]
slogger: None,
backtrace_resolution_limit: DEFAULT_BACKTRACE_RESOLUTION_LIMIT,
}
}
#[cfg(feature = "use-slog")]
pub fn slogger(mut self, slogger: impl Into<slog::Logger>) -> Self {
self.slogger = Some(slogger.into());
self
}
pub fn backtrace_resolution_limit(mut self, n: usize) -> Self {
self.backtrace_resolution_limit = n;
self
}
fn apply_settings(&mut self) {
let mut state = state_mutex();
#[cfg(feature = "use-slog")]
{
state.slogger = self.slogger.take().unwrap_or_else(default_slogger);
}
state.backtrace_resolution_limit = self.backtrace_resolution_limit;
}
pub fn run_and_handle_panics<R: Debug>(
mut self,
do_me: impl FnOnce() -> R + UnwindSafe,
) -> Option<R> {
self.apply_settings();
run_and_handle_panics(do_me)
}
pub fn run_and_handle_panics_no_debug<R>(
mut self,
do_me: impl FnOnce() -> R + UnwindSafe,
) -> Option<R> {
self.apply_settings();
run_and_handle_panics_no_debug(do_me)
}
}
impl Default for Builder {
fn default() -> Self {
Self::new()
}
}
fn register_panic(panic: &PanicInfo) {
let (thread, tid) = {
let t = std::thread::current();
let name = t.name().unwrap_or("<unnamed>");
(format!("{:?} ({})", t.id(), name), t.id())
};
let message = panic
.payload()
.downcast_ref::<&str>()
.map(|s| Cow::Borrowed(*s))
.unwrap_or_else(|| Cow::from(format!("{}", panic)));
let backtrace = Backtrace::new_unresolved();
let mut state = state_mutex();
log_error!(&state, "handling panic on thread {}: '{}'", thread, message);
state.panics.push(Panic {
message: message.into_owned(),
thread_id: tid,
thread,
backtrace,
backtrace_resolved: false,
});
}
fn state_mutex() -> impl DerefMut<Target = State> {
#[cfg(feature = "use-parking-lot")]
return STATE.lock();
#[cfg(not(feature = "use-parking-lot"))]
STATE.lock().unwrap()
}
pub fn run_and_handle_panics_no_debug<R>(do_me: impl FnOnce() -> R + UnwindSafe) -> Option<R> {
run_and_handle_panics_with_maybe_debug(do_me, |_| Cow::Borrowed("<unprintable>"))
}
pub fn run_and_handle_panics<R: Debug>(do_me: impl FnOnce() -> R + UnwindSafe) -> Option<R> {
run_and_handle_panics_with_maybe_debug(do_me, |res| Cow::Owned(format!("{:?}", res)))
}
fn run_and_handle_panics_with_maybe_debug<R>(
do_me: impl FnOnce() -> R + UnwindSafe,
format_swallowed: impl FnOnce(R) -> Cow<'static, str>,
) -> Option<R> {
let _guard = GlobalStateGuard::init();
let result = std::panic::catch_unwind(|| do_me());
let mut state = state_mutex();
match (result, state.panics.is_empty()) {
(Ok(res), true) => {
return Some(res);
}
(Ok(res), false) => {
let swallowed = format_swallowed(res);
log_warn!(
&state,
"panic occurred in another thread, swallowing unpanicked result: {}",
swallowed
);
}
(Err(_), false) => {}
(Err(_), true) => unreachable!(),
};
log_error!(
&state,
"{count} threads panicked",
count = state.panics.len()
);
let backtrace_resolution_limit = state.backtrace_resolution_limit;
let mut panics = std::mem::take(&mut state.panics);
debug_assert!(!panics.is_empty(), "panics vec should not be empty");
for (
i,
Panic {
message,
thread,
ref mut backtrace,
backtrace_resolved,
..
},
) in panics.iter_mut().enumerate()
{
match i.cmp(&backtrace_resolution_limit) {
Ordering::Less => {
backtrace.resolve();
*backtrace_resolved = true;
}
Ordering::Equal => {
#[cfg(feature = "use-log")]
log::warn!(
"handling more than {limit} panics, no longer resolving backtraces",
limit = backtrace_resolution_limit
);
#[cfg(feature = "use-stderr")]
eprintln!(
"handling more than {limit} panics, no longer resolving backtraces",
limit = backtrace_resolution_limit
);
}
_ => {}
};
if *backtrace_resolved {
log_crit!(
&state,
"panic on thread {:?}: {:?}\n{:?}",
thread,
message,
backtrace
);
} else {
log_crit!(&state, "panic on thread {:?}: {:?}", thread, message,);
}
}
let empty = std::mem::replace(&mut state.panics, panics);
debug_assert!(empty.is_empty());
std::mem::forget(empty);
None
}
pub fn panics() -> Vec<Panic> {
let state = state_mutex();
state.panics.clone()
}
pub fn has_panicked() -> bool {
!state_mutex().panics.is_empty()
}
impl Panic {
pub fn is_backtrace_resolved(&self) -> bool {
self.backtrace_resolved
}
pub fn message(&self) -> &str {
&self.message
}
pub fn thread_id(&self) -> ThreadId {
self.thread_id
}
pub fn thread_name(&self) -> &str {
&self.thread
}
pub fn backtrace(&self) -> &Backtrace {
&self.backtrace
}
}
impl GlobalStateGuard {
fn init() -> Self {
let mut state = state_mutex();
if state.is_running {
drop(state);
panic!("nested calls to panik::run_and_handle_panics are not supported")
}
state.panics.clear();
state.is_running = true;
std::panic::set_hook(Box::new(|panic| {
register_panic(panic);
}));
Self
}
}
impl Drop for GlobalStateGuard {
fn drop(&mut self) {
let _ = std::panic::take_hook();
let mut state = state_mutex();
state.backtrace_resolution_limit = DEFAULT_BACKTRACE_RESOLUTION_LIMIT;
state.is_running = false;
#[cfg(feature = "use-slog")]
{
state.slogger = default_slogger();
}
}
}
impl Default for State {
fn default() -> Self {
State {
panics: Vec::new(),
backtrace_resolution_limit: DEFAULT_BACKTRACE_RESOLUTION_LIMIT,
is_running: false,
#[cfg(feature = "use-slog")]
slogger: default_slogger(),
}
}
}
#[cfg(feature = "use-slog")]
fn default_slogger() -> slog::Logger {
use slog::Drain;
slog::Logger::root(slog_stdlog::StdLog.fuse(), slog::o!())
}
|
use backtrace::Backtrace;
use std::borrow::Cow;
use std::fmt::Debug;
use std::panic::{PanicInfo, UnwindSafe};
use std::thread::ThreadId;
use std::cmp::Ordering;
use std::ops::DerefMut;
#[cfg(feature = "use-parking-lot")]
use parking_lot::Mutex;
#[cfg(not(feature = "use-parking-lot"))]
use std::sync::Mutex;
const DEFAULT_BACKTRACE_RESOLUTION_LIMIT: usize = 8;
lazy_static::lazy_static! {
static ref STATE: Mutex<State> = Mutex::new(State::default());
}
macro_rules! log_warn {
($state:expr, $($arg:tt)+) => {
#[cfg(feature = "use-slog")]
slog::warn!(&$state.slogger, $($arg)+);
#[cfg(feature = "use-log")]
log::warn!($($arg)+);
#[cfg(feature = "use-stderr")]
eprintln!($($arg)+);
}
}
macro_rules! log_error {
($state:expr, $($arg:tt)+) => {
#[cfg(feature = "use-slog")]
slog::error!(&$state.slogger, $($arg)+);
#[cfg(feature = "use-log")]
log::error!($($arg)+);
#[cfg(feature = "use-stderr")]
eprintln!($($arg)+);
}
}
macro_rules! log_crit {
($state:expr, $($arg:tt)+) => {
#[cfg(feature = "use-slog")]
slog::crit!(&$state.slogger, $($arg)+);
#[cfg(feature = "use-log")]
log::error!($($arg)+);
#[cfg(feature = "use-stderr")]
eprintln!($($arg)+);
}
}
struct State {
panics: Vec<Panic>,
backtrace_resolution_limit: usize,
is_running: bool,
#[cfg(feature = "use-slog")]
slogger: slog::Logger,
}
#[derive(Debug, Clone)]
pub struct Panic {
message: String,
thread_id: ThreadId,
thread: String,
backtrace: Backtrace,
backtrace_resolved: bool,
}
#[derive(Clone)]
pub struct Builder {
#[cfg(feature = "use-slog")]
slogger: Option<slog::Logger>,
backtrace_resolution_limit: usize,
}
struct GlobalStateGuard;
impl Builder {
pub fn new() -> Self {
Builder {
#[cfg(feature = "use-slog")]
slogger: None,
backtrace_resolution_limit: DEFAULT_BACKTRACE_RESOLUTION_LIMIT,
}
}
#[cfg(feature = "use-slog")]
pub fn slogger(mut self, slogger: impl Into<slog::Logger>) -> Self {
self.slogger = Some(slogger.into());
self
}
pub fn backtrace_resolution_limit(mut self, n: usize) -> Self {
self.backtrace_resolution_limit = n;
self
}
fn apply_settings(&mut self) {
let mut state = state_mutex();
#[cfg(feature = "use-slog")]
{
state.slogger = self.slogger.take().unwrap_or_else(default_slogger);
}
state.backtrace_resolution_limit = self.backtrace_resolution_limit;
}
pub fn run_and_handle_panics<R: Debug>(
mut self,
do_me: impl FnOnce() -> R + UnwindSafe,
) -> Option<R> {
self.apply_settings();
run_and_handle_panics(do_me)
}
pub fn run_and_handle_panics_no_debug<R>(
mut self,
do_me: impl FnOnce() -> R + UnwindSafe,
) -> Option<R> {
self.apply_settings();
run_and_handle_panics_no_debug(do_me)
}
}
impl Default for Builder {
fn default() -> Self {
Self::new()
}
}
fn register_panic(panic: &PanicInfo) {
let (thread, tid) = {
let t = std::thread::current();
let name = t.name().unwrap_or("<unnamed>");
(format!("{:?} ({})", t.id(), name), t.id())
};
let message = panic
.payload()
.downcast_ref::<&str>()
.map(|s| Cow::Borrowed(*s))
.unwrap_or_else(|| Cow::from(format!("{}", panic)));
let backtrace = Backtrace::new_unresolved();
let mut state = state_mutex();
log_error!(&state, "handling panic on thread {}: '{}'", thread, message);
state.panics.push(Panic {
message: message.into_owned(),
thread_id: tid,
thread,
backtrace,
backtrace_resolved: false,
});
}
fn state_mutex() -> impl DerefMut<Target = State> {
#[cfg(feature = "use-parking-lot")]
return STATE.lock();
#[cfg(not(feature = "use-parking-lot"))]
STATE.lock().unwrap()
}
pub fn run_and_handle_panics_no_debug<R>(do_me: impl FnOnce() -> R + UnwindSafe) -> Option<R> {
run_and_handle_panics_with_maybe_debug(do_me, |_| Cow::Borrowed("<unprintable>"))
}
pub fn run_and_handle_panics<R: Debug>(do_me: impl FnOnce() -> R + UnwindSafe) -> Option<R> {
run_and_handle_panics_with_maybe_debug(do_me, |res| Cow::Owned(format!("{:?}", res)))
}
fn run_and_handle_panics_with_maybe_debug<R>(
do_me: impl FnOnce() -> R + UnwindSafe,
format_swallowed: impl FnOnce(R) -> Cow<'static, str>,
) -> Option<R> {
let _guard = GlobalStateGuard::init();
let result = std::panic::catch_unwind(|| do_me());
let mut state = state_mutex();
match (result, state.panics.is_empty()) {
(Ok(res), true) => {
return Some(res);
}
(Ok(res), false) => {
let swallowed = format_swallowed(res);
log_warn!(
&state,
"panic occurred in another thread, swallowing unpanicked result: {}",
swallowed
);
}
(Err(_), false) => {}
(Err(_), true) => unreachable!(),
};
log_error!(
&state,
"{count} threads panicked",
count = state.panics.len()
);
let backtrace_resolution_limit = state.backtrace_resolution_limit;
let mut panics = std::mem::take(&mut state.panics);
debug_assert!(!panics.is_empty(), "panics vec should not be empty");
for (
i,
Panic {
message,
thread,
ref mut backtrace,
backtrace_resolved,
..
},
) in panics.iter_mut().enumerate()
{
| ;
if *backtrace_resolved {
log_crit!(
&state,
"panic on thread {:?}: {:?}\n{:?}",
thread,
message,
backtrace
);
} else {
log_crit!(&state, "panic on thread {:?}: {:?}", thread, message,);
}
}
let empty = std::mem::replace(&mut state.panics, panics);
debug_assert!(empty.is_empty());
std::mem::forget(empty);
None
}
pub fn panics() -> Vec<Panic> {
let state = state_mutex();
state.panics.clone()
}
pub fn has_panicked() -> bool {
!state_mutex().panics.is_empty()
}
impl Panic {
pub fn is_backtrace_resolved(&self) -> bool {
self.backtrace_resolved
}
pub fn message(&self) -> &str {
&self.message
}
pub fn thread_id(&self) -> ThreadId {
self.thread_id
}
pub fn thread_name(&self) -> &str {
&self.thread
}
pub fn backtrace(&self) -> &Backtrace {
&self.backtrace
}
}
impl GlobalStateGuard {
fn init() -> Self {
let mut state = state_mutex();
if state.is_running {
drop(state);
panic!("nested calls to panik::run_and_handle_panics are not supported")
}
state.panics.clear();
state.is_running = true;
std::panic::set_hook(Box::new(|panic| {
register_panic(panic);
}));
Self
}
}
impl Drop for GlobalStateGuard {
fn drop(&mut self) {
let _ = std::panic::take_hook();
let mut state = state_mutex();
state.backtrace_resolution_limit = DEFAULT_BACKTRACE_RESOLUTION_LIMIT;
state.is_running = false;
#[cfg(feature = "use-slog")]
{
state.slogger = default_slogger();
}
}
}
impl Default for State {
fn default() -> Self {
State {
panics: Vec::new(),
backtrace_resolution_limit: DEFAULT_BACKTRACE_RESOLUTION_LIMIT,
is_running: false,
#[cfg(feature = "use-slog")]
slogger: default_slogger(),
}
}
}
#[cfg(feature = "use-slog")]
fn default_slogger() -> slog::Logger {
use slog::Drain;
slog::Logger::root(slog_stdlog::StdLog.fuse(), slog::o!())
}
| match i.cmp(&backtrace_resolution_limit) {
Ordering::Less => {
backtrace.resolve();
*backtrace_resolved = true;
}
Ordering::Equal => {
#[cfg(feature = "use-log")]
log::warn!(
"handling more than {limit} panics, no longer resolving backtraces",
limit = backtrace_resolution_limit
);
#[cfg(feature = "use-stderr")]
eprintln!(
"handling more than {limit} panics, no longer resolving backtraces",
limit = backtrace_resolution_limit
);
}
_ => {}
} | if_condition | [
{
"content": "pub fn panik_builder() -> panik::Builder {\n\n #[cfg(feature = \"use-log\")]\n\n env_logger::builder()\n\n .is_test(true)\n\n .filter_level(log::LevelFilter::Debug)\n\n .init();\n\n\n\n #[cfg(feature = \"use-slog\")]\n\n {\n\n use slog::{slog_o, Drain};\n\n\... |
Rust | 2021/src/day19.rs | shrugalic/advent_of_code | 8d18a3dbdcf847a667ab553f5441676003b9362a | use std::collections::{HashMap, HashSet, VecDeque};
const INPUT: &str = include_str!("../input/day19.txt");
pub(crate) fn day19_part1() -> usize {
System::from(INPUT).beacon_count()
}
pub(crate) fn day19_part2() -> usize {
System::from(INPUT).max_manhattan_distance()
}
type Coordinate = isize;
type Vector = [Coordinate; 3];
#[derive(Debug)]
struct System {
scanners: Vec<Scanner>,
}
impl From<&str> for System {
fn from(input: &str) -> Self {
let scanners = input.trim().split("\n\n").map(Scanner::from).collect();
System { scanners }
}
}
impl System {
fn beacon_count(self) -> usize {
self.align_beacons().0
}
fn max_manhattan_distance(self) -> usize {
self.align_beacons().1
}
fn align_beacons(mut self) -> (usize, usize) {
let mut distances_to_ref = vec![[0, 0, 0]; self.scanners.len()];
let reference = self.scanners.remove(0);
let mut unique_beacons: HashSet<Vector> = reference.beacons.iter().cloned().collect();
let mut aligned = VecDeque::new();
aligned.push_back(reference);
let mut unaligned: Vec<Scanner> = self.scanners.drain(..).collect();
while let Some(reference) = aligned.pop_front() {
let mut still_unaligned = vec![];
while let Some(mut scanner) = unaligned.pop() {
if let Some(offset) = scanner.align_with(&reference.beacons) {
unique_beacons.extend(scanner.beacons.clone());
distances_to_ref[scanner.id] = offset;
aligned.push_back(scanner);
} else {
still_unaligned.push(scanner);
}
}
unaligned.append(&mut still_unaligned);
aligned.push_back(reference);
if unaligned.is_empty() {
break;
}
}
let distances_between_scanners = Scanner::offsets_between(&distances_to_ref)
.into_iter()
.map(|(d, _)| d);
let max_manhattan_distance = distances_between_scanners
.map(|[a, b, c]| (a.abs() + b.abs() + c.abs()) as usize)
.max()
.unwrap();
(unique_beacons.len(), max_manhattan_distance)
}
}
#[derive(Debug)]
struct Scanner {
id: usize,
beacons: Vec<Vector>,
}
impl From<&str> for Scanner {
fn from(lines: &str) -> Self {
let to_position = |line: &str| {
let pos: Vec<Coordinate> = line.split(',').map(|n| n.parse().unwrap()).collect();
[pos[0], pos[1], pos[2]]
};
let mut lines = lines.trim().lines();
let header = lines.next().unwrap();
let id = header
.trim_start_matches("--- scanner ")
.trim_end_matches(" ---")
.parse()
.unwrap();
let beacons: Vec<_> = lines.map(to_position).collect();
Scanner { id, beacons }
}
}
impl Scanner {
fn align_with(&mut self, ref_beacons: &[Vector]) -> Option<Vector> {
for orientation in Orientation::all() {
let mut offset_frequencies: HashMap<Vector, usize> = HashMap::new();
let aligned_beacons = self.aligned_beacons(&orientation);
for own_beacon in &aligned_beacons {
for ref_beacon in ref_beacons {
let offset = Scanner::offset_between(ref_beacon, own_beacon);
*offset_frequencies.entry(offset).or_default() += 1;
}
}
if let Some((offset, _)) = offset_frequencies
.into_iter()
.find(|(_, count)| *count >= 12)
{
self.beacons = Scanner::translate_beacons(&aligned_beacons, offset);
return Some(offset);
}
}
None
}
fn aligned_beacons(&self, orientation: &Orientation) -> Vec<Vector> {
self.beacons
.iter()
.map(|pos| orientation.align(*pos))
.collect()
}
fn translate_beacons(beacons: &[Vector], offset: Vector) -> Vec<Vector> {
beacons
.iter()
.map(|pos| [pos[0] + offset[0], pos[1] + offset[1], pos[2] + offset[2]])
.collect()
}
fn offset_between(a: &Vector, b: &Vector) -> Vector {
[a[0] - b[0], a[1] - b[1], a[2] - b[2]]
}
fn offsets_between(beacons: &[Vector]) -> HashMap<Vector, Vec<Vector>> {
let mut distances: HashMap<Vector, Vec<Vector>> = HashMap::new();
for (i, a) in beacons.iter().enumerate().take(beacons.len() - 1) {
for b in beacons.iter().skip(i + 1) {
let diff = Scanner::offset_between(a, b);
let positions = distances.entry(diff).or_default();
positions.push(*a);
positions.push(*b);
}
}
assert_eq!(distances.len(), beacons.len() * (beacons.len() - 1) / 2);
distances
}
}
#[derive(Debug, Copy, Clone)]
struct Orientation {
index: [usize; 3],
multi: [isize; 3],
}
impl Orientation {
fn new(index: [usize; 3], multi: [isize; 3]) -> Self {
Orientation { index, multi }
}
fn all() -> Vec<Orientation> {
vec![
Orientation::new([0, 1, 2], [1, 1, 1]),
Orientation::new([0, 2, 1], [1, 1, -1]),
Orientation::new([0, 1, 2], [1, -1, -1]),
Orientation::new([0, 2, 1], [1, -1, 1]),
Orientation::new([0, 2, 1], [-1, 1, 1]),
Orientation::new([0, 1, 2], [-1, 1, -1]),
Orientation::new([0, 2, 1], [-1, -1, -1]),
Orientation::new([0, 1, 2], [-1, -1, 1]),
Orientation::new([1, 2, 0], [1, 1, 1]),
Orientation::new([1, 0, 2], [1, 1, -1]),
Orientation::new([1, 2, 0], [1, -1, -1]),
Orientation::new([1, 0, 2], [1, -1, 1]),
Orientation::new([1, 0, 2], [-1, 1, 1]),
Orientation::new([1, 2, 0], [-1, 1, -1]),
Orientation::new([1, 0, 2], [-1, -1, -1]),
Orientation::new([1, 2, 0], [-1, -1, 1]),
Orientation::new([2, 0, 1], [1, 1, 1]),
Orientation::new([2, 1, 0], [1, 1, -1]),
Orientation::new([2, 0, 1], [1, -1, -1]),
Orientation::new([2, 1, 0], [1, -1, 1]),
Orientation::new([2, 1, 0], [-1, 1, 1]),
Orientation::new([2, 0, 1], [-1, 1, -1]),
Orientation::new([2, 1, 0], [-1, -1, -1]),
Orientation::new([2, 0, 1], [-1, -1, 1]),
]
}
fn align(&self, mut pos: Vector) -> Vector {
pos = [pos[self.index[0]], pos[self.index[1]], pos[self.index[2]]];
(0..3).for_each(|i| pos[i] *= self.multi[i]);
pos
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_orientations() {
let pos = [5, 6, -4];
let mut orientations: Vec<_> = Orientation::all()
.into_iter()
.map(|o| o.align(pos))
.collect();
orientations.sort_unstable();
assert_eq!(
24,
orientations
.iter()
.cloned()
.collect::<HashSet<Vector>>()
.len()
);
assert!(orientations.contains(&[5, 6, -4]));
assert!(orientations.contains(&[-5, 4, -6]));
assert!(orientations.contains(&[4, 6, 5]));
assert!(orientations.contains(&[-4, -6, 5]));
assert!(orientations.contains(&[-6, -4, -5]));
let expected = vec![
[-6, -5, 4],
[-6, -4, -5],
[-6, 4, 5],
[-6, 5, -4],
[-5, -6, -4],
[-5, -4, 6],
[-5, 4, -6],
[-5, 6, 4],
[-4, -6, 5],
[-4, -5, -6],
[-4, 5, 6],
[-4, 6, -5],
[4, -6, -5],
[4, -5, 6],
[4, 5, -6],
[4, 6, 5],
[5, -6, 4],
[5, -4, -6],
[5, 4, 6],
[5, 6, -4],
[6, -5, -4],
[6, -4, 5],
[6, 4, -5],
[6, 5, 4],
];
assert_eq!(expected, orientations);
}
#[test]
fn part1_example() {
let system = System::from(EXAMPLE);
assert_eq!(79, system.beacon_count());
}
#[test]
fn part1() {
assert_eq!(398, day19_part1());
}
#[test]
fn part2_example() {
assert_eq!(3621, System::from(EXAMPLE).max_manhattan_distance());
}
#[test]
fn part2() {
assert_eq!(10965, day19_part2());
}
const EXAMPLE: &str = "\
--- scanner 0 ---
404,-588,-901
528,-643,409
-838,591,734
390,-675,-793
-537,-823,-458
-485,-357,347
-345,-311,381
-661,-816,-575
-876,649,763
-618,-824,-621
553,345,-567
474,580,667
-447,-329,318
-584,868,-557
544,-627,-890
564,392,-477
455,729,728
-892,524,684
-689,845,-530
423,-701,434
7,-33,-71
630,319,-379
443,580,662
-789,900,-551
459,-707,401
--- scanner 1 ---
686,422,578
605,423,415
515,917,-361
-336,658,858
95,138,22
-476,619,847
-340,-569,-846
567,-361,727
-460,603,-452
669,-402,600
729,430,532
-500,-761,534
-322,571,750
-466,-666,-811
-429,-592,574
-355,545,-477
703,-491,-529
-328,-685,520
413,935,-424
-391,539,-444
586,-435,557
-364,-763,-893
807,-499,-711
755,-354,-619
553,889,-390
--- scanner 2 ---
649,640,665
682,-795,504
-784,533,-524
-644,584,-595
-588,-843,648
-30,6,44
-674,560,763
500,723,-460
609,671,-379
-555,-800,653
-675,-892,-343
697,-426,-610
578,704,681
493,664,-388
-671,-858,530
-667,343,800
571,-461,-707
-138,-166,112
-889,563,-600
646,-828,498
640,759,510
-630,509,768
-681,-892,-333
673,-379,-804
-742,-814,-386
577,-820,562
--- scanner 3 ---
-589,542,597
605,-692,669
-500,565,-823
-660,373,557
-458,-679,-417
-488,449,543
-626,468,-788
338,-750,-386
528,-832,-391
562,-778,733
-938,-730,414
543,643,-506
-524,371,-870
407,773,750
-104,29,83
378,-903,-323
-778,-728,485
426,699,580
-438,-605,-362
-469,-447,-387
509,732,623
647,635,-688
-868,-804,481
614,-800,639
595,780,-596
--- scanner 4 ---
727,592,562
-293,-554,779
441,611,-461
-714,465,-776
-743,427,-804
-660,-479,-426
832,-632,460
927,-485,-438
408,393,-506
466,436,-512
110,16,151
-258,-428,682
-393,719,612
-211,-452,876
808,-476,-593
-575,615,604
-485,667,467
-680,325,-822
-627,-443,-432
872,-547,-609
833,512,582
807,604,487
839,-516,451
891,-625,532
-652,-548,-490
30,-46,-14
";
}
| use std::collections::{HashMap, HashSet, VecDeque};
const INPUT: &str = include_str!("../input/day19.txt");
pub(crate) fn day19_part1() -> usize {
System::from(INPUT).beacon_count()
}
pub(crate) fn day19_part2() -> usize {
System::from(INPUT).max_manhattan_distance()
}
type Coordinate = isize;
type Vector = [Coordinate; 3];
#[derive(Debug)]
struct System {
scanners: Vec<Scanner>,
}
impl From<&str> for System {
fn from(input: &str) -> Self {
let scanners = input.trim().split("\n\n").map(Scanner::from).collect();
System { scanners }
}
}
impl System {
fn beacon_count(self) -> usize {
self.align_beacons().0
}
fn max_manhattan_distance(self) -> usize {
self.align_beacons().1
}
fn align_beacons(mut self) -> (usize, usize) {
let mut distances_to_ref = vec![[0, 0, 0]; self.scanners.len()];
let reference = self.scanners.remove(0);
let mut unique_beacons: HashSet<Vector> = reference.beacons.iter().cloned().collect();
let mut aligned = VecDeque::new();
aligned.push_back(reference);
let mut unaligned: Vec<Scanner> = self.scanners.drain(..).collect();
while let Some(reference) = aligned.pop_front() {
let mut still_unaligned = vec![];
while let Some(mut scanner) = unaligned.pop() {
if let Some(offset) = scanner.align_with(&reference.beacons) {
unique_beacons.extend(scanner.beacons.clone());
distances_to_ref[scanner.id] = offset;
aligned.push_back(scanner);
} else {
still_unaligned.push(scanner);
}
}
unaligned.append(&mut still_unaligned);
aligned.push_back(reference);
if unaligned.is_empty() {
break;
}
}
let distances_between_scanners = Scanner::offsets_between(&distances_to_ref)
.into_iter()
.map(|(d, _)| d);
let max_manhattan_distance = distances_between_scanners
.map(|[a, b, c]| (a.abs() + b.abs() + c.abs()) as usize)
.max()
.unwrap();
(unique_beacons.len(), max_manhattan_distance)
}
}
#[derive(Debug)]
struct Scanner {
id: usize,
beacons: Vec<Vector>,
}
impl From<&str> for Scanner {
|
}
impl Scanner {
fn align_with(&mut self, ref_beacons: &[Vector]) -> Option<Vector> {
for orientation in Orientation::all() {
let mut offset_frequencies: HashMap<Vector, usize> = HashMap::new();
let aligned_beacons = self.aligned_beacons(&orientation);
for own_beacon in &aligned_beacons {
for ref_beacon in ref_beacons {
let offset = Scanner::offset_between(ref_beacon, own_beacon);
*offset_frequencies.entry(offset).or_default() += 1;
}
}
if let Some((offset, _)) = offset_frequencies
.into_iter()
.find(|(_, count)| *count >= 12)
{
self.beacons = Scanner::translate_beacons(&aligned_beacons, offset);
return Some(offset);
}
}
None
}
fn aligned_beacons(&self, orientation: &Orientation) -> Vec<Vector> {
self.beacons
.iter()
.map(|pos| orientation.align(*pos))
.collect()
}
fn translate_beacons(beacons: &[Vector], offset: Vector) -> Vec<Vector> {
beacons
.iter()
.map(|pos| [pos[0] + offset[0], pos[1] + offset[1], pos[2] + offset[2]])
.collect()
}
fn offset_between(a: &Vector, b: &Vector) -> Vector {
[a[0] - b[0], a[1] - b[1], a[2] - b[2]]
}
fn offsets_between(beacons: &[Vector]) -> HashMap<Vector, Vec<Vector>> {
let mut distances: HashMap<Vector, Vec<Vector>> = HashMap::new();
for (i, a) in beacons.iter().enumerate().take(beacons.len() - 1) {
for b in beacons.iter().skip(i + 1) {
let diff = Scanner::offset_between(a, b);
let positions = distances.entry(diff).or_default();
positions.push(*a);
positions.push(*b);
}
}
assert_eq!(distances.len(), beacons.len() * (beacons.len() - 1) / 2);
distances
}
}
#[derive(Debug, Copy, Clone)]
struct Orientation {
index: [usize; 3],
multi: [isize; 3],
}
impl Orientation {
fn new(index: [usize; 3], multi: [isize; 3]) -> Self {
Orientation { index, multi }
}
fn all() -> Vec<Orientation> {
vec![
Orientation::new([0, 1, 2], [1, 1, 1]),
Orientation::new([0, 2, 1], [1, 1, -1]),
Orientation::new([0, 1, 2], [1, -1, -1]),
Orientation::new([0, 2, 1], [1, -1, 1]),
Orientation::new([0, 2, 1], [-1, 1, 1]),
Orientation::new([0, 1, 2], [-1, 1, -1]),
Orientation::new([0, 2, 1], [-1, -1, -1]),
Orientation::new([0, 1, 2], [-1, -1, 1]),
Orientation::new([1, 2, 0], [1, 1, 1]),
Orientation::new([1, 0, 2], [1, 1, -1]),
Orientation::new([1, 2, 0], [1, -1, -1]),
Orientation::new([1, 0, 2], [1, -1, 1]),
Orientation::new([1, 0, 2], [-1, 1, 1]),
Orientation::new([1, 2, 0], [-1, 1, -1]),
Orientation::new([1, 0, 2], [-1, -1, -1]),
Orientation::new([1, 2, 0], [-1, -1, 1]),
Orientation::new([2, 0, 1], [1, 1, 1]),
Orientation::new([2, 1, 0], [1, 1, -1]),
Orientation::new([2, 0, 1], [1, -1, -1]),
Orientation::new([2, 1, 0], [1, -1, 1]),
Orientation::new([2, 1, 0], [-1, 1, 1]),
Orientation::new([2, 0, 1], [-1, 1, -1]),
Orientation::new([2, 1, 0], [-1, -1, -1]),
Orientation::new([2, 0, 1], [-1, -1, 1]),
]
}
fn align(&self, mut pos: Vector) -> Vector {
pos = [pos[self.index[0]], pos[self.index[1]], pos[self.index[2]]];
(0..3).for_each(|i| pos[i] *= self.multi[i]);
pos
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_orientations() {
let pos = [5, 6, -4];
let mut orientations: Vec<_> = Orientation::all()
.into_iter()
.map(|o| o.align(pos))
.collect();
orientations.sort_unstable();
assert_eq!(
24,
orientations
.iter()
.cloned()
.collect::<HashSet<Vector>>()
.len()
);
assert!(orientations.contains(&[5, 6, -4]));
assert!(orientations.contains(&[-5, 4, -6]));
assert!(orientations.contains(&[4, 6, 5]));
assert!(orientations.contains(&[-4, -6, 5]));
assert!(orientations.contains(&[-6, -4, -5]));
let expected = vec![
[-6, -5, 4],
[-6, -4, -5],
[-6, 4, 5],
[-6, 5, -4],
[-5, -6, -4],
[-5, -4, 6],
[-5, 4, -6],
[-5, 6, 4],
[-4, -6, 5],
[-4, -5, -6],
[-4, 5, 6],
[-4, 6, -5],
[4, -6, -5],
[4, -5, 6],
[4, 5, -6],
[4, 6, 5],
[5, -6, 4],
[5, -4, -6],
[5, 4, 6],
[5, 6, -4],
[6, -5, -4],
[6, -4, 5],
[6, 4, -5],
[6, 5, 4],
];
assert_eq!(expected, orientations);
}
#[test]
fn part1_example() {
let system = System::from(EXAMPLE);
assert_eq!(79, system.beacon_count());
}
#[test]
fn part1() {
assert_eq!(398, day19_part1());
}
#[test]
fn part2_example() {
assert_eq!(3621, System::from(EXAMPLE).max_manhattan_distance());
}
#[test]
fn part2() {
assert_eq!(10965, day19_part2());
}
const EXAMPLE: &str = "\
--- scanner 0 ---
404,-588,-901
528,-643,409
-838,591,734
390,-675,-793
-537,-823,-458
-485,-357,347
-345,-311,381
-661,-816,-575
-876,649,763
-618,-824,-621
553,345,-567
474,580,667
-447,-329,318
-584,868,-557
544,-627,-890
564,392,-477
455,729,728
-892,524,684
-689,845,-530
423,-701,434
7,-33,-71
630,319,-379
443,580,662
-789,900,-551
459,-707,401
--- scanner 1 ---
686,422,578
605,423,415
515,917,-361
-336,658,858
95,138,22
-476,619,847
-340,-569,-846
567,-361,727
-460,603,-452
669,-402,600
729,430,532
-500,-761,534
-322,571,750
-466,-666,-811
-429,-592,574
-355,545,-477
703,-491,-529
-328,-685,520
413,935,-424
-391,539,-444
586,-435,557
-364,-763,-893
807,-499,-711
755,-354,-619
553,889,-390
--- scanner 2 ---
649,640,665
682,-795,504
-784,533,-524
-644,584,-595
-588,-843,648
-30,6,44
-674,560,763
500,723,-460
609,671,-379
-555,-800,653
-675,-892,-343
697,-426,-610
578,704,681
493,664,-388
-671,-858,530
-667,343,800
571,-461,-707
-138,-166,112
-889,563,-600
646,-828,498
640,759,510
-630,509,768
-681,-892,-333
673,-379,-804
-742,-814,-386
577,-820,562
--- scanner 3 ---
-589,542,597
605,-692,669
-500,565,-823
-660,373,557
-458,-679,-417
-488,449,543
-626,468,-788
338,-750,-386
528,-832,-391
562,-778,733
-938,-730,414
543,643,-506
-524,371,-870
407,773,750
-104,29,83
378,-903,-323
-778,-728,485
426,699,580
-438,-605,-362
-469,-447,-387
509,732,623
647,635,-688
-868,-804,481
614,-800,639
595,780,-596
--- scanner 4 ---
727,592,562
-293,-554,779
441,611,-461
-714,465,-776
-743,427,-804
-660,-479,-426
832,-632,460
927,-485,-438
408,393,-506
466,436,-512
110,16,151
-258,-428,682
-393,719,612
-211,-452,876
808,-476,-593
-575,615,604
-485,667,467
-680,325,-822
-627,-443,-432
872,-547,-609
833,512,582
807,604,487
839,-516,451
891,-625,532
-652,-548,-490
30,-46,-14
";
}
| fn from(lines: &str) -> Self {
let to_position = |line: &str| {
let pos: Vec<Coordinate> = line.split(',').map(|n| n.parse().unwrap()).collect();
[pos[0], pos[1], pos[2]]
};
let mut lines = lines.trim().lines();
let header = lines.next().unwrap();
let id = header
.trim_start_matches("--- scanner ")
.trim_end_matches(" ---")
.parse()
.unwrap();
let beacons: Vec<_> = lines.map(to_position).collect();
Scanner { id, beacons }
} | function_block-full_function | [
{
"content": "fn max_distance_to_origin(input: Vec<&str>) -> usize {\n\n curr_and_max_distances_to_origin(input).1\n\n}\n\n\n",
"file_path": "2017/src/day11.rs",
"rank": 0,
"score": 388208.4410849393
},
{
"content": "fn sum_of_valid_sector_ids(input: Vec<&str>) -> usize {\n\n input\n\n... |
Rust | src/update_status.rs | FutureTVGroup/update-broker | 2d8468473b5b72a228a5bdae95f50789e0bbf3b4 |
use futures::Future;
use futures::Stream;
use inotify::wrapper::Event;
use slog::Logger;
use std::ffi::OsString;
use std::io::Result;
use std::io::{Error, ErrorKind};
use std::ops::Deref;
use std::path::Path;
use std::process::Command;
use std::rc::Rc;
use std::time::{SystemTime, UNIX_EPOCH};
use tokio_core::reactor::Handle;
use tokio_inotify::AsyncINotify;
use tokio_inotify::{IN_CREATE, IN_DELETE};
static VERSION_ZERO: &'static str = "0.0.0";
#[derive(Debug, PartialEq, Eq)]
#[allow(dead_code)]
pub enum UpdateStatus {
Idle,
CheckingForUpdate,
UpdateAvailable,
Downloading,
Verifying,
Finalizing,
UpdatedNeedReboot,
ReportingErrorEvent,
}
impl Deref for UpdateStatus {
type Target = str;
fn deref(&self) -> &'static str {
match *self {
UpdateStatus::Idle => &"UPDATE_STATUS_IDLE",
UpdateStatus::CheckingForUpdate => &"UPDATE_STATUS_CHECKING_FOR_UPDATE",
UpdateStatus::UpdateAvailable => &"UPDATE_STATUS_UPDATE_AVAILABLE",
UpdateStatus::Downloading => &"UPDATE_STATUS_DOWNLOADING",
UpdateStatus::Verifying => &"UPDATE_STATUS_VERIFYING",
UpdateStatus::Finalizing => &"UPDATE_STATUS_FINALIZING",
UpdateStatus::UpdatedNeedReboot => &"UPDATE_STATUS_UPDATED_NEED_REBOOT",
UpdateStatus::ReportingErrorEvent => &"UPDATE_STATUS_REPORTING_ERROR_EVENT",
}
}
}
#[derive(Debug)]
pub struct UpdateStatusIndication {
pub last_checked_time: SystemTime,
pub progress: f64,
pub current_operation: UpdateStatus,
pub new_version: String,
pub new_size: i64,
}
impl UpdateStatusIndication {
fn new(current_operation: UpdateStatus) -> UpdateStatusIndication {
UpdateStatusIndication {
last_checked_time: SystemTime::now(),
progress: 0.0,
current_operation: current_operation,
new_version: UpdateStatusIndication::version(),
new_size: 0,
}
}
fn version() -> String {
Command::new("lsb_release")
.arg("-r")
.arg("-s")
.output()
.and_then(|o| {
String::from_utf8(o.stdout)
.map(|mut s| {
let len = s.trim_right().len();
s.truncate(len);
s
}).map_err(|_| Error::new(ErrorKind::InvalidData, "Invalid version string"))
}).unwrap_or_else(|_| String::from(VERSION_ZERO))
}
pub fn last_checked_time_millis(&self) -> i64 {
let duration = self.last_checked_time.duration_since(UNIX_EPOCH).unwrap();
let nanos = duration.subsec_nanos() as u64;
return ((1000 * 1000 * 1000 * duration.as_secs() + nanos) / (1000 * 1000)) as i64;
}
pub fn from_inotify_event(event: &Event) -> Option<UpdateStatusIndication> {
let status: Option<UpdateStatus>;
if event.is_create() {
status = Option::Some(UpdateStatus::UpdatedNeedReboot);
} else if event.is_delete() {
status = Option::Some(UpdateStatus::Idle);
} else {
status = Option::None;
}
status.map(|s| UpdateStatusIndication::new(s))
}
pub fn from_path(path: &Path) -> UpdateStatusIndication {
let status: UpdateStatus;
if path.exists() {
status = UpdateStatus::UpdatedNeedReboot;
} else {
status = UpdateStatus::Idle;
}
UpdateStatusIndication::new(status)
}
}
#[derive(Debug)]
pub struct UpdateStatusNotifier();
pub trait UpdateStatusIndicationConsumer {
fn status_changed(&self, status: UpdateStatusIndication) -> ();
}
impl UpdateStatusNotifier {
fn add_watch(inotify: AsyncINotify, path: &Path) -> Result<AsyncINotify> {
path.parent().map_or(
Err(Error::new(
ErrorKind::NotFound,
"Invalid path to reboot sentinel file",
)),
|dir| {
inotify
.add_watch(dir, IN_CREATE | IN_DELETE)
.map(|_| inotify)
},
)
}
fn get_file_name_os_string(path: &Path) -> Option<OsString> {
path.file_name().map(|f| f.to_os_string())
}
pub fn new_with_path_and_consumer(
handle: &Handle,
path: &Path,
consumer: Box<UpdateStatusIndicationConsumer>,
logger: Rc<Logger>,
) -> Result<Box<Future<Item = (), Error = Error>>> {
if let Some(sentinel_file) = UpdateStatusNotifier::get_file_name_os_string(path) {
AsyncINotify::init(handle)
.and_then(|stream| UpdateStatusNotifier::add_watch(stream, path))
.map(|stream| {
stream.filter(move |event: &Event| event.name.as_os_str() == sentinel_file)
}).map(|stream| {
stream
.map(|ev| UpdateStatusIndication::from_inotify_event(&ev))
.map_err(move |e| {
warn!(&logger, "Error handling watch. {:?}", e);
e
})
}).map(|stream| {
return Box::new(stream.for_each(move |v| {
if let Some(indication) = v {
consumer.status_changed(indication)
}
Ok(())
})) as Box<Future<Item = (), Error = Error>>;
})
} else {
Err(Error::new(
ErrorKind::NotFound,
"Invalid path to reboot sentinel file",
))
}
}
}
|
use futures::Future;
use futures::Stream;
use inotify::wrapper::Event;
use slog::Logger;
use std::ffi::OsString;
use std::io::Result;
use std::io::{Error, ErrorKind};
use std::ops::Deref;
use std::path::Path;
use std::process::Command;
use std::rc::Rc;
use std::time::{SystemTime, UNIX_EPOCH};
use tokio_core::reactor::Handle;
use tokio_inotify::AsyncINotify;
use tokio_inotify::{IN_CREATE, IN_DELETE};
static VERSION_ZERO: &'static str = "0.0.0";
#[derive(Debug, PartialEq, Eq)]
#[allow(dead_code)]
pub enum UpdateStatus {
Idle,
CheckingForUpdate,
UpdateAvailable,
Downloading,
Verifying,
Finalizing,
UpdatedNeedReboot,
ReportingErrorEvent,
}
impl Deref for UpdateStatus {
type Target = str;
fn deref(&self) -> &'static str {
match *self {
UpdateStatus::Idle => &"UPDATE_STATUS_IDLE",
UpdateStatus::CheckingForUpdate => &"UPDATE_STATUS_CHECKING_FOR_UPDATE",
UpdateStatus::UpdateAvailable => &"UPDATE_STATUS_UPDATE_AVAILABLE",
UpdateStatus::Downloading => &"UPDATE_STATUS_DOWNLOADING",
UpdateStatus::Verifying => &"UPDATE_STATUS_VERIFYING",
UpdateStatus::Finalizing => &"UPDATE_STATUS_FINALIZING",
UpdateStatus::UpdatedNeedReboot => &"UPDATE_STATUS_UPDATED_NEED_REBOOT",
UpdateStatus::ReportingErrorEvent => &"UPDATE_STATUS_REPORTING_ERROR_EVENT",
}
}
}
#[derive(Debug)]
pub struct UpdateStatusIndication {
pub last_checked_time: SystemTime,
pub progress: f64,
pub current_operation: UpdateStatus,
pub new_version: String,
pub new_size: i64,
}
impl UpdateStatusIndication {
fn new(current_operation: UpdateStatus) -> UpdateStatusIndication {
UpdateStatusIndication {
last_checked_time: SystemTime::now(),
progress: 0.0,
current_operation: current_operation,
new_version: UpdateStatusIndication::version(),
new_size: 0,
}
}
fn version() -> String {
Command::new("lsb_release")
.arg("-r")
.arg("-s")
.output()
.and_then(|o| {
String::from_utf8(o.stdout)
.map(|mut s| {
let len = s.trim_right().len();
s.truncate(len);
s
}).map_err(|_| Error::new(ErrorKind::InvalidData, "Invalid version string"))
}).unwrap_or_else(|_| String::from(VERSION_ZERO))
}
pub fn last_checked_time_millis(&self) -> i64 {
let duration = self.last_checked_time.duration_since(UNIX_EPOCH).unwrap();
let nanos = duration.subsec_nanos() as u64;
return ((1000 * 1000 * 1000 * duration.as_secs() + nanos) / (1000 * 1000)) as i64;
}
pub fn from_inotify_event(event: &Event) -> Option<UpdateStatusIndication> {
let status: Option<UpdateStatus>;
if event.is_create() {
status = Option::Some(UpdateStatus::UpdatedNeedReboot);
} else if event.is_delete() {
status = Option::Some(UpdateStatus::Idle);
} else {
status = Option::None;
}
status.map(|s| UpdateStatusIndication::new(s))
}
pub fn from_path(path: &Path) -> UpdateStatusIndication {
let status: UpdateStatus;
if path.exists() {
status = UpdateStatus::UpdatedNeedReboot;
} else {
status = UpdateStatus::Idle;
}
UpdateStatusIndication::new(status)
}
}
#[derive(Debug)]
pub struct UpdateStatusNotifier();
pub trait UpdateStatusIndicationConsumer {
fn status_changed(&self, status: UpdateStatusIndication) -> ();
}
impl UpdateStatusNotifier {
fn add_watch(inotify: AsyncINotify, path: &Path) -> Result<AsyncINotify> {
path.parent().map_or(
Err(Error::new(
ErrorKind::NotFound,
"Invalid path to reboot sentinel file",
)),
|dir| {
inotify
.add_watch(dir, IN_CREATE | IN_DELETE)
.map(|_| inotify)
},
)
}
fn get_file_name_os_string(path: &Path) -> Option<OsString> {
path.file_name().map(|f| f.to_os_string())
}
pub fn new_with_path_and_consumer(
handle: &Handle,
path: &Path,
consumer: Box<UpdateStatusIndicationConsumer | cINotify::init(handle)
.and_then(|stream| UpdateStatusNotifier::add_watch(stream, path))
.map(|stream| {
stream.filter(move |event: &Event| event.name.as_os_str() == sentinel_file)
}).map(|stream| {
stream
.map(|ev| UpdateStatusIndication::from_inotify_event(&ev))
.map_err(move |e| {
warn!(&logger, "Error handling watch. {:?}", e);
e
})
}).map(|stream| {
return Box::new(stream.for_each(move |v| {
if let Some(indication) = v {
consumer.status_changed(indication)
}
Ok(())
})) as Box<Future<Item = (), Error = Error>>;
})
} else {
Err(Error::new(
ErrorKind::NotFound,
"Invalid path to reboot sentinel file",
))
}
}
}
| >,
logger: Rc<Logger>,
) -> Result<Box<Future<Item = (), Error = Error>>> {
if let Some(sentinel_file) = UpdateStatusNotifier::get_file_name_os_string(path) {
Asyn | random | [
{
"content": "pub fn engine(path: &Path, logger: Rc<Logger>) -> Result<(), IoError> {\n\n let owned_path = path.to_owned();\n\n let connection_r = Connection::get_private(BusType::System);\n\n if connection_r.is_err() {\n\n return connection_r.map(|_| ()).map_err(|e| {\n\n IoError::ne... |
Rust | src/pwasm.rs | jakelang/libeci | a4add3d49ec631dbb9c7f65f50655f6ec3ca5f2e | /*
* libeci: Ethereum WebAssembly ABI compliance library
*
* Copyright (c) 2018 Jake Lang
*
* 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, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
use parity_wasm::elements::{External, FunctionType, Internal, Module, Type};
pub fn func_type_by_index(module: &Module, index: usize) -> FunctionType {
let function_section = module
.function_section()
.expect("No function section found");
let type_section = module.type_section().expect("No type section found");
let import_section_len: usize = match module.import_section() {
Some(import) => import
.entries()
.iter()
.filter(|entry| match entry.external() {
&External::Function(_) => true,
_ => false,
})
.count(),
None => 0,
};
let function_index_in_section = index - import_section_len;
let func_type_ref: usize =
function_section.entries()[function_index_in_section].type_ref() as usize;
match type_section.types()[func_type_ref] {
Type::Function(ref func_type) => func_type.clone(),
}
}
pub fn imported_func_type_by_index(module: &Module, index: usize) -> FunctionType {
let import_section = module.import_section().expect("No function section found");
let type_section = module.type_section().expect("No type section found");
let func_type_ref: usize = match import_section.entries()[index].external() {
&External::Function(idx) => idx as usize,
_ => usize::max_value(),
};
match type_section.types()[func_type_ref] {
Type::Function(ref func_type) => func_type.clone(),
}
}
pub fn resolve_export_by_name(module: &Module, name: &str) -> Option<(u32, Internal)> {
if !has_export_section(module) {
None
} else {
let idx: Option<(u32, Internal)> = match module
.export_section()
.unwrap()
.entries()
.iter()
.find(|export| if export.field() == name { true } else { false })
{
Some(export) => match *export.internal() {
Internal::Function(index) => Some((index, Internal::Function(index))),
Internal::Memory(index) => Some((index, Internal::Memory(index))),
Internal::Global(index) => Some((index, Internal::Global(index))),
Internal::Table(index) => Some((index, Internal::Table(index))),
},
None => None,
};
idx
}
}
pub fn get_imports(module: &Module) -> Option<Vec<(&str, &str)>> {
if !has_import_section(module) {
return None;
} else {
let imports_list: Option<Vec<(&str, &str)>> = Some(
module
.import_section()
.unwrap()
.entries()
.iter()
.map(|x| (x.module(), x.field()))
.collect(),
);
imports_list
}
}
pub fn has_export_section(module: &Module) -> bool {
match module.export_section() {
Some(_thing) => true,
None => false,
}
}
pub fn has_import_section(module: &Module) -> bool {
match module.import_section() {
Some(_thing) => true,
None => false,
}
}
| /*
* libeci: Ethereum WebAssembly ABI compliance library
*
* Copyright (c) 2018 Jake Lang
*
* 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, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
use parity_wasm::elements::{External, FunctionType, Internal, Module, Type};
pub fn func_type_by_index(module: &Module, index: usize) -> FunctionType {
let function_section = module
.function_section()
.expect("No function section found");
let type_section = module.type_section().expect("No type section found");
let import_section_len: usize = match module.import_section() {
Some(import) => import
.entries()
.iter()
.filter(|entry| match entry.external() {
&External::Function(_) => true,
_ => false,
})
.count(),
None => 0,
};
let function_index_in_section = index - import_section_len;
let func_type_ref: usize =
function_section.entries()[function_index_in_section].type_ref() as usize;
match type_section.types()[func_type_ref] {
Type::Function(ref func_type) => func_type.clone(),
}
}
pub fn imported_func_type_by_index(module: &Module, index: usize) -> FunctionType {
let import_section = module.import_section().expect("No function section found");
let type_section = module.type_section().expect("No type section found");
let func_type_ref: usize = match import_section.entries()[index].external() {
&External::Function(idx) => idx as usize,
_ => usize::max_value(),
};
match type_section.types()[func_type_ref] {
Type::Function(ref func_type) => func_type.clone(),
}
}
|
pub fn get_imports(module: &Module) -> Option<Vec<(&str, &str)>> {
if !has_import_section(module) {
return None;
} else {
let imports_list: Option<Vec<(&str, &str)>> = Some(
module
.import_section()
.unwrap()
.entries()
.iter()
.map(|x| (x.module(), x.field()))
.collect(),
);
imports_list
}
}
pub fn has_export_section(module: &Module) -> bool {
match module.export_section() {
Some(_thing) => true,
None => false,
}
}
pub fn has_import_section(module: &Module) -> bool {
match module.import_section() {
Some(_thing) => true,
None => false,
}
}
| pub fn resolve_export_by_name(module: &Module, name: &str) -> Option<(u32, Internal)> {
if !has_export_section(module) {
None
} else {
let idx: Option<(u32, Internal)> = match module
.export_section()
.unwrap()
.entries()
.iter()
.find(|export| if export.field() == name { true } else { false })
{
Some(export) => match *export.internal() {
Internal::Function(index) => Some((index, Internal::Function(index))),
Internal::Memory(index) => Some((index, Internal::Memory(index))),
Internal::Global(index) => Some((index, Internal::Global(index))),
Internal::Table(index) => Some((index, Internal::Table(index))),
},
None => None,
};
idx
}
} | function_block-full_function | [
{
"content": "/// Utility function checking that a module has an exported function with a given signature.\n\npub fn has_func_export(module: &Module, name: &str, sig: FunctionType) -> CheckStatus {\n\n match resolve_export_by_name(module, name) {\n\n Some((index, reference)) => if reference == Interna... |
Rust | contracts/farms/spectrum_pylon_farm/src/compound.rs | spectrumprotocol/contract | eee411acc13ed999a9718c096aef93b586941c02 | use cosmwasm_std::{attr, to_binary, Attribute, CanonicalAddr, Coin, CosmosMsg, DepsMut, Env, MessageInfo, Response, StdError, StdResult, Uint128, WasmMsg, QueryRequest, WasmQuery};
use crate::{
bond::deposit_farm_share,
state::{read_config, state_store},
};
use crate::querier::query_pylon_reward_info;
use cw20::Cw20ExecuteMsg;
use crate::state::{pool_info_read, pool_info_store, read_state, Config, PoolInfo};
use pylon_token::staking::{
Cw20HookMsg as PylonStakingCw20HookMsg, ExecuteMsg as PylonStakingExecuteMsg,
};
use spectrum_protocol::gov::{ExecuteMsg as GovExecuteMsg};
use spectrum_protocol::pylon_farm::ExecuteMsg;
use terraswap::asset::{Asset, AssetInfo};
use terraswap::pair::{Cw20HookMsg as TerraswapCw20HookMsg, ExecuteMsg as TerraswapExecuteMsg, QueryMsg as TerraswapQueryMsg, PoolResponse};
use terraswap::querier::{query_token_balance, simulate};
use spectrum_protocol::farm_helper::{compute_provide_after_swap, deduct_tax};
use moneymarket::market::{ExecuteMsg as MoneyMarketExecuteMsg};
pub fn compound(deps: DepsMut, env: Env, info: MessageInfo) -> StdResult<Response> {
let config = read_config(deps.storage)?;
if config.controller != deps.api.addr_canonicalize(info.sender.as_str())? {
return Err(StdError::generic_err("unauthorized"));
}
let pair_contract = deps.api.addr_humanize(&config.pair_contract)?;
let pylon_staking = deps.api.addr_humanize(&config.pylon_staking)?;
let pylon_token = deps.api.addr_humanize(&config.pylon_token)?;
let pylon_reward_info = query_pylon_reward_info(
deps.as_ref(),
&config.pylon_staking,
&env.contract.address,
Some(env.block.height),
)?;
let mut total_mine_swap_amount = Uint128::zero();
let mut total_mine_stake_amount = Uint128::zero();
let mut total_mine_commission = Uint128::zero();
let mut compound_amount = Uint128::zero();
let mut attributes: Vec<Attribute> = vec![];
let community_fee = config.community_fee;
let platform_fee = config.platform_fee;
let controller_fee = config.controller_fee;
let total_fee = community_fee + platform_fee + controller_fee;
let mut pool_info = pool_info_read(deps.storage).load(config.pylon_token.as_slice())?;
let reward = pylon_reward_info.pending_reward;
if !reward.is_zero() && !pylon_reward_info.bond_amount.is_zero() {
let commission = reward * total_fee;
let pylon_amount = reward.checked_sub(commission)?;
total_mine_commission += commission;
total_mine_swap_amount += commission;
let auto_bond_amount = pylon_reward_info
.bond_amount
.checked_sub(pool_info.total_stake_bond_amount)?;
compound_amount =
pylon_amount.multiply_ratio(auto_bond_amount, pylon_reward_info.bond_amount);
let stake_amount = pylon_amount.checked_sub(compound_amount)?;
attributes.push(attr("commission", commission));
attributes.push(attr("compound_amount", compound_amount));
attributes.push(attr("stake_amount", stake_amount));
total_mine_stake_amount += stake_amount;
}
let mut state = read_state(deps.storage)?;
let reinvest_allowance = query_token_balance(&deps.querier, pylon_token.clone(), env.contract.address.clone())?
.checked_sub(state.total_farm_amount)?;
deposit_farm_share(
&mut state,
&mut pool_info,
total_mine_stake_amount,
)?;
state_store(deps.storage).save(&state)?;
pool_info_store(deps.storage).save(config.pylon_token.as_slice(), &pool_info)?;
let reinvest_amount = reinvest_allowance + compound_amount;
let swap_amount = reinvest_amount.multiply_ratio(1u128, 2u128);
total_mine_swap_amount += swap_amount;
let mine = Asset {
info: AssetInfo::Token {
contract_addr: pylon_token.to_string(),
},
amount: total_mine_swap_amount,
};
let mine_swap_rate = simulate(
&deps.querier,
pair_contract.clone(),
&mine,
)?;
let total_ust_return_amount = deduct_tax(&deps.querier, mine_swap_rate.return_amount, config.base_denom.clone())?;
attributes.push(attr("total_ust_return_amount", total_ust_return_amount));
let total_ust_commission_amount = if total_mine_swap_amount != Uint128::zero() {
total_ust_return_amount.multiply_ratio(total_mine_commission, total_mine_swap_amount)
} else {
Uint128::zero()
};
let total_ust_reinvest_amount =
total_ust_return_amount.checked_sub(total_ust_commission_amount)?;
let net_reinvest_ust = deduct_tax(
&deps.querier,
total_ust_reinvest_amount,
config.base_denom.clone(),
)?;
let pool: PoolResponse = deps.querier.query(&QueryRequest::Wasm(WasmQuery::Smart {
contract_addr: pair_contract.to_string(),
msg: to_binary(&TerraswapQueryMsg::Pool {})?,
}))?;
let provide_mine = compute_provide_after_swap(
&pool,
&mine,
mine_swap_rate.return_amount,
net_reinvest_ust
)?;
let mut messages: Vec<CosmosMsg> = vec![];
let withdraw_all_mine: CosmosMsg = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pylon_staking.to_string(),
funds: vec![],
msg: to_binary(&PylonStakingExecuteMsg::Withdraw {})?,
});
messages.push(withdraw_all_mine);
if !total_mine_swap_amount.is_zero() {
let swap_mine: CosmosMsg = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pylon_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Send {
contract: pair_contract.to_string(),
amount: total_mine_swap_amount,
msg: to_binary(&TerraswapCw20HookMsg::Swap {
max_spread: None,
belief_price: None,
to: None,
})?,
})?,
funds: vec![],
});
messages.push(swap_mine);
}
if !total_ust_commission_amount.is_zero() {
let net_commission_amount = deduct_tax(&deps.querier, total_ust_commission_amount, config.base_denom.clone())?;
let mut state = read_state(deps.storage)?;
state.earning += net_commission_amount;
state_store(deps.storage).save(&state)?;
attributes.push(attr("net_commission", net_commission_amount));
messages.push(CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: deps.api.addr_humanize(&config.anchor_market)?.to_string(),
msg: to_binary(&MoneyMarketExecuteMsg::DepositStable {})?,
funds: vec![Coin {
denom: config.base_denom.clone(),
amount: net_commission_amount,
}],
}));
messages.push(CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: deps.api.addr_humanize(&config.spectrum_gov)?.to_string(),
msg: to_binary(&GovExecuteMsg::mint {})?,
funds: vec![],
}));
messages.push(CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: env.contract.address.to_string(),
msg: to_binary(&ExecuteMsg::send_fee {})?,
funds: vec![],
}));
}
if !provide_mine.is_zero() {
let increase_allowance = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pylon_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::IncreaseAllowance {
spender: pair_contract.to_string(),
amount: provide_mine,
expires: None,
})?,
funds: vec![],
});
messages.push(increase_allowance);
let provide_liquidity = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pair_contract.to_string(),
msg: to_binary(&TerraswapExecuteMsg::ProvideLiquidity {
assets: [
Asset {
info: AssetInfo::Token {
contract_addr: pylon_token.to_string(),
},
amount: provide_mine,
},
Asset {
info: AssetInfo::NativeToken {
denom: config.base_denom.clone(),
},
amount: net_reinvest_ust,
},
],
slippage_tolerance: None,
receiver: None,
})?,
funds: vec![Coin {
denom: config.base_denom,
amount: net_reinvest_ust,
}],
});
messages.push(provide_liquidity);
let stake = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: env.contract.address.to_string(),
msg: to_binary(&ExecuteMsg::stake {
asset_token: pylon_token.to_string(),
})?,
funds: vec![],
});
messages.push(stake);
}
attributes.push(attr("action", "compound"));
attributes.push(attr("asset_token", pylon_token));
attributes.push(attr("reinvest_amount", reinvest_amount));
attributes.push(attr("provide_token_amount", provide_mine));
attributes.push(attr("provide_ust_amount", net_reinvest_ust));
Ok(Response::new()
.add_messages(messages)
.add_attributes(attributes))
}
pub fn stake(
deps: DepsMut,
env: Env,
info: MessageInfo,
asset_token: String,
) -> StdResult<Response> {
if info.sender != env.contract.address {
return Err(StdError::generic_err("unauthorized"));
}
let config: Config = read_config(deps.storage)?;
let pylon_staking = deps.api.addr_humanize(&config.pylon_staking)?;
let asset_token_raw: CanonicalAddr = deps.api.addr_canonicalize(&asset_token)?;
let pool_info: PoolInfo = pool_info_read(deps.storage).load(asset_token_raw.as_slice())?;
let staking_token = deps.api.addr_humanize(&pool_info.staking_token)?;
let amount = query_token_balance(&deps.querier, staking_token.clone(), env.contract.address)?;
Ok(Response::new()
.add_messages(vec![CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: staking_token.to_string(),
funds: vec![],
msg: to_binary(&Cw20ExecuteMsg::Send {
contract: pylon_staking.to_string(),
amount,
msg: to_binary(&PylonStakingCw20HookMsg::Bond {})?,
})?,
})])
.add_attributes(vec![
attr("action", "stake"),
attr("asset_token", asset_token),
attr("staking_token", staking_token),
attr("amount", amount),
]))
}
pub fn send_fee(
deps: DepsMut,
env: Env,
info: MessageInfo,
) -> StdResult<Response> {
if info.sender != env.contract.address {
return Err(StdError::generic_err("unauthorized"));
}
let config = read_config(deps.storage)?;
let aust_token = deps.api.addr_humanize(&config.aust_token)?;
let spectrum_gov = deps.api.addr_humanize(&config.spectrum_gov)?;
let aust_balance = query_token_balance(&deps.querier, aust_token.clone(), env.contract.address)?;
let mut messages: Vec<CosmosMsg> = vec![];
let thousand = Uint128::from(1000u64);
let total_fee = config.community_fee + config.controller_fee + config.platform_fee;
let community_amount = aust_balance.multiply_ratio(thousand * config.community_fee, thousand * total_fee);
if !community_amount.is_zero() {
let transfer_community_fee = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: aust_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Transfer {
recipient: spectrum_gov.to_string(),
amount: community_amount,
})?,
funds: vec![],
});
messages.push(transfer_community_fee);
}
let platform_amount = aust_balance.multiply_ratio(thousand * config.platform_fee, thousand * total_fee);
if !platform_amount.is_zero() {
let stake_platform_fee = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: aust_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Transfer {
recipient: deps.api.addr_humanize(&config.platform)?.to_string(),
amount: platform_amount,
})?,
funds: vec![],
});
messages.push(stake_platform_fee);
}
let controller_amount = aust_balance.checked_sub(community_amount + platform_amount)?;
if !controller_amount.is_zero() {
let stake_controller_fee = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: aust_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Transfer {
recipient: deps.api.addr_humanize(&config.controller)?.to_string(),
amount: controller_amount,
})?,
funds: vec![],
});
messages.push(stake_controller_fee);
}
Ok(Response::new()
.add_messages(messages))
}
| use cosmwasm_std::{attr, to_binary, Attribute, CanonicalAddr, Coin, CosmosMsg, DepsMut, Env, MessageInfo, Response, StdError, StdResult, Uint128, WasmMsg, QueryRequest, WasmQuery};
use crate::{
bond::deposit_farm_share,
state::{read_config, state_store},
};
use crate::querier::query_pylon_reward_info;
use cw20::Cw20ExecuteMsg;
use crate::state::{pool_info_read, pool_info_store, read_state, Config, PoolInfo};
use pylon_token::staking::{
Cw20HookMsg as PylonStakingCw20HookMsg, ExecuteMsg as PylonStakingExecuteMsg,
};
use spectrum_protocol::gov::{ExecuteMsg as GovExecuteMsg};
use spectrum_protocol::pylon_farm::ExecuteMsg;
use terraswap::asset::{Asset, AssetInfo};
use terraswap::pair::{Cw20HookMsg as TerraswapCw20HookMsg, ExecuteMsg as TerraswapExecuteMsg, QueryMsg as TerraswapQueryMsg, PoolResponse};
use terraswap::querier::{query_token_balance, simulate};
use spectrum_protocol::farm_helper::{compute_provide_after_swap, deduct_tax};
use moneymarket::market::{ExecuteMsg as MoneyMarketExecuteMsg};
pub fn compound(deps: DepsMut, env: Env, info: MessageInfo) -> StdResult<Response> {
let config = read_config(deps.storage)?;
if config.controller != deps.api.addr_canonicalize(info.sender.as_str())? {
return Err(StdError::generic_err("unauthorized"));
}
let pair_contract = deps.api.addr_humanize(&config.pair_contract)?;
let pylon_staking = deps.api.addr_humanize(&config.pylon_staking)?;
let pylon_token = deps.api.addr_humanize(&config.pylon_token)?;
let pylon_reward_info = query_pylon_reward_info(
deps.as_ref(),
&config.pylon_staking,
&env.contract.address,
Some(env.block.height),
)?;
let mut total_mine_swap_amount = Uint128::zero();
let mut total_mine_stake_amount = Uint128::zero();
let mut total_mine_commission = Uint128::zero();
let mut compound_amount = Uint128::zero();
let mut attributes: Vec<Attribute> = vec![];
let community_fee = config.community_fee;
let platform_fee = config.platform_fee;
let controller_fee = config.controller_fee;
let total_fee = community_fee + platform_fee + controller_fee;
let mut pool_info = pool_info_read(deps.storage).load(config.pylon_token.as_slice())?;
let reward = pylon_reward_info.pending_reward;
if !reward.is_zero() && !pylon_reward_info.bond_amount.is_zero() {
let commission = reward * total_fee;
let pylon_amount = reward.checked_sub(commission)?;
total_mine_commission += commission;
total_mine_swap_amount += commission;
let auto_bond_amount = pylon_reward_info
.bond_amount
.checked_sub(pool_info.total_stake_bond_amount)?;
compound_amount =
pylon_amount.multiply_ratio(auto_bond_amount, pylon_reward_info.bond_amount);
let stake_amount = pylon_amount.checked_sub(compound_amount)?;
attributes.push(attr("commission", commission));
attributes.push(attr("compound_amount", compound_amount));
attributes.push(attr("stake_amount", stake_amount));
total_mine_stake_amount += stake_amount;
}
let mut state = read_state(deps.storage)?;
let reinvest_allowance = query_token_balance(&deps.querier, pylon_token.clone(), env.contract.address.clone())?
.checked_sub(state.total_farm_amount)?;
deposit_farm_share(
&mut state,
&mut pool_info,
total_mine_stake_amount,
)?;
state_store(deps.storage).save(&state)?;
pool_info_store(deps.storage).save(config.pylon_token.as_slice(), &pool_info)?;
let reinvest_amount = reinvest_allowance + compound_amount;
let swap_amount = reinvest_amount.multiply_ratio(1u128, 2u128);
total_mine_swap_amount += swap_amount;
let mine = Asset {
info: AssetInfo::Token {
contract_addr: pylon_token.to_string(),
},
amount: total_mine_swap_amount,
};
let mine_swap_rate = simulate(
&deps.querier,
pair_contract.clone(),
&mine,
)?;
let total_ust_return_amount = deduct_tax(&deps.querier, mine_swap_rate.return_amount, config.base_denom.clone())?;
attributes.push(attr("total_ust_return_amount", total_ust_return_amount));
let total_ust_commission_amount = if total_mine_swap_amount != Uint128::zero() {
total_ust_return_amount.multiply_ratio(total_mine_commission, total_mine_swap_amount)
} else {
Uint128::zero()
};
let total_ust_reinvest_amount =
total_ust_return_amount.checked_sub(total_ust_commission_amount)?;
let net_reinvest_ust = deduct_tax(
&deps.querier,
total_ust_reinvest_amount,
config.base_denom.clone(),
)?;
let pool: PoolResponse = deps.querier.query(&QueryRequest::Wasm(WasmQuery::Smart {
contract_addr: pair_contract.to_string(),
msg: to_binary(&TerraswapQueryMsg::Pool {})?,
}))?;
let provide_mine = compute_provide_after_swap(
&pool,
&mine,
mine_swap_rate.return_amount,
net_reinvest_ust
)?;
let mut messages: Vec<CosmosMsg> = vec![];
let withdraw_all_mine: CosmosMsg = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pylon_staking.to_string(),
funds: vec![],
msg: to_binary(&PylonStakingExecuteMsg::Withdraw {})?,
});
messages.push(withdraw_all_mine);
if !total_mine_swap_amount.is_zero() {
let swap_mine: CosmosMsg = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pylon_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Send {
contract: pair_contract.to_string(),
amount: total_mine_swap_amount,
msg: to_binary(&TerraswapCw20HookMsg::Swap {
max_spread: None,
belief_price: None,
to: None,
})?,
})?,
funds: vec![],
});
messages.push(swap_mine);
}
if !total_ust_commission_amount.is_zero() {
let net_commission_amount = deduct_tax(&deps.querier, total_ust_commission_amount, config.base_denom.clone())?;
let mut state = read_state(deps.storage)?;
state.earning += net_commission_amount;
state | ],
slippage_tolerance: None,
receiver: None,
})?,
funds: vec![Coin {
denom: config.base_denom,
amount: net_reinvest_ust,
}],
});
messages.push(provide_liquidity);
let stake = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: env.contract.address.to_string(),
msg: to_binary(&ExecuteMsg::stake {
asset_token: pylon_token.to_string(),
})?,
funds: vec![],
});
messages.push(stake);
}
attributes.push(attr("action", "compound"));
attributes.push(attr("asset_token", pylon_token));
attributes.push(attr("reinvest_amount", reinvest_amount));
attributes.push(attr("provide_token_amount", provide_mine));
attributes.push(attr("provide_ust_amount", net_reinvest_ust));
Ok(Response::new()
.add_messages(messages)
.add_attributes(attributes))
}
pub fn stake(
deps: DepsMut,
env: Env,
info: MessageInfo,
asset_token: String,
) -> StdResult<Response> {
if info.sender != env.contract.address {
return Err(StdError::generic_err("unauthorized"));
}
let config: Config = read_config(deps.storage)?;
let pylon_staking = deps.api.addr_humanize(&config.pylon_staking)?;
let asset_token_raw: CanonicalAddr = deps.api.addr_canonicalize(&asset_token)?;
let pool_info: PoolInfo = pool_info_read(deps.storage).load(asset_token_raw.as_slice())?;
let staking_token = deps.api.addr_humanize(&pool_info.staking_token)?;
let amount = query_token_balance(&deps.querier, staking_token.clone(), env.contract.address)?;
Ok(Response::new()
.add_messages(vec![CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: staking_token.to_string(),
funds: vec![],
msg: to_binary(&Cw20ExecuteMsg::Send {
contract: pylon_staking.to_string(),
amount,
msg: to_binary(&PylonStakingCw20HookMsg::Bond {})?,
})?,
})])
.add_attributes(vec![
attr("action", "stake"),
attr("asset_token", asset_token),
attr("staking_token", staking_token),
attr("amount", amount),
]))
}
pub fn send_fee(
deps: DepsMut,
env: Env,
info: MessageInfo,
) -> StdResult<Response> {
if info.sender != env.contract.address {
return Err(StdError::generic_err("unauthorized"));
}
let config = read_config(deps.storage)?;
let aust_token = deps.api.addr_humanize(&config.aust_token)?;
let spectrum_gov = deps.api.addr_humanize(&config.spectrum_gov)?;
let aust_balance = query_token_balance(&deps.querier, aust_token.clone(), env.contract.address)?;
let mut messages: Vec<CosmosMsg> = vec![];
let thousand = Uint128::from(1000u64);
let total_fee = config.community_fee + config.controller_fee + config.platform_fee;
let community_amount = aust_balance.multiply_ratio(thousand * config.community_fee, thousand * total_fee);
if !community_amount.is_zero() {
let transfer_community_fee = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: aust_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Transfer {
recipient: spectrum_gov.to_string(),
amount: community_amount,
})?,
funds: vec![],
});
messages.push(transfer_community_fee);
}
let platform_amount = aust_balance.multiply_ratio(thousand * config.platform_fee, thousand * total_fee);
if !platform_amount.is_zero() {
let stake_platform_fee = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: aust_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Transfer {
recipient: deps.api.addr_humanize(&config.platform)?.to_string(),
amount: platform_amount,
})?,
funds: vec![],
});
messages.push(stake_platform_fee);
}
let controller_amount = aust_balance.checked_sub(community_amount + platform_amount)?;
if !controller_amount.is_zero() {
let stake_controller_fee = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: aust_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::Transfer {
recipient: deps.api.addr_humanize(&config.controller)?.to_string(),
amount: controller_amount,
})?,
funds: vec![],
});
messages.push(stake_controller_fee);
}
Ok(Response::new()
.add_messages(messages))
}
| _store(deps.storage).save(&state)?;
attributes.push(attr("net_commission", net_commission_amount));
messages.push(CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: deps.api.addr_humanize(&config.anchor_market)?.to_string(),
msg: to_binary(&MoneyMarketExecuteMsg::DepositStable {})?,
funds: vec![Coin {
denom: config.base_denom.clone(),
amount: net_commission_amount,
}],
}));
messages.push(CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: deps.api.addr_humanize(&config.spectrum_gov)?.to_string(),
msg: to_binary(&GovExecuteMsg::mint {})?,
funds: vec![],
}));
messages.push(CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: env.contract.address.to_string(),
msg: to_binary(&ExecuteMsg::send_fee {})?,
funds: vec![],
}));
}
if !provide_mine.is_zero() {
let increase_allowance = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pylon_token.to_string(),
msg: to_binary(&Cw20ExecuteMsg::IncreaseAllowance {
spender: pair_contract.to_string(),
amount: provide_mine,
expires: None,
})?,
funds: vec![],
});
messages.push(increase_allowance);
let provide_liquidity = CosmosMsg::Wasm(WasmMsg::Execute {
contract_addr: pair_contract.to_string(),
msg: to_binary(&TerraswapExecuteMsg::ProvideLiquidity {
assets: [
Asset {
info: AssetInfo::Token {
contract_addr: pylon_token.to_string(),
},
amount: provide_mine,
},
Asset {
info: AssetInfo::NativeToken {
denom: config.base_denom.clone(),
},
amount: net_reinvest_ust,
},
| random | [
{
"content": "#[cfg_attr(not(feature = \"library\"), entry_point)]\n\npub fn execute(deps: DepsMut, env: Env, info: MessageInfo, msg: ExecuteMsg) -> StdResult<Response> {\n\n match msg {\n\n ExecuteMsg::zap_to_bond {\n\n contract,\n\n provide_asset,\n\n swap_operations... |
Rust | query-engine/core/src/metrics/formatters.rs | prisma-korea/prisma-engines | 99ac5a5c95ba2f5308d84fc30a7110f606182d92 | use super::common::{Histogram, Metric, MetricValue, Snapshot};
use metrics_exporter_prometheus::formatting::{
sanitize_description, sanitize_label_key, sanitize_label_value, write_help_line, write_metric_line, write_type_line,
};
use serde_json::Value;
use std::collections::HashMap;
fn create_label_string(labels: &HashMap<String, String>) -> Vec<String> {
let mut label_string = labels
.iter()
.map(|(k, v)| format!("{}=\"{}\"", sanitize_label_key(k), sanitize_label_value(v)))
.collect::<Vec<String>>();
label_string.sort();
label_string
}
pub(crate) fn metrics_to_json(snapshot: Snapshot) -> Value {
let Snapshot {
counters,
histograms,
gauges,
} = snapshot;
let mut normalised_histograms = Vec::new();
for histogram in histograms {
if let MetricValue::Histogram(histogram_value) = histogram.value {
let mut prev = 0;
let buckets = histogram_value
.buckets
.iter()
.cloned()
.map(|(le, count)| {
let new_count = count - prev;
prev = count;
(le, new_count)
})
.collect();
let new_histogram = Histogram {
buckets,
sum: histogram_value.sum,
count: histogram_value.count,
};
normalised_histograms.push(Metric {
key: histogram.key.clone(),
labels: histogram.labels.clone(),
description: histogram.description.clone(),
value: MetricValue::Histogram(new_histogram),
});
}
}
let snapshot = Snapshot {
counters,
histograms: normalised_histograms,
gauges,
};
serde_json::to_value(snapshot).unwrap()
}
pub(crate) fn metrics_to_prometheus(snapshot: Snapshot) -> String {
let Snapshot {
counters,
histograms,
gauges,
} = snapshot;
let mut output = String::new();
for counter in counters {
let desc = sanitize_description(counter.description.as_str());
write_help_line(&mut output, counter.key.as_str(), desc.as_str());
write_type_line(&mut output, counter.key.as_str(), "counter");
let labels = create_label_string(&counter.labels);
if let MetricValue::Counter(value) = counter.value {
write_metric_line::<&str, u64>(&mut output, &counter.key.as_str(), None, &labels, None, value);
}
output.push('\n');
}
for gauge in gauges {
let desc = sanitize_description(gauge.description.as_str());
write_help_line(&mut output, gauge.key.as_str(), desc.as_str());
write_type_line(&mut output, gauge.key.as_str(), "gauge");
let labels = create_label_string(&gauge.labels);
if let MetricValue::Gauge(value) = gauge.value {
write_metric_line::<&str, f64>(&mut output, &gauge.key.as_str(), None, &labels, None, value);
}
output.push('\n');
}
for histogram in histograms {
let desc = sanitize_description(histogram.description.as_str());
write_help_line(&mut output, histogram.key.as_str(), desc.as_str());
write_type_line(&mut output, histogram.key.as_str(), "histogram");
let labels = create_label_string(&histogram.labels);
if let MetricValue::Histogram(histogram_values) = histogram.value {
for (le, count) in histogram_values.buckets {
write_metric_line(
&mut output,
histogram.key.as_str(),
Some("bucket"),
&labels,
Some(("le", le)),
count,
);
}
write_metric_line(
&mut output,
histogram.key.as_str(),
Some("bucket"),
&labels,
Some(("le", "+Inf")),
histogram_values.count,
);
write_metric_line::<&str, f64>(
&mut output,
histogram.key.as_str(),
Some("sum"),
&labels,
None,
histogram_values.sum,
);
write_metric_line::<&str, u64>(
&mut output,
histogram.key.as_str(),
Some("count"),
&labels,
None,
histogram_values.count,
);
}
output.push('\n');
}
output
}
| use super::common::{Histogram, Metric, MetricValue, Snapshot};
use metrics_exporter_prometheus::formatting::{
sanitize_description, sanitize_label_key, sanitize_label_value, write_help_line, write_metric_line, write_type_line,
};
use serde_json::Value;
use std::collections::HashMap;
fn create_label_string(labels: &HashMap<String, String>) -> Vec<String> {
let mut label_string = labels
.iter()
.map(|(k, v)| format!("{}=\"{}\"", sanitize_label_key(k), sanitize_label_value(v)))
.collect::<Vec<String>>();
label_string.sort();
label_string
}
pub(crate) fn metrics_to_json(snapshot: Snapshot) -> Value {
let Snapshot {
counters,
histograms,
gauges,
} = snapshot;
let mut normalised_histograms = Vec::new();
for histogram in histograms {
if let MetricValue::Histogram(histogram_value) = histogram.value {
let mut prev = 0;
let buckets = histogram_value
.buckets
.iter()
.cloned()
.map(|(le, count)| {
let new_count = count - prev;
prev = count;
(le, new_count)
})
.collect();
let new_histogram = His |
pub(crate) fn metrics_to_prometheus(snapshot: Snapshot) -> String {
let Snapshot {
counters,
histograms,
gauges,
} = snapshot;
let mut output = String::new();
for counter in counters {
let desc = sanitize_description(counter.description.as_str());
write_help_line(&mut output, counter.key.as_str(), desc.as_str());
write_type_line(&mut output, counter.key.as_str(), "counter");
let labels = create_label_string(&counter.labels);
if let MetricValue::Counter(value) = counter.value {
write_metric_line::<&str, u64>(&mut output, &counter.key.as_str(), None, &labels, None, value);
}
output.push('\n');
}
for gauge in gauges {
let desc = sanitize_description(gauge.description.as_str());
write_help_line(&mut output, gauge.key.as_str(), desc.as_str());
write_type_line(&mut output, gauge.key.as_str(), "gauge");
let labels = create_label_string(&gauge.labels);
if let MetricValue::Gauge(value) = gauge.value {
write_metric_line::<&str, f64>(&mut output, &gauge.key.as_str(), None, &labels, None, value);
}
output.push('\n');
}
for histogram in histograms {
let desc = sanitize_description(histogram.description.as_str());
write_help_line(&mut output, histogram.key.as_str(), desc.as_str());
write_type_line(&mut output, histogram.key.as_str(), "histogram");
let labels = create_label_string(&histogram.labels);
if let MetricValue::Histogram(histogram_values) = histogram.value {
for (le, count) in histogram_values.buckets {
write_metric_line(
&mut output,
histogram.key.as_str(),
Some("bucket"),
&labels,
Some(("le", le)),
count,
);
}
write_metric_line(
&mut output,
histogram.key.as_str(),
Some("bucket"),
&labels,
Some(("le", "+Inf")),
histogram_values.count,
);
write_metric_line::<&str, f64>(
&mut output,
histogram.key.as_str(),
Some("sum"),
&labels,
None,
histogram_values.sum,
);
write_metric_line::<&str, u64>(
&mut output,
histogram.key.as_str(),
Some("count"),
&labels,
None,
histogram_values.count,
);
}
output.push('\n');
}
output
}
| togram {
buckets,
sum: histogram_value.sum,
count: histogram_value.count,
};
normalised_histograms.push(Metric {
key: histogram.key.clone(),
labels: histogram.labels.clone(),
description: histogram.description.clone(),
value: MetricValue::Histogram(new_histogram),
});
}
}
let snapshot = Snapshot {
counters,
histograms: normalised_histograms,
gauges,
};
serde_json::to_value(snapshot).unwrap()
} | function_block-function_prefixed | [
{
"content": "// Todo: Sanitizing might need to be adjusted to also change the fields in the RelationInfo\n\nfn sanitize_models(ctx: &mut Context) -> HashMap<String, (String, Option<String>)> {\n\n let mut enum_renames = HashMap::new();\n\n let sql_family = ctx.sql_family();\n\n\n\n for model in ctx.da... |
Rust | sdk/tests/t_nft_contract.rs | fgfm999/trampoline | e7c2f0172087973f8fc0b4884e459fdd5855c235 | use std::path::Path;
use ckb_hash::blake2b_256;
use trampoline_sdk::ckb_types::packed::{CellInput, CellOutput};
use ckb_jsonrpc_types::JsonBytes;
use trampoline_sdk::chain::{MockChain, MockChainTxProvider as ChainRpc};
use trampoline_sdk::ckb_types::{
self,
bytes::Bytes,
core::{TransactionBuilder, TransactionView},
error::Error,
packed::*,
prelude::*,
H256,
};
use trampoline_sdk::contract::*;
use trampoline_sdk::contract::{builtins::t_nft::*, generator::*};
use trampoline_sdk::contract::{schema::*, ContractSource};
fn _assert_script_error(err: Error, err_code: i8) {
let error_string = err.to_string();
assert!(
error_string.contains(format!("error code {} ", err_code).as_str()),
"error_string: {}, expected_error_code: {}",
error_string,
err_code
);
}
fn _generate_always_success_lock(
args: Option<ckb_types::packed::Bytes>,
) -> ckb_types::packed::Script {
let data: Bytes = ckb_always_success_script::ALWAYS_SUCCESS.to_vec().into();
let data_hash = H256::from(blake2b_256(data.to_vec().as_slice()));
ckb_types::packed::Script::default()
.as_builder()
.args(args.unwrap_or([0u8].pack()))
.code_hash(data_hash.pack())
.hash_type(ckb_types::core::ScriptHashType::Data1.into())
.build()
}
fn gen_nft_contract() -> TrampolineNFTContract {
let out_dir = std::env::var_os("OUT_DIR").unwrap();
let path_to_nft_bin = Path::new(&out_dir).join("trampoline-nft");
let bin = ContractSource::load_from_path(path_to_nft_bin).unwrap();
let mut contract = TrampolineNFTContract::default();
contract.code = Some(JsonBytes::from_bytes(bin));
contract
}
fn _gen_tnft_cell_output(contract: &TrampolineNFTContract) -> CellOutput {
let lock = contract
.lock
.clone()
.unwrap_or(_generate_always_success_lock(None).into());
CellOutput::new_builder()
.capacity(200_u64.pack())
.type_(
Some(ckb_types::packed::Script::from(
contract.as_script().unwrap(),
))
.pack(),
)
.lock(lock.into())
.build()
}
fn _generate_mock_tx(
inputs: Vec<CellInput>,
outputs: Vec<CellOutput>,
outputs_data: Vec<ckb_types::packed::Bytes>,
) -> TransactionView {
TransactionBuilder::default()
.inputs(inputs)
.outputs(outputs)
.outputs_data(outputs_data)
.build()
}
fn genesis_id_from(input: OutPoint) -> GenesisId {
let seed_tx_hash = input.tx_hash();
let seed_idx = input.index();
let mut seed = Vec::with_capacity(36);
seed.extend_from_slice(seed_tx_hash.as_slice());
seed.extend_from_slice(seed_idx.as_slice());
let hash = blake2b_256(&seed);
GenesisId::from_mol(hash.pack())
}
type NftArgs = SchemaPrimitiveType<Bytes, ckb_types::packed::Bytes>;
type NftField = ContractCellField<NftArgs, TrampolineNFT>;
#[test]
fn test_success_deploy() {
let mut tnft_contract = gen_nft_contract();
let mut chain = MockChain::default();
let minter_lock_cell = chain.get_default_script_outpoint();
let minter_lock_script = chain.build_script(&minter_lock_cell, vec![1_u8].into());
let tx_input_cell = chain.deploy_random_cell_with_default_lock(2000, Some(vec![1_u8].into()));
let tnft_code_cell = tnft_contract.as_code_cell();
let tnft_code_cell_outpoint = chain.create_cell(tnft_code_cell.0, tnft_code_cell.1);
tnft_contract.source = Some(ContractSource::Chain(tnft_code_cell_outpoint.into()));
let genesis_seed = genesis_id_from(tx_input_cell);
tnft_contract.add_input_rule(move |_tx| -> CellQuery {
CellQuery {
_query: QueryStatement::Single(CellQueryAttribute::LockHash(
minter_lock_script
.clone()
.unwrap()
.calc_script_hash()
.into(),
)),
_limit: 1,
}
});
tnft_contract.add_output_rule(ContractField::Data, move |ctx| -> NftField {
let nft: NftField = ctx.load(ContractField::Data);
if let ContractCellField::Data(nft_data) = nft {
let mut t_nft_data = nft_data;
t_nft_data.genesis_id = genesis_seed.clone();
NftField::Data(t_nft_data)
} else {
nft
}
});
let chain_rpc = ChainRpc::new(chain);
let generator = Generator::new()
.chain_service(&chain_rpc)
.query_service(&chain_rpc)
.pipeline(vec![&tnft_contract]);
let new_mint_tx = generator.generate();
let is_valid = chain_rpc.verify_tx(new_mint_tx.tx.into());
assert!(is_valid);
}
#[test]
fn test_invalid_mismatched_genesis_id() {
let mut tnft_contract = gen_nft_contract();
let mut chain = MockChain::default();
let minter_lock_cell = chain.get_default_script_outpoint();
let minter_lock_script = chain.build_script(&minter_lock_cell, vec![1_u8].into());
let _tx_input_cell = chain.deploy_random_cell_with_default_lock(2000, Some(vec![1_u8].into()));
let genesis_id_seed_cell =
chain.deploy_random_cell_with_default_lock(2000, Some(vec![2_u8].into()));
let tnft_code_cell = tnft_contract.as_code_cell();
let tnft_code_cell_outpoint = chain.create_cell(tnft_code_cell.0, tnft_code_cell.1);
tnft_contract.source = Some(ContractSource::Chain(tnft_code_cell_outpoint.into()));
let genesis_seed = genesis_id_from(genesis_id_seed_cell);
tnft_contract.add_input_rule(move |_tx| -> CellQuery {
CellQuery {
_query: QueryStatement::Single(CellQueryAttribute::LockHash(
minter_lock_script
.clone()
.unwrap()
.calc_script_hash()
.into(),
)),
_limit: 1,
}
});
tnft_contract.add_output_rule(ContractField::Data, move |ctx| -> NftField {
let nft: NftField = ctx.load(ContractField::Data);
if let ContractCellField::Data(nft_data) = nft {
let mut t_nft_data = nft_data;
t_nft_data.genesis_id = genesis_seed.clone();
NftField::Data(t_nft_data)
} else {
nft
}
});
let chain_rpc = ChainRpc::new(chain);
let generator = Generator::new()
.chain_service(&chain_rpc)
.query_service(&chain_rpc)
.pipeline(vec![&tnft_contract]);
let new_mint_tx = generator.generate();
let is_valid = chain_rpc.verify_tx(new_mint_tx.tx.into());
assert!(!is_valid);
}
#[test]
fn test_invalid_mint_of_pre_existing_tnft() {
let mut tnft_contract = gen_nft_contract();
let mut chain = MockChain::default();
let minter_lock_cell = chain.get_default_script_outpoint();
let minter_lock_script = chain.build_script(&minter_lock_cell, vec![1_u8].into());
let _tx_input_cell = chain.deploy_random_cell_with_default_lock(2000, Some(vec![1_u8].into()));
let input_tnft_seed = chain.deploy_random_cell_with_default_lock(2000, Some(vec![2_u8].into()));
let tnft_code_cell = tnft_contract.as_code_cell();
let tnft_code_cell_outpoint = chain.create_cell(tnft_code_cell.0, tnft_code_cell.1);
tnft_contract.source = Some(ContractSource::Chain(tnft_code_cell_outpoint.into()));
let tnft_input_cell = CellOutput::new_builder()
.lock(minter_lock_script.clone().unwrap())
.capacity(150_u64.pack())
.type_(Some(Script::from(tnft_contract.as_script().unwrap())).pack())
.build();
let tnft_input_cell_data = TrampolineNFT {
genesis_id: genesis_id_from(input_tnft_seed),
cid: Default::default(),
};
let _tnft_input_outpoint =
chain.deploy_cell_output(tnft_input_cell_data.to_bytes(), tnft_input_cell);
tnft_contract.add_input_rule(move |_tx| -> CellQuery {
CellQuery {
_query: QueryStatement::Single(CellQueryAttribute::LockHash(
minter_lock_script
.clone()
.unwrap()
.calc_script_hash()
.into(),
)),
_limit: 1,
}
});
tnft_contract.add_output_rule(ContractField::Data, move |ctx| -> NftField {
let nft: NftField = ctx.load(ContractField::Data);
if let NftField::ResolvedInputs(inputs) = ctx.load(TransactionField::ResolvedInputs) {
if let ContractCellField::Data(nft_data) = nft {
let mut t_nft_data = nft_data;
let genesis_id = genesis_id_from(inputs.first().unwrap().out_point.clone());
t_nft_data.genesis_id = genesis_id;
NftField::Data(t_nft_data)
} else {
nft
}
} else {
nft
}
});
let chain_rpc = ChainRpc::new(chain);
let generator = Generator::new()
.chain_service(&chain_rpc)
.query_service(&chain_rpc)
.pipeline(vec![&tnft_contract]);
let new_mint_tx = generator.generate();
let is_valid = chain_rpc.verify_tx(new_mint_tx.tx.into());
assert!(is_valid);
}
| use std::path::Path;
use ckb_hash::blake2b_256;
use trampoline_sdk::ckb_types::packed::{CellInput, CellOutput};
use ckb_jsonrpc_types::JsonBytes;
use trampoline_sdk::chain::{MockChain, MockChainTxProvider as ChainRpc};
use trampoline_sdk::ckb_types::{
self,
bytes::Bytes,
core::{TransactionBuilder, TransactionView},
error::Error,
packed::*,
prelude::*,
H256,
};
use trampoline_sdk::contract::*;
use trampoline_sdk::contract::{builtins::t_nft::*, generator::*};
use trampoline_sdk::contract::{schema::*, ContractSource};
fn _assert_script_error(err: Error, err_code: i8) {
let error_string = err.to_string();
assert!(
error_string.contains(format!("error code {} ", err_code).as_str()),
"error_string: {}, expected_error_code: {}",
error_string,
err_code
);
}
fn _generate_always_success_lock(
args: Option<ckb_types::packed::Bytes>,
) -> ckb_types::packed::Script {
let data: Bytes = ckb_always_success_script::ALWAYS_SUCCESS.to_vec().into();
let data_hash = H256::from(blake2b_256(data.to_vec().as_slice()));
ckb_types::packed::Script::default()
.as_builder()
.args(args.unwrap_or([0u8].pack()))
.code_hash(data_hash.pack())
.hash_type(ckb_types::core::ScriptHashType::Data1.into())
.build()
}
fn gen_nft_contract() -> TrampolineNFTContract {
let out_dir = std::env::var_os("OUT_DIR").unwrap();
let path_to_nft_bin = Path::new(&out_dir).join("trampoline-nft");
let bin = ContractSource::load_from_path(path_to_nft_bin).unwrap();
let mut contract = TrampolineNFTContract::default();
contract.code = Some(JsonBytes::from_bytes(bin));
contract
}
fn _gen_tnft_cell_output(contract: &TrampolineNFTContract) -> CellOutput {
let lock = contract
.lock
.clone()
.unwrap_or(_generate_always_success_lock(None).into());
CellOutput::new_builder()
.capacity(200_u64.pack())
.type_(
Some(ckb_types::packed::Script::from(
contract.as_script().unwrap(),
))
.pack(),
)
.lock(lock.into())
.build()
}
fn _generate_mock_tx(
inputs: Vec<CellInput>,
outputs: Vec<CellOutput>,
outputs_data: Vec<ckb_types::packed::Byte |
fn genesis_id_from(input: OutPoint) -> GenesisId {
let seed_tx_hash = input.tx_hash();
let seed_idx = input.index();
let mut seed = Vec::with_capacity(36);
seed.extend_from_slice(seed_tx_hash.as_slice());
seed.extend_from_slice(seed_idx.as_slice());
let hash = blake2b_256(&seed);
GenesisId::from_mol(hash.pack())
}
type NftArgs = SchemaPrimitiveType<Bytes, ckb_types::packed::Bytes>;
type NftField = ContractCellField<NftArgs, TrampolineNFT>;
#[test]
fn test_success_deploy() {
let mut tnft_contract = gen_nft_contract();
let mut chain = MockChain::default();
let minter_lock_cell = chain.get_default_script_outpoint();
let minter_lock_script = chain.build_script(&minter_lock_cell, vec![1_u8].into());
let tx_input_cell = chain.deploy_random_cell_with_default_lock(2000, Some(vec![1_u8].into()));
let tnft_code_cell = tnft_contract.as_code_cell();
let tnft_code_cell_outpoint = chain.create_cell(tnft_code_cell.0, tnft_code_cell.1);
tnft_contract.source = Some(ContractSource::Chain(tnft_code_cell_outpoint.into()));
let genesis_seed = genesis_id_from(tx_input_cell);
tnft_contract.add_input_rule(move |_tx| -> CellQuery {
CellQuery {
_query: QueryStatement::Single(CellQueryAttribute::LockHash(
minter_lock_script
.clone()
.unwrap()
.calc_script_hash()
.into(),
)),
_limit: 1,
}
});
tnft_contract.add_output_rule(ContractField::Data, move |ctx| -> NftField {
let nft: NftField = ctx.load(ContractField::Data);
if let ContractCellField::Data(nft_data) = nft {
let mut t_nft_data = nft_data;
t_nft_data.genesis_id = genesis_seed.clone();
NftField::Data(t_nft_data)
} else {
nft
}
});
let chain_rpc = ChainRpc::new(chain);
let generator = Generator::new()
.chain_service(&chain_rpc)
.query_service(&chain_rpc)
.pipeline(vec![&tnft_contract]);
let new_mint_tx = generator.generate();
let is_valid = chain_rpc.verify_tx(new_mint_tx.tx.into());
assert!(is_valid);
}
#[test]
fn test_invalid_mismatched_genesis_id() {
let mut tnft_contract = gen_nft_contract();
let mut chain = MockChain::default();
let minter_lock_cell = chain.get_default_script_outpoint();
let minter_lock_script = chain.build_script(&minter_lock_cell, vec![1_u8].into());
let _tx_input_cell = chain.deploy_random_cell_with_default_lock(2000, Some(vec![1_u8].into()));
let genesis_id_seed_cell =
chain.deploy_random_cell_with_default_lock(2000, Some(vec![2_u8].into()));
let tnft_code_cell = tnft_contract.as_code_cell();
let tnft_code_cell_outpoint = chain.create_cell(tnft_code_cell.0, tnft_code_cell.1);
tnft_contract.source = Some(ContractSource::Chain(tnft_code_cell_outpoint.into()));
let genesis_seed = genesis_id_from(genesis_id_seed_cell);
tnft_contract.add_input_rule(move |_tx| -> CellQuery {
CellQuery {
_query: QueryStatement::Single(CellQueryAttribute::LockHash(
minter_lock_script
.clone()
.unwrap()
.calc_script_hash()
.into(),
)),
_limit: 1,
}
});
tnft_contract.add_output_rule(ContractField::Data, move |ctx| -> NftField {
let nft: NftField = ctx.load(ContractField::Data);
if let ContractCellField::Data(nft_data) = nft {
let mut t_nft_data = nft_data;
t_nft_data.genesis_id = genesis_seed.clone();
NftField::Data(t_nft_data)
} else {
nft
}
});
let chain_rpc = ChainRpc::new(chain);
let generator = Generator::new()
.chain_service(&chain_rpc)
.query_service(&chain_rpc)
.pipeline(vec![&tnft_contract]);
let new_mint_tx = generator.generate();
let is_valid = chain_rpc.verify_tx(new_mint_tx.tx.into());
assert!(!is_valid);
}
#[test]
fn test_invalid_mint_of_pre_existing_tnft() {
let mut tnft_contract = gen_nft_contract();
let mut chain = MockChain::default();
let minter_lock_cell = chain.get_default_script_outpoint();
let minter_lock_script = chain.build_script(&minter_lock_cell, vec![1_u8].into());
let _tx_input_cell = chain.deploy_random_cell_with_default_lock(2000, Some(vec![1_u8].into()));
let input_tnft_seed = chain.deploy_random_cell_with_default_lock(2000, Some(vec![2_u8].into()));
let tnft_code_cell = tnft_contract.as_code_cell();
let tnft_code_cell_outpoint = chain.create_cell(tnft_code_cell.0, tnft_code_cell.1);
tnft_contract.source = Some(ContractSource::Chain(tnft_code_cell_outpoint.into()));
let tnft_input_cell = CellOutput::new_builder()
.lock(minter_lock_script.clone().unwrap())
.capacity(150_u64.pack())
.type_(Some(Script::from(tnft_contract.as_script().unwrap())).pack())
.build();
let tnft_input_cell_data = TrampolineNFT {
genesis_id: genesis_id_from(input_tnft_seed),
cid: Default::default(),
};
let _tnft_input_outpoint =
chain.deploy_cell_output(tnft_input_cell_data.to_bytes(), tnft_input_cell);
tnft_contract.add_input_rule(move |_tx| -> CellQuery {
CellQuery {
_query: QueryStatement::Single(CellQueryAttribute::LockHash(
minter_lock_script
.clone()
.unwrap()
.calc_script_hash()
.into(),
)),
_limit: 1,
}
});
tnft_contract.add_output_rule(ContractField::Data, move |ctx| -> NftField {
let nft: NftField = ctx.load(ContractField::Data);
if let NftField::ResolvedInputs(inputs) = ctx.load(TransactionField::ResolvedInputs) {
if let ContractCellField::Data(nft_data) = nft {
let mut t_nft_data = nft_data;
let genesis_id = genesis_id_from(inputs.first().unwrap().out_point.clone());
t_nft_data.genesis_id = genesis_id;
NftField::Data(t_nft_data)
} else {
nft
}
} else {
nft
}
});
let chain_rpc = ChainRpc::new(chain);
let generator = Generator::new()
.chain_service(&chain_rpc)
.query_service(&chain_rpc)
.pipeline(vec![&tnft_contract]);
let new_mint_tx = generator.generate();
let is_valid = chain_rpc.verify_tx(new_mint_tx.tx.into());
assert!(is_valid);
}
| s>,
) -> TransactionView {
TransactionBuilder::default()
.inputs(inputs)
.outputs(outputs)
.outputs_data(outputs_data)
.build()
} | function_block-function_prefixed | [
{
"content": "#[test]\n\nfn test_contract_pack_and_unpack_data() {\n\n let mut sudt_contract = gen_sudt_contract(None, None);\n\n\n\n sudt_contract.set_args(OwnerLockHash::from_mol(Byte32::default()));\n\n sudt_contract.set_data(SudtAmount::from_mol(1200_u128.pack()));\n\n\n\n let uint128_data: u128... |
Rust | libs/editor/libs/paths/src/paths.rs | Ryan1729IsParanoidAboutWriteAccess/rote | fbe20e4627c1b63d2af7141dcffd424563b8fe9f | use std::path::{Path, PathBuf};
pub fn find_in<'path, I: Iterator<Item = &'path Path>>(
paths: I,
needle: &str,
) -> Vec<PathBuf> {
if needle.is_empty() {
return Vec::new();
}
let len = {
if let (_, Some(l)) = paths.size_hint() {
l
} else {
128
}
};
let mut output: Vec<PathBuf> = Vec::with_capacity(len);
for path in paths {
let mut contains_needle = false;
macro_rules! cmp_match_indices {
($p1: expr, $p2: expr, $path_cmp: expr) => {{
use std::cmp::Ordering::*;
let mut p1_iter = $p1.match_indices(needle);
let mut p2_iter = $p2.match_indices(needle);
let mut backup_ordering = Equal;
let mut p1_needle_count = 0;
let mut p2_needle_count = 0;
loop {
match (p1_iter.next(), p2_iter.next()) {
(Some((p1_i, _)), Some((p2_i, _))) => {
contains_needle = true;
backup_ordering = p1_i.cmp(&p2_i);
p1_needle_count += 1;
p2_needle_count += 1;
}
(Some(_), None) => {
contains_needle = true;
p1_needle_count += 1;
break;
}
(None, Some(_)) => {
p2_needle_count += 1;
break;
}
(None, None) => {
break;
}
}
}
p1_needle_count
.cmp(&p2_needle_count)
.then_with(|| backup_ordering)
.then_with(|| $path_cmp)
}};
}
let i = if output.is_empty() {
contains_needle = if let Some(s) = path.to_str() {
s.match_indices(needle).count() > 0
} else {
let s = path.to_string_lossy();
s.match_indices(needle).count() > 0
};
0
} else {
output
.binary_search_by(|p| {
match (path.to_str(), p.to_str()) {
(Some(s1), Some(s2)) => cmp_match_indices!(s1, s2, p.as_path().cmp(path)),
(Some(s1), None) => {
let s2 = p.to_string_lossy();
cmp_match_indices!(s1, s2, p.as_path().cmp(path))
}
(None, Some(s2)) => {
let s1 = path.to_string_lossy();
cmp_match_indices!(s1, s2, p.as_path().cmp(path))
}
(None, None) => {
let s1 = path.to_string_lossy();
let s2 = p.to_string_lossy();
cmp_match_indices!(s1, s2, p.as_path().cmp(path))
}
}
})
.unwrap_or_else(|i| i)
};
if contains_needle {
output.insert(i, path.to_path_buf());
}
}
output
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn find_in_paths_works_on_this_small_example() {
let needle = "b";
let searched_paths = vec![
PathBuf::from("C:\\Users\\ryan1729\\Documents\\bartog.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beans.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\unrelated.txt"),
];
let expected = vec![
PathBuf::from("C:\\Users\\ryan1729\\Documents\\bartog.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beans.txt"),
];
assert_eq!(
find_in(searched_paths.iter().map(|p| p.as_path()), needle),
expected
);
}
#[test]
fn find_in_paths_sorts_things_with_multiple_needles_higher() {
let needle = "b";
let searched_paths = vec![
PathBuf::from("C:\\Users\\ryan1729\\Documents\\basketball.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beans.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beebasketball.txt"),
];
let expected = vec![
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beebasketball.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\basketball.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beans.txt"),
];
assert_eq!(
find_in(searched_paths.iter().map(|p| p.as_path()), needle),
expected
);
}
}
| use std::path::{Path, PathBuf};
pub fn find_in<'path, I: Iterator<Item = &'path Path>>(
paths: I,
needle: &str,
) -> Vec<PathBuf> {
if needle.is_empty() {
return Vec::new();
}
let len = {
if let (_, Some(l)) = paths.size_hint() {
l
} else {
128
}
};
let mut output: Vec<PathBuf> = Vec::with_capacity(len);
for path in paths {
let mut contains_needle = false;
macro_rules! cmp_match_indices {
($p1: expr, $p2: expr, $path_cmp: expr) => {{
use std::cmp::Ordering::*;
let mut p1_iter = $p1.match_indices(needle);
let mut p2_iter = $p2.match_indices(needle);
let mut backup_ordering = Equal;
let mut p1_needle_count = 0;
let mut p2_needle_count = 0;
loop {
match (p1_iter.next(), p2_iter.next()) {
(Some((p1_i, _)), Some((p2_i, _))) => {
contains_needle = true;
backup_ordering = p1_i.cmp(&p2_i);
p1_needle_count += 1;
p2_needle_count += 1;
}
(Some(_), None) => {
contains_needle = true;
p1_needle_count += 1;
break;
}
(None, Some(_)) => {
p2_needle_count += 1;
break;
}
(None, None) => {
break;
}
}
}
p1_needle_count
.cmp(&p2_needle_count)
.then_with(|| backup_ordering)
.then_with(|| $path_cmp)
}};
}
let i = if output.is_empty() {
contains_needle = if let Some(s) = path.to_str() {
s.match_indices(needle).count() > 0
} else {
let s = path.to_string_lossy();
s.match_indices(needle).count() > 0
};
0
} else {
output
.binary_search_by(|p| {
match (path.to_str(), p.to_str()) {
(Some(s1), Some(s2)) => cmp_match_indices!(s1, s2, p.as_path().cmp(path)),
(Some(s1), None) => {
let s2 = p.to_string_lossy();
cmp_match_indices!(s1, s2, p.as_path().cmp(path))
}
(None, Some(s2)) => {
let s1 = path.to_string_lossy();
cmp_match_indices!(s1, s2, p.as_path().cmp(path))
}
(None, None) => {
let s1 = path.to_string_lossy();
let s2 = p.to_string_lossy();
cmp_match_indices!(s1, s2, p.as_path().cmp(path))
}
}
})
.unwrap_or_else(|i| i)
};
if contains_needle {
output.insert(i, path.to_path_buf());
}
}
output
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn find_in_paths_works_on_this_small_example() {
let needle = "b";
let searched_paths = vec![
PathBuf::from("C:\\Users\\rya | rom("C:\\Users\\ryan1729\\Documents\\beans.txt"),
];
assert_eq!(
find_in(searched_paths.iter().map(|p| p.as_path()), needle),
expected
);
}
#[test]
fn find_in_paths_sorts_things_with_multiple_needles_higher() {
let needle = "b";
let searched_paths = vec![
PathBuf::from("C:\\Users\\ryan1729\\Documents\\basketball.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beans.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beebasketball.txt"),
];
let expected = vec![
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beebasketball.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\basketball.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beans.txt"),
];
assert_eq!(
find_in(searched_paths.iter().map(|p| p.as_path()), needle),
expected
);
}
}
| n1729\\Documents\\bartog.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\beans.txt"),
PathBuf::from("C:\\Users\\ryan1729\\Documents\\unrelated.txt"),
];
let expected = vec![
PathBuf::from("C:\\Users\\ryan1729\\Documents\\bartog.txt"),
PathBuf::f | function_block-random_span | [] |
Rust | src/mesh.rs | ArvinSKushwaha/dynamics_engine | a1189653d3dc5c9b4dfd4eee3eee75b7b6f3b9ed | use crate::object::{Ray, RayCollision};
use crate::{Float, Mat3, Point3, UnitVec3, Vec3, EPSILON};
use na::{point, vector};
use nalgebra as na;
use std::io::{BufRead, BufReader};
#[derive(Debug, Clone)]
pub struct MeshOptions {
pub smooth_normals: bool,
}
#[derive(Debug, Clone)]
pub struct PolygonMesh {
pub vertex_list: Vec<Point3>,
pub vertices_to_faces: Vec<Vec<usize>>,
pub faces_to_vertices: Vec<Vec<usize>>,
pub face_normals: Vec<UnitVec3>,
pub vertex_normals: Vec<UnitVec3>,
pub mesh_options: MeshOptions,
pub smooth_transform_matrices: Option<Vec<Mat3>>,
}
impl PolygonMesh {
pub fn get_mesh(&self) -> &PolygonMesh {
self
}
pub fn get_vertex_count(&self) -> usize {
self.vertex_list.len()
}
pub fn get_face_count(&self) -> usize {
self.face_normals.len()
}
pub fn from_many(x: &[PolygonMesh]) -> PolygonMesh {
x.iter()
.fold(
PolygonMesh {
vertex_list: vec![],
vertices_to_faces: vec![],
faces_to_vertices: vec![],
face_normals: vec![],
vertex_normals: vec![],
mesh_options: MeshOptions {
smooth_normals: false,
},
smooth_transform_matrices: None,
},
|a: PolygonMesh, b: &PolygonMesh| {
let mut a = a.clone();
let vertex_count = a.get_vertex_count();
let face_count = a.get_face_count();
a.vertex_list.extend(b.vertex_list.iter());
a.face_normals.extend(b.face_normals.iter());
a.vertex_normals.extend(b.vertex_normals.iter());
a.faces_to_vertices.extend(b.faces_to_vertices.clone());
a.vertices_to_faces.extend(b.faces_to_vertices.clone());
for i in face_count..a.faces_to_vertices.len() {
a.faces_to_vertices[i] = a.faces_to_vertices[i]
.iter()
.map(|v| *v + vertex_count)
.collect();
}
for i in vertex_count..a.vertices_to_faces.len() {
a.vertices_to_faces[i] = a.vertices_to_faces[i]
.iter()
.map(|v| *v + face_count)
.collect();
}
a
},
)
.clone()
}
}
pub fn read_obj(path: &str, smoothing: bool) -> Result<PolygonMesh, &str> {
let f = match std::fs::File::open(path) {
Ok(t) => t,
Err(_) => return Err("OBJ File opening failed"),
};
let mut smooth_transform_matrices = vec![];
let mut mesh = PolygonMesh {
vertex_list: vec![],
vertices_to_faces: vec![],
faces_to_vertices: vec![],
face_normals: vec![],
vertex_normals: vec![],
mesh_options: MeshOptions {
smooth_normals: smoothing,
},
smooth_transform_matrices: None,
};
for line in BufReader::new(f).lines() {
let data: String = match line {
Ok(t) => t.trim().to_string(),
Err(_) => return Err("OBJ File reading failed"),
};
if data.len() == 0 || data.starts_with("#") {
continue;
}
let mut iter = data.split_whitespace();
match iter.next() {
Some("v") => {
mesh.vertex_list.push(point![
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.)
]);
mesh.vertices_to_faces.push(vec![]);
}
Some("f") => {
let mut face_vertices: Vec<usize> = Vec::with_capacity(3);
loop {
if let Some(t) = iter.next() {
match t.split('/').collect::<Vec<&str>>()[0].parse::<usize>() {
Ok(v_num) => {
face_vertices.push(v_num - 1);
}
Err(_) => {
return Err("Integer parsing failed in face generation");
}
}
} else {
break;
}
}
assert!(face_vertices.len() >= 3);
let pts = [
mesh.vertex_list[face_vertices[2]],
mesh.vertex_list[face_vertices[1]],
mesh.vertex_list[face_vertices[0]],
];
let norm: Vec3 = (pts[1] - pts[0]).cross(&(pts[2] - pts[1]));
let unit_normal;
if let Some(unit_norm) = na::Unit::try_new(norm, 1.0e-7) {
unit_normal = unit_norm;
} else {
std::panic::panic_any("Yikes, the normals didn't compute right?!");
}
for i in 0..face_vertices.len() - 2 {
mesh.vertices_to_faces[face_vertices[0]].push(mesh.faces_to_vertices.len());
mesh.vertices_to_faces[face_vertices[i + 1]].push(mesh.faces_to_vertices.len());
mesh.vertices_to_faces[face_vertices[i + 2]].push(mesh.faces_to_vertices.len());
if smoothing {
smooth_transform_matrices.push(
match na::Matrix3::from_columns(&[
mesh.vertex_list[face_vertices[0]]
.coords
.add_scalar(EPSILON),
mesh.vertex_list[face_vertices[i + 1]]
.coords
.add_scalar(EPSILON),
mesh.vertex_list[face_vertices[i + 2]]
.coords
.add_scalar(EPSILON),
])
.try_inverse()
{
Some(m) => m,
None => return Err("Found a non-invertible matrix. Yikes."),
},
);
}
mesh.faces_to_vertices.push(vec![
face_vertices[0],
face_vertices[i + 1],
face_vertices[i + 2],
]);
mesh.face_normals.push(unit_normal);
}
}
Some("vt") => continue,
Some("vn") => {
mesh.vertex_normals.push(
na::Unit::try_new(
vector![
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.)
],
1e-7,
)
.unwrap(),
);
}
_ => continue,
};
}
if mesh.vertex_normals.len() != mesh.vertex_list.len() {
mesh.vertex_normals.resize(
mesh.vertex_list.len(),
na::UnitVector3::new_unchecked(vector![1., 0., 0.]),
);
for (i, faces) in mesh.vertices_to_faces.iter().enumerate() {
let current_vertex = mesh.vertex_list[i];
let mut normal = vector![0., 0., 0.];
for face in faces {
let vertex_index = mesh.faces_to_vertices[*face]
.iter()
.position(|&r| r == i)
.unwrap();
let prev_vertex =
mesh.vertex_list[mesh.faces_to_vertices[*face][(vertex_index as isize - 1)
.rem_euclid(mesh.faces_to_vertices[*face].len() as isize)
as usize]];
let next_vertex =
mesh.vertex_list[mesh.faces_to_vertices[*face][(vertex_index as isize + 1)
.rem_euclid(mesh.faces_to_vertices[*face].len() as isize)
as usize]];
let angle = (std::f64::consts::PI as Float)
- (current_vertex - prev_vertex)
.angle(&(next_vertex - current_vertex))
.abs();
normal += mesh.face_normals[*face].into_inner() * angle
/ (2. * (std::f64::consts::PI as Float));
}
mesh.vertex_normals[i] = na::Unit::new_normalize(normal);
}
}
for i in 0..mesh.get_face_count() {
assert_eq!(mesh.faces_to_vertices[i].len(), 3);
}
mesh.smooth_transform_matrices = Some(smooth_transform_matrices);
assert_eq!(mesh.face_normals.len(), mesh.faces_to_vertices.len());
assert_eq!(mesh.vertex_list.len(), mesh.vertices_to_faces.len());
assert_eq!(mesh.vertex_list.len(), mesh.vertex_normals.len());
return Result::Ok(mesh);
}
pub fn get_potential_collisions(mesh: &PolygonMesh, ray: &Ray) -> Vec<RayCollision> {
let mut probable_faces = vec![];
for i in 0..mesh.get_face_count() {
let vertices = (
mesh.vertex_list[mesh.faces_to_vertices[i][0]],
mesh.vertex_list[mesh.faces_to_vertices[i][1]],
mesh.vertex_list[mesh.faces_to_vertices[i][2]],
);
let normals = (
mesh.vertex_normals[mesh.faces_to_vertices[i][0]],
mesh.vertex_normals[mesh.faces_to_vertices[i][1]],
mesh.vertex_normals[mesh.faces_to_vertices[i][2]],
);
let (edge1, edge2, h, s, q);
let (a, f, u, v);
edge1 = vertices.1 - vertices.0;
edge2 = vertices.2 - vertices.0;
h = ray.direction.cross(&edge2);
a = edge1.dot(&h);
if a > -EPSILON && a < EPSILON {
continue;
}
f = 1.0 / a;
s = ray.origin - vertices.0;
u = f * s.dot(&h);
if u < 0. || u > 1. {
continue;
}
q = s.cross(&edge1);
v = f * ray.direction.dot(&q);
if v < 0. || u + v > 1. {
continue;
}
let t = f * edge2.dot(&q);
if t > 0. {
assert!(!t.is_nan());
let pos = ray.origin + ray.direction.scale(t);
probable_faces.push(RayCollision {
mesh: unsafe { std::mem::transmute(mesh) },
distance: t,
face_normal: mesh.face_normals[i],
position: pos,
smooth_normal: if mesh.mesh_options.smooth_normals {
let matrices = mesh.smooth_transform_matrices.as_ref().unwrap();
let components = matrices[i] * pos.coords.add_scalar(EPSILON);
Some(UnitVec3::new_normalize(
normals.0.scale(components.x)
+ normals.1.scale(components.y)
+ normals.2.scale(components.z),
))
} else {
None
},
});
}
}
probable_faces.sort_unstable_by(|a, b| a.distance.partial_cmp(&b.distance).unwrap());
probable_faces
}
| use crate::object::{Ray, RayCollision};
use crate::{Float, Mat3, Point3, UnitVec3, Vec3, EPSILON};
use na::{point, vector};
use nalgebra as na;
use std::io::{BufRead, BufReader};
#[derive(Debug, Clone)]
pub struct MeshOptions {
pub smooth_normals: bool,
}
#[derive(Debug, Clone)]
pub struct PolygonMesh {
pub vertex_list: Vec<Point3>,
pub vertices_to_faces: Vec<Vec<usize>>,
pub faces_to_vertices: Vec<Vec<usize>>,
pub face_normals: Vec<UnitVec3>,
pub vertex_normals: Vec<UnitVec3>,
pub mesh_options: MeshOptions,
pub smooth_transform_matrices: Option<Vec<Mat3>>,
}
impl PolygonMesh {
pub fn get_mesh(&self) -> &PolygonMesh {
self
}
pub fn get_vertex_count(&self) -> usize {
self.vertex_list.len()
}
pub fn get_face_count(&self) -> usize {
self.face_normals.len()
}
pub fn from_many(x: &[PolygonMesh]) -> PolygonMesh {
x.iter()
.fold(
PolygonMesh {
vertex_list: vec![],
vertices_to_faces: vec![],
faces_to_vertices: vec![],
face_normals: vec![],
vertex_normals: vec![],
mesh_options: MeshOptions {
smooth_normals: false,
},
smooth_transform_matrices: None,
},
|a: PolygonMesh, b: &PolygonMesh| {
let mut a = a.clone();
let vertex_count = a.get_vertex_count();
let face_count = a.get_face_count();
a.vertex_list.extend(b.vertex_list.iter());
a.face_normals.extend(b.face_normals.iter());
a.vertex_normals.extend(b.vertex_normals.iter());
a.faces_to_vertices.extend(b.faces_to_vertices.clone());
a.vertices_to_faces.extend(b.faces_to_vertices.clone());
for i in face_count..a.faces_to_vertices.len() {
a.faces_to_vertices[i] = a.faces_to_vertices[i]
.iter()
.map(|v| *v + vertex_count)
.collect();
}
for i in vertex_count..a.vertices_to_faces.len() {
a.vertices_to_faces[i] = a.vertices_to_faces[i]
.iter()
.map(|v| *v + face_count)
.collect();
}
a
},
)
.clone()
}
}
pub fn read_obj(path: &str, smoothing: bool) -> Result<PolygonMesh, &str> {
let f = match std::fs::File::open(path) {
Ok(t) => t,
Err(_) => return Err("OBJ File opening failed"),
};
let mut smooth_transform_matrices = vec![];
let mut mesh = PolygonMesh {
vertex_list: vec![],
vertices_to_faces: vec![],
faces_to_vertices: vec![],
face_normals: vec![],
vertex_normals: vec![],
mesh_options: MeshOptions {
smooth_normals: smoothing,
},
smooth_transform_matrices: None,
};
for line in BufReader::new(f).lines() {
let data: String = match line {
Ok(t) => t.trim().to_string(),
Err(_) => return Err("OBJ File reading failed"),
};
if data.len() == 0 || data.starts_with("#") {
continue;
}
let mut iter = data.split_whitespace();
match iter.next() {
Some("v") => {
mesh.vertex_list.push(point![
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.)
]);
mesh.vertices_to_faces.push(vec![]);
}
Some("f") => {
let mut face_vertices: Vec<usize> = Vec::with_capacity(3);
loop {
if let Some(t) = iter.next() {
match t.split('/').collect::<Vec<&str>>()[0].parse::<usize>() {
Ok(v_num) => {
face_vertices.push(v_num - 1);
}
Err(_) => {
return Err("Integer parsing failed in face generation");
}
}
} else {
break;
}
}
assert!(face_vertices.len() >= 3);
let pts = [
mesh.vertex_list[face_vertices[2]],
mesh.vertex_list[face_vertices[1]],
mesh.vertex_list[face_vertices[0]],
];
let norm: Vec3 = (pts[1] - pts[0]).cross(&(pts[2] - pts[1]));
let unit_normal;
if let Some(unit_norm) = na::Unit::try_new(norm, 1.0e-7) {
unit_normal = unit_norm;
} else {
| * (std::f64::consts::PI as Float));
}
mesh.vertex_normals[i] = na::Unit::new_normalize(normal);
}
}
for i in 0..mesh.get_face_count() {
assert_eq!(mesh.faces_to_vertices[i].len(), 3);
}
mesh.smooth_transform_matrices = Some(smooth_transform_matrices);
assert_eq!(mesh.face_normals.len(), mesh.faces_to_vertices.len());
assert_eq!(mesh.vertex_list.len(), mesh.vertices_to_faces.len());
assert_eq!(mesh.vertex_list.len(), mesh.vertex_normals.len());
return Result::Ok(mesh);
}
pub fn get_potential_collisions(mesh: &PolygonMesh, ray: &Ray) -> Vec<RayCollision> {
let mut probable_faces = vec![];
for i in 0..mesh.get_face_count() {
let vertices = (
mesh.vertex_list[mesh.faces_to_vertices[i][0]],
mesh.vertex_list[mesh.faces_to_vertices[i][1]],
mesh.vertex_list[mesh.faces_to_vertices[i][2]],
);
let normals = (
mesh.vertex_normals[mesh.faces_to_vertices[i][0]],
mesh.vertex_normals[mesh.faces_to_vertices[i][1]],
mesh.vertex_normals[mesh.faces_to_vertices[i][2]],
);
let (edge1, edge2, h, s, q);
let (a, f, u, v);
edge1 = vertices.1 - vertices.0;
edge2 = vertices.2 - vertices.0;
h = ray.direction.cross(&edge2);
a = edge1.dot(&h);
if a > -EPSILON && a < EPSILON {
continue;
}
f = 1.0 / a;
s = ray.origin - vertices.0;
u = f * s.dot(&h);
if u < 0. || u > 1. {
continue;
}
q = s.cross(&edge1);
v = f * ray.direction.dot(&q);
if v < 0. || u + v > 1. {
continue;
}
let t = f * edge2.dot(&q);
if t > 0. {
assert!(!t.is_nan());
let pos = ray.origin + ray.direction.scale(t);
probable_faces.push(RayCollision {
mesh: unsafe { std::mem::transmute(mesh) },
distance: t,
face_normal: mesh.face_normals[i],
position: pos,
smooth_normal: if mesh.mesh_options.smooth_normals {
let matrices = mesh.smooth_transform_matrices.as_ref().unwrap();
let components = matrices[i] * pos.coords.add_scalar(EPSILON);
Some(UnitVec3::new_normalize(
normals.0.scale(components.x)
+ normals.1.scale(components.y)
+ normals.2.scale(components.z),
))
} else {
None
},
});
}
}
probable_faces.sort_unstable_by(|a, b| a.distance.partial_cmp(&b.distance).unwrap());
probable_faces
}
| std::panic::panic_any("Yikes, the normals didn't compute right?!");
}
for i in 0..face_vertices.len() - 2 {
mesh.vertices_to_faces[face_vertices[0]].push(mesh.faces_to_vertices.len());
mesh.vertices_to_faces[face_vertices[i + 1]].push(mesh.faces_to_vertices.len());
mesh.vertices_to_faces[face_vertices[i + 2]].push(mesh.faces_to_vertices.len());
if smoothing {
smooth_transform_matrices.push(
match na::Matrix3::from_columns(&[
mesh.vertex_list[face_vertices[0]]
.coords
.add_scalar(EPSILON),
mesh.vertex_list[face_vertices[i + 1]]
.coords
.add_scalar(EPSILON),
mesh.vertex_list[face_vertices[i + 2]]
.coords
.add_scalar(EPSILON),
])
.try_inverse()
{
Some(m) => m,
None => return Err("Found a non-invertible matrix. Yikes."),
},
);
}
mesh.faces_to_vertices.push(vec![
face_vertices[0],
face_vertices[i + 1],
face_vertices[i + 2],
]);
mesh.face_normals.push(unit_normal);
}
}
Some("vt") => continue,
Some("vn") => {
mesh.vertex_normals.push(
na::Unit::try_new(
vector![
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.),
iter.next().unwrap_or("0").parse::<Float>().unwrap_or(0.)
],
1e-7,
)
.unwrap(),
);
}
_ => continue,
};
}
if mesh.vertex_normals.len() != mesh.vertex_list.len() {
mesh.vertex_normals.resize(
mesh.vertex_list.len(),
na::UnitVector3::new_unchecked(vector![1., 0., 0.]),
);
for (i, faces) in mesh.vertices_to_faces.iter().enumerate() {
let current_vertex = mesh.vertex_list[i];
let mut normal = vector![0., 0., 0.];
for face in faces {
let vertex_index = mesh.faces_to_vertices[*face]
.iter()
.position(|&r| r == i)
.unwrap();
let prev_vertex =
mesh.vertex_list[mesh.faces_to_vertices[*face][(vertex_index as isize - 1)
.rem_euclid(mesh.faces_to_vertices[*face].len() as isize)
as usize]];
let next_vertex =
mesh.vertex_list[mesh.faces_to_vertices[*face][(vertex_index as isize + 1)
.rem_euclid(mesh.faces_to_vertices[*face].len() as isize)
as usize]];
let angle = (std::f64::consts::PI as Float)
- (current_vertex - prev_vertex)
.angle(&(next_vertex - current_vertex))
.abs();
normal += mesh.face_normals[*face].into_inner() * angle
/ (2. | random | [] |
Rust | pallets/root-of-trust/src/lib.rs | NodleCode/PKI | 748aaddb8ce3ab7c90cfa3fd2610275f00f5cb7b | #![cfg_attr(not(feature = "std"), no_std)]
#[cfg(test)]
mod tests;
use codec::{Decode, Encode};
use frame_support::{
decl_error, decl_event, decl_module, decl_storage,
dispatch::DispatchResult,
ensure,
traits::{ChangeMembers, Currency, ExistenceRequirement, Get, OnUnbalanced, WithdrawReasons},
Parameter,
};
use frame_system::{self as system, ensure_signed};
use sp_runtime::traits::{MaybeDisplay, MaybeSerializeDeserialize, Member};
use sp_std::{fmt::Debug, prelude::Vec};
type BalanceOf<T> = <<T as Trait>::Currency as Currency<<T as system::Trait>::AccountId>>::Balance;
type NegativeImbalanceOf<T> =
<<T as Trait>::Currency as Currency<<T as system::Trait>::AccountId>>::NegativeImbalance;
#[derive(Encode, Decode, Default, Clone, PartialEq)]
pub struct RootCertificate<AccountId, CertificateId, BlockNumber> {
owner: AccountId,
key: CertificateId,
created: BlockNumber,
renewed: BlockNumber,
revoked: bool,
validity: BlockNumber,
child_revocations: Vec<CertificateId>,
}
pub trait Trait: system::Trait {
type Event: From<Event<Self>> + Into<<Self as system::Trait>::Event>;
type Currency: Currency<Self::AccountId>;
type CertificateId: Member
+ Parameter
+ MaybeSerializeDeserialize
+ Debug
+ MaybeDisplay
+ Ord
+ Default;
type SlotBookingCost: Get<BalanceOf<Self>>;
type SlotRenewingCost: Get<BalanceOf<Self>>;
type SlotValidity: Get<Self::BlockNumber>;
type FundsCollector: OnUnbalanced<NegativeImbalanceOf<Self>>;
}
decl_event!(
pub enum Event<T>
where
AccountId = <T as system::Trait>::AccountId,
CertificateId = <T as Trait>::CertificateId,
{
SlotTaken(AccountId, CertificateId),
SlotRenewed(CertificateId),
SlotRevoked(CertificateId),
ChildSlotRevoked(CertificateId, CertificateId),
}
);
decl_error! {
pub enum Error for Module<T: Trait> {
NotAMember,
SlotTaken,
NotEnoughFunds,
NoLongerValid,
NotTheOwner,
}
}
decl_storage! {
trait Store for Module<T: Trait> as RootOfTrustModule {
Members get(members): Vec<T::AccountId>;
Slots get(slots): map hasher(blake2_256) T::CertificateId => RootCertificate<T::AccountId, T::CertificateId, T::BlockNumber>;
}
}
decl_module! {
pub struct Module<T: Trait> for enum Call where origin: T::Origin {
fn deposit_event() = default;
fn book_slot(origin, certificate_id: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
ensure!(Self::is_member(&sender), Error::<T>::NotAMember);
ensure!(!<Slots<T>>::contains_key(&certificate_id), Error::<T>::SlotTaken);
match T::Currency::withdraw(&sender, T::SlotBookingCost::get(), WithdrawReasons::all(), ExistenceRequirement::AllowDeath) {
Ok(imbalance) => T::FundsCollector::on_unbalanced(imbalance),
Err(_) => Err(Error::<T>::NotEnoughFunds)?,
};
let now = <system::Module<T>>::block_number();
<Slots<T>>::insert(&certificate_id, RootCertificate {
owner: sender.clone(),
key: certificate_id.clone(),
created: now,
renewed: now,
revoked: false,
validity: T::SlotValidity::get(),
child_revocations: Vec::new(),
});
Self::deposit_event(RawEvent::SlotTaken(sender, certificate_id));
Ok(())
}
fn renew_slot(origin, certificate: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
let mut slot = <Slots<T>>::get(&certificate);
ensure!(Self::is_slot_valid(&slot), Error::<T>::NoLongerValid);
ensure!(slot.owner == sender, Error::<T>::NotTheOwner);
match T::Currency::withdraw(&sender, T::SlotRenewingCost::get(), WithdrawReasons::all(), ExistenceRequirement::AllowDeath) {
Ok(imbalance) => T::FundsCollector::on_unbalanced(imbalance),
Err(_) => Err(Error::<T>::NotEnoughFunds)?,
};
slot.renewed = <system::Module<T>>::block_number();
<Slots<T>>::insert(&certificate, slot);
Self::deposit_event(RawEvent::SlotRenewed(certificate));
Ok(())
}
fn revoke_slot(origin, certificate: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
let mut slot = <Slots<T>>::get(&certificate);
ensure!(Self::is_slot_valid(&slot), Error::<T>::NoLongerValid);
ensure!(slot.owner == sender, Error::<T>::NotTheOwner);
slot.revoked = true;
<Slots<T>>::insert(&certificate, slot);
Self::deposit_event(RawEvent::SlotRevoked(certificate));
Ok(())
}
fn revoke_child(origin, root: T::CertificateId, child: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
let mut slot = <Slots<T>>::get(&root);
ensure!(Self::is_slot_valid(&slot), Error::<T>::NoLongerValid);
ensure!(slot.owner == sender, Error::<T>::NotTheOwner);
ensure!(!slot.child_revocations.contains(&child), Error::<T>::NoLongerValid);
slot.child_revocations.push(child.clone());
<Slots<T>>::insert(&root, slot);
Self::deposit_event(RawEvent::ChildSlotRevoked(root, child));
Ok(())
}
}
}
impl<T: Trait> Module<T> {
fn is_member(who: &T::AccountId) -> bool {
Self::members().contains(who)
}
fn is_slot_valid(
slot: &RootCertificate<T::AccountId, T::CertificateId, T::BlockNumber>,
) -> bool {
let owner_is_member = Self::is_member(&slot.owner);
let revoked = slot.revoked;
let expired = slot.renewed + slot.validity <= <system::Module<T>>::block_number();
owner_is_member && !revoked && !expired
}
#[allow(dead_code)]
pub fn is_root_certificate_valid(cert: &T::CertificateId) -> bool {
let exists = <Slots<T>>::contains_key(cert);
let slot = <Slots<T>>::get(cert);
exists && Self::is_slot_valid(&slot)
}
#[allow(dead_code)]
pub fn is_child_certificate_valid(root: &T::CertificateId, child: &T::CertificateId) -> bool {
let equals = root == child;
let root_valid = Self::is_root_certificate_valid(root);
let revoked = <Slots<T>>::get(root).child_revocations.contains(child);
!equals && root_valid && !revoked
}
}
impl<T: Trait> ChangeMembers<T::AccountId> for Module<T> {
fn change_members_sorted(
_incoming: &[T::AccountId],
_outgoing: &[T::AccountId],
new: &[T::AccountId],
) {
<Members<T>>::put(new);
}
}
| #![cfg_attr(not(feature = "std"), no_std)]
#[cfg(test)]
mod tests;
use codec::{Decode, Encode};
use frame_support::{
decl_error, decl_event, decl_module, decl_storage,
dispatch::DispatchResult,
ensure,
traits::{ChangeMembers, Currency, ExistenceRequirement, Get, OnUnbalanced, WithdrawReasons},
Parameter,
};
use frame_system::{self as system, ensure_signed};
use sp_runtime::traits::{MaybeDisplay, MaybeSerializeDeserialize, Member};
use sp_std::{fmt::Debug, prelude::Vec};
type BalanceOf<T> = <<T as Trait>::Currency as Currency<<T as system::Trait>::AccountId>>::Balance;
type NegativeImbalanceOf<T> =
<<T as Trait>::Currency as Currency<<T as system::Trait>::AccountId>>::NegativeImbalance;
#[derive(Encode, Decode, Default, Clone, PartialEq)]
pub struct RootCertificate<AccountId, CertificateId, BlockNumber> {
owner: AccountId,
key: CertificateId,
created: BlockNumber,
renewed: BlockNumber,
revoked: bool,
validity: BlockNumber,
child_revocations: Vec<CertificateId>,
}
pub trait Trait: system::Trait {
type Event: From<Event<Self>> + Into<<Self as system::Trait>::Event>;
type Currency: Currency<Self::AccountId>;
type CertificateId: Member
+ Parameter
+ MaybeSerializeDeserialize
+ Debug
+ MaybeDisplay
+ Ord
+ Default;
type SlotBookingCost: Get<BalanceOf<Self>>;
type SlotRenewingCost: Get<BalanceOf<Self>>;
type SlotValidity: Get<Self::BlockNumber>;
type FundsCollector: OnUnbalanced<NegativeImbalanceOf<Self>>;
}
decl_event!(
pub enum Event<T>
where
AccountId = <T as system::Trait>::AccountId,
CertificateId = <T as Trait>::CertificateId,
{
SlotTaken(AccountId, CertificateId),
SlotRenewed(CertificateId),
SlotRevoked(CertificateId),
ChildSlotRevoked(CertificateId, CertificateId),
}
);
decl_error! {
pub enum Error for Module<T: Trait> {
NotAMember,
SlotTaken,
NotEnoughFunds,
NoLongerValid,
NotTheOwner,
}
}
decl_storage! {
trait Store for Module<T: Trait> as RootOfTrustModule {
Members get(members): Vec<T::AccountId>;
Slots get(slots): map hasher(blake2_256) T::CertificateId => RootCertificate<T::AccountId, T::CertificateId, T::BlockNumber>;
}
}
decl_module! {
pub struct Module<T: Trait> for enum Call where origin: T::Origin {
fn deposit_event() = default;
fn book_slot(origin, certificate_id: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
ensure!(Self::is_member(&sender), Error::<T>::NotAMember);
ensure!(!<Slots<T>>::contains_key(&certificate_id), Error::<T>::SlotTaken);
match T::Currency::withdraw(&sender, T::SlotBookingCost::get(), WithdrawReasons::all(), ExistenceRequirement::AllowDeath) {
Ok(imbalance) => T::FundsCollector::on_unbalanced(imbalance),
Err(_) => Err(Error::<T>::NotEnoughFunds)?,
};
let now = <system::Module<T>>::block_number();
<Slots<T>>::insert(&certificate_id, RootCertificate {
owner: sender.clone(),
key: certificate_id.clone(),
created: now,
renewed: now,
revoked: false,
validity: T::SlotValidity::get(),
child_revocations: Vec::new(),
});
Self::deposit_event(RawEvent::SlotTaken(sender, certificate_id));
Ok(())
}
fn renew_slot(origin, certificate: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
let mut slot = <Slots<T>>::get(&certificate);
ensure!(Self::is_slot_valid(&slot), Error::<T>::NoLongerValid);
ensure!(slot.owner == sender, Error::<T>::NotTheOwner);
match T::Currency::withdraw(&sender, T::SlotRenewingCost::get(), WithdrawReasons::all(), ExistenceRequirement::AllowDeath) {
Ok(imbalance) => T::FundsCollector::on_unbalanced(imbalance),
Err(_) => Err(Error::<T>::NotEnoughFunds)?,
};
slot.renewed = <system::Module<T>>::block_number();
<Slots<T>>::insert(&certificate, slot);
Self::deposit_event(RawEvent::SlotRenewed(certificate));
Ok(())
}
fn revoke_slot(origin, certificate: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
let mut slot = <Slots<T>>::get(&certificate);
ensure!(Self::is_slot_valid(&slot), Error::<T>::NoLongerValid);
ensure!(slot.owner == sender, Error::<T>::NotTheOwner);
slot.revoked = true;
<Slots<T>>::insert(&certificate, slot);
Self::deposit_event(RawEvent::SlotRevoked(certificate));
Ok(())
}
fn revoke_child(origin, root: T::CertificateId, child: T::CertificateId) -> DispatchResult {
let sender = ensure_signed(origin)?;
let mut slot = <Slots<T>>::get(&root);
ensure!(Self::is_slot_valid(&slot), Error::<T>::NoLongerValid);
ensure!(slot.owner == sender, Error::<T>::NotTheOwner);
ensure!(!slot.child_revocations.contains(&child), Error::<T>::NoLongerValid);
slot.child_revocations.push(child.clone());
<Slots<T>>::insert(&root, slot);
Self::deposit_event(RawEvent::ChildSlotRevoked(root, child));
Ok(())
}
}
}
impl<T: Trait> Module<T> {
fn is_member(who: &T::AccountId) -> bool {
Self::members().contains(who)
}
fn is_slot_valid(
slot: &RootCertificate<T::AccountId, T::CertificateId, T::BlockNumber>,
) -> bool {
let owner_is_member = Self::is_member(&slot.owner);
let revoked = slot.revoked;
let expired = slot.renewed + slot.validity <= <system::Module<T>>::block_number();
owner_is_member && !revoked && !expired
}
#[allow(dead_code)]
pub fn is_root_certificate_valid(cert: &T::CertificateId) -> bool {
let exists = <Slots<T>>::contains_key(cert);
let slot = <Slots<T>>::get(cert);
exists && Self::is_slot_valid(&slot)
}
#[allow(dead_code)]
|
}
impl<T: Trait> ChangeMembers<T::AccountId> for Module<T> {
fn change_members_sorted(
_incoming: &[T::AccountId],
_outgoing: &[T::AccountId],
new: &[T::AccountId],
) {
<Members<T>>::put(new);
}
}
| pub fn is_child_certificate_valid(root: &T::CertificateId, child: &T::CertificateId) -> bool {
let equals = root == child;
let root_valid = Self::is_root_certificate_valid(root);
let revoked = <Slots<T>>::get(root).child_revocations.contains(child);
!equals && root_valid && !revoked
} | function_block-full_function | [
{
"content": "#[test]\n\nfn child_certificate_not_valid_if_revoked_in_root_certificate() {\n\n new_test_ext().execute_with(|| {\n\n allocate_balances();\n\n do_register();\n\n\n\n let now = <system::Module<Test>>::block_number();\n\n <Slots<Test>>::insert(\n\n &OFFCHAIN... |
Rust | src/particle.rs | n3f4s/particule_generator | 731ee8d834f5a458b3ee78b7849b60ccb81d659b |
use vec3d::Vec3;
use point3d::Point3;
use drawable::Drawable;
use sdl2::render::Canvas;
use sdl2::video::Window;
use sdl2::surface::Surface;
use sdl2::gfx::primitives::DrawRenderer;
static PARTICLE_DENSITY : f64 = 1.0;
#[derive(Debug, Default, PartialEq, Copy, Clone)]
pub struct Particle {
position: Point3<i16>,
direction: Vec3<i16>,
alive: bool,
lifetime: u64,
max_lifetime: u64,
radius: i16,
mass: f64
}
impl Particle {
pub fn new(p: Point3<i16>, d: Vec3<i16>) -> Particle {
Particle {
position: p,
direction: d,
alive: true,
lifetime: 250,
max_lifetime: 250,
radius: 5,
mass: 5.0 * PARTICLE_DENSITY
}
}
pub fn set_position(&mut self, pos: Point3<i16>) {
self.position = pos;
}
pub fn is_alive(&self) -> bool {
self.alive
}
pub fn get_position(&self) -> Point3<i16> {
self.position
}
pub fn get_direction(&self) -> Vec3<i16> {
self.direction
}
pub fn get_lifetime(&self) -> u64 {
self.lifetime
}
pub fn get_radius(&self) -> i16 {
self.radius
}
pub fn get_mass(&self) -> f64 {
self.mass
}
pub fn copy(&self) -> Particle {
Particle {
position: self.position,
direction: self.direction,
alive: self.alive,
lifetime: self.lifetime,
max_lifetime: self.max_lifetime,
radius: self.radius,
mass: self.mass
}
}
pub fn update(&mut self) {
if self.alive {
self.position.apply_vec(self.direction/10.0);
self.lifetime -= 1;
if self.lifetime == 0 {
self.alive = false;
}
}
}
pub fn apply_force(&mut self, f: Vec3<i16>) {
self.direction += f
}
pub fn kill(&mut self) {
self.alive = false;
}
fn compute_alpha(&self) -> u8 {
((self.lifetime as f64) / (self.max_lifetime as f64) * (self.lifetime as f64) / (self.max_lifetime as f64) * 255.0) as u8
}
fn compute_green(&self) -> u8 {
(
(
1.0 - (((self.lifetime as f64) / (self.max_lifetime as f64) ) * ( (self.lifetime as f64) / (self.max_lifetime as f64)))
) * 255.0
) as u8
}
fn change_radius(&mut self, rad: i16) {
self.radius = rad;
self.mass = (rad as f64) * PARTICLE_DENSITY;
}
}
impl Drawable for Particle {
fn draw_surface(&self, c: &mut Canvas<Surface>) {
c.filled_circle(self.position.x as i16,
self.position.y as i16,
self.radius,
(255, self.compute_green(), 0, self.compute_alpha())).unwrap();
}
fn draw_window(&self, c: &mut Canvas<Window>) {
c.filled_circle(self.position.x as i16,
self.position.y as i16,
self.radius,
(255, self.compute_green(), 0, self.compute_alpha())).unwrap();
}
}
pub struct ParticleBuilder {
template: Particle
}
impl<'a> ParticleBuilder {
pub fn new(start_pos: Point3<i16>, start_dir: Vec3<i16>) -> ParticleBuilder {
ParticleBuilder {
template: Particle::new(start_pos, start_dir)
}
}
pub fn with_radius(&'a mut self, radius: i16) -> &'a mut ParticleBuilder {
self.template.change_radius(radius);
self
}
pub fn with_lifetime(&'a mut self, lifetime: u64) -> &'a mut ParticleBuilder {
self.template.max_lifetime = lifetime;
self.template.lifetime = lifetime;
self
}
pub fn create(&self) -> Particle {
self.template.clone()
}
}
|
use vec3d::Vec3;
use point3d::Point3;
use drawable::Drawable;
use sdl2::render::Canvas;
use sdl2::video::Window;
use sdl2::surface::Surface;
use sdl2::gfx::primitives::DrawRenderer;
static PARTICLE_DENSITY : f64 = 1.0;
#[derive(Debug, Default, PartialEq, Copy, Clone)]
pub struct Particle {
position: Point3<i16>,
direction: Vec3<i16>,
alive: bool,
lifetime: u64,
max_lifetime: u64,
radius: i16,
mass: f64
}
impl Particle {
pub fn new(p: Point3<i16>, d: Vec3<i16>) -> Particle {
Particle {
position: p,
direction: d,
alive: true,
li |
pub fn set_position(&mut self, pos: Point3<i16>) {
self.position = pos;
}
pub fn is_alive(&self) -> bool {
self.alive
}
pub fn get_position(&self) -> Point3<i16> {
self.position
}
pub fn get_direction(&self) -> Vec3<i16> {
self.direction
}
pub fn get_lifetime(&self) -> u64 {
self.lifetime
}
pub fn get_radius(&self) -> i16 {
self.radius
}
pub fn get_mass(&self) -> f64 {
self.mass
}
pub fn copy(&self) -> Particle {
Particle {
position: self.position,
direction: self.direction,
alive: self.alive,
lifetime: self.lifetime,
max_lifetime: self.max_lifetime,
radius: self.radius,
mass: self.mass
}
}
pub fn update(&mut self) {
if self.alive {
self.position.apply_vec(self.direction/10.0);
self.lifetime -= 1;
if self.lifetime == 0 {
self.alive = false;
}
}
}
pub fn apply_force(&mut self, f: Vec3<i16>) {
self.direction += f
}
pub fn kill(&mut self) {
self.alive = false;
}
fn compute_alpha(&self) -> u8 {
((self.lifetime as f64) / (self.max_lifetime as f64) * (self.lifetime as f64) / (self.max_lifetime as f64) * 255.0) as u8
}
fn compute_green(&self) -> u8 {
(
(
1.0 - (((self.lifetime as f64) / (self.max_lifetime as f64) ) * ( (self.lifetime as f64) / (self.max_lifetime as f64)))
) * 255.0
) as u8
}
fn change_radius(&mut self, rad: i16) {
self.radius = rad;
self.mass = (rad as f64) * PARTICLE_DENSITY;
}
}
impl Drawable for Particle {
fn draw_surface(&self, c: &mut Canvas<Surface>) {
c.filled_circle(self.position.x as i16,
self.position.y as i16,
self.radius,
(255, self.compute_green(), 0, self.compute_alpha())).unwrap();
}
fn draw_window(&self, c: &mut Canvas<Window>) {
c.filled_circle(self.position.x as i16,
self.position.y as i16,
self.radius,
(255, self.compute_green(), 0, self.compute_alpha())).unwrap();
}
}
pub struct ParticleBuilder {
template: Particle
}
impl<'a> ParticleBuilder {
pub fn new(start_pos: Point3<i16>, start_dir: Vec3<i16>) -> ParticleBuilder {
ParticleBuilder {
template: Particle::new(start_pos, start_dir)
}
}
pub fn with_radius(&'a mut self, radius: i16) -> &'a mut ParticleBuilder {
self.template.change_radius(radius);
self
}
pub fn with_lifetime(&'a mut self, lifetime: u64) -> &'a mut ParticleBuilder {
self.template.max_lifetime = lifetime;
self.template.lifetime = lifetime;
self
}
pub fn create(&self) -> Particle {
self.template.clone()
}
}
| fetime: 250,
max_lifetime: 250,
radius: 5,
mass: 5.0 * PARTICLE_DENSITY
}
} | function_block-function_prefixed | [
{
"content": "pub fn dot(v1: &Vec3, v2: &Vec3) -> f64 {\n\n v1.x * v2.x + v1.y * v2.y + v1.z * v2.z\n\n}\n\n\n",
"file_path": "src/vec3.rs",
"rank": 0,
"score": 83669.11190807322
},
{
"content": "pub fn unit_vector(v: Vec3) -> Vec3 {\n\n let mut tmp = v;\n\n tmp.make_unit();\n\n ... |
Rust | src/keychain/mod.rs | mikelodder7/keychain-services.rs | 6c68371b199d9d450d185681d80720ed4561b8d0 |
pub mod item;
pub mod key;
use self::item::MatchLimit;
pub use self::{item::Item, key::Key};
use crate::dictionary::*;
use crate::error::Error;
use crate::ffi::*;
use core_foundation::base::{CFTypeRef, TCFType};
use std::{ffi::CString, os::raw::c_char, os::unix::ffi::OsStrExt, path::Path, ptr};
declare_TCFType! {
Keychain, KeychainRef
}
impl_TCFType!(Keychain, KeychainRef, SecKeychainGetTypeID);
impl Keychain {
pub fn find_default() -> Result<Keychain, Error> {
let mut result: KeychainRef = ptr::null_mut();
let status = unsafe { SecKeychainCopyDefault(&mut result) };
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(unsafe { Keychain::wrap_under_create_rule(result) })
}
}
pub fn create(path: &Path, password: Option<&str>) -> Result<Keychain, Error> {
let path_cstring = CString::new(path.as_os_str().as_bytes()).unwrap();
let mut result: KeychainRef = ptr::null_mut();
let status = match password {
Some(pw) => unsafe {
SecKeychainCreate(
path_cstring.as_ptr() as *const c_char,
pw.len() as u32,
pw.as_bytes().as_ptr() as *const c_char,
false,
ptr::null(),
&mut result,
)
},
None => unsafe {
SecKeychainCreate(
path_cstring.as_ptr() as *const c_char,
0,
ptr::null(),
true,
ptr::null(),
&mut result,
)
},
};
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(unsafe { Keychain::wrap_under_create_rule(result) })
}
}
pub fn delete(self) -> Result<(), Error> {
let status = unsafe { SecKeychainDelete(self.as_concrete_TypeRef()) };
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(())
}
}
fn find_item(&self, mut attrs: DictionaryBuilder) -> Result<Item, Error> {
attrs.add(unsafe { kSecMatchLimit }, &MatchLimit::One.as_CFType());
attrs.add_boolean(unsafe { kSecReturnRef }, true);
let mut result: ItemRef = ptr::null_mut();
let status = unsafe {
SecItemCopyMatching(
Dictionary::from(attrs).as_concrete_TypeRef(),
&mut result as &mut CFTypeRef,
)
};
if let Some(e) = Error::maybe_from_OSStatus(status) {
return Err(e);
}
Ok(unsafe { Item::wrap_under_create_rule(result) })
}
fn add_item(&self, mut attrs: DictionaryBuilder) -> Result<Item, Error> {
attrs.add(unsafe { kSecUseKeychain }, self);
attrs.add_boolean(unsafe { kSecReturnRef }, true);
let mut result: ItemRef = ptr::null_mut();
let status =
unsafe { SecItemAdd(Dictionary::from(attrs).as_concrete_TypeRef(), &mut result) };
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(unsafe { Item::wrap_under_create_rule(result) })
}
}
}
impl Default for Keychain {
fn default() -> Keychain {
Self::find_default().expect("no default keychain available")
}
}
|
pub mod item;
pub mod key;
use self::item::MatchLimit;
pub use self::{item::Item, key::Key};
use crate::dictionary::*;
use crate::error::Error;
use crate::ffi::*;
use core_foundation::base::{CFTypeRef, TCFType};
use std::{ffi::CString, os::raw::c_char, os::unix::ffi::OsStrExt, path::Path, ptr};
declare_TCFType! {
Keychain, KeychainRef
}
impl_TCFType!(Keychain, KeychainRef, SecKeychainGetTypeID);
impl Keychain {
pub fn find_default() -> Result<Keychain, Error> {
let mut result: KeychainRef = ptr::null_mut();
let status = unsafe { SecKeychainCopyDefault(&mut result) };
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(unsafe { Keychain::wrap_under_create_rule(result) })
}
}
pub fn create(path: &Path, password: Option<&str>) -> Result<Keychain, Error> {
let path_cstring = CString::new(path.as_os_str().as_bytes()).unwrap();
let mut result: KeychainRef = ptr::null_mut();
let status = match password {
Some(pw) => unsafe {
SecKeychainCreate(
path_cstring.as_ptr() as *const c_char,
pw.len() as u32,
pw.as_bytes().as_ptr() as *const c_char,
false,
ptr::null(),
&mut result,
)
},
None => unsafe {
SecKeychainCreate(
path_cstring.as_ptr() as *const c_char,
0,
ptr::null(),
true,
ptr::null(),
&mut result,
)
},
};
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(unsafe { Keychain::wrap_under_create_rule(result) })
}
}
pub fn delete(self) -> Result<(), Error> {
let status = unsafe { SecKeychainDelete(self.as_concrete_TypeRef()) };
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(())
}
}
fn find_item(&self, mut attrs: DictionaryBuilder) -> Result<Item, Error> {
attrs.add(unsafe { kSecMatchLimit }, &MatchLimit::One.as_CFType());
attrs.add_boolean(unsafe { kSecReturnRef }, true);
let mut result: ItemRef = ptr::null_mut();
let status = unsafe {
SecItemCopyMatching(
Dictionary::from(attrs).as_concrete_TypeRef(),
&mut result as &mut CFTypeRef,
| unsafe { SecItemAdd(Dictionary::from(attrs).as_concrete_TypeRef(), &mut result) };
if let Some(e) = Error::maybe_from_OSStatus(status) {
Err(e)
} else {
Ok(unsafe { Item::wrap_under_create_rule(result) })
}
}
}
impl Default for Keychain {
fn default() -> Keychain {
Self::find_default().expect("no default keychain available")
}
}
| )
};
if let Some(e) = Error::maybe_from_OSStatus(status) {
return Err(e);
}
Ok(unsafe { Item::wrap_under_create_rule(result) })
}
fn add_item(&self, mut attrs: DictionaryBuilder) -> Result<Item, Error> {
attrs.add(unsafe { kSecUseKeychain }, self);
attrs.add_boolean(unsafe { kSecReturnRef }, true);
let mut result: ItemRef = ptr::null_mut();
let status =
| random | [
{
"content": "#[test]\n\nfn generate_and_use_rsa_keys() {\n\n let acl =\n\n AccessControl::create_with_flags(AttrAccessible::WhenUnlocked, Default::default()).unwrap();\n\n\n\n let generate_params = KeyPairGenerateParams::new(AttrKeyType::Rsa, 2048).access_control(&acl);\n\n\n\n let keypair = Ke... |
Rust | kailua_types/src/ty/tag.rs | nxgtri/kailua | 17eb0750ff8bbe4237d75f31f9b8aa23170c3c28 | use std::fmt;
use kailua_env::Spanned;
use kailua_diag::{Result, Reporter};
use kailua_syntax::ast::{Attr, AttrValue};
use super::{Display, DisplayState, TypeResolver, ClassSystemId};
use message as m;
#[derive(Copy, Clone, PartialEq, Eq)]
pub enum Tag {
#[doc(hidden)] _Subtype,
#[doc(hidden)] _NoSubtype,
#[doc(hidden)] _NoSubtype2,
Require,
Type,
Assert,
AssertNot,
AssertType,
GenericPairs,
GlobalEnv,
GlobalEval,
BecomeModule,
PackagePath,
PackageCpath,
StringMeta,
MakeClass(ClassSystemId),
KailuaGenTvar,
KailuaAssertTvar,
}
impl Tag {
pub fn from(attr: &Attr, resolv: &mut TypeResolver) -> Result<Option<Tag>> {
let no_values = |resolv: &mut TypeResolver, tag| {
if let Some(ref values) = attr.values {
resolv.error(values, m::AttrCannotHaveAnyValues { name: &attr.name }).done()?;
}
Ok(Some(tag))
};
let values = |resolv: &mut TypeResolver, count| {
if let Some(ref values) = attr.values {
if values.len() != count {
resolv.error(values, m::AttrRequiresFixedNumOfValues { name: &attr.name,
count: count })
.done()?;
}
Ok(&values[..])
} else {
resolv.error(&attr.name, m::AttrRequiresFixedNumOfValues { name: &attr.name,
count: count })
.done()?;
const EMPTY: &'static [Spanned<AttrValue>] = &[];
Ok(EMPTY)
}
};
match &attr.name.base[..] {
b"internal subtype" => no_values(resolv, Tag::_Subtype),
b"internal no_subtype" => no_values(resolv, Tag::_NoSubtype),
b"internal no_subtype2" => no_values(resolv, Tag::_NoSubtype2),
b"require" => no_values(resolv, Tag::Require),
b"type" => no_values(resolv, Tag::Type),
b"assert" => no_values(resolv, Tag::Assert),
b"assert_not" => no_values(resolv, Tag::AssertNot),
b"assert_type" => no_values(resolv, Tag::AssertType),
b"generic_pairs" => no_values(resolv, Tag::GenericPairs),
b"genv" => no_values(resolv, Tag::GlobalEnv),
b"geval" => no_values(resolv, Tag::GlobalEval),
b"become_module" => no_values(resolv, Tag::BecomeModule),
b"package_path" => no_values(resolv, Tag::PackagePath),
b"package_cpath" => no_values(resolv, Tag::PackageCpath),
b"string_meta" => no_values(resolv, Tag::StringMeta),
b"make_class" => {
let values = values(resolv, 1)?;
if let Some(&AttrValue::Name(ref system)) = values.get(0).map(|v| &v.base) {
if let Some(system) = resolv.class_system_from_name(system)? {
return Ok(Some(Tag::MakeClass(system)));
}
}
Ok(None)
},
b"internal kailua_gen_tvar" => no_values(resolv, Tag::KailuaGenTvar),
b"internal kailua_assert_tvar" => no_values(resolv, Tag::KailuaAssertTvar),
_ => {
resolv.warn(&attr.name, m::UnknownAttrName { name: &attr.name.base }).done()?;
Ok(None)
}
}
}
pub fn name(&self) -> &'static str {
match *self {
Tag::Require => "require",
Tag::Type => "type",
Tag::Assert => "assert",
Tag::AssertNot => "assert_not",
Tag::AssertType => "assert_type",
Tag::GenericPairs => "generic_pairs",
Tag::GlobalEnv => "genv",
Tag::GlobalEval => "geval",
Tag::BecomeModule => "become_module",
Tag::PackagePath => "package_path",
Tag::PackageCpath => "package_cpath",
Tag::StringMeta => "string_meta",
Tag::MakeClass(_) => "make_class",
Tag::_Subtype => "internal subtype",
Tag::_NoSubtype => "internal no_subtype",
Tag::_NoSubtype2 => "internal no_subtype2",
Tag::KailuaGenTvar => "internal kailua_gen_tvar",
Tag::KailuaAssertTvar => "internal kailua_assert_tvar",
}
}
pub fn scope_local(&self) -> bool {
match *self {
Tag::Type |
Tag::Assert |
Tag::AssertNot |
Tag::AssertType |
Tag::GenericPairs |
Tag::MakeClass(_) |
Tag::KailuaGenTvar |
Tag::KailuaAssertTvar => true,
_ => false,
}
}
pub fn needs_subtype(&self) -> bool {
match *self {
Tag::_Subtype => true,
Tag::_NoSubtype => false,
Tag::_NoSubtype2 => false,
Tag::PackagePath |
Tag::PackageCpath => false,
_ => true,
}
}
}
impl fmt::Debug for Tag {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.name())?;
match *self {
Tag::MakeClass(csid) => {
write!(f, "({:?})", csid)?;
}
_ => {}
}
Ok(())
}
}
impl Display for Tag {
fn fmt_displayed(&self, f: &mut fmt::Formatter, st: &DisplayState) -> fmt::Result {
write!(f, "{}", self.name())?;
match *self {
Tag::MakeClass(csid) => {
write!(f, "(")?;
st.context.fmt_class_system_name(csid, f, st)?;
write!(f, ")")?;
}
_ => {}
}
Ok(())
}
}
| use std::fmt;
use kailua_env::Spanned;
use kailua_diag::{Result, Reporter};
use kailua_syntax::ast::{Attr, AttrValue};
use super::{Display, DisplayState, TypeResolver, ClassSystemId};
use message as m;
#[derive(Copy, Clone, PartialEq, Eq)]
pub enum Tag {
#[doc(hidden)] _Subtype,
#[doc(hidden)] _NoSubtype,
#[doc(hidden)] _NoSubtype2,
Require,
Type,
Assert,
AssertNot,
AssertType,
GenericPairs,
GlobalEnv,
GlobalEval,
BecomeModule,
PackagePath,
PackageCpath,
StringMeta,
MakeClass(ClassSystemId),
KailuaGenTvar,
KailuaAssertTvar,
}
impl Tag {
pub fn from(attr: &Attr, resolv: &mut TypeResolver) -> Result<Option<Tag>> {
let no_values = |resolv: &mut TypeResolver, tag| {
if let Some(ref values) = attr.values {
resolv.error(values, m::AttrCannotHaveAnyValues { name: &attr.name }).done()?;
}
Ok(Some(tag))
};
let values = |resolv: &mut TypeResolver, count| {
if let Some(ref values) = attr.values {
if values.len() != count {
resolv.error(values, m::AttrRequiresFixedNumOfValues { name: &attr.name,
count: count })
.done()?;
}
Ok(&values[..])
} else {
resolv.error(&attr.name, m::AttrRequiresFixedNumOfValues { name: &attr.name,
count: count })
.done()?;
const EMPTY: &'static [Spanned<AttrValue>] = &[];
Ok(EMPTY)
}
};
match &attr.name.base[..] {
b"internal subtype" => no_values(resolv, Tag::_Subtype),
b"internal no_subtype" => no_values(resolv, Tag::_NoSubtype),
b"internal no_subtype2" => no_values(resolv, Tag::_NoSubtype2),
b"require" => no_values(resolv, Tag::Require),
b"type" => no_values(resolv, Tag::Type),
b"assert" => no_values(resolv, Tag::Assert),
b"assert_not" => no_values(resolv, Tag::AssertNot),
b"assert_type" => no_values(resolv, Tag::AssertType),
b"generic_pairs" => no_values(resolv, Tag::GenericPairs),
b"genv" => no_values(resolv, Tag::GlobalEnv),
b"geval" => no_values(resolv, Tag::GlobalEval),
b"become_module" => no_values(resolv, Tag::BecomeModule),
b"package_path" => no_values(resolv, Tag::PackagePath),
b"package_cpath" => no_values(resolv, Tag::PackageCpath),
b"string_meta" => no_values(resolv, Tag::StringMeta),
b"make_class" => {
let values = values(resolv, 1)?;
if let Some(&AttrValue::Name(ref system)) = values.get(0).map(|v| &v.base) {
if let Some(system) = resolv.class_system_from_name(system)? {
return Ok(Some(Tag::MakeClass(system)));
}
}
Ok(None)
},
b"internal kailua_gen_tvar" => no_values(resolv, Tag::KailuaGenTvar),
b"internal kailua_assert_tvar" => no_values(resolv, Tag::KailuaAssertTvar),
_ => {
resolv.warn(&attr.name, m::UnknownAttrName { name: &attr.name.base }).done()?;
Ok(None)
}
}
}
pub fn name(&self) -> &'static str {
match *self {
Tag::Require => "require",
Tag::Type => "type",
Tag::Assert => "assert",
Tag::AssertNot => "assert_not",
Tag::AssertType => "assert_type",
Tag::GenericPairs => "generic_pairs",
Tag::GlobalEnv => "genv",
Tag::GlobalEval => "geval",
Tag::BecomeModule => "become_module",
Tag::PackagePath => "package_path",
Tag::PackageCpath => "package_cpath",
Tag::StringMeta => "string_meta",
Tag::MakeClass(_) => "make_class",
Tag::_Subtype => "internal subtype",
Tag::_NoSubtype => "internal no_subtype",
Tag::_NoSubtype2 => "internal no_subtype2",
Tag::KailuaGenTvar => "internal kailua_gen_tvar",
Tag::KailuaAssertTvar => "internal kailua_assert_tvar",
}
}
|
pub fn needs_subtype(&self) -> bool {
match *self {
Tag::_Subtype => true,
Tag::_NoSubtype => false,
Tag::_NoSubtype2 => false,
Tag::PackagePath |
Tag::PackageCpath => false,
_ => true,
}
}
}
impl fmt::Debug for Tag {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.name())?;
match *self {
Tag::MakeClass(csid) => {
write!(f, "({:?})", csid)?;
}
_ => {}
}
Ok(())
}
}
impl Display for Tag {
fn fmt_displayed(&self, f: &mut fmt::Formatter, st: &DisplayState) -> fmt::Result {
write!(f, "{}", self.name())?;
match *self {
Tag::MakeClass(csid) => {
write!(f, "(")?;
st.context.fmt_class_system_name(csid, f, st)?;
write!(f, ")")?;
}
_ => {}
}
Ok(())
}
}
| pub fn scope_local(&self) -> bool {
match *self {
Tag::Type |
Tag::Assert |
Tag::AssertNot |
Tag::AssertType |
Tag::GenericPairs |
Tag::MakeClass(_) |
Tag::KailuaGenTvar |
Tag::KailuaAssertTvar => true,
_ => false,
}
} | function_block-full_function | [
{
"content": "pub fn get_defs(name: &str) -> Option<&'static [Def]> {\n\n match name {\n\n \"lua51\" => Some(LUA51_DEFS),\n\n \"lua51_base\" => Some(LUA51_BASE_DEFS),\n\n \"lua51_package\" => Some(LUA51_PACKAGE_DEFS),\n\n \"lua51_string\" => Some(LUA51_STRING_DEFS),\n\... |
Rust | src/api/reddit/repository.rs | tigorlazuardi/ridit-rs | bae8b50db3237df03e925048bf5c5eb6d575b2af | use std::{convert::TryInto, path::PathBuf, sync::Arc, time::Duration, usize};
use anyhow::{bail, Context, Error, Result};
use imagesize::blob_size;
use reqwest::{header::RANGE, Client, Response};
use tokio::{
fs::{self, File},
io::AsyncWriteExt,
sync::{mpsc::UnboundedSender, Semaphore},
};
use tokio_retry::{
strategy::{jitter, FixedInterval},
Retry,
};
use super::models::{download_meta::DownloadMeta, download_status::DownloadStatus};
use crate::api::{
config::{config::Config, configuration::Subreddit},
reddit::models::{error::RedditError, listing::Listing},
};
#[derive(Clone, Debug)]
pub struct Repository {
client: Arc<Client>,
config: Arc<Config>,
semaphore: Arc<Semaphore>,
}
#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]
pub enum PrintOut {
Bar,
Text,
None,
}
static APP_USER_AGENT: &str = concat!(
"id.web.tigor.",
env!("CARGO_PKG_NAME"),
"/v",
env!("CARGO_PKG_VERSION"),
" (by /u/CrowFX)"
);
impl Repository {
pub fn new(config: Arc<Config>) -> Self {
let os = std::env::consts::OS;
let user_agent = os.to_string() + ":" + APP_USER_AGENT;
let client = reqwest::Client::builder()
.user_agent(user_agent)
.connect_timeout(Duration::from_secs(config.timeout.into()))
.build()
.context("failed to create request client")
.unwrap();
let semaphore = Arc::new(Semaphore::new(config.download_threads));
Self {
client: Arc::new(client),
config,
semaphore,
}
}
pub async fn download(
&self,
display: PrintOut,
progress: UnboundedSender<DownloadStatus>,
) -> Vec<(DownloadMeta, Result<(), Error>)> {
let mut handlers = Vec::new();
for (_, subreddit) in &self.config.subreddits {
let this = self.clone();
let subreddit = subreddit.clone();
let progress = progress.clone();
let handle = tokio::spawn(async move {
Ok::<_, Error>(this.exec_download(subreddit, display, progress).await?)
});
handlers.push(handle);
}
let mut v = Vec::new();
for handle in handlers {
match handle.await.unwrap() {
Ok(vec) => v.extend(vec),
Err(err) => println!("{:?}", err),
}
}
v
}
async fn exec_download(
&self,
subreddit: Subreddit,
display: PrintOut,
progress: UnboundedSender<DownloadStatus>,
) -> Result<Vec<(DownloadMeta, Result<(), Error>)>> {
let print = || {
println!("{} downloading listing", subreddit.padded_proper_name());
};
match display {
PrintOut::None => {}
_ => print(),
}
let downloads = self.download_listing(&subreddit).await?;
Ok(self.download_images(downloads, subreddit, progress).await)
}
async fn download_images(
&self,
downloads: Vec<DownloadMeta>,
subreddit: Subreddit,
progress: UnboundedSender<DownloadStatus>,
) -> Vec<(DownloadMeta, Result<(), Error>)> {
let mut handlers = Vec::new();
'meta: for mut meta in downloads.into_iter() {
for profile in &meta.profile {
if self.file_exists(profile, &meta).await {
continue 'meta;
}
}
let this = self.clone();
let sem = self.semaphore.clone();
let subreddit = subreddit.clone();
let progress = progress.clone();
let handle = tokio::spawn(async move {
let _x = sem.acquire().await.unwrap();
let op = this.download_image(&mut meta, subreddit, progress).await;
(meta, op)
});
handlers.push(handle);
}
let mut v = Vec::new();
for handle in handlers {
v.push(handle.await.unwrap());
}
v
}
async fn download_listing(&self, subreddit: &Subreddit) -> Result<Vec<DownloadMeta>> {
let listing_url = format!(
"https://reddit.com/r/{}/{}.json?limit=100",
subreddit.proper_name, subreddit.sort
);
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let resp: Response = Retry::spawn(retry_strategy, || async {
let res = self.client.get(&listing_url).send().await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| {
format!(
"failed to open connection to download listing from: {}",
listing_url
)
})?;
if !resp.status().is_success() {
let err = resp.json::<RedditError>().await.with_context(|| {
format!("failed to deserialize json body from: {}", listing_url)
})?;
bail!(
"downloading listing from [{}] give error: {}",
subreddit.proper_name,
err
);
}
let listing: Listing = resp
.json()
.await
.with_context(|| format!("failed to deserialize json body from: {}", listing_url))?;
Ok(listing.into_download_metas(&self.config))
}
async fn download_image(
&self,
meta: &mut DownloadMeta,
subreddit: Subreddit,
progress: UnboundedSender<DownloadStatus>,
) -> Result<()> {
if subreddit.download_first {
self.poke_image_size(meta).await?;
let mut should_continue = false;
for (profile, setting) in self.config.iter() {
if !meta.passed_checks(setting) {
continue;
}
if self.file_exists(profile, meta).await {
continue;
}
should_continue = true;
meta.profile.push(profile.to_owned());
}
if !should_continue {
return Ok(());
}
}
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let response: Response = Retry::spawn(retry_strategy, || async {
let res = self.client.get(&meta.url).send().await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| {
format!(
"failed to open connection to download image from: {}",
meta.url
)
})?;
let status = response.status();
if !status.is_success() {
bail!(format!(
"download from {} gives [{}: {}] status code",
meta.url,
status.as_u16(),
status.canonical_reason().unwrap_or("Unknown Reason"),
));
}
self.ensure_download_dir(meta).await?;
let temp_file = self.store_to_temp(response, meta, progress).await?;
for profile in &meta.profile {
let download_location = self.download_location(profile, meta);
fs::copy(&temp_file, &download_location)
.await
.with_context(|| {
format!(
"failed to copy file from tmp dir to {}",
download_location.display()
)
})?;
let dir_path = std::env::temp_dir()
.join("ridit")
.join(&meta.subreddit_name)
.join(&meta.filename);
fs::remove_file(&dir_path).await.with_context(|| {
format!(
"failed to remove temp downloaded file {}",
download_location.display()
)
})?;
}
Ok(())
}
async fn ensure_download_dir(&self, meta: &DownloadMeta) -> Result<()> {
for profile in &meta.profile {
let download_dir = self.config.path.join(profile).join(&meta.subreddit_name);
fs::create_dir_all(&download_dir).await.with_context(|| {
format!(
"failed to create download directory on: {}",
download_dir.display()
)
})?;
}
Ok(())
}
async fn poke_image_size(&self, meta: &mut DownloadMeta) -> Result<()> {
const LIMIT: usize = 1024 * 2 * 10;
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let mut resp = Retry::spawn(retry_strategy, || async {
let res = self
.client
.get(&meta.url)
.header(RANGE, LIMIT)
.send()
.await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| {
format!(
"failed to partial download an image to get image size from: {}",
meta.url
)
})?;
let mut data: Vec<u8> = Vec::new();
while let Some(chunk) = resp.chunk().await? {
data.append(&mut chunk.to_vec());
if data.len() >= LIMIT {
break;
}
}
let size = blob_size(&data)
.with_context(|| format!("error getting image dimension from: {}", meta.url))?;
meta.image_height = size
.height
.try_into()
.with_context(|| "image height is too big to process")?;
meta.image_width = size
.width
.try_into()
.with_context(|| "image width is too big to process")?;
Ok(())
}
fn download_dir(&self, profile: &str, meta: &DownloadMeta) -> PathBuf {
self.config.path.join(profile).join(&meta.subreddit_name)
}
fn download_location(&self, profile: &str, meta: &DownloadMeta) -> PathBuf {
self.download_dir(profile, meta).join(&meta.filename)
}
async fn file_exists(&self, profile: &str, meta: &DownloadMeta) -> bool {
fs::metadata(self.download_location(profile, meta))
.await
.is_ok()
}
async fn store_to_temp(
&self,
mut resp: Response,
meta: &DownloadMeta,
progress: UnboundedSender<DownloadStatus>,
) -> Result<PathBuf> {
let dir_path = std::env::temp_dir()
.join("ridit")
.join(&meta.subreddit_name);
fs::create_dir_all(&dir_path).await?;
let file_path = dir_path.join(&meta.filename);
let mut file = File::create(&file_path)
.await
.context("cannot create file on tmp dir")?;
let download_length = resp.content_length().unwrap_or(0);
progress
.send(meta.as_download_status(download_length, 0))
.unwrap();
while let Some(chunk) = resp.chunk().await? {
progress
.send(meta.as_download_status(download_length, chunk.len().try_into().unwrap()))
.unwrap();
if let Err(err) = file.write(&chunk).await {
progress
.send(
meta.as_download_status(download_length, chunk.len().try_into().unwrap())
.with_error(err.to_string()),
)
.unwrap();
bail!("failed to save image from {}. cause: {}", meta.url, err)
}
}
progress
.send(meta.as_download_status(download_length, 0).set_finished())
.unwrap();
Ok(file_path)
}
pub async fn subreddit_exist(subreddit: &mut String) -> Result<bool> {
let url = format!("https://reddit.com/r/{}.json", subreddit);
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let resp: Response = Retry::spawn(retry_strategy, || async {
let res = reqwest::get(&url).await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| format!("failed to check subreddit {}", subreddit))?;
let listing: Listing = resp
.json()
.await
.with_context(|| format!("failed to deserialize json body from: {}", url))?;
match listing.data.children.get(0) {
Some(v) => {
subreddit.clear();
subreddit.push_str(&v.data.subreddit);
Ok(true)
}
None => Ok(false),
}
}
}
| use std::{convert::TryInto, path::PathBuf, sync::Arc, time::Duration, usize};
use anyhow::{bail, Context, Error, Result};
use imagesize::blob_size;
use reqwest::{header::RANGE, Client, Response};
use tokio::{
fs::{self, File},
io::AsyncWriteExt,
sync::{mpsc::UnboundedSender, Semaphore},
};
use tokio_retry::{
strategy::{jitter, FixedInterval},
Retry,
};
use super::models::{download_meta::DownloadMeta, download_status::DownloadStatus};
use crate::api::{
config::{config::Config, configuration::Subreddit},
reddit::models::{error::RedditError, listing::Listing},
};
#[derive(Clone, Debug)]
pub struct Repository {
client: Arc<Client>,
config: Arc<Config>,
semaphore: Arc<Semaphore>,
}
#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord)]
pub enum PrintOut {
Bar,
Text,
None,
}
static APP_USER_AGENT: &str = concat!(
"id.web.tigor.",
env!("CARGO_PKG_NAME"),
"/v",
env!("CARGO_PKG_VERSION"),
" (by /u/CrowFX)"
);
impl Repository {
pub fn new(config: Arc<Config>) -> Self {
let os = std::env::consts::OS;
let user_agent = os.to_string() + ":" + APP_USER_AGENT;
let client = reqwest::Client::builder()
.user_agent(user_agent)
.connect_timeout(Duration::from_secs(config.timeout.into()))
.build()
.context("failed to create request client")
.unwrap();
let semaphore = Arc::new(Semaphore::new(config.download_threads));
Self {
client: Arc::new(client),
config,
semaphore,
}
}
pub async fn download(
&self,
display: PrintOut,
progress: UnboundedSender<DownloadStatus>,
) -> Vec<(DownloadMeta, Result<(), Error>)> {
let mut handlers = Vec::new();
for (_, subreddit) in &self.config.subreddits {
let this = self.clone();
let subreddit = subreddit.clone();
let progress = progress.clone();
let handle = tokio::spawn(async move {
Ok::<_, Error>(this.exec_download(subreddit, display, progress).await?)
});
handlers.push(handle);
}
let mut v = Vec::new();
for handle in handlers {
match handle.await.unwrap() {
Ok(vec) => v.extend(vec),
Err(err) => println!("{:?}", err),
}
}
v
}
async fn exec_download(
&self,
subreddit: Subreddit,
display: PrintOut,
progress: UnboundedSender<DownloadStatus>,
) -> Result<Vec<(DownloadMeta, Result<(), Error>)>> {
let print = || {
println!("{} downloading listing", subreddit.padded_proper_name());
};
match display {
PrintOut::None => {}
_ => print(),
}
let downloads = self.download_listing(&subreddit).await?;
Ok(self.download_images(downloads, subreddit, progress).await)
}
async fn download_images(
&self,
downloads: Vec<DownloadMeta>,
subreddit: Subreddit,
progress: UnboundedSender<DownloadStatus>,
) -> Vec<(DownloadMeta, Result<(), Error>)> {
let mut handlers = Vec::new();
'meta: for mut meta in downloads.into_iter() {
for profile in &meta.profile {
if self.file_exists(profile, &meta).await {
continue 'meta;
}
}
let this = self.clone();
let sem = self.semaphore.clone();
let subreddit = subreddit.clone();
let progress = progress.clone();
let handle = tokio::spawn(async move {
let _x = sem.acquire().await.unwrap();
let op = this.download_image(&mut meta, subreddit, progress).await;
(meta, op)
});
handlers.push(handle);
}
let mut v = Vec::new();
for handle in handlers {
v.push(handle.await.unwrap());
}
v
}
async fn download_listing(&self, subreddit: &Subreddit) -> Result<Vec<DownloadMeta>> {
let listing_url = format!(
"https://reddit.com/r/{}/{}.json?limit=100",
subreddit.proper_name, subreddit.sort
);
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let resp: Response = Retry::spawn(retry_strategy, || async {
let res = self.client.get(&listing_url).send().await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| {
format!(
"failed to open connection to download listing from: {}",
listing_url
)
})?;
if !resp.status().is_success() {
let err = resp.json::<RedditError>().await.with_context(|| {
format!("failed to deserialize json body from: {}", listing_url)
})?;
bail!(
"downloading listing from [{}] give error: {}",
subreddit.proper_name,
err
);
}
let listing: Listing = resp
.json()
.await
.with_context(|| format!("failed to deserialize json body from: {}", listing_url))?;
Ok(listing.into_download_metas(&self.config))
}
async fn download_image(
&self,
meta: &mut DownloadMeta,
subreddit: Subreddit,
progress: UnboundedSender<DownloadStatus>,
) -> Result<()> {
if subreddit.download_first {
self.poke_image_size(meta).await?;
let mut should_continue = false;
for (profile, setting) in self.config.iter() {
if !meta.passed_checks(setting) {
continue;
}
if self.file_exists(profile, meta).await {
continue;
}
should_continue = true;
meta.profile.push(profile.to_owned());
}
if !should_continue {
return Ok(());
}
}
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let response: Response = Retry::spawn(retry_strategy, || async {
let res = self.client.get(&meta.url).send().await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| {
format!(
"failed to open connection to download image from: {}",
meta.url
)
})?;
let status = response.status();
if !status.is_success() {
bail!(format!(
"download from {} gives [{}: {}] status code",
meta.url,
status.as_u16(),
status.canonical_reason().unwrap_or("Unknown Reason"),
));
}
self.ensure_download_dir(meta).await?;
let temp_file = self.store_to_temp(response, meta, progress).await?;
for profile in &meta.profile {
let download_location = self.download_location(profile, meta);
fs::copy(&temp_file, &download_location)
.await
.with_context(|| {
format!(
"failed to copy file from tmp dir to {}",
download_location.display()
)
})?;
let dir_path = std::env::temp_dir()
.join("ridit")
.join(&meta.subreddit_name)
.join(&meta.filename);
fs::remove_file(&dir_path).await.with_context(|| {
format!(
"failed to remove temp downloaded file {}",
download_location.display()
)
})?;
}
Ok(())
}
|
async fn poke_image_size(&self, meta: &mut DownloadMeta) -> Result<()> {
const LIMIT: usize = 1024 * 2 * 10;
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let mut resp = Retry::spawn(retry_strategy, || async {
let res = self
.client
.get(&meta.url)
.header(RANGE, LIMIT)
.send()
.await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| {
format!(
"failed to partial download an image to get image size from: {}",
meta.url
)
})?;
let mut data: Vec<u8> = Vec::new();
while let Some(chunk) = resp.chunk().await? {
data.append(&mut chunk.to_vec());
if data.len() >= LIMIT {
break;
}
}
let size = blob_size(&data)
.with_context(|| format!("error getting image dimension from: {}", meta.url))?;
meta.image_height = size
.height
.try_into()
.with_context(|| "image height is too big to process")?;
meta.image_width = size
.width
.try_into()
.with_context(|| "image width is too big to process")?;
Ok(())
}
fn download_dir(&self, profile: &str, meta: &DownloadMeta) -> PathBuf {
self.config.path.join(profile).join(&meta.subreddit_name)
}
fn download_location(&self, profile: &str, meta: &DownloadMeta) -> PathBuf {
self.download_dir(profile, meta).join(&meta.filename)
}
async fn file_exists(&self, profile: &str, meta: &DownloadMeta) -> bool {
fs::metadata(self.download_location(profile, meta))
.await
.is_ok()
}
async fn store_to_temp(
&self,
mut resp: Response,
meta: &DownloadMeta,
progress: UnboundedSender<DownloadStatus>,
) -> Result<PathBuf> {
let dir_path = std::env::temp_dir()
.join("ridit")
.join(&meta.subreddit_name);
fs::create_dir_all(&dir_path).await?;
let file_path = dir_path.join(&meta.filename);
let mut file = File::create(&file_path)
.await
.context("cannot create file on tmp dir")?;
let download_length = resp.content_length().unwrap_or(0);
progress
.send(meta.as_download_status(download_length, 0))
.unwrap();
while let Some(chunk) = resp.chunk().await? {
progress
.send(meta.as_download_status(download_length, chunk.len().try_into().unwrap()))
.unwrap();
if let Err(err) = file.write(&chunk).await {
progress
.send(
meta.as_download_status(download_length, chunk.len().try_into().unwrap())
.with_error(err.to_string()),
)
.unwrap();
bail!("failed to save image from {}. cause: {}", meta.url, err)
}
}
progress
.send(meta.as_download_status(download_length, 0).set_finished())
.unwrap();
Ok(file_path)
}
pub async fn subreddit_exist(subreddit: &mut String) -> Result<bool> {
let url = format!("https://reddit.com/r/{}.json", subreddit);
let retry_strategy = FixedInterval::from_millis(100).map(jitter).take(3);
let resp: Response = Retry::spawn(retry_strategy, || async {
let res = reqwest::get(&url).await?;
Ok::<Response, Error>(res)
})
.await
.with_context(|| format!("failed to check subreddit {}", subreddit))?;
let listing: Listing = resp
.json()
.await
.with_context(|| format!("failed to deserialize json body from: {}", url))?;
match listing.data.children.get(0) {
Some(v) => {
subreddit.clear();
subreddit.push_str(&v.data.subreddit);
Ok(true)
}
None => Ok(false),
}
}
}
| async fn ensure_download_dir(&self, meta: &DownloadMeta) -> Result<()> {
for profile in &meta.profile {
let download_dir = self.config.path.join(profile).join(&meta.subreddit_name);
fs::create_dir_all(&download_dir).await.with_context(|| {
format!(
"failed to create download directory on: {}",
download_dir.display()
)
})?;
}
Ok(())
} | function_block-full_function | [
{
"content": "fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n\ttonic_build::compile_protos(\"proto/server.proto\")?;\n\n\tOk(())\n\n}\n",
"file_path": "src/build.rs",
"rank": 0,
"score": 114218.0222370955
},
{
"content": "fn project_dir() -> ProjectDirs {\n\n\tProjectDirs::from(\"i... |
Rust | src/ed25519/mod.rs | acw/simple_crypto | 82bb499be36f17957e7f5e14755f5e67a2931fb4 |
mod constants;
mod fe;
mod loads;
mod point;
mod scalars;
use rand::Rng;
use sha::{Hash,SHA512};
use self::scalars::{curve25519_scalar_mask,x25519_sc_muladd,x25519_sc_reduce};
use self::point::{Point,Point2};
#[cfg(test)]
use testing::run_test;
#[cfg(test)]
use std::collections::HashMap;
use super::KeyPair;
#[derive(Debug,PartialEq)]
pub struct ED25519KeyPair
{
pub public: ED25519Public,
pub private: ED25519Private
}
impl KeyPair for ED25519KeyPair
{
type Public = ED25519Public;
type Private = ED25519Private;
fn new(pbl: ED25519Public, prv: ED25519Private) -> ED25519KeyPair
{
ED25519KeyPair {
public: pbl,
private: prv
}
}
}
impl ED25519KeyPair
{
pub fn generate<G: Rng>(rng: &mut G) -> ED25519KeyPair
{
let mut seed = [0; 32];
rng.fill_bytes(&mut seed);
let private = ED25519Private::from_seed(&seed);
let public = ED25519Public::from(&private);
ED25519KeyPair::new(public, private)
}
pub fn from_seed(seed: &[u8]) -> ED25519KeyPair
{
let private = ED25519Private::from_seed(seed);
let public = ED25519Public::from(&private);
ED25519KeyPair{ public, private }
}
}
#[derive(Debug,PartialEq)]
pub struct ED25519Private
{
seed: [u8; 32],
private: [u8; 32],
prefix: [u8; 32],
public: [u8; 32]
}
impl ED25519Private {
pub fn from_seed(seed: &[u8]) -> ED25519Private {
let mut result = ED25519Private {
seed: [0; 32],
private: [0; 32],
prefix: [0; 32],
public: [0; 32]
};
result.seed.copy_from_slice(seed);
let mut expanded = SHA512::hash(seed);
let (private, prefix) = expanded.split_at_mut(32);
result.private.copy_from_slice(private);
result.prefix.copy_from_slice(prefix);
curve25519_scalar_mask(&mut result.private);
let a = Point::scalarmult_base(&result.private);
result.public.copy_from_slice(&a.encode());
result
}
pub fn sign(&self, msg: &[u8]) -> Vec<u8>
{
let mut signature_s = [0u8; 32];
let mut ctx = SHA512::new();
ctx.update(&self.prefix);
ctx.update(&msg);
let nonce = digest_scalar(&ctx.finalize());
let r = Point::scalarmult_base(&nonce);
let signature_r = r.encode();
let hram_digest = eddsa_digest(&signature_r, &self.public, &msg);
let hram = digest_scalar(&hram_digest);
x25519_sc_muladd(&mut signature_s, &hram, &self.private, &nonce);
let mut result = Vec::with_capacity(64);
result.extend_from_slice(&signature_r);
result.extend_from_slice(&signature_s);
result
}
pub fn to_bytes(&self) -> Vec<u8>
{
self.seed.to_vec()
}
}
#[derive(Debug,PartialEq)]
pub struct ED25519Public
{
bytes: [u8; 32],
point: Point
}
impl<'a> From<&'a ED25519Private> for ED25519Public
{
fn from(x: &ED25519Private) -> ED25519Public
{
ED25519Public::new(&x.public).expect("Broke converting private ED25519 to public. (?!)")
}
}
#[derive(Debug)]
pub enum ED25519PublicImportError
{
WrongNumberOfBytes(usize),
InvalidPublicPoint
}
impl ED25519Public {
pub fn new(bytes: &[u8]) -> Result<ED25519Public,ED25519PublicImportError>
{
if bytes.len() != 32 {
return Err(ED25519PublicImportError::WrongNumberOfBytes(bytes.len()));
}
match Point::from_bytes(&bytes) {
None =>
Err(ED25519PublicImportError::InvalidPublicPoint),
Some(a) => {
let mut res = ED25519Public{ bytes: [0; 32], point: a };
res.bytes.copy_from_slice(&bytes);
Ok(res)
}
}
}
pub fn verify(&self, msg: &[u8], sig: &[u8]) -> bool
{
assert_eq!(sig.len(), 64);
let signature_r = &sig[..32];
let signature_s = &sig[32..];
if signature_s[31] & 0b11100000 != 0 {
return false;
}
let ainv = self.point.invert();
let h_digest = eddsa_digest(signature_r, &self.bytes, msg);
let h = digest_scalar(&h_digest);
let r = Point2::double_scalarmult_vartime(&h, &ainv, &signature_s);
let r_check = r.encode();
signature_r.to_vec() == r_check
}
pub fn to_bytes(&self) -> Vec<u8>
{
self.bytes.to_vec()
}
}
fn eddsa_digest(signature_r: &[u8], public_key: &[u8], msg: &[u8]) -> Vec<u8>
{
let mut ctx = SHA512::new();
ctx.update(signature_r);
ctx.update(public_key);
ctx.update(msg);
ctx.finalize()
}
fn digest_scalar(digest: &[u8]) -> Vec<u8> {
assert_eq!(digest.len(), 512/8);
let mut copy = [0; 512/8];
copy.copy_from_slice(digest);
x25519_sc_reduce(&mut copy);
copy[..32].to_vec()
}
#[cfg(test)]
fn run_signing_testcase(case: HashMap<String,(bool,Vec<u8>)>)
{
let (negr, rbytes) = case.get("r").unwrap();
let (negu, ubytes) = case.get("u").unwrap();
let (negm, mbytes) = case.get("m").unwrap();
let (negs, sbytes) = case.get("s").unwrap();
assert!(!negr && !negu && !negm && !negs);
let keypair = ED25519KeyPair::from_seed(rbytes);
assert_eq!(ubytes, &keypair.public.bytes.to_vec());
let mut privpub = Vec::new();
privpub.append(&mut rbytes.clone());
privpub.append(&mut ubytes.clone());
let sig = keypair.private.sign(&mbytes);
assert_eq!(sig.len(), sbytes.len());
assert!(sig.iter().eq(sbytes.iter()));
assert!(keypair.public.verify(&mbytes, &sig));
}
#[cfg(test)]
#[test]
fn rfc8072() {
let fname = "testdata/ed25519/rfc8032.test";
run_test(fname.to_string(), 4, run_signing_testcase);
}
#[cfg(test)]
#[test]
fn signing() {
let fname = "testdata/ed25519/sign.test";
run_test(fname.to_string(), 4, run_signing_testcase);
}
|
mod constants;
mod fe;
mod loads;
mod point;
mod scalars;
use rand::Rng;
use sha::{Hash,SHA512};
use self::scalars::{curve25519_scalar_mask,x25519_sc_muladd,x25519_sc_reduce};
use self::point::{Point,Point2};
#[cfg(test)]
use testing::run_test;
#[cfg(test)]
use std::collections::HashMap;
use super::KeyPair;
#[derive(Debug,PartialEq)]
pub struct ED25519KeyPair
{
pub public: ED25519Public,
pub private: ED25519Private
}
impl KeyPair for ED25519KeyPair
{
type Public = ED25519Public;
type Private = ED25519Private;
fn new(pbl: ED25519Public, prv: ED25519Private) -> ED25519KeyPair
{
ED25519KeyPair {
public: pbl,
private: prv
}
}
}
impl ED25519KeyPair
{
pub fn generate<G: Rng>(rng: &mut G) -> ED25519KeyPair
{
let mut seed = [0; 32];
rng.fill_bytes(&mut seed);
let private = ED25519Private::from_seed(&seed);
let public = ED25519Public::from(&private);
ED25519KeyPair::new(public, private)
}
pub fn from_seed(seed: &[u8]) -> ED25519KeyPair
{
let private = ED25519Private::from_seed(seed);
let public = ED25519Public::from(&private);
ED25519KeyPair{ public, private }
}
}
#[derive(Debug,PartialEq)]
pub struct ED25519Private
{
seed: [u8; 32],
private: [u8; 32],
prefix: [u8; 32],
public: [u8; 32]
}
impl ED25519Private {
pub fn from_seed(seed: &[u8]) -> ED25519Private {
let mut result = ED25519Private {
seed: [0; 32],
private: [0; 32],
prefix: [0; 32],
public: [0; 32]
};
result.seed.copy_from_slice(seed);
let mut expanded = SHA512::hash(seed);
let (private, prefix) = expanded.split_at_mut(32);
result.private.copy_from_slice(private);
result.prefix.copy_from_slice(prefix);
curve25519_scalar_mask(&mut result.private);
let a = Point::scalarmult_base(&result.private);
result.public.copy_from_slice(&a.encode());
result
}
pub fn sign(&self, msg: &[u8]) -> Vec<u8>
{
let mut signature_s = [0u8; 32];
let mut ctx = SHA512::new();
ctx.update(&self.prefix);
ctx.update(&msg);
let nonce = digest_scalar(&ctx.finalize());
let r = Point::scalarmult_base(&nonce);
let signature_r = r.encode();
let hram_digest = eddsa_digest(&signature_r, &self.public, &msg);
let hram = digest_scalar(&hram_digest);
x25519_sc_muladd(&mut signature_s, &hram, &self.private, &nonce);
let mut result = Vec::with_capacity(64);
result.extend_from_slice(&signature_r);
result.extend_from_slice(&signature_s);
result
}
pub fn to_bytes(&self) -> Vec<u8>
{
self.seed.to_vec()
}
}
#[derive(Debug,PartialEq)]
pub struct ED25519Public
{
bytes: [u8; 32],
point: Point
}
impl<'a> From<&'a ED25519Private> for ED25519Public
{
fn from(x: &ED25519Private) -> ED25519Public
{
ED25519Public::new(&x.public).expect("Broke converting private ED25519 to public. (?!)")
}
}
#[derive(Debug)]
pub enum ED25519PublicImportError
{
WrongNumberOfBytes(usize),
InvalidPublicPoint
}
impl ED25519Public {
pub fn new(bytes: &[u8]) -> Result<ED25519Public,ED25519PublicImportError>
{
if bytes.len() != 32 {
return Err(ED25519PublicImportError::WrongNumberOfBytes(bytes.len()));
}
match Point::from_bytes(&bytes) {
None =>
Err(ED25519PublicImportError::InvalidPublicPoint),
Some(a) => {
let mut res = ED25519Public{ bytes: [0; 32], point: a };
res.bytes.copy_from_slice(&bytes);
Ok(res)
}
}
}
pub fn verify(&self, msg: &[u8], sig: &[u8]) -> bool
{
assert_eq!(sig.len(), 64);
let signature_r = &sig[..32];
let signature_s = &sig[32..];
if signature_s[31] & 0b11100000 != 0 {
return false;
}
let ainv = self.point.invert();
let h_digest = eddsa_digest(signature_r, &self.bytes, msg);
let h = digest_scalar(&h_digest);
let r = Point2::double_scalarmult_vartime(&h, &ainv, &signature_s);
let r_check = r.encode();
signature_r.to_vec() == r_check
}
pub fn to_bytes(&self) -> Vec<u8>
{
self.bytes.to_vec()
}
}
|
fn digest_scalar(digest: &[u8]) -> Vec<u8> {
assert_eq!(digest.len(), 512/8);
let mut copy = [0; 512/8];
copy.copy_from_slice(digest);
x25519_sc_reduce(&mut copy);
copy[..32].to_vec()
}
#[cfg(test)]
fn run_signing_testcase(case: HashMap<String,(bool,Vec<u8>)>)
{
let (negr, rbytes) = case.get("r").unwrap();
let (negu, ubytes) = case.get("u").unwrap();
let (negm, mbytes) = case.get("m").unwrap();
let (negs, sbytes) = case.get("s").unwrap();
assert!(!negr && !negu && !negm && !negs);
let keypair = ED25519KeyPair::from_seed(rbytes);
assert_eq!(ubytes, &keypair.public.bytes.to_vec());
let mut privpub = Vec::new();
privpub.append(&mut rbytes.clone());
privpub.append(&mut ubytes.clone());
let sig = keypair.private.sign(&mbytes);
assert_eq!(sig.len(), sbytes.len());
assert!(sig.iter().eq(sbytes.iter()));
assert!(keypair.public.verify(&mbytes, &sig));
}
#[cfg(test)]
#[test]
fn rfc8072() {
let fname = "testdata/ed25519/rfc8032.test";
run_test(fname.to_string(), 4, run_signing_testcase);
}
#[cfg(test)]
#[test]
fn signing() {
let fname = "testdata/ed25519/sign.test";
run_test(fname.to_string(), 4, run_signing_testcase);
}
| fn eddsa_digest(signature_r: &[u8], public_key: &[u8], msg: &[u8]) -> Vec<u8>
{
let mut ctx = SHA512::new();
ctx.update(signature_r);
ctx.update(public_key);
ctx.update(msg);
ctx.finalize()
} | function_block-full_function | [
{
"content": "pub fn curve25519_scalar_mask(a: &mut [u8])\n\n{\n\n assert_eq!(a.len(), 32);\n\n a[0] &= 248;\n\n a[31] &= 127;\n\n a[31] |= 64;\n\n}\n\n\n",
"file_path": "src/ed25519/scalars.rs",
"rank": 0,
"score": 295214.22511977865
},
{
"content": "pub fn x25519_sc_reduce(s: &... |
Rust | src/parallelhash.rs | quininer/sp800-185 | 04472c21e6b92956983fff9178452ee38a9d9c80 | use tiny_keccak::{ Keccak, XofReader };
use rayon::prelude::*;
use ::cshake::CShake;
use ::utils::{ left_encode, right_encode };
#[derive(Clone)]
pub struct ParallelHash {
inner: CShake,
buf: Vec<u8>,
n: u64,
rate: usize,
blocksize: usize
}
impl ParallelHash {
#[inline]
pub fn new_parallelhash128(custom: &[u8], blocksize: usize) -> Self {
let mut hasher = ParallelHash {
inner: CShake::new_cshake128(b"ParallelHash", custom),
buf: Vec::new(),
n: 0,
rate: 128,
blocksize
};
hasher.init();
hasher
}
#[inline]
pub fn new_parallelhash256(custom: &[u8], blocksize: usize) -> Self {
let mut hasher = ParallelHash {
inner: CShake::new_cshake256(b"ParallelHash", custom),
buf: Vec::new(),
n: 0,
rate: 256,
blocksize
};
hasher.init();
hasher
}
fn init(&mut self) {
let mut encbuf = [0; 9];
let pos = left_encode(&mut encbuf, self.blocksize as u64);
self.inner.update(&encbuf[pos..]);
}
pub fn update(&mut self, buf: &[u8]) {
let rate = self.rate;
let pos = if !self.buf.is_empty() {
let len = self.blocksize - self.buf.len();
if buf.len() < len {
self.buf.extend_from_slice(buf);
return;
} else {
let mut encbuf = vec![0; rate / 4];
let mut shake = Keccak::new(200 - rate / 4, 0x1f);
shake.update(&self.buf);
shake.update(&buf[..len]);
shake.finalize(&mut encbuf);
self.inner.update(&encbuf);
self.buf.clear();
self.n += 1;
}
len
} else {
0
};
let bufs = buf[pos..].par_chunks(self.blocksize)
.map(|chunk| if chunk.len() < self.blocksize {
(false, chunk.into())
} else {
let mut encbuf = vec![0; rate / 4];
let mut shake = Keccak::new(200 - rate / 4, 0x1f);
shake.update(chunk);
shake.finalize(&mut encbuf);
(true, encbuf)
})
.collect::<Vec<_>>();
for (is_hashed, mut buf) in bufs {
if is_hashed {
self.inner.update(&buf);
self.n += 1;
} else {
self.buf.append(&mut buf);
}
}
}
#[inline]
pub fn finalize(mut self, buf: &mut [u8]) {
self.with_bitlength(buf.len() as u64 * 8);
self.inner.finalize(buf)
}
#[inline]
pub fn xof(mut self) -> XofReader {
self.with_bitlength(0);
self.inner.xof()
}
#[inline]
fn with_bitlength(&mut self, bitlength: u64) {
if !self.buf.is_empty() {
let mut encbuf = vec![0; self.rate / 4];
let mut shake = Keccak::new(200 - self.rate / 4, 0x1f);
shake.update(&self.buf);
shake.finalize(&mut encbuf);
self.inner.update(&encbuf);
self.buf.clear();
self.n += 1;
}
let mut encbuf = [0; 9];
let pos = right_encode(&mut encbuf, self.n);
self.inner.update(&encbuf[pos..]);
let pos = right_encode(&mut encbuf, bitlength);
self.inner.update(&encbuf[pos..]);
}
}
| use tiny_keccak::{ Keccak, XofReader };
use rayon::prelude::*;
use ::cshake::CShake;
use ::utils::{ left_encode, right_encode };
#[derive(Clone)]
pub struct ParallelHash {
inner: CShake,
buf: Vec<u8>,
n: u64,
rate: usize,
blocksize: usize
}
impl ParallelHash {
#[inline]
pub fn new_parallelhash128(custom: &[u8], blocksize: usize) -> Self {
let mut hasher = ParallelHash {
inner: CShake::new_cshake128(b"ParallelHash", custom),
buf: Vec::new(),
n: 0,
rate: 128,
blocksize
};
hasher.init();
hasher
}
#[inline]
pub fn new_parallelhash256(custom: &[u8], blocksize: usize) -> Self {
let mut hasher = ParallelHash {
inner: CShake::new_cshake256(b"ParallelHash", custom),
buf: Vec::new(),
n: 0,
rate: 256,
blocksize
};
hasher.init();
hasher
}
fn init(&mut self) {
let mut encbuf = [0; 9];
let pos = left_encode(&mut encbuf, self.blocksize as u64);
self.inner.update(&encbuf[pos..]);
}
pub fn update(&mut self, buf: &[u8]) {
let rate = self.rate;
let pos = if !self.buf.is_empty() {
let len = self.blocksize - self.buf.len();
if buf.len() < len {
self.buf.extend_from_slice(buf);
return;
} else {
let mut encbuf = vec![0; rate / 4];
let mut shake = Keccak::new(200 - rate / 4, 0x1f);
shake.update(&self.buf);
shake.update(&buf[..len]);
shak | let mut encbuf = [0; 9];
let pos = right_encode(&mut encbuf, self.n);
self.inner.update(&encbuf[pos..]);
let pos = right_encode(&mut encbuf, bitlength);
self.inner.update(&encbuf[pos..]);
}
}
| e.finalize(&mut encbuf);
self.inner.update(&encbuf);
self.buf.clear();
self.n += 1;
}
len
} else {
0
};
let bufs = buf[pos..].par_chunks(self.blocksize)
.map(|chunk| if chunk.len() < self.blocksize {
(false, chunk.into())
} else {
let mut encbuf = vec![0; rate / 4];
let mut shake = Keccak::new(200 - rate / 4, 0x1f);
shake.update(chunk);
shake.finalize(&mut encbuf);
(true, encbuf)
})
.collect::<Vec<_>>();
for (is_hashed, mut buf) in bufs {
if is_hashed {
self.inner.update(&buf);
self.n += 1;
} else {
self.buf.append(&mut buf);
}
}
}
#[inline]
pub fn finalize(mut self, buf: &mut [u8]) {
self.with_bitlength(buf.len() as u64 * 8);
self.inner.finalize(buf)
}
#[inline]
pub fn xof(mut self) -> XofReader {
self.with_bitlength(0);
self.inner.xof()
}
#[inline]
fn with_bitlength(&mut self, bitlength: u64) {
if !self.buf.is_empty() {
let mut encbuf = vec![0; self.rate / 4];
let mut shake = Keccak::new(200 - self.rate / 4, 0x1f);
shake.update(&self.buf);
shake.finalize(&mut encbuf);
self.inner.update(&encbuf);
self.buf.clear();
self.n += 1;
}
| random | [
{
"content": "/// `left_encode(x)` encodes the integer x as a byte string in a way that can be unambiguously parsed\n\n/// from the beginning of the string by inserting the length of the byte string before the byte string\n\n/// representation of x.\n\npub fn left_encode(buf: &mut [u8; 9], value: u64) -> usize ... |
Rust | src/mesh/model.rs | OllieBerzs/tegne-rs | be614c6b5091ffe476ffbe44ef4ea5b62d998078 |
use std::collections::HashSet;
use std::slice::Iter;
use super::Mesh;
use crate::math::Mat4;
use crate::pipeline::Descriptor;
use crate::pipeline::Material;
use crate::resources::Handle;
pub struct Model {
pub nodes: Vec<ModelNode>,
}
#[derive(Clone)]
pub struct ModelNode {
pub meshes: Vec<Handle<Mesh>>,
pub materials: Vec<Handle<Material>>,
pub matrix: Mat4,
pub children: Vec<Self>,
}
struct ChildIter<'a> {
stack: Vec<Iter<'a, ModelNode>>,
}
impl Model {
pub fn fix_color_space(&mut self) {
let mut fixed = HashSet::new();
self.nodes
.iter_mut()
.for_each(|n| n.fix_color_space(&mut fixed));
}
pub fn meshes(&self) -> impl Iterator<Item = &Handle<Mesh>> {
self.nodes.iter().map(|node| node.meshes()).flatten()
}
pub fn materials(&self) -> impl Iterator<Item = &Handle<Material>> {
self.nodes.iter().map(|node| node.materials()).flatten()
}
}
impl ModelNode {
pub(crate) fn orders(&self) -> impl Iterator<Item = (&Handle<Mesh>, &Handle<Material>)> {
self.meshes.iter().zip(self.materials.iter())
}
fn fix_color_space(&mut self, fixed: &mut HashSet<Descriptor>) {
for mat in &mut self.materials {
let mut m = mat.write();
if !fixed.contains(&m.descriptor()) {
m.a[0] = to_linear(m.a[0]);
m.a[1] = to_linear(m.a[1]);
m.a[2] = to_linear(m.a[2]);
fixed.insert(m.descriptor());
}
}
self.children
.iter_mut()
.for_each(|c| c.fix_color_space(fixed));
}
fn meshes(&self) -> impl Iterator<Item = &Handle<Mesh>> {
self.meshes
.iter()
.chain(self.child_iter().map(|node| node.meshes.iter()).flatten())
}
fn materials(&self) -> impl Iterator<Item = &Handle<Material>> {
self.materials.iter().chain(
self.child_iter()
.map(|node| node.materials.iter())
.flatten(),
)
}
fn child_iter(&self) -> ChildIter<'_> {
ChildIter {
stack: vec![self.children.iter()],
}
}
}
impl<'a> Iterator for ChildIter<'a> {
type Item = &'a ModelNode;
fn next(&mut self) -> Option<Self::Item> {
loop {
if let Some(mut top_iter) = self.stack.pop() {
if let Some(node) = top_iter.next() {
self.stack.push(top_iter);
self.stack.push(node.children.iter());
return Some(&node);
}
} else {
return None;
}
}
}
}
fn to_linear(value: f32) -> f32 {
let s = clamp(value, 0.0, 1.0);
let cutoff = 0.04045;
let gamma = 2.2;
if s <= cutoff {
s / 12.92
} else {
((s + 0.055) / 1.055).powf(gamma)
}
}
fn clamp(value: f32, min: f32, max: f32) -> f32 {
if value < min {
min
} else if value > max {
max
} else {
value
}
}
|
use std::collections::HashSet;
use std::slice::Iter;
use super::Mesh;
use crate::math::Mat4;
use crate::pipeline::Descriptor;
use crate::pipeline::Material;
use crate::resources::Handle;
pub struct Model {
pub nodes: Vec<ModelNode>,
}
#[derive(Clone)]
pub struct ModelNode {
pub meshes: Vec<Handle<Mesh>>,
pub materials: Vec<Handle<Material>>,
pub matrix: Mat4,
pub children: Vec<Self>,
}
struct ChildIter<'a> {
stack: Vec<Iter<'a, ModelNode>>,
}
impl Model {
|
pub fn meshes(&self) -> impl Iterator<Item = &Handle<Mesh>> {
self.nodes.iter().map(|node| node.meshes()).flatten()
}
pub fn materials(&self) -> impl Iterator<Item = &Handle<Material>> {
self.nodes.iter().map(|node| node.materials()).flatten()
}
}
impl ModelNode {
pub(crate) fn orders(&self) -> impl Iterator<Item = (&Handle<Mesh>, &Handle<Material>)> {
self.meshes.iter().zip(self.materials.iter())
}
fn fix_color_space(&mut self, fixed: &mut HashSet<Descriptor>) {
for mat in &mut self.materials {
let mut m = mat.write();
if !fixed.contains(&m.descriptor()) {
m.a[0] = to_linear(m.a[0]);
m.a[1] = to_linear(m.a[1]);
m.a[2] = to_linear(m.a[2]);
fixed.insert(m.descriptor());
}
}
self.children
.iter_mut()
.for_each(|c| c.fix_color_space(fixed));
}
fn meshes(&self) -> impl Iterator<Item = &Handle<Mesh>> {
self.meshes
.iter()
.chain(self.child_iter().map(|node| node.meshes.iter()).flatten())
}
fn materials(&self) -> impl Iterator<Item = &Handle<Material>> {
self.materials.iter().chain(
self.child_iter()
.map(|node| node.materials.iter())
.flatten(),
)
}
fn child_iter(&self) -> ChildIter<'_> {
ChildIter {
stack: vec![self.children.iter()],
}
}
}
impl<'a> Iterator for ChildIter<'a> {
type Item = &'a ModelNode;
fn next(&mut self) -> Option<Self::Item> {
loop {
if let Some(mut top_iter) = self.stack.pop() {
if let Some(node) = top_iter.next() {
self.stack.push(top_iter);
self.stack.push(node.children.iter());
return Some(&node);
}
} else {
return None;
}
}
}
}
fn to_linear(value: f32) -> f32 {
let s = clamp(value, 0.0, 1.0);
let cutoff = 0.04045;
let gamma = 2.2;
if s <= cutoff {
s / 12.92
} else {
((s + 0.055) / 1.055).powf(gamma)
}
}
fn clamp(value: f32, min: f32, max: f32) -> f32 {
if value < min {
min
} else if value > max {
max
} else {
value
}
}
| pub fn fix_color_space(&mut self) {
let mut fixed = HashSet::new();
self.nodes
.iter_mut()
.for_each(|n| n.fix_color_space(&mut fixed));
} | function_block-full_function | [
{
"content": "struct Cache {\n\n shader: Option<Handle<Shader>>,\n\n material: Option<Handle<Material>>,\n\n font: Option<Handle<Font>>,\n\n\n\n // colors\n\n background: Rgb,\n\n fill: Rgb,\n\n stroke: Rgb,\n\n tint: Rgb,\n\n\n\n // shadows\n\n shadows: bool,\n\n\n\n // other\n... |
Rust | src/socket.rs | caizixian/streamdeck-rs | 3848d18fa4bf48b95ccb77c6cf689d422145509e | use super::{Message, MessageOut};
use failure::Fail;
use futures::prelude::*;
use serde::{de, ser};
use serde_derive::Serialize;
use std::marker::PhantomData;
use std::pin::Pin;
use std::task::{Context, Poll};
use tokio::net::TcpStream;
use tokio_tungstenite::{self, WebSocketStream, MaybeTlsStream};
use url::Url;
pub struct StreamDeckSocket<G, S, MI, MO> {
inner: WebSocketStream<MaybeTlsStream<TcpStream>>,
_g: PhantomData<G>,
_s: PhantomData<S>,
_mi: PhantomData<MI>,
_mo: PhantomData<MO>,
}
impl<G, S, MI, MO> StreamDeckSocket<G, S, MI, MO> {
pub async fn connect<A: Into<Address>>(
address: A,
event: String,
uuid: String,
) -> Result<Self, ConnectError> {
let address = address.into();
let (mut stream, _) = tokio_tungstenite::connect_async(address.url)
.await
.map_err(ConnectError::ConnectionError)?;
let message = serde_json::to_string(&Registration {
event: &event,
uuid: &uuid,
})
.unwrap();
stream
.send(tungstenite::Message::Text(message))
.await
.map_err(ConnectError::SendError)?;
Ok(StreamDeckSocket {
inner: stream,
_g: PhantomData,
_s: PhantomData,
_mi: PhantomData,
_mo: PhantomData,
})
}
fn pin_get_inner(self: Pin<&mut Self>) -> Pin<&mut WebSocketStream<MaybeTlsStream<TcpStream>>> {
unsafe { self.map_unchecked_mut(|s| &mut s.inner) }
}
}
#[derive(Debug, Fail)]
pub enum StreamDeckSocketError {
#[fail(display = "WebSocket error")]
WebSocketError(#[fail(cause)] tungstenite::error::Error),
#[fail(display = "Bad message")]
BadMessage(#[fail(cause)] serde_json::Error),
}
impl<G, S, MI, MO> Stream for StreamDeckSocket<G, S, MI, MO>
where
G: de::DeserializeOwned,
S: de::DeserializeOwned,
MI: de::DeserializeOwned,
{
type Item = Result<Message<G, S, MI>, StreamDeckSocketError>;
fn poll_next(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {
let mut inner = self.pin_get_inner();
loop {
match inner.as_mut().poll_next(cx) {
Poll::Ready(Some(Ok(tungstenite::Message::Text(message)))) => {
break match serde_json::from_str(&message) {
Ok(message) => Poll::Ready(Some(Ok(message))),
Err(error) => {
Poll::Ready(Some(Err(StreamDeckSocketError::BadMessage(error))))
}
};
}
Poll::Ready(Some(Ok(_))) => {}
Poll::Ready(Some(Err(error))) => {
break Poll::Ready(Some(Err(StreamDeckSocketError::WebSocketError(error))))
}
Poll::Ready(None) => break Poll::Ready(None),
Poll::Pending => break Poll::Pending,
}
}
}
}
impl<G, S, MI, MO> Sink<MessageOut<G, S, MO>> for StreamDeckSocket<G, S, MI, MO>
where
G: ser::Serialize,
S: ser::Serialize,
MO: ser::Serialize,
{
type Error = StreamDeckSocketError;
fn poll_ready(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<(), Self::Error>> {
self.pin_get_inner()
.poll_ready(cx)
.map_err(StreamDeckSocketError::WebSocketError)
}
fn start_send(self: Pin<&mut Self>, item: MessageOut<G, S, MO>) -> Result<(), Self::Error> {
let message = serde_json::to_string(&item).map_err(StreamDeckSocketError::BadMessage)?;
self.pin_get_inner()
.start_send(tungstenite::Message::Text(message))
.map_err(StreamDeckSocketError::WebSocketError)
}
fn poll_flush(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<(), Self::Error>> {
self.pin_get_inner()
.poll_flush(cx)
.map_err(StreamDeckSocketError::WebSocketError)
}
fn poll_close(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<(), Self::Error>> {
self.pin_get_inner()
.poll_close(cx)
.map_err(StreamDeckSocketError::WebSocketError)
}
}
pub struct Address {
pub url: Url,
}
impl From<Url> for Address {
fn from(value: Url) -> Self {
Address { url: value }
}
}
impl From<u16> for Address {
fn from(value: u16) -> Self {
let mut url = Url::parse("ws://localhost").unwrap();
url.set_port(Some(value)).unwrap();
Address { url }
}
}
#[derive(Debug, Fail)]
pub enum ConnectError {
#[fail(display = "Websocket connection error")]
ConnectionError(#[fail(cause)] tungstenite::error::Error),
#[fail(display = "Send error")]
SendError(#[fail(cause)] tungstenite::error::Error),
}
#[derive(Serialize)]
struct Registration<'a> {
event: &'a str,
uuid: &'a str,
}
| use super::{Message, MessageOut};
use failure::Fail;
use futures::prelude::*;
use serde::{de, ser};
use serde_derive::Serialize;
use std::marker::PhantomData;
use std::pin::Pin;
use std::task::{Context, Poll};
use tokio::net::TcpStream;
use tokio_tungstenite::{self, WebSocketStream, MaybeTlsStream};
use url::Url;
pub struct StreamDeckSocket<G, S, MI, MO> {
inner: WebSocketStream<MaybeTlsStream<TcpStream>>,
_g: PhantomData<G>,
_s: PhantomData<S>,
_mi: PhantomData<MI>,
_mo: PhantomData<MO>,
}
impl<G, S, MI, MO> StreamDeckSocket<G, S, MI, MO> {
pub async fn connect<A: Into<Address>>(
address: A,
event: String,
uuid: String,
) -> Result<Self, ConnectError> {
let address = address.into();
let (mut stream, _) = tokio_tungstenite::connect_async(address.url)
.await
.map_err(ConnectError::ConnectionError)?;
let message = serde_json::to_string(&Registration {
event: &event,
uuid: &uuid,
})
.unwrap();
stream
.send(tungstenite::Message::Text(message))
.await
.map_err(ConnectError::SendError)?;
Ok(StreamDeckSocket {
inner: stream,
_g: PhantomData,
_s: PhantomData,
_mi: PhantomData,
_mo: PhantomData,
})
}
fn pin_get_inner(self: Pin<&mut Self>) -> Pin<&mut WebSocketStream<MaybeTlsStream<TcpStream>>> {
unsafe { self.map_unchecked_mut(|s| &mut s.inner) }
}
}
#[derive(Debug, Fail)]
pub enum StreamDeckSocketError {
#[fail(display = "WebSocket error")]
WebSocketError(#[fail(cause)] tungstenite::error::Error),
#[fail(display = "Bad message")]
BadMessage(#[fail(cause)] serde_json::Error),
}
impl<G, S, MI, MO> Stream for StreamDeckSocket<G, S, MI, MO>
where
G: de::DeserializeOwned,
S: de::DeserializeOwned,
MI: de::DeserializeOwned,
{
type Item = Result<Message<G, S, MI>, StreamDeckSocketError>;
fn poll_next(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>> {
let mut inner = self.pin_get_inner();
loop {
match inner.as_mut().poll_next(cx) {
Poll::Ready(Some(Ok(tungstenite::Message::Text(message)))) => {
break match serde_json::from_str(&message) {
Ok(message) => Poll::Ready(Some(Ok(message))),
Err(error) => {
Poll::Ready(Some(Err(StreamDeckSocketError::BadMessage(error))))
}
};
}
Poll::Ready(Some(Ok(_))) => {}
Poll::Ready(Some(Err | }
Poll::Ready(None) => break Poll::Ready(None),
Poll::Pending => break Poll::Pending,
}
}
}
}
impl<G, S, MI, MO> Sink<MessageOut<G, S, MO>> for StreamDeckSocket<G, S, MI, MO>
where
G: ser::Serialize,
S: ser::Serialize,
MO: ser::Serialize,
{
type Error = StreamDeckSocketError;
fn poll_ready(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<(), Self::Error>> {
self.pin_get_inner()
.poll_ready(cx)
.map_err(StreamDeckSocketError::WebSocketError)
}
fn start_send(self: Pin<&mut Self>, item: MessageOut<G, S, MO>) -> Result<(), Self::Error> {
let message = serde_json::to_string(&item).map_err(StreamDeckSocketError::BadMessage)?;
self.pin_get_inner()
.start_send(tungstenite::Message::Text(message))
.map_err(StreamDeckSocketError::WebSocketError)
}
fn poll_flush(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<(), Self::Error>> {
self.pin_get_inner()
.poll_flush(cx)
.map_err(StreamDeckSocketError::WebSocketError)
}
fn poll_close(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Result<(), Self::Error>> {
self.pin_get_inner()
.poll_close(cx)
.map_err(StreamDeckSocketError::WebSocketError)
}
}
pub struct Address {
pub url: Url,
}
impl From<Url> for Address {
fn from(value: Url) -> Self {
Address { url: value }
}
}
impl From<u16> for Address {
fn from(value: u16) -> Self {
let mut url = Url::parse("ws://localhost").unwrap();
url.set_port(Some(value)).unwrap();
Address { url }
}
}
#[derive(Debug, Fail)]
pub enum ConnectError {
#[fail(display = "Websocket connection error")]
ConnectionError(#[fail(cause)] tungstenite::error::Error),
#[fail(display = "Send error")]
SendError(#[fail(cause)] tungstenite::error::Error),
}
#[derive(Serialize)]
struct Registration<'a> {
event: &'a str,
uuid: &'a str,
}
| (error))) => {
break Poll::Ready(Some(Err(StreamDeckSocketError::WebSocketError(error))))
| function_block-random_span | [
{
"content": "struct Serializer {\n\n stack: Vec<String>,\n\n}\n\n\n\nimpl slog::Serializer for Serializer {\n\n fn emit_none(&mut self, key: Key) -> slog::Result {\n\n self.stack.push(format!(\"{}: None\", key));\n\n Ok(())\n\n }\n\n fn emit_unit(&mut self, key: Key) -> slog::Result {... |
Rust | src/commands/install.rs | RyosukeNAKATA/mamimi | 347583f657f0f8a4df2d91df86e05d6113251f44 | use crate::alias::create_alias;
use crate::archive::{self, extract::Error as ExtractError, extract::Extract};
use crate::config::MamimiConfig;
use crate::current_python_version::current_python_version;
use crate::input_version::InputVersion;
use crate::outln;
use crate::python_version::PythonVersion;
use crate::version_files::get_user_version_for_directory;
use anyhow::Result;
use colored::Colorize;
use dirs::config_dir;
use log::debug;
use num_cpus;
use reqwest::Url;
use std::env::current_dir;
use std::error;
use std::io::prelude::*;
use std::path::{Path, PathBuf};
use tempfile;
use thiserror::Error;
#[derive(Error, Debug)]
pub enum MamimiError {
#[error(transparent)]
HttpError(#[from] reqwest::Error),
#[error(transparent)]
IoError(#[from] std::io::Error),
#[error("Can't find the number of cores")]
FromUtf8Error(#[from] std::string::FromUtf8Error),
#[error("Can't extract the file: {source:?}")]
ExtractError { source: ExtractError },
#[error("The downloaded archive is empty")]
TarIsEmpty,
#[error("Can't find version")]
VersionNotFound { version: InputVersion },
#[error("Can't list the remote versions: {source:?}")]
CannotListRemoteVersions { source: reqwest::Error },
#[error("Version already installed at {path:?}")]
VersionAlreadyInstalled { path: PathBuf },
#[error(
"Cannnot find the version in dotfiles. Please provide a version manually to the command."
)]
CannotInferVersion,
#[error("The requested version is not installable: {version}")]
NotInstallableVerison { version: PythonVersion },
#[error("Cannot build Python: {stderr}")]
CannotBuildPython { stderr: String },
}
#[derive(clap::Parser, Debug, Default)]
pub struct Install {
pub version: Option<InputVersion>,
pub configure_opts: Vec<String>,
}
impl super::command::Command for Install {
type Error = MamimiError;
fn apply(&self, config: &MamimiConfig) -> Result<(), Self::Error> {
let current_version = self
.version
.clone()
.or_else(|| get_user_version_for_directory(std::env::current_dir().unwrap()))
.ok_or(MamimiError::CannotInferVersion)?;
let version = match current_version.clone() {
InputVersion::Full(PythonVersion::Semver(v)) => PythonVersion::Semver(v),
InputVersion::Full(PythonVersion::System) => {
return Err(MamimiError::NotInstallableVerison {
version: PythonVersion::System,
})
}
current_version => {
let avalable_versions = crate::remote_python_index::list()
.map_err(|source| MamimiError::CannotListRemoteVersions { source })?
.drain(..)
.map(|x| x.python_version)
.collect::<Vec<_>>();
current_version
.to_version(&avalable_versions)
.ok_or(MamimiError::VersionNotFound {
version: current_version,
})?
.clone()
}
};
let installations_dir = config.python_versions_dir();
let installation_dir = PathBuf::from(&installations_dir).join(version.to_string());
if installation_dir.exists() {
return Err(MamimiError::VersionAlreadyInstalled {
path: installation_dir,
});
}
let url = package_url(&version);
outln!(
config,
Error,
"{} Downloading {}",
"==>".green(),
format!("{}", url).green()
);
let response = reqwest::blocking::get(url)?;
if response.status() == 404 {
return Err(MamimiError::VersionNotFound {
version: current_version,
});
}
outln!(
config,
Error,
"{} Extracting {}",
"==>".green(),
format!("{}", url).green()
);
let tmp_installations_dir = installations_dir.join(".downloads");
std::fs::create_dir_all(&tmp_installations_dir).map_err(MamimiError::IoError)?;
let tmp_dir = tempfile::TempDir::new_in(&tmp_installations_dir)
.expect("Cannot generate a temp directory");
extract_archive_into(&tmp_dir, response)?;
outln!(
config,
Error,
"{} Building {}",
"==>".green(),
format!("Python {}", current_version).green()
);
let installed_directory = std::fs::read_dir(&tmp_dir)
.map_err(MamimiError::IoError)?
.next()
.ok_or(MamimiError::TarIsEmpty)?
.map_err(MamimiError::IoError)?;
let installed_directory = installed_directory.path();
build_package(
&installed_directory,
&installation_dir,
&self.configure_opts,
)?;
if !config.default_python_version_dir().exists() {
debug!("Use {} as the default Python version", current_version);
create_alias(&config, "default", &version).map_err(MamimiError::IoError)?;
}
Ok(())
}
}
fn extract_archive_into<P: AsRef<Path>>(
path: P,
response: reqwest::blocking::Response,
) -> Result<(), MamimiError> {
#[cfg(unix)]
let extractor = archive::tar_xz::TarXz::new(response);
#[cfg(windows)]
let extractor = archive::tar_xz::TarXz::new(response);
extractor
.extract_into(path)
.map_err(|source| MamimiError::ExtractError { source })?;
Ok(())
}
fn package_url(version: &PythonVersion) -> Url {
debug!("package url");
Url::parse(&format!(
"https://www.python.org/ftp/python/{}/Python-{}.tar.xz",
version, version
))
.unwrap()
}
#[cfg(unix)]
fn archive(version: &PythonVersion) -> String {
format!("python-{}.tar.xz", version)
}
#[cfg(windows)]
fn archive(version: &PythonVersion) -> String {
format!("python-{}.zip", version)
}
#[allow(clippy::unnecessary_wraps)]
fn openssl_dir() -> Result<String, MamimiError> {
#[cfg(target_os = "macos")]
return Ok(String::from_utf8_lossy(
&super::command::Command::new("brew")
.arg("--prefix")
.arg("openssl@1.1")
.output()
.map_err(MamimiError::IoError)?
.stdout,
)
.trim()
.to_string());
#[cfg(not(target_os = "macos"))]
return Ok("/url/local".to_string());
}
fn build_package(
current_dir: &Path,
installed_dir: &Path,
configure_opts: &[String],
) -> Result<(), MamimiError> {
debug!("./configure {}", configure_opts.join(" "));
let mut command = super::command::Command::new("sh");
command
.arg("configure")
.arg(format!("--prefix={}", installed_dir.to_str().unwrap()))
.args(configure_opts);
if !configure_opts
.iter()
.any(|opt| opt.starts_with("--with-openssl-dir"))
{
command.arg(format!("--with-openssl-dir={}", openssl_dir()?));
}
let configure = command
.current_dir(¤t_dir)
.output()
.map_err(MamimiError::IoError)?;
if !configure.status.success() {
return Err(MamimiError::CannotBuildPython {
stderr: format!(
"configure failed: {}",
String::from_utf8_lossy(&configure.stderr).to_string()
),
});
};
debug!("make -j {}", num_cpus::get().to_string());
let make = super::command::Command::new("make")
.arg("-j")
.arg(num_cpus::get().to_string())
.current_dir(¤t_dir)
.output()
.map_err(MamimiError::IoError)?;
if !make.status.success() {
return Err(MamimiError::CannotBuildPython {
stderr: format!(
"make failed: {}",
String::from_utf8_lossy(&make.stderr).to_string()
),
});
};
Ok(())
}
#[cfg(test)]
mod tests {
use super::*;
use crate::commands::command::Command;
use crate::config::MamimiConfig;
use crate::python_version::PythonVersion;
use itertools::Itertools;
use tempfile::tempdir;
#[test]
fn test_install_second_version() {
let config = MamimiConfig {
base_dir: Some(tempdir().unwrap().path().to_path_buf()),
..Default::default()
};
Install {
version: Some(InputVersion::Full(PythonVersion::Semver("3.8.7").unwrap())),
configure_opts: vec![],
}
.apply(&config)
.expect("Can't install Python3.8.7");
assert_eq!(
std::fs::read_link(&config.default_python_version_dir())
.unwrap()
.components()
.last(),
Some(std::path::Component::Normal(std::ffi::OsStr::new("3.9.6")))
);
}
#[test]
fn test_install_default_python_version() {
let config = MamimiConfig {
base_dir: Some(tempdir().unwrap().path().to_path_buf()),
..Default::default()
};
Install {
version: Some(InputVersion::Full(PythonVersion::Semver(
semver::Version::parse("3.8.7").unwrap(),
))),
configure_opts: vec![],
}
.apply(&config)
.expect("Can't insatll");
assert!(config.installations_dir().join("3.8.7").exists());
assert!(config
.installations_dir()
.join("3.8.7")
.join("bin")
.join("python3")
.exists());
assert!(config.default_python_version_dir().exists());
}
}
| use crate::alias::create_alias;
use crate::archive::{self, extract::Error as ExtractError, extract::Extract};
use crate::config::MamimiConfig;
use crate::current_python_version::current_python_version;
use crate::input_version::InputVersion;
use crate::outln;
use crate::python_version::PythonVersion;
use crate::version_files::get_user_version_for_directory;
use anyhow::Result;
use colored::Colorize;
use dirs::config_dir;
use log::debug;
use num_cpus;
use reqwest::Url;
use std::env::current_dir;
use std::error;
use std::io::prelude::*;
use std::path::{Path, PathBuf};
use tempfile;
use thiserror::Error;
#[derive(Error, Debug)]
pub enum MamimiError {
#[error(transparent)]
HttpError(#[from] reqwest::Error),
#[error(transparent)]
IoError(#[from] std::io::Error),
#[error("Can't find the number of cores")]
FromUtf8Error(#[from] std::string::FromUtf8Error),
#[error("Can't extract the file: {source:?}")]
ExtractError { source: ExtractError },
#[error("The downloaded archive is empty")]
TarIsEmpty,
#[error("Can't find version")]
VersionNotFound { version: InputVersion },
#[error("Can't list the remote versions: {source:?}")]
CannotListRemoteVersions { source: reqwest::Error },
#[error("Version already installed at {path:?}")]
VersionAlreadyInstalled { path: PathBuf },
#[error(
"Cannnot find the version in dotfiles. Please provide a version manually to the command."
)]
CannotInferVersion,
#[error("The requested version is not installable: {version}")]
NotInstallableVerison { version: PythonVersion },
#[error("Cannot build Python: {stderr}")]
CannotBuildPython { stderr: String },
}
#[derive(clap::Parser, Debug, Default)]
pub struct Install {
pub version: Option<InputVersion>,
pub configure_opts: Vec<String>,
}
impl super::command::Command for Install {
type Error = MamimiError;
fn apply(&self, config: &MamimiConfig) -> Result<(), Self::Error> {
let current_version = self
.version
.clone()
.or_else(|| get_user_version_for_directory(std::env::current_dir().unwrap()))
.ok_or(MamimiError::CannotInferVersion)?;
let version = match current_version.clone() {
InputVersion::Full(PythonVersion::Semver(v)) => PythonVersion::Semver(v),
InputVersion::Full(PythonVersion::System) => {
return Err(MamimiError::NotInstallableVerison {
version: PythonVersion::System,
})
}
current_version => {
let avalable_versions = crate::remote_python_index::list()
.map_err(|source| MamimiError::CannotListRemoteVersions { source })?
.drain(..)
.map(|x| x.python_version)
.collect::<Vec<_>>();
current_version
.to_version(&avalable_versions)
| .expect("Cannot generate a temp directory");
extract_archive_into(&tmp_dir, response)?;
outln!(
config,
Error,
"{} Building {}",
"==>".green(),
format!("Python {}", current_version).green()
);
let installed_directory = std::fs::read_dir(&tmp_dir)
.map_err(MamimiError::IoError)?
.next()
.ok_or(MamimiError::TarIsEmpty)?
.map_err(MamimiError::IoError)?;
let installed_directory = installed_directory.path();
build_package(
&installed_directory,
&installation_dir,
&self.configure_opts,
)?;
if !config.default_python_version_dir().exists() {
debug!("Use {} as the default Python version", current_version);
create_alias(&config, "default", &version).map_err(MamimiError::IoError)?;
}
Ok(())
}
}
fn extract_archive_into<P: AsRef<Path>>(
path: P,
response: reqwest::blocking::Response,
) -> Result<(), MamimiError> {
#[cfg(unix)]
let extractor = archive::tar_xz::TarXz::new(response);
#[cfg(windows)]
let extractor = archive::tar_xz::TarXz::new(response);
extractor
.extract_into(path)
.map_err(|source| MamimiError::ExtractError { source })?;
Ok(())
}
fn package_url(version: &PythonVersion) -> Url {
debug!("package url");
Url::parse(&format!(
"https://www.python.org/ftp/python/{}/Python-{}.tar.xz",
version, version
))
.unwrap()
}
#[cfg(unix)]
fn archive(version: &PythonVersion) -> String {
format!("python-{}.tar.xz", version)
}
#[cfg(windows)]
fn archive(version: &PythonVersion) -> String {
format!("python-{}.zip", version)
}
#[allow(clippy::unnecessary_wraps)]
fn openssl_dir() -> Result<String, MamimiError> {
#[cfg(target_os = "macos")]
return Ok(String::from_utf8_lossy(
&super::command::Command::new("brew")
.arg("--prefix")
.arg("openssl@1.1")
.output()
.map_err(MamimiError::IoError)?
.stdout,
)
.trim()
.to_string());
#[cfg(not(target_os = "macos"))]
return Ok("/url/local".to_string());
}
fn build_package(
current_dir: &Path,
installed_dir: &Path,
configure_opts: &[String],
) -> Result<(), MamimiError> {
debug!("./configure {}", configure_opts.join(" "));
let mut command = super::command::Command::new("sh");
command
.arg("configure")
.arg(format!("--prefix={}", installed_dir.to_str().unwrap()))
.args(configure_opts);
if !configure_opts
.iter()
.any(|opt| opt.starts_with("--with-openssl-dir"))
{
command.arg(format!("--with-openssl-dir={}", openssl_dir()?));
}
let configure = command
.current_dir(¤t_dir)
.output()
.map_err(MamimiError::IoError)?;
if !configure.status.success() {
return Err(MamimiError::CannotBuildPython {
stderr: format!(
"configure failed: {}",
String::from_utf8_lossy(&configure.stderr).to_string()
),
});
};
debug!("make -j {}", num_cpus::get().to_string());
let make = super::command::Command::new("make")
.arg("-j")
.arg(num_cpus::get().to_string())
.current_dir(¤t_dir)
.output()
.map_err(MamimiError::IoError)?;
if !make.status.success() {
return Err(MamimiError::CannotBuildPython {
stderr: format!(
"make failed: {}",
String::from_utf8_lossy(&make.stderr).to_string()
),
});
};
Ok(())
}
#[cfg(test)]
mod tests {
use super::*;
use crate::commands::command::Command;
use crate::config::MamimiConfig;
use crate::python_version::PythonVersion;
use itertools::Itertools;
use tempfile::tempdir;
#[test]
fn test_install_second_version() {
let config = MamimiConfig {
base_dir: Some(tempdir().unwrap().path().to_path_buf()),
..Default::default()
};
Install {
version: Some(InputVersion::Full(PythonVersion::Semver("3.8.7").unwrap())),
configure_opts: vec![],
}
.apply(&config)
.expect("Can't install Python3.8.7");
assert_eq!(
std::fs::read_link(&config.default_python_version_dir())
.unwrap()
.components()
.last(),
Some(std::path::Component::Normal(std::ffi::OsStr::new("3.9.6")))
);
}
#[test]
fn test_install_default_python_version() {
let config = MamimiConfig {
base_dir: Some(tempdir().unwrap().path().to_path_buf()),
..Default::default()
};
Install {
version: Some(InputVersion::Full(PythonVersion::Semver(
semver::Version::parse("3.8.7").unwrap(),
))),
configure_opts: vec![],
}
.apply(&config)
.expect("Can't insatll");
assert!(config.installations_dir().join("3.8.7").exists());
assert!(config
.installations_dir()
.join("3.8.7")
.join("bin")
.join("python3")
.exists());
assert!(config.default_python_version_dir().exists());
}
}
| .ok_or(MamimiError::VersionNotFound {
version: current_version,
})?
.clone()
}
};
let installations_dir = config.python_versions_dir();
let installation_dir = PathBuf::from(&installations_dir).join(version.to_string());
if installation_dir.exists() {
return Err(MamimiError::VersionAlreadyInstalled {
path: installation_dir,
});
}
let url = package_url(&version);
outln!(
config,
Error,
"{} Downloading {}",
"==>".green(),
format!("{}", url).green()
);
let response = reqwest::blocking::get(url)?;
if response.status() == 404 {
return Err(MamimiError::VersionNotFound {
version: current_version,
});
}
outln!(
config,
Error,
"{} Extracting {}",
"==>".green(),
format!("{}", url).green()
);
let tmp_installations_dir = installations_dir.join(".downloads");
std::fs::create_dir_all(&tmp_installations_dir).map_err(MamimiError::IoError)?;
let tmp_dir = tempfile::TempDir::new_in(&tmp_installations_dir)
| random | [
{
"content": "pub fn current_python_version(config: &MamimiConfig) -> Result<Option<PythonVersion>, Error> {\n\n let multishell_path = config.multishell_path().ok_or(Error::EnvNotApplied)?;\n\n\n\n if multishell_path.read_link().ok() == Some(system_version::path()) {\n\n return Ok(Some(PythonVersio... |
Rust | src/tests/live_mocker.rs | w3f/polkadot-registrar-bot | 3c5aa36cf5de8edae0ac434947eb585b7ca92c75 | use crate::adapters::tests::MessageInjector;
use crate::adapters::AdapterListener;
use crate::database::Database;
use crate::primitives::{
ExpectedMessage, ExternalMessage, ExternalMessageType, JudgementState, MessageId, Timestamp,
};
use crate::tests::F;
use crate::{config_session_notifier, DatabaseConfig, DisplayNameConfig, NotifierConfig, Result};
use rand::{thread_rng, Rng};
use tokio::time::{sleep, Duration};
#[actix::test]
#[ignore]
async fn run_mocker() -> Result<()> {
tracing_subscriber::fmt()
.with_max_level(tracing::Level::DEBUG)
.with_env_filter("system")
.init();
let mut rng = thread_rng();
let db_config = DatabaseConfig {
uri: "mongodb://localhost:27017".to_string(),
name: format!("registrar_test_{}", rng.gen_range(u32::MIN..u32::MAX)),
};
let notifier_config = NotifierConfig {
api_address: "localhost:8888".to_string(),
display_name: DisplayNameConfig {
enabled: true,
limit: 0.85,
},
};
info!("Starting mock adapter and session notifier instances");
let db = Database::new(&db_config.uri, &db_config.name).await?;
config_session_notifier(db.clone(), notifier_config).await?;
let injector = MessageInjector::new();
let listener = AdapterListener::new(db.clone()).await;
listener.start_message_adapter(injector.clone(), 1).await;
info!("Mocker setup completed");
let mut alice = JudgementState::alice();
*alice
.get_field_mut(&F::ALICE_DISPLAY_NAME())
.expected_display_name_check_mut()
.0 = true;
info!("INSERTING IDENTITY: Alice (1a2YiGNu1UUhJtihq8961c7FZtWGQuWDVMWTNBKJdmpGhZP)");
db.add_judgement_request(&alice).await.unwrap();
let mut rng = thread_rng();
loop {
let ty_msg: u32 = rng.gen_range(0..2);
let ty_validity = rng.gen_range(0..1);
let reset = rng.gen_range(0..5);
if reset == 0 {
warn!("Resetting Identity");
db.delete_judgement(&alice.context).await.unwrap();
alice = JudgementState::alice();
*alice
.get_field_mut(&F::ALICE_DISPLAY_NAME())
.expected_display_name_check_mut()
.0 = true;
db.add_judgement_request(&alice).await.unwrap();
}
let (origin, values) = match ty_msg {
0 => {
(ExternalMessageType::Email("alice@email.com".to_string()), {
match ty_validity {
0 => alice
.get_field(&F::ALICE_EMAIL())
.expected_message()
.to_message_parts(),
1 => ExpectedMessage::random().to_message_parts(),
_ => panic!(),
}
})
}
1 => {
(ExternalMessageType::Twitter("@alice".to_string()), {
match ty_validity {
0 => alice
.get_field(&F::ALICE_TWITTER())
.expected_message()
.to_message_parts(),
1 => ExpectedMessage::random().to_message_parts(),
_ => panic!(),
}
})
}
2 => {
(
ExternalMessageType::Matrix("@alice:matrix.org".to_string()),
{
match ty_validity {
0 => alice
.get_field(&F::ALICE_MATRIX())
.expected_message()
.to_message_parts(),
1 => ExpectedMessage::random().to_message_parts(),
_ => panic!(),
}
},
)
}
_ => panic!(),
};
injector
.send(ExternalMessage {
origin,
id: MessageId::from(0u32),
timestamp: Timestamp::now(),
values,
})
.await;
sleep(Duration::from_secs(2)).await;
}
}
| use crate::adapters::tests::MessageInjector;
use crate::adapters::AdapterListener;
use crate::database::Database;
use crate::primitives::{
ExpectedMessage, ExternalMessage, ExternalMessageType, JudgementState, MessageId, Timestamp,
};
use crate::tests::F;
use crate::{config_session_notifier, DatabaseConfig, DisplayNameConfig, NotifierConfig, Result};
use rand::{thread_rng, Rng};
use tokio::time::{sleep, Duration};
#[actix::test]
#[ignore]
async fn run_mocker() -> Result<()> {
tracing_subscriber::fmt()
.with_max_level(tracing::Level::DEBUG)
.with_env_filter("system")
.init();
let mut rng = thread_rng();
let db_config = DatabaseConfig {
uri: "mongodb://localhost:27017".to_string(),
name: format!("registra | r_test_{}", rng.gen_range(u32::MIN..u32::MAX)),
};
let notifier_config = NotifierConfig {
api_address: "localhost:8888".to_string(),
display_name: DisplayNameConfig {
enabled: true,
limit: 0.85,
},
};
info!("Starting mock adapter and session notifier instances");
let db = Database::new(&db_config.uri, &db_config.name).await?;
config_session_notifier(db.clone(), notifier_config).await?;
let injector = MessageInjector::new();
let listener = AdapterListener::new(db.clone()).await;
listener.start_message_adapter(injector.clone(), 1).await;
info!("Mocker setup completed");
let mut alice = JudgementState::alice();
*alice
.get_field_mut(&F::ALICE_DISPLAY_NAME())
.expected_display_name_check_mut()
.0 = true;
info!("INSERTING IDENTITY: Alice (1a2YiGNu1UUhJtihq8961c7FZtWGQuWDVMWTNBKJdmpGhZP)");
db.add_judgement_request(&alice).await.unwrap();
let mut rng = thread_rng();
loop {
let ty_msg: u32 = rng.gen_range(0..2);
let ty_validity = rng.gen_range(0..1);
let reset = rng.gen_range(0..5);
if reset == 0 {
warn!("Resetting Identity");
db.delete_judgement(&alice.context).await.unwrap();
alice = JudgementState::alice();
*alice
.get_field_mut(&F::ALICE_DISPLAY_NAME())
.expected_display_name_check_mut()
.0 = true;
db.add_judgement_request(&alice).await.unwrap();
}
let (origin, values) = match ty_msg {
0 => {
(ExternalMessageType::Email("alice@email.com".to_string()), {
match ty_validity {
0 => alice
.get_field(&F::ALICE_EMAIL())
.expected_message()
.to_message_parts(),
1 => ExpectedMessage::random().to_message_parts(),
_ => panic!(),
}
})
}
1 => {
(ExternalMessageType::Twitter("@alice".to_string()), {
match ty_validity {
0 => alice
.get_field(&F::ALICE_TWITTER())
.expected_message()
.to_message_parts(),
1 => ExpectedMessage::random().to_message_parts(),
_ => panic!(),
}
})
}
2 => {
(
ExternalMessageType::Matrix("@alice:matrix.org".to_string()),
{
match ty_validity {
0 => alice
.get_field(&F::ALICE_MATRIX())
.expected_message()
.to_message_parts(),
1 => ExpectedMessage::random().to_message_parts(),
_ => panic!(),
}
},
)
}
_ => panic!(),
};
injector
.send(ExternalMessage {
origin,
id: MessageId::from(0u32),
timestamp: Timestamp::now(),
values,
})
.await;
sleep(Duration::from_secs(2)).await;
}
} | function_block-function_prefixed | [
{
"content": "fn try_decode_hex(display_name: &mut String) {\n\n if display_name.starts_with(\"0x\") {\n\n // Might be a false positive. Leave it as is if it cannot be decoded.\n\n if let Ok(name) = hex::decode(&display_name[2..]) {\n\n if let Ok(name) = String::from_utf8(name) {\n\n... | |
Rust | signature_benchmark/src/wots_aes.rs | qkniep/PQ-FIDO_sd-MSS | 27c49bcb82d86057ae4b4c7a429fa55671735de0 |
use core::convert::TryInto;
use core::hash::Hasher;
use aes::cipher::{generic_array::GenericArray, BlockEncrypt, NewBlockCipher};
use aes::Aes128;
use getrandom;
use siphasher::sip128::{Hasher128, SipHasher};
pub const W: usize = 256;
pub const X: usize = 1;
pub const N: usize = 128 / 8;
/*/// Message digest length in bytes.
const M: usize = 512 / 8;
/// Length of the base `W` representation of a message of length `M`.
const L1: usize = 128;
/// Length of the base `W` checksum of a base `W` message of length `L1`.
const L2: usize = 3;
/// Number of function chains
const L: usize = L1 + L2;*/
#[derive(Debug, Clone, PartialEq, PartialOrd, Hash, Default)]
pub struct Wots {
pub pk: [u8; N],
sk: Vec<[u8; N]>,
}
#[derive(Debug, Clone, PartialEq, PartialOrd, Hash, Default)]
pub struct WotsSignature {
pub pk: [u8; N],
pub msg_hash: [u8; N],
pub signature: Vec<[u8; N]>,
}
impl Wots {
pub fn new() -> Self {
let seed: [u8; N] = rand_digest().unwrap();
return Self::from_seed(seed);
}
pub fn from_seed(mut seed: [u8; N]) -> Self {
let mut sk = Vec::<[u8; N]>::with_capacity(N * X);
let mut pk = Vec::<[u8; N]>::with_capacity(N * X);
for _ in 0..N * X {
let secret = prng(&mut seed);
sk.push(secret);
let public = chain(&secret, W - 1);
pk.push(public);
}
let mut hasher = SipHasher::new();
for p in &pk {
hasher.write(p);
}
let h = hasher.finish128();
let hash_bytes = h.as_bytes();
return Self { pk: hash_bytes, sk };
}
pub fn sign(&self, input: &str) -> WotsSignature {
let mut hasher = SipHasher::new();
hasher.write(input.as_bytes());
let h = hasher.finish128();
let hash_bytes = h.as_bytes();
let mut signature: Vec<[u8; N]> = Vec::with_capacity(N * X);
let mut sig_cycles: Vec<usize> = Vec::with_capacity(N * X);
for i in 0..N {
let symbols = base_w(hash_bytes[i]);
for s in 0..X {
sig_cycles.push(symbols[s] as usize);
let index = i * X + s;
let sig: [u8; N] = chain(&self.sk[index], sig_cycles[index]);
signature.push(sig);
}
}
return WotsSignature {
pk: self.pk.clone(),
msg_hash: hash_bytes.clone(),
signature,
};
}
}
impl WotsSignature {
pub fn verify(&self) -> bool {
let mut i = 0;
let mut pk = Vec::<[u8; N]>::with_capacity(N * X);
for b in &self.msg_hash {
for s in base_w(*b) {
let cycles = W - 1 - (s as usize);
pk.push(chain(&self.signature[i], cycles));
i += 1;
}
}
let mut hasher = SipHasher::new();
for p in &pk {
hasher.write(p);
}
let h = hasher.finish128();
let hash_bytes = h.as_bytes();
assert_eq!(self.pk, hash_bytes);
return true;
}
}
pub fn chain(input: &[u8; N], c: usize) -> [u8; N] {
let mut output = *GenericArray::from_slice(input);
let iv = GenericArray::from([0u8; N]);
let cipher = Aes128::new(&iv);
for _ in 0..c {
let i = u128::from_be_bytes(output.as_slice().try_into().expect("wrong length"));
cipher.encrypt_block(&mut output);
let o = u128::from_be_bytes(output.as_slice().try_into().expect("wrong length"));
let r = i ^ o;
output = GenericArray::from(r.to_be_bytes());
}
return output.as_slice().try_into().expect("wrong length");
}
pub fn base_w(byte: u8) -> [u8; X] {
let mut b = byte as usize;
let mut symbols = [0u8; X];
for s in 0..X {
symbols[X - 1 - s] = (b % W) as u8;
b /= W;
}
return symbols;
}
fn rand_digest() -> Result<[u8; N], getrandom::Error> {
let mut buf = [0u8; N];
getrandom::getrandom(&mut buf)?;
Ok(buf)
}
pub fn prng(seed: &mut [u8; N]) -> [u8; N] {
let mut output = *GenericArray::from_slice(seed);
let iv = GenericArray::from([0u8; N]);
let cipher = Aes128::new(&iv);
cipher.encrypt_block(&mut output);
let s = u128::from_be_bytes(*seed);
let o = u128::from_be_bytes(output.as_slice().try_into().expect("wrong length"));
let r = s ^ o;
let new_seed = r.wrapping_add(s).wrapping_add(1);
*seed = new_seed.to_be_bytes();
return r.to_be_bytes();
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn chain_test() {
let start = [0u8; N];
let mid = chain(&start, 3);
let end1 = chain(&mid, 7);
let end2 = chain(&start, 10);
assert_eq!(end1, end2);
}
#[test]
fn sign_and_verify() {
let wots = Wots::new();
let sig = wots.sign("hello world");
assert_eq!(sig.verify(), true);
}
}
|
use core::convert::TryInto;
use core::hash::Hasher;
use aes::cipher::{generic_array::GenericArray, BlockEncrypt, NewBlockCipher};
use aes::Aes128;
use getrandom;
use siphasher::sip128::{Hasher128, SipHasher};
pub const W: usize = 256;
pub const X: usize = 1;
pub const N: usize = 128 / 8;
/*/// Message digest length in bytes.
const M: usize = 512 / 8;
/// Length of the base `W` representation of a message of length `M`.
const L1: usize = 128;
/// Length of the base `W` checksum of a base `W` message of length `L1`.
const L2: usize = 3;
/// Number of function chains
const L: usize = L1 + L2;*/
#[derive(Debug, Clone, PartialEq, PartialOrd, Hash, Default)]
pub struct Wots {
pub pk: [u8; N],
sk: Vec<[u8; N]>,
}
#[derive(Debug, Clone, PartialEq, PartialOrd, Hash, Default)]
pub struct WotsSignature {
pub pk: [u8; N],
pub msg_hash: [u8; N],
pub signature: Vec<[u8; N]>,
}
impl Wots {
pub fn new() -> Self {
let seed: [u8; N] = rand_digest().unwrap();
return Self::from_seed(seed);
}
pub fn from_seed(mut seed: [u8; N]) -> Self {
let mut sk = Vec::<[u8; N]>::with_capacity(N * X);
let mut pk = Vec::<[u8; N]>::with_capacity(N * X);
for _ in 0..N * X {
let secret = prng(&mut seed);
sk.push(secret);
let public = chain(&secret, W - 1);
pk.push(public);
}
let mut hasher = SipHasher::new();
for p in &pk {
hasher.write(p);
}
let h = hasher.finish128();
let hash_bytes = h.as_bytes();
return Self { pk: hash_bytes, sk };
}
pub fn sign(&self, input: &str) -> WotsSignature {
let mut hasher = SipHasher::new();
hasher.write(input.as_bytes());
let h = hasher.finish128();
let hash_bytes = h.as_bytes();
let mut signature: Vec<[u8; N]> = Vec::with_capacity(N * X);
let mut sig_cycles: Vec<usize> = Vec::with_capacity(N * X);
for i in 0..N {
let symbols = base_w(hash_bytes[i]);
for s in 0..X {
sig_cycles.push(symbols[s] as usize);
let index = i * X + s;
let sig: [u8; N] = chain(&self.sk[index], sig_cycles[index]);
signature.push(sig);
}
}
return WotsSignature {
pk: self.pk.clone(),
msg_hash: hash_bytes.clone(),
signature,
};
}
}
impl WotsSignature {
pub fn verify(&se | )?;
Ok(buf)
}
pub fn prng(seed: &mut [u8; N]) -> [u8; N] {
let mut output = *GenericArray::from_slice(seed);
let iv = GenericArray::from([0u8; N]);
let cipher = Aes128::new(&iv);
cipher.encrypt_block(&mut output);
let s = u128::from_be_bytes(*seed);
let o = u128::from_be_bytes(output.as_slice().try_into().expect("wrong length"));
let r = s ^ o;
let new_seed = r.wrapping_add(s).wrapping_add(1);
*seed = new_seed.to_be_bytes();
return r.to_be_bytes();
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn chain_test() {
let start = [0u8; N];
let mid = chain(&start, 3);
let end1 = chain(&mid, 7);
let end2 = chain(&start, 10);
assert_eq!(end1, end2);
}
#[test]
fn sign_and_verify() {
let wots = Wots::new();
let sig = wots.sign("hello world");
assert_eq!(sig.verify(), true);
}
}
| lf) -> bool {
let mut i = 0;
let mut pk = Vec::<[u8; N]>::with_capacity(N * X);
for b in &self.msg_hash {
for s in base_w(*b) {
let cycles = W - 1 - (s as usize);
pk.push(chain(&self.signature[i], cycles));
i += 1;
}
}
let mut hasher = SipHasher::new();
for p in &pk {
hasher.write(p);
}
let h = hasher.finish128();
let hash_bytes = h.as_bytes();
assert_eq!(self.pk, hash_bytes);
return true;
}
}
pub fn chain(input: &[u8; N], c: usize) -> [u8; N] {
let mut output = *GenericArray::from_slice(input);
let iv = GenericArray::from([0u8; N]);
let cipher = Aes128::new(&iv);
for _ in 0..c {
let i = u128::from_be_bytes(output.as_slice().try_into().expect("wrong length"));
cipher.encrypt_block(&mut output);
let o = u128::from_be_bytes(output.as_slice().try_into().expect("wrong length"));
let r = i ^ o;
output = GenericArray::from(r.to_be_bytes());
}
return output.as_slice().try_into().expect("wrong length");
}
pub fn base_w(byte: u8) -> [u8; X] {
let mut b = byte as usize;
let mut symbols = [0u8; X];
for s in 0..X {
symbols[X - 1 - s] = (b % W) as u8;
b /= W;
}
return symbols;
}
fn rand_digest() -> Result<[u8; N], getrandom::Error> {
let mut buf = [0u8; N];
getrandom::getrandom(&mut buf | random | [
{
"content": "/// Applies c cycles of the SHA-256/8N hash function to the input.\n\npub fn chain(input: &[u8; N], c: usize, chain: usize, start: usize, pk_seed: &[u8; N]) -> [u8; N] {\n\n let mut output = input.clone();\n\n\n\n for i in 0..c {\n\n let (key, bitmask) = prf2(&pk_seed, ((chain << 8) +... |
Rust | src/stations.rs | danielrs/pandora-rs | 494ab0aef0ddb9959cdae6c6a6fb5a8ab161a7d0 |
use super::Pandora;
use error::Result;
use method::Method;
use music::{ToMusicToken, MusicType};
use playlist::Playlist;
use serde_json;
pub struct Stations<'a> {
pandora: &'a Pandora,
}
impl<'a> Stations<'a> {
pub fn new(pandora: &'a Pandora) -> Stations<'a> {
Stations { pandora: pandora }
}
pub fn list(&self) -> Result<Vec<Station>> {
let stations = try!(self.pandora
.post::<StationList>(Method::UserGetStationList, None));
Ok(stations.stations)
}
pub fn create<T>(&self, music_token: &T) -> Result<Station>
where T: ToMusicToken
{
self.pandora
.post(Method::StationCreateStation,
Some(serde_json::to_value(CreateStationRequest {
track_token: None,
music_type: None,
music_token: Some(music_token.to_music_token()),
})))
}
pub fn rename<T>(&self, station: &T, station_name: &str) -> Result<Station>
where T: ToStationToken
{
self.pandora
.post(Method::StationRenameStation,
Some(serde_json::to_value(RenameStationRequest {
station_token: station.to_station_token(),
station_name: station_name.to_owned(),
})))
}
pub fn delete<T>(&self, station: &T) -> Result<()>
where T: ToStationToken
{
self.pandora
.post_noop(Method::StationDeleteStation,
Some(serde_json::to_value(DeleteStationRequest {
station_token: station.to_station_token(),
})))
}
pub fn add_seed<S, T>(&self, station: &S, music_token: &T) -> Result<Seed>
where S: ToStationToken,
T: ToMusicToken
{
self.pandora
.post(Method::StationAddMusic,
Some(serde_json::to_value(AddSeedRequest {
station_token: station.to_station_token(),
music_token: music_token.to_music_token(),
})))
}
pub fn remove_seed(&self, seed: &Seed) -> Result<()> {
self.pandora
.post(Method::StationDeleteMusic,
Some(serde_json::to_value(RemoveSeedRequest { seed_id: seed.seed_id.clone() })))
}
pub fn station<T>(&self, station: &T) -> Result<Station>
where T: ToStationToken
{
self.pandora
.post(Method::StationGetStation,
Some(serde_json::to_value(GetStationRequest {
station_token: station.to_station_token(),
include_extended_attributes: true,
})))
}
pub fn checksum(&self) -> Result<StationListChecksum> {
self.pandora.post(Method::UserGetStationListChecksum, None)
}
pub fn playlist<T>(&self, station: &T) -> Playlist
where T: ToStationToken
{
Playlist::new(self.pandora, station)
}
}
pub trait ToStationToken {
fn to_station_token(&self) -> String;
}
#[derive(Debug, Clone, Deserialize)]
pub struct Station {
#[serde(rename="stationId")]
pub station_id: String,
#[serde(rename="stationName")]
pub station_name: String,
}
impl ToStationToken for Station {
fn to_station_token(&self) -> String {
self.station_id.clone()
}
}
#[derive(Debug, Deserialize)]
struct StationList {
pub stations: Vec<Station>,
pub checksum: String,
}
#[derive(Deserialize)]
pub struct StationListChecksum {
pub checksum: String,
}
#[derive(Debug, Deserialize)]
pub struct ExtendedStation {
#[serde(rename="stationId")]
pub station_id: String,
#[serde(rename="stationName")]
pub station_name: String,
#[serde(rename="artUrl")]
pub art_url: Option<String>,
pub music: Option<StationMusic>,
}
#[derive(Debug, Deserialize)]
pub struct StationMusic {
pub songs: Vec<SongSeed>,
pub artists: Vec<ArtistSeed>,
pub genre: Option<Vec<GenreSeed>>,
}
#[derive(Debug, Deserialize)]
pub struct Seed {
#[serde(rename="seedId")]
pub seed_id: String,
}
#[derive(Debug, Deserialize)]
pub struct SongSeed {
#[serde(rename="seedId")]
pub seed_id: String,
#[serde(rename="artistName")]
pub artist_name: String,
#[serde(rename="artUrl")]
pub art_url: String,
#[serde(rename="songName")]
pub song_name: String,
#[serde(rename="musicToken")]
pub music_token: String,
}
#[derive(Debug, Deserialize)]
pub struct ArtistSeed {
#[serde(rename="seedId")]
pub seed_id: String,
#[serde(rename="artistName")]
pub artist_name: String,
#[serde(rename="artUrl")]
pub art_url: String,
#[serde(rename="musicToken")]
pub music_token: String,
}
#[derive(Debug, Deserialize)]
pub struct GenreSeed {
#[serde(rename="seedId")]
pub seed_id: String,
#[serde(rename="artistName")]
pub genre_name: String,
#[serde(rename="musicToken")]
pub music_token: String,
}
#[derive(Serialize)]
struct CreateStationRequest {
#[serde(rename="trackToken")]
track_token: Option<String>,
#[serde(rename="musicType")]
music_type: Option<MusicType>,
#[serde(rename="musicToken")]
music_token: Option<String>,
}
#[derive(Serialize)]
struct RenameStationRequest {
#[serde(rename="stationToken")]
station_token: String,
#[serde(rename="stationName")]
station_name: String,
}
#[derive(Serialize)]
struct DeleteStationRequest {
#[serde(rename="stationToken")]
station_token: String,
}
#[derive(Serialize)]
struct GetStationRequest {
#[serde(rename="stationToken")]
station_token: String,
#[serde(rename="includeExtendedAttributes")]
include_extended_attributes: bool,
}
#[derive(Serialize)]
struct AddSeedRequest {
#[serde(rename="stationToken")]
station_token: String,
#[serde(rename="musicToken")]
music_token: String,
}
#[derive(Serialize)]
struct RemoveSeedRequest {
#[serde(rename="seedId")]
seed_id: String,
}
|
use super::Pandora;
use error::Result;
use method::Method;
use music::{ToMusicToken, MusicType};
use playlist::Playlist;
use serde_json;
pub struct Stations<'a> {
pandora: &'a Pandora,
}
impl<'a> Stations<'a> {
pub fn new(pandora: &'a Pandora) -> Stations<'a> {
Stations { pandora: pandora }
}
pub fn list(&self) -> Result<Vec<Station>> {
let stations = try!(self.pandora
.post::<StationList>(Method::UserGetStationList, None));
Ok(stations.stations)
}
pub fn create<T>(&self, music_token: &T) -> Result<Station>
where T: ToMusicToken
{
self.pandora
.post(Method::StationCreateStation,
Some(serde_json::to_value(CreateStationRequest {
track_token: None,
music_type: None,
music_token: Some(music_token.to_music_token()),
})))
}
pub fn rename<T>(&self, station: &T, station_name: &str) -> Result<Station>
where T: ToStationToken
{
self.pandora
.post(Method::StationRenameStation,
Some(serde_json::to_value(RenameStationRequest {
station_token: station.to_station_token(),
station_name: station_name.to_owned(),
})))
}
pub fn delete<T>(&self, station: &T) -> Result<()>
|
pub fn add_seed<S, T>(&self, station: &S, music_token: &T) -> Result<Seed>
where S: ToStationToken,
T: ToMusicToken
{
self.pandora
.post(Method::StationAddMusic,
Some(serde_json::to_value(AddSeedRequest {
station_token: station.to_station_token(),
music_token: music_token.to_music_token(),
})))
}
pub fn remove_seed(&self, seed: &Seed) -> Result<()> {
self.pandora
.post(Method::StationDeleteMusic,
Some(serde_json::to_value(RemoveSeedRequest { seed_id: seed.seed_id.clone() })))
}
pub fn station<T>(&self, station: &T) -> Result<Station>
where T: ToStationToken
{
self.pandora
.post(Method::StationGetStation,
Some(serde_json::to_value(GetStationRequest {
station_token: station.to_station_token(),
include_extended_attributes: true,
})))
}
pub fn checksum(&self) -> Result<StationListChecksum> {
self.pandora.post(Method::UserGetStationListChecksum, None)
}
pub fn playlist<T>(&self, station: &T) -> Playlist
where T: ToStationToken
{
Playlist::new(self.pandora, station)
}
}
pub trait ToStationToken {
fn to_station_token(&self) -> String;
}
#[derive(Debug, Clone, Deserialize)]
pub struct Station {
#[serde(rename="stationId")]
pub station_id: String,
#[serde(rename="stationName")]
pub station_name: String,
}
impl ToStationToken for Station {
fn to_station_token(&self) -> String {
self.station_id.clone()
}
}
#[derive(Debug, Deserialize)]
struct StationList {
pub stations: Vec<Station>,
pub checksum: String,
}
#[derive(Deserialize)]
pub struct StationListChecksum {
pub checksum: String,
}
#[derive(Debug, Deserialize)]
pub struct ExtendedStation {
#[serde(rename="stationId")]
pub station_id: String,
#[serde(rename="stationName")]
pub station_name: String,
#[serde(rename="artUrl")]
pub art_url: Option<String>,
pub music: Option<StationMusic>,
}
#[derive(Debug, Deserialize)]
pub struct StationMusic {
pub songs: Vec<SongSeed>,
pub artists: Vec<ArtistSeed>,
pub genre: Option<Vec<GenreSeed>>,
}
#[derive(Debug, Deserialize)]
pub struct Seed {
#[serde(rename="seedId")]
pub seed_id: String,
}
#[derive(Debug, Deserialize)]
pub struct SongSeed {
#[serde(rename="seedId")]
pub seed_id: String,
#[serde(rename="artistName")]
pub artist_name: String,
#[serde(rename="artUrl")]
pub art_url: String,
#[serde(rename="songName")]
pub song_name: String,
#[serde(rename="musicToken")]
pub music_token: String,
}
#[derive(Debug, Deserialize)]
pub struct ArtistSeed {
#[serde(rename="seedId")]
pub seed_id: String,
#[serde(rename="artistName")]
pub artist_name: String,
#[serde(rename="artUrl")]
pub art_url: String,
#[serde(rename="musicToken")]
pub music_token: String,
}
#[derive(Debug, Deserialize)]
pub struct GenreSeed {
#[serde(rename="seedId")]
pub seed_id: String,
#[serde(rename="artistName")]
pub genre_name: String,
#[serde(rename="musicToken")]
pub music_token: String,
}
#[derive(Serialize)]
struct CreateStationRequest {
#[serde(rename="trackToken")]
track_token: Option<String>,
#[serde(rename="musicType")]
music_type: Option<MusicType>,
#[serde(rename="musicToken")]
music_token: Option<String>,
}
#[derive(Serialize)]
struct RenameStationRequest {
#[serde(rename="stationToken")]
station_token: String,
#[serde(rename="stationName")]
station_name: String,
}
#[derive(Serialize)]
struct DeleteStationRequest {
#[serde(rename="stationToken")]
station_token: String,
}
#[derive(Serialize)]
struct GetStationRequest {
#[serde(rename="stationToken")]
station_token: String,
#[serde(rename="includeExtendedAttributes")]
include_extended_attributes: bool,
}
#[derive(Serialize)]
struct AddSeedRequest {
#[serde(rename="stationToken")]
station_token: String,
#[serde(rename="musicToken")]
music_token: String,
}
#[derive(Serialize)]
struct RemoveSeedRequest {
#[serde(rename="seedId")]
seed_id: String,
}
| where T: ToStationToken
{
self.pandora
.post_noop(Method::StationDeleteStation,
Some(serde_json::to_value(DeleteStationRequest {
station_token: station.to_station_token(),
})))
} | function_block-function_prefix_line | [
{
"content": "/// Returns the encrypted input using the given key.\n\n///\n\n/// The returned string is encoded in hexadecimal notation,\n\n/// which is a UTF-8 string, so it's fine to return it using\n\n/// the `String` type.\n\npub fn encrypt(key: &str, input: &str) -> String {\n\n let cipherbytes = cipher... |
Rust | src/main.rs | cerrno/winnow | f172e648a9b69ac6dd0bc42ac753c173d89ad962 | use std::collections::HashMap;
use std::env;
use std::io;
use std::path::Path;
use std::process::Command;
use winnow::detector;
use winnow::winnowing::{parse_patch, Fingerprint};
use colored::*;
use indicatif::ProgressIterator;
struct Repo {
name: String,
path: String,
patches: Vec<String>,
}
impl Repo {
fn new(repo: &str) -> io::Result<Self> {
let repo_dir = Path::new(repo).file_name().unwrap();
let repo = Repo {
name: repo_dir.to_str().unwrap().to_owned(),
path: repo.to_owned(),
patches: vec![],
};
repo.git_clone()?;
Ok(repo)
}
fn git_clone(&self) -> io::Result<()> {
let clone_cmd = Command::new("git")
.arg("clone")
.arg("--bare")
.arg(&self.path)
.output()?;
if clone_cmd.status.code().unwrap() == 128 {
println!("{}", format!("repo {} already exists", self.path).yellow());
} else if !clone_cmd.status.success() {
panic!("cannot clone repo {}", self.path);
}
Ok(())
}
/*
fn patches(&mut self) -> io::Result<()> {
let start = empty_tree_hash()?;
self.patches_since(&start)
}
*/
fn make_patches_since(&mut self, start_hash: &str) -> io::Result<()> {
let git_cmd = Command::new("git")
.arg("format-patch")
.arg("-k")
.arg(start_hash)
.current_dir(&self.name)
.output()?;
if !git_cmd.status.success() {
println!("{}", String::from_utf8(git_cmd.stderr).unwrap());
panic!("cannot git format-patch");
}
for l in String::from_utf8(git_cmd.stdout).unwrap().lines() {
let mut s = self.name.clone();
s.push_str("/");
s.push_str(l);
self.patches.push(s);
}
Ok(())
}
fn parse_patches(&self) -> Vec<Fingerprint> {
let mut out = vec![];
for p in self.patches.iter().progress() {
out.append(&mut parse_patch(&p, &self.name));
}
out
}
}
fn empty_tree_hash() -> io::Result<String> {
let hash = Command::new("git")
.arg("hash-object")
.arg("-t")
.arg("tree")
.arg("/dev/null")
.output()?;
if !hash.status.success() {
panic!("cannot git hash-object");
}
Ok(String::from_utf8(hash.stdout).unwrap().trim().to_owned())
}
fn main() -> io::Result<()> {
let args: Vec<String> = env::args().collect();
let (repo1, repo2, start_hash) = match args.len() {
3 => (args[1].clone(), args[2].clone(), empty_tree_hash()?),
4 => (args[1].clone(), args[2].clone(), args[3].clone()),
_ => panic!("Invalid number of arguments"),
};
let mut fingerprint_map: HashMap<String, Vec<Fingerprint>> = HashMap::new();
let mut repo = Repo::new(&repo1)?;
repo.make_patches_since(&start_hash)?;
let fingerprints = repo.parse_patches();
fingerprint_map.insert(repo.name, fingerprints);
let mut repo = Repo::new(&repo2)?;
repo.make_patches_since(&start_hash)?;
let fingerprints = repo.parse_patches();
fingerprint_map.insert(repo.name, fingerprints);
detector::run(fingerprint_map);
Ok(())
}
| use std::collections::HashMap;
use std::env;
use std::io;
use std::path::Path;
use std::process::Command;
use winnow::detector;
use winnow::winnowing::{parse_patch, Fingerprint};
use colored::*;
use indicatif::ProgressIterator;
struct Repo {
name: String,
path: String,
patches: Vec<String>,
}
impl Repo {
fn new(repo: &str) -> io::Result<Self> {
|
fn git_clone(&self) -> io::Result<()> {
let clone_cmd = Command::new("git")
.arg("clone")
.arg("--bare")
.arg(&self.path)
.output()?;
if clone_cmd.status.code().unwrap() == 128 {
println!("{}", format!("repo {} already exists", self.path).yellow());
} else if !clone_cmd.status.success() {
panic!("cannot clone repo {}", self.path);
}
Ok(())
}
/*
fn patches(&mut self) -> io::Result<()> {
let start = empty_tree_hash()?;
self.patches_since(&start)
}
*/
fn make_patches_since(&mut self, start_hash: &str) -> io::Result<()> {
let git_cmd = Command::new("git")
.arg("format-patch")
.arg("-k")
.arg(start_hash)
.current_dir(&self.name)
.output()?;
if !git_cmd.status.success() {
println!("{}", String::from_utf8(git_cmd.stderr).unwrap());
panic!("cannot git format-patch");
}
for l in String::from_utf8(git_cmd.stdout).unwrap().lines() {
let mut s = self.name.clone();
s.push_str("/");
s.push_str(l);
self.patches.push(s);
}
Ok(())
}
fn parse_patches(&self) -> Vec<Fingerprint> {
let mut out = vec![];
for p in self.patches.iter().progress() {
out.append(&mut parse_patch(&p, &self.name));
}
out
}
}
fn empty_tree_hash() -> io::Result<String> {
let hash = Command::new("git")
.arg("hash-object")
.arg("-t")
.arg("tree")
.arg("/dev/null")
.output()?;
if !hash.status.success() {
panic!("cannot git hash-object");
}
Ok(String::from_utf8(hash.stdout).unwrap().trim().to_owned())
}
fn main() -> io::Result<()> {
let args: Vec<String> = env::args().collect();
let (repo1, repo2, start_hash) = match args.len() {
3 => (args[1].clone(), args[2].clone(), empty_tree_hash()?),
4 => (args[1].clone(), args[2].clone(), args[3].clone()),
_ => panic!("Invalid number of arguments"),
};
let mut fingerprint_map: HashMap<String, Vec<Fingerprint>> = HashMap::new();
let mut repo = Repo::new(&repo1)?;
repo.make_patches_since(&start_hash)?;
let fingerprints = repo.parse_patches();
fingerprint_map.insert(repo.name, fingerprints);
let mut repo = Repo::new(&repo2)?;
repo.make_patches_since(&start_hash)?;
let fingerprints = repo.parse_patches();
fingerprint_map.insert(repo.name, fingerprints);
detector::run(fingerprint_map);
Ok(())
}
| let repo_dir = Path::new(repo).file_name().unwrap();
let repo = Repo {
name: repo_dir.to_str().unwrap().to_owned(),
path: repo.to_owned(),
patches: vec![],
};
repo.git_clone()?;
Ok(repo)
} | function_block-function_prefix_line | [
{
"content": "pub fn parse_patch(path: &str, repo: &str) -> Vec<Fingerprint> {\n\n let patch = fs::read_to_string(path).unwrap();\n\n let mut patchset = PatchSet::new();\n\n if let Err(e) = patchset.parse(&patch) {\n\n println!(\"{:?}\", e);\n\n return vec![];\n\n }\n\n let commit_h... |
Rust | bindings/src/event_bindings.rs | stumptownlabs/beeper-android-seshat | 2de21b9002f72ac083a143629e0ad3d806fd63ce | extern crate jni;
extern crate seshat;
use jni::sys::{jlong, jboolean, jstring};
use jni::JNIEnv;
use jni::objects::{JObject, JString, JValue};
use seshat::{Event, EventType};
use crate::utils::*;
/*
* EVENT BINDINGS
*/
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1new_1event(
env: JNIEnv,
_: JObject,
j_event_type: jlong,
j_content_value: JString,
j_has_msg_type: jboolean,
j_msg_type: JString,
j_event_id: JString,
j_sender: JString,
j_server_ts: jlong,
j_room_id: JString,
) -> jlong {
let event_type: EventType = match j_event_type {
1 => EventType::Name,
2 => EventType::Topic,
_ => EventType::Message,
};
let content_value = jstring_to_string(&env, j_content_value);
let msg_type_string = jstring_to_string(&env, j_msg_type);
let msg_type = match j_has_msg_type {
0 => None,
_ => Some(msg_type_string.as_str())
};
let event_id = jstring_to_string(&env, j_event_id);
let sender = jstring_to_string(&env, j_sender);
let server_ts = j_server_ts;
let room_id = jstring_to_string(&env, j_room_id);
let proto_event = Event::new(
event_type.clone(),
content_value.as_str(),
msg_type,
event_id.as_str(),
sender.as_str(),
server_ts,
room_id.as_str(),
"",
);
let event_source = event_to_json(proto_event).unwrap();
let event = Event::new(
event_type,
content_value.as_str(),
msg_type,
event_id.as_str(),
sender.as_str(),
server_ts,
room_id.as_str(),
event_source.as_str(),
);
Box::into_raw(Box::new(event)) as jlong
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1free_1event(
_: JNIEnv,
_: JObject,
event_ptr: jlong,
) {
Box::from_raw(event_ptr as *mut Event);
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1event_1from_1json(
env: JNIEnv,
_: JObject,
j_event_source: JString,
j_result: JObject
) {
let event_source = jstring_to_string(&env,j_event_source);
let result = partial_event_from_json(&event_source.as_str());
match result {
Ok(event) => {
let event_pointer = Box::into_raw(Box::new(event)) as jlong;
let jvm_long_field_id_type = "J";
let event_ptr_field_name = "resultPtr";
env.set_field(
j_result,
event_ptr_field_name,
jvm_long_field_id_type,
JValue::from(event_pointer),
)
.unwrap();
}
Err(err) => {
let error_message = err.to_string();
let io_error = seshat::Error::IOError(err);
let error_code = seshat_error_code(io_error);
let jvm_int_field_id_type = "I";
let error_code_field_name = "errorCode";
env.set_field(
j_result,
error_code_field_name,
jvm_int_field_id_type,
JValue::from(error_code),
)
.unwrap();
let jvm_int_field_id_type = "Ljava/lang/String;";
let error_message_field_name = "errorMessage";
let j_error_message = env.new_string(error_message).unwrap();
let jvalue = j_error_message.into_inner();
env.set_field(
j_result,
error_message_field_name,
jvm_int_field_id_type,
JValue::from(JObject::from(jvalue)),
)
.unwrap();
}
};
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1type(
_: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jlong {
let event = Box::from_raw(event_ptr as *mut Event);
let event_type = event.event_type.clone();
Box::leak(event);
match event_type {
EventType::Message => {
0
}
EventType::Name => {
1
}
EventType::Topic => {
2
}
}
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1content_1value(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let content_value = event.content_value.clone();
Box::leak(event);
let output = env.new_string(content_value).unwrap();
output.into_inner()
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1id(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let event_id = event.event_id.clone();
Box::leak(event);
let output = env.new_string(event_id).unwrap();
output.into_inner()
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1sender(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let sender = event.sender.clone();
Box::leak(event);
let output = env.new_string(sender).unwrap();
output.into_inner()
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1server_1ts(
_: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jlong {
let event = Box::from_raw(event_ptr as *mut Event);
let server_ts = event.server_ts.clone();
Box::leak(event);
server_ts
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1room_1id(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let room_id = event.room_id.clone();
Box::leak(event);
let output = env.new_string(room_id).unwrap();
output.into_inner()
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1message_1type(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let option = event.msgtype.clone();
let message_type = match option{
None => {String::from("")}
Some(msgtype) => {
msgtype
}
};
Box::leak(event);
let output = env.new_string(message_type).unwrap();
output.into_inner()
} | extern crate jni;
extern crate seshat;
use jni::sys::{jlong, jboolean, jstring};
use jni::JNIEnv;
use jni::objects::{JObject, JString, JValue};
use seshat::{Event, EventType};
use crate::utils::*;
/*
* EVENT BINDINGS
*/
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1new_1event(
env: JNIEnv,
_: JObject,
j_event_type: jlong,
j_content_value: JString,
j_has_msg_type: jboolean,
j_msg_type: JString,
j_event_id: JString,
j_sender: JString,
j_server_ts: jlong,
j_room_id: JString,
) -> jlong {
let event_type: EventType = match j_event_type {
1 => EventType::Name,
2 => EventType::Topic,
_ => EventType::Message,
};
let content_value = jstring_to_string(&env, j_content_value);
let msg_type_string = jstring_to_string(&env, j_msg_type);
let msg_type = match j_has_msg_type {
0 => None,
_ => Some(msg_type_string.as_str())
};
let event_id = jstring_to_string(&env, j_event_id);
let sender = jstring_to_string(&env, j_sender);
let server_ts = j_server_ts;
let room_id = jstring_to_string(&env, j_room_id);
let proto_event = Event::new(
event_type.clone(),
content_value.as_str(),
msg_type,
event_id.as_str(),
sender.as_str(),
server_ts,
room_id.as_str(),
"",
);
let event_source = event_to_json(proto_event).unwrap();
let event = Event::new(
event_type,
content_value.as_str(),
msg_type,
event_id.as_str(),
sender.as_str(),
server_ts,
room_id.as_str(),
event_source.as_str(),
);
Box::into_raw(Box::new(event)) as jlong
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1free_1event(
_: JNIEnv,
_: JObject,
event_ptr: jlong,
) {
Box::from_raw(event_ptr as *mut Event);
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1event_1from_1json(
env: JNIEnv,
_: JObject,
j_event_source: JString,
j_result: JObject
) {
let event_source = jstring_to_string(&env,j_event_source);
let result = partial_event_from_json(&event_source.as_str());
match result {
Ok(event) => {
let event_pointer = Box::into_raw(Box::new(event)) as jlong;
let jvm_long_field_id_type = "J";
let event_ptr_field_name = "resultPtr";
env.set_field(
j_result,
event_ptr_field_name,
jvm_long_field_id_type,
JValue::from(event_pointer),
)
.unwrap();
}
Err(err) => {
let error_message = err.to_string();
let io_error = seshat::Error::IOError(err);
let error_code = seshat_error_code(io_error);
let jvm_int_field_id_type = "I";
let error_code_field_name = "errorCode";
env.set_field(
j_result,
error_code_field_name,
jvm_int_field_id_type,
JValue::from(error_code),
)
.unwrap();
let jvm_int_field_id_type = "Ljava/lang/String;";
let error_message_field_name = "errorMessage";
let j_error_message = env.new_string(error_message).unwrap();
let jvalue = j_error_message.into_inner();
env.set_field(
j_result,
error_message_field_name,
jvm_int_field_id_type,
JValue::from(JObject::from(jvalue)),
)
.unwrap();
}
};
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1type(
_: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jlong {
let event = Box::from_raw(event_ptr as *mut Event);
let event_type = event.event_type.clone();
Box::leak(event);
match event_type {
EventType::Message => {
0
}
EventType::Name => {
1
}
EventType::Topic => {
2
}
}
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1content_1value(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let content_value = event.content_value.clone();
Box::leak(event);
let output = env.new_string(content_value).unwrap();
output.into_inner()
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1id(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let event_id = event.event_id.clone();
Box::leak(event);
let output = env.new_string(event_id).unwrap();
output.into_inner()
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1sender(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let sender = event.sender.clone();
Box::leak(event);
let output = env.new_string(sender).unwrap();
output.into_inner()
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1server_1ts(
_: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jlong {
let event = Box::from_raw(event_ptr as *mut Event);
let server_ts = event.server_ts.clone();
Box::leak(event);
server_ts
}
#[no_mangle]
pub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1room_1id(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring {
let event = Box::from_raw(event_ptr as *mut Event);
let room_id = event.room_id.clone();
Box::leak(event);
let output = env.new_string(room_id).unwrap();
output.into_inner()
}
#[no_mangle]
p | {
let event = Box::from_raw(event_ptr as *mut Event);
let option = event.msgtype.clone();
let message_type = match option{
None => {String::from("")}
Some(msgtype) => {
msgtype
}
};
Box::leak(event);
let output = env.new_string(message_type).unwrap();
output.into_inner()
} | ub unsafe extern "C" fn Java_com_beeper_android_1seshat_event_Event_n_1get_1event_1message_1type(
env: JNIEnv,
_: JObject,
event_ptr: jlong,
) -> jstring | function_block-random_span | [
{
"content": "pub fn event_to_json(event: Event) -> Result<String,serde_json::error::Error> {\n\n match serde_json::to_string(&event){\n\n Ok(json) => {\n\n Ok(json)\n\n }\n\n Err(error) => {\n\n Err(error)\n\n }\n\n }\n\n}\n\n\n",
"file_path": "bindin... |
Rust | src/traits.rs | dhylands/serial-framing-protocol-rs | 2f8cee9611891e494023f797ecb847249dffca3f | use core::cmp::min;
use core::fmt;
use core::mem::size_of;
use log::info;
use pretty_hex::*;
use crate::crc::{Crc, CrcAccum};
pub const SOF: u8 = 0x7e;
pub const ESC: u8 = 0x7d;
pub const ESC_FLIP: u8 = 0x20;
pub trait PacketBuffer {
fn capacity(&self) -> usize;
fn len(&self) -> usize;
fn set_len(&mut self, len: usize);
fn data(&self) -> &[u8];
fn data_mut(&mut self) -> &mut [u8];
fn store_byte_at(&mut self, idx: usize, byte: u8) {
self.data_mut()[idx] = byte;
}
fn store_data(&mut self, data: &[u8]) {
let copy_len = min(data.len(), self.capacity());
self.data_mut()[..copy_len].copy_from_slice(&data[..copy_len]);
self.set_len(copy_len);
}
fn is_empty(&self) -> bool {
self.len() == 0
}
fn reset(&mut self) {
self.set_len(0);
}
fn append(&mut self, byte: u8) -> Result<(), ()> {
let len = self.len();
if len < self.capacity() {
self.set_len(len + 1);
self.store_byte_at(len, byte);
Ok(())
} else {
Err(())
}
}
fn remove_crc(&mut self) -> CrcAccum {
let mut len = self.len();
if len < size_of::<CrcAccum>() {
return 0;
}
len -= 2;
let data = self.data();
let crc = ((data[len + 1] as CrcAccum) << 8) | (data[len] as CrcAccum);
self.set_len(len);
crc
}
fn dump(&self) {
info!("{:?}", self.data().hex_dump());
}
}
impl fmt::Debug for dyn PacketBuffer {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "{:?}", self.data().hex_dump())
}
}
pub trait PacketWriter {
fn start_write(&mut self) {}
fn write_byte(&mut self, byte: u8);
fn end_write(&mut self) {}
fn write_packet_data(&mut self, header: u8, bytes: &[u8]) {
info!(
"write_packet_data header: 0x{:02x} len: {}",
header,
bytes.len()
);
let mut crc = Crc::new();
self.start_write();
self.write_byte(SOF);
self.write_escaped_byte(&mut crc, header);
self.write_escaped_bytes(&mut crc, bytes);
self.write_crc(&mut crc);
self.write_byte(SOF);
self.end_write();
}
fn write_crc(&mut self, crc: &mut Crc) {
let crc_lsb = crc.lsb();
let crc_msb = crc.msb();
self.write_escaped_byte(crc, crc_lsb);
self.write_escaped_byte(crc, crc_msb);
}
fn write_escaped_bytes(&mut self, crc: &mut Crc, bytes: &[u8]) {
for byte in bytes {
self.write_escaped_byte(crc, *byte);
}
}
fn write_escaped_byte(&mut self, crc: &mut Crc, byte: u8) {
crc.accum(byte);
if byte == ESC || byte == SOF {
self.write_byte(ESC);
self.write_byte(byte ^ ESC_FLIP);
} else {
self.write_byte(byte);
}
}
}
pub trait PacketQueue {
fn capacity(&self) -> usize;
fn len(&self) -> usize;
fn set_len(&mut self, len: usize);
fn idx(&self) -> usize;
fn set_idx(&mut self, len: usize);
fn packet(&mut self, idx: usize) -> Option<&mut dyn PacketBuffer>;
fn clear(&mut self) {
self.set_len(0);
self.set_idx(0);
}
fn next(&mut self) -> &mut dyn PacketBuffer {
if self.len() < self.capacity() {
self.set_len(self.len() + 1);
}
self.set_idx((self.idx() + 1) % self.capacity());
self.packet(self.idx()).unwrap()
}
fn get(&mut self, offset: usize) -> Option<&mut dyn PacketBuffer> {
if offset < self.len() {
let idx = if self.idx() < offset {
self.idx() + self.capacity() - offset
} else {
self.idx() - offset
};
self.packet(idx)
} else {
None
}
}
}
pub trait Storage {
fn rx_buf(&mut self) -> &mut dyn PacketBuffer;
fn tx_writer(&mut self) -> &mut dyn PacketWriter;
fn tx_queue(&mut self) -> &mut dyn PacketQueue;
}
| use core::cmp::min;
use core::fmt;
use core::mem::size_of;
use log::info;
use pretty_hex::*;
use crate::crc::{Crc, CrcAccum};
pub const SOF: u8 = 0x7e;
pub const ESC: u8 = 0x7d;
pub const ESC_FLIP: u8 = 0x20;
pub trait PacketBuffer {
fn capacity(&self) -> usize;
fn len(&self) -> usize;
fn set_len(&mut self, len: usize);
fn data(&self) -> &[u8];
fn data_mut(&mut self) -> &mut [u8];
fn store_byte_at(&mut self, idx: usize, byte: u8) {
self.data_mut()[idx] = byte;
}
fn store_data(&mut self, data: &[u8]) {
let copy_len = min(data.len(), self.capacity());
self.data_mut()[..copy_len].copy_from_slice(&data[..copy_len]);
self.set_len(copy_len);
}
fn is_empty(&self) -> bool {
self.len() == 0
}
fn reset(&mut self) {
self.set_len(0);
}
fn append(&mut self, byte: u8) -> Result<(), ()> {
let len = self.len();
if len < self.capacity() {
self.set_len(len + 1);
self.store_byte_at(len, byte);
Ok(())
} else {
Err(())
}
}
fn remove_crc(&mut self) -> CrcAccum {
l | ] as CrcAccum);
self.set_len(len);
crc
}
fn dump(&self) {
info!("{:?}", self.data().hex_dump());
}
}
impl fmt::Debug for dyn PacketBuffer {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "{:?}", self.data().hex_dump())
}
}
pub trait PacketWriter {
fn start_write(&mut self) {}
fn write_byte(&mut self, byte: u8);
fn end_write(&mut self) {}
fn write_packet_data(&mut self, header: u8, bytes: &[u8]) {
info!(
"write_packet_data header: 0x{:02x} len: {}",
header,
bytes.len()
);
let mut crc = Crc::new();
self.start_write();
self.write_byte(SOF);
self.write_escaped_byte(&mut crc, header);
self.write_escaped_bytes(&mut crc, bytes);
self.write_crc(&mut crc);
self.write_byte(SOF);
self.end_write();
}
fn write_crc(&mut self, crc: &mut Crc) {
let crc_lsb = crc.lsb();
let crc_msb = crc.msb();
self.write_escaped_byte(crc, crc_lsb);
self.write_escaped_byte(crc, crc_msb);
}
fn write_escaped_bytes(&mut self, crc: &mut Crc, bytes: &[u8]) {
for byte in bytes {
self.write_escaped_byte(crc, *byte);
}
}
fn write_escaped_byte(&mut self, crc: &mut Crc, byte: u8) {
crc.accum(byte);
if byte == ESC || byte == SOF {
self.write_byte(ESC);
self.write_byte(byte ^ ESC_FLIP);
} else {
self.write_byte(byte);
}
}
}
pub trait PacketQueue {
fn capacity(&self) -> usize;
fn len(&self) -> usize;
fn set_len(&mut self, len: usize);
fn idx(&self) -> usize;
fn set_idx(&mut self, len: usize);
fn packet(&mut self, idx: usize) -> Option<&mut dyn PacketBuffer>;
fn clear(&mut self) {
self.set_len(0);
self.set_idx(0);
}
fn next(&mut self) -> &mut dyn PacketBuffer {
if self.len() < self.capacity() {
self.set_len(self.len() + 1);
}
self.set_idx((self.idx() + 1) % self.capacity());
self.packet(self.idx()).unwrap()
}
fn get(&mut self, offset: usize) -> Option<&mut dyn PacketBuffer> {
if offset < self.len() {
let idx = if self.idx() < offset {
self.idx() + self.capacity() - offset
} else {
self.idx() - offset
};
self.packet(idx)
} else {
None
}
}
}
pub trait Storage {
fn rx_buf(&mut self) -> &mut dyn PacketBuffer;
fn tx_writer(&mut self) -> &mut dyn PacketWriter;
fn tx_queue(&mut self) -> &mut dyn PacketQueue;
}
| et mut len = self.len();
if len < size_of::<CrcAccum>() {
return 0;
}
len -= 2;
let data = self.data();
let crc = ((data[len + 1] as CrcAccum) << 8) | (data[len | function_block-random_span | [
{
"content": "// Parse a bunch of bytes and return the first return code that isn't\n\n// MoreDataNeeded. This means that this function will parse at most one\n\n// error or packet from the input stream, which is fine for testing.\n\npub fn parse_bytes(\n\n parser: &mut RawPacketParser,\n\n bytes: &[u8],\... |
Rust | src/tokenizer/words.rs | naughie/kytea-tokenizer | 8dd76fae807c2bd0d9f773cef2089b13b3ef7570 | use super::Word;
use crate::kytea::{DELIM, ESCAPE};
use std::num::NonZeroUsize;
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
pub struct Words<'a> {
inner: &'a str,
}
impl<'a> Iterator for Words<'a> {
type Item = Word<'a>;
fn next(&mut self) -> Option<Self::Item> {
let pos = self.find_sow();
self.inner = &self.inner[pos..];
let pos = self.find_eow()?.get();
let inner = &self.inner[..pos];
self.inner = &self.inner[pos..];
Some(Word { inner })
}
}
impl<'a> DoubleEndedIterator for Words<'a> {
fn next_back(&mut self) -> Option<Self::Item> {
let pos = self.rfind_eow()?.get();
self.inner = &self.inner[..pos];
let pos = self.rfind_sow();
let inner = &self.inner[pos..];
self.inner = &self.inner[..pos];
Some(Word { inner })
}
}
impl<'a> From<&'a str> for Words<'a> {
fn from(inner: &'a str) -> Self {
Self { inner }
}
}
impl Words<'_> {
#[inline]
fn len(self) -> usize {
self.inner.len()
}
#[inline]
fn is_empty(self) -> bool {
self.inner.is_empty()
}
fn enumerate(&self) -> impl DoubleEndedIterator<Item = (usize, u8)> + '_ {
self.inner.as_bytes().iter().copied().enumerate()
}
#[inline]
fn renumerate(&self) -> impl Iterator<Item = (usize, u8)> + '_ {
self.enumerate().rev()
}
fn find_sow(&self) -> usize {
let mut it = self.enumerate().skip_while(|&(_, c)| c == DELIM);
if let Some((i, _)) = it.next() {
i
} else {
self.len()
}
}
fn find_eow(&self) -> Option<NonZeroUsize> {
if self.is_empty() {
return None;
}
let mut prev_char = 0u8;
for (i, c) in self.enumerate() {
if c == DELIM && prev_char != ESCAPE {
return unsafe { Some(NonZeroUsize::new_unchecked(i)) };
}
prev_char = if c == ESCAPE && prev_char == ESCAPE {
0
} else {
c
};
}
unsafe { Some(NonZeroUsize::new_unchecked(self.inner.len())) }
}
#[inline]
fn iso_parity(i: usize, j: usize) -> bool {
(i & 1) == (j & 1)
}
fn rfind_eow(&self) -> Option<NonZeroUsize> {
let mut it = self.renumerate().skip_while(|&(_, c)| c == DELIM);
if let Some((i, c)) = it.next() {
if c == ESCAPE {
let last = match it.filter(|&(_, c)| c == ESCAPE).last() {
Some((j, _)) if !Self::iso_parity(i, j) => i + 1,
_ => i + 2,
};
unsafe { Some(NonZeroUsize::new_unchecked(last)) }
} else {
unsafe { Some(NonZeroUsize::new_unchecked(i + 1)) }
}
} else {
None
}
}
fn rfind_sow(&self) -> usize {
let mut delim = 0;
let mut delim_found = false;
let mut broken = false;
for (i, c) in self.renumerate() {
if delim_found && c != ESCAPE {
if Self::iso_parity(i, delim) {
delim_found = false;
} else {
broken = true;
break;
}
}
if c == DELIM {
delim_found = true;
delim = i;
}
}
if delim_found && (broken || Self::iso_parity(delim, 0)) {
delim + 1
} else {
0
}
}
}
#[cfg(test)]
mod test {
use super::*;
#[test]
fn test_words() {
let s = "";
let mut words = Words::from(s);
assert_eq!(words.next(), None);
let s = "吾輩/名詞\tは/助詞\t\t猫/名詞\t /補助記号";
let mut words = Words::from(s);
assert_eq!(words.next(), Some(Word::from("吾輩/名詞")));
assert_eq!(words.next(), Some(Word::from("は/助詞")));
assert_eq!(words.next(), Some(Word::from("猫/名詞")));
assert_eq!(words.next(), Some(Word::from(" /補助記号")));
assert_eq!(words.next(), None);
let s = "ab\t\\\t/補助記号\t\\/\\\t\t\\\\\\\t/\\\\\t";
let mut words = Words::from(s);
assert_eq!(words.next(), Some(Word::from("ab")));
assert_eq!(words.next(), Some(Word::from("\\\t/補助記号")));
assert_eq!(words.next(), Some(Word::from("\\/\\\t")));
assert_eq!(words.next(), Some(Word::from("\\\\\\\t/\\\\")));
assert_eq!(words.next(), None);
}
#[test]
fn test_words_rev() {
let s = "";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), None);
let s = "吾輩/名詞\tは/助詞\t\t猫/名詞\t /補助記号";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from(" /補助記号")));
assert_eq!(words.next(), Some(Word::from("猫/名詞")));
assert_eq!(words.next(), Some(Word::from("は/助詞")));
assert_eq!(words.next(), Some(Word::from("吾輩/名詞")));
assert_eq!(words.next(), None);
let s = "\t\tab\t\\\t/補助記号\t\\/\\\t\t\\\\\\\t/\\\\\t";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("\\\\\\\t/\\\\")));
assert_eq!(words.next(), Some(Word::from("\\/\\\t")));
assert_eq!(words.next(), Some(Word::from("\\\t/補助記号")));
assert_eq!(words.next(), Some(Word::from("ab")));
assert_eq!(words.next(), None);
let s = "\ta";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("a")));
assert_eq!(words.next(), None);
let s = "\\\ta";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("\\\ta")));
assert_eq!(words.next(), None);
let s = "\\\\\ta";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("a")));
assert_eq!(words.next(), Some(Word::from("\\\\")));
assert_eq!(words.next(), None);
}
#[test]
fn test_words_mixed() {
let s = "吾輩/名詞\tは/助詞\t\t猫/名詞\t /補助記号";
let mut words = Words::from(s);
assert_eq!(words.next(), Some(Word::from("吾輩/名詞")));
assert_eq!(words.next_back(), Some(Word::from(" /補助記号")));
assert_eq!(words.next(), Some(Word::from("は/助詞")));
assert_eq!(words.next_back(), Some(Word::from("猫/名詞")));
assert_eq!(words.next(), None);
assert_eq!(words.next_back(), None);
}
}
| use super::Word;
use crate::kytea::{DELIM, ESCAPE};
use std::num::NonZeroUsize;
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
pub struct Words<'a> {
inner: &'a str,
}
impl<'a> Iterator for Words<'a> {
type Item = Word<'a>;
fn next(&mut self) -> Option<Self::Item> {
let pos = self.find_sow();
self.inner = &self.inner[pos..];
let pos = self.find_eow()?.get();
let inner = &self.inner[..pos];
self.inner = &self.inner[pos..];
Some(Word { inner })
}
}
impl<'a> DoubleEndedIterator for Words<'a> {
fn next_back(&mut self) -> Option<Self::Item> {
let pos = self.rfind_eow()?.get();
self.inner = &self.inner[..pos];
let pos = self.rfind_sow();
let inner = &self.inner[pos..];
self.inner = &self.inner[..pos];
Some(Word { inner })
}
}
impl<'a> From<&'a str> for Words<'a> {
fn from(inner: &'a str) -> Self {
Self { inner }
}
}
impl Words<'_> {
#[inline]
fn len(self) -> usize {
self.inner.len()
}
#[inline]
fn is_empty(self) -> bool {
self.inner.is_empty()
}
fn enumerate(&self) -> impl DoubleEndedIterator<Item = (usize, u8)> + '_ {
self.inner.as_bytes().iter().copied().enumerate()
}
#[inline]
fn renumerate(&self) -> impl Iterator<Item = (usize, u8)> + '_ {
self.enumerate().rev()
}
fn find_sow(&self) -> usize {
let mut it = self.enumerate().skip_while(|&(_, c)| c == DELIM);
if let Some((i, _)) = it.next() {
i
} else {
self.len()
}
}
fn find_eow(&self) -> Option<NonZeroUsize> {
if self.is_empty() {
return None;
}
let mut prev_char = 0u8;
for (i, c) in self.enumerate() {
if c == DELIM && prev_char != ESCAPE {
return unsafe { Some(NonZeroUsize::new_unchecked(i)) };
}
prev_char = if c == ESCAPE && prev_char == ESCAPE {
0
} else {
c
};
}
unsafe { Some(NonZeroUsize::new_unchecked(self.inner.len())) }
}
#[inline]
fn iso_parity(i: usize, j: usize) -> bool {
(i & 1) == (j & 1)
}
fn rfind_eow(&self) -> Option<NonZeroUsize> {
let mut it = self.renumerate().skip_while(|&(_, c)| c == DELIM);
if let Some((i, c)) = it.next() {
if c == ESCAPE {
let last = match it.filter(|&(_, c)| c == ESCAPE).last() {
Some((j, _)) if !Self::iso_parity(i, j) => i + 1,
_ => i + 2,
};
unsafe { Some(NonZeroUsize::new_unchecked(last)) }
} else {
unsafe { Some(NonZeroUsize::new_unchecked(i + 1)) }
}
} else {
None
}
}
fn rfind_sow(&self) -> usize {
let mut delim = 0;
let mut delim_found = false;
let mut broken = false;
for (i, c) in self.renumerate() {
if delim_found && c != ESCAPE {
if Self::iso_parity(i, delim) {
delim_found = false;
} else {
broken = true;
break;
}
}
if c == DELIM {
delim_found = true;
delim = i;
}
}
if delim_found && (broken || Self::iso_parity(delim, 0)) {
delim + 1
} else {
0
}
}
}
#[cfg(test)]
mod test {
use super::*;
#[test]
fn test_words() {
let s = "";
let mut words = Words::from(s);
assert_eq!(words.next(), None);
let s = "吾輩/名詞\tは/助詞\t\t猫/名詞\t /補助記号";
let mut words = Words::from(s);
assert_eq!(words.next(), Some(Word::from("吾輩/名詞")));
assert_eq!(words.next(), Some(Word::from("は/助詞")));
assert_eq!(words.next(), Some(Word::from("猫/名詞")));
assert_eq!(words.next(), Some(Word::from(" /補助記号")));
assert_eq!(words.next(), None);
let s = "ab\t\\\t/補助記号\t\\/\\\t\t\\\\\\\t/\\\\\t";
let mut words = Words::from(s);
assert_eq!(words.next(), Some(Word::from("ab")));
assert_eq!(words.next(), Some(Word::from("\\\t/補助記号")));
assert_eq!(words.next(), Some(Word::from("\\/\\\t")));
assert_eq!(words.next(), Some(Word::from("\\\\\\\t/\\\\")));
assert_eq!(words.next(), None);
}
#[test]
fn test_words_rev() {
let s = "";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), None);
let s = "吾輩/名詞\tは/助詞\t\t猫/名詞\t /補助記号";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from(" /補助 | Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("a")));
assert_eq!(words.next(), Some(Word::from("\\\\")));
assert_eq!(words.next(), None);
}
#[test]
fn test_words_mixed() {
let s = "吾輩/名詞\tは/助詞\t\t猫/名詞\t /補助記号";
let mut words = Words::from(s);
assert_eq!(words.next(), Some(Word::from("吾輩/名詞")));
assert_eq!(words.next_back(), Some(Word::from(" /補助記号")));
assert_eq!(words.next(), Some(Word::from("は/助詞")));
assert_eq!(words.next_back(), Some(Word::from("猫/名詞")));
assert_eq!(words.next(), None);
assert_eq!(words.next_back(), None);
}
}
| 記号")));
assert_eq!(words.next(), Some(Word::from("猫/名詞")));
assert_eq!(words.next(), Some(Word::from("は/助詞")));
assert_eq!(words.next(), Some(Word::from("吾輩/名詞")));
assert_eq!(words.next(), None);
let s = "\t\tab\t\\\t/補助記号\t\\/\\\t\t\\\\\\\t/\\\\\t";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("\\\\\\\t/\\\\")));
assert_eq!(words.next(), Some(Word::from("\\/\\\t")));
assert_eq!(words.next(), Some(Word::from("\\\t/補助記号")));
assert_eq!(words.next(), Some(Word::from("ab")));
assert_eq!(words.next(), None);
let s = "\ta";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("a")));
assert_eq!(words.next(), None);
let s = "\\\ta";
let mut words = Words::from(s).rev();
assert_eq!(words.next(), Some(Word::from("\\\ta")));
assert_eq!(words.next(), None);
let s = "\\\\\ta";
let mut words = | random | [
{
"content": "type WordsFrom<'a> = fn(&'a str) -> Words<'a>;\n",
"file_path": "src/tokenizer/mod.rs",
"rank": 0,
"score": 100778.44098460334
},
{
"content": "pub fn strip(out: impl AsRef<str>) -> String {\n\n let mut stripped = String::new();\n\n\n\n for line in out.as_ref().lines() {\... |
Rust | src/auth.rs | FamiizCEO/modio-rs | 101460ef3ba1c197025ba80cd01568defbc2d7e9 |
use std::fmt;
use futures::Future as StdFuture;
use url::form_urlencoded;
use crate::Future;
use crate::Modio;
use crate::ModioMessage;
#[derive(Clone, Debug, PartialEq)]
pub enum Credentials {
ApiKey(String),
Token(String),
}
impl fmt::Display for Credentials {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Credentials::ApiKey(key) => f.write_str(&key),
Credentials::Token(token) => f.write_str(&token),
}
}
}
pub enum Service {
Steam(u64),
Gog(u64),
}
pub struct Auth {
modio: Modio,
}
#[derive(Deserialize)]
struct AccessToken {
access_token: String,
}
impl Auth {
pub(crate) fn new(modio: Modio) -> Self {
Self { modio }
}
pub fn request_code(&self, email: &str) -> Future<()> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("email", email)
.finish();
Box::new(
self.modio
.post::<ModioMessage, _>("/oauth/emailrequest", data)
.map(|_| ()),
)
}
pub fn security_code(&self, code: &str) -> Future<Credentials> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("security_code", code)
.finish();
Box::new(
self.modio
.post::<AccessToken, _>("/oauth/emailexchange", data)
.map(|token| Credentials::Token(token.access_token)),
)
}
pub fn link(&self, email: &str, service: Service) -> Future<()> {
token_required!(self.modio);
let (service, id) = match service {
Service::Steam(id) => ("steam", id.to_string()),
Service::Gog(id) => ("gog", id.to_string()),
};
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("email", email)
.append_pair("service", service)
.append_pair("service_id", &id)
.finish();
Box::new(
self.modio
.post::<ModioMessage, _>("/external/link", data)
.map(|_| ()),
)
}
pub fn gog_auth(&self, ticket: &str) -> Future<Credentials> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("appdata", ticket)
.finish();
Box::new(
self.modio
.post::<AccessToken, _>("/external/galaxyauth", data)
.map(|token| Credentials::Token(token.access_token)),
)
}
pub fn steam_auth(&self, ticket: &str) -> Future<Credentials> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("appdata", ticket)
.finish();
Box::new(
self.modio
.post::<AccessToken, _>("/external/steamauth", data)
.map(|token| Credentials::Token(token.access_token)),
)
}
}
|
use std::fmt;
use futures::Future as StdFuture;
use url::form_urlencoded;
use crate::Future;
use crate::Modio;
use crate::ModioMessage;
#[derive(Clone, Debug, PartialEq)]
pub enum Credentials {
ApiKey(String),
Token(String),
}
impl fmt::Display for Credentials {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
match self {
Credentials::ApiKey(key) => f.write_str(&key),
Credentials::Token(token) => f.write_str(&token),
}
}
}
pub enum Service {
Steam(u64),
Gog(u64),
}
pub struct Auth {
modio: Modio,
}
#[derive(Deserialize)]
struct AccessToken {
access_token: String,
}
impl Auth {
pub(crate) fn new(modio: Modio) -> Self {
Self { modio }
}
pub fn request_code(&self, email: &str) -> Future<()> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("email", email)
.finish();
Box::new(
self.modio
.post::<ModioMessage, _>("/oauth/emailrequest", data)
.map(|_| ()),
)
}
|
pub fn link(&self, email: &str, service: Service) -> Future<()> {
token_required!(self.modio);
let (service, id) = match service {
Service::Steam(id) => ("steam", id.to_string()),
Service::Gog(id) => ("gog", id.to_string()),
};
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("email", email)
.append_pair("service", service)
.append_pair("service_id", &id)
.finish();
Box::new(
self.modio
.post::<ModioMessage, _>("/external/link", data)
.map(|_| ()),
)
}
pub fn gog_auth(&self, ticket: &str) -> Future<Credentials> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("appdata", ticket)
.finish();
Box::new(
self.modio
.post::<AccessToken, _>("/external/galaxyauth", data)
.map(|token| Credentials::Token(token.access_token)),
)
}
pub fn steam_auth(&self, ticket: &str) -> Future<Credentials> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("appdata", ticket)
.finish();
Box::new(
self.modio
.post::<AccessToken, _>("/external/steamauth", data)
.map(|token| Credentials::Token(token.access_token)),
)
}
}
| pub fn security_code(&self, code: &str) -> Future<Credentials> {
apikey_required!(self.modio);
let data = form_urlencoded::Serializer::new(String::new())
.append_pair("security_code", code)
.finish();
Box::new(
self.modio
.post::<AccessToken, _>("/oauth/emailexchange", data)
.map(|token| Credentials::Token(token.access_token)),
)
} | function_block-full_function | [
{
"content": "fn prompt(prompt: &str) -> io::Result<String> {\n\n print!(\"{}\", prompt);\n\n io::stdout().flush()?;\n\n let mut buffer = String::new();\n\n io::stdin().read_line(&mut buffer)?;\n\n Ok(buffer.trim().to_string())\n\n}\n\n\n",
"file_path": "examples/auth.rs",
"rank": 0,
... |
Rust | kg-syntax/src/lexer/nfa.rs | kodegenix/kg-lang | baa79ac7fb8babe82b6b8eed2af34d869523d8f4 | use super::*;
#[derive(Debug, Clone)]
pub struct Nfa {
states: Vec<State>,
}
impl Nfa {
pub fn from_program(prog: &Program) -> Nfa {
Builder::new().build(prog)
}
pub fn states(&self) -> &[State] {
&self.states
}
}
impl std::fmt::Display for Nfa {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
for (i, s) in self.states.iter().enumerate() {
write!(f, "({:4}): {}", i, s)?;
}
Ok(())
}
}
#[derive(Debug, Clone)]
pub struct State {
edges: Vec<Edge>,
accept: Option<Accept>,
}
impl State {
fn from(state: StateEx) -> State {
debug_assert!(state.accepts.len() <= 1);
debug_assert!(state.edges.len() > 0 || state.accepts.len() == 1);
State {
edges: state.edges,
accept: state.accepts.get(0).cloned(),
}
}
pub fn edges(&self) -> &[Edge] {
&self.edges
}
pub fn accept(&self) -> Option<Accept> {
self.accept
}
}
impl std::fmt::Display for State {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
if let Some(a) = self.accept {
write!(f, "{}\n", a)?;
} else {
write!(f, "\n")?;
}
if self.edges.is_empty() {
write!(f, " -\n")?;
} else {
for e in self.edges.iter() {
write!(f, " {}\n", e)?;
}
}
Ok(())
}
}
struct Builder {
states: Vec<StateEx>,
}
impl Builder {
fn new() -> Builder {
Builder {
states: Vec::new(),
}
}
fn merge_epsilon_states(&mut self, prog: &Program) {
fn resolve_edges(pc: u32, edges: &mut SparseSet<u32>, prog: &Program, level: usize) {
debug_assert!(level < prog.code().len());
if let Opcode::Split(g1, g2) = *prog.opcode(pc) {
resolve_edges(g1, edges, prog, level + 1);
resolve_edges(g2, edges, prog, level + 1);
} else {
edges.insert(pc);
}
}
fn add_code(state: &mut StateEx, pc: u32, edges: &HashMap<u32, SparseSet<u32>>, prog: &Program, nested: bool) {
debug_assert!(!state.merged_states.contains(&pc));
match *prog.opcode(pc) {
Opcode::Match(m) => {
state.accepts.push(Accept::new(pc, m));
state.merged_states.insert(pc);
}
Opcode::Byte(g, b) => {
state.edges.push(Edge::new(b, g));
state.merged_states.insert(pc);
}
Opcode::Range(g, a, b) => {
for i in a..=b {
state.edges.push(Edge::new(i, g));
}
state.merged_states.insert(pc);
}
Opcode::Mask(g, m) => {
let m = prog.mask(m);
for i in m.iter() {
state.edges.push(Edge::new(i, g));
}
state.merged_states.insert(pc);
}
Opcode::Split(..) => {
debug_assert!(!nested);
for s in edges.get(&pc).unwrap().iter().cloned() {
add_code(state, s, edges, prog, true);
}
}
}
}
let mut edge_map: HashMap<u32, SparseSet<u32>> = HashMap::with_capacity(prog.code().len());
for pc in 0..prog.code().len() as u32 {
if let Opcode::Split(..) = prog.opcode(pc) {
let mut e = SparseSet::with_capacity(prog.code().len());
resolve_edges(pc, &mut e, prog, 0);
edge_map.insert(pc, e);
}
}
let mut state_map = vec![EMPTY_GOTO; prog.code().len()];
let mut states: Vec<StateEx> = Vec::with_capacity(prog.code().len());
let mut pc = 0;
let mut done = false;
while !done {
let mut state = StateEx::new(prog.code().len());
add_code(&mut state, pc, &edge_map, prog, false);
let mut found = false;
for (i, s) in states.iter().enumerate() {
if *s == state {
state_map[pc as usize] = i as u32;
found = true;
break;
}
}
if !found {
state_map[pc as usize] = states.len() as u32;
states.push(state);
}
done = true;
'search_loop:
for s in states.iter() {
for e in s.edges.iter().cloned() {
if state_map[e.state() as usize] == EMPTY_GOTO {
pc = e.state();
done = false;
break 'search_loop;
}
}
}
}
for s in states.iter_mut() {
for e in s.edges.iter_mut() {
let t = state_map[e.state() as usize];
debug_assert_ne!(t, EMPTY_GOTO);
*e = Edge::new(e.value(), t);
}
}
self.states = states;
}
fn build(mut self, prog: &Program) -> Nfa {
self.merge_epsilon_states(prog);
let mut states = Vec::with_capacity(self.states.len());
for state in self.states {
debug_assert!(state.accepts.len() <= 1);
states.push(State::from(state));
}
Nfa {
states
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test1() {
let re = Regex::parse("aa*bb+|bb").unwrap();
let p = Program::from_regex(&re, 1);
println!("{}", p);
println!("{}", Nfa::from_program(&p));
}
}
| use super::*;
#[derive(Debug, Clone)]
pub struct Nfa {
states: Vec<State>,
}
impl Nfa {
pub fn from_program(prog: &Program) -> Nfa {
Builder::new().build(prog)
}
pub fn states(&self) -> &[State] {
&self.states
}
}
impl std::fmt::Display for Nfa {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
for (i, s) in self.states.iter().enumerate() {
write!(f, "({:4}): {}", i, s)?;
}
Ok(())
}
}
#[derive(Debug, Clone)]
pub struct State {
edges: Vec<Edge>,
accept: Option<Accept>,
}
impl State {
fn from(state: StateEx) -> State {
debug_assert!(state.accepts.len() <= 1);
debug_assert!(state.edges.len() > 0 || state.accepts.len() == 1);
State {
edges: state.edges,
accept: state.accepts.get(0).cloned(),
}
}
pub fn edges(&self) -> &[Edge] {
&self.edges
}
pub fn accept(&self) -> Option<Accept> {
self.accept
}
}
impl std::fmt::Display for State {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
if let Some(a) = self.accept {
write!(f, "{}\n", a)?;
} else {
write!(f, "\n")?;
}
if self.edges.is_empty() {
write!(f, " -\n")?;
} else {
for e in self.edges.iter() {
write!(f, " {}\n", e)?;
}
}
Ok(())
}
}
struct Builder {
states: Vec<StateEx>,
}
impl Builder {
fn new() -> Builder {
Builder {
states: Vec::new(),
}
}
fn merge_epsilon_states(&mut self, prog: &Program) {
fn resolve_edges(pc: u32, edges: &mut SparseSet<u32>, prog: &Program, level: usize) {
debug_assert!(level < prog.code().len());
if let Opcode::Split(g1, g2) = *prog.opcode(pc) {
resolve_edges(g1, edges, prog, level + 1);
resolve_edges(g2, edges, prog, level + 1);
} else {
edges.insert(pc);
}
}
fn add_code(state: &mut StateEx, pc: u32, edges: &HashMap<u32, SparseSet<u32>>, prog: &Program, nested: | ates.iter().enumerate() {
if *s == state {
state_map[pc as usize] = i as u32;
found = true;
break;
}
}
if !found {
state_map[pc as usize] = states.len() as u32;
states.push(state);
}
done = true;
'search_loop:
for s in states.iter() {
for e in s.edges.iter().cloned() {
if state_map[e.state() as usize] == EMPTY_GOTO {
pc = e.state();
done = false;
break 'search_loop;
}
}
}
}
for s in states.iter_mut() {
for e in s.edges.iter_mut() {
let t = state_map[e.state() as usize];
debug_assert_ne!(t, EMPTY_GOTO);
*e = Edge::new(e.value(), t);
}
}
self.states = states;
}
fn build(mut self, prog: &Program) -> Nfa {
self.merge_epsilon_states(prog);
let mut states = Vec::with_capacity(self.states.len());
for state in self.states {
debug_assert!(state.accepts.len() <= 1);
states.push(State::from(state));
}
Nfa {
states
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test1() {
let re = Regex::parse("aa*bb+|bb").unwrap();
let p = Program::from_regex(&re, 1);
println!("{}", p);
println!("{}", Nfa::from_program(&p));
}
}
| bool) {
debug_assert!(!state.merged_states.contains(&pc));
match *prog.opcode(pc) {
Opcode::Match(m) => {
state.accepts.push(Accept::new(pc, m));
state.merged_states.insert(pc);
}
Opcode::Byte(g, b) => {
state.edges.push(Edge::new(b, g));
state.merged_states.insert(pc);
}
Opcode::Range(g, a, b) => {
for i in a..=b {
state.edges.push(Edge::new(i, g));
}
state.merged_states.insert(pc);
}
Opcode::Mask(g, m) => {
let m = prog.mask(m);
for i in m.iter() {
state.edges.push(Edge::new(i, g));
}
state.merged_states.insert(pc);
}
Opcode::Split(..) => {
debug_assert!(!nested);
for s in edges.get(&pc).unwrap().iter().cloned() {
add_code(state, s, edges, prog, true);
}
}
}
}
let mut edge_map: HashMap<u32, SparseSet<u32>> = HashMap::with_capacity(prog.code().len());
for pc in 0..prog.code().len() as u32 {
if let Opcode::Split(..) = prog.opcode(pc) {
let mut e = SparseSet::with_capacity(prog.code().len());
resolve_edges(pc, &mut e, prog, 0);
edge_map.insert(pc, e);
}
}
let mut state_map = vec![EMPTY_GOTO; prog.code().len()];
let mut states: Vec<StateEx> = Vec::with_capacity(prog.code().len());
let mut pc = 0;
let mut done = false;
while !done {
let mut state = StateEx::new(prog.code().len());
add_code(&mut state, pc, &edge_map, prog, false);
let mut found = false;
for (i, s) in st | function_block-random_span | [
{
"content": "#[derive(Debug, Clone, Copy)]\n\nstruct Proc(u32, u32);\n\n\n\nimpl Proc {\n\n fn is_empty(&self) -> bool {\n\n self.0 == EMPTY_GOTO\n\n }\n\n\n\n fn merge(&mut self, p: Proc) -> Proc {\n\n if self.is_empty() {\n\n *self = p;\n\n } else if !p.is_empty() {\n... |
Rust | src/oneshot/timer_fd.rs | krircc/async-timer | c2cb75ab1d4624e8af280a1cdf8c3aa9f41f27bd |
#[cfg(feature = "no_std")]
core::compile_error!("no_std is not supported for timerfd implementation");
use crate::std::io;
use core::future::Future;
use core::pin::Pin;
use core::{mem, ptr, task, time};
use libc::c_int;
#[cfg(target_os = "android")]
mod sys {
#[repr(C)]
pub struct itimerspec {
pub it_interval: libc::timespec,
pub it_value: libc::timespec,
}
extern "C" {
pub fn timerfd_create(clockid: libc::clockid_t, flags: libc::c_int) -> libc::c_int;
pub fn timerfd_settime(timerid: libc::c_int, flags: libc::c_int, new_value: *const itimerspec, old_value: *mut itimerspec) -> libc::c_int;
}
pub const TFD_NONBLOCK: libc::c_int = libc::O_NONBLOCK;
}
#[cfg(not(target_os = "android"))]
use libc as sys;
struct RawTimer(c_int);
impl RawTimer {
fn new() -> Self {
let fd = unsafe { sys::timerfd_create(libc::CLOCK_MONOTONIC, sys::TFD_NONBLOCK) };
os_assert!(fd != -1);
Self(fd)
}
fn set(&self, timer: sys::itimerspec) {
let ret = unsafe { sys::timerfd_settime(self.0, 0, &timer, ptr::null_mut()) };
os_assert!(ret != -1);
}
fn read(&self) -> usize {
let mut read_num = 0u64;
match unsafe { libc::read(self.0, &mut read_num as *mut u64 as *mut _, 8) } {
-1 => {
let error = io::Error::last_os_error();
match error.kind() {
io::ErrorKind::WouldBlock => 0,
_ => panic!("Unexpected read error: {}", error),
}
}
_ => read_num as usize,
}
}
}
impl mio::Evented for RawTimer {
fn register(&self, poll: &mio::Poll, token: mio::Token, interest: mio::Ready, opts: mio::PollOpt) -> io::Result<()> {
mio::unix::EventedFd(&self.0).register(poll, token, interest, opts)
}
fn reregister(&self, poll: &mio::Poll, token: mio::Token, interest: mio::Ready, opts: mio::PollOpt) -> io::Result<()> {
mio::unix::EventedFd(&self.0).reregister(poll, token, interest, opts)
}
fn deregister(&self, poll: &mio::Poll) -> io::Result<()> {
mio::unix::EventedFd(&self.0).deregister(poll)
}
}
impl Drop for RawTimer {
fn drop(&mut self) {
unsafe { libc::close(self.0) };
}
}
enum State {
Init(time::Duration),
Running(bool),
}
fn set_timer_value(fd: &RawTimer, timeout: time::Duration) {
#[cfg(not(target_pointer_width = "64"))]
use core::convert::TryFrom;
let it_value = libc::timespec {
tv_sec: timeout.as_secs() as libc::time_t,
#[cfg(target_pointer_width = "64")]
tv_nsec: libc::suseconds_t::from(timeout.subsec_nanos()),
#[cfg(not(target_pointer_width = "64"))]
tv_nsec: libc::suseconds_t::try_from(timeout.subsec_nanos()).unwrap_or(libc::suseconds_t::max_value()),
};
let new_value = sys::itimerspec {
it_interval: unsafe { mem::zeroed() },
it_value,
};
fd.set(new_value);
}
pub struct TimerFd {
fd: tokio::io::PollEvented<RawTimer>,
state: State,
}
impl super::Oneshot for TimerFd {
fn new(timeout: time::Duration) -> Self {
debug_assert!(!(timeout.as_secs() == 0 && timeout.subsec_nanos() == 0), "Zero timeout makes no sense");
Self {
fd: tokio::io::PollEvented::new(RawTimer::new()).expect("To create PollEvented"),
state: State::Init(timeout),
}
}
fn is_ticking(&self) -> bool {
match &self.state {
State::Init(_) => false,
State::Running(is_finished) => !*is_finished,
}
}
fn is_expired(&self) -> bool {
match &self.state {
State::Init(_) => false,
State::Running(is_finished) => *is_finished,
}
}
fn cancel(&mut self) {
self.fd.get_mut().set(unsafe { mem::zeroed() });
}
fn restart(&mut self, new_value: time::Duration, _: &task::Waker) {
debug_assert!(!(new_value.as_secs() == 0 && new_value.subsec_nanos() == 0), "Zero timeout makes no sense");
match &mut self.state {
State::Init(ref mut timeout) => {
*timeout = new_value;
}
State::Running(ref mut is_finished) => {
*is_finished = false;
set_timer_value(&self.fd.get_ref(), new_value);
}
}
}
}
impl Future for TimerFd {
type Output = ();
fn poll(mut self: Pin<&mut Self>, ctx: &mut task::Context) -> task::Poll<Self::Output> {
loop {
self.state = match &self.state {
State::Init(ref timeout) => {
set_timer_value(self.fd.get_ref(), *timeout);
State::Running(false)
}
State::Running(false) => {
match Pin::new(&mut self.fd).poll_read_ready(ctx, mio::Ready::readable()) {
task::Poll::Pending => return task::Poll::Pending,
task::Poll::Ready(ready) => match ready.map(|ready| ready.is_readable()).expect("timerfd cannot be ready") {
true => {
let _ = Pin::new(&mut self.fd).clear_read_ready(ctx, mio::Ready::readable());
match self.fd.get_mut().read() {
0 => return task::Poll::Pending,
_ => return task::Poll::Ready(()),
}
}
false => return task::Poll::Pending,
},
}
}
State::Running(true) => return task::Poll::Ready(()),
}
}
}
}
|
#[cfg(feature = "no_std")]
core::compile_error!("no_std is not supported for timerfd implementation");
use crate::std::io;
use core::future::Future;
use core::pin::Pin;
use core::{mem, ptr, task, time};
use libc::c_int;
#[cfg(target_os = "android")]
mod sys {
#[repr(C)]
pub struct itimerspec {
pub it_interval: libc::timespec,
pub it_value: libc::timespec,
}
extern "C" {
pub fn timerfd_create(clockid: libc::clockid_t, flags: libc::c_int) -> libc::c_int;
pub fn timerfd_settime(timerid: libc::c_int, flags: libc::c_int, new_value: *const itimerspec, old_value: *mut itimerspec) -> libc::c_int;
}
pub const TFD_NONBLOCK: libc::c_int = libc::O_NONBLOCK;
}
#[cfg(not(target_os = "android"))]
use libc as sys;
struct RawTimer(c_int);
impl RawTimer {
fn new() -> Self {
let fd = unsafe { sys::timerfd_create(libc::CLOCK_MONOTONIC, sys::TFD_NONBLOCK) };
os_assert!(fd != -1);
Self(fd)
}
fn set(&self, timer: sys::itimerspec) {
let ret = unsafe { sys::timerfd_settime(self.0, 0, &timer, ptr::null_mut()) };
os_assert!(ret != -1);
}
fn read(&self) -> usize {
let mut read_num = 0u64;
match unsafe { libc::read(self.0, &mut read_num as *mut u64 as *mut _, 8) } {
-1 => {
let error = io::Error::last_os_error();
match error.kind() {
io::ErrorKind::WouldBlock => 0,
_ => panic!("Unexpected read error: {}", error),
}
}
_ => read_num as usize,
}
}
}
impl mio::Evented for RawTimer {
fn register(&self, poll: &mio::Poll, token: mio::Token, interest: mio::Ready, opts: mio::PollOpt) -> io::Result<()> {
mio::unix::EventedFd(&self.0).register(poll, token, interest, opts)
}
fn reregister(&self, poll: &mio::Poll, token: mio::Token, interest: mio::Ready, opts: mio::PollOpt) -> io::Result<()> {
mio::unix::EventedFd(&self.0).reregister(poll, token, interest, opts)
}
fn deregister(&self, poll: &mio::Poll) -> io::Result<()> {
mio::unix::EventedFd(&self.0).deregister(poll)
}
}
impl Drop for RawTimer {
fn drop(&mut self) {
unsafe { libc::close(self.0) };
}
}
enum State {
Init(time::Duration),
Running(bool),
}
fn set_timer_value(fd: &RawTimer, timeout: time::Duration) {
#[cfg(not(target_pointer_width = "64"))]
use core::convert::TryFrom;
let it_value = libc::timespec {
tv_sec: timeout.as_secs() as libc::time_t,
#[cfg(target_pointer_width = "64")]
tv_nsec: libc::suseconds_t::from(timeout.subsec_nanos()),
#[cfg(not(target_pointer_width = "64"))]
tv_nsec: libc::suseconds_t::try_from(timeout.subsec_nanos()).unwrap_or(libc::suseconds_t::max_value()),
};
let new_value = sys::itimerspec {
it_interval: unsafe { mem::zeroed() },
it_value,
};
fd.set(new_value);
}
pub struct TimerFd {
fd: tokio::io::PollEvented<RawTimer>,
state: State,
}
impl super::Oneshot for TimerFd {
fn new(timeout: time::Duration) -> Self {
debug_assert!(!(timeout.as_secs() == 0 && timeout.subsec_nanos() == 0), "Zero timeout makes no sense");
Self {
fd: tokio::io::PollEvented::new(RawTimer::new()).expect("To create PollEvented"),
state: State::Init(timeout),
}
}
fn is_ticking(&self) -> bool {
|
fn is_expired(&self) -> bool {
match &self.state {
State::Init(_) => false,
State::Running(is_finished) => *is_finished,
}
}
fn cancel(&mut self) {
self.fd.get_mut().set(unsafe { mem::zeroed() });
}
fn restart(&mut self, new_value: time::Duration, _: &task::Waker) {
debug_assert!(!(new_value.as_secs() == 0 && new_value.subsec_nanos() == 0), "Zero timeout makes no sense");
match &mut self.state {
State::Init(ref mut timeout) => {
*timeout = new_value;
}
State::Running(ref mut is_finished) => {
*is_finished = false;
set_timer_value(&self.fd.get_ref(), new_value);
}
}
}
}
impl Future for TimerFd {
type Output = ();
fn poll(mut self: Pin<&mut Self>, ctx: &mut task::Context) -> task::Poll<Self::Output> {
loop {
self.state = match &self.state {
State::Init(ref timeout) => {
set_timer_value(self.fd.get_ref(), *timeout);
State::Running(false)
}
State::Running(false) => {
match Pin::new(&mut self.fd).poll_read_ready(ctx, mio::Ready::readable()) {
task::Poll::Pending => return task::Poll::Pending,
task::Poll::Ready(ready) => match ready.map(|ready| ready.is_readable()).expect("timerfd cannot be ready") {
true => {
let _ = Pin::new(&mut self.fd).clear_read_ready(ctx, mio::Ready::readable());
match self.fd.get_mut().read() {
0 => return task::Poll::Pending,
_ => return task::Poll::Ready(()),
}
}
false => return task::Poll::Pending,
},
}
}
State::Running(true) => return task::Poll::Ready(()),
}
}
}
}
| match &self.state {
State::Init(_) => false,
State::Running(is_finished) => !*is_finished,
}
} | function_block-function_prefix_line | [
{
"content": "fn time_create(timeout: time::Duration, state: *const TimerState) -> TimerHandle {\n\n let timeout = timeout.as_millis() as u32;\n\n\n\n let cb = wasm_bindgen::closure::Closure::once(move || unsafe {\n\n (*state).wake();\n\n });\n\n let handle = setTimeout(&cb, timeout);\n\n\n\n... |
Rust | src/ingester/ingester.rs | pathivu/pathivu | 09ac381630dceb578b8abc39a67030c521e404ce | /*
* Copyright 2019 Balaji Jinnah and Contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
use crate::config::config::Config;
use crate::partition::segment_writer::SegmentWriter;
use crate::store::store::Store;
use crate::types::types::*;
use futures::channel::mpsc::{Receiver, Sender};
use futures::executor::block_on;
use futures::sink::SinkExt;
use futures::stream::StreamExt;
use log::{debug, info, warn};
use retain_mut::RetainMut;
use rmp_serde::Deserializer;
use serde::Deserialize;
use std::collections::HashMap;
use tonic::Status;
pub struct Ingester<S: Store> {
receiver: Receiver<IngesterRequest>,
id: u8,
segment_writers: HashMap<String, SegmentWriter<S>>,
cfg: Config,
store: S,
tailers: HashMap<String, Vec<Sender<Result<api::QueryResponse, Status>>>>,
}
impl<S: Store + Clone> Ingester<S> {
pub fn new(receiver: Receiver<IngesterRequest>, cfg: Config, store: S) -> Ingester<S> {
Ingester {
receiver: receiver,
id: 0,
segment_writers: HashMap::new(),
cfg: cfg,
store: store,
tailers: HashMap::default(),
}
}
pub fn start(&mut self) {
info!("ingester {} started", self.id);
loop {
let ingester_request = block_on(async { self.receiver.next().await });
info!("received yo");
if !ingester_request.is_some() {
continue;
}
let ingester_request = ingester_request.unwrap();
match ingester_request {
IngesterRequest::Push(req) => {
self.handle_tailers(&req);
let result = self.push(req.push_request);
info!(" result {:?}", result);
match req.complete_signal.send(result) {
Err(e) => {
warn!(
"unable to complete the signal for the ingester {}: {:?}",
self.id, e
);
}
_ => {}
}
}
IngesterRequest::Flush(hint) => {
let result = self.flush_if_necessary(hint.app, hint.start_ts, hint.end_ts);
match hint.complete_signal.send(result) {
Err(e) => warn!(
"unable to send complete signal for ingester necessary flush {:?}",
e
),
_ => debug!("ingester necessary flush signal sent successfully"),
}
}
IngesterRequest::RegisterTailer(req) => {
self.register_tailer(req);
}
}
}
}
fn flush_if_necessary(
&mut self,
partition: String,
start_ts: u64,
end_ts: u64,
) -> Result<(), failure::Error> {
if let Some(writer) = self.segment_writers.get_mut(&partition) {
let (segment_start_ts, segment_end_ts) = writer.segment_ts();
if (segment_start_ts >= start_ts && segment_start_ts <= end_ts)
|| (segment_end_ts >= start_ts && segment_end_ts <= start_ts)
|| (start_ts == 0 && end_ts == 0)
{
let segment_writer = self.segment_writers.remove(&partition).unwrap();
segment_writer.close()?;
debug!("flushing writer {} for hint", partition);
}
}
Ok(())
}
fn push(&mut self, req: api::PushRequest) -> Result<(), failure::Error> {
if req.lines.len() == 0 {
return Ok(());
}
debug!(
"ingesting partition {}, with {} lines",
req.source,
req.lines.len()
);
let ref mut segment_writer: SegmentWriter<S>;
if let Some(writer) = self.segment_writers.get_mut(&req.source) {
segment_writer = writer;
info!("writer is thre");
} else {
info!("writer not there");
let writer = self.create_segment_writer(&req.source, req.lines[0].ts)?;
info!("inserting yo");
self.segment_writers.insert(req.source.clone(), writer);
segment_writer = self.segment_writers.get_mut(&req.source).unwrap();
}
segment_writer.push(req.lines)?;
if self.cfg.max_segment_size <= segment_writer.size()
{
let segment_writer = self.segment_writers.remove(&req.source).unwrap();
segment_writer.close()?;
}
info!("segment writers {:}", &self.segment_writers.len());
Ok(())
}
fn create_segment_writer(
&self,
partition: &String,
start_ts: u64,
) -> Result<SegmentWriter<S>, failure::Error> {
let segment_id: u64;
let partition_registry = self
.store
.get(format!("{}_{}", PARTITION_PREFIX, partition).as_bytes())?;
match partition_registry {
Some(registry) => {
let mut buf = Deserializer::new(®istry[..]);
let registry: PartitionRegistry = Deserialize::deserialize(&mut buf)?;
segment_id = registry.last_assigned + 1;
}
None => segment_id = 1,
}
SegmentWriter::new(
self.cfg.clone(),
partition.clone(),
segment_id,
self.store.clone(),
start_ts,
)
}
fn register_tailer(&mut self, mut req: TailerRequest) {
let mut push_tailer =
|key: String, tailer: Sender<Result<api::QueryResponse, Status>>| match self
.tailers
.get_mut(&key)
{
Some(tailers) => tailers.push(tailer),
None => {
self.tailers.insert(key, vec![tailer]);
}
};
if req.partitions.len() == 0 {
push_tailer(String::from("*"), req.sender);
return;
}
for partition in req.partitions.drain(..) {
push_tailer(partition, req.sender.clone());
}
}
fn handle_tailers(&mut self, req: &IngesterPush) {
let send_logs = |tailers: Option<&mut Vec<Sender<Result<api::QueryResponse, Status>>>>| {
if let Some(tailers) = tailers {
tailers.retain_mut(|tailer| {
let mut lines = Vec::new();
for log_line in req.push_request.lines.iter() {
lines.push(api::LogLine {
app: req.push_request.source.clone(),
inner: String::from_utf8(log_line.raw_data.clone()).unwrap(),
ts: log_line.ts,
structured: log_line.structured,
});
}
match block_on(async {
tailer
.send(Ok(api::QueryResponse {
lines: lines,
json: String::from(""),
}))
.await
}) {
Ok(_) => true,
Err(_) => {
println!("removing tailer");
return false;
}
}
});
}
};
let tailers = self.tailers.get_mut("*");
send_logs(tailers);
let tailers = self.tailers.get_mut(&req.push_request.source);
send_logs(tailers);
}
}
| /*
* Copyright 2019 Balaji Jinnah and Contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
use crate::config::config::Config;
use crate::partition::segment_writer::SegmentWriter;
use crate::store::store::Store;
use crate::types::types::*;
use futures::channel::mpsc::{Receiver, Sender};
use futures::executor::block_on;
use futures::sink::SinkExt;
use futures::stream::StreamExt;
use log::{debug, info, warn};
use retain_mut::RetainMut;
use rmp_serde::Deserializer;
use serde::Deserialize;
use std::collections::HashMap;
use tonic::Status;
pub struct Ingester<S: Store> {
receiver: Receiver<IngesterRequest>,
id: u8,
segment_writers: HashMap<String, SegmentWriter<S>>,
cfg: Config,
store: S,
tailers: HashMap<String, Vec<Sender<Result<api::QueryResponse, Status>>>>,
}
impl<S: Store + Clone> Ingester<S> {
|
pub fn start(&mut self) {
info!("ingester {} started", self.id);
loop {
let ingester_request = block_on(async { self.receiver.next().await });
info!("received yo");
if !ingester_request.is_some() {
continue;
}
let ingester_request = ingester_request.unwrap();
match ingester_request {
IngesterRequest::Push(req) => {
self.handle_tailers(&req);
let result = self.push(req.push_request);
info!(" result {:?}", result);
match req.complete_signal.send(result) {
Err(e) => {
warn!(
"unable to complete the signal for the ingester {}: {:?}",
self.id, e
);
}
_ => {}
}
}
IngesterRequest::Flush(hint) => {
let result = self.flush_if_necessary(hint.app, hint.start_ts, hint.end_ts);
match hint.complete_signal.send(result) {
Err(e) => warn!(
"unable to send complete signal for ingester necessary flush {:?}",
e
),
_ => debug!("ingester necessary flush signal sent successfully"),
}
}
IngesterRequest::RegisterTailer(req) => {
self.register_tailer(req);
}
}
}
}
fn flush_if_necessary(
&mut self,
partition: String,
start_ts: u64,
end_ts: u64,
) -> Result<(), failure::Error> {
if let Some(writer) = self.segment_writers.get_mut(&partition) {
let (segment_start_ts, segment_end_ts) = writer.segment_ts();
if (segment_start_ts >= start_ts && segment_start_ts <= end_ts)
|| (segment_end_ts >= start_ts && segment_end_ts <= start_ts)
|| (start_ts == 0 && end_ts == 0)
{
let segment_writer = self.segment_writers.remove(&partition).unwrap();
segment_writer.close()?;
debug!("flushing writer {} for hint", partition);
}
}
Ok(())
}
fn push(&mut self, req: api::PushRequest) -> Result<(), failure::Error> {
if req.lines.len() == 0 {
return Ok(());
}
debug!(
"ingesting partition {}, with {} lines",
req.source,
req.lines.len()
);
let ref mut segment_writer: SegmentWriter<S>;
if let Some(writer) = self.segment_writers.get_mut(&req.source) {
segment_writer = writer;
info!("writer is thre");
} else {
info!("writer not there");
let writer = self.create_segment_writer(&req.source, req.lines[0].ts)?;
info!("inserting yo");
self.segment_writers.insert(req.source.clone(), writer);
segment_writer = self.segment_writers.get_mut(&req.source).unwrap();
}
segment_writer.push(req.lines)?;
if self.cfg.max_segment_size <= segment_writer.size()
{
let segment_writer = self.segment_writers.remove(&req.source).unwrap();
segment_writer.close()?;
}
info!("segment writers {:}", &self.segment_writers.len());
Ok(())
}
fn create_segment_writer(
&self,
partition: &String,
start_ts: u64,
) -> Result<SegmentWriter<S>, failure::Error> {
let segment_id: u64;
let partition_registry = self
.store
.get(format!("{}_{}", PARTITION_PREFIX, partition).as_bytes())?;
match partition_registry {
Some(registry) => {
let mut buf = Deserializer::new(®istry[..]);
let registry: PartitionRegistry = Deserialize::deserialize(&mut buf)?;
segment_id = registry.last_assigned + 1;
}
None => segment_id = 1,
}
SegmentWriter::new(
self.cfg.clone(),
partition.clone(),
segment_id,
self.store.clone(),
start_ts,
)
}
fn register_tailer(&mut self, mut req: TailerRequest) {
let mut push_tailer =
|key: String, tailer: Sender<Result<api::QueryResponse, Status>>| match self
.tailers
.get_mut(&key)
{
Some(tailers) => tailers.push(tailer),
None => {
self.tailers.insert(key, vec![tailer]);
}
};
if req.partitions.len() == 0 {
push_tailer(String::from("*"), req.sender);
return;
}
for partition in req.partitions.drain(..) {
push_tailer(partition, req.sender.clone());
}
}
fn handle_tailers(&mut self, req: &IngesterPush) {
let send_logs = |tailers: Option<&mut Vec<Sender<Result<api::QueryResponse, Status>>>>| {
if let Some(tailers) = tailers {
tailers.retain_mut(|tailer| {
let mut lines = Vec::new();
for log_line in req.push_request.lines.iter() {
lines.push(api::LogLine {
app: req.push_request.source.clone(),
inner: String::from_utf8(log_line.raw_data.clone()).unwrap(),
ts: log_line.ts,
structured: log_line.structured,
});
}
match block_on(async {
tailer
.send(Ok(api::QueryResponse {
lines: lines,
json: String::from(""),
}))
.await
}) {
Ok(_) => true,
Err(_) => {
println!("removing tailer");
return false;
}
}
});
}
};
let tailers = self.tailers.get_mut("*");
send_logs(tailers);
let tailers = self.tailers.get_mut(&req.push_request.source);
send_logs(tailers);
}
}
| pub fn new(receiver: Receiver<IngesterRequest>, cfg: Config, store: S) -> Ingester<S> {
Ingester {
receiver: receiver,
id: 0,
segment_writers: HashMap::new(),
cfg: cfg,
store: store,
tailers: HashMap::default(),
}
} | function_block-full_function | [
{
"content": "pub trait Store {\n\n fn merge(&mut self, key: &[u8], value: Vec<u8>);\n\n fn set(&mut self, key: &[u8], value: Vec<u8>);\n\n fn flush(&mut self) -> Result<usize, failure::Error>;\n\n fn get(&self, key: &[u8]) -> Result<Option<Vec<u8>>, failure::Error>;\n\n fn flush_batch(&self, wb:... |
Rust | src/bin/mv_files.rs | lukaspustina/clams-bin | 14cf8732a4809b2003fbe255edffab448047b19a | use clams::prelude::*;
use clams_bin::mv_files;
use failure::{format_err, Error};
use std::path::{Path, PathBuf};
use structopt::StructOpt;
use walkdir::WalkDir;
#[derive(StructOpt, Debug)]
#[structopt(
name = "mv_files",
about = "Move video files from a nested directory structure into another, flat directory",
raw(setting = "structopt::clap::AppSettings::ColoredHelp")
)]
struct Args {
#[structopt(short = "e", long = "extension", default_value = "avi,mkv,mp4")]
extensions: String,
#[structopt(short = "s", long = "size", default_value = "100M")]
size: String,
#[structopt(raw(required = "true", index = "1"))]
sources: Vec<String>,
#[structopt(raw(index = "2"))]
destination: String,
#[structopt(short = "d", long = "dry")]
dry: bool,
#[structopt(long = "no-color")]
no_color: bool,
#[structopt(short = "p", long = "progress-bar")]
progress_bar: bool,
#[structopt(long = "silent")]
silent: bool,
#[structopt(short = "v", long = "verbose", parse(from_occurrences))]
verbosity: u64,
}
fn run(args: Args) -> Result<(), Error> {
if args.dry {
warn!(
"{}",
"Running in dry mode. No moves will be performed.".yellow()
);
}
let size = mv_files::human_size_to_bytes(&args.size)?;
if !PathBuf::from(&args.destination).is_dir() {
return Err(format_err!(
"Destination directory '{}' does not exist.",
args.destination
));
}
let extensions = mv_files::parse_extensions(&args.extensions)?;
let source_directories: Vec<&str> = args.sources.iter().map(|s| s.as_ref()).collect();
let dir_entries: Vec<_> = source_directories
.into_iter()
.map(|d| WalkDir::new(d).into_iter())
.flat_map(|e| e)
.collect::<Result<Vec<_>, _>>()?;
let moves: Vec<(_, _)> = dir_entries
.iter()
.map(|e| e.path())
.filter(|p| !p.is_dir())
.filter(|p| {
p.extension()
.map_or(false, |x| extensions.contains(&x.to_str().unwrap()))
})
.filter(|p| p.metadata().map(|m| m.len() >= size).unwrap_or(false))
.map(|p| {
let dest_path = mv_files::destination_path(&args.destination, p).unwrap();
(p, dest_path)
})
.collect();
debug!(
"moving with progess bar = {} and dry mode = {} and moves = ({}) {:#?}",
args.progress_bar,
args.dry,
moves.len(),
moves
);
if args.progress_bar {
move_files_with_progress_bar(moves.as_slice(), args.dry)
} else {
move_files(moves.as_slice(), args.dry)
}
}
fn move_files_with_progress_bar(moves: &[(&Path, PathBuf)], dry: bool) -> Result<(), Error> {
let pb = ProgressBar::new(moves.len() as u64);
let style = ProgressStyle::default_clams_bar();
pb.set_style(style);
for &(from, ref to) in moves {
pb.set_message(&format!(
"Moving {} to {} ...",
from.to_str().unwrap().yellow(),
to.to_str().unwrap().yellow()
));
if !dry {
match std::fs::rename(from, to) {
Ok(_) => {}
Err(e) => eprintln!(
"Failed to move {} because {}",
from.to_str().unwrap().red(),
e
),
}
}
pb.inc(1);
}
pb.finish_with_message("done.");
Ok(())
}
fn move_files(moves: &[(&Path, PathBuf)], dry: bool) -> Result<(), Error> {
for &(from, ref to) in moves {
print!(
"Moving {} to {} ...",
from.to_str().unwrap().yellow(),
to.to_str().unwrap().yellow()
);
if dry {
println!(" {}", "simulated.".blue());
} else {
match std::fs::rename(from, to) {
Ok(_) => println!(" {}.", "done".green()),
Err(e) => eprintln!(
"Failed to move {} because {}",
from.to_str().unwrap().red(),
e
),
}
}
}
Ok(())
}
fn main() {
let args = Args::from_args();
clams::console::set_color(!args.no_color);
let name = Args::clap().get_name().to_owned();
let level: Level = args.verbosity.into();
if !args.silent {
eprintln!(
"{} version={}, log level={:?}",
name,
env!("CARGO_PKG_VERSION"),
&level
);
}
let log_config = LogConfig::new(
std::io::stderr(),
!args.no_color,
Level(log::LevelFilter::Error),
vec![ModLevel {
module: name.to_owned(),
level,
}],
None,
);
init_logging(log_config).expect("Failed to initialize logging");
match run(args) {
Ok(_) => {}
Err(e) => {
println!("Failed:");
for c in e.iter_chain() {
println!("{}", c);
}
}
}
}
| use clams::prelude::*;
use clams_bin::mv_files;
use failure::{format_err, Error};
use std::path::{Path, PathBuf};
use structopt::StructOpt;
use walkdir::WalkDir;
#[derive(StructOpt, Debug)]
#[structopt(
name = "mv_files",
about = "Move video files from a nested directory structure into another, flat directory",
raw(setting = "structopt::clap::AppSettings::ColoredHelp")
)]
struct Args {
#[structopt(short = "e", long = "extension", default_value = "avi,mkv,mp4")]
extensions: String,
#[structopt(short = "s", long = "size", default_value = "100M")]
size: String,
#[structopt(raw(required = "true", index = "1"))]
sources: Vec<String>,
#[structopt(raw(index = "2"))]
destination: String,
#[structopt(short = "d", long = "dry")]
dry: bool,
#[structopt(long = "no-color")]
no_color: bool,
#[structopt(short = "p", long = "progress-bar")]
progress_bar: bool,
#[structopt(long = "silent")]
silent: bool,
#[structopt(short = "v", long = "verbose", parse(from_occurrences))]
verbosity: u64,
}
fn run(args: Args) -> Result<(), Error> {
if args.dry {
warn!(
"{}",
"Running in dry mode. No moves will be performed.".yellow()
);
}
let size = mv_files::human_size_to_bytes(&args.size)?;
if !PathBuf::from(&args.destination).is_dir() {
return Err(format_err!(
"Destination directory '{}' does not exist.",
args.destination
));
}
let extensions = mv_files::parse_extensions(&args.extensions)?;
let source_directories: Vec<&str> = args.sources.iter().map(|s| s.as_ref()).collect();
let dir_entries: Vec<_> = source_directories
.into_iter()
.map(|d| WalkDir::new(d).into_iter())
.flat_map(|e| e)
.collect::<Result<Vec<_>, _>>()?;
let moves: Vec<(_, _)> = dir_entries
.iter()
.map(|e| e.path())
.filter(|p| !p.is_dir())
.filter(|p| {
p.extension()
.map_or(false, |x| extensions.contains(&x.to_str().unwrap()))
})
.filter(|p| p.metadata().map(|m| m.len() >= size).unwrap_or(false))
.map(|p| {
let dest_path = mv_files::destination_path(&args.destination, p).unwrap();
(p, dest_path)
})
.collect();
debug!(
"moving with progess bar = {} and dry mode = {} and moves = ({}) {:#?}",
args.progress_bar,
args.dry,
moves.len(),
moves
);
if args.progress_bar {
move_files_with_progress_bar(moves.as_slice(), args.dry)
} else {
move_files(moves.as_slice(), args.dry)
}
}
fn move_files_with_progress_bar(moves: &[(&Path, PathBuf)], dry: bool) -> Result<(), Error> {
let pb = ProgressBar::new(moves.len() as u64);
let style = ProgressStyle::default_clams_bar();
pb.set_style(style);
for &(from, ref to) in moves {
pb.set_message(&format!(
"Moving {} to {} ...",
from.to_str().unwrap().yellow(),
to.to_str().unwrap().yellow()
));
if !dry {
match std::fs::rename(from, to) {
Ok(_) => {}
Err(e) => eprintln!(
"Failed to move {} because {}",
from.to_str().unwrap().red(),
e
),
}
}
pb.inc(1);
}
pb.finish_with_message("done.");
Ok(())
}
fn move_files(moves: &[(&Path, PathBuf)], dry: bool) -> Result<(), Error> {
for &(from, ref to) in moves {
print!(
"Moving {} to {} ...",
from.to_str().unwrap().yellow(),
to.to_str().unwrap().yellow()
);
|
}
Ok(())
}
fn main() {
let args = Args::from_args();
clams::console::set_color(!args.no_color);
let name = Args::clap().get_name().to_owned();
let level: Level = args.verbosity.into();
if !args.silent {
eprintln!(
"{} version={}, log level={:?}",
name,
env!("CARGO_PKG_VERSION"),
&level
);
}
let log_config = LogConfig::new(
std::io::stderr(),
!args.no_color,
Level(log::LevelFilter::Error),
vec![ModLevel {
module: name.to_owned(),
level,
}],
None,
);
init_logging(log_config).expect("Failed to initialize logging");
match run(args) {
Ok(_) => {}
Err(e) => {
println!("Failed:");
for c in e.iter_chain() {
println!("{}", c);
}
}
}
}
| if dry {
println!(" {}", "simulated.".blue());
} else {
match std::fs::rename(from, to) {
Ok(_) => println!(" {}.", "done".green()),
Err(e) => eprintln!(
"Failed to move {} because {}",
from.to_str().unwrap().red(),
e
),
}
} | if_condition | [
{
"content": " };\n\n\n\n let size = size.parse::<u64>().map_err(|_| MvFilesError::InvaildSize {\n\n arg: String::from(size),\n\n })?;\n\n\n\n let size = match scale {\n\n 'k' => size * 1024u64.pow(1),\n\n 'M' => size * 1024u64.pow(2),\n\n ... |
Rust | benches/raid.rs | geky/gf256 | 57675335061b18e3614376981482fd7584454fd5 |
use criterion::criterion_group;
use criterion::criterion_main;
use criterion::Criterion;
use criterion::BatchSize;
use criterion::Throughput;
use std::iter;
use std::convert::TryFrom;
#[allow(dead_code)]
#[path = "../examples/raid.rs"]
mod raid;
fn bench_raid(c: &mut Criterion) {
let mut group = c.benchmark_group("raid");
fn xorshift64(seed: u64) -> impl Iterator<Item=u64> {
let mut x = seed;
iter::repeat_with(move || {
x ^= x << 13;
x ^= x >> 7;
x ^= x << 17;
x
})
}
const SIZE: usize = 1024*1024;
const COUNT: usize = 5;
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((COUNT*SIZE) as u64));
group.bench_function("raid5_format", |b| b.iter_batched_ref(
|| {(
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(disks, p)| raid::raid5_format(disks, p),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
let mut disks = iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>();
let mut p = (&mut xs).take(SIZE).collect::<Vec<u8>>();
raid::raid5_format(&disks, &mut p);
group.throughput(Throughput::Bytes(SIZE as u64));
group.bench_function("raid5_update", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT).unwrap()),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
)},
|(i, data)| {
raid::raid5_update(*i, &disks[*i], data, &mut p);
disks[*i].copy_from_slice(data);
},
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((1*SIZE) as u64));
group.bench_function("raid5_repair", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+1).unwrap()),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(i, disks, p)| raid::raid5_repair(disks, p, &[*i]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((COUNT*SIZE) as u64));
group.bench_function("raid6_format", |b| b.iter_batched_ref(
|| {(
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(disks, p, q)| raid::raid6_format(disks, p, q),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
let mut disks = iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>();
let mut p = (&mut xs).take(SIZE).collect::<Vec<u8>>();
let mut q = (&mut xs).take(SIZE).collect::<Vec<u8>>();
raid::raid6_format(&mut disks, &mut p, &mut q);
group.throughput(Throughput::Bytes(SIZE as u64));
group.bench_function("raid6_update", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT).unwrap()),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
)},
|(i, data)| {
raid::raid6_update(*i, &disks[*i], data, &mut p, &mut q);
disks[*i].copy_from_slice(data);
},
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((1*SIZE) as u64));
group.bench_function("raid6_repair_1", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+2).unwrap()),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(i, disks, p, q)| raid::raid6_repair(disks, p, q, &[*i]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((2*SIZE) as u64));
group.bench_function("raid6_repair_2", |b| b.iter_batched_ref(
|| {
let i = usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+2).unwrap());
(
i,
(i+1) % (COUNT+2),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)
},
|(i, j, disks, p, q)| raid::raid6_repair(disks, p, q, &[*i, *j]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((COUNT*SIZE) as u64));
group.bench_function("raid7_format", |b| b.iter_batched_ref(
|| {(
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(disks, p, q, r)| raid::raid7_format(disks, p, q, r),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
let mut disks = iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>();
let mut p = (&mut xs).take(SIZE).collect::<Vec<u8>>();
let mut q = (&mut xs).take(SIZE).collect::<Vec<u8>>();
let mut r = (&mut xs).take(SIZE).collect::<Vec<u8>>();
raid::raid6_format(&mut disks, &mut p, &mut q);
group.throughput(Throughput::Bytes(SIZE as u64));
group.bench_function("raid7_update", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT).unwrap()),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
)},
|(i, data)| {
raid::raid7_update(*i, &disks[*i], data, &mut p, &mut q, &mut r);
disks[*i].copy_from_slice(data);
},
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((1*SIZE) as u64));
group.bench_function("raid7_repair_1", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+3).unwrap()),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(i, disks, p, q, r)| raid::raid7_repair(disks, p, q, r, &[*i]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((2*SIZE) as u64));
group.bench_function("raid7_repair_2", |b| b.iter_batched_ref(
|| {
let i = usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+3).unwrap());
(
i,
(i+1) % (COUNT+2),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)
},
|(i, j, disks, p, q, r)| raid::raid7_repair(disks, p, q, r, &[*i, *j]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((2*SIZE) as u64));
group.bench_function("raid7_repair_3", |b| b.iter_batched_ref(
|| {
let i = usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+3).unwrap());
(
i,
(i+1) % (COUNT+3),
(i+2) % (COUNT+3),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)
},
|(i, j, k, disks, p, q, r)| raid::raid7_repair(disks, p, q, r, &[*i, *j, *k]),
BatchSize::SmallInput
));
}
criterion_group!(benches, bench_raid);
criterion_main!(benches);
|
use criterion::criterion_group;
use criterion::criterion_main;
use criterion::Criterion;
use criterion::BatchSize;
use criterion::Throughput;
use std::iter;
use std::convert::TryFrom;
#[allow(dead_code)]
#[path = "../examples/raid.rs"]
mod raid;
fn bench_raid(c: &mut Criterion) {
let mut group = c.benchmark_group("raid");
|
const SIZE: usize = 1024*1024;
const COUNT: usize = 5;
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((COUNT*SIZE) as u64));
group.bench_function("raid5_format", |b| b.iter_batched_ref(
|| {(
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(disks, p)| raid::raid5_format(disks, p),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
let mut disks = iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>();
let mut p = (&mut xs).take(SIZE).collect::<Vec<u8>>();
raid::raid5_format(&disks, &mut p);
group.throughput(Throughput::Bytes(SIZE as u64));
group.bench_function("raid5_update", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT).unwrap()),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
)},
|(i, data)| {
raid::raid5_update(*i, &disks[*i], data, &mut p);
disks[*i].copy_from_slice(data);
},
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((1*SIZE) as u64));
group.bench_function("raid5_repair", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+1).unwrap()),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(i, disks, p)| raid::raid5_repair(disks, p, &[*i]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((COUNT*SIZE) as u64));
group.bench_function("raid6_format", |b| b.iter_batched_ref(
|| {(
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(disks, p, q)| raid::raid6_format(disks, p, q),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
let mut disks = iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>();
let mut p = (&mut xs).take(SIZE).collect::<Vec<u8>>();
let mut q = (&mut xs).take(SIZE).collect::<Vec<u8>>();
raid::raid6_format(&mut disks, &mut p, &mut q);
group.throughput(Throughput::Bytes(SIZE as u64));
group.bench_function("raid6_update", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT).unwrap()),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
)},
|(i, data)| {
raid::raid6_update(*i, &disks[*i], data, &mut p, &mut q);
disks[*i].copy_from_slice(data);
},
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((1*SIZE) as u64));
group.bench_function("raid6_repair_1", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+2).unwrap()),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(i, disks, p, q)| raid::raid6_repair(disks, p, q, &[*i]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((2*SIZE) as u64));
group.bench_function("raid6_repair_2", |b| b.iter_batched_ref(
|| {
let i = usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+2).unwrap());
(
i,
(i+1) % (COUNT+2),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)
},
|(i, j, disks, p, q)| raid::raid6_repair(disks, p, q, &[*i, *j]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((COUNT*SIZE) as u64));
group.bench_function("raid7_format", |b| b.iter_batched_ref(
|| {(
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(disks, p, q, r)| raid::raid7_format(disks, p, q, r),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
let mut disks = iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>();
let mut p = (&mut xs).take(SIZE).collect::<Vec<u8>>();
let mut q = (&mut xs).take(SIZE).collect::<Vec<u8>>();
let mut r = (&mut xs).take(SIZE).collect::<Vec<u8>>();
raid::raid6_format(&mut disks, &mut p, &mut q);
group.throughput(Throughput::Bytes(SIZE as u64));
group.bench_function("raid7_update", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT).unwrap()),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
)},
|(i, data)| {
raid::raid7_update(*i, &disks[*i], data, &mut p, &mut q, &mut r);
disks[*i].copy_from_slice(data);
},
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((1*SIZE) as u64));
group.bench_function("raid7_repair_1", |b| b.iter_batched_ref(
|| {(
usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+3).unwrap()),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)},
|(i, disks, p, q, r)| raid::raid7_repair(disks, p, q, r, &[*i]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((2*SIZE) as u64));
group.bench_function("raid7_repair_2", |b| b.iter_batched_ref(
|| {
let i = usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+3).unwrap());
(
i,
(i+1) % (COUNT+2),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)
},
|(i, j, disks, p, q, r)| raid::raid7_repair(disks, p, q, r, &[*i, *j]),
BatchSize::SmallInput
));
let mut xs = xorshift64(42).map(|x| x as u8);
group.throughput(Throughput::Bytes((2*SIZE) as u64));
group.bench_function("raid7_repair_3", |b| b.iter_batched_ref(
|| {
let i = usize::from((&mut xs).next().unwrap() % u8::try_from(COUNT+3).unwrap());
(
i,
(i+1) % (COUNT+3),
(i+2) % (COUNT+3),
iter::repeat_with(|| {
(&mut xs).take(SIZE).collect::<Vec<u8>>()
})
.take(COUNT+2)
.collect::<Vec<_>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>(),
(&mut xs).take(SIZE).collect::<Vec<u8>>()
)
},
|(i, j, k, disks, p, q, r)| raid::raid7_repair(disks, p, q, r, &[*i, *j, *k]),
BatchSize::SmallInput
));
}
criterion_group!(benches, bench_raid);
criterion_main!(benches);
| fn xorshift64(seed: u64) -> impl Iterator<Item=u64> {
let mut x = seed;
iter::repeat_with(move || {
x ^= x << 13;
x ^= x >> 7;
x ^= x << 17;
x
})
} | function_block-full_function | [
{
"content": "fn bench_gfmul(c: &mut Criterion) {\n\n let mut group = c.benchmark_group(\"gfmul\");\n\n\n\n // gf256 mul/div\n\n bench_mul!(group, \"gf256_naive_mul\", gf256_naive);\n\n bench_mul!(group, \"gf256_table_mul\", gf256_table);\n\n bench_mul!(group, \"gf256_rem_ta... |
Rust | src/types/option_value.rs | aCLr/telegram-tdlib | 40262849d87608931f22d0bbfd5baa0b410461ce | use crate::errors::*;
use crate::types::*;
use uuid::Uuid;
use std::fmt::Debug;
pub trait TDOptionValue: Debug + RObject {}
#[derive(Debug, Clone, Deserialize, Serialize)]
#[serde(tag = "@type")]
pub enum OptionValue {
#[doc(hidden)]
_Default,
#[serde(rename(serialize = "getOption", deserialize = "getOption"))]
GetOption(GetOption),
#[serde(rename(serialize = "optionValueBoolean", deserialize = "optionValueBoolean"))]
Boolean(OptionValueBoolean),
#[serde(rename(serialize = "optionValueEmpty", deserialize = "optionValueEmpty"))]
Empty(OptionValueEmpty),
#[serde(rename(serialize = "optionValueInteger", deserialize = "optionValueInteger"))]
Integer(OptionValueInteger),
#[serde(rename(serialize = "optionValueString", deserialize = "optionValueString"))]
String(OptionValueString),
}
impl Default for OptionValue {
fn default() -> Self {
OptionValue::_Default
}
}
impl RObject for OptionValue {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
match self {
OptionValue::GetOption(t) => t.extra(),
OptionValue::Boolean(t) => t.extra(),
OptionValue::Empty(t) => t.extra(),
OptionValue::Integer(t) => t.extra(),
OptionValue::String(t) => t.extra(),
_ => None,
}
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
match self {
OptionValue::GetOption(t) => t.client_id(),
OptionValue::Boolean(t) => t.client_id(),
OptionValue::Empty(t) => t.client_id(),
OptionValue::Integer(t) => t.client_id(),
OptionValue::String(t) => t.client_id(),
_ => None,
}
}
}
impl OptionValue {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
#[doc(hidden)]
pub fn _is_default(&self) -> bool {
matches!(self, OptionValue::_Default)
}
}
impl AsRef<OptionValue> for OptionValue {
fn as_ref(&self) -> &OptionValue {
self
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueBoolean {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
value: bool,
}
impl RObject for OptionValueBoolean {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueBoolean {}
impl OptionValueBoolean {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueBooleanBuilder {
let mut inner = OptionValueBoolean::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueBooleanBuilder { inner }
}
pub fn value(&self) -> bool {
self.value
}
}
#[doc(hidden)]
pub struct RTDOptionValueBooleanBuilder {
inner: OptionValueBoolean,
}
impl RTDOptionValueBooleanBuilder {
pub fn build(&self) -> OptionValueBoolean {
self.inner.clone()
}
pub fn value(&mut self, value: bool) -> &mut Self {
self.inner.value = value;
self
}
}
impl AsRef<OptionValueBoolean> for OptionValueBoolean {
fn as_ref(&self) -> &OptionValueBoolean {
self
}
}
impl AsRef<OptionValueBoolean> for RTDOptionValueBooleanBuilder {
fn as_ref(&self) -> &OptionValueBoolean {
&self.inner
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueEmpty {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
}
impl RObject for OptionValueEmpty {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueEmpty {}
impl OptionValueEmpty {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueEmptyBuilder {
let mut inner = OptionValueEmpty::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueEmptyBuilder { inner }
}
}
#[doc(hidden)]
pub struct RTDOptionValueEmptyBuilder {
inner: OptionValueEmpty,
}
impl RTDOptionValueEmptyBuilder {
pub fn build(&self) -> OptionValueEmpty {
self.inner.clone()
}
}
impl AsRef<OptionValueEmpty> for OptionValueEmpty {
fn as_ref(&self) -> &OptionValueEmpty {
self
}
}
impl AsRef<OptionValueEmpty> for RTDOptionValueEmptyBuilder {
fn as_ref(&self) -> &OptionValueEmpty {
&self.inner
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueInteger {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
#[serde(deserialize_with = "super::_common::number_from_string")]
value: i64,
}
impl RObject for OptionValueInteger {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueInteger {}
impl OptionValueInteger {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueIntegerBuilder {
let mut inner = OptionValueInteger::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueIntegerBuilder { inner }
}
pub fn value(&self) -> i64 {
self.value
}
}
#[doc(hidden)]
pub struct RTDOptionValueIntegerBuilder {
inner: OptionValueInteger,
}
impl RTDOptionValueIntegerBuilder {
pub fn build(&self) -> OptionValueInteger {
self.inner.clone()
}
pub fn value(&mut self, value: i64) -> &mut Self {
self.inner.value = value;
self
}
}
impl AsRef<OptionValueInteger> for OptionValueInteger {
fn as_ref(&self) -> &OptionValueInteger {
self
}
}
impl AsRef<OptionValueInteger> for RTDOptionValueIntegerBuilder {
fn as_ref(&self) -> &OptionValueInteger {
&self.inner
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueString {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
value: String,
}
impl RObject for OptionValueString {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueString {}
impl OptionValueString {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueStringBuilder {
let mut inner = OptionValueString::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueStringBuilder { inner }
}
pub fn value(&self) -> &String {
&self.value
}
}
#[doc(hidden)]
pub struct RTDOptionValueStringBuilder {
inner: OptionValueString,
}
impl RTDOptionValueStringBuilder {
pub fn build(&self) -> OptionValueString {
self.inner.clone()
}
pub fn value<T: AsRef<str>>(&mut self, value: T) -> &mut Self {
self.inner.value = value.as_ref().to_string();
self
}
}
impl AsRef<OptionValueString> for OptionValueString {
fn as_ref(&self) -> &OptionValueString {
self
}
}
impl AsRef<OptionValueString> for RTDOptionValueStringBuilder {
fn as_ref(&self) -> &OptionValueString {
&self.inner
}
}
| use crate::errors::*;
use crate::types::*;
use uuid::Uuid;
use std::fmt::Debug;
pub trait TDOptionValue: Debug + RObject {}
#[derive(Debug, Clone, Deserialize, Serialize)]
#[serde(tag = "@type")]
pub enum OptionValue {
#[doc(hidden)]
_Default,
#[serde(rename(serialize = "getOption", deserialize = "getOption"))]
GetOption(GetOption),
#[serde(rename(serialize = "optionValueBoolean", deserialize = "optionValueBoolean"))]
Boolean(OptionValueBoolean),
#[serde(rename(serialize = "optionValueEmpty", deserialize = "optionValueEmpty"))]
Empty(OptionValueEmpty),
#[serde(rename(serialize = "optionValueInteger", deserialize = "optionValueInteger"))]
Integer(OptionValueInteger),
#[serde(rename(serialize = "optionValueString", deserialize = "optionValueString"))]
String(OptionValueString),
}
impl Default for OptionValue {
fn default() -> Self {
OptionValue::_Default
}
}
impl RObject for OptionValue {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
|
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
match self {
OptionValue::GetOption(t) => t.client_id(),
OptionValue::Boolean(t) => t.client_id(),
OptionValue::Empty(t) => t.client_id(),
OptionValue::Integer(t) => t.client_id(),
OptionValue::String(t) => t.client_id(),
_ => None,
}
}
}
impl OptionValue {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
#[doc(hidden)]
pub fn _is_default(&self) -> bool {
matches!(self, OptionValue::_Default)
}
}
impl AsRef<OptionValue> for OptionValue {
fn as_ref(&self) -> &OptionValue {
self
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueBoolean {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
value: bool,
}
impl RObject for OptionValueBoolean {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueBoolean {}
impl OptionValueBoolean {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueBooleanBuilder {
let mut inner = OptionValueBoolean::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueBooleanBuilder { inner }
}
pub fn value(&self) -> bool {
self.value
}
}
#[doc(hidden)]
pub struct RTDOptionValueBooleanBuilder {
inner: OptionValueBoolean,
}
impl RTDOptionValueBooleanBuilder {
pub fn build(&self) -> OptionValueBoolean {
self.inner.clone()
}
pub fn value(&mut self, value: bool) -> &mut Self {
self.inner.value = value;
self
}
}
impl AsRef<OptionValueBoolean> for OptionValueBoolean {
fn as_ref(&self) -> &OptionValueBoolean {
self
}
}
impl AsRef<OptionValueBoolean> for RTDOptionValueBooleanBuilder {
fn as_ref(&self) -> &OptionValueBoolean {
&self.inner
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueEmpty {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
}
impl RObject for OptionValueEmpty {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueEmpty {}
impl OptionValueEmpty {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueEmptyBuilder {
let mut inner = OptionValueEmpty::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueEmptyBuilder { inner }
}
}
#[doc(hidden)]
pub struct RTDOptionValueEmptyBuilder {
inner: OptionValueEmpty,
}
impl RTDOptionValueEmptyBuilder {
pub fn build(&self) -> OptionValueEmpty {
self.inner.clone()
}
}
impl AsRef<OptionValueEmpty> for OptionValueEmpty {
fn as_ref(&self) -> &OptionValueEmpty {
self
}
}
impl AsRef<OptionValueEmpty> for RTDOptionValueEmptyBuilder {
fn as_ref(&self) -> &OptionValueEmpty {
&self.inner
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueInteger {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
#[serde(deserialize_with = "super::_common::number_from_string")]
value: i64,
}
impl RObject for OptionValueInteger {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueInteger {}
impl OptionValueInteger {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueIntegerBuilder {
let mut inner = OptionValueInteger::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueIntegerBuilder { inner }
}
pub fn value(&self) -> i64 {
self.value
}
}
#[doc(hidden)]
pub struct RTDOptionValueIntegerBuilder {
inner: OptionValueInteger,
}
impl RTDOptionValueIntegerBuilder {
pub fn build(&self) -> OptionValueInteger {
self.inner.clone()
}
pub fn value(&mut self, value: i64) -> &mut Self {
self.inner.value = value;
self
}
}
impl AsRef<OptionValueInteger> for OptionValueInteger {
fn as_ref(&self) -> &OptionValueInteger {
self
}
}
impl AsRef<OptionValueInteger> for RTDOptionValueIntegerBuilder {
fn as_ref(&self) -> &OptionValueInteger {
&self.inner
}
}
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct OptionValueString {
#[doc(hidden)]
#[serde(rename(serialize = "@extra", deserialize = "@extra"))]
extra: Option<String>,
#[serde(rename(serialize = "@client_id", deserialize = "@client_id"))]
client_id: Option<i32>,
value: String,
}
impl RObject for OptionValueString {
#[doc(hidden)]
fn extra(&self) -> Option<&str> {
self.extra.as_deref()
}
#[doc(hidden)]
fn client_id(&self) -> Option<i32> {
self.client_id
}
}
impl TDOptionValue for OptionValueString {}
impl OptionValueString {
pub fn from_json<S: AsRef<str>>(json: S) -> RTDResult<Self> {
Ok(serde_json::from_str(json.as_ref())?)
}
pub fn builder() -> RTDOptionValueStringBuilder {
let mut inner = OptionValueString::default();
inner.extra = Some(Uuid::new_v4().to_string());
RTDOptionValueStringBuilder { inner }
}
pub fn value(&self) -> &String {
&self.value
}
}
#[doc(hidden)]
pub struct RTDOptionValueStringBuilder {
inner: OptionValueString,
}
impl RTDOptionValueStringBuilder {
pub fn build(&self) -> OptionValueString {
self.inner.clone()
}
pub fn value<T: AsRef<str>>(&mut self, value: T) -> &mut Self {
self.inner.value = value.as_ref().to_string();
self
}
}
impl AsRef<OptionValueString> for OptionValueString {
fn as_ref(&self) -> &OptionValueString {
self
}
}
impl AsRef<OptionValueString> for RTDOptionValueStringBuilder {
fn as_ref(&self) -> &OptionValueString {
&self.inner
}
}
| match self {
OptionValue::GetOption(t) => t.extra(),
OptionValue::Boolean(t) => t.extra(),
OptionValue::Empty(t) => t.extra(),
OptionValue::Integer(t) => t.extra(),
OptionValue::String(t) => t.extra(),
_ => None,
} | if_condition | [
{
"content": "pub trait RFunction: Debug + RObject + Serialize {\n\n fn to_json(&self) -> RTDResult<String> {\n\n Ok(serde_json::to_string(self)?)\n\n }\n\n}\n\n\n\nimpl<'a, RObj: RObject> RObject for &'a RObj {\n\n fn extra(&self) -> Option<&str> {\n\n (*self).extra()\n\n }\n\n fn ... |
Rust | crates/vkfft-sys/build.rs | semio-ai/vkfft-rs | 2ee35297bdfef4aece8877f7b1c1c5b1c584766c | extern crate bindgen;
extern crate cc;
use std::error::Error;
use std::path::{Path, PathBuf};
use bindgen::Bindings;
fn build_lib<O, LD, L, const N: usize, const M: usize>(out_dir: O, library_dirs: LD, libraries: L, defines: &[(&str, &str); N], include_dirs: &[String; M]) -> Result<(), Box<dyn Error>>
where
O: AsRef<Path>,
LD: Iterator,
LD::Item: AsRef<str>,
L: Iterator,
L::Item: AsRef<str>
{
let mut build = cc::Build::default();
build
.cpp(true)
.file("wrapper.cpp")
.include(out_dir)
.flag("-std=c++11")
.flag("-w");
for library_dir in library_dirs {
build.flag(format!("-L{}", library_dir.as_ref()).as_str());
}
for library in libraries {
build.flag(format!("-l{}", library.as_ref()).as_str());
}
build
.cargo_metadata(true)
.static_flag(true);
for (key, value) in defines.iter() {
build.define(*key, Some(*value));
}
for include_dir in include_dirs.iter() {
build.include(include_dir);
}
build.compile("vkfft");
Ok(())
}
fn gen_wrapper<F, const N: usize, const M: usize>(file: F, defines: &[(&str, &str); N], include_dirs: &[String; M]) -> Result<Bindings, Box<dyn Error>>
where
F: AsRef<Path>,
{
let base_args = [
"-std=c++11".to_string(),
];
let defines: Vec<String> = defines.iter().map(|(k, v)| {
format!("-D{}={}", k, v)
}).collect();
let include_dirs: Vec<String> = include_dirs.iter()
.map(|s| format!("-I{}", s))
.collect();
let clang_args = base_args
.iter()
.chain(defines.iter())
.chain(include_dirs.iter());
println!("{:?}", clang_args);
let res = bindgen::Builder::default()
.clang_args(clang_args)
.parse_callbacks(Box::new(bindgen::CargoCallbacks))
.header(file.as_ref().to_str().unwrap())
.allowlist_recursively(true)
.allowlist_type("VkFFTConfiguration")
.allowlist_type("VkFFTLaunchParams")
.allowlist_type("VkFFTResult")
.allowlist_type("VkFFTSpecializationConstantsLayout")
.allowlist_type("VkFFTPushConstantsLayout")
.allowlist_type("VkFFTAxis")
.allowlist_type("VkFFTPlan")
.allowlist_type("VkFFTApplication")
.allowlist_function("VkFFTSync")
.allowlist_function("VkFFTAppend")
.allowlist_function("VkFFTPlanAxis")
.allowlist_function("initializeVkFFT")
.allowlist_function("deleteVkFFT")
.allowlist_function("VkFFTGetVersion")
.generate();
let bindings = match res {
Ok(x) => x,
Err(_) => {
eprintln!("Failed to generate bindings.");
std::process::exit(1);
}
};
Ok(bindings)
}
fn main() -> Result<(), Box<dyn Error>> {
let vkfft_root = std::env::var("VKFFT_ROOT")?;
let out_dir = std::env::var("OUT_DIR")?;
let out_dir = PathBuf::from(out_dir);
let library_dirs = [
format!("{}/build/glslang-master/glslang", vkfft_root),
format!("{}/build/glslang-master/glslang/OSDependent/Unix", vkfft_root),
format!("{}/build/glslang-master/glslang/OGLCompilersDLL", vkfft_root),
format!("{}/build/glslang-master/glslang/SPIRV", vkfft_root),
];
let libraries = [
"glslang",
"MachineIndependent",
"OSDependent",
"GenericCodeGen",
"OGLCompiler",
"vulkan",
"SPIRV"
];
for library_dir in library_dirs.iter() {
println!("cargo:rustc-link-search={}", library_dir);
}
for library in libraries.iter() {
println!("cargo:rustc-link-lib={}", library);
}
println!("cargo:rerun-if-changed=wrapper.cpp");
println!("cargo:rerun-if-changed=build.rs");
let include_dirs = [
format!("{}/vkFFT", &vkfft_root),
format!("{}/glslang-master/glslang/Include", vkfft_root)
];
let defines = [
("VKFFT_BACKEND", "0"),
("VK_API_VERSION", "11")
];
let wrapper = std::fs::read_to_string(format!("{}/vkFFT/vkFFT.h", vkfft_root))?
.replace("static inline", "");
let rw = out_dir.join("vkfft_rw.hpp");
std::fs::write(&rw, wrapper.as_str())?;
build_lib(&out_dir, library_dirs.iter(), libraries.iter(), &defines, &include_dirs)?;
let bindings = gen_wrapper(&rw, &defines, &include_dirs)?;
bindings.write_to_file(out_dir.join("bindings.rs"))?;
Ok(())
}
| extern crate bindgen;
extern crate cc;
use std::error::Error;
use std::path::{Path, PathBuf};
use bindgen::Bindings;
fn build_lib<O, LD, L, const N: usize, const M: usize>(out_dir: O, library_dirs: LD, libraries: L, defines: &[(&str, &str); N], include_dirs: &[String; M]) -> Result<(), Box<dyn Error>>
where
O: AsRef<Path>,
LD: Iterator,
LD::Item: AsRef<str>,
L: Iterator,
L::Item: AsRef<str> | ings = gen_wrapper(&rw, &defines, &include_dirs)?;
bindings.write_to_file(out_dir.join("bindings.rs"))?;
Ok(())
}
|
{
let mut build = cc::Build::default();
build
.cpp(true)
.file("wrapper.cpp")
.include(out_dir)
.flag("-std=c++11")
.flag("-w");
for library_dir in library_dirs {
build.flag(format!("-L{}", library_dir.as_ref()).as_str());
}
for library in libraries {
build.flag(format!("-l{}", library.as_ref()).as_str());
}
build
.cargo_metadata(true)
.static_flag(true);
for (key, value) in defines.iter() {
build.define(*key, Some(*value));
}
for include_dir in include_dirs.iter() {
build.include(include_dir);
}
build.compile("vkfft");
Ok(())
}
fn gen_wrapper<F, const N: usize, const M: usize>(file: F, defines: &[(&str, &str); N], include_dirs: &[String; M]) -> Result<Bindings, Box<dyn Error>>
where
F: AsRef<Path>,
{
let base_args = [
"-std=c++11".to_string(),
];
let defines: Vec<String> = defines.iter().map(|(k, v)| {
format!("-D{}={}", k, v)
}).collect();
let include_dirs: Vec<String> = include_dirs.iter()
.map(|s| format!("-I{}", s))
.collect();
let clang_args = base_args
.iter()
.chain(defines.iter())
.chain(include_dirs.iter());
println!("{:?}", clang_args);
let res = bindgen::Builder::default()
.clang_args(clang_args)
.parse_callbacks(Box::new(bindgen::CargoCallbacks))
.header(file.as_ref().to_str().unwrap())
.allowlist_recursively(true)
.allowlist_type("VkFFTConfiguration")
.allowlist_type("VkFFTLaunchParams")
.allowlist_type("VkFFTResult")
.allowlist_type("VkFFTSpecializationConstantsLayout")
.allowlist_type("VkFFTPushConstantsLayout")
.allowlist_type("VkFFTAxis")
.allowlist_type("VkFFTPlan")
.allowlist_type("VkFFTApplication")
.allowlist_function("VkFFTSync")
.allowlist_function("VkFFTAppend")
.allowlist_function("VkFFTPlanAxis")
.allowlist_function("initializeVkFFT")
.allowlist_function("deleteVkFFT")
.allowlist_function("VkFFTGetVersion")
.generate();
let bindings = match res {
Ok(x) => x,
Err(_) => {
eprintln!("Failed to generate bindings.");
std::process::exit(1);
}
};
Ok(bindings)
}
fn main() -> Result<(), Box<dyn Error>> {
let vkfft_root = std::env::var("VKFFT_ROOT")?;
let out_dir = std::env::var("OUT_DIR")?;
let out_dir = PathBuf::from(out_dir);
let library_dirs = [
format!("{}/build/glslang-master/glslang", vkfft_root),
format!("{}/build/glslang-master/glslang/OSDependent/Unix", vkfft_root),
format!("{}/build/glslang-master/glslang/OGLCompilersDLL", vkfft_root),
format!("{}/build/glslang-master/glslang/SPIRV", vkfft_root),
];
let libraries = [
"glslang",
"MachineIndependent",
"OSDependent",
"GenericCodeGen",
"OGLCompiler",
"vulkan",
"SPIRV"
];
for library_dir in library_dirs.iter() {
println!("cargo:rustc-link-search={}", library_dir);
}
for library in libraries.iter() {
println!("cargo:rustc-link-lib={}", library);
}
println!("cargo:rerun-if-changed=wrapper.cpp");
println!("cargo:rerun-if-changed=build.rs");
let include_dirs = [
format!("{}/vkFFT", &vkfft_root),
format!("{}/glslang-master/glslang/Include", vkfft_root)
];
let defines = [
("VKFFT_BACKEND", "0"),
("VK_API_VERSION", "11")
];
let wrapper = std::fs::read_to_string(format!("{}/vkFFT/vkFFT.h", vkfft_root))?
.replace("static inline", "");
let rw = out_dir.join("vkfft_rw.hpp");
std::fs::write(&rw, wrapper.as_str())?;
build_lib(&out_dir, library_dirs.iter(), libraries.iter(), &defines, &include_dirs)?;
let bind | random | [
{
"content": "fn main() -> Result<(), Box<dyn std::error::Error>> {\n\n println!(\"VkFFT version: {}\", vkfft::version());\n\n\n\n let instance = Instance::new(\n\n None,\n\n &InstanceExtensions {\n\n ext_debug_utils: true,\n\n ..InstanceExtensions::none()\n\n },\n\n vec![\"VK_LAYER_KHRO... |
Rust | examples/bgpdumper.rs | wladwm/zettabgp | 85d8e21742e948907cf3fcc64552f40c9e852524 |
extern crate zettabgp;
use std::env;
use std::io::{Read, Write};
use std::net::{Shutdown, TcpStream};
use std::thread::{sleep, spawn};
use zettabgp::prelude::*;
pub struct BgpDumper {
pub params: BgpSessionParams,
pub stream: TcpStream,
}
impl BgpDumper {
pub fn new(bgp_params: BgpSessionParams, tcpstream: TcpStream) -> BgpDumper {
BgpDumper {
params: bgp_params,
stream: tcpstream,
}
}
fn recv_message_head(&mut self) -> Result<(BgpMessageType, usize), BgpError> {
let mut buf = [0 as u8; 19];
self.stream.read_exact(&mut buf)?;
self.params.decode_message_head(&buf)
}
pub fn start_active(&mut self) -> Result<(), BgpError> {
let mut bom = self.params.open_message();
let mut buf = [255 as u8; 4096];
let messagelen = match bom.encode_to(&self.params, &mut buf[19..]) {
Err(e) => {
return Err(e);
}
Ok(sz) => sz,
};
let blen = self
.params
.prepare_message_buf(&mut buf, BgpMessageType::Open, messagelen)?;
self.stream.write_all(&buf[0..blen])?;
let msg = match self.recv_message_head() {
Err(e) => {
return Err(e);
}
Ok(msg) => msg,
};
if msg.0 != BgpMessageType::Open {
return Err(BgpError::static_str("Invalid state to start_active"));
}
self.stream.read_exact(&mut buf[0..msg.1])?;
bom.decode_from(&self.params, &buf[0..msg.1])?;
self.params.hold_time = bom.hold_time;
self.params.caps = bom.caps;
self.params.check_caps();
Ok(())
}
pub fn send_keepalive(stream: &mut TcpStream) -> Result<(), BgpError> {
let mut buf = [255 as u8; 19];
buf[0..16].clone_from_slice(&[255 as u8; 16]);
buf[16] = 0;
buf[17] = 19;
buf[18] = 4;
match stream.write_all(&buf) {
Ok(_) => Ok(()),
Err(e) => Err(e.into()),
}
}
pub fn start_keepalives(&self) -> Result<(), BgpError> {
let mut ks = self.stream.try_clone()?;
let slp = std::time::Duration::new((self.params.hold_time / 3) as u64, 0);
spawn(move || loop {
if BgpDumper::send_keepalive(&mut ks).is_err() {
break;
}
sleep(slp);
});
Ok(())
}
pub fn lifecycle(&mut self) -> Result<(), BgpError> {
self.start_keepalives()?;
let mut buf = Box::new([0 as u8; 65536]);
loop {
let msg = match self.recv_message_head() {
Ok(m) => m,
Err(e) => {
return Err(e);
}
};
if msg.0 == BgpMessageType::Keepalive {
continue;
}
self.stream.read_exact(&mut buf[0..msg.1])?;
match msg.0 {
BgpMessageType::Open => {
eprintln!("Incorrect open message!");
break;
}
BgpMessageType::Keepalive => {}
BgpMessageType::Notification => {
let mut msgnotification = BgpNotificationMessage::new();
match msgnotification.decode_from(&self.params, &buf[0..msg.1]) {
Err(e) => {
eprintln!("BGP notification decode error: {:?}", e);
}
Ok(_) => {
println!(
"BGP notification: {:?} - {:?}",
msgnotification,
msgnotification.error_text()
);
}
};
break;
}
BgpMessageType::Update => {
let mut msgupdate = BgpUpdateMessage::new();
if let Err(e) = msgupdate.decode_from(&self.params, &buf[0..msg.1]) {
eprintln!("BGP update decode error: {:?}", e);
continue;
}
println!("{:?}", msgupdate);
}
}
}
Ok(())
}
pub fn close(&mut self) {
self.stream.shutdown(Shutdown::Both).unwrap_or_default();
}
}
fn main() {
if env::args().len() != 3 {
eprintln!("Usage: bgpdumper PEER AS");
return;
}
let vargs: Vec<String> = env::args().map(|x| x).collect();
let targetip: std::net::IpAddr = match vargs[1].parse() {
Ok(x) => x,
Err(_) => {
eprintln!("Invalid peer IP - {}", vargs[1]);
return;
}
};
let targetasn: u32 = match vargs[2].parse() {
Ok(x) => x,
Err(_) => {
eprintln!("Invalid peer ASn - {}", vargs[2]);
return;
}
};
let target = std::net::SocketAddr::new(targetip, 179);
let stream = std::net::TcpStream::connect(target).expect("Unable to connect to bgp speaker");
let mut peer = BgpDumper::new(
BgpSessionParams::new(
targetasn,
180,
BgpTransportMode::IPv4,
std::net::Ipv4Addr::new(1, 0, 0, 0),
vec![
BgpCapability::SafiIPv4u,
BgpCapability::SafiIPv4m,
BgpCapability::SafiIPv4lu,
BgpCapability::SafiIPv6lu,
BgpCapability::SafiVPNv4u,
BgpCapability::SafiVPNv4m,
BgpCapability::SafiVPNv6u,
BgpCapability::SafiVPNv6m,
BgpCapability::SafiIPv4mvpn,
BgpCapability::SafiVPLS,
BgpCapability::CapRR,
BgpCapability::CapASN32(targetasn),
]
.into_iter()
.collect(),
),
stream,
);
match peer.start_active() {
Err(e) => {
eprintln!("failed to create BGP peer; err = {:?}", e);
peer.close();
return;
}
Ok(_) => {}
};
println!("Run lifecycle");
peer.lifecycle().unwrap();
println!("Done lifecycle");
peer.close();
}
|
extern crate zettabgp;
use std::env;
use std::io::{Read, Write};
use std::net::{Shutdown, TcpStream};
use std::thread::{sleep, spawn};
use zettabgp::prelude::*;
pub struct BgpDumper {
pub params: BgpSessionParams,
pub stream: TcpStream,
}
impl BgpDumper {
pub fn new(bgp_params: BgpSessionParams, tcpstream: TcpStream) -> BgpDumper {
BgpDumper {
params: bgp_params,
stream: tcpstream,
}
}
fn recv_message_head(&mut self) -> Result<(BgpMessageType, usize), BgpError> {
let mut buf = [0 as u8; 19];
self.stream.read_exact(&mut buf)?;
self.params.decode_message_head(&buf)
}
pub fn start_active(&mut self) -> Result<(), BgpError> {
let mut bom = self.params.open_message();
let mut buf = [255 as u8; 4096];
let messagelen = match bom.encode_to(&self.params, &mut buf[19..]) {
Err(e) => {
return Err(e);
}
Ok(sz) => sz,
};
let blen = self
.params
.prepare_message_buf(&mut buf, BgpMessageType::Open, messagelen)?;
self.stream.write_all(&buf[0..blen])?;
let msg = match self.recv_message_head() {
Err(e) => {
return Err(e);
}
Ok(msg) => msg,
};
if msg.0 != BgpMessageType::Open {
return Err(BgpError::static_str("Invalid state to start_active"));
}
self.stream.read_exact(&mut buf[0..msg.1])?;
bom.decode_from(&self.params, &buf[0..msg.1])?;
self.params.hold_time = bom.hold_time;
self.params.caps = bom.caps;
self.params.check_caps();
Ok(())
}
pub fn send_keepalive(stream: &mut TcpStream) -> Result<(), BgpError> {
let mut buf = [255 as u8; 19];
buf[0..16].clone_from_slice(&[255 as u8; 16]);
buf[16] = 0;
buf[17] = 19;
buf[18] = 4;
match stream.write_all(&buf) {
Ok(_) => Ok(()),
Err(e) => Err(e.into()),
}
}
pub fn start_keepalives(&self) -> Result<(), BgpError> {
let mut ks = self.stream.try_clone()?;
let slp = std::time::Duration::new((self.params.hold_time / 3) as u64, 0);
spawn(move || loop {
if BgpDumper::send_keepalive(&mut ks).is_err() {
break;
}
sleep(slp);
});
Ok(())
}
pub fn lifecycle(&mut self) -> Result<(), BgpError> {
self.start_keepalives()?;
let mut buf = Box::new([0 as u8; 65536]);
loop {
let msg = match self.recv_message_head() {
Ok(m) => m,
Err(e) => {
return Err(e);
}
};
if msg.0 == BgpMessageType::Keepalive {
continue;
}
self.stream.read_exact(&mut buf[0..msg.1])?;
match msg.0 {
BgpMessageType::Open => {
eprintln!("Incorrect open message!");
break;
}
BgpMessageType::Keepalive => {}
BgpMessageType::Notification => {
let mut msgnotification = BgpNotificationMessage::new();
match msgnotification.decode_from(&self.params, &buf[0..msg.1]) {
Err(e) => {
eprintln!("BGP notification decode error: {:?}", e);
}
Ok(_) => {
println!(
"BGP notification: {:?} - {:?}",
msgnotification,
msgnotification.error_text()
);
}
};
break;
}
BgpMessageType::Update => {
let mut msgupdate = BgpUpdateMessage::new();
if let Err(e) = msgupdate.decode_from(&self.params, &buf[0..msg.1]) {
eprintln!("BGP update decode error: {:?}", e);
continue;
}
println!("{:?}", msgupdate);
}
}
}
Ok(())
}
pub fn close(&mut self) {
self.stream.shutdown(Shutdown::Both).unwrap_or_default();
}
}
| fn main() {
if env::args().len() != 3 {
eprintln!("Usage: bgpdumper PEER AS");
return;
}
let vargs: Vec<String> = env::args().map(|x| x).collect();
let targetip: std::net::IpAddr = match vargs[1].parse() {
Ok(x) => x,
Err(_) => {
eprintln!("Invalid peer IP - {}", vargs[1]);
return;
}
};
let targetasn: u32 = match vargs[2].parse() {
Ok(x) => x,
Err(_) => {
eprintln!("Invalid peer ASn - {}", vargs[2]);
return;
}
};
let target = std::net::SocketAddr::new(targetip, 179);
let stream = std::net::TcpStream::connect(target).expect("Unable to connect to bgp speaker");
let mut peer = BgpDumper::new(
BgpSessionParams::new(
targetasn,
180,
BgpTransportMode::IPv4,
std::net::Ipv4Addr::new(1, 0, 0, 0),
vec![
BgpCapability::SafiIPv4u,
BgpCapability::SafiIPv4m,
BgpCapability::SafiIPv4lu,
BgpCapability::SafiIPv6lu,
BgpCapability::SafiVPNv4u,
BgpCapability::SafiVPNv4m,
BgpCapability::SafiVPNv6u,
BgpCapability::SafiVPNv6m,
BgpCapability::SafiIPv4mvpn,
BgpCapability::SafiVPLS,
BgpCapability::CapRR,
BgpCapability::CapASN32(targetasn),
]
.into_iter()
.collect(),
),
stream,
);
match peer.start_active() {
Err(e) => {
eprintln!("failed to create BGP peer; err = {:?}", e);
peer.close();
return;
}
Ok(_) => {}
};
println!("Run lifecycle");
peer.lifecycle().unwrap();
println!("Done lifecycle");
peer.close();
} | function_block-full_function | [
{
"content": "/// Stores ipv4 address into the buffer.\n\npub fn encode_addrv4_to(addr: &std::net::Ipv4Addr, buf: &mut [u8]) -> Result<usize, BgpError> {\n\n if buf.len() < 4 {\n\n return Err(BgpError::static_str(\"Invalid addrv4 length\"));\n\n }\n\n buf[0..4].clone_from_slice(&addr.octets());\... | |
Rust | embassy-stm32/src/pwm/mod.rs | Liamolucko/embassy | 4f4b19d920c103453b2b0f9ce7994ca830ddb2d7 | use crate::gpio;
use crate::rcc::RccPeripheral;
use crate::time::Hertz;
use core::marker::PhantomData;
use embassy::util::Unborrow;
use embassy_hal_common::unborrow;
use stm32_metapac::timer::vals::Ocm;
pub struct Pwm<'d, T: Instance> {
phantom: PhantomData<&'d mut T>,
}
pub struct Ch1 {}
pub struct Ch2 {}
pub struct Ch3 {}
pub struct Ch4 {}
#[derive(Clone, Copy)]
pub enum Channel {
Ch1,
Ch2,
Ch3,
Ch4,
}
impl<'d, T: Instance> Pwm<'d, T> {
pub fn new<F: Into<Hertz>>(
_tim: impl Unborrow<Target = T> + 'd,
ch1: impl Unborrow<Target = impl PwmPin<T, Ch1>> + 'd,
ch2: impl Unborrow<Target = impl PwmPin<T, Ch2>> + 'd,
ch3: impl Unborrow<Target = impl PwmPin<T, Ch3>> + 'd,
ch4: impl Unborrow<Target = impl PwmPin<T, Ch4>> + 'd,
freq: F,
) -> Self {
unborrow!(ch1, ch2, ch3, ch4);
T::enable();
T::reset();
let r = T::regs();
let mut this = Pwm {
phantom: PhantomData,
};
unsafe {
ch1.configure();
ch2.configure();
ch3.configure();
ch4.configure();
}
unsafe {
use stm32_metapac::timer::vals::Dir;
this.set_freq(freq);
r.cr1().write(|w| {
w.set_cen(true);
w.set_dir(Dir::UP)
});
this.set_ocm(Channel::Ch1, Ocm::PWMMODE1);
this.set_ocm(Channel::Ch2, Ocm::PWMMODE1);
this.set_ocm(Channel::Ch3, Ocm::PWMMODE1);
this.set_ocm(Channel::Ch4, Ocm::PWMMODE1);
}
this
}
unsafe fn set_ocm(&mut self, channel: Channel, mode: Ocm) {
let r = T::regs();
match channel {
Channel::Ch1 => r.ccmr_output(0).modify(|w| w.set_ocm(0, mode)),
Channel::Ch2 => r.ccmr_output(0).modify(|w| w.set_ocm(1, mode)),
Channel::Ch3 => r.ccmr_output(1).modify(|w| w.set_ocm(0, mode)),
Channel::Ch4 => r.ccmr_output(1).modify(|w| w.set_ocm(1, mode)),
}
}
unsafe fn set_enable(&mut self, channel: Channel, enable: bool) {
let r = T::regs();
match channel {
Channel::Ch1 => r.ccer().modify(|w| w.set_cce(0, enable)),
Channel::Ch2 => r.ccer().modify(|w| w.set_cce(1, enable)),
Channel::Ch3 => r.ccer().modify(|w| w.set_cce(2, enable)),
Channel::Ch4 => r.ccer().modify(|w| w.set_cce(3, enable)),
}
}
pub fn enable(&mut self, channel: Channel) {
unsafe { self.set_enable(channel, true) }
}
pub fn disable(&mut self, channel: Channel) {
unsafe { self.set_enable(channel, false) }
}
pub fn set_freq<F: Into<Hertz>>(&mut self, freq: F) {
use core::convert::TryInto;
let clk = T::frequency();
let r = T::regs();
let freq: Hertz = freq.into();
let ticks: u32 = clk.0 / freq.0;
let psc: u16 = (ticks / (1 << 16)).try_into().unwrap();
let arr: u16 = (ticks / (u32::from(psc) + 1)).try_into().unwrap();
unsafe {
r.psc().write(|w| w.set_psc(psc));
r.arr().write(|w| w.set_arr(arr));
}
}
pub fn get_max_duty(&self) -> u32 {
let r = T::regs();
unsafe { r.arr().read().arr() as u32 }
}
pub fn set_duty(&mut self, channel: Channel, duty: u32) {
use core::convert::TryInto;
assert!(duty < self.get_max_duty());
let duty: u16 = duty.try_into().unwrap();
let r = T::regs();
unsafe {
match channel {
Channel::Ch1 => r.ccr(0).modify(|w| w.set_ccr(duty)),
Channel::Ch2 => r.ccr(1).modify(|w| w.set_ccr(duty)),
Channel::Ch3 => r.ccr(2).modify(|w| w.set_ccr(duty)),
Channel::Ch4 => r.ccr(3).modify(|w| w.set_ccr(duty)),
}
}
}
}
pub(crate) mod sealed {
pub trait Instance {
fn regs() -> crate::pac::timer::TimGp16;
}
}
pub trait Instance: sealed::Instance + Sized + RccPeripheral + 'static {}
#[allow(unused)]
macro_rules! impl_timer {
($inst:ident) => {
impl crate::pwm::sealed::Instance for crate::peripherals::$inst {
fn regs() -> crate::pac::timer::TimGp16 {
crate::pac::timer::TimGp16(crate::pac::$inst.0)
}
}
impl crate::pwm::Instance for crate::peripherals::$inst {}
};
}
pub trait PwmPin<Timer, Channel>: gpio::OptionalPin {
unsafe fn configure(&mut self);
}
impl<Timer, Channel> PwmPin<Timer, Channel> for gpio::NoPin {
unsafe fn configure(&mut self) {}
}
#[allow(unused)]
macro_rules! impl_pwm_pin {
($timer:ident, $channel:ident, $pin:ident, $af:expr) => {
impl crate::pwm::PwmPin<crate::peripherals::$timer, crate::pwm::$channel>
for crate::peripherals::$pin
{
unsafe fn configure(&mut self) {
use crate::gpio::sealed::{AFType, Pin};
use crate::gpio::Speed;
self.set_low();
self.set_speed(Speed::VeryHigh);
self.set_as_af($af, AFType::OutputPushPull);
}
}
};
}
crate::pac::peripherals!(
(timer, $inst:ident) => { impl_timer!($inst); };
);
crate::pac::peripheral_pins!(
($inst:ident, timer,TIM_GP16, $pin:ident, CH1, $af:expr) => {
impl_pwm_pin!($inst, Ch1, $pin, $af);
};
($inst:ident, timer,TIM_GP16, $pin:ident, CH2, $af:expr) => {
impl_pwm_pin!($inst, Ch2, $pin, $af);
};
($inst:ident, timer,TIM_GP16, $pin:ident, CH3, $af:expr) => {
impl_pwm_pin!($inst, Ch3, $pin, $af);
};
($inst:ident, timer,TIM_GP16, $pin:ident, CH4, $af:expr) => {
impl_pwm_pin!($inst, Ch4, $pin, $af);
};
);
| use crate::gpio;
use crate::rcc::RccPeripheral;
use crate::time::Hertz;
use core::marker::PhantomData;
use embassy::util::Unborrow;
use embassy_hal_common::unborrow;
use stm32_metapac::timer::vals::Ocm;
pub struct Pwm<'d, T: Instance> {
phantom: PhantomData<&'d mut T>,
}
pub struct Ch1 {}
pub struct Ch2 {}
pub struct Ch3 {}
pub struct Ch4 {}
#[derive(Clone, Copy)]
pub enum Channel {
Ch1,
Ch2,
Ch3,
Ch4,
}
impl<'d, T: Instance> Pwm<'d, T> {
pub fn new<F: Into<Hertz>>(
_tim: impl Unborrow<Target = T> + 'd,
ch1: impl Unborrow<Target = impl PwmPin<T, Ch1>> + 'd,
ch2: impl Unborrow<Target = impl PwmPin<T, Ch2>> + 'd,
ch3: impl Unborrow<Target = impl PwmPin<T, Ch3>> + 'd,
ch4: impl Unborrow<Target = impl PwmPin<T, Ch4>> + 'd,
freq: F,
) -> Self {
unborrow!(ch1, ch2, ch3, ch4);
T::enable();
T::reset();
let r = T::regs();
let mut this = Pwm {
phantom: PhantomData,
};
unsafe {
ch1.configure();
ch2.configure();
ch3.configure();
ch4.configure();
}
unsafe {
use stm32_metapac::timer::vals::Dir;
this.set_freq(freq);
r.cr1().write(|w| {
w.set_cen(true);
w.set_dir(Dir::UP)
});
this.set_ocm(Channel::Ch1, Ocm::PWMMODE1);
this.set_ocm(Channel::Ch2, Ocm::PWMMODE1);
this.set_ocm(Channel::Ch3, Ocm::PWMMODE1);
this.set_ocm(Channel::Ch4, Ocm::PWMMODE1);
}
this
}
unsafe fn set_ocm(&mut self, channel: Channel, mode: Ocm) {
let r = T::regs();
match channel {
Channel::Ch1 => r.ccmr_output(0).modify(|w| w.set_ocm(0, mode)),
Channel::Ch2 => r.ccmr_output(0).modify(|w| w.set_ocm(1, mode)),
Channel::Ch3 => r.ccmr_output(1).modify(|w| w.set_ocm(0, mode)),
Channel::Ch4 => r.ccmr_output(1).modify(|w| w.set_ocm(1, mode)),
}
}
unsafe fn set_enable(&mut self, channel: Channel, enable: bool) {
let r = T::regs();
match channel {
Channel::Ch1 => r.ccer().modify(|w| w.set_cce(0, enable)),
Channel::Ch2 => r.ccer().modify(|w| w.set_cce(1, enable)),
Channel::Ch3 => r.ccer().modify(|w| w.set_cce(2, enable)),
Channel::Ch4 => r.ccer().modify(|w| w.set_cce(3, enable)),
}
}
pub fn enable(&mut self, channel: Channel) {
unsafe { self.set_enable(channel, true) }
}
pub fn disable(&mut self, channel: Channel) {
unsafe { self.set_enable(channel, false) }
}
|
pub fn get_max_duty(&self) -> u32 {
let r = T::regs();
unsafe { r.arr().read().arr() as u32 }
}
pub fn set_duty(&mut self, channel: Channel, duty: u32) {
use core::convert::TryInto;
assert!(duty < self.get_max_duty());
let duty: u16 = duty.try_into().unwrap();
let r = T::regs();
unsafe {
match channel {
Channel::Ch1 => r.ccr(0).modify(|w| w.set_ccr(duty)),
Channel::Ch2 => r.ccr(1).modify(|w| w.set_ccr(duty)),
Channel::Ch3 => r.ccr(2).modify(|w| w.set_ccr(duty)),
Channel::Ch4 => r.ccr(3).modify(|w| w.set_ccr(duty)),
}
}
}
}
pub(crate) mod sealed {
pub trait Instance {
fn regs() -> crate::pac::timer::TimGp16;
}
}
pub trait Instance: sealed::Instance + Sized + RccPeripheral + 'static {}
#[allow(unused)]
macro_rules! impl_timer {
($inst:ident) => {
impl crate::pwm::sealed::Instance for crate::peripherals::$inst {
fn regs() -> crate::pac::timer::TimGp16 {
crate::pac::timer::TimGp16(crate::pac::$inst.0)
}
}
impl crate::pwm::Instance for crate::peripherals::$inst {}
};
}
pub trait PwmPin<Timer, Channel>: gpio::OptionalPin {
unsafe fn configure(&mut self);
}
impl<Timer, Channel> PwmPin<Timer, Channel> for gpio::NoPin {
unsafe fn configure(&mut self) {}
}
#[allow(unused)]
macro_rules! impl_pwm_pin {
($timer:ident, $channel:ident, $pin:ident, $af:expr) => {
impl crate::pwm::PwmPin<crate::peripherals::$timer, crate::pwm::$channel>
for crate::peripherals::$pin
{
unsafe fn configure(&mut self) {
use crate::gpio::sealed::{AFType, Pin};
use crate::gpio::Speed;
self.set_low();
self.set_speed(Speed::VeryHigh);
self.set_as_af($af, AFType::OutputPushPull);
}
}
};
}
crate::pac::peripherals!(
(timer, $inst:ident) => { impl_timer!($inst); };
);
crate::pac::peripheral_pins!(
($inst:ident, timer,TIM_GP16, $pin:ident, CH1, $af:expr) => {
impl_pwm_pin!($inst, Ch1, $pin, $af);
};
($inst:ident, timer,TIM_GP16, $pin:ident, CH2, $af:expr) => {
impl_pwm_pin!($inst, Ch2, $pin, $af);
};
($inst:ident, timer,TIM_GP16, $pin:ident, CH3, $af:expr) => {
impl_pwm_pin!($inst, Ch3, $pin, $af);
};
($inst:ident, timer,TIM_GP16, $pin:ident, CH4, $af:expr) => {
impl_pwm_pin!($inst, Ch4, $pin, $af);
};
);
| pub fn set_freq<F: Into<Hertz>>(&mut self, freq: F) {
use core::convert::TryInto;
let clk = T::frequency();
let r = T::regs();
let freq: Hertz = freq.into();
let ticks: u32 = clk.0 / freq.0;
let psc: u16 = (ticks / (1 << 16)).try_into().unwrap();
let arr: u16 = (ticks / (u32::from(psc) + 1)).try_into().unwrap();
unsafe {
r.psc().write(|w| w.set_psc(psc));
r.arr().write(|w| w.set_arr(arr));
}
} | function_block-full_function | [
{
"content": "/// Low power blocking wait loop using WFE/SEV.\n\npub fn low_power_wait_until(mut condition: impl FnMut() -> bool) {\n\n while !condition() {\n\n // WFE might \"eat\" an event that would have otherwise woken the executor.\n\n cortex_m::asm::wfe();\n\n }\n\n // Retrigger an ... |
Rust | src/lib.rs | JerTH/elfy | 2a761bcc4de002b72a538eae3e5ec1d5cc0f3ba8 | #![warn(missing_docs)]
use std::error::Error;
use std::fmt::{ Display, Formatter };
use std::io::{ Read, Seek, SeekFrom };
use std::collections::HashMap;
#[macro_use]
mod macros;
pub mod types;
pub mod numeric;
pub mod constants;
use crate::types::*;
pub type ParseElfResult<T> = std::result::Result<T, ParseElfError>;
#[derive(Debug)]
pub enum ParseElfError {
IoError{
inner: std::io::Error
},
#[allow(missing_docs)]
InvalidSectionType(u32),
#[allow(missing_docs)]
InvalidProgramFlags(u32),
#[allow(missing_docs)]
InvalidProgramHeader(u32),
#[allow(missing_docs)]
InvalidVersion(u32),
#[allow(missing_docs)]
InvalidMachine(u16),
#[allow(missing_docs)]
InvalidElfType(u16),
#[allow(missing_docs)]
InvalidOsAbi(u8),
#[allow(missing_docs)]
InvalidIdentVersion(u8),
#[allow(missing_docs)]
InvalidDataFormat(u8),
#[allow(missing_docs)]
InvalidDataClass(u8),
InvalidParsingDescriptor,
}
impl Error for ParseElfError {
fn source(&self) -> Option<&(dyn Error + 'static)> {
match self {
ParseElfError::IoError{ inner } => Some(inner),
_ => None,
}
}
}
impl Display for ParseElfError {
fn fmt(&self, f: &mut Formatter) -> std::fmt::Result {
write!(f, "{:?}", self)
}
}
impl From<std::io::Error> for ParseElfError {
fn from(err: std::io::Error) -> ParseElfError {
ParseElfError::IoError{ inner: err }
}
}
trait Parslet {
fn parse<R: Read + Seek>(reader: &mut R, descriptor: &mut Descriptor) -> ParseElfResult<Self> where Self: Sized;
}
enum Descriptor {
None,
Data{ format: DataFormat, class: DataClass },
}
impl Descriptor {
fn data_class(&self) -> ParseElfResult<DataClass> {
match self {
Descriptor::Data{ class, .. } => Ok(*class),
Descriptor::None => Err(ParseElfError::InvalidParsingDescriptor),
}
}
fn data_format(&self) -> ParseElfResult<DataFormat> {
match self {
Descriptor::Data{ format, .. } => Ok(*format),
Descriptor::None => Err(ParseElfError::InvalidParsingDescriptor)
}
}
}
#[derive(Debug)]
pub struct Elf {
header: ElfHeader,
sections: Vec<Section>,
segments: Vec<Segment>,
section_map: HashMap<String, usize>,
}
impl Elf {
pub fn load<P: AsRef<std::path::Path>>(path: P) -> ParseElfResult<Elf> {
let file = std::fs::File::open(path)?;
let mut buf = std::io::BufReader::new(file);
Ok(Elf::parse(&mut buf)?)
}
pub fn parse<R: Read + Seek>(reader: &mut R) -> ParseElfResult<Elf> {
let mut descriptor = Descriptor::None;
let header = ElfHeader::parse(reader, &mut descriptor)?;
let sections = parse_sections(reader, &mut descriptor, &header)?;
let segments = parse_segments(reader, &mut descriptor, &header)?;
let mut section_map = HashMap::new();
associate_string_table(&mut section_map, §ions, &header);
Ok(Elf{
header,
sections,
segments,
section_map
})
}
pub fn try_get_section(&self, section_name: &str) -> Option<&Section> {
self.sections.get(*self.section_map.get(section_name)?)
}
pub fn header(&self) -> &ElfHeader {
&self.header
}
pub fn sections(&self) -> SectionIter {
SectionIter {
elf: &self,
idx: 0
}
}
pub fn segments(&self) -> SegmentIter {
SegmentIter {
elf: &self,
idx: 0
}
}
}
fn parse_sections<R: Read + Seek>(reader: &mut R, descriptor: &mut Descriptor, header: &ElfHeader) -> ParseElfResult<Vec<Section>> {
reader.seek(SeekFrom::Start(header.section_headers_offset()))?;
let mut sections = Vec::new();
for _ in 0..header.section_header_count() {
sections.push(Section::parse(reader, descriptor)?)
}
Ok(sections)
}
fn parse_segments<R: Read + Seek>(reader: &mut R, descriptor: &mut Descriptor, header: &ElfHeader) -> ParseElfResult<Vec<Segment>> {
reader.seek(SeekFrom::Start(header.program_headers_offset()))?;
let mut segments = Vec::new();
for _ in 0..header.program_header_count() {
segments.push(Segment::parse(reader, descriptor)?)
}
Ok(segments)
}
fn associate_string_table(section_map: &mut HashMap<String, usize>, sections: &[Section], header: &ElfHeader) {
if let Some(idx) = header.section_name_table_index() {
if let SectionData::Strings(table) = §ions[idx].data() {
for (i, _section) in sections.iter().enumerate() {
let name = table[i].clone();
section_map.insert(name, i);
}
}
}
}
pub struct SectionIter<'a> {
elf: &'a Elf,
idx: usize,
}
impl<'a> Iterator for SectionIter<'a> {
type Item = &'a Section;
fn next(&mut self) -> Option<Self::Item> {
let item = self.elf.sections.get(self.idx)?;
self.idx += 1;
Some(item)
}
}
pub struct SegmentIter<'a> {
elf: &'a Elf,
idx: usize,
}
impl<'a> Iterator for SegmentIter<'a> {
type Item = &'a Segment;
fn next(&mut self) -> Option<Self::Item> {
let item = self.elf.segments.get(self.idx)?;
self.idx += 1;
Some(item)
}
}
pub mod prelude {
pub use crate::numeric::*;
pub use crate::types::*;
pub use crate::Elf;
}
#[cfg(test)]
mod test {
use super::*;
fn _load_example_binary() -> Elf {
let elf = Elf::load("examples/example-binary").unwrap();
elf
}
#[test]
fn get_section_bytes() {
let elf = _load_example_binary();
let text = elf.try_get_section(".text").unwrap();
if let SectionData::Bytes(_bytes) = text.data() {
}
}
#[test]
fn section_iters() {
let elf = _load_example_binary();
for (i, s) in elf.sections().enumerate() {
match i {
0 => assert_eq!(s.header().section_type(), SectionType::Null),
2 => assert_eq!(s.header().section_type(), SectionType::ProgramData),
5 => assert_eq!(s.header().section_type(), SectionType::SymbolTable),
6 => assert_eq!(s.header().section_type(), SectionType::StringTable),
_ => continue
}
}
}
#[test]
fn segment_iters() {
let elf = _load_example_binary();
println!("{:#?}", elf);
for (i, h) in elf.segments().enumerate() {
match i {
0 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::Phdr),
1 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::Loadable),
2 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::Loadable),
3 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::GnuStack),
4 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::ArmExidx),
_ => continue
}
}
}
}
| #![warn(missing_docs)]
use std::error::Error;
use std::fmt::{ Display, Formatter };
use std::io::{ Read, Seek, SeekFrom };
use std::collections::HashMap;
#[macro_use]
mod macros;
pub mod types;
pub mod numeric;
pub mod constants;
use crate::types::*;
pub type ParseElfResult<T> = std::result::Result<T, ParseElfError>;
#[derive(Debug)]
pub enum ParseElfError {
IoError{
inner: std::io::Error
},
#[allow(missing_docs)]
InvalidSectionType(u32),
#[allow(missing_docs)]
InvalidProgramFlags(u32),
#[allow(missing_docs)]
InvalidProgramHeader(u32),
#[allow(missing_docs)]
InvalidVersion(u32),
#[allow(missing_docs)]
InvalidMachine(u16),
#[allow(missing_docs)]
InvalidElfType(u16),
#[allow(missing_docs)]
InvalidOsAbi(u8),
#[allow(missing_docs)]
InvalidIdentVersion(u8),
#[allow(missing_docs)]
InvalidDataFormat(u8),
#[allow(missing_docs)]
InvalidDataClass(u8),
InvalidParsingDescriptor,
}
impl Error for ParseElfError {
fn source(&self) -> Option<&(dyn Error + 'static)> {
match self {
ParseElfError::IoError{ inner } => Some(inner),
_ => None,
}
}
}
impl Display for ParseElfError {
fn fmt(&self, f: &mut Formatter) -> std::fmt::Result {
write!(f, "{:?}", self)
}
}
impl From<std::io::Error> for ParseElfError {
fn from(err: std::io::Error) -> ParseElfError {
ParseElfError::IoError{ inner: err }
}
}
trait Parslet {
fn parse<R: Read + Seek>(reader: &mut R, descriptor: &mut Descriptor) -> ParseElfResult<Self> where Self: Sized;
}
enum Descriptor {
None,
Data{ format: DataFormat, class: DataClass },
}
impl Descriptor {
fn data_class(&self) -> ParseElfResult<DataClass> {
match self {
Descriptor::Data{ class, .. } => Ok(*class),
Descriptor::None => Err(ParseElfError::InvalidParsingDescriptor),
}
}
fn data_format(&self) -> ParseElfResult<DataFormat> {
match self {
Descriptor::Data{ format, .. } => Ok(*format),
Descriptor::None => Err(ParseElfError::InvalidParsingDescriptor)
}
}
}
#[derive(Debug)]
pub struct Elf {
header: ElfHeader,
sections: Vec<Section>,
segments: Vec<Segment>,
section_map: HashMap<String, usize>,
}
impl Elf {
pub fn load<P: AsRef<std::path::Path>>(path: P) -> ParseElfResult<Elf> {
let file = std::fs::File::open(path)?;
let mut buf = std::io::BufReader::new(file);
Ok(Elf::parse(&mut buf)?)
}
pub fn parse<R: Read + Seek>(reader: &mut R) -> ParseElfResult<Elf> {
let mut descriptor = Descriptor::None;
let header = ElfHeader::parse(reader, &mut descriptor)?;
let sections = parse_sections(reader, &mut descriptor, &header)?;
let segments = parse_segments(reader, &mut descriptor, &header)?;
let mut section_map = HashMap::new();
associate_string_table(&mut section_map, §ions, &header);
Ok(Elf{
header,
sections,
segments,
section_map
})
}
pub fn try_get_section(&self, section_name: &str) -> Option<&Section> {
self.sections.get(*self.section_map.get(section_name)?)
}
pub fn header(&self) -> &ElfHeader {
&self.header
}
pub fn sections(&self) -> SectionIter {
SectionIter {
elf: &self,
idx: 0
}
}
pub fn segments(&self) -> SegmentIter {
SegmentIter {
elf: &self,
idx: 0
}
}
}
fn parse_sections<R: Read + Seek>(reader: &mut R, descriptor: &mut Descriptor, header: &ElfHeader) -> ParseElfResult<Vec<Section>> {
reader.seek(SeekFrom::Start(header.section_headers_offset()))?;
let mut sections = Vec::new();
for _ in 0..header.section_header_count() {
sections.push(Section::pa | 0 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::Phdr),
1 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::Loadable),
2 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::Loadable),
3 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::GnuStack),
4 => assert_eq!(h.header().program_header_type(), ProgramHeaderType::ArmExidx),
_ => continue
}
}
}
}
| rse(reader, descriptor)?)
}
Ok(sections)
}
fn parse_segments<R: Read + Seek>(reader: &mut R, descriptor: &mut Descriptor, header: &ElfHeader) -> ParseElfResult<Vec<Segment>> {
reader.seek(SeekFrom::Start(header.program_headers_offset()))?;
let mut segments = Vec::new();
for _ in 0..header.program_header_count() {
segments.push(Segment::parse(reader, descriptor)?)
}
Ok(segments)
}
fn associate_string_table(section_map: &mut HashMap<String, usize>, sections: &[Section], header: &ElfHeader) {
if let Some(idx) = header.section_name_table_index() {
if let SectionData::Strings(table) = §ions[idx].data() {
for (i, _section) in sections.iter().enumerate() {
let name = table[i].clone();
section_map.insert(name, i);
}
}
}
}
pub struct SectionIter<'a> {
elf: &'a Elf,
idx: usize,
}
impl<'a> Iterator for SectionIter<'a> {
type Item = &'a Section;
fn next(&mut self) -> Option<Self::Item> {
let item = self.elf.sections.get(self.idx)?;
self.idx += 1;
Some(item)
}
}
pub struct SegmentIter<'a> {
elf: &'a Elf,
idx: usize,
}
impl<'a> Iterator for SegmentIter<'a> {
type Item = &'a Segment;
fn next(&mut self) -> Option<Self::Item> {
let item = self.elf.segments.get(self.idx)?;
self.idx += 1;
Some(item)
}
}
pub mod prelude {
pub use crate::numeric::*;
pub use crate::types::*;
pub use crate::Elf;
}
#[cfg(test)]
mod test {
use super::*;
fn _load_example_binary() -> Elf {
let elf = Elf::load("examples/example-binary").unwrap();
elf
}
#[test]
fn get_section_bytes() {
let elf = _load_example_binary();
let text = elf.try_get_section(".text").unwrap();
if let SectionData::Bytes(_bytes) = text.data() {
}
}
#[test]
fn section_iters() {
let elf = _load_example_binary();
for (i, s) in elf.sections().enumerate() {
match i {
0 => assert_eq!(s.header().section_type(), SectionType::Null),
2 => assert_eq!(s.header().section_type(), SectionType::ProgramData),
5 => assert_eq!(s.header().section_type(), SectionType::SymbolTable),
6 => assert_eq!(s.header().section_type(), SectionType::StringTable),
_ => continue
}
}
}
#[test]
fn segment_iters() {
let elf = _load_example_binary();
println!("{:#?}", elf);
for (i, h) in elf.segments().enumerate() {
match i {
| random | [
{
"content": "}\n\n\n\nmacro_rules! read_u64 {\n\n ($reader:expr, $descriptor:expr) => {\n\n {\n\n let mut __bytes: [u8; 8] = [0; 8];\n\n let mut __temp: u64 = 0;\n\n $reader.read_exact(&mut __bytes)?;\n\n unsafe {\n\n __temp = std::mem::trans... |
Rust | rs/2021/day20/src/main.rs | cs-cordero/advent-of-code | 614b8f78b43c54ef180a7dc411a0d1366a62944f | use advent_of_code::read_input_as_string;
use std::collections::HashSet;
use std::fmt::{Display, Formatter};
type Point = (isize, isize);
#[derive(Clone, Debug)]
struct Rect {
lo_row: isize,
lo_col: isize,
hi_row: isize,
hi_col: isize,
}
impl Rect {
fn contains(&self, point: &Point) -> bool {
let (row, col) = *point;
self.lo_row <= row && row <= self.hi_row && self.lo_col <= col && col <= self.hi_col
}
fn on_edge_or_outside(&self, point: &Point) -> bool {
let (row, col) = *point;
let on_horizontal_edge = (self.lo_col..=self.hi_col).contains(&col)
&& (row == self.lo_row || row == self.hi_row);
let on_vertical_edge = (self.lo_row..=self.hi_row).contains(&row)
&& (col == self.lo_col || col == self.hi_col);
on_horizontal_edge || on_vertical_edge || !self.contains(point)
}
fn expand(&self, increase: isize) -> Self {
Self {
lo_row: self.lo_row - increase,
lo_col: self.lo_col - increase,
hi_row: self.hi_row + increase,
hi_col: self.hi_col + increase,
}
}
fn iter(&self) -> impl Iterator<Item = (isize, isize)> {
let lo_row = self.lo_row;
let hi_row = self.hi_row;
let lo_col = self.lo_col;
let hi_col = self.hi_col;
(lo_row..=hi_row).flat_map(move |row| (lo_col..=hi_col).map(move |col| (row, col)))
}
fn rows(&self) -> impl Iterator<Item = impl Iterator<Item = (isize, isize)>> {
let lo_row = self.lo_row;
let hi_row = self.hi_row;
let lo_col = self.lo_col;
let hi_col = self.hi_col;
(lo_row..=hi_row).map(move |row| (lo_col..=hi_col).map(move |col| (row, col)))
}
}
#[derive(Clone, Debug)]
struct Image {
pixels_on: HashSet<Point>,
dimensions: Rect,
enhance_iteration_toggle: bool,
enhance_algorithm: Vec<char>,
}
impl Display for Image {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
let s = self
.dimensions
.rows()
.map(|row| {
row.map(|point| {
if self.pixels_on.contains(&point) {
'#'
} else {
'.'
}
})
.collect::<String>()
})
.collect::<Vec<_>>()
.join("\n");
write!(f, "{}", s)
}
}
impl Image {
fn create_enhanced_image(self) -> Image {
let enhanced_rect = self.dimensions.expand(1);
let new_pixels = enhanced_rect
.iter()
.filter(|point| {
let algorithm_index = self.get_encoded_enhanced_pixel(*point, &enhanced_rect);
*self.enhance_algorithm.get(algorithm_index).unwrap() == '#'
})
.collect::<HashSet<Point>>();
Image {
pixels_on: new_pixels,
dimensions: enhanced_rect,
enhance_iteration_toggle: !self.enhance_iteration_toggle,
enhance_algorithm: self.enhance_algorithm,
}
}
#[inline]
fn get_encoded_enhanced_pixel(&self, center: Point, enhanced_rect: &Rect) -> usize {
let edge_or_beyond_value = if self.distance_points_will_toggle() {
if self.enhance_iteration_toggle {
1
} else {
0
}
} else {
0
};
let (row, col) = center;
[
(row - 1, col - 1),
(row - 1, col),
(row - 1, col + 1),
(row, col - 1),
(row, col),
(row, col + 1),
(row + 1, col - 1),
(row + 1, col),
(row + 1, col + 1),
]
.iter()
.map(|point| {
if enhanced_rect.on_edge_or_outside(point) {
edge_or_beyond_value
} else if self.pixels_on.contains(point) {
1
} else {
0
}
})
.fold(0usize, |acc, bit| (acc << 1) + bit)
}
#[inline]
fn distance_points_will_toggle(&self) -> bool {
self.enhance_algorithm
.first()
.zip(self.enhance_algorithm.last())
.map(|(first, last)| *first == '#' && *last == '.')
.unwrap_or(false)
}
}
fn main() {
let raw = read_input_as_string("2021/day20/src/input.txt");
let image = {
let (raw_algorithm, raw_image) = raw.split_once("\n\n").unwrap();
let algorithm = raw_algorithm.chars().collect::<Vec<_>>();
let image = raw_image
.lines()
.enumerate()
.flat_map(|(row, line)| {
line.chars()
.enumerate()
.filter(|(_, pixel)| *pixel == '#')
.map(move |(col, _)| (row as isize, col as isize))
})
.collect::<HashSet<Point>>();
let dimensions = Rect {
lo_row: 0,
lo_col: 0,
hi_row: *image.iter().map(|(row, _)| row).max().unwrap(),
hi_col: *image.iter().map(|(_, col)| col).max().unwrap(),
};
Image {
pixels_on: image,
dimensions,
enhance_iteration_toggle: false,
enhance_algorithm: algorithm,
}
};
let answer1 = image
.clone()
.create_enhanced_image()
.create_enhanced_image()
.pixels_on
.len();
let answer2 = (0..50)
.fold(image, |acc, _| acc.create_enhanced_image())
.pixels_on
.len();
println!("Part 1: {:?}", answer1);
println!("Part 2: {:?}", answer2);
}
| use advent_of_code::read_input_as_string;
use std::collections::HashSet;
use std::fmt::{Display, Formatter};
type Point = (isize, isize);
#[derive(Clone, Debug)]
struct Rect {
lo_row: isize,
lo_col: isize,
hi_row: isize,
hi_col: isize,
}
impl Rect {
fn contains(&self, point: &Point) -> bool {
let (row, col) = *point;
self.lo_row <= row && row <= self.hi_row && self.lo_col <= col && col <= self.hi_col
}
fn on_edge_or_outside(&self, point: &Point) -> bool {
let (row, col) = *point;
let on_horizontal_edge = (self.lo_col..=self.hi_col).contains(&col)
&& (row == self.lo_row || row == self.hi_row);
let on_vertical_edge = (self.lo_row..=self.hi_row).contains(&row)
&& (col == self.lo_col || col == self.hi_col);
on_horizontal_edge || on_vertical_edge || !self.contains(point)
}
fn expand(&self, increase: isize) -> Self {
Self {
lo_row: self.lo_row - increase,
lo_col: self.lo_col - increase,
hi_row: self.hi_row + increase,
hi_col: self.hi_col + increase,
}
}
fn iter(&self) -> impl Iterator<Item = (isize, isize)> {
let lo_row = self.lo_row;
let hi_row = self.hi_row;
let lo_col = self.lo_col;
let hi_col = self.hi_col;
(lo_row..=hi_row).flat_map(move |row| (lo_col..=hi_col).map(move |col| (row, col)))
}
fn rows(&self) -> impl Iterator<Item = impl Iterator<Item = (isize, isize)>> {
let lo_row = self.lo_row;
let hi_row = self.hi_row;
let lo_col = self.lo_col;
let hi_col = self.hi_col;
(lo_row..=hi_row).map(move |row| (lo_col..=hi_col).map(move |col| (row, col)))
}
}
#[derive(Clone, Debug)]
struct Image {
pixels_on: HashSet<Point>,
dimensions: Rect,
enhance_iteration_toggle: bool,
enhance_algorithm: Vec<char>,
}
impl Display for Image {
fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
let s = self
.dimensions
.rows()
.map(|row| {
row.map(|point| {
if self.pixels_on.contains(&point) {
'#'
} else {
'.'
}
})
.collect::<String>()
})
.collect::<Vec<_>>()
.join("\n");
write!(f, "{}", s)
}
}
impl Image {
fn create_enhanced_image(self) -> Image {
let enhanced_rect = self.dimensions.expand(1);
let new_pixels = enhanced_rect
.iter()
.filter(|point| {
let algorithm_index = self.get_encoded_enhanced_pixel(*point, &enhanced_rect);
*self.enhance_algorithm.get(algorithm_index).unwrap() == '#'
})
.collect::<HashSet<Point>>();
Image {
pixels_on: new_pixels,
dimensions: enhanced_rect,
enhance_iteration_toggle: !self.enhance_iteration_toggle,
enhance_algorithm: self.enhance_algorithm,
}
}
#[inline]
fn get_encoded_enhanced_pixel(&self, center: Point, enhanced_rect: &Rect) -> usize {
let edge_or_beyond_value = if self.distance_points_will_toggle() {
if self.enhance_iteration_toggle {
1
} else {
0
}
} else {
0
};
let (row, col) = center;
[
(row - 1, col - 1),
(row - 1, col),
(row - 1, col + 1),
(row, col - 1),
(row, col),
(row, col + 1),
(row + 1, col - 1),
(row + 1, col),
(row + 1, col + 1),
]
.iter()
.map(|point| {
if enhanced_rect.on_edge_or_outside(point) {
edge_or_beyond_value
} else if self.pixels_on.contains(point) {
1
} else {
0
}
})
.fold(0usize, |acc, bit| (acc << 1) + bit)
}
#[inline]
fn distance_points_will_toggle(&self) -> bool {
self.enhance_algorithm
.first()
.zip(self.enhance_algorithm.last())
.map(|(first, last)| *first == '#' && *last == '.')
.unwrap_or(false)
}
}
| fn main() {
let raw = read_input_as_string("2021/day20/src/input.txt");
let image = {
let (raw_algorithm, raw_image) = raw.split_once("\n\n").unwrap();
let algorithm = raw_algorithm.chars().collect::<Vec<_>>();
let image = raw_image
.lines()
.enumerate()
.flat_map(|(row, line)| {
line.chars()
.enumerate()
.filter(|(_, pixel)| *pixel == '#')
.map(move |(col, _)| (row as isize, col as isize))
})
.collect::<HashSet<Point>>();
let dimensions = Rect {
lo_row: 0,
lo_col: 0,
hi_row: *image.iter().map(|(row, _)| row).max().unwrap(),
hi_col: *image.iter().map(|(_, col)| col).max().unwrap(),
};
Image {
pixels_on: image,
dimensions,
enhance_iteration_toggle: false,
enhance_algorithm: algorithm,
}
};
let answer1 = image
.clone()
.create_enhanced_image()
.create_enhanced_image()
.pixels_on
.len();
let answer2 = (0..50)
.fold(image, |acc, _| acc.create_enhanced_image())
.pixels_on
.len();
println!("Part 1: {:?}", answer1);
println!("Part 2: {:?}", answer2);
} | function_block-full_function | [
{
"content": "fn find_monster(image: &[Vec<char>], row: usize, col: usize) -> bool {\n\n MONSTER_OFFSETS\n\n .iter()\n\n .copied()\n\n .all(|(offset_row, offset_col)| {\n\n let operator = match offset_row.cmp(&0) {\n\n Ordering::Less => usize::checked_sub,\n\n ... | |
Rust | rust/src/main.rs | tagadvance/chms_api_examples | b8335f5e5a9216afa357944b870edf29ad838243 | #[macro_use]
extern crate dotenv_codegen;
extern crate dotenv;
mod db;
mod utils;
use db::{TokenDatabase, TokenResponse};
use reqwest::Url;
use serde::{Deserialize, Serialize};
use std::future::Future;
use std::pin::Pin;
use tide::http::url::ParseError;
use tide::utils::After;
use tide::{Body, Next, Redirect, Request, Response, Result};
use utils::{api, env};
#[derive(Deserialize)]
struct AuthCodeParams {
code: String,
state: String,
}
#[derive(Deserialize, Serialize)]
struct AuthCodeBody {
grant_type: String,
subdomain: String,
redirect_uri: String,
client_id: String,
client_secret: String,
code: String,
}
#[derive(Deserialize, Serialize)]
struct RefreshTokenBody {
refresh_token: String,
grant_type: String,
client_id: String,
client_secret: String,
}
fn build_auth_code_redirect_url(return_url: String) -> std::result::Result<Url, ParseError> {
let env = env::get_env();
Url::parse_with_params(
api::AUTH_CODE_URL,
&[
("client_id", env.client_id),
("subdomain", env.subdomain),
("redirect_uri", api::REDIRECT_URL.into()),
("response_type", String::from("code")),
("state", return_url),
],
)
}
fn build_auth_code_body(code: String) -> AuthCodeBody {
let env = env::get_env();
AuthCodeBody {
grant_type: String::from("authorization_code"),
redirect_uri: api::REDIRECT_URL.into(),
subdomain: env.subdomain,
client_id: env.client_id,
client_secret: env.client_secret,
code,
}
}
fn build_refresh_token_body(refresh_token: String) -> RefreshTokenBody {
let env = env::get_env();
RefreshTokenBody {
refresh_token,
grant_type: String::from("refresh_token"),
client_id: env.client_id,
client_secret: env.client_secret,
}
}
fn perform_refresh(db: &TokenDatabase) -> Result<String> {
let body = build_refresh_token_body(db.get_refresh_token().unwrap());
let response =
api::post::<RefreshTokenBody, TokenResponse>(&api::make_api_url("oauth/token"), &body)?;
db.handle_token_response(&response)?;
println!("Tokens refreshed.");
Ok(response.access_token)
}
fn access_token_middleware<'a>(
mut request: Request<TokenDatabase>,
next: Next<'a, TokenDatabase>,
) -> Pin<Box<dyn Future<Output = Result> + Send + 'a>> {
Box::pin(async {
if request.url().path() == "/auth" {
return Ok(next.run(request).await);
}
match request.state().get_access_token() {
Some(access_token) => {
request.set_ext(access_token);
Ok(next.run(request).await)
}
None => {
println!("Missing auth tokens. Redirecting to auth url.");
let url_path = request.url().path();
Ok(Redirect::new(build_auth_code_redirect_url(url_path.into())?).into())
}
}
})
}
async fn auth_code_handler(req: Request<TokenDatabase>) -> tide::Result {
let params: AuthCodeParams = req.query()?;
let body = build_auth_code_body(params.code);
let response =
api::post::<AuthCodeBody, TokenResponse>(&api::make_api_url("oauth/token"), &body)?;
req.state().handle_token_response(&response)?;
println!("Auth code successfully exchanged for tokens.");
Ok(Redirect::new(params.state).into())
}
async fn api_passthrough_handler(request: Request<TokenDatabase>) -> tide::Result<Response> {
let path = request.param("path")?;
match request.ext() {
None => Ok(Response::from("Token Missing")),
Some(token) => {
let url = &api::make_api_url(path);
let response = api::get::<serde_json::Value>(url, token)?;
let mut json = response.0;
if response.1 == reqwest::StatusCode::UNAUTHORIZED {
let refreshed_token = perform_refresh(request.state())?;
json = api::get::<serde_json::Value>(url, &refreshed_token)?.0;
}
return Ok(Response::from(Body::from_json(&json)?));
}
}
}
#[async_std::main]
async fn main() -> tide::Result<()> {
let mut app = tide::with_state(TokenDatabase::new()?);
app.with(access_token_middleware);
app.with(After(|mut res: Response| async {
if let Some(err) = res.take_error() {
let msg = format!("Error: {:?}", err);
res.set_status(tide::StatusCode::InternalServerError);
res.set_body(msg);
};
Ok(res)
}));
app.at("/auth").get(auth_code_handler);
app.at("api/*path").get(api_passthrough_handler);
app.listen("127.0.0.1:3000").await?;
Ok(())
}
| #[macro_use]
extern crate dotenv_codegen;
extern crate dotenv;
mod db;
mod utils;
use db::{TokenDatabase, TokenResponse};
use reqwest::Url;
use serde::{Deserialize, Serialize};
use std::future::Future;
use std::pin::Pin;
use tide::http::url::ParseError;
use tide::utils::After;
use tide::{Body, Next, Redirect, Request, Response, Result};
use utils::{api, env};
#[derive(Deserialize)]
struct AuthCodeParams {
code: String,
state: String,
}
#[derive(Deserialize, Serialize)]
struct AuthCodeBody {
grant_type: String,
subdomain: String,
re | rl("oauth/token"), &body)?;
req.state().handle_token_response(&response)?;
println!("Auth code successfully exchanged for tokens.");
Ok(Redirect::new(params.state).into())
}
async fn api_passthrough_handler(request: Request<TokenDatabase>) -> tide::Result<Response> {
let path = request.param("path")?;
match request.ext() {
None => Ok(Response::from("Token Missing")),
Some(token) => {
let url = &api::make_api_url(path);
let response = api::get::<serde_json::Value>(url, token)?;
let mut json = response.0;
if response.1 == reqwest::StatusCode::UNAUTHORIZED {
let refreshed_token = perform_refresh(request.state())?;
json = api::get::<serde_json::Value>(url, &refreshed_token)?.0;
}
return Ok(Response::from(Body::from_json(&json)?));
}
}
}
#[async_std::main]
async fn main() -> tide::Result<()> {
let mut app = tide::with_state(TokenDatabase::new()?);
app.with(access_token_middleware);
app.with(After(|mut res: Response| async {
if let Some(err) = res.take_error() {
let msg = format!("Error: {:?}", err);
res.set_status(tide::StatusCode::InternalServerError);
res.set_body(msg);
};
Ok(res)
}));
app.at("/auth").get(auth_code_handler);
app.at("api/*path").get(api_passthrough_handler);
app.listen("127.0.0.1:3000").await?;
Ok(())
}
| direct_uri: String,
client_id: String,
client_secret: String,
code: String,
}
#[derive(Deserialize, Serialize)]
struct RefreshTokenBody {
refresh_token: String,
grant_type: String,
client_id: String,
client_secret: String,
}
fn build_auth_code_redirect_url(return_url: String) -> std::result::Result<Url, ParseError> {
let env = env::get_env();
Url::parse_with_params(
api::AUTH_CODE_URL,
&[
("client_id", env.client_id),
("subdomain", env.subdomain),
("redirect_uri", api::REDIRECT_URL.into()),
("response_type", String::from("code")),
("state", return_url),
],
)
}
fn build_auth_code_body(code: String) -> AuthCodeBody {
let env = env::get_env();
AuthCodeBody {
grant_type: String::from("authorization_code"),
redirect_uri: api::REDIRECT_URL.into(),
subdomain: env.subdomain,
client_id: env.client_id,
client_secret: env.client_secret,
code,
}
}
fn build_refresh_token_body(refresh_token: String) -> RefreshTokenBody {
let env = env::get_env();
RefreshTokenBody {
refresh_token,
grant_type: String::from("refresh_token"),
client_id: env.client_id,
client_secret: env.client_secret,
}
}
fn perform_refresh(db: &TokenDatabase) -> Result<String> {
let body = build_refresh_token_body(db.get_refresh_token().unwrap());
let response =
api::post::<RefreshTokenBody, TokenResponse>(&api::make_api_url("oauth/token"), &body)?;
db.handle_token_response(&response)?;
println!("Tokens refreshed.");
Ok(response.access_token)
}
fn access_token_middleware<'a>(
mut request: Request<TokenDatabase>,
next: Next<'a, TokenDatabase>,
) -> Pin<Box<dyn Future<Output = Result> + Send + 'a>> {
Box::pin(async {
if request.url().path() == "/auth" {
return Ok(next.run(request).await);
}
match request.state().get_access_token() {
Some(access_token) => {
request.set_ext(access_token);
Ok(next.run(request).await)
}
None => {
println!("Missing auth tokens. Redirecting to auth url.");
let url_path = request.url().path();
Ok(Redirect::new(build_auth_code_redirect_url(url_path.into())?).into())
}
}
})
}
async fn auth_code_handler(req: Request<TokenDatabase>) -> tide::Result {
let params: AuthCodeParams = req.query()?;
let body = build_auth_code_body(params.code);
let response =
api::post::<AuthCodeBody, TokenResponse>(&api::make_api_u | random | [
{
"content": "pub fn get<R: DeserializeOwned>(url: &String, token: &String) -> Result<(R, reqwest::StatusCode)> {\n\n let response = reqwest::blocking::Client::new()\n\n .get(url)\n\n .header(\"Content-Type\", \"application/json\")\n\n .header(\"Accept\", \"application/vnd.ccbchurch.v2+json\")\n\n ... |
Rust | src/lib.rs | Gingeh/brainfrick | bd7fe1a2cc7dbee0b1c81e2b585c66d320facac5 | use std::collections::VecDeque;
pub struct BrainFuck {
memory: Vec<Cell>,
pointer: usize,
input: VecDeque<u8>,
counter: usize,
max_steps: usize,
}
impl BrainFuck {
#[must_use]
pub fn new(size: usize, input: &str, max_steps: usize) -> Self {
BrainFuck {
memory: vec![Cell::from(0); size],
pointer: 0,
counter: 0,
input: queue_from(input),
max_steps,
}
}
pub fn run(&mut self, program: &str) -> Result<String, String> {
let mut output = String::new();
let program: Vec<char> = program.chars().collect();
let mut steps: usize = 0;
while self.counter < program.len() {
let ch = program[self.counter];
match ch {
'+' => self.add(),
'-' => self.sub(),
'<' => self.left(),
'>' => self.right(),
'.' => output += &self.print(),
',' => self.read(),
'[' => self.start(&program)?,
']' => self.end(&program)?,
_ => {}
}
self.counter += 1;
if steps == self.max_steps {
return Err(format!(
"Exceeded maximum steps ({}), the program may be stuck in a loop.",
self.max_steps
));
}
steps += 1;
}
Ok(output)
}
fn add(&mut self) {
self.memory[self.pointer].add();
}
fn sub(&mut self) {
self.memory[self.pointer].sub();
}
fn left(&mut self) {
self.pointer = if self.pointer == 0 {
self.memory.len() - 1
} else {
self.pointer - 1
}
}
fn right(&mut self) {
self.pointer = if self.pointer == self.memory.len() - 1 {
0
} else {
self.pointer + 1
}
}
fn print(&mut self) -> String {
self.memory[self.pointer].to_string()
}
fn read(&mut self) {
self.memory[self.pointer] = Cell::from(self.input.pop_front().unwrap_or(0));
}
fn start(&mut self, program: &[char]) -> Result<(), String> {
if self.memory[self.pointer] == Cell::from(0) {
let mut level: usize = 1;
while level > 0 {
self.counter += 1;
if self.counter == program.len() {
return Err(String::from("A matching \"]\" could not be found."));
}
if program[self.counter] == '[' {
level += 1;
} else if program[self.counter] == ']' {
level -= 1;
}
}
}
Ok(())
}
fn end(&mut self, program: &[char]) -> Result<(), String> {
if self.memory[self.pointer] != Cell::from(0) {
let mut level: usize = 1;
while level > 0 {
if self.counter == 0 {
return Err(String::from("A matching \"[\" could not be found."));
}
self.counter -= 1;
if program[self.counter] == '[' {
level -= 1;
} else if program[self.counter] == ']' {
level += 1;
}
}
}
Ok(())
}
}
#[derive(PartialEq, Clone, Copy)]
struct Cell {
value: u8,
}
impl Cell {
fn add(&mut self) {
self.value = if self.value == 255 { 0 } else { self.value + 1 }
}
fn sub(&mut self) {
self.value = if self.value == 0 { 255 } else { self.value - 1 }
}
}
impl ToString for Cell {
fn to_string(&self) -> String {
String::from(self.value as char)
}
}
impl From<u8> for Cell {
fn from(value: u8) -> Self {
Self { value }
}
}
fn queue_from(input: &str) -> VecDeque<u8> {
VecDeque::from(input.as_bytes().to_vec())
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_input() {
let program = ",++.,-.";
let mut engine = BrainFuck::new(256, "a", 10000);
assert_eq!(engine.run(program), Ok(String::from("cÿ")));
}
#[test]
fn test_wraparound() {
let program = "->>.<<.";
let mut engine = BrainFuck::new(2, "", 10000);
assert_eq!(engine.run(program), Ok(String::from("ÿÿ")));
}
#[test]
fn test_max_steps() {
let program = "+[]";
let mut engine = BrainFuck::new(256, "", 100);
assert_eq!(
engine.run(program),
Err(String::from(
"Exceeded maximum steps (100), the program may be stuck in a loop."
))
);
}
#[test]
fn test_invalid_character() {
let program = "nothing lol";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(engine.run(program), Ok(String::new()));
}
#[test]
fn test_missing_bracket() {
let program = "[";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(
engine.run(program),
Err(String::from("A matching \"]\" could not be found."))
);
let program = "+]";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(
engine.run(program),
Err(String::from("A matching \"[\" could not be found."))
);
}
#[test]
fn test_loop() {
let program = "[[-.+]]++[-]-.";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(engine.run(program), Ok(String::from("ÿ")));
}
}
| use std::collections::VecDeque;
pub struct BrainFuck {
memory: Vec<Cell>,
pointer: usize,
input: VecDeque<u8>,
counter: usize,
max_steps: usize,
}
impl BrainFuck {
#[must_use]
pub fn new(size: usize, input: &str, max_steps: usize) -> Self {
BrainFuck {
memory: vec![Cell::from(0); size],
pointer: 0,
counter: 0,
input: queue_from(input),
max_steps,
}
}
pub fn run(&mut self, program: &str) -> Result<String, String> {
let mut output = String::new();
let program: Vec<char> = program.chars().collect();
let mut steps: usize = 0;
while self.counter < program.len() {
let ch = program[self.counter];
match ch {
'+ | )));
}
#[test]
fn test_max_steps() {
let program = "+[]";
let mut engine = BrainFuck::new(256, "", 100);
assert_eq!(
engine.run(program),
Err(String::from(
"Exceeded maximum steps (100), the program may be stuck in a loop."
))
);
}
#[test]
fn test_invalid_character() {
let program = "nothing lol";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(engine.run(program), Ok(String::new()));
}
#[test]
fn test_missing_bracket() {
let program = "[";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(
engine.run(program),
Err(String::from("A matching \"]\" could not be found."))
);
let program = "+]";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(
engine.run(program),
Err(String::from("A matching \"[\" could not be found."))
);
}
#[test]
fn test_loop() {
let program = "[[-.+]]++[-]-.";
let mut engine = BrainFuck::new(256, "", 10000);
assert_eq!(engine.run(program), Ok(String::from("ÿ")));
}
}
| ' => self.add(),
'-' => self.sub(),
'<' => self.left(),
'>' => self.right(),
'.' => output += &self.print(),
',' => self.read(),
'[' => self.start(&program)?,
']' => self.end(&program)?,
_ => {}
}
self.counter += 1;
if steps == self.max_steps {
return Err(format!(
"Exceeded maximum steps ({}), the program may be stuck in a loop.",
self.max_steps
));
}
steps += 1;
}
Ok(output)
}
fn add(&mut self) {
self.memory[self.pointer].add();
}
fn sub(&mut self) {
self.memory[self.pointer].sub();
}
fn left(&mut self) {
self.pointer = if self.pointer == 0 {
self.memory.len() - 1
} else {
self.pointer - 1
}
}
fn right(&mut self) {
self.pointer = if self.pointer == self.memory.len() - 1 {
0
} else {
self.pointer + 1
}
}
fn print(&mut self) -> String {
self.memory[self.pointer].to_string()
}
fn read(&mut self) {
self.memory[self.pointer] = Cell::from(self.input.pop_front().unwrap_or(0));
}
fn start(&mut self, program: &[char]) -> Result<(), String> {
if self.memory[self.pointer] == Cell::from(0) {
let mut level: usize = 1;
while level > 0 {
self.counter += 1;
if self.counter == program.len() {
return Err(String::from("A matching \"]\" could not be found."));
}
if program[self.counter] == '[' {
level += 1;
} else if program[self.counter] == ']' {
level -= 1;
}
}
}
Ok(())
}
fn end(&mut self, program: &[char]) -> Result<(), String> {
if self.memory[self.pointer] != Cell::from(0) {
let mut level: usize = 1;
while level > 0 {
if self.counter == 0 {
return Err(String::from("A matching \"[\" could not be found."));
}
self.counter -= 1;
if program[self.counter] == '[' {
level -= 1;
} else if program[self.counter] == ']' {
level += 1;
}
}
}
Ok(())
}
}
#[derive(PartialEq, Clone, Copy)]
struct Cell {
value: u8,
}
impl Cell {
fn add(&mut self) {
self.value = if self.value == 255 { 0 } else { self.value + 1 }
}
fn sub(&mut self) {
self.value = if self.value == 0 { 255 } else { self.value - 1 }
}
}
impl ToString for Cell {
fn to_string(&self) -> String {
String::from(self.value as char)
}
}
impl From<u8> for Cell {
fn from(value: u8) -> Self {
Self { value }
}
}
fn queue_from(input: &str) -> VecDeque<u8> {
VecDeque::from(input.as_bytes().to_vec())
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_input() {
let program = ",++.,-.";
let mut engine = BrainFuck::new(256, "a", 10000);
assert_eq!(engine.run(program), Ok(String::from("cÿ")));
}
#[test]
fn test_wraparound() {
let program = "->>.<<.";
let mut engine = BrainFuck::new(2, "", 10000);
assert_eq!(engine.run(program), Ok(String::from("ÿÿ" | random | [
{
"content": "#[derive(StructOpt)]\n\n#[structopt(name = \"brainfrick\", about = \"Rust implementation of Brainfuck\")]\n\nstruct Opt {\n\n /// Path to program [optional: will use stdin instead]\n\n #[structopt()]\n\n path: Option<path::PathBuf>,\n\n\n\n /// Input given to program\n\n #[structopt... |
Rust | src/service.rs | kfastov/moleculer-rs | c59695f4567a53d24cc9b9072d67a21f104059ff |
use serde::{Deserialize, Serialize};
use serde_json::Value;
use std::{collections::HashMap, marker::PhantomData};
use crate::{
channels::messages::incoming::{EventMessage, RequestMessage},
Error, ServiceBroker,
};
pub type Callback<T> = fn(Context<T>) -> Result<(), Box<dyn std::error::Error>>;
#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct Action {
name: String,
#[serde(default)]
params: Option<Value>,
#[serde(skip)]
pub(crate) callback: Option<Callback<Action>>,
}
#[derive(Default, Debug)]
pub struct EventBuilder {
name: String,
params: Option<Value>,
callback: Option<Callback<Event>>,
}
#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct Event {
name: String,
#[serde(default)]
params: Option<Value>,
#[serde(skip)]
pub(crate) callback: Option<Callback<Event>>,
}
impl EventBuilder {
pub fn new<S: Into<String>>(name: S) -> Self {
Self {
name: name.into(),
..Self::default()
}
}
pub fn add_params(mut self, params: Value) -> Self {
self.params = Some(params);
self
}
pub fn add_callback(mut self, callback: Callback<Event>) -> Self {
self.callback = Some(callback);
self
}
pub fn build(self) -> Event {
Event {
name: self.name,
params: self.params,
callback: self.callback,
}
}
}
#[derive(Default, Debug)]
pub struct ActionBuilder {
name: String,
params: Option<Value>,
callback: Option<Callback<Action>>,
}
impl ActionBuilder {
pub fn new<S: Into<String>>(name: S) -> Self {
Self {
name: name.into(),
..Self::default()
}
}
pub fn add_params(mut self, params: Value) -> Self {
self.params = Some(params);
self
}
pub fn add_callback(mut self, callback: Callback<Action>) -> Self {
self.callback = Some(callback);
self
}
pub fn build(self) -> Action {
Action {
name: self.name,
params: self.params,
callback: self.callback,
}
}
}
#[derive(Serialize, Deserialize, Debug, Default)]
#[serde(rename_all = "camelCase")]
pub struct Service {
name: String,
version: Option<i32>,
#[serde(default)]
#[serde(skip_deserializing)]
settings: HashMap<String, String>,
#[serde(default)]
metadata: Option<Value>,
pub(crate) actions: HashMap<String, Action>,
pub(crate) events: HashMap<String, Event>,
}
impl Service {
pub fn new<S: Into<String>>(name: S) -> Self {
Self {
name: name.into(),
..Default::default()
}
}
pub fn set_version(mut self, version: i32) -> Self {
self.version = Some(version);
self
}
pub fn add_action(mut self, action: Action) -> Self {
self.actions.insert(action.name.clone(), action);
self
}
pub fn add_event(mut self, event: Event) -> Self {
self.events.insert(event.name.clone(), event);
self
}
}
#[derive(Serialize, Deserialize, Debug)]
#[serde(rename_all = "lowercase")]
pub enum EventType {
Emit,
Broadcast,
}
pub struct Context<T> {
phantom: PhantomData<T>,
pub id: String,
pub broker: ServiceBroker,
pub node_id: String,
pub action: Option<String>,
pub event_name: Option<String>,
pub event_type: Option<EventType>,
pub event_groups: Vec<String>,
pub caller: Option<String>,
pub request_id: Option<String>,
pub parent_id: Option<String>,
pub params: Value,
pub meta: Value,
pub locals: Option<Value>,
pub level: i32,
}
impl Context<Event> {
pub(crate) fn new(event_message: EventMessage, service_broker: ServiceBroker) -> Self {
let event_type = if event_message.broadcast.unwrap_or(false) {
EventType::Broadcast
} else {
EventType::Emit
};
Self {
phantom: PhantomData,
broker: service_broker,
id: event_message.id,
params: event_message.data,
action: None,
event_type: Some(event_type),
event_name: Some(event_message.event),
event_groups: vec![],
node_id: event_message.sender,
caller: event_message.caller,
parent_id: event_message.parent_id,
request_id: event_message.request_id,
meta: event_message.meta,
level: event_message.level,
locals: None,
}
}
}
impl Context<Action> {
pub(crate) fn new(request_message: RequestMessage, service_broker: ServiceBroker) -> Self {
Self {
phantom: PhantomData,
broker: service_broker,
id: request_message.request_id.clone(),
params: request_message.params,
action: Some(request_message.action),
event_type: None,
event_name: None,
event_groups: vec![],
node_id: request_message.sender,
caller: request_message.caller,
parent_id: request_message.parent_id,
request_id: Some(request_message.request_id),
meta: request_message.meta,
level: 1,
locals: None,
}
}
pub fn reply(&self, params: Value) {
act_zero::send!(self
.broker
.addr
.reply(self.node_id.clone(), self.id.clone(), params));
}
}
impl<T> Context<T> {
pub fn emit<S: Into<String>>(&self, event: S, params: Value) {
self.broker.emit(event, params)
}
pub fn broadcast<S: Into<String>>(&self, event: S, params: Value) {
self.broker.broadcast(event, params)
}
pub async fn call<S: Into<String>>(self, action: S, params: Value) -> Result<Value, Error> {
self.broker.call(action, params).await
}
}
|
use serde::{Deserialize, Serialize};
use serde_json::Value;
use std::{collections::HashMap, marker::PhantomData};
use crate::{
channels::messages::incoming::{EventMessage, RequestMessage},
Error, ServiceBroker,
};
pub type Callback<T> = fn(Context<T>) -> Result<(), Box<dyn std::error::Error>>;
#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct Action {
name: String,
#[serde(default)]
params: Option<Value>,
#[serde(skip)]
pub(crate) callback: Option<Callback<Action>>,
}
#[derive(Default, Debug)]
pub struct EventBuilder {
name: String,
params: Option<Value>,
callback: Option<Callback<Event>>,
}
#[derive(Serialize, Deserialize, Debug, Clone)]
pub struct Event {
name: String,
#[serde(default)]
params: Option<Value>,
#[serde(skip)]
pub(crate) callback: Option<Callback<Event>>,
}
impl EventBuilder {
pub fn new<S: Into<String>>(name: S) -> Self {
Self {
name: name.into(),
..Self::default()
}
}
pub fn add_params(mut self, params: Value) -> Self {
self.params = Some(params);
self
}
pub fn add_callback(mut self, callback: Callback<Event>) -> Self {
self.callback = Some(callback);
self
}
pub fn build(self) -> Event {
Event {
name: self.name,
params: self.params,
callback: self.callback,
}
}
}
#[derive(Default, Debug)]
pub struct ActionBuilder {
name: String,
params: Option<Value>,
callback: Option<Callback<Action>>,
}
impl ActionBuilder {
pub fn new<S: Into<String>>(name: S) -> Self {
Self {
name: name.into(),
..Self::default()
}
}
pub fn add_params(mut self, params: Value) -> Self {
self.params = Some(params);
self
}
pub fn add_callback(mut self, callback: Callback<Action>) -> Self {
self.callback = Some(callback);
self
}
pub fn build(self) -> Action {
Action {
name: self.name,
params: self.params,
callback: self.callback,
}
}
}
#[derive(Serialize, Deserialize, Debug, Default)]
#[serde(rename_all = "camelCase")]
pub struct Service {
name: String,
version: Option<i32>,
#[serde(default)]
#[serde(skip_deserializing)]
settings: HashMap<String, String>,
#[serde(default)]
metadata: Option<Value>,
pub(crate) actions: HashMap<String, Action>,
pub(crate) events: HashMap<String, Event>,
}
impl Service {
pub fn new<S: Into<String>>(name: S) -> Self {
Self {
name: name.into(),
..Default::default()
}
}
pub fn set_version(mut self, version: i32) -> Self {
self.version = Some(version);
self
}
pub fn add_action(mut self, action: Action) -> Self {
self.actions.insert(action.name.clone(), action);
self
}
pub fn add_event(mut self, event: Event) -> Self {
self.events.insert(event.name.clone(), event);
self
}
}
#[derive(Serialize, Deserialize, Debug)]
#[serde(rename_all = "lowercase")]
pub enum EventType {
Emit,
Broadcast,
}
pub struct Context<T> {
phantom: PhantomData<T>,
pub id: String,
pub broker: ServiceBroker,
pub node_id: String,
pub action: Option<String>,
pub event_name: Option<String>,
pub event_type: Option<EventType>,
pub event_groups: Vec<String>,
pub caller: Option<String>,
pub request_id: Option<String>,
pub parent_id: Option<String>,
pub params: Value,
pub meta: Value,
pub locals: Option<Value>,
pub level: i32,
}
impl Context<Event> {
pub(crate) fn new(event_message: EventMessage, service_broker: ServiceBroker) -> Self {
|
Self {
phantom: PhantomData,
broker: service_broker,
id: event_message.id,
params: event_message.data,
action: None,
event_type: Some(event_type),
event_name: Some(event_message.event),
event_groups: vec![],
node_id: event_message.sender,
caller: event_message.caller,
parent_id: event_message.parent_id,
request_id: event_message.request_id,
meta: event_message.meta,
level: event_message.level,
locals: None,
}
}
}
impl Context<Action> {
pub(crate) fn new(request_message: RequestMessage, service_broker: ServiceBroker) -> Self {
Self {
phantom: PhantomData,
broker: service_broker,
id: request_message.request_id.clone(),
params: request_message.params,
action: Some(request_message.action),
event_type: None,
event_name: None,
event_groups: vec![],
node_id: request_message.sender,
caller: request_message.caller,
parent_id: request_message.parent_id,
request_id: Some(request_message.request_id),
meta: request_message.meta,
level: 1,
locals: None,
}
}
pub fn reply(&self, params: Value) {
act_zero::send!(self
.broker
.addr
.reply(self.node_id.clone(), self.id.clone(), params));
}
}
impl<T> Context<T> {
pub fn emit<S: Into<String>>(&self, event: S, params: Value) {
self.broker.emit(event, params)
}
pub fn broadcast<S: Into<String>>(&self, event: S, params: Value) {
self.broker.broadcast(event, params)
}
pub async fn call<S: Into<String>>(self, action: S, params: Value) -> Result<Value, Error> {
self.broker.call(action, params).await
}
}
| let event_type = if event_message.broadcast.unwrap_or(false) {
EventType::Broadcast
} else {
EventType::Emit
}; | assignment_statement | [
{
"content": "fn broadcast_name(ctx: Context<Event>) -> Result<(), Box<dyn Error>> {\n\n let msg: PrintNameMessage = serde_json::from_value(ctx.params)?;\n\n println!(\"Received broadcastName in rust\");\n\n ctx.broker\n\n .broadcast(\"testWithParam\", serde_json::to_value(&msg)?);\n\n\n\n Ok... |
Rust | tools/butler/src/db/photos/patch.rs | hsfzxjy/omoyde | 6cda092c1f895ac03e1aea2c32e315a9bad06202 | use crate::prelude::*;
use paste::paste;
use std::borrow::Cow;
use std::ptr::NonNull;
#[derive(Clone, Debug)]
pub struct Diff<'a, T: Clone> {
old: Cow<'a, T>,
new: Option<Cow<'a, T>>,
}
impl<'a, T: Clone> From<T> for Diff<'a, T> {
fn from(v: T) -> Self {
Self {
old: Cow::Owned(v),
new: None,
}
}
}
impl<'a, T: Clone> From<&'a T> for Diff<'a, T> {
fn from(v: &'a T) -> Self {
Self {
old: Cow::Borrowed(v),
new: None,
}
}
}
impl<'b, 'a: 'b, 'c: 'a, T: Clone> Diff<'a, T> {
fn write(&self, slot: &mut T) {
self.new.as_ref().map(|v| *slot = v.clone().into_owned());
}
fn get_mut(&'b mut self) -> &'b mut T {
if self.new.is_none() {
self.new = Some(self.old.clone());
}
self.new.as_mut().unwrap().to_mut()
}
pub fn set(&mut self, v: T) {
*self.get_mut() = v;
}
fn current(&self) -> &T {
self.new.as_ref().unwrap_or(&self.old)
}
fn to_owned(&'b self) -> Diff<'c, T> {
Diff {
old: Cow::Owned(self.old.clone().into_owned()),
new: self
.new
.as_ref()
.map(|x| Cow::Owned(x.clone().into_owned())),
}
}
}
impl<'a, T: Eq + Clone> Diff<'a, T> {
fn changed(&self) -> bool {
if matches!(self.old, Cow::Borrowed(_)) && matches!(self.new, None | Some(Cow::Borrowed(_)))
{
return false;
}
self.new
.as_ref()
.map(|new| new.ne(&self.old))
.unwrap_or(false)
}
fn run_if_changed<F>(&self, f: F)
where
F: FnOnce(&T, &T),
{
if self.changed() {
f(&self.old, &self.new.as_ref().unwrap())
}
}
}
macro_rules! fields {
($action: ident; $args: tt) => {
fields!{@iter $action, $args, [
(metadata; PhotoMetadata),
(file_hash; FileHash),
(selected; bool),
(status; PhotoRecordStatus),
(commit_time; Option<DateTime<Utc>>)
]}
};
(@iter define_struct, (), [ $(( $N: ident; $T: ty )),+ ]) => {
#[derive(Debug)]
pub struct PhotoRecordDiff<'a> {
pub pid: PID,
is_missing: bool,
$(
pub $N: Diff<'a, $T>,
)+
}
};
(@iter to_owned, ($self: ident), [ $(( $N: ident; $T: ty )),+ ]) => {
PhotoRecordDiff {
pid: $self.pid,
is_missing: $self.is_missing,
$( $N: $self.$N.to_owned(), )+
}
};
(@iter new, ($arg: ident), [ $(( $N: ident; $T: ty )),+ ]) => {
Self {
pid: $arg.pid,
is_missing: false,
$( $N: (&$arg.$N).into(), )+
}
};
(@iter $action: ident, $args: tt, [ $(( $N: ident; $T: ty )),+ ]) => {
$(
fields!(@call $action, $args, $N, $T);
)+
};
(@call write, ($self: ident, $arg: ident, $changed: ident), $N: ident, $T: ty) => {
if $self.$N.changed() {
$self.$N.old.to_mut();
$self.$N.write(&mut $arg.$N);
$changed = true;
}
};
(@call accessor, (), $N: ident, $T: ty) => {
paste!{
pub fn $N(&self) -> &$T {
self.rec_diff.$N.current()
}
pub fn [<set_ $N>](&mut self, v: $T) {
*self.rec_diff.$N.get_mut() = v;
}
pub fn [<$N _mut>](&mut self) -> &mut $T {
self.rec_diff.$N.get_mut()
}
pub fn [<with_ $N>](mut self, v: $T) -> Self {
self.[<set_ $N>](v);
self
}
pub fn [<set_ $N _with>]<F>(mut self, f: F) -> Self
where
F: FnOnce(&mut $T)
{
f(self.rec_diff.$N.get_mut());
self
}
}
}
}
fields!(define_struct; ());
impl<'a> PhotoRecordDiff<'a> {
fn write<'b, 'c>(&'b mut self, rec: &'c mut PhotoRecord) -> (&'c PhotoRecord, bool) {
let mut changed = false;
fields!(write; (self, rec, changed));
(rec, changed)
}
pub fn new(rec: &'a PhotoRecord) -> Self {
fields!(new; (rec))
}
fn is_dirty(&self) -> bool {
self.file_hash.changed() || self.metadata.changed()
}
fn to_owned<'c: 'a>(&self) -> PhotoRecordDiff<'c> {
fields!(to_owned; (self))
}
}
pub struct PhotoRecordPatch<'b, 'a: 'b> {
commit_at_drop: bool,
rec_diff: PhotoRecordDiff<'a>,
rec: NonNull<PhotoRecord>,
ptr: &'b TableRefMut<'a, PhotoTable>,
}
#[allow(dead_code)]
impl<'b, 'a: 'b> PhotoRecordPatch<'b, 'a> {
fields!(accessor; ());
pub(super) fn with_diff<'c: 'a>(mut self, diff: PhotoRecordDiff<'c>) -> Self {
self.rec_diff = diff;
self
}
pub fn mark_missing(&mut self) {
self.rec_diff.is_missing = true
}
pub fn into_diff<'c>(mut self) -> PhotoRecordDiff<'c> {
self.commit_at_drop = false;
let ret = self.rec_diff.to_owned();
drop(self);
ret
}
}
impl<'b, 'a: 'b> Drop for PhotoRecordPatch<'b, 'a> {
fn drop(&mut self) {
if !self.commit_at_drop {
return;
}
let ptr = unsafe { self.ptr.as_mut() };
if *self.selected() && self.rec_diff.is_missing {
self.status_mut().handle_local_missing();
} else {
let is_dirty = self.rec_diff.is_dirty();
self.status_mut().handle_dirty_mark(is_dirty);
}
{
let status = &self.rec_diff.status;
if status.changed() && *status.current() == Committed {
self.set_commit_time(Some(Utc::now()))
}
}
let (rec, changed) = self.rec_diff.write(unsafe { self.rec.as_mut() });
if changed {
unsafe { self.ptr.as_mut() }.modified_flag().set();
}
self.rec_diff.selected.run_if_changed(|_o, _n| {
ptr.index.flip_selected(rec);
});
self.rec_diff.status.run_if_changed(|o, n| {
ptr.index.mutate_status(rec.pid, o.clone(), n.clone());
});
}
}
impl<'b, 'a: 'b> TableRecordPatch<'b, 'a> for PhotoRecordPatch<'b, 'a> {
type Table = PhotoTable;
fn new(rec: TableRecordMut<'a, Self::Table>, ptr: &'b TableRefMut<'a, Self::Table>) -> Self {
let rec_ptr = unsafe { NonNull::new(std::mem::transmute(rec as *const _)).unwrap() };
Self {
commit_at_drop: true,
rec_diff: PhotoRecordDiff::new(rec),
rec: rec_ptr,
ptr,
}
}
}
| use crate::prelude::*;
use paste::paste;
use std::borrow::Cow;
use std::ptr::NonNull;
#[derive(Clone, Debug)]
pub struct Diff<'a, T: Clone> {
old: Cow<'a, T>,
new: Option<Cow<'a, T>>,
}
impl<'a, T: Clone> From<T> for Diff<'a, T> {
fn from(v: T) -> Self {
Self {
old: Cow::Owned(v),
new: None,
}
}
}
impl<'a, T: Clone> From<&'a T> for Diff<'a, T> {
fn from(v: &'a T) -> Self {
Self {
old: Cow::Borrowed(v),
new: None,
}
}
}
impl<'b, 'a: 'b, 'c: 'a, T: Clone> Diff<'a, T> {
fn write(&self, slot: &mut T) {
self.new.as_ref().map(|v| *slot = v.clone().into_owned());
}
fn get_mut(&'b mut self) -> &'b mut T {
if self.new.is_none() {
self.new = Some(self.old.clone());
}
self.new.as_mut().unwrap().to_mut()
}
pub fn set(&mut self, v: T) {
*self.get_mut() = v;
}
fn current(&self) -> &T {
self.new.as_ref().unwrap_or(&self.old)
}
fn to_owned(&'b self) -> Diff<'c, T> {
Diff {
old: Cow::Owned(self.old.clone().into_owned()),
new: s | td::mem::transmute(rec as *const _)).unwrap() };
Self {
commit_at_drop: true,
rec_diff: PhotoRecordDiff::new(rec),
rec: rec_ptr,
ptr,
}
}
}
| elf
.new
.as_ref()
.map(|x| Cow::Owned(x.clone().into_owned())),
}
}
}
impl<'a, T: Eq + Clone> Diff<'a, T> {
fn changed(&self) -> bool {
if matches!(self.old, Cow::Borrowed(_)) && matches!(self.new, None | Some(Cow::Borrowed(_)))
{
return false;
}
self.new
.as_ref()
.map(|new| new.ne(&self.old))
.unwrap_or(false)
}
fn run_if_changed<F>(&self, f: F)
where
F: FnOnce(&T, &T),
{
if self.changed() {
f(&self.old, &self.new.as_ref().unwrap())
}
}
}
macro_rules! fields {
($action: ident; $args: tt) => {
fields!{@iter $action, $args, [
(metadata; PhotoMetadata),
(file_hash; FileHash),
(selected; bool),
(status; PhotoRecordStatus),
(commit_time; Option<DateTime<Utc>>)
]}
};
(@iter define_struct, (), [ $(( $N: ident; $T: ty )),+ ]) => {
#[derive(Debug)]
pub struct PhotoRecordDiff<'a> {
pub pid: PID,
is_missing: bool,
$(
pub $N: Diff<'a, $T>,
)+
}
};
(@iter to_owned, ($self: ident), [ $(( $N: ident; $T: ty )),+ ]) => {
PhotoRecordDiff {
pid: $self.pid,
is_missing: $self.is_missing,
$( $N: $self.$N.to_owned(), )+
}
};
(@iter new, ($arg: ident), [ $(( $N: ident; $T: ty )),+ ]) => {
Self {
pid: $arg.pid,
is_missing: false,
$( $N: (&$arg.$N).into(), )+
}
};
(@iter $action: ident, $args: tt, [ $(( $N: ident; $T: ty )),+ ]) => {
$(
fields!(@call $action, $args, $N, $T);
)+
};
(@call write, ($self: ident, $arg: ident, $changed: ident), $N: ident, $T: ty) => {
if $self.$N.changed() {
$self.$N.old.to_mut();
$self.$N.write(&mut $arg.$N);
$changed = true;
}
};
(@call accessor, (), $N: ident, $T: ty) => {
paste!{
pub fn $N(&self) -> &$T {
self.rec_diff.$N.current()
}
pub fn [<set_ $N>](&mut self, v: $T) {
*self.rec_diff.$N.get_mut() = v;
}
pub fn [<$N _mut>](&mut self) -> &mut $T {
self.rec_diff.$N.get_mut()
}
pub fn [<with_ $N>](mut self, v: $T) -> Self {
self.[<set_ $N>](v);
self
}
pub fn [<set_ $N _with>]<F>(mut self, f: F) -> Self
where
F: FnOnce(&mut $T)
{
f(self.rec_diff.$N.get_mut());
self
}
}
}
}
fields!(define_struct; ());
impl<'a> PhotoRecordDiff<'a> {
fn write<'b, 'c>(&'b mut self, rec: &'c mut PhotoRecord) -> (&'c PhotoRecord, bool) {
let mut changed = false;
fields!(write; (self, rec, changed));
(rec, changed)
}
pub fn new(rec: &'a PhotoRecord) -> Self {
fields!(new; (rec))
}
fn is_dirty(&self) -> bool {
self.file_hash.changed() || self.metadata.changed()
}
fn to_owned<'c: 'a>(&self) -> PhotoRecordDiff<'c> {
fields!(to_owned; (self))
}
}
pub struct PhotoRecordPatch<'b, 'a: 'b> {
commit_at_drop: bool,
rec_diff: PhotoRecordDiff<'a>,
rec: NonNull<PhotoRecord>,
ptr: &'b TableRefMut<'a, PhotoTable>,
}
#[allow(dead_code)]
impl<'b, 'a: 'b> PhotoRecordPatch<'b, 'a> {
fields!(accessor; ());
pub(super) fn with_diff<'c: 'a>(mut self, diff: PhotoRecordDiff<'c>) -> Self {
self.rec_diff = diff;
self
}
pub fn mark_missing(&mut self) {
self.rec_diff.is_missing = true
}
pub fn into_diff<'c>(mut self) -> PhotoRecordDiff<'c> {
self.commit_at_drop = false;
let ret = self.rec_diff.to_owned();
drop(self);
ret
}
}
impl<'b, 'a: 'b> Drop for PhotoRecordPatch<'b, 'a> {
fn drop(&mut self) {
if !self.commit_at_drop {
return;
}
let ptr = unsafe { self.ptr.as_mut() };
if *self.selected() && self.rec_diff.is_missing {
self.status_mut().handle_local_missing();
} else {
let is_dirty = self.rec_diff.is_dirty();
self.status_mut().handle_dirty_mark(is_dirty);
}
{
let status = &self.rec_diff.status;
if status.changed() && *status.current() == Committed {
self.set_commit_time(Some(Utc::now()))
}
}
let (rec, changed) = self.rec_diff.write(unsafe { self.rec.as_mut() });
if changed {
unsafe { self.ptr.as_mut() }.modified_flag().set();
}
self.rec_diff.selected.run_if_changed(|_o, _n| {
ptr.index.flip_selected(rec);
});
self.rec_diff.status.run_if_changed(|o, n| {
ptr.index.mutate_status(rec.pid, o.clone(), n.clone());
});
}
}
impl<'b, 'a: 'b> TableRecordPatch<'b, 'a> for PhotoRecordPatch<'b, 'a> {
type Table = PhotoTable;
fn new(rec: TableRecordMut<'a, Self::Table>, ptr: &'b TableRefMut<'a, Self::Table>) -> Self {
let rec_ptr = unsafe { NonNull::new(s | random | [
{
"content": "pub fn pt_access_mut<'a>() -> TableAccessMut<'a, PhotoTable> {\n\n PHOTO_TABLE.lock().unwrap().access_mut()\n\n}\n\n\n\n#[allow(dead_code)]\n\npub type PhotoTableAccess<'a> = TableAccess<'a, PhotoTable>;\n\npub type PhotoTableAccessMut<'a> = TableAccessMut<'a, PhotoTable>;\n\n\n\nimpl<'b, 'a: '... |
Rust | examples/truck_loading.rs | cuviper/RsGenetic | dfbf22008072920f21f1f7c07c1bc7af689bc1f4 |
extern crate rand;
extern crate rsgenetic;
use rsgenetic::sim::*;
use rsgenetic::sim::seq::Simulator;
use rsgenetic::sim::select::*;
use rsgenetic::pheno::*;
use rand::Rng;
type TruckIndex = usize;
type PackageSize = i32;
type Scheme = Vec<(TruckIndex, PackageSize)>;
type SchemeFitness = i32;
const NUM_TRUCKS: usize = 5;
const CAPACITY: i32 = 10;
const PACKAGES: &[i32] = &[3, 8, 2, 7, 6, 1, 3];
struct LoadingScheme {
scheme: Scheme,
}
impl Phenotype<SchemeFitness> for LoadingScheme {
fn fitness(&self) -> SchemeFitness {
let mut ret: i32 = 0;
let mut trucks: Vec<PackageSize> = vec![0; NUM_TRUCKS];
for load in self.scheme.clone() {
trucks[load.0] += load.1;
}
for load in trucks {
let space_left = CAPACITY - load;
if space_left < 0 {
return i32::min_value();
}
if space_left == CAPACITY {
ret += 1000;
} else {
ret -= space_left;
}
}
ret
}
fn crossover(&self, other: &LoadingScheme) -> LoadingScheme {
let mut rng = ::rand::thread_rng();
let crossover_indices = (
rng.gen::<usize>() % PACKAGES.len(),
rng.gen::<usize>() % PACKAGES.len(),
);
let mut crossed_over: Scheme = vec![(0, 0); PACKAGES.len()];
for i in 0..crossover_indices.0 {
crossed_over[i] = self.scheme[i];
}
for i in crossover_indices.0..crossover_indices.1 {
crossed_over[i] = other.scheme[i];
}
for i in crossover_indices.1..PACKAGES.len() {
crossed_over[i] = self.scheme[i];
}
LoadingScheme {
scheme: crossed_over,
}
}
fn mutate(&self) -> LoadingScheme {
let mut rng = ::rand::thread_rng();
LoadingScheme {
scheme: self.scheme
.iter()
.map(|&(_, size)| (rng.gen::<usize>() % NUM_TRUCKS, size))
.collect(),
}
}
}
impl Clone for LoadingScheme {
fn clone(&self) -> LoadingScheme {
LoadingScheme {
scheme: self.scheme.clone(),
}
}
}
fn main() {
let mut population: Vec<LoadingScheme> = Vec::with_capacity(300);
let mut rng = ::rand::thread_rng();
for _ in 0..300 {
let mut pheno: Scheme = Vec::with_capacity(PACKAGES.len());
for package in PACKAGES {
let index = rng.gen::<usize>() % NUM_TRUCKS;
pheno.push((index, *package));
}
population.push(LoadingScheme { scheme: pheno });
}
#[allow(deprecated)]
let mut s = Simulator::builder(&mut population)
.set_selector(Box::new(MaximizeSelector::new(10)))
.set_max_iters(100)
.build();
s.run();
let result = s.get().unwrap();
let time = s.time();
println!("Execution time: {} ns.", time.unwrap());
println!(
"Result: {:?} | Fitness: {}.",
result.scheme,
result.fitness()
);
let mut trucks: Vec<_> = vec![0; NUM_TRUCKS];
for &(index, size) in &result.scheme {
trucks[index] += size;
}
println!("Load per truck: {:?}.", trucks);
}
|
extern crate rand;
extern crate rsgenetic;
use rsgenetic::sim::*;
use rsgenetic::sim::seq::Simulator;
use rsgenetic::sim::select::*;
use rsgenetic::pheno::*;
use rand::Rng;
type TruckIndex = usize;
type PackageSize = i32;
type Scheme = Vec<(TruckIndex, PackageSize)>;
type SchemeFitness = i32;
const NUM_TRUCKS: usize = 5;
const CAPACITY: i32 = 10;
const PACKAGES: &[i32] = &[3, 8, 2, 7, 6, 1, 3];
struct LoadingScheme {
scheme: Scheme,
}
impl Phenotype<SchemeFitness> for LoadingScheme {
fn fitness(&self) -> SchemeFitness {
let mut ret: i32 = 0;
let mut trucks: Vec<PackageSize> = vec![0; NUM_TRUCKS];
for load in self.scheme.clone() {
trucks[load.0] += load.1;
}
for load in trucks {
let space_left = CAPACITY - load;
if space_left < 0 {
return i32::min_value();
}
if space_left == CAPACITY {
ret += 1000;
} else {
ret -= space_left;
}
}
ret
}
fn crossover(&self, other: &LoadingScheme) -> LoadingScheme {
let mut rng = ::rand::thread_rng();
let crossover_indices = (
rng.gen::<usize>() % PACKAGES.len(),
rng.gen::<usize>() % PACKAGES.len(),
);
let mut crossed_over: Scheme = vec![(0, 0); PACKAGES.len()];
|
fn mutate(&self) -> LoadingScheme {
let mut rng = ::rand::thread_rng();
LoadingScheme {
scheme: self.scheme
.iter()
.map(|&(_, size)| (rng.gen::<usize>() % NUM_TRUCKS, size))
.collect(),
}
}
}
impl Clone for LoadingScheme {
fn clone(&self) -> LoadingScheme {
LoadingScheme {
scheme: self.scheme.clone(),
}
}
}
fn main() {
let mut population: Vec<LoadingScheme> = Vec::with_capacity(300);
let mut rng = ::rand::thread_rng();
for _ in 0..300 {
let mut pheno: Scheme = Vec::with_capacity(PACKAGES.len());
for package in PACKAGES {
let index = rng.gen::<usize>() % NUM_TRUCKS;
pheno.push((index, *package));
}
population.push(LoadingScheme { scheme: pheno });
}
#[allow(deprecated)]
let mut s = Simulator::builder(&mut population)
.set_selector(Box::new(MaximizeSelector::new(10)))
.set_max_iters(100)
.build();
s.run();
let result = s.get().unwrap();
let time = s.time();
println!("Execution time: {} ns.", time.unwrap());
println!(
"Result: {:?} | Fitness: {}.",
result.scheme,
result.fitness()
);
let mut trucks: Vec<_> = vec![0; NUM_TRUCKS];
for &(index, size) in &result.scheme {
trucks[index] += size;
}
println!("Load per truck: {:?}.", trucks);
}
| for i in 0..crossover_indices.0 {
crossed_over[i] = self.scheme[i];
}
for i in crossover_indices.0..crossover_indices.1 {
crossed_over[i] = other.scheme[i];
}
for i in crossover_indices.1..PACKAGES.len() {
crossed_over[i] = self.scheme[i];
}
LoadingScheme {
scheme: crossed_over,
}
} | function_block-function_prefix_line | [
{
"content": "fn main() {\n\n let mut population = (-300..300).map(|i| MyData { x: f64::from(i) }).collect();\n\n let mut s = Simulator::builder(&mut population)\n\n .set_selector(Box::new(StochasticSelector::new(10)))\n\n .set_max_iters(50)\n\n .build();\n\n s.run();\n\n let re... |
Rust | src/bin/cmd/wallet_tests.rs | icook/grin | 5915580ab372dd85c0cc615d9df1c9aa6329f0f0 |
#[cfg(test)]
mod wallet_tests {
use chrono;
use clap;
use grin_util as util;
use grin_wallet;
use serde;
use grin_wallet::test_framework::{self, LocalWalletClient, WalletProxy};
use clap::{App, ArgMatches};
use grin_util::Mutex;
use std::sync::Arc;
use std::thread;
use std::time::Duration;
use std::{env, fs};
use grin_config::GlobalWalletConfig;
use grin_core::global;
use grin_core::global::ChainTypes;
use grin_keychain::ExtKeychain;
use grin_wallet::{LMDBBackend, WalletBackend, WalletConfig, WalletInst, WalletSeed};
use super::super::wallet_args;
fn clean_output_dir(test_dir: &str) {
let _ = fs::remove_dir_all(test_dir);
}
fn setup(test_dir: &str) {
util::init_test_logger();
clean_output_dir(test_dir);
global::set_mining_mode(ChainTypes::AutomatedTesting);
}
pub fn config_command_wallet(
dir_name: &str,
wallet_name: &str,
) -> Result<(), grin_wallet::Error> {
let mut current_dir;
let mut default_config = GlobalWalletConfig::default();
current_dir = env::current_dir().unwrap_or_else(|e| {
panic!("Error creating config file: {}", e);
});
current_dir.push(dir_name);
current_dir.push(wallet_name);
let _ = fs::create_dir_all(current_dir.clone());
let mut config_file_name = current_dir.clone();
config_file_name.push("grin-wallet.toml");
if config_file_name.exists() {
return Err(grin_wallet::ErrorKind::ArgumentError(
"grin-wallet.toml already exists in the target directory. Please remove it first"
.to_owned(),
))?;
}
default_config.update_paths(¤t_dir);
default_config
.write_to_file(config_file_name.to_str().unwrap())
.unwrap_or_else(|e| {
panic!("Error creating config file: {}", e);
});
println!(
"File {} configured and created",
config_file_name.to_str().unwrap(),
);
Ok(())
}
pub fn initial_setup_wallet(dir_name: &str, wallet_name: &str) -> WalletConfig {
let mut current_dir;
current_dir = env::current_dir().unwrap_or_else(|e| {
panic!("Error creating config file: {}", e);
});
current_dir.push(dir_name);
current_dir.push(wallet_name);
let _ = fs::create_dir_all(current_dir.clone());
let mut config_file_name = current_dir.clone();
config_file_name.push("grin-wallet.toml");
GlobalWalletConfig::new(config_file_name.to_str().unwrap())
.unwrap()
.members
.unwrap()
.wallet
}
fn get_wallet_subcommand<'a>(
wallet_dir: &str,
wallet_name: &str,
args: ArgMatches<'a>,
) -> ArgMatches<'a> {
match args.subcommand() {
("wallet", Some(wallet_args)) => {
if let ("init", Some(init_args)) = wallet_args.subcommand() {
if init_args.is_present("here") {
let _ = config_command_wallet(wallet_dir, wallet_name);
}
}
wallet_args.to_owned()
}
_ => ArgMatches::new(),
}
}
fn instantiate_wallet(
mut wallet_config: WalletConfig,
node_client: LocalWalletClient,
passphrase: &str,
account: &str,
) -> Result<Arc<Mutex<WalletInst<LocalWalletClient, ExtKeychain>>>, grin_wallet::Error> {
wallet_config.chain_type = None;
let _ = WalletSeed::from_file(&wallet_config, passphrase)?;
let mut db_wallet = LMDBBackend::new(wallet_config.clone(), passphrase, node_client)?;
db_wallet.set_parent_key_id_by_name(account)?;
info!("Using LMDB Backend for wallet");
Ok(Arc::new(Mutex::new(db_wallet)))
}
fn execute_command(
app: &App,
test_dir: &str,
wallet_name: &str,
client: &LocalWalletClient,
arg_vec: Vec<&str>,
) -> Result<String, grin_wallet::Error> {
let args = app.clone().get_matches_from(arg_vec);
let args = get_wallet_subcommand(test_dir, wallet_name, args.clone());
let mut config = initial_setup_wallet(test_dir, wallet_name);
config.chain_type = None;
wallet_args::wallet_command(&args, config.clone(), client.clone())
}
fn command_line_test_impl(test_dir: &str) -> Result<(), grin_wallet::Error> {
setup(test_dir);
let mut wallet_proxy: WalletProxy<LocalWalletClient, ExtKeychain> =
WalletProxy::new(test_dir);
let chain = wallet_proxy.chain.clone();
let yml = load_yaml!("../grin.yml");
let app = App::from_yaml(yml);
let arg_vec = vec!["grin", "wallet", "-p", "password", "init", "-h"];
let client1 = LocalWalletClient::new("wallet1", wallet_proxy.tx.clone());
execute_command(&app, test_dir, "wallet1", &client1, arg_vec.clone())?;
assert!(execute_command(&app, test_dir, "wallet1", &client1, arg_vec.clone()).is_err());
let client1 = LocalWalletClient::new("wallet1", wallet_proxy.tx.clone());
let config1 = initial_setup_wallet(test_dir, "wallet1");
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
wallet_proxy.add_wallet("wallet1", client1.get_send_instance(), wallet1.clone());
let client2 = LocalWalletClient::new("wallet2", wallet_proxy.tx.clone());
execute_command(&app, test_dir, "wallet2", &client2, arg_vec.clone())?;
let config2 = initial_setup_wallet(test_dir, "wallet2");
let wallet2 = instantiate_wallet(config2.clone(), client2.clone(), "password", "default")?;
wallet_proxy.add_wallet("wallet2", client2.get_send_instance(), wallet2.clone());
thread::spawn(move || {
if let Err(e) = wallet_proxy.run() {
error!("Wallet Proxy error: {}", e);
}
});
let arg_vec = vec![
"grin", "wallet", "-p", "password", "account", "-c", "mining",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"account",
"-c",
"account_1",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"account",
"-c",
"account_1",
];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec.clone())?;
assert!(execute_command(&app, test_dir, "wallet2", &client2, arg_vec).is_err());
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"account",
"-c",
"account_2",
];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "account"];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "account"];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec)?;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
Ok(())
})?;
let mut bh = 10u64;
let _ = test_framework::award_blocks_to_wallet(&chain, wallet1.clone(), bh as usize);
let arg_vec = vec!["grin", "wallet", "-p", "password", "-a", "mining", "info"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let file_name = format!("{}/tx1.part_tx", test_dir);
let response_file_name = format!("{}/tx1.part_tx.response", test_dir);
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"send",
"-m",
"file",
"-d",
&file_name,
"-g",
"Love, Yeast",
"10",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"account_1",
"receive",
"-i",
&file_name,
"-g",
"Thanks, Yeast!",
];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec.clone())?;
assert!(execute_command(&app, test_dir, "wallet2", &client2, arg_vec).is_err());
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"finalize",
"-i",
&response_file_name,
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
bh += 1;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
let (refreshed, txs) = api.retrieve_txs(true, None, None)?;
assert!(refreshed);
assert_eq!(txs.len(), bh as usize);
Ok(())
})?;
let _ = test_framework::award_blocks_to_wallet(&chain, wallet1.clone(), 10);
bh += 10;
let arg_vec = vec!["grin", "wallet", "-p", "password", "-a", "mining", "info"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"account_1",
"info",
];
execute_command(&app, test_dir, "wallet2", &client1, arg_vec)?;
let wallet2 = instantiate_wallet(config2.clone(), client2.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet2.clone(), |api| {
api.set_active_account("account_1")?;
let (_, wallet1_info) = api.retrieve_summary_info(true, 1)?;
assert_eq!(wallet1_info.last_confirmed_height, bh);
assert_eq!(wallet1_info.amount_currently_spendable, 10_000_000_000);
Ok(())
})?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"send",
"-m",
"file",
"-d",
&file_name,
"-g",
"Love, Yeast, Smallest",
"-s",
"smallest",
"10",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"receive",
"-i",
&file_name,
"-g",
"Thanks, Yeast!",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec.clone())?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"finalize",
"-i",
&response_file_name,
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
bh += 1;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
let (refreshed, txs) = api.retrieve_txs(true, None, None)?;
assert!(refreshed);
assert_eq!(txs.len(), bh as usize + 1);
Ok(())
})?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"send",
"-m",
"self",
"-d",
"mining",
"-g",
"Self love",
"-o",
"75",
"-s",
"smallest",
"10",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
bh += 1;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
let (refreshed, txs) = api.retrieve_txs(true, None, None)?;
assert!(refreshed);
assert_eq!(txs.len(), bh as usize + 2);
Ok(())
})?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"send",
"-m",
"file",
"-d",
&file_name,
"-g",
"Ain't sending",
"10",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "check_repair"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "-a", "mining", "txs"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin", "wallet", "-p", "password", "-a", "mining", "outputs",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
thread::sleep(Duration::from_millis(200));
Ok(())
}
#[test]
fn wallet_command_line() {
let test_dir = "target/test_output/command_line";
if let Err(e) = command_line_test_impl(test_dir) {
panic!("Libwallet Error: {} - {}", e, e.backtrace().unwrap());
}
}
}
|
#[cfg(test)]
mod wallet_tests {
use chrono;
use clap;
use grin_util as util;
use grin_wallet;
use serde;
use grin_wallet::test_framework::{self, LocalWalletClient, WalletProxy};
use clap::{App, ArgMatches};
use grin_util::Mutex;
use std::sync::Arc;
use std::thread;
use std::time::Duration;
use std::{env, fs};
use grin_config::GlobalWalletConfig;
use grin_core::global;
use grin_core::global::ChainTypes;
use grin_keychain::ExtKeychain;
use grin_wallet::{LMDBBackend, WalletBackend, WalletConfig, WalletInst, WalletSeed};
use super::super::wallet_args;
fn clean_output_dir(test_dir: &str) {
let _ = fs::remove_dir_all(test_dir);
}
fn setup(test_dir: &str) {
util::init_test_logger();
clean_output_dir(test_dir);
global::set_mining_mode(ChainTypes::AutomatedTesting);
}
pub fn config_command_wallet(
dir_name: &str,
wallet_name: &str,
) -> Result<(), grin_wallet::Error> {
let mut current_dir;
let mut default_config = GlobalWalletConfig::default();
current_dir = env::current_dir().unwrap_or_else(|e| {
panic!("Error creating config file: {}", e);
});
current_dir.push(dir_name);
current_dir.push(wallet_name);
let _ = fs::create_dir_all(current_dir.clone());
let mut config_file_name = current_dir.clone();
config_file_name.push("grin-wallet.toml");
if config_file_name.exists() {
return Err(grin_wallet::ErrorKind::ArgumentError(
"grin-wallet.toml already exists in the target directory. Please remove it first"
.to_owned(),
))?;
}
default_config.update_paths(¤t_dir);
default_config
.write_to_file(config_file_name.to_str().unwrap())
.unwrap_or_else(|e| {
panic!("Error creating config file: {}", e);
});
println!(
"File {} configured and created",
config_file_name.to_str().unwrap(),
);
Ok(())
}
pub fn initial_setup_wallet(dir_name: &str, wallet_name: &str) -> WalletConfig {
let mut current_dir;
current_dir = env::current_dir().unwrap_or_else(|e| {
panic!("Error creating config file: {}", e);
});
current_dir.push(dir_name);
current_dir.push(wallet_name);
let _ = fs::create_dir_all(current_dir.clone());
let mut config_file_name = current_dir.clone();
config_file_name.push("grin-wallet.toml");
GlobalWalletConfig::new(config_file_name.to_str().unwrap())
.unwrap()
.members
.unwrap()
.wallet
}
fn get_wallet_subcommand<'a>(
wallet_dir: &str,
wallet_name: &str,
args: ArgMatches<'a>,
) -> ArgMatches<'a> {
match args.subcommand() {
("wallet", Some(wallet_args)) => {
if let ("init", Some(init_args)) = wallet_args.subcommand() {
if init_args.is_present("here") {
let _ = config_command_wallet(wallet_dir, wallet_name);
}
}
wallet_args.to_owned()
}
_ => ArgMatches::new(),
}
}
fn instantiate_wallet(
mut wallet_config: WalletConfig,
node_client: LocalWalletClient,
passphrase: &str,
account: &str,
) -> Result<Arc<Mutex<WalletInst<LocalWalletClient, ExtKeychain>>>, grin_wallet::Error> {
wallet_config.chain_type = None;
let _ = WalletSeed::from_file(&wallet_config, passphrase)?;
let mut db_wallet = LMDBBackend::new(wallet_config.clone(), passphrase, node_client)?;
db_wallet.set_parent_key_id_by_name(account)?;
info!("Using LMDB Backend for wallet");
Ok(Arc::new(Mutex::new(db_wallet)))
}
fn execute_command(
app: &App,
test_dir: &str,
wallet_name: &str,
client: &LocalWalletClient,
arg_vec: Vec<&str>,
) -> Result<String, grin_wallet::Error> {
let args = app.clone().get_matches_from(arg_vec);
let args = get_wallet_subcommand(test_dir, wallet_name, args.clone());
let mut config = initial_setup_wallet(test_dir, wallet_name);
config.chain_type = None;
wallet_args::wallet_command(&args, config.clone(), client.clone())
}
fn command_line_test_impl(test_dir: &str) -> Result<(), grin_wallet::Error> {
setup(test_dir);
let mut wallet_proxy: WalletProxy<LocalWalletClient, ExtKeychain> =
WalletProxy::new(test_dir);
let chain = wallet_proxy.chain.clone();
let yml = load_yaml!("../grin.yml");
let app = App::from_yaml(yml);
let arg_vec = vec!["grin", "wallet", "-p", "password", "init", "-h"];
let client1 = LocalWalletClient::new("wallet1", wallet_proxy.tx.clone());
execute_command(&app, test_dir, "wallet1", &client1, arg_vec.clone())?;
assert!(execute_command(&app, test_dir, "wallet1", &client1, arg_vec.clone()).is_err());
let client1 = LocalWalletClient::new("wallet1", wallet_proxy.tx.clone());
let config1 = initial_setup_wallet(test_dir, "wallet1");
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
wallet_proxy.add_wallet("wallet1", client1.get_send_instance(), wallet1.clone());
let client2 = LocalWalletClient::new("wallet2", wallet_proxy.tx.clone());
execute_command(&app, test_dir, "wallet2", &client2, arg_vec.clone())?;
let config2 = initial_setup_wallet(test_dir, "wallet2");
let wallet2 = instantiate_wallet(config2.clone(), client2.clone(), "password", "default")?;
wallet_proxy.add_wallet("wallet2", client2.get_send_instance(), wallet2.clone());
thread::spawn(move || {
if let Err(e) = wallet_proxy.run() {
error!("Wallet Proxy error: {}", e);
}
});
let arg_vec = vec![
"grin", "wallet", "-p", "password", "account", "-c", "mining",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"account",
"-c",
"account_1",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"account",
"-c",
"account_1",
];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec.clone())?;
assert!(execute_command(&app, test_dir, "wallet2", &client2, arg_vec).is_err());
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"account",
"-c",
"account_2",
];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "account"];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "account"];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec)?;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
Ok(())
})?;
let mut bh = 10u64;
let _ = test_framework::award_blocks_to_wallet(&chain, wallet1.clone(), bh as usize);
let arg_vec = vec!["grin", "wallet", "-p", "password", "-a", "mining", "info"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let file_name = format!("{}/tx1.part_tx", test_dir);
let response_file_name = format!("{}/tx1.part_tx.response", test_dir);
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"send",
"-m",
"file",
"-d",
&file_name,
"-g",
"Love, Yeast",
"10",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"account_1",
"receive",
"-i",
&file_name,
"-g",
"Thanks, Yeast!",
];
execute_command(&app, test_dir, "wallet2", &client2, arg_vec.clone())?;
assert!(execute_command(&app, test_dir, "wallet2", &client2, arg_vec).is_err());
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"finalize",
"-i",
&response_file_name,
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
bh += 1;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
let (refreshed, txs) = api.retrieve_txs(true, None, None)?;
assert!(refreshed);
assert_eq!(txs.len(), bh as usize);
Ok(())
})?;
let _ = test_framework::award_blocks_to_wallet(&chain, wallet1.clone(), 10);
bh += 10;
let arg_vec = vec!["grin", "wallet", "-p", "password", "-a", "mining", "info"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"account_1",
"info",
];
execute_command(&app, test_dir, "wallet2", &client1, arg_vec)?;
let wallet2 = instantiate_wallet(config2.clone(), client2.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet2.clone(), |api| {
api.set_active_account("account_1")?;
let (_, wallet1_info) = api.retrieve_summary_info(true, 1)?;
assert_eq!(wallet1_info.last_confirmed_height, bh);
assert_eq!(wallet1_info.amount_currently_spendable, 10_000_000_000);
Ok(())
})?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mini | e_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "check_repair"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec!["grin", "wallet", "-p", "password", "-a", "mining", "txs"];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin", "wallet", "-p", "password", "-a", "mining", "outputs",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
thread::sleep(Duration::from_millis(200));
Ok(())
}
#[test]
fn wallet_command_line() {
let test_dir = "target/test_output/command_line";
if let Err(e) = command_line_test_impl(test_dir) {
panic!("Libwallet Error: {} - {}", e, e.backtrace().unwrap());
}
}
}
| ng",
"send",
"-m",
"file",
"-d",
&file_name,
"-g",
"Love, Yeast, Smallest",
"-s",
"smallest",
"10",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"receive",
"-i",
&file_name,
"-g",
"Thanks, Yeast!",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec.clone())?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"finalize",
"-i",
&response_file_name,
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
bh += 1;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
let (refreshed, txs) = api.retrieve_txs(true, None, None)?;
assert!(refreshed);
assert_eq!(txs.len(), bh as usize + 1);
Ok(())
})?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"send",
"-m",
"self",
"-d",
"mining",
"-g",
"Self love",
"-o",
"75",
"-s",
"smallest",
"10",
];
execute_command(&app, test_dir, "wallet1", &client1, arg_vec)?;
bh += 1;
let wallet1 = instantiate_wallet(config1.clone(), client1.clone(), "password", "default")?;
grin_wallet::controller::owner_single_use(wallet1.clone(), |api| {
api.set_active_account("mining")?;
let (refreshed, txs) = api.retrieve_txs(true, None, None)?;
assert!(refreshed);
assert_eq!(txs.len(), bh as usize + 2);
Ok(())
})?;
let arg_vec = vec![
"grin",
"wallet",
"-p",
"password",
"-a",
"mining",
"send",
"-m",
"file",
"-d",
&file_name,
"-g",
"Ain't sending",
"10",
];
execut | random | [
{
"content": "/// Returns a list of account to BIP32 path mappings\n\npub fn accounts<T: ?Sized, C, K>(wallet: &mut T) -> Result<Vec<AcctPathMapping>, Error>\n\nwhere\n\n\tT: WalletBackend<C, K>,\n\n\tC: NodeClient,\n\n\tK: Keychain,\n\n{\n\n\tOk(wallet.acct_path_iter().collect())\n\n}\n\n\n",
"file_path": ... |
Rust | diesel/src/serialize.rs | unvalley/diesel | fd723880db6887a859ffa691890fe964de7dd3f8 |
use std::error::Error;
use std::fmt;
use std::io::{self, Write};
use std::result;
use crate::backend::{Backend, HasBindCollector};
use crate::query_builder::bind_collector::RawBytesBindCollector;
use crate::query_builder::BindCollector;
#[cfg(feature = "postgres_backend")]
pub use crate::pg::serialize::*;
pub type Result = result::Result<IsNull, Box<dyn Error + Send + Sync>>;
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
pub enum IsNull {
Yes,
No,
}
pub struct Output<'a, 'b, DB>
where
DB: Backend,
DB::MetadataLookup: 'a,
{
out: <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer,
metadata_lookup: Option<&'b mut DB::MetadataLookup>,
}
impl<'a, 'b, DB: Backend> Output<'a, 'b, DB> {
pub fn new(
out: <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer,
metadata_lookup: &'b mut DB::MetadataLookup,
) -> Self {
Output {
out,
metadata_lookup: Some(metadata_lookup),
}
}
pub fn into_inner(
self,
) -> <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer {
self.out
}
pub fn metadata_lookup(&mut self) -> &mut DB::MetadataLookup {
*self.metadata_lookup.as_mut().expect("Lookup is there")
}
pub fn set_value<V>(&mut self, value: V)
where
V: Into<<crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer>,
{
self.out = value.into();
}
}
#[cfg(test)]
impl<'a, DB: Backend> Output<'a, 'static, DB> {
pub fn test(
buffer: <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer,
) -> Self {
Self {
out: buffer,
metadata_lookup: None,
}
}
}
impl<'a, 'b, DB: Backend<BindCollector = RawBytesBindCollector<DB>>> Write for Output<'a, 'b, DB> {
fn write(&mut self, buf: &[u8]) -> io::Result<usize> {
self.out.write(buf)
}
fn flush(&mut self) -> io::Result<()> {
self.out.flush()
}
fn write_all(&mut self, buf: &[u8]) -> io::Result<()> {
self.out.write_all(buf)
}
fn write_fmt(&mut self, fmt: fmt::Arguments<'_>) -> io::Result<()> {
self.out.write_fmt(fmt)
}
}
impl<'a, 'b, DB: Backend<BindCollector = RawBytesBindCollector<DB>>> Output<'a, 'b, DB> {
pub fn reborrow<'c>(&'c mut self) -> Output<'c, 'c, DB>
where
'a: 'c,
{
Output {
out: RawBytesBindCollector::<DB>::reborrow_buffer(self.out),
metadata_lookup: match &mut self.metadata_lookup {
None => None,
Some(m) => Some(&mut **m),
},
}
}
}
impl<'a, 'b, DB> fmt::Debug for Output<'a, 'b, DB>
where
<<DB as HasBindCollector<'a>>::BindCollector as BindCollector<'a, DB>>::Buffer: fmt::Debug,
DB: Backend,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.out.fmt(f)
}
}
pub trait ToSql<A, DB: Backend>: fmt::Debug {
fn to_sql<'b>(&'b self, out: &mut Output<'b, '_, DB>) -> Result;
}
impl<'a, A, T, DB> ToSql<A, DB> for &'a T
where
DB: Backend,
T: ToSql<A, DB> + ?Sized,
{
fn to_sql<'b>(&'b self, out: &mut Output<'b, '_, DB>) -> Result {
(*self).to_sql(out)
}
}
|
use std::error::Error;
use std::fmt;
use std::io::{self, Write};
use std::result;
use crate::backend::{Backend, HasBindCollector};
use crate::query_builder::bind_collector::RawBytesBindCollector;
use crate::query_builder::BindCollector;
#[cfg(feature = "postgres_backend")]
pub use crate::pg::serialize::*;
pub type Result = result::Result<IsNull, Box<dyn Error + Send + Sync>>;
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
pub enum IsNull {
Yes,
No,
}
pub struct Output<'a, 'b, DB>
where
DB: Backend,
DB::MetadataLookup: 'a,
{
out: <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer,
metadata_lookup: Option<&'b mut DB::MetadataLookup>,
}
impl<'a, 'b, DB: Backend> Output<'a, 'b, DB> {
|
pub fn into_inner(
self,
) -> <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer {
self.out
}
pub fn metadata_lookup(&mut self) -> &mut DB::MetadataLookup {
*self.metadata_lookup.as_mut().expect("Lookup is there")
}
pub fn set_value<V>(&mut self, value: V)
where
V: Into<<crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer>,
{
self.out = value.into();
}
}
#[cfg(test)]
impl<'a, DB: Backend> Output<'a, 'static, DB> {
pub fn test(
buffer: <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer,
) -> Self {
Self {
out: buffer,
metadata_lookup: None,
}
}
}
impl<'a, 'b, DB: Backend<BindCollector = RawBytesBindCollector<DB>>> Write for Output<'a, 'b, DB> {
fn write(&mut self, buf: &[u8]) -> io::Result<usize> {
self.out.write(buf)
}
fn flush(&mut self) -> io::Result<()> {
self.out.flush()
}
fn write_all(&mut self, buf: &[u8]) -> io::Result<()> {
self.out.write_all(buf)
}
fn write_fmt(&mut self, fmt: fmt::Arguments<'_>) -> io::Result<()> {
self.out.write_fmt(fmt)
}
}
impl<'a, 'b, DB: Backend<BindCollector = RawBytesBindCollector<DB>>> Output<'a, 'b, DB> {
pub fn reborrow<'c>(&'c mut self) -> Output<'c, 'c, DB>
where
'a: 'c,
{
Output {
out: RawBytesBindCollector::<DB>::reborrow_buffer(self.out),
metadata_lookup: match &mut self.metadata_lookup {
None => None,
Some(m) => Some(&mut **m),
},
}
}
}
impl<'a, 'b, DB> fmt::Debug for Output<'a, 'b, DB>
where
<<DB as HasBindCollector<'a>>::BindCollector as BindCollector<'a, DB>>::Buffer: fmt::Debug,
DB: Backend,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.out.fmt(f)
}
}
pub trait ToSql<A, DB: Backend>: fmt::Debug {
fn to_sql<'b>(&'b self, out: &mut Output<'b, '_, DB>) -> Result;
}
impl<'a, A, T, DB> ToSql<A, DB> for &'a T
where
DB: Backend,
T: ToSql<A, DB> + ?Sized,
{
fn to_sql<'b>(&'b self, out: &mut Output<'b, '_, DB>) -> Result {
(*self).to_sql(out)
}
}
| pub fn new(
out: <crate::backend::BindCollector<'a, DB> as BindCollector<'a, DB>>::Buffer,
metadata_lookup: &'b mut DB::MetadataLookup,
) -> Self {
Output {
out,
metadata_lookup: Some(metadata_lookup),
}
} | function_block-full_function | [] |
Rust | components/front_matter/src/lib.rs | zoosky/zola | b359cca4fe46a7abc8ce10620561d48d685b86ef | use lazy_static::lazy_static;
use serde_derive::{Deserialize, Serialize};
use errors::{bail, Error, Result};
use regex::Regex;
use std::path::Path;
mod page;
mod section;
pub use page::PageFrontMatter;
pub use section::SectionFrontMatter;
lazy_static! {
static ref PAGE_RE: Regex =
Regex::new(r"^[[:space:]]*\+\+\+\r?\n((?s).*?(?-s))\+\+\+\r?\n?((?s).*(?-s))$").unwrap();
}
#[derive(Debug, Copy, Clone, PartialEq, Serialize, Deserialize)]
#[serde(rename_all = "lowercase")]
pub enum SortBy {
Date,
Weight,
None,
}
#[derive(Debug, Copy, Clone, PartialEq, Serialize, Deserialize)]
#[serde(rename_all = "lowercase")]
pub enum InsertAnchor {
Left,
Right,
None,
}
fn split_content(file_path: &Path, content: &str) -> Result<(String, String)> {
if !PAGE_RE.is_match(content) {
bail!(
"Couldn't find front matter in `{}`. Did you forget to add `+++`?",
file_path.to_string_lossy()
);
}
let caps = PAGE_RE.captures(content).unwrap();
Ok((caps[1].to_string(), caps[2].to_string()))
}
pub fn split_section_content(
file_path: &Path,
content: &str,
) -> Result<(SectionFrontMatter, String)> {
let (front_matter, content) = split_content(file_path, content)?;
let meta = SectionFrontMatter::parse(&front_matter).map_err(|e| {
Error::chain(
format!("Error when parsing front matter of section `{}`", file_path.to_string_lossy()),
e,
)
})?;
Ok((meta, content))
}
pub fn split_page_content(file_path: &Path, content: &str) -> Result<(PageFrontMatter, String)> {
let (front_matter, content) = split_content(file_path, content)?;
let meta = PageFrontMatter::parse(&front_matter).map_err(|e| {
Error::chain(
format!("Error when parsing front matter of page `{}`", file_path.to_string_lossy()),
e,
)
})?;
Ok((meta, content))
}
#[cfg(test)]
mod tests {
use std::path::Path;
use super::{split_page_content, split_section_content};
#[test]
fn can_split_page_content_valid() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-12
+++
Hello
"#;
let (front_matter, content) = split_page_content(Path::new(""), content).unwrap();
assert_eq!(content, "Hello\n");
assert_eq!(front_matter.title.unwrap(), "Title");
}
#[test]
fn can_split_section_content_valid() {
let content = r#"
+++
paginate_by = 10
+++
Hello
"#;
let (front_matter, content) = split_section_content(Path::new(""), content).unwrap();
assert_eq!(content, "Hello\n");
assert!(front_matter.is_paginated());
}
#[test]
fn can_split_content_with_only_frontmatter_valid() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-12
+++"#;
let (front_matter, content) = split_page_content(Path::new(""), content).unwrap();
assert_eq!(content, "");
assert_eq!(front_matter.title.unwrap(), "Title");
}
#[test]
fn can_split_content_lazily() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-02T15:00:00Z
+++
+++"#;
let (front_matter, content) = split_page_content(Path::new(""), content).unwrap();
assert_eq!(content, "+++");
assert_eq!(front_matter.title.unwrap(), "Title");
}
#[test]
fn errors_if_cannot_locate_frontmatter() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-12"#;
let res = split_page_content(Path::new(""), content);
assert!(res.is_err());
}
}
| use lazy_static::lazy_static;
use serde_derive::{Deserialize, Serialize};
use errors::{bail, Error, Result};
use regex::Regex;
use std::path::Path;
mod page;
mod section;
pub use page::PageFrontMatter;
pub use section::SectionFrontMatter;
lazy_static! {
static ref PAGE_RE: Regex =
Regex::new(r"^[[:space:]]*\+\+\+\r?\n((?s).*?(?-s))\+\+\+\r?\n?((?s).*(?-s))$").unwrap();
}
#[derive(Debug, Copy, Clone, PartialEq, Serialize, Deserialize)]
#[serde(rename_all = "lowercase")]
pub enum SortBy {
Date,
Weight,
None,
}
#[derive(Debug, Copy, Clone, PartialEq, Serialize, Deserialize)]
#[serde(rename_all = "lowercase")]
pub enum InsertAnchor {
Left,
Right,
None,
}
fn split_content(file_path: &Path, content: &str) -> Result<(String, String)> {
if !PAGE_RE.is_match(content) {
bail!(
"Couldn't find front matter in `{}`. Did you forget to add `+++`?",
file_path.to_string_lossy()
);
}
let caps = PAGE_RE.captures(content).unwrap();
Ok((caps[1].to_string(), caps[2].to_string()))
}
pub fn split_section_content(
file_path: &Path,
content: &str,
) -> Result<(SectionFrontMatter, String)> {
let (front_matter, content) = split_content(file_path, content)?;
let meta = SectionFrontMatter::parse(&front_matter).map_err(|e| {
Error::chain(
format!("Error when parsing front matter of section `{}`", file_path.to_string_lossy()),
e,
)
})?;
Ok((meta, content))
}
pub fn split_page_content(file_path: &Path, content: &str) -> Result<(PageFrontMatter, String)> {
let (front_matter, content) = split_content(file_path, content)?;
let meta = PageFrontMatter::parse(&front_matter).map_err(|e| {
Error::chain(
format!("Error when parsing front matter of page `{}`", file_path.to_string_lossy()),
e,
)
})?;
| frontmatter() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-12"#;
let res = split_page_content(Path::new(""), content);
assert!(res.is_err());
}
}
| Ok((meta, content))
}
#[cfg(test)]
mod tests {
use std::path::Path;
use super::{split_page_content, split_section_content};
#[test]
fn can_split_page_content_valid() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-12
+++
Hello
"#;
let (front_matter, content) = split_page_content(Path::new(""), content).unwrap();
assert_eq!(content, "Hello\n");
assert_eq!(front_matter.title.unwrap(), "Title");
}
#[test]
fn can_split_section_content_valid() {
let content = r#"
+++
paginate_by = 10
+++
Hello
"#;
let (front_matter, content) = split_section_content(Path::new(""), content).unwrap();
assert_eq!(content, "Hello\n");
assert!(front_matter.is_paginated());
}
#[test]
fn can_split_content_with_only_frontmatter_valid() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-12
+++"#;
let (front_matter, content) = split_page_content(Path::new(""), content).unwrap();
assert_eq!(content, "");
assert_eq!(front_matter.title.unwrap(), "Title");
}
#[test]
fn can_split_content_lazily() {
let content = r#"
+++
title = "Title"
description = "hey there"
date = 2002-10-02T15:00:00Z
+++
+++"#;
let (front_matter, content) = split_page_content(Path::new(""), content).unwrap();
assert_eq!(content, "+++");
assert_eq!(front_matter.title.unwrap(), "Title");
}
#[test]
fn errors_if_cannot_locate_ | random | [
{
"content": "/// Return the content of a file, with error handling added.\n\n/// The default error message is overwritten by the message given.\n\n/// That means it is allocation 2 strings, oh well\n\npub fn read_file_with_error(path: &Path, message: &str) -> Result<String> {\n\n let res = read_file(&path);... |
Rust | near-sdk/src/collections/lookup_set.rs | nearprotocol/near-sdk-rs | 8a2b2e19b27a764abf43df05bd0e530c3ad91d6c |
use std::marker::PhantomData;
use borsh::{BorshDeserialize, BorshSerialize};
use crate::collections::append_slice;
use crate::{env, IntoStorageKey};
const ERR_ELEMENT_SERIALIZATION: &str = "Cannot serialize element with Borsh";
#[derive(BorshSerialize, BorshDeserialize)]
pub struct LookupSet<T> {
element_prefix: Vec<u8>,
#[borsh_skip]
el: PhantomData<T>,
}
impl<T> LookupSet<T> {
pub fn new<S>(element_prefix: S) -> Self
where
S: IntoStorageKey,
{
Self { element_prefix: element_prefix.into_storage_key(), el: PhantomData }
}
fn raw_element_to_storage_key(&self, element_raw: &[u8]) -> Vec<u8> {
append_slice(&self.element_prefix, element_raw)
}
fn contains_raw(&self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
env::storage_has_key(&storage_key)
}
pub fn insert_raw(&mut self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
!env::storage_write(&storage_key, b"")
}
pub fn remove_raw(&mut self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
env::storage_remove(&storage_key)
}
}
impl<T> LookupSet<T>
where
T: BorshSerialize,
{
fn serialize_element(element: &T) -> Vec<u8> {
match element.try_to_vec() {
Ok(x) => x,
Err(_) => env::panic_str(ERR_ELEMENT_SERIALIZATION),
}
}
pub fn contains(&self, element: &T) -> bool {
self.contains_raw(&Self::serialize_element(element))
}
pub fn remove(&mut self, element: &T) -> bool {
self.remove_raw(&Self::serialize_element(element))
}
pub fn insert(&mut self, element: &T) -> bool {
self.insert_raw(&Self::serialize_element(element))
}
pub fn extend<IT: IntoIterator<Item = T>>(&mut self, iter: IT) {
for el in iter {
self.insert(&el);
}
}
}
impl<T> std::fmt::Debug for LookupSet<T>
where
T: std::fmt::Debug + BorshSerialize,
{
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.debug_struct("LookupSet").field("element_prefix", &self.element_prefix).finish()
}
}
#[cfg(not(target_arch = "wasm32"))]
#[cfg(test)]
mod tests {
use crate::collections::LookupSet;
use rand::seq::SliceRandom;
use rand::{Rng, SeedableRng};
use std::collections::HashSet;
#[test]
pub fn test_insert_one() {
let mut map = LookupSet::new(b"m");
assert!(map.insert(&1));
assert!(!map.insert(&1));
}
#[test]
pub fn test_insert() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(0);
for _ in 0..500 {
let key = rng.gen::<u64>();
set.insert(&key);
}
}
#[test]
pub fn test_insert_remove() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(1);
let mut keys = vec![];
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.push(key);
set.insert(&key);
}
keys.shuffle(&mut rng);
for key in keys {
assert!(set.remove(&key));
}
}
#[test]
pub fn test_remove_last_reinsert() {
let mut set = LookupSet::new(b"s");
let key1 = 1u64;
set.insert(&key1);
let key2 = 2u64;
set.insert(&key2);
let actual = set.remove(&key2);
assert!(actual);
let actual_reinsert = set.insert(&key2);
assert!(actual_reinsert);
}
#[test]
pub fn test_insert_override_remove() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(2);
let mut keys = vec![];
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.push(key);
set.insert(&key);
}
keys.shuffle(&mut rng);
for key in &keys {
assert!(!set.insert(key));
}
keys.shuffle(&mut rng);
for key in keys {
assert!(set.remove(&key));
}
}
#[test]
pub fn test_contains_non_existent() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(3);
let mut set_tmp = HashSet::new();
for _ in 0..500 {
let key = rng.gen::<u64>() % 20_000;
set_tmp.insert(key);
set.insert(&key);
}
for _ in 0..500 {
let key = rng.gen::<u64>() % 20_000;
assert_eq!(set.contains(&key), set_tmp.contains(&key));
}
}
#[test]
pub fn test_extend() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(4);
let mut keys = HashSet::new();
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.insert(key);
set.insert(&key);
}
for _ in 0..10 {
let mut tmp = vec![];
for _ in 0..=(rng.gen::<u64>() % 20 + 1) {
let key = rng.gen::<u64>();
tmp.push(key);
}
keys.extend(tmp.iter().cloned());
set.extend(tmp.iter().cloned());
}
for key in keys {
assert!(set.contains(&key));
}
}
#[test]
fn test_debug() {
let set: LookupSet<u64> = LookupSet::new(b"m");
assert_eq!(
format!("{:?}", set),
format!("LookupSet {{ element_prefix: {:?} }}", set.element_prefix)
);
}
}
|
use std::marker::PhantomData;
use borsh::{BorshDeserialize, BorshSerialize};
use crate::collections::append_slice;
use crate::{env, IntoStorageKey};
const ERR_ELEMENT_SERIALIZATION: &str = "Cannot serialize element with Borsh";
#[derive(BorshSerialize, BorshDeserialize)]
pub struct LookupSet<T> {
element_prefix: Vec<u8>,
#[borsh_skip]
el: PhantomData<T>,
}
impl<T> LookupSet<T> {
pub fn new<S>(element_prefix: S) -> Self
where
S: IntoStorageKey,
{
Self { element_prefix: element_prefix.into_storage_key(), el: PhantomData }
}
fn raw_element_to_storage_key(&self, element_raw: &[u8]) -> Vec<u8> {
append_slice(&self.element_prefix, element_raw)
}
fn contains_raw(&self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
env::storage_has_key(&storage_key)
}
pub fn insert_raw(&mut self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
!env::storage_write(&storage_key, b"")
}
pub fn remove_raw(&mut self, element_raw: &[u8]) -> bool {
let storage_key = self.raw_element_to_storage_key(element_raw);
env::storage_remove(&storage_key)
}
}
impl<T> LookupSet<T>
where
T: BorshSerialize,
{
fn serialize_element(element: &T) -> Vec<u8> {
match element.try_to_vec() {
Ok(x) => x,
Err(_) => env::panic_str(ERR_ELEMENT_SERIALIZATION),
}
}
pub fn contains(&self, element: &T) -> bool {
self.contains_raw(&Self::serialize_element(element))
}
pub fn remove(&mut self, element: &T) -> bool {
self.remove_raw(&Self::serialize_element(element))
}
pub fn insert(&mut self, element: &T) -> bool {
self.insert_raw(&Self::serialize_element(element))
}
pub fn extend<IT: IntoIterator<Item = T>>(&mut self, iter: IT) {
for el in iter {
self.insert(&el);
}
}
}
| > std::fmt::Result {
f.debug_struct("LookupSet").field("element_prefix", &self.element_prefix).finish()
}
}
#[cfg(not(target_arch = "wasm32"))]
#[cfg(test)]
mod tests {
use crate::collections::LookupSet;
use rand::seq::SliceRandom;
use rand::{Rng, SeedableRng};
use std::collections::HashSet;
#[test]
pub fn test_insert_one() {
let mut map = LookupSet::new(b"m");
assert!(map.insert(&1));
assert!(!map.insert(&1));
}
#[test]
pub fn test_insert() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(0);
for _ in 0..500 {
let key = rng.gen::<u64>();
set.insert(&key);
}
}
#[test]
pub fn test_insert_remove() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(1);
let mut keys = vec![];
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.push(key);
set.insert(&key);
}
keys.shuffle(&mut rng);
for key in keys {
assert!(set.remove(&key));
}
}
#[test]
pub fn test_remove_last_reinsert() {
let mut set = LookupSet::new(b"s");
let key1 = 1u64;
set.insert(&key1);
let key2 = 2u64;
set.insert(&key2);
let actual = set.remove(&key2);
assert!(actual);
let actual_reinsert = set.insert(&key2);
assert!(actual_reinsert);
}
#[test]
pub fn test_insert_override_remove() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(2);
let mut keys = vec![];
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.push(key);
set.insert(&key);
}
keys.shuffle(&mut rng);
for key in &keys {
assert!(!set.insert(key));
}
keys.shuffle(&mut rng);
for key in keys {
assert!(set.remove(&key));
}
}
#[test]
pub fn test_contains_non_existent() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(3);
let mut set_tmp = HashSet::new();
for _ in 0..500 {
let key = rng.gen::<u64>() % 20_000;
set_tmp.insert(key);
set.insert(&key);
}
for _ in 0..500 {
let key = rng.gen::<u64>() % 20_000;
assert_eq!(set.contains(&key), set_tmp.contains(&key));
}
}
#[test]
pub fn test_extend() {
let mut set = LookupSet::new(b"s");
let mut rng = rand_xorshift::XorShiftRng::seed_from_u64(4);
let mut keys = HashSet::new();
for _ in 0..100 {
let key = rng.gen::<u64>();
keys.insert(key);
set.insert(&key);
}
for _ in 0..10 {
let mut tmp = vec![];
for _ in 0..=(rng.gen::<u64>() % 20 + 1) {
let key = rng.gen::<u64>();
tmp.push(key);
}
keys.extend(tmp.iter().cloned());
set.extend(tmp.iter().cloned());
}
for key in keys {
assert!(set.contains(&key));
}
}
#[test]
fn test_debug() {
let set: LookupSet<u64> = LookupSet::new(b"m");
assert_eq!(
format!("{:?}", set),
format!("LookupSet {{ element_prefix: {:?} }}", set.element_prefix)
);
}
}
|
impl<T> std::fmt::Debug for LookupSet<T>
where
T: std::fmt::Debug + BorshSerialize,
{
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) - | random | [
{
"content": "// ###############\n\n// # Storage API #\n\n// ###############\n\n/// Writes key-value into storage.\n\n/// If another key-value existed in the storage with the same key it returns `true`, otherwise `false`.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use near_sdk::env::{storage_write, stora... |
Rust | src/encrypted_stream.rs | GWBasic/bounce | 2d8a86b8c33bf408ad5d5b20c440233c0746b13a |
/*
use async_std::io;
use async_std::io::{Read, Result, Write};
use async_std::task::{Context, Poll};
use std::marker::Unpin;
use std::pin::Pin;
use rand_core::{CryptoRng, RngCore};
pub struct EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
wrapped_stream: TStream,
write_xor: Xor<TRng>,
read_xor: Xor<TRng>,
}
pub struct Xor<TRng> {
rng: TRng,
xor: [u8; 1024],
ctr: usize,
}
impl<TStream, TRng> Unpin for EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {}
impl<TStream, TRng> EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
pub fn new(wrapped_stream: TStream, write_rng: TRng, read_rng: TRng) -> EncryptedStream<TStream, TRng> {
EncryptedStream {
wrapped_stream,
write_xor: Xor::new(write_rng),
read_xor: Xor::new(read_rng),
}
}
}
impl<TRng> Xor<TRng> where
TRng: CryptoRng + RngCore {
fn new(rng: TRng) -> Xor<TRng> {
Xor {
rng,
xor: [0u8; 1024],
ctr: usize::MAX,
}
}
fn next_byte(&mut self) -> u8 {
if self.ctr >= self.xor.len() {
self.rng.fill_bytes(&mut self.xor[..]);
self.ctr = 0;
}
let b = self.xor[self.ctr];
self.ctr = self.ctr + 1;
b
}
}
impl<TStream: Read + Unpin, TRng> Read for EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
fn poll_read(
mut self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &mut [u8],
) -> Poll<io::Result<usize>> {
let result = Pin::new(&mut self.wrapped_stream).poll_read(cx, buf);
match result {
Poll::Ready(result) => match result {
Result::Ok(size) => {
for ctr in 0..size {
buf[ctr] = buf[ctr] ^ self.read_xor.next_byte();
}
Poll::Ready(Result::Ok(size))
},
Result::Err(err) => Poll::Ready(Result::Err(err))
},
Poll::Pending => Poll::Pending
}
}
}
impl<TStream: Write + Unpin, TRng> Write for EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
fn poll_write(
mut self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &[u8],
) -> Poll<io::Result<usize>> {
let mut encrypted = vec![0; buf.len()];
for ctr in 0..buf.len() {
encrypted[ctr] = buf[ctr] ^ self.write_xor.next_byte();
}
Pin::new(&mut self.wrapped_stream).poll_write(cx, &encrypted)
}
fn poll_flush(
mut self: std::pin::Pin<&mut Self>,
cx: &mut std::task::Context<'_>
) -> std::task::Poll<std::result::Result<(), std::io::Error>> {
Pin::new(&mut self.wrapped_stream).poll_flush(cx)
}
fn poll_close(
mut self: std::pin::Pin<&mut Self>,
cx: &mut std::task::Context<'_>
) -> std::task::Poll<std::result::Result<(), std::io::Error>> {
Pin::new(&mut self.wrapped_stream).poll_close(cx)
}
}
// Test with https://docs.rs/async-std/1.7.0/async_std/io/struct.Cursor.html
#[cfg(test)]
mod tests {
use async_std::io::Cursor;
use futures::io::{AsyncReadExt, AsyncWriteExt};
use rand::{Rng, SeedableRng, thread_rng};
use rand_chacha::ChaCha8Rng;
use super::*;
fn create_stream_and_data_and_rng(stream_buf: Vec<u8>) -> (Cursor<Vec<u8>>, <ChaCha8Rng as SeedableRng>::Seed, ChaCha8Rng, ChaCha8Rng) {
let memory_stream = Cursor::new(stream_buf);
let mut test_seed: <ChaCha8Rng as SeedableRng>::Seed = Default::default();
thread_rng().fill(&mut test_seed);
let test_rng = ChaCha8Rng::from_seed(test_seed.clone());
let ignored_rng = ChaCha8Rng::seed_from_u64(0);
(memory_stream, test_seed, test_rng, ignored_rng)
}
#[async_std::test]
async fn encrypted_stream_works_write() {
let len = 1024 * 1024;
let stream_buf = vec![0u8; len];
let (memory_stream, test_seed, test_rng, ignored_rng) = create_stream_and_data_and_rng(stream_buf);
let mut test_contents = vec![0u8; len];
thread_rng().fill(&mut test_contents[..]);
let mut encrypted_stream = EncryptedStream::new(memory_stream, test_rng, ignored_rng);
encrypted_stream.write_all(&test_contents).await.unwrap();
let stream_buf_encrypted = encrypted_stream.wrapped_stream.into_inner();
// Verify that the contents changed
assert_ne!(test_contents, stream_buf_encrypted, "Contents weren't encrypted");
// Verify each byte
let test_rng = ChaCha8Rng::from_seed(test_seed.clone());
let mut xor = Xor::new(test_rng);
for ctr in 0..test_contents.len() {
let b = xor.next_byte();
assert_eq!(test_contents[ctr], stream_buf_encrypted[ctr] ^ b, "Encrypted content isn't as expected");
}
}
#[async_std::test]
async fn encrypted_stream_works_read() {
let len = 1024 * 1024;
let mut encrypted_contents = vec![0u8; len];
thread_rng().fill(&mut encrypted_contents[..]);
let (memory_stream, test_seed, test_rng, ignored_rng) = create_stream_and_data_and_rng(encrypted_contents.clone());
let mut encrypted_stream = EncryptedStream::new(memory_stream, ignored_rng, test_rng);
let mut decrypted_contents = vec![0u8; encrypted_contents.len()];
let mut bytes_read = 0;
loop {
bytes_read = bytes_read + encrypted_stream.read(&mut decrypted_contents[bytes_read..]).await.unwrap();
if bytes_read >= decrypted_contents.len() {
break;
}
}
// Verify that the contents changed
assert_ne!(encrypted_contents, decrypted_contents, "Contents weren't decrypted");
// Verify each byte
let test_rng = ChaCha8Rng::from_seed(test_seed.clone());
let mut xor = Xor::new(test_rng);
for ctr in 0..encrypted_contents.len() {
let b = xor.next_byte();
assert_eq!(decrypted_contents[ctr], encrypted_contents[ctr] ^ b, "Decrypted content isn't as expected");
}
}
}
*/ |
/*
use async_std::io;
use async_std::io::{Read, Result, Write};
use async_std::task::{Context, Poll};
use std::marker::Unpin;
use std::pin::Pin;
use rand_core::{CryptoRng, RngCore};
pub struct EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
wrapped_stream: TStream,
write_xor: Xor<TRng>,
read_xor: Xor<TRng>,
}
pub struct Xor<TRng> {
rng: TRng,
xor: [u8; 1024],
ctr: usize,
}
impl<TSt | ^ self.write_xor.next_byte();
}
Pin::new(&mut self.wrapped_stream).poll_write(cx, &encrypted)
}
fn poll_flush(
mut self: std::pin::Pin<&mut Self>,
cx: &mut std::task::Context<'_>
) -> std::task::Poll<std::result::Result<(), std::io::Error>> {
Pin::new(&mut self.wrapped_stream).poll_flush(cx)
}
fn poll_close(
mut self: std::pin::Pin<&mut Self>,
cx: &mut std::task::Context<'_>
) -> std::task::Poll<std::result::Result<(), std::io::Error>> {
Pin::new(&mut self.wrapped_stream).poll_close(cx)
}
}
// Test with https://docs.rs/async-std/1.7.0/async_std/io/struct.Cursor.html
#[cfg(test)]
mod tests {
use async_std::io::Cursor;
use futures::io::{AsyncReadExt, AsyncWriteExt};
use rand::{Rng, SeedableRng, thread_rng};
use rand_chacha::ChaCha8Rng;
use super::*;
fn create_stream_and_data_and_rng(stream_buf: Vec<u8>) -> (Cursor<Vec<u8>>, <ChaCha8Rng as SeedableRng>::Seed, ChaCha8Rng, ChaCha8Rng) {
let memory_stream = Cursor::new(stream_buf);
let mut test_seed: <ChaCha8Rng as SeedableRng>::Seed = Default::default();
thread_rng().fill(&mut test_seed);
let test_rng = ChaCha8Rng::from_seed(test_seed.clone());
let ignored_rng = ChaCha8Rng::seed_from_u64(0);
(memory_stream, test_seed, test_rng, ignored_rng)
}
#[async_std::test]
async fn encrypted_stream_works_write() {
let len = 1024 * 1024;
let stream_buf = vec![0u8; len];
let (memory_stream, test_seed, test_rng, ignored_rng) = create_stream_and_data_and_rng(stream_buf);
let mut test_contents = vec![0u8; len];
thread_rng().fill(&mut test_contents[..]);
let mut encrypted_stream = EncryptedStream::new(memory_stream, test_rng, ignored_rng);
encrypted_stream.write_all(&test_contents).await.unwrap();
let stream_buf_encrypted = encrypted_stream.wrapped_stream.into_inner();
// Verify that the contents changed
assert_ne!(test_contents, stream_buf_encrypted, "Contents weren't encrypted");
// Verify each byte
let test_rng = ChaCha8Rng::from_seed(test_seed.clone());
let mut xor = Xor::new(test_rng);
for ctr in 0..test_contents.len() {
let b = xor.next_byte();
assert_eq!(test_contents[ctr], stream_buf_encrypted[ctr] ^ b, "Encrypted content isn't as expected");
}
}
#[async_std::test]
async fn encrypted_stream_works_read() {
let len = 1024 * 1024;
let mut encrypted_contents = vec![0u8; len];
thread_rng().fill(&mut encrypted_contents[..]);
let (memory_stream, test_seed, test_rng, ignored_rng) = create_stream_and_data_and_rng(encrypted_contents.clone());
let mut encrypted_stream = EncryptedStream::new(memory_stream, ignored_rng, test_rng);
let mut decrypted_contents = vec![0u8; encrypted_contents.len()];
let mut bytes_read = 0;
loop {
bytes_read = bytes_read + encrypted_stream.read(&mut decrypted_contents[bytes_read..]).await.unwrap();
if bytes_read >= decrypted_contents.len() {
break;
}
}
// Verify that the contents changed
assert_ne!(encrypted_contents, decrypted_contents, "Contents weren't decrypted");
// Verify each byte
let test_rng = ChaCha8Rng::from_seed(test_seed.clone());
let mut xor = Xor::new(test_rng);
for ctr in 0..encrypted_contents.len() {
let b = xor.next_byte();
assert_eq!(decrypted_contents[ctr], encrypted_contents[ctr] ^ b, "Decrypted content isn't as expected");
}
}
}
*/ | ream, TRng> Unpin for EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {}
impl<TStream, TRng> EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
pub fn new(wrapped_stream: TStream, write_rng: TRng, read_rng: TRng) -> EncryptedStream<TStream, TRng> {
EncryptedStream {
wrapped_stream,
write_xor: Xor::new(write_rng),
read_xor: Xor::new(read_rng),
}
}
}
impl<TRng> Xor<TRng> where
TRng: CryptoRng + RngCore {
fn new(rng: TRng) -> Xor<TRng> {
Xor {
rng,
xor: [0u8; 1024],
ctr: usize::MAX,
}
}
fn next_byte(&mut self) -> u8 {
if self.ctr >= self.xor.len() {
self.rng.fill_bytes(&mut self.xor[..]);
self.ctr = 0;
}
let b = self.xor[self.ctr];
self.ctr = self.ctr + 1;
b
}
}
impl<TStream: Read + Unpin, TRng> Read for EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
fn poll_read(
mut self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &mut [u8],
) -> Poll<io::Result<usize>> {
let result = Pin::new(&mut self.wrapped_stream).poll_read(cx, buf);
match result {
Poll::Ready(result) => match result {
Result::Ok(size) => {
for ctr in 0..size {
buf[ctr] = buf[ctr] ^ self.read_xor.next_byte();
}
Poll::Ready(Result::Ok(size))
},
Result::Err(err) => Poll::Ready(Result::Err(err))
},
Poll::Pending => Poll::Pending
}
}
}
impl<TStream: Write + Unpin, TRng> Write for EncryptedStream<TStream, TRng> where
TStream: Read + Write,
TRng: CryptoRng + RngCore {
fn poll_write(
mut self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &[u8],
) -> Poll<io::Result<usize>> {
let mut encrypted = vec![0; buf.len()];
for ctr in 0..buf.len() {
encrypted[ctr] = buf[ctr] | random | [
{
"content": "pub fn run_bridge<TRng>(xors: Xors<TRng>, clear_stream: TcpStream, clear_stream_name: String, encrypted_stream: TcpStream, encrypted_stream_name: String) where\n\nTRng: CryptoRng + RngCore + Clone + Any {\n\n\n\n match clear_stream.set_nodelay(true) {\n\n Err(err) => {\n\n log... |
Rust | src/routes/proxy/img_proxy.rs | Marc3842h/gitarena | c8c53a7331d4ebc12ea69dfbf6220c11c40526cd | use crate::die;
use crate::prelude::HttpRequestExtensions;
use crate::utils::reqwest_actix_stream::ResponseStream;
use actix_web::http::header::CONTENT_LENGTH;
use actix_web::{HttpRequest, HttpResponse, Responder, web};
use anyhow::{Context, Result};
use gitarena_macros::route;
use log::debug;
use reqwest::Client;
use serde::Deserialize;
use tokio_compat_02::FutureExt;
const PASSTHROUGH_HEADERS: [&str; 6] = [
"cache-control",
"content-encoding",
"etag",
"expires",
"last-modified",
"transfer-encoding"
];
const ACCEPTED_MIME_TYPES: [&str; 43] = [
"image/bmp",
"image/cgm",
"image/g3fax",
"image/gif",
"image/ief",
"image/jp2",
"image/jpeg",
"image/jpg",
"image/pict",
"image/png",
"image/prs.btif",
"image/svg+xml",
"image/tiff",
"image/vnd.adobe.photoshop",
"image/vnd.djvu",
"image/vnd.dwg",
"image/vnd.dxf",
"image/vnd.fastbidsheet",
"image/vnd.fpx",
"image/vnd.fst",
"image/vnd.fujixerox.edmics-mmr",
"image/vnd.fujixerox.edmics-rlc",
"image/vnd.microsoft.icon",
"image/vnd.ms-modi",
"image/vnd.net-fpx",
"image/vnd.wap.wbmp",
"image/vnd.xiff",
"image/webp",
"image/x-cmu-raster",
"image/x-cmx",
"image/x-icon",
"image/x-macpaint",
"image/x-pcx",
"image/x-pict",
"image/x-portable-anymap",
"image/x-portable-bitmap",
"image/x-portable-graymap",
"image/x-portable-pixmap",
"image/x-quicktime",
"image/x-rgb",
"image/x-xbitmap",
"image/x-xpixmap",
"image/x-xwindowdump"
];
#[route("/api/proxy/{url}", method = "GET", err = "text")]
pub(crate) async fn proxy(uri: web::Path<ProxyRequest>, request: HttpRequest) -> Result<impl Responder> {
let url = &uri.url;
if url.is_empty() {
die!(NOT_FOUND, "Invalid url");
}
let bytes = hex::decode(url)?;
let url = String::from_utf8(bytes)?;
let mut client = Client::new().get(&url);
if let Some(header_value) = request.get_header("if-modified-since") {
client = client.header("if-modified-since", header_value);
}
if let Some(header_value) = request.get_header("if-none-match") {
client = client.header("if-none-match", header_value);
}
if let Some(header_value) = request.get_header("cache-control") {
client = client.header("cache-control", header_value);
}
debug!("Image proxy request for {}", &url);
let gateway_response = client.send().compat().await.context("Failed to send request to gateway")?;
let mut response = HttpResponse::build(gateway_response.status());
if let Some(length) = gateway_response.content_length() {
if length > 5242880 {
die!(BAD_GATEWAY, "Content too big");
}
response.append_header((CONTENT_LENGTH, length.to_string()));
}
for (name, value) in gateway_response.headers() {
let lowered_name = name.as_str().to_lowercase();
let value_str = value.to_str()?;
if PASSTHROUGH_HEADERS.contains(&lowered_name.as_str()) {
response.append_header((name.as_str(), value_str));
}
if lowered_name == "content-type" && !ACCEPTED_MIME_TYPES.contains(&value_str) {
die!(BAD_GATEWAY, "Response was not an image");
}
}
Ok(response.streaming(ResponseStream {
stream: gateway_response.bytes_stream()
}))
}
#[derive(Deserialize)]
pub(crate) struct ProxyRequest {
pub(crate) url: String
}
| use crate::die;
use crate::prelude::HttpRequestExtensions;
use crate::utils::reqwest_actix_stream::ResponseStream;
use actix_web::http::header::CONTENT_LENGTH;
use actix_web::{HttpRequest, HttpResponse, Responder, web};
use anyhow::{Context, Result};
use gitarena_macros::route;
use log::debug;
use reqwest::Client;
use serde::Deserialize;
use tokio_compat_02::FutureExt;
const PASSTHROUGH_HEADERS: [&str; 6] = [
"cache-control",
"content-encoding",
"etag",
"expires",
"last-modified",
"transfer-encoding"
];
const ACCEPTED_MIME_TYPES: [&str; 43] = [
"image/bmp",
"image/cgm",
"image/g3fax",
"image/gif",
"image/ief",
"image/jp2",
"image/jpeg",
"image/jpg",
"image/pict",
"image/png",
"image/prs.btif",
"image/svg+xml",
"image/tiff",
"image/vnd.adobe.photoshop",
"image/vnd.djvu",
"image/vnd.dwg",
"image/vnd.dxf",
"image/vnd.fastbidsheet",
"image/vnd.fpx",
"image/vnd.fst",
"image/vnd.fujixerox.edmics-mmr",
"image/vnd.fujixerox.edmics-rlc",
"image/vnd.microsoft.icon",
"image/vnd.ms-modi",
"image/vnd.net-fpx",
"image/vnd.wap.wbmp",
"image/vnd.xiff",
"image/webp",
"image/x-cmu-raster",
"image/x-cmx",
"image/x-icon",
"image/x-macpaint",
"image/x-pcx",
"image/x-pict",
"image/x-portable-anymap",
"image/x-portable-bitmap",
"image/x-portable-graymap",
"image/x-portable-pixmap",
"image/x-quicktime",
"image/x-rgb",
"image/x-xbitmap",
"image/x-xpixmap",
"image/x-xwindowdump"
];
#[route("/api/proxy/{url}", method = "GET", err = "text")]
pub(crate) async fn proxy(uri: web::Path<ProxyRequest>, request: HttpRequest) -> Result<impl Responder> {
let url = &uri.url;
if url.is_empty() {
die!(NOT_FOUND, "Invalid url");
}
let bytes = hex::decode(url)?;
let url = String::from_utf8(bytes)?;
let mut client = Client::new().get(&url);
if let Some(header_value) = request.get_header("if-modified-since") {
client = client.header("if-modified-since", header_value);
}
if let Some(header_value) = request.get_header("if-none-match") {
client = client.header("if-none-match", header_value);
}
if let Some(header_value) = request.get_header("cache-control") {
client = client.header("cache-control", header_value);
}
debug!("Image proxy request for {}", &url);
let gateway_response = client.send().compat().await.context("Failed to send request to gateway")?;
let mut response = HttpResponse::build(gateway_response.status());
if let Some(length) = gateway_response.content_length() {
if length > 5242880 {
die!(BAD_GATEWAY, "Content too big");
}
response.append_header((CONTENT_LENGTH, length.to_string()));
}
for (name, value) in gateway_response.headers() {
let lowered_name = name.as_str().to_lowercase();
let value_str = value.to_str()?;
if PASSTHROUGH_HEADERS.contains(&lowered_name.as_str()) {
respon |
#[derive(Deserialize)]
pub(crate) struct ProxyRequest {
pub(crate) url: String
}
| se.append_header((name.as_str(), value_str));
}
if lowered_name == "content-type" && !ACCEPTED_MIME_TYPES.contains(&value_str) {
die!(BAD_GATEWAY, "Response was not an image");
}
}
Ok(response.streaming(ResponseStream {
stream: gateway_response.bytes_stream()
}))
} | function_block-function_prefixed | [
{
"content": "fn extract_ip(request: &HttpRequest) -> IpNetwork {\n\n let connection_info = request.connection_info();\n\n let ip_str = connection_info.realip_remote_addr().unwrap_or(\"No user agent sent\");\n\n\n\n match IpNetwork::from_str(ip_str) {\n\n Ok(ip_network) => ip_network,\n\n ... |
Rust | fusequery/query/src/datasources/local/csv_table_test.rs | leiysky/fuse-query | 49e268ba7938469c2a3c0541a0c713ef447ccffb |
use std::sync::Arc;
#[tokio::test]
async fn test_csv_table() -> anyhow::Result<()> {
use std::env;
use common_datavalues::*;
use common_planners::*;
use futures::TryStreamExt;
use crate::datasources::local::*;
let options: TableOptions = [(
"location".to_string(),
env::current_dir()?
.join("../../tests/data/sample.csv")
.display()
.to_string()
)]
.iter()
.cloned()
.collect();
let ctx = crate::tests::try_create_context()?;
let table = CsvTable::try_create(
"default".into(),
"test_csv".into(),
DataSchema::new(vec![DataField::new("column1", DataType::UInt64, false)]).into(),
options
)?;
let scan_plan = &ScanPlan {
schema_name: "".to_string(),
table_schema: Arc::new(DataSchema::new(vec![])),
table_args: None,
projection: None,
projected_schema: Arc::new(DataSchema::new(vec![DataField::new(
"column1",
DataType::UInt64,
false
)])),
filters: vec![],
limit: None
};
let source_plan = table.read_plan(ctx.clone(), &scan_plan)?;
ctx.try_set_partitions(source_plan.partitions)?;
let stream = table.read(ctx).await?;
let result = stream.try_collect::<Vec<_>>().await?;
let block = &result[0];
assert_eq!(block.num_columns(), 1);
let expected = vec![
"+---------+",
"| column1 |",
"+---------+",
"| 1 |",
"| 2 |",
"| 3 |",
"| 4 |",
"| 5 |",
"| 6 |",
"+---------+",
];
common_datablocks::assert_blocks_sorted_eq(expected, result.as_slice());
Ok(())
}
#[tokio::test]
async fn test_csv_table_parse_error() -> anyhow::Result<()> {
use std::env;
use common_datavalues::*;
use common_planners::*;
use futures::TryStreamExt;
use pretty_assertions::assert_eq;
use crate::datasources::local::*;
let options: TableOptions = [(
"location".to_string(),
env::current_dir()?
.join("../../tests/data/sample.csv")
.display()
.to_string()
)]
.iter()
.cloned()
.collect();
let ctx = crate::tests::try_create_context()?;
let table = CsvTable::try_create(
"default".into(),
"test_csv".into(),
DataSchema::new(vec![
DataField::new("column1", DataType::UInt64, false),
DataField::new("column2", DataType::UInt64, false),
DataField::new("column3", DataType::UInt64, false),
DataField::new("column4", DataType::UInt64, false),
])
.into(),
options
)?;
let scan_plan = &ScanPlan {
schema_name: "".to_string(),
table_schema: Arc::new(DataSchema::new(vec![])),
table_args: None,
projection: None,
projected_schema: Arc::new(DataSchema::new(vec![DataField::new(
"column2",
DataType::UInt64,
false
)])),
filters: vec![],
limit: None
};
let source_plan = table.read_plan(ctx.clone(), &scan_plan)?;
ctx.try_set_partitions(source_plan.partitions)?;
let stream = table.read(ctx).await?;
let result = stream.try_collect::<Vec<_>>().await;
assert_eq!(true, result.is_err());
if let Err(e) = result {
assert_eq!(
"Code: 1002, displayText = Parser error: Error while parsing value \'Shanghai\' for column 1 at line 1.",
e.to_string()
);
};
Ok(())
}
|
use std::sync::Arc;
#[tokio::test]
async fn test_csv_table() -> anyhow::Result<()> {
use std::env;
use common_datavalues::*;
use common_planners::*;
use futures::TryStreamExt;
use crate::datasources::local::*;
let options: TableOptions = [(
"location".to_string(),
env::current_dir()?
.join("../../tests/data/sample.csv")
.display()
.to_string()
)]
.iter()
.cloned()
.collect();
let ctx = crate::tests::try_create_context()?;
let table = CsvTable::try_create(
"default".into(),
"test_csv".into(),
DataSchema::new(vec![DataField::new("column1", DataType::UInt64, false)]).into(),
options
)?;
let scan_plan = &ScanPlan {
schema_name: "".to_string(),
table_schema: Arc::new(DataSchema::new(vec![])),
table_args: None,
projection: None,
projected_schema: Arc::new(DataSchema::new(vec![DataField::new(
"column1",
DataType::UInt64,
false
)])),
filters: vec![],
limit: None
};
let source_plan = table.read_plan(ctx.clone(), &scan_plan)?;
ctx.try_set_partitions(source_plan.partitions)?;
let stream = table.read(ctx).await?;
let result = stream.try_collect::<Vec<_>>().await?;
let block = &result[0];
assert_eq!(block.num_columns(), 1);
let expected = vec![
"+---------+",
"| column1 |",
"+---------+",
"| 1 |",
"| 2 |",
"| 3 |",
"| 4 |",
"| 5 |",
"| 6 |",
"+---------+",
];
common_datablocks::assert_blocks_sorted_eq(expected, result.as_slice());
Ok(())
}
#[tokio::test]
| async fn test_csv_table_parse_error() -> anyhow::Result<()> {
use std::env;
use common_datavalues::*;
use common_planners::*;
use futures::TryStreamExt;
use pretty_assertions::assert_eq;
use crate::datasources::local::*;
let options: TableOptions = [(
"location".to_string(),
env::current_dir()?
.join("../../tests/data/sample.csv")
.display()
.to_string()
)]
.iter()
.cloned()
.collect();
let ctx = crate::tests::try_create_context()?;
let table = CsvTable::try_create(
"default".into(),
"test_csv".into(),
DataSchema::new(vec![
DataField::new("column1", DataType::UInt64, false),
DataField::new("column2", DataType::UInt64, false),
DataField::new("column3", DataType::UInt64, false),
DataField::new("column4", DataType::UInt64, false),
])
.into(),
options
)?;
let scan_plan = &ScanPlan {
schema_name: "".to_string(),
table_schema: Arc::new(DataSchema::new(vec![])),
table_args: None,
projection: None,
projected_schema: Arc::new(DataSchema::new(vec![DataField::new(
"column2",
DataType::UInt64,
false
)])),
filters: vec![],
limit: None
};
let source_plan = table.read_plan(ctx.clone(), &scan_plan)?;
ctx.try_set_partitions(source_plan.partitions)?;
let stream = table.read(ctx).await?;
let result = stream.try_collect::<Vec<_>>().await;
assert_eq!(true, result.is_err());
if let Err(e) = result {
assert_eq!(
"Code: 1002, displayText = Parser error: Error while parsing value \'Shanghai\' for column 1 at line 1.",
e.to_string()
);
};
Ok(())
} | function_block-full_function | [
{
"content": "fn build_boolean_column(values: &DataArrayRef) -> Result<Vec<Option<u8>>> {\n\n let values = as_boolean_array(values);\n\n\n\n Ok(match values.null_count() {\n\n //faster path\n\n 0 => (0..values.len())\n\n .map(|i| Some(values.value(i) as u8))\n\n .collec... | |
Rust | crates/bevy_winit/src/winit_windows.rs | Schell-0x52/bevy | 39224eed1716a9a069ff2f19c4dc93dcd9f88452 | use bevy_math::IVec2;
use bevy_utils::HashMap;
use bevy_window::{Window, WindowDescriptor, WindowId, WindowMode};
use raw_window_handle::HasRawWindowHandle;
use winit::dpi::LogicalSize;
#[derive(Debug, Default)]
pub struct WinitWindows {
pub windows: HashMap<winit::window::WindowId, winit::window::Window>,
pub window_id_to_winit: HashMap<WindowId, winit::window::WindowId>,
pub winit_to_window_id: HashMap<winit::window::WindowId, WindowId>,
}
impl WinitWindows {
pub fn create_window(
&mut self,
event_loop: &winit::event_loop::EventLoopWindowTarget<()>,
window_id: WindowId,
window_descriptor: &WindowDescriptor,
) -> Window {
#[cfg(target_os = "windows")]
let mut winit_window_builder = {
use winit::platform::windows::WindowBuilderExtWindows;
winit::window::WindowBuilder::new().with_drag_and_drop(false)
};
#[cfg(not(target_os = "windows"))]
let mut winit_window_builder = winit::window::WindowBuilder::new();
winit_window_builder = match window_descriptor.mode {
WindowMode::BorderlessFullscreen => winit_window_builder.with_fullscreen(Some(
winit::window::Fullscreen::Borderless(event_loop.primary_monitor()),
)),
WindowMode::Fullscreen { use_size } => winit_window_builder.with_fullscreen(Some(
winit::window::Fullscreen::Exclusive(match use_size {
true => get_fitting_videomode(
&event_loop.primary_monitor().unwrap(),
window_descriptor.width as u32,
window_descriptor.height as u32,
),
false => get_best_videomode(&event_loop.primary_monitor().unwrap()),
}),
)),
_ => {
let WindowDescriptor {
width,
height,
position,
scale_factor_override,
..
} = window_descriptor;
if let Some(position) = position {
if let Some(sf) = scale_factor_override {
winit_window_builder = winit_window_builder.with_position(
winit::dpi::LogicalPosition::new(
position[0] as f64,
position[1] as f64,
)
.to_physical::<f64>(*sf),
);
} else {
winit_window_builder =
winit_window_builder.with_position(winit::dpi::LogicalPosition::new(
position[0] as f64,
position[1] as f64,
));
}
}
if let Some(sf) = scale_factor_override {
winit_window_builder.with_inner_size(
winit::dpi::LogicalSize::new(*width, *height).to_physical::<f64>(*sf),
)
} else {
winit_window_builder
.with_inner_size(winit::dpi::LogicalSize::new(*width, *height))
}
}
.with_resizable(window_descriptor.resizable)
.with_decorations(window_descriptor.decorations),
};
let constraints = window_descriptor.resize_constraints.check_constraints();
let min_inner_size = LogicalSize {
width: constraints.min_width,
height: constraints.min_height,
};
let max_inner_size = LogicalSize {
width: constraints.max_width,
height: constraints.max_height,
};
let winit_window_builder =
if constraints.max_width.is_finite() && constraints.max_height.is_finite() {
winit_window_builder
.with_min_inner_size(min_inner_size)
.with_max_inner_size(max_inner_size)
} else {
winit_window_builder.with_min_inner_size(min_inner_size)
};
#[allow(unused_mut)]
let mut winit_window_builder = winit_window_builder.with_title(&window_descriptor.title);
#[cfg(target_arch = "wasm32")]
{
use wasm_bindgen::JsCast;
use winit::platform::web::WindowBuilderExtWebSys;
if let Some(selector) = &window_descriptor.canvas {
let window = web_sys::window().unwrap();
let document = window.document().unwrap();
let canvas = document
.query_selector(&selector)
.expect("Cannot query for canvas element.");
if let Some(canvas) = canvas {
let canvas = canvas.dyn_into::<web_sys::HtmlCanvasElement>().ok();
winit_window_builder = winit_window_builder.with_canvas(canvas);
} else {
panic!("Cannot find element: {}.", selector);
}
}
}
let winit_window = winit_window_builder.build(event_loop).unwrap();
match winit_window.set_cursor_grab(window_descriptor.cursor_locked) {
Ok(_) => {}
Err(winit::error::ExternalError::NotSupported(_)) => {}
Err(err) => Err(err).unwrap(),
}
winit_window.set_cursor_visible(window_descriptor.cursor_visible);
self.window_id_to_winit.insert(window_id, winit_window.id());
self.winit_to_window_id.insert(winit_window.id(), window_id);
#[cfg(target_arch = "wasm32")]
{
use winit::platform::web::WindowExtWebSys;
if window_descriptor.canvas.is_none() {
let canvas = winit_window.canvas();
let window = web_sys::window().unwrap();
let document = window.document().unwrap();
let body = document.body().unwrap();
body.append_child(&canvas)
.expect("Append canvas to HTML body.");
}
}
let position = winit_window
.outer_position()
.ok()
.map(|position| IVec2::new(position.x, position.y));
let inner_size = winit_window.inner_size();
let scale_factor = winit_window.scale_factor();
let raw_window_handle = winit_window.raw_window_handle();
self.windows.insert(winit_window.id(), winit_window);
Window::new(
window_id,
window_descriptor,
inner_size.width,
inner_size.height,
scale_factor,
position,
raw_window_handle,
)
}
pub fn get_window(&self, id: WindowId) -> Option<&winit::window::Window> {
self.window_id_to_winit
.get(&id)
.and_then(|id| self.windows.get(id))
}
pub fn get_window_id(&self, id: winit::window::WindowId) -> Option<WindowId> {
self.winit_to_window_id.get(&id).cloned()
}
}
pub fn get_fitting_videomode(
monitor: &winit::monitor::MonitorHandle,
width: u32,
height: u32,
) -> winit::monitor::VideoMode {
let mut modes = monitor.video_modes().collect::<Vec<_>>();
fn abs_diff(a: u32, b: u32) -> u32 {
if a > b {
return a - b;
}
b - a
}
modes.sort_by(|a, b| {
use std::cmp::Ordering::*;
match abs_diff(a.size().width, width).cmp(&abs_diff(b.size().width, width)) {
Equal => {
match abs_diff(a.size().height, height).cmp(&abs_diff(b.size().height, height)) {
Equal => b.refresh_rate().cmp(&a.refresh_rate()),
default => default,
}
}
default => default,
}
});
modes.first().unwrap().clone()
}
pub fn get_best_videomode(monitor: &winit::monitor::MonitorHandle) -> winit::monitor::VideoMode {
let mut modes = monitor.video_modes().collect::<Vec<_>>();
modes.sort_by(|a, b| {
use std::cmp::Ordering::*;
match b.size().width.cmp(&a.size().width) {
Equal => match b.size().height.cmp(&a.size().height) {
Equal => b.refresh_rate().cmp(&a.refresh_rate()),
default => default,
},
default => default,
}
});
modes.first().unwrap().clone()
}
#[cfg(target_arch = "wasm32")]
unsafe impl Send for WinitWindows {}
#[cfg(target_arch = "wasm32")]
unsafe impl Sync for WinitWindows {}
| use bevy_math::IVec2;
use bevy_utils::HashMap;
use bevy_window::{Window, WindowDescriptor, WindowId, WindowMode};
use raw_window_handle::HasRawWindowHandle;
use winit::dpi::LogicalSize;
#[derive(Debug, Default)]
pub struct WinitWindows {
pub windows: HashMap<winit::window::WindowId, winit::window::Window>,
pub window_id_to_winit: HashMap<WindowId, winit::window::WindowId>,
pub winit_to_window_id: HashMap<winit::window::WindowId, WindowId>,
}
impl WinitWindows {
|
pub fn get_window(&self, id: WindowId) -> Option<&winit::window::Window> {
self.window_id_to_winit
.get(&id)
.and_then(|id| self.windows.get(id))
}
pub fn get_window_id(&self, id: winit::window::WindowId) -> Option<WindowId> {
self.winit_to_window_id.get(&id).cloned()
}
}
pub fn get_fitting_videomode(
monitor: &winit::monitor::MonitorHandle,
width: u32,
height: u32,
) -> winit::monitor::VideoMode {
let mut modes = monitor.video_modes().collect::<Vec<_>>();
fn abs_diff(a: u32, b: u32) -> u32 {
if a > b {
return a - b;
}
b - a
}
modes.sort_by(|a, b| {
use std::cmp::Ordering::*;
match abs_diff(a.size().width, width).cmp(&abs_diff(b.size().width, width)) {
Equal => {
match abs_diff(a.size().height, height).cmp(&abs_diff(b.size().height, height)) {
Equal => b.refresh_rate().cmp(&a.refresh_rate()),
default => default,
}
}
default => default,
}
});
modes.first().unwrap().clone()
}
pub fn get_best_videomode(monitor: &winit::monitor::MonitorHandle) -> winit::monitor::VideoMode {
let mut modes = monitor.video_modes().collect::<Vec<_>>();
modes.sort_by(|a, b| {
use std::cmp::Ordering::*;
match b.size().width.cmp(&a.size().width) {
Equal => match b.size().height.cmp(&a.size().height) {
Equal => b.refresh_rate().cmp(&a.refresh_rate()),
default => default,
},
default => default,
}
});
modes.first().unwrap().clone()
}
#[cfg(target_arch = "wasm32")]
unsafe impl Send for WinitWindows {}
#[cfg(target_arch = "wasm32")]
unsafe impl Sync for WinitWindows {}
| pub fn create_window(
&mut self,
event_loop: &winit::event_loop::EventLoopWindowTarget<()>,
window_id: WindowId,
window_descriptor: &WindowDescriptor,
) -> Window {
#[cfg(target_os = "windows")]
let mut winit_window_builder = {
use winit::platform::windows::WindowBuilderExtWindows;
winit::window::WindowBuilder::new().with_drag_and_drop(false)
};
#[cfg(not(target_os = "windows"))]
let mut winit_window_builder = winit::window::WindowBuilder::new();
winit_window_builder = match window_descriptor.mode {
WindowMode::BorderlessFullscreen => winit_window_builder.with_fullscreen(Some(
winit::window::Fullscreen::Borderless(event_loop.primary_monitor()),
)),
WindowMode::Fullscreen { use_size } => winit_window_builder.with_fullscreen(Some(
winit::window::Fullscreen::Exclusive(match use_size {
true => get_fitting_videomode(
&event_loop.primary_monitor().unwrap(),
window_descriptor.width as u32,
window_descriptor.height as u32,
),
false => get_best_videomode(&event_loop.primary_monitor().unwrap()),
}),
)),
_ => {
let WindowDescriptor {
width,
height,
position,
scale_factor_override,
..
} = window_descriptor;
if let Some(position) = position {
if let Some(sf) = scale_factor_override {
winit_window_builder = winit_window_builder.with_position(
winit::dpi::LogicalPosition::new(
position[0] as f64,
position[1] as f64,
)
.to_physical::<f64>(*sf),
);
} else {
winit_window_builder =
winit_window_builder.with_position(winit::dpi::LogicalPosition::new(
position[0] as f64,
position[1] as f64,
));
}
}
if let Some(sf) = scale_factor_override {
winit_window_builder.with_inner_size(
winit::dpi::LogicalSize::new(*width, *height).to_physical::<f64>(*sf),
)
} else {
winit_window_builder
.with_inner_size(winit::dpi::LogicalSize::new(*width, *height))
}
}
.with_resizable(window_descriptor.resizable)
.with_decorations(window_descriptor.decorations),
};
let constraints = window_descriptor.resize_constraints.check_constraints();
let min_inner_size = LogicalSize {
width: constraints.min_width,
height: constraints.min_height,
};
let max_inner_size = LogicalSize {
width: constraints.max_width,
height: constraints.max_height,
};
let winit_window_builder =
if constraints.max_width.is_finite() && constraints.max_height.is_finite() {
winit_window_builder
.with_min_inner_size(min_inner_size)
.with_max_inner_size(max_inner_size)
} else {
winit_window_builder.with_min_inner_size(min_inner_size)
};
#[allow(unused_mut)]
let mut winit_window_builder = winit_window_builder.with_title(&window_descriptor.title);
#[cfg(target_arch = "wasm32")]
{
use wasm_bindgen::JsCast;
use winit::platform::web::WindowBuilderExtWebSys;
if let Some(selector) = &window_descriptor.canvas {
let window = web_sys::window().unwrap();
let document = window.document().unwrap();
let canvas = document
.query_selector(&selector)
.expect("Cannot query for canvas element.");
if let Some(canvas) = canvas {
let canvas = canvas.dyn_into::<web_sys::HtmlCanvasElement>().ok();
winit_window_builder = winit_window_builder.with_canvas(canvas);
} else {
panic!("Cannot find element: {}.", selector);
}
}
}
let winit_window = winit_window_builder.build(event_loop).unwrap();
match winit_window.set_cursor_grab(window_descriptor.cursor_locked) {
Ok(_) => {}
Err(winit::error::ExternalError::NotSupported(_)) => {}
Err(err) => Err(err).unwrap(),
}
winit_window.set_cursor_visible(window_descriptor.cursor_visible);
self.window_id_to_winit.insert(window_id, winit_window.id());
self.winit_to_window_id.insert(winit_window.id(), window_id);
#[cfg(target_arch = "wasm32")]
{
use winit::platform::web::WindowExtWebSys;
if window_descriptor.canvas.is_none() {
let canvas = winit_window.canvas();
let window = web_sys::window().unwrap();
let document = window.document().unwrap();
let body = document.body().unwrap();
body.append_child(&canvas)
.expect("Append canvas to HTML body.");
}
}
let position = winit_window
.outer_position()
.ok()
.map(|position| IVec2::new(position.x, position.y));
let inner_size = winit_window.inner_size();
let scale_factor = winit_window.scale_factor();
let raw_window_handle = winit_window.raw_window_handle();
self.windows.insert(winit_window.id(), winit_window);
Window::new(
window_id,
window_descriptor,
inner_size.width,
inner_size.height,
scale_factor,
position,
raw_window_handle,
)
} | function_block-full_function | [
{
"content": "/// An ordered &str->ReflectValue mapping where &str is a \"field\".\n\n/// This corresponds to rust struct types.\n\npub trait Struct: Reflect {\n\n fn field(&self, name: &str) -> Option<&dyn Reflect>;\n\n fn field_mut(&mut self, name: &str) -> Option<&mut dyn Reflect>;\n\n fn field_at(&... |
Rust | src/cargo/sources/registry/remote.rs | Aelnor/cargo | b1684e28490a111b4956b40377abb2b961bfd4b3 | use crate::core::{GitReference, PackageId, SourceId};
use crate::sources::git;
use crate::sources::registry::MaybeLock;
use crate::sources::registry::{
RegistryConfig, RegistryData, CRATE_TEMPLATE, LOWER_PREFIX_TEMPLATE, PREFIX_TEMPLATE,
VERSION_TEMPLATE,
};
use crate::util::errors::CargoResult;
use crate::util::interning::InternedString;
use crate::util::{Config, Filesystem};
use anyhow::Context as _;
use cargo_util::{paths, Sha256};
use lazycell::LazyCell;
use log::{debug, trace};
use std::cell::{Cell, Ref, RefCell};
use std::fmt::Write as FmtWrite;
use std::fs::{self, File, OpenOptions};
use std::io::prelude::*;
use std::io::SeekFrom;
use std::mem;
use std::path::Path;
use std::str;
fn make_dep_prefix(name: &str) -> String {
match name.len() {
1 => String::from("1"),
2 => String::from("2"),
3 => format!("3/{}", &name[..1]),
_ => format!("{}/{}", &name[0..2], &name[2..4]),
}
}
pub struct RemoteRegistry<'cfg> {
index_path: Filesystem,
cache_path: Filesystem,
source_id: SourceId,
index_git_ref: GitReference,
config: &'cfg Config,
tree: RefCell<Option<git2::Tree<'static>>>,
repo: LazyCell<git2::Repository>,
head: Cell<Option<git2::Oid>>,
current_sha: Cell<Option<InternedString>>,
}
impl<'cfg> RemoteRegistry<'cfg> {
pub fn new(source_id: SourceId, config: &'cfg Config, name: &str) -> RemoteRegistry<'cfg> {
RemoteRegistry {
index_path: config.registry_index_path().join(name),
cache_path: config.registry_cache_path().join(name),
source_id,
config,
index_git_ref: GitReference::DefaultBranch,
tree: RefCell::new(None),
repo: LazyCell::new(),
head: Cell::new(None),
current_sha: Cell::new(None),
}
}
fn repo(&self) -> CargoResult<&git2::Repository> {
self.repo.try_borrow_with(|| {
let path = self.config.assert_package_cache_locked(&self.index_path);
if let Ok(repo) = git2::Repository::open(&path) {
trace!("opened a repo without a lock");
return Ok(repo);
}
trace!("acquiring registry index lock");
match git2::Repository::open(&path) {
Ok(repo) => Ok(repo),
Err(_) => {
drop(paths::remove_dir_all(&path));
paths::create_dir_all(&path)?;
let mut opts = git2::RepositoryInitOptions::new();
opts.external_template(false);
Ok(git2::Repository::init_opts(&path, &opts)
.with_context(|| "failed to initialize index git repository")?)
}
}
})
}
fn head(&self) -> CargoResult<git2::Oid> {
if self.head.get().is_none() {
let repo = self.repo()?;
let oid = self.index_git_ref.resolve(repo)?;
self.head.set(Some(oid));
}
Ok(self.head.get().unwrap())
}
fn tree(&self) -> CargoResult<Ref<'_, git2::Tree<'_>>> {
{
let tree = self.tree.borrow();
if tree.is_some() {
return Ok(Ref::map(tree, |s| s.as_ref().unwrap()));
}
}
let repo = self.repo()?;
let commit = repo.find_commit(self.head()?)?;
let tree = commit.tree()?;
let tree = unsafe { mem::transmute::<git2::Tree<'_>, git2::Tree<'static>>(tree) };
*self.tree.borrow_mut() = Some(tree);
Ok(Ref::map(self.tree.borrow(), |s| s.as_ref().unwrap()))
}
fn filename(&self, pkg: PackageId) -> String {
format!("{}-{}.crate", pkg.name(), pkg.version())
}
}
const LAST_UPDATED_FILE: &str = ".last-updated";
impl<'cfg> RegistryData for RemoteRegistry<'cfg> {
fn prepare(&self) -> CargoResult<()> {
self.repo()?;
Ok(())
}
fn index_path(&self) -> &Filesystem {
&self.index_path
}
fn assert_index_locked<'a>(&self, path: &'a Filesystem) -> &'a Path {
self.config.assert_package_cache_locked(path)
}
fn current_version(&self) -> Option<InternedString> {
if let Some(sha) = self.current_sha.get() {
return Some(sha);
}
let sha = InternedString::new(&self.head().ok()?.to_string());
self.current_sha.set(Some(sha));
Some(sha)
}
fn load(
&self,
_root: &Path,
path: &Path,
data: &mut dyn FnMut(&[u8]) -> CargoResult<()>,
) -> CargoResult<()> {
let repo = self.repo()?;
let tree = self.tree()?;
let entry = tree.get_path(path)?;
let object = entry.to_object(repo)?;
let blob = match object.as_blob() {
Some(blob) => blob,
None => anyhow::bail!("path `{}` is not a blob in the git repo", path.display()),
};
data(blob.content())
}
fn config(&mut self) -> CargoResult<Option<RegistryConfig>> {
debug!("loading config");
self.prepare()?;
self.config.assert_package_cache_locked(&self.index_path);
let mut config = None;
self.load(Path::new(""), Path::new("config.json"), &mut |json| {
config = Some(serde_json::from_slice(json)?);
Ok(())
})?;
trace!("config loaded");
Ok(config)
}
fn update_index(&mut self) -> CargoResult<()> {
if self.config.offline() {
return Ok(());
}
if self.config.cli_unstable().no_index_update {
return Ok(());
}
if self.config.updated_sources().contains(&self.source_id) {
return Ok(());
}
debug!("updating the index");
self.config.http()?;
self.prepare()?;
self.head.set(None);
*self.tree.borrow_mut() = None;
self.current_sha.set(None);
let path = self.config.assert_package_cache_locked(&self.index_path);
self.config
.shell()
.status("Updating", self.source_id.display_index())?;
let url = self.source_id.url();
let repo = self.repo.borrow_mut().unwrap();
git::fetch(repo, url.as_str(), &self.index_git_ref, self.config)
.with_context(|| format!("failed to fetch `{}`", url))?;
self.config.updated_sources().insert(self.source_id);
paths::create(&path.join(LAST_UPDATED_FILE))?;
Ok(())
}
fn download(&mut self, pkg: PackageId, _checksum: &str) -> CargoResult<MaybeLock> {
let filename = self.filename(pkg);
let path = self.cache_path.join(&filename);
let path = self.config.assert_package_cache_locked(&path);
if let Ok(dst) = File::open(&path) {
let meta = dst.metadata()?;
if meta.len() > 0 {
return Ok(MaybeLock::Ready(dst));
}
}
let config = self.config()?.unwrap();
let mut url = config.dl;
if !url.contains(CRATE_TEMPLATE)
&& !url.contains(VERSION_TEMPLATE)
&& !url.contains(PREFIX_TEMPLATE)
&& !url.contains(LOWER_PREFIX_TEMPLATE)
{
write!(url, "/{}/{}/download", CRATE_TEMPLATE, VERSION_TEMPLATE).unwrap();
}
let prefix = make_dep_prefix(&*pkg.name());
let url = url
.replace(CRATE_TEMPLATE, &*pkg.name())
.replace(VERSION_TEMPLATE, &pkg.version().to_string())
.replace(PREFIX_TEMPLATE, &prefix)
.replace(LOWER_PREFIX_TEMPLATE, &prefix.to_lowercase());
Ok(MaybeLock::Download {
url,
descriptor: pkg.to_string(),
})
}
fn finish_download(
&mut self,
pkg: PackageId,
checksum: &str,
data: &[u8],
) -> CargoResult<File> {
let actual = Sha256::new().update(data).finish_hex();
if actual != checksum {
anyhow::bail!("failed to verify the checksum of `{}`", pkg)
}
let filename = self.filename(pkg);
self.cache_path.create_dir()?;
let path = self.cache_path.join(&filename);
let path = self.config.assert_package_cache_locked(&path);
let mut dst = OpenOptions::new()
.create(true)
.read(true)
.write(true)
.open(&path)
.with_context(|| format!("failed to open `{}`", path.display()))?;
let meta = dst.metadata()?;
if meta.len() > 0 {
return Ok(dst);
}
dst.write_all(data)?;
dst.seek(SeekFrom::Start(0))?;
Ok(dst)
}
fn is_crate_downloaded(&self, pkg: PackageId) -> bool {
let filename = format!("{}-{}.crate", pkg.name(), pkg.version());
let path = Path::new(&filename);
let path = self.cache_path.join(path);
let path = self.config.assert_package_cache_locked(&path);
if let Ok(meta) = fs::metadata(path) {
return meta.len() > 0;
}
false
}
}
impl<'cfg> Drop for RemoteRegistry<'cfg> {
fn drop(&mut self) {
self.tree.borrow_mut().take();
}
}
#[cfg(test)]
mod tests {
use super::make_dep_prefix;
#[test]
fn dep_prefix() {
assert_eq!(make_dep_prefix("a"), "1");
assert_eq!(make_dep_prefix("ab"), "2");
assert_eq!(make_dep_prefix("abc"), "3/a");
assert_eq!(make_dep_prefix("Abc"), "3/A");
assert_eq!(make_dep_prefix("AbCd"), "Ab/Cd");
assert_eq!(make_dep_prefix("aBcDe"), "aB/cD");
}
}
| use crate::core::{GitReference, PackageId, SourceId};
use crate::sources::git;
use crate::sources::registry::MaybeLock;
use crate::sources::registry::{
RegistryConfig, RegistryData, CRATE_TEMPLATE, LOWER_PREFIX_TEMPLATE, PREFIX_TEMPLATE,
VERSION_TEMPLATE,
};
use crate::util::errors::CargoResult;
use crate::util::interning::InternedString;
use crate::util::{Config, Filesystem};
use anyhow::Context as _;
use cargo_util::{paths, Sha256};
use lazycell::LazyCell;
use log::{debug, trace};
use std::cell::{Cell, Ref, RefCell};
use std::fmt::Write as FmtWrite;
use std::fs::{self, File, OpenOptions};
use std::io::prelude::*;
use std::io::SeekFrom;
use std::mem;
use std::path::Path;
use std::str;
fn make_dep_prefix(name: &str) -> String {
match name.len() {
1 => String::from("1"),
2 => String::from("2"),
3 => format!("3/{}", &name[..1]),
_ => format!("{}/{}", &name[0..2], &name[2..4]),
}
}
pub struct RemoteRegistry<'cfg> {
index_path: Filesystem,
cache_path: Filesystem,
source_id: SourceId,
index_git_ref: GitReference,
config: &'cfg Config,
tree: RefCell<Option<git2::Tree<'static>>>,
repo: LazyCell<git2::Repository>,
head: Cell<Option<git2::Oid>>,
current_sha: Cell<Option<InternedString>>,
}
impl<'cfg> RemoteRegistry<'cfg> {
pub fn new(source_id: SourceId, config: &'cfg Config, name: &str) -> RemoteRegistry<'cfg> {
RemoteRegistry {
index_path: config.registry_index_path().join(name),
cache_path: config.registry_cache_path().join(name),
source_id,
config,
index_git_ref: GitReference::DefaultBranch,
tree: RefCell::new(None),
repo: LazyCell::new(),
head: Cell::new(None),
current_sha: Cell::new(None),
}
}
fn repo(&self) -> CargoResult<&git2::Repository> {
self.repo.try_borrow_with(|| {
let path = self.config.assert_package_cache_locked(&self.index_path);
if let Ok(repo) = git2::Repository::open(&path) {
trace!("opened a repo without a lock");
return Ok(repo);
}
trace!("acquiring registry index lock");
match git2::Repository::open(&path) {
Ok(repo) => Ok(repo),
Err(_) => {
drop(paths::remove_dir_all(&path));
paths::create_dir_all(&path)?;
let mut opts = git2::RepositoryInitOptions::new();
opts.external_template(false);
Ok(git2::Repository::init_opts(&path, &opts)
.with_context(|| "failed to initialize index git repository")?)
}
}
})
}
fn head(&self) -> CargoResult<git2::Oid> {
if self.head.get().is_none() {
let repo = self.repo()?;
let oid = self.index_git_ref.resolve(repo)?;
self.head.set(Some(oid));
}
Ok(self.head.get().unwrap())
}
fn tree(&self) -> CargoResult<Ref<'_, git2::Tree<'_>>> {
{
let tree = self.tree.borrow();
if tree.is_some() {
return Ok(Ref::map(tree, |s| s.as_ref().unwrap()));
}
}
let repo = self.repo()?;
let commit = repo.find_commit(self.head()?)?;
let tree = commit.tree()?;
let tree = unsafe { mem::transmute::<git2::Tree<'_>, git2::Tree<'static>>(tree) };
*self.tree.borrow_mut() = Some(tree);
Ok(Ref::map(self.tree.borrow(), |s| s.as_ref().unwrap()))
}
fn filename(&self, pkg: PackageId) -> String {
format!("{}-{}.crate", pkg.name(), pkg.version())
}
}
const LAST_UPDATED_FILE: &str = ".last-updated";
impl<'cfg> RegistryData for RemoteRegistry<'cfg> {
fn prepare(&self) -> CargoResult<()> {
self.repo()?;
Ok(())
}
fn index_path(&self) -> &Filesystem {
&self.index_path
}
fn assert_index_locked<'a>(&self, path: &'a Filesystem) -> &'a Path {
self.config.assert_package_cache_locked(path)
}
fn current_version(&self) -> Option<InternedString> {
if let Some(sha) = self.current_sha.get() {
return Some(sha);
}
let sha = InternedString::new(&self.head().ok()?.to_string());
self.current_sha.set(Some(sha));
Some(sha)
}
fn load(
&self,
_root: &Path,
path: &Path,
data: &mut dyn FnMut(&[u8]) -> CargoResult<()>,
) -> CargoResult<()> {
let repo = self.repo()?;
let tree = self.tree()?;
let entry = tree.get_path(path)?;
let object = entry.to_object(repo)?;
let blob = match object.as_blob() {
Some(blob) => blob,
None => anyhow::bail!("path `{}` is not a blob in the git repo", path.display()),
};
data(blob.content())
}
fn config(&mut self) -> CargoResult<Option<RegistryConfig>> {
debug!(" | th::new(""), Path::new("config.json"), &mut |json| {
config = Some(serde_json::from_slice(json)?);
Ok(())
})?;
trace!("config loaded");
Ok(config)
}
fn update_index(&mut self) -> CargoResult<()> {
if self.config.offline() {
return Ok(());
}
if self.config.cli_unstable().no_index_update {
return Ok(());
}
if self.config.updated_sources().contains(&self.source_id) {
return Ok(());
}
debug!("updating the index");
self.config.http()?;
self.prepare()?;
self.head.set(None);
*self.tree.borrow_mut() = None;
self.current_sha.set(None);
let path = self.config.assert_package_cache_locked(&self.index_path);
self.config
.shell()
.status("Updating", self.source_id.display_index())?;
let url = self.source_id.url();
let repo = self.repo.borrow_mut().unwrap();
git::fetch(repo, url.as_str(), &self.index_git_ref, self.config)
.with_context(|| format!("failed to fetch `{}`", url))?;
self.config.updated_sources().insert(self.source_id);
paths::create(&path.join(LAST_UPDATED_FILE))?;
Ok(())
}
fn download(&mut self, pkg: PackageId, _checksum: &str) -> CargoResult<MaybeLock> {
let filename = self.filename(pkg);
let path = self.cache_path.join(&filename);
let path = self.config.assert_package_cache_locked(&path);
if let Ok(dst) = File::open(&path) {
let meta = dst.metadata()?;
if meta.len() > 0 {
return Ok(MaybeLock::Ready(dst));
}
}
let config = self.config()?.unwrap();
let mut url = config.dl;
if !url.contains(CRATE_TEMPLATE)
&& !url.contains(VERSION_TEMPLATE)
&& !url.contains(PREFIX_TEMPLATE)
&& !url.contains(LOWER_PREFIX_TEMPLATE)
{
write!(url, "/{}/{}/download", CRATE_TEMPLATE, VERSION_TEMPLATE).unwrap();
}
let prefix = make_dep_prefix(&*pkg.name());
let url = url
.replace(CRATE_TEMPLATE, &*pkg.name())
.replace(VERSION_TEMPLATE, &pkg.version().to_string())
.replace(PREFIX_TEMPLATE, &prefix)
.replace(LOWER_PREFIX_TEMPLATE, &prefix.to_lowercase());
Ok(MaybeLock::Download {
url,
descriptor: pkg.to_string(),
})
}
fn finish_download(
&mut self,
pkg: PackageId,
checksum: &str,
data: &[u8],
) -> CargoResult<File> {
let actual = Sha256::new().update(data).finish_hex();
if actual != checksum {
anyhow::bail!("failed to verify the checksum of `{}`", pkg)
}
let filename = self.filename(pkg);
self.cache_path.create_dir()?;
let path = self.cache_path.join(&filename);
let path = self.config.assert_package_cache_locked(&path);
let mut dst = OpenOptions::new()
.create(true)
.read(true)
.write(true)
.open(&path)
.with_context(|| format!("failed to open `{}`", path.display()))?;
let meta = dst.metadata()?;
if meta.len() > 0 {
return Ok(dst);
}
dst.write_all(data)?;
dst.seek(SeekFrom::Start(0))?;
Ok(dst)
}
fn is_crate_downloaded(&self, pkg: PackageId) -> bool {
let filename = format!("{}-{}.crate", pkg.name(), pkg.version());
let path = Path::new(&filename);
let path = self.cache_path.join(path);
let path = self.config.assert_package_cache_locked(&path);
if let Ok(meta) = fs::metadata(path) {
return meta.len() > 0;
}
false
}
}
impl<'cfg> Drop for RemoteRegistry<'cfg> {
fn drop(&mut self) {
self.tree.borrow_mut().take();
}
}
#[cfg(test)]
mod tests {
use super::make_dep_prefix;
#[test]
fn dep_prefix() {
assert_eq!(make_dep_prefix("a"), "1");
assert_eq!(make_dep_prefix("ab"), "2");
assert_eq!(make_dep_prefix("abc"), "3/a");
assert_eq!(make_dep_prefix("Abc"), "3/A");
assert_eq!(make_dep_prefix("AbCd"), "Ab/Cd");
assert_eq!(make_dep_prefix("aBcDe"), "aB/cD");
}
}
| loading config");
self.prepare()?;
self.config.assert_package_cache_locked(&self.index_path);
let mut config = None;
self.load(Pa | function_block-random_span | [
{
"content": "/// Commit changes to the git repository.\n\npub fn commit(repo: &git2::Repository) -> git2::Oid {\n\n let tree_id = t!(t!(repo.index()).write_tree());\n\n let sig = t!(repo.signature());\n\n let mut parents = Vec::new();\n\n if let Some(parent) = repo.head().ok().map(|h| h.target().un... |
Rust | game/src/sandbox/mod.rs | jvolker/abstreet | 7d4cf4cd5b27bce37cf35d3d8aecf0e3d5148a2f | mod dashboards;
pub mod gameplay;
mod misc_tools;
mod speed;
mod uber_turns;
use self::misc_tools::{RoutePreview, ShowTrafficSignal, TurnExplorer};
use crate::app::App;
use crate::common::{tool_panel, CommonState, ContextualActions, Minimap};
use crate::debug::DebugMode;
use crate::edit::{
apply_map_edits, can_edit_lane, save_edits_as, EditMode, LaneEditor, StopSignEditor,
TrafficSignalEditor,
};
use crate::game::{State, Transition, WizardState};
use crate::helpers::ID;
use crate::layer::PickLayer;
use crate::managed::{WrappedComposite, WrappedOutcome};
use crate::pregame::MainMenu;
use crate::render::AgentColorScheme;
use ezgui::{
hotkey, lctrl, Btn, Choice, Color, Composite, EventCtx, GeomBatch, GfxCtx, HorizontalAlignment,
Key, Line, Outcome, Text, TextExt, UpdateType, VerticalAlignment, Widget, Wizard,
};
pub use gameplay::{spawn_agents_around, GameplayMode, TutorialPointer, TutorialState};
use geom::{Polygon, Time};
use map_model::MapEdits;
use sim::{TripMode, VehicleType};
pub use speed::TimeWarpScreen;
pub use speed::{SpeedControls, TimePanel};
pub struct SandboxMode {
gameplay: Box<dyn gameplay::GameplayState>,
pub gameplay_mode: GameplayMode,
pub controls: SandboxControls,
}
pub struct SandboxControls {
pub common: Option<CommonState>,
route_preview: Option<RoutePreview>,
tool_panel: Option<WrappedComposite>,
time_panel: Option<TimePanel>,
speed: Option<SpeedControls>,
pub agent_meter: Option<AgentMeter>,
minimap: Option<Minimap>,
}
impl SandboxMode {
pub fn new(ctx: &mut EventCtx, app: &mut App, mode: GameplayMode) -> SandboxMode {
app.primary.clear_sim();
let gameplay = mode.initialize(ctx, app);
SandboxMode {
controls: SandboxControls {
common: if gameplay.has_common() {
Some(CommonState::new())
} else {
None
},
route_preview: if gameplay.can_examine_objects() {
Some(RoutePreview::new())
} else {
None
},
tool_panel: if gameplay.has_tool_panel() {
Some(tool_panel(ctx, app))
} else {
None
},
time_panel: if gameplay.has_time_panel() {
Some(TimePanel::new(ctx, app))
} else {
None
},
speed: if gameplay.has_speed() {
Some(SpeedControls::new(ctx, app))
} else {
None
},
agent_meter: if gameplay.has_agent_meter() {
Some(AgentMeter::new(ctx, app))
} else {
None
},
minimap: if gameplay.has_minimap() {
Some(Minimap::new(ctx, app))
} else {
None
},
},
gameplay,
gameplay_mode: mode,
}
}
pub fn contextual_actions(&self) -> Actions {
Actions {
is_paused: self
.controls
.speed
.as_ref()
.map(|s| s.is_paused())
.unwrap_or(true),
can_interact: self.gameplay.can_examine_objects(),
gameplay: self.gameplay_mode.clone(),
}
}
}
impl State for SandboxMode {
fn event(&mut self, ctx: &mut EventCtx, app: &mut App) -> Transition {
if self.gameplay.can_move_canvas() {
ctx.canvas_movement();
}
if let Some(t) = self.gameplay.event(ctx, app, &mut self.controls) {
return t;
}
if ctx.redo_mouseover() {
app.recalculate_current_selection(ctx);
}
if app.opts.dev && ctx.input.new_was_pressed(&lctrl(Key::D).unwrap()) {
return Transition::Push(Box::new(DebugMode::new(ctx, app)));
}
if let Some(ref mut m) = self.controls.minimap {
if let Some(t) = m.event(ctx, app) {
return t;
}
if let Some(t) = PickLayer::update(ctx, app, &m.composite) {
return t;
}
}
if let Some(ref mut s) = self.controls.speed {
if let Some(t) = s.event(ctx, app, Some(&self.gameplay_mode)) {
return t;
}
}
if let Some(ref mut r) = self.controls.route_preview {
if let Some(t) = r.event(ctx, app) {
return t;
}
}
let mut actions = self.contextual_actions();
if let Some(ref mut c) = self.controls.common {
if let Some(t) = c.event(ctx, app, &mut actions) {
return t;
}
}
if let Some(ref mut tp) = self.controls.time_panel {
tp.event(ctx, app);
}
if let Some(ref mut tp) = self.controls.tool_panel {
match tp.event(ctx, app) {
Some(WrappedOutcome::Transition(t)) => {
return t;
}
Some(WrappedOutcome::Clicked(x)) => match x.as_ref() {
"back" => {
return maybe_exit_sandbox();
}
_ => unreachable!(),
},
None => {}
}
}
if let Some(ref mut am) = self.controls.agent_meter {
if let Some(t) = am.event(ctx, app) {
return t;
}
}
if self
.controls
.speed
.as_ref()
.map(|s| s.is_paused())
.unwrap_or(true)
{
Transition::Keep
} else {
ctx.request_update(UpdateType::Game);
Transition::Keep
}
}
fn draw(&self, g: &mut GfxCtx, app: &App) {
if let Some(ref l) = app.layer {
l.draw(g, app);
}
if let Some(ref c) = self.controls.common {
c.draw(g, app);
} else {
CommonState::draw_osd(g, app);
}
if let Some(ref tp) = self.controls.tool_panel {
tp.draw(g);
}
if let Some(ref s) = self.controls.speed {
s.draw(g);
}
if let Some(ref tp) = self.controls.time_panel {
tp.draw(g);
}
if let Some(ref am) = self.controls.agent_meter {
am.draw(g);
}
if let Some(ref m) = self.controls.minimap {
m.draw(g, app);
}
if let Some(ref r) = self.controls.route_preview {
r.draw(g);
}
self.gameplay.draw(g, app);
}
fn on_destroy(&mut self, _: &mut EventCtx, app: &mut App) {
app.layer = None;
app.agent_cs = AgentColorScheme::new(&app.cs);
self.gameplay.on_destroy(app);
}
}
pub fn maybe_exit_sandbox() -> Transition {
Transition::Push(WizardState::new(Box::new(exit_sandbox)))
}
fn exit_sandbox(wiz: &mut Wizard, ctx: &mut EventCtx, app: &mut App) -> Option<Transition> {
let mut wizard = wiz.wrap(ctx);
let unsaved = app.primary.map.unsaved_edits();
let (resp, _) = wizard.choose("Are you ready to leave this mode?", || {
let mut choices = Vec::new();
choices.push(Choice::new("keep playing", ()));
if unsaved {
choices.push(Choice::new("save edits first", ()));
}
choices.push(Choice::new("quit to main screen", ()).key(Key::Q));
choices
})?;
if resp == "keep playing" {
return Some(Transition::Pop);
}
if resp == "save edits first" {
save_edits_as(&mut wizard, app)?;
}
ctx.loading_screen("reset map and sim", |ctx, mut timer| {
if !app.primary.map.get_edits().commands.is_empty() {
apply_map_edits(ctx, app, MapEdits::new());
app.primary
.map
.recalculate_pathfinding_after_edits(&mut timer);
}
app.primary.clear_sim();
app.set_prebaked(None);
});
ctx.canvas.save_camera_state(app.primary.map.get_name());
Some(Transition::Clear(vec![MainMenu::new(ctx, app)]))
}
pub struct AgentMeter {
time: Time,
pub composite: Composite,
}
impl AgentMeter {
pub fn new(ctx: &mut EventCtx, app: &App) -> AgentMeter {
use abstutil::prettyprint_usize;
let (finished, unfinished, by_mode) = app.primary.sim.num_trips();
let rows = vec![
"Active trips".draw_text(ctx),
Widget::custom_row(vec![
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/pedestrian.svg")
.margin_right(5),
prettyprint_usize(by_mode[&TripMode::Walk]).draw_text(ctx),
]),
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/bike.svg").margin_right(5),
prettyprint_usize(by_mode[&TripMode::Bike]).draw_text(ctx),
]),
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/car.svg").margin_right(5),
prettyprint_usize(by_mode[&TripMode::Drive]).draw_text(ctx),
]),
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/bus.svg").margin_right(5),
prettyprint_usize(by_mode[&TripMode::Transit]).draw_text(ctx),
]),
])
.centered(),
Widget::draw_batch(
ctx,
GeomBatch::from(vec![(
Color::WHITE,
Polygon::rectangle(0.2 * ctx.canvas.window_width / ctx.get_scale_factor(), 2.0),
)]),
)
.centered_horiz(),
Widget::row(vec![
{
let mut txt = Text::new();
let pct = if unfinished == 0 {
100.0
} else {
100.0 * (finished as f64) / ((finished + unfinished) as f64)
};
txt.add(Line(format!(
"Finished trips: {} ({}%)",
prettyprint_usize(finished),
pct as usize
)));
txt.draw(ctx)
},
Btn::svg_def("../data/system/assets/meters/trip_histogram.svg")
.build(ctx, "more data", hotkey(Key::Q))
.align_right(),
]),
];
let composite = Composite::new(Widget::col(rows).bg(app.cs.panel_bg).padding(16))
.aligned(HorizontalAlignment::Right, VerticalAlignment::Top)
.build(ctx);
AgentMeter {
time: app.primary.sim.time(),
composite,
}
}
pub fn event(&mut self, ctx: &mut EventCtx, app: &mut App) -> Option<Transition> {
if self.time != app.primary.sim.time() {
*self = AgentMeter::new(ctx, app);
return self.event(ctx, app);
}
match self.composite.event(ctx) {
Some(Outcome::Clicked(x)) => match x.as_ref() {
"more data" => {
return Some(Transition::Push(dashboards::TripTable::new(ctx, app)));
}
_ => unreachable!(),
},
None => {}
}
None
}
pub fn draw(&self, g: &mut GfxCtx) {
self.composite.draw(g);
}
}
pub struct Actions {
is_paused: bool,
can_interact: bool,
gameplay: GameplayMode,
}
impl ContextualActions for Actions {
fn actions(&self, app: &App, id: ID) -> Vec<(Key, String)> {
let mut actions = Vec::new();
if self.can_interact {
match id.clone() {
ID::Intersection(i) => {
if app.primary.map.get_i(i).is_traffic_signal() {
actions.push((Key::F, "explore traffic signal details".to_string()));
actions.push((Key::E, "edit traffic signal".to_string()));
}
if app.primary.map.get_i(i).is_stop_sign()
&& self.gameplay.can_edit_stop_signs()
{
actions.push((Key::E, "edit stop sign".to_string()));
}
if app.opts.dev {
actions.push((Key::U, "explore uber-turns".to_string()));
}
}
ID::Lane(l) => {
if !app.primary.map.get_turns_from_lane(l).is_empty() {
actions.push((Key::Z, "explore turns from this lane".to_string()));
}
if can_edit_lane(&self.gameplay, l, app) {
actions.push((Key::E, "edit lane".to_string()));
}
}
ID::Car(c) => {
if c.1 == VehicleType::Bus {
actions.push((Key::R, "show route".to_string()));
}
}
_ => {}
}
}
actions.extend(self.gameplay.actions(app, id));
actions
}
fn execute(
&mut self,
ctx: &mut EventCtx,
app: &mut App,
id: ID,
action: String,
close_panel: &mut bool,
) -> Transition {
match (id, action.as_ref()) {
(ID::Intersection(i), "explore traffic signal details") => {
Transition::Push(ShowTrafficSignal::new(ctx, app, i))
}
(ID::Intersection(i), "edit traffic signal") => Transition::PushTwice(
Box::new(EditMode::new(ctx, app, self.gameplay.clone())),
Box::new(TrafficSignalEditor::new(ctx, app, i, self.gameplay.clone())),
),
(ID::Intersection(i), "edit stop sign") => Transition::PushTwice(
Box::new(EditMode::new(ctx, app, self.gameplay.clone())),
Box::new(StopSignEditor::new(ctx, app, i, self.gameplay.clone())),
),
(ID::Intersection(i), "explore uber-turns") => {
Transition::Push(uber_turns::UberTurnPicker::new(ctx, app, i))
}
(ID::Lane(l), "explore turns from this lane") => {
Transition::Push(TurnExplorer::new(ctx, app, l))
}
(ID::Lane(l), "edit lane") => Transition::PushTwice(
Box::new(EditMode::new(ctx, app, self.gameplay.clone())),
Box::new(LaneEditor::new(ctx, app, l, self.gameplay.clone())),
),
(ID::Car(c), "show route") => {
*close_panel = false;
app.layer = Some(Box::new(crate::layer::bus::ShowBusRoute::new(
ctx,
app,
app.primary.sim.bus_route_id(c).unwrap(),
)));
Transition::Keep
}
(_, "follow (run the simulation)") => {
*close_panel = false;
Transition::KeepWithData(Box::new(|state, ctx, app| {
let mode = state.downcast_mut::<SandboxMode>().unwrap();
let speed = mode.controls.speed.as_mut().unwrap();
assert!(speed.is_paused());
speed.resume_realtime(ctx, app);
}))
}
(_, "unfollow (pause the simulation)") => {
*close_panel = false;
Transition::KeepWithData(Box::new(|state, ctx, app| {
let mode = state.downcast_mut::<SandboxMode>().unwrap();
let speed = mode.controls.speed.as_mut().unwrap();
assert!(!speed.is_paused());
speed.pause(ctx, app);
}))
}
(id, action) => self
.gameplay
.execute(ctx, app, id, action.to_string(), close_panel),
}
}
fn is_paused(&self) -> bool {
self.is_paused
}
}
| mod dashboards;
pub mod gameplay;
mod misc_tools;
mod speed;
mod uber_turns;
use self::misc_tools::{RoutePreview, ShowTrafficSignal, TurnExplorer};
use crate::app::App;
use crate::common::{tool_panel, CommonState, ContextualActions, Minimap};
use crate::debug::DebugMode;
use crate::edit::{
apply_map_edits, can_edit_lane, save_edits_as, EditMode, LaneEditor, StopSignEditor,
TrafficSignalEditor,
};
use crate::game::{State, Transition, WizardState};
use crate::helpers::ID;
use crate::layer::PickLayer;
use crate::managed::{WrappedComposite, WrappedOutcome};
use crate::pregame::MainMenu;
use crate::render::AgentColorScheme;
use ezgui::{
hotkey, lctrl, Btn, Choice, Color, Composite, EventCtx, GeomBatch, GfxCtx, HorizontalAlignment,
Key, Line, Outcome, Text, TextExt, UpdateType, VerticalAlignment, Widget, Wizard,
};
pub use gameplay::{spawn_agents_around, GameplayMode, TutorialPointer, TutorialState};
use geom::{Polygon, Time};
use map_model::MapEdits;
use sim::{TripMode, VehicleType};
pub use speed::TimeWarpScreen;
pub use speed::{SpeedControls, TimePanel};
pub struct SandboxMode {
gameplay: Box<dyn gameplay::GameplayState>,
pub gameplay_mode: GameplayMode,
pub controls: SandboxControls,
}
pub struct SandboxControls {
pub common: Option<CommonState>,
route_preview: Option<RoutePreview>,
tool_panel: Option<WrappedComposite>,
time_panel: Option<TimePanel>,
speed: Option<SpeedControls>,
pub agent_meter: Option<AgentMeter>,
minimap: Option<Minimap>,
}
impl SandboxMode {
pub fn new(ctx: &mut EventCtx, app: &mut App, mode: GameplayMode) -> SandboxMode {
app.primary.clear_sim();
let gameplay = mode.initialize(ctx, app);
SandboxMode {
controls: SandboxControls {
common: if gameplay.has_common() {
Some(CommonState::new())
} else {
None
},
route_preview: if gameplay.can_examine_objects() {
Some(RoutePreview::new())
} else {
None
},
tool_panel: if gameplay.has_tool_panel() {
Some(tool_panel(ctx, app))
} else {
None
},
time_panel: if gameplay.has_time_panel() {
Some(TimePanel::new(ctx, app))
} else {
None
},
speed: if gameplay.has_speed() {
Some(SpeedControls::new(ctx, app))
} else {
None
},
agent_meter: if gameplay.has_agent_meter() {
Some(AgentMeter::new(ctx, app))
} else {
None
},
minimap: if gameplay.has_minimap() {
Some(Minimap::new(ctx, app))
} else {
None
},
},
gameplay,
gameplay_mode: mode,
}
}
pub fn contextual_actions(&self) -> Actions {
Actions {
is_paused: self
.controls
.speed
.as_ref()
.map(|s| s.is_paused())
. |
}
impl State for SandboxMode {
fn event(&mut self, ctx: &mut EventCtx, app: &mut App) -> Transition {
if self.gameplay.can_move_canvas() {
ctx.canvas_movement();
}
if let Some(t) = self.gameplay.event(ctx, app, &mut self.controls) {
return t;
}
if ctx.redo_mouseover() {
app.recalculate_current_selection(ctx);
}
if app.opts.dev && ctx.input.new_was_pressed(&lctrl(Key::D).unwrap()) {
return Transition::Push(Box::new(DebugMode::new(ctx, app)));
}
if let Some(ref mut m) = self.controls.minimap {
if let Some(t) = m.event(ctx, app) {
return t;
}
if let Some(t) = PickLayer::update(ctx, app, &m.composite) {
return t;
}
}
if let Some(ref mut s) = self.controls.speed {
if let Some(t) = s.event(ctx, app, Some(&self.gameplay_mode)) {
return t;
}
}
if let Some(ref mut r) = self.controls.route_preview {
if let Some(t) = r.event(ctx, app) {
return t;
}
}
let mut actions = self.contextual_actions();
if let Some(ref mut c) = self.controls.common {
if let Some(t) = c.event(ctx, app, &mut actions) {
return t;
}
}
if let Some(ref mut tp) = self.controls.time_panel {
tp.event(ctx, app);
}
if let Some(ref mut tp) = self.controls.tool_panel {
match tp.event(ctx, app) {
Some(WrappedOutcome::Transition(t)) => {
return t;
}
Some(WrappedOutcome::Clicked(x)) => match x.as_ref() {
"back" => {
return maybe_exit_sandbox();
}
_ => unreachable!(),
},
None => {}
}
}
if let Some(ref mut am) = self.controls.agent_meter {
if let Some(t) = am.event(ctx, app) {
return t;
}
}
if self
.controls
.speed
.as_ref()
.map(|s| s.is_paused())
.unwrap_or(true)
{
Transition::Keep
} else {
ctx.request_update(UpdateType::Game);
Transition::Keep
}
}
fn draw(&self, g: &mut GfxCtx, app: &App) {
if let Some(ref l) = app.layer {
l.draw(g, app);
}
if let Some(ref c) = self.controls.common {
c.draw(g, app);
} else {
CommonState::draw_osd(g, app);
}
if let Some(ref tp) = self.controls.tool_panel {
tp.draw(g);
}
if let Some(ref s) = self.controls.speed {
s.draw(g);
}
if let Some(ref tp) = self.controls.time_panel {
tp.draw(g);
}
if let Some(ref am) = self.controls.agent_meter {
am.draw(g);
}
if let Some(ref m) = self.controls.minimap {
m.draw(g, app);
}
if let Some(ref r) = self.controls.route_preview {
r.draw(g);
}
self.gameplay.draw(g, app);
}
fn on_destroy(&mut self, _: &mut EventCtx, app: &mut App) {
app.layer = None;
app.agent_cs = AgentColorScheme::new(&app.cs);
self.gameplay.on_destroy(app);
}
}
pub fn maybe_exit_sandbox() -> Transition {
Transition::Push(WizardState::new(Box::new(exit_sandbox)))
}
fn exit_sandbox(wiz: &mut Wizard, ctx: &mut EventCtx, app: &mut App) -> Option<Transition> {
let mut wizard = wiz.wrap(ctx);
let unsaved = app.primary.map.unsaved_edits();
let (resp, _) = wizard.choose("Are you ready to leave this mode?", || {
let mut choices = Vec::new();
choices.push(Choice::new("keep playing", ()));
if unsaved {
choices.push(Choice::new("save edits first", ()));
}
choices.push(Choice::new("quit to main screen", ()).key(Key::Q));
choices
})?;
if resp == "keep playing" {
return Some(Transition::Pop);
}
if resp == "save edits first" {
save_edits_as(&mut wizard, app)?;
}
ctx.loading_screen("reset map and sim", |ctx, mut timer| {
if !app.primary.map.get_edits().commands.is_empty() {
apply_map_edits(ctx, app, MapEdits::new());
app.primary
.map
.recalculate_pathfinding_after_edits(&mut timer);
}
app.primary.clear_sim();
app.set_prebaked(None);
});
ctx.canvas.save_camera_state(app.primary.map.get_name());
Some(Transition::Clear(vec![MainMenu::new(ctx, app)]))
}
pub struct AgentMeter {
time: Time,
pub composite: Composite,
}
impl AgentMeter {
pub fn new(ctx: &mut EventCtx, app: &App) -> AgentMeter {
use abstutil::prettyprint_usize;
let (finished, unfinished, by_mode) = app.primary.sim.num_trips();
let rows = vec![
"Active trips".draw_text(ctx),
Widget::custom_row(vec![
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/pedestrian.svg")
.margin_right(5),
prettyprint_usize(by_mode[&TripMode::Walk]).draw_text(ctx),
]),
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/bike.svg").margin_right(5),
prettyprint_usize(by_mode[&TripMode::Bike]).draw_text(ctx),
]),
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/car.svg").margin_right(5),
prettyprint_usize(by_mode[&TripMode::Drive]).draw_text(ctx),
]),
Widget::custom_row(vec![
Widget::draw_svg(ctx, "../data/system/assets/meters/bus.svg").margin_right(5),
prettyprint_usize(by_mode[&TripMode::Transit]).draw_text(ctx),
]),
])
.centered(),
Widget::draw_batch(
ctx,
GeomBatch::from(vec![(
Color::WHITE,
Polygon::rectangle(0.2 * ctx.canvas.window_width / ctx.get_scale_factor(), 2.0),
)]),
)
.centered_horiz(),
Widget::row(vec![
{
let mut txt = Text::new();
let pct = if unfinished == 0 {
100.0
} else {
100.0 * (finished as f64) / ((finished + unfinished) as f64)
};
txt.add(Line(format!(
"Finished trips: {} ({}%)",
prettyprint_usize(finished),
pct as usize
)));
txt.draw(ctx)
},
Btn::svg_def("../data/system/assets/meters/trip_histogram.svg")
.build(ctx, "more data", hotkey(Key::Q))
.align_right(),
]),
];
let composite = Composite::new(Widget::col(rows).bg(app.cs.panel_bg).padding(16))
.aligned(HorizontalAlignment::Right, VerticalAlignment::Top)
.build(ctx);
AgentMeter {
time: app.primary.sim.time(),
composite,
}
}
pub fn event(&mut self, ctx: &mut EventCtx, app: &mut App) -> Option<Transition> {
if self.time != app.primary.sim.time() {
*self = AgentMeter::new(ctx, app);
return self.event(ctx, app);
}
match self.composite.event(ctx) {
Some(Outcome::Clicked(x)) => match x.as_ref() {
"more data" => {
return Some(Transition::Push(dashboards::TripTable::new(ctx, app)));
}
_ => unreachable!(),
},
None => {}
}
None
}
pub fn draw(&self, g: &mut GfxCtx) {
self.composite.draw(g);
}
}
pub struct Actions {
is_paused: bool,
can_interact: bool,
gameplay: GameplayMode,
}
impl ContextualActions for Actions {
fn actions(&self, app: &App, id: ID) -> Vec<(Key, String)> {
let mut actions = Vec::new();
if self.can_interact {
match id.clone() {
ID::Intersection(i) => {
if app.primary.map.get_i(i).is_traffic_signal() {
actions.push((Key::F, "explore traffic signal details".to_string()));
actions.push((Key::E, "edit traffic signal".to_string()));
}
if app.primary.map.get_i(i).is_stop_sign()
&& self.gameplay.can_edit_stop_signs()
{
actions.push((Key::E, "edit stop sign".to_string()));
}
if app.opts.dev {
actions.push((Key::U, "explore uber-turns".to_string()));
}
}
ID::Lane(l) => {
if !app.primary.map.get_turns_from_lane(l).is_empty() {
actions.push((Key::Z, "explore turns from this lane".to_string()));
}
if can_edit_lane(&self.gameplay, l, app) {
actions.push((Key::E, "edit lane".to_string()));
}
}
ID::Car(c) => {
if c.1 == VehicleType::Bus {
actions.push((Key::R, "show route".to_string()));
}
}
_ => {}
}
}
actions.extend(self.gameplay.actions(app, id));
actions
}
fn execute(
&mut self,
ctx: &mut EventCtx,
app: &mut App,
id: ID,
action: String,
close_panel: &mut bool,
) -> Transition {
match (id, action.as_ref()) {
(ID::Intersection(i), "explore traffic signal details") => {
Transition::Push(ShowTrafficSignal::new(ctx, app, i))
}
(ID::Intersection(i), "edit traffic signal") => Transition::PushTwice(
Box::new(EditMode::new(ctx, app, self.gameplay.clone())),
Box::new(TrafficSignalEditor::new(ctx, app, i, self.gameplay.clone())),
),
(ID::Intersection(i), "edit stop sign") => Transition::PushTwice(
Box::new(EditMode::new(ctx, app, self.gameplay.clone())),
Box::new(StopSignEditor::new(ctx, app, i, self.gameplay.clone())),
),
(ID::Intersection(i), "explore uber-turns") => {
Transition::Push(uber_turns::UberTurnPicker::new(ctx, app, i))
}
(ID::Lane(l), "explore turns from this lane") => {
Transition::Push(TurnExplorer::new(ctx, app, l))
}
(ID::Lane(l), "edit lane") => Transition::PushTwice(
Box::new(EditMode::new(ctx, app, self.gameplay.clone())),
Box::new(LaneEditor::new(ctx, app, l, self.gameplay.clone())),
),
(ID::Car(c), "show route") => {
*close_panel = false;
app.layer = Some(Box::new(crate::layer::bus::ShowBusRoute::new(
ctx,
app,
app.primary.sim.bus_route_id(c).unwrap(),
)));
Transition::Keep
}
(_, "follow (run the simulation)") => {
*close_panel = false;
Transition::KeepWithData(Box::new(|state, ctx, app| {
let mode = state.downcast_mut::<SandboxMode>().unwrap();
let speed = mode.controls.speed.as_mut().unwrap();
assert!(speed.is_paused());
speed.resume_realtime(ctx, app);
}))
}
(_, "unfollow (pause the simulation)") => {
*close_panel = false;
Transition::KeepWithData(Box::new(|state, ctx, app| {
let mode = state.downcast_mut::<SandboxMode>().unwrap();
let speed = mode.controls.speed.as_mut().unwrap();
assert!(!speed.is_paused());
speed.pause(ctx, app);
}))
}
(id, action) => self
.gameplay
.execute(ctx, app, id, action.to_string(), close_panel),
}
}
fn is_paused(&self) -> bool {
self.is_paused
}
}
| unwrap_or(true),
can_interact: self.gameplay.can_examine_objects(),
gameplay: self.gameplay_mode.clone(),
}
} | function_block-function_prefix_line | [
{
"content": "// TODO Well, there goes the nice consolidation of stuff in BtnBuilder. :\\\n\npub fn hotkey_btn<I: Into<String>>(ctx: &EventCtx, app: &App, label: I, key: Key) -> Widget {\n\n let label = label.into();\n\n let mut txt = Text::new();\n\n txt.append(Line(key.describe()).fg(ctx.style().hotk... |
Rust | src/sim2/training.rs | ryotaok/genshin | 4f3778b787e59220853ae8cce4f7e7b94d34ac54 | use crate::sim2::state::State;
use crate::sim2::timeline::{Timeline};
use crate::sim2::attack::{WeaponAttack};
use crate::sim2::types::{WeaponType, SCORE};
use crate::sim2::record::{WeaponRecord, Artifact};
use WeaponType::*;
pub enum TrainingWeaponUnion {
TrainingSword(TrainingSword),
TrainingClaymore(TrainingClaymore),
TrainingPolearm(TrainingPolearm),
TrainingBow(TrainingBow),
TrainingCatalyst(TrainingCatalyst),
}
impl TrainingWeaponUnion {
pub fn timeline(&mut self) -> &mut dyn Timeline {
use TrainingWeaponUnion::*;
match self {
TrainingSword(x) => x,
TrainingClaymore(x) => x,
TrainingPolearm(x) => x,
TrainingBow(x) => x,
TrainingCatalyst(x) => x,
}
}
pub fn field(&mut self) -> &mut dyn WeaponAttack {
use TrainingWeaponUnion::*;
match self {
TrainingSword(x) => x,
TrainingClaymore(x) => x,
TrainingPolearm(x) => x,
TrainingBow(x) => x,
TrainingCatalyst(x) => x,
}
}
}
pub fn weapons() -> Vec<(WeaponRecord, TrainingWeaponUnion)> {
vec![
(TrainingSword::record(), TrainingWeaponUnion::TrainingSword(TrainingSword)),
(TrainingClaymore::record(), TrainingWeaponUnion::TrainingClaymore(TrainingClaymore)),
(TrainingPolearm::record(), TrainingWeaponUnion::TrainingPolearm(TrainingPolearm)),
(TrainingBow::record(), TrainingWeaponUnion::TrainingBow(TrainingBow)),
(TrainingCatalyst::record(), TrainingWeaponUnion::TrainingCatalyst(TrainingCatalyst)),
]
}
#[derive(Debug)]
pub struct TrainingSword;
impl Timeline for TrainingSword {}
impl WeaponAttack for TrainingSword {}
impl TrainingSword {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Sword").type_(Sword).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingClaymore;
impl Timeline for TrainingClaymore {}
impl WeaponAttack for TrainingClaymore {}
impl TrainingClaymore {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Claymore").type_(Claymore).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingPolearm;
impl Timeline for TrainingPolearm {}
impl WeaponAttack for TrainingPolearm {}
impl TrainingPolearm {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Polearm").type_(Polearm).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingBow;
impl Timeline for TrainingBow {}
impl WeaponAttack for TrainingBow {}
impl TrainingBow {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Bow").type_(Bow).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingCatalyst;
impl Timeline for TrainingCatalyst {}
impl WeaponAttack for TrainingCatalyst {}
impl TrainingCatalyst {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Catalyst").type_(Catalyst).version(1.0)
.base_atk(608.)
}
}
pub enum TrainingArtifactUnion {
TrainingArtifact0(TrainingArtifact0),
TrainingArtifact1(TrainingArtifact1),
TrainingArtifact2(TrainingArtifact2),
TrainingArtifact3(TrainingArtifact3),
TrainingArtifact4(TrainingArtifact4),
TrainingArtifact5(TrainingArtifact5),
TrainingArtifact6(TrainingArtifact6),
TrainingArtifact7(TrainingArtifact7),
TrainingArtifact8(TrainingArtifact8),
TrainingArtifact9(TrainingArtifact9),
}
impl TrainingArtifactUnion {
pub fn timeline(&mut self) -> &mut dyn Timeline {
use TrainingArtifactUnion::*;
match self {
TrainingArtifact0(x) => x,
TrainingArtifact1(x) => x,
TrainingArtifact2(x) => x,
TrainingArtifact3(x) => x,
TrainingArtifact4(x) => x,
TrainingArtifact5(x) => x,
TrainingArtifact6(x) => x,
TrainingArtifact7(x) => x,
TrainingArtifact8(x) => x,
TrainingArtifact9(x) => x,
}
}
pub fn field(&mut self) -> &mut dyn WeaponAttack {
use TrainingArtifactUnion::*;
match self {
TrainingArtifact0(x) => x,
TrainingArtifact1(x) => x,
TrainingArtifact2(x) => x,
TrainingArtifact3(x) => x,
TrainingArtifact4(x) => x,
TrainingArtifact5(x) => x,
TrainingArtifact6(x) => x,
TrainingArtifact7(x) => x,
TrainingArtifact8(x) => x,
TrainingArtifact9(x) => x,
}
}
}
pub fn artifacts() -> Vec<(Artifact, TrainingArtifactUnion)> {
vec![
(TrainingArtifact0::record(), TrainingArtifactUnion::TrainingArtifact0(TrainingArtifact0)),
(TrainingArtifact1::record(), TrainingArtifactUnion::TrainingArtifact1(TrainingArtifact1)),
(TrainingArtifact2::record(), TrainingArtifactUnion::TrainingArtifact2(TrainingArtifact2)),
(TrainingArtifact3::record(), TrainingArtifactUnion::TrainingArtifact3(TrainingArtifact3)),
(TrainingArtifact4::record(), TrainingArtifactUnion::TrainingArtifact4(TrainingArtifact4)),
(TrainingArtifact5::record(), TrainingArtifactUnion::TrainingArtifact5(TrainingArtifact5)),
(TrainingArtifact6::record(), TrainingArtifactUnion::TrainingArtifact6(TrainingArtifact6)),
(TrainingArtifact7::record(), TrainingArtifactUnion::TrainingArtifact7(TrainingArtifact7)),
(TrainingArtifact8::record(), TrainingArtifactUnion::TrainingArtifact8(TrainingArtifact8)),
(TrainingArtifact9::record(), TrainingArtifactUnion::TrainingArtifact9(TrainingArtifact9)),
]
}
#[derive(Debug)]
pub struct TrainingArtifact0;
impl Timeline for TrainingArtifact0 {}
impl WeaponAttack for TrainingArtifact0 {}
impl TrainingArtifact0 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk70 Em280 Er78").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(33.3333))
.em(SCORE.em(33.3333))
.er(SCORE.er(33.3333))
}
}
#[derive(Debug)]
pub struct TrainingArtifact1;
impl Timeline for TrainingArtifact1 {}
impl WeaponAttack for TrainingArtifact1 {}
impl TrainingArtifact1 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk168 Em167").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(80.))
.em(SCORE.em(20.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact2;
impl Timeline for TrainingArtifact2 {}
impl WeaponAttack for TrainingArtifact2 {}
impl TrainingArtifact2 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk168 Er46").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(80.))
.er(SCORE.er(20.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact3;
impl Timeline for TrainingArtifact3 {}
impl WeaponAttack for TrainingArtifact3 {}
impl TrainingArtifact3 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk41 Em671").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(20.))
.em(SCORE.em(80.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact4;
impl Timeline for TrainingArtifact4 {}
impl WeaponAttack for TrainingArtifact4 {}
impl TrainingArtifact4 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em671 Er46").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(80.))
.er(SCORE.er(20.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact5;
impl Timeline for TrainingArtifact5 {}
impl WeaponAttack for TrainingArtifact5 {}
impl TrainingArtifact5 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk42 Er186").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(20.))
.er(SCORE.er(80.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact6;
impl Timeline for TrainingArtifact6 {}
impl WeaponAttack for TrainingArtifact6 {}
impl TrainingArtifact6 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em167 Er186").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(20.))
.er(SCORE.er(80.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact7;
impl Timeline for TrainingArtifact7 {}
impl WeaponAttack for TrainingArtifact7 {}
impl TrainingArtifact7 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk105 Em420").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(50.))
.em(SCORE.em(50.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact8;
impl Timeline for TrainingArtifact8 {}
impl WeaponAttack for TrainingArtifact8 {}
impl TrainingArtifact8 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk105 Er116").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(50.))
.er(SCORE.er(50.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact9;
impl Timeline for TrainingArtifact9 {}
impl WeaponAttack for TrainingArtifact9 {}
impl TrainingArtifact9 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em420 Er116").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(50.))
.er(SCORE.er(50.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact10;
impl Timeline for TrainingArtifact10 {}
impl WeaponAttack for TrainingArtifact10 {}
impl TrainingArtifact10 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk210").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(100.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact11;
impl Timeline for TrainingArtifact11 {}
impl WeaponAttack for TrainingArtifact11 {}
impl TrainingArtifact11 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em839").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(100.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact12;
impl Timeline for TrainingArtifact12 {}
impl WeaponAttack for TrainingArtifact12 {}
impl TrainingArtifact12 {
pub fn record() -> Artifact {
Artifact::default()
.name("Er233").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.er(SCORE.er(100.))
}
}
| use crate::sim2::state::State;
use crate::sim2::timeline::{Timeline};
use crate::sim2::attack::{WeaponAttack};
use crate::sim2::types::{WeaponType, SCORE};
use crate::sim2::record::{WeaponRecord, Artifact};
use WeaponType::*;
pub enum TrainingWeaponUnion {
TrainingSword(TrainingSword),
TrainingClaymore(TrainingClaymore),
TrainingPolearm(TrainingPolearm),
TrainingBow(TrainingBow),
TrainingCatalyst(TrainingCatalyst),
}
impl TrainingWeaponUnion {
pub fn timeline(&mut self) -> &mut dyn Timeline {
use TrainingWeaponUnion::*;
match self {
TrainingSword(x) => x,
TrainingClaymore(x) => x,
TrainingPolearm(x) => x,
TrainingBow(x) => x,
TrainingCatalyst(x) => x,
}
}
pub fn field(&mut self) -> &mut dyn WeaponAttack {
use TrainingWeaponUnion::*;
match self {
TrainingSword(x) => x,
TrainingClaymore(x) => x,
TrainingPolearm(x) => x,
TrainingBow(x) => x,
TrainingCatalyst(x) => x,
}
}
}
pub fn weapons() -> Vec<(WeaponRecord, TrainingWeaponUnion)> {
vec![
(TrainingSword::record(), TrainingWeaponUnion::TrainingSword(TrainingSword)),
(TrainingClaymore::record(), TrainingWeaponUnion::TrainingClaymore(TrainingClaymore)),
(TrainingPolearm::record(), TrainingWeaponUnion::TrainingPolearm(TrainingPolearm)),
(TrainingBow::record(), TrainingWeaponUnion::TrainingBow(TrainingBow)),
(TrainingCatalyst::record(), TrainingWeaponUnion::TrainingCatalyst(TrainingCatalyst)),
]
}
#[derive(Debug)]
pub struct TrainingSword;
impl Timeline for TrainingSword {}
impl WeaponAttack for TrainingSword {}
impl TrainingSword {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Sword").type_(Sword).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingClaymore;
impl Timeline for TrainingClaymore {}
impl WeaponAttack for TrainingClaymore {}
impl TrainingClaymore {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Claymore").type_(Claymore).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingPolearm;
impl Timeline for TrainingPolearm {}
impl WeaponAttack for TrainingPolearm {}
impl TrainingPolearm {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Polearm").type_(Polearm).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingBow;
impl Timeline for TrainingBow {}
impl WeaponAttack for TrainingBow {}
impl TrainingBow {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Bow").type_(Bow).version(1.0)
.base_atk(608.)
}
}
#[derive(Debug)]
pub struct TrainingCatalyst;
impl Timeline for TrainingCatalyst {}
impl WeaponAttack for TrainingCatalyst {}
impl TrainingCatalyst {
pub fn record() -> WeaponRecord {
WeaponRecord::default()
.name("Training Catalyst").type_(Catalyst).version(1.0)
.base_atk(608.)
}
}
pub enum TrainingArtifactUnion {
TrainingArtifact0(TrainingArtifact0),
TrainingArtifact1(TrainingArtifact1),
TrainingArtifact2(TrainingArtifact2),
TrainingArtifact3(TrainingArtifact3),
TrainingArtifact4(TrainingArtifact4),
TrainingArtifact5(TrainingArtifact5),
TrainingArtifact6(TrainingArtifact6),
TrainingArtifact7(TrainingArtifact7),
TrainingArtifact8(TrainingArtifact8),
TrainingArtifact9(TrainingArtifact9),
}
impl TrainingArtifactUnion {
pub fn timeline(&mut self) -> &mut dyn Timeline {
use TrainingArtifactUnion::*;
match self {
TrainingArtifact0(x) => x,
TrainingArtifact1(x) => x,
TrainingArtifact2(x) => x,
TrainingArtifact3(x) => x,
TrainingArtifact4(x) => x,
TrainingArtifact5(x) => x,
TrainingArtifact6(x) => x,
TrainingArtifact7(x) => x,
TrainingArtifact8(x) => x,
TrainingArtifact9(x) => x,
}
}
pub fn field(&mut self) -> &mut dyn WeaponAttack {
use TrainingArtifactUnion::*;
match self {
TrainingArtifact0(x) => x,
TrainingArtifact1(x) => x,
|
}
pub fn artifacts() -> Vec<(Artifact, TrainingArtifactUnion)> {
vec![
(TrainingArtifact0::record(), TrainingArtifactUnion::TrainingArtifact0(TrainingArtifact0)),
(TrainingArtifact1::record(), TrainingArtifactUnion::TrainingArtifact1(TrainingArtifact1)),
(TrainingArtifact2::record(), TrainingArtifactUnion::TrainingArtifact2(TrainingArtifact2)),
(TrainingArtifact3::record(), TrainingArtifactUnion::TrainingArtifact3(TrainingArtifact3)),
(TrainingArtifact4::record(), TrainingArtifactUnion::TrainingArtifact4(TrainingArtifact4)),
(TrainingArtifact5::record(), TrainingArtifactUnion::TrainingArtifact5(TrainingArtifact5)),
(TrainingArtifact6::record(), TrainingArtifactUnion::TrainingArtifact6(TrainingArtifact6)),
(TrainingArtifact7::record(), TrainingArtifactUnion::TrainingArtifact7(TrainingArtifact7)),
(TrainingArtifact8::record(), TrainingArtifactUnion::TrainingArtifact8(TrainingArtifact8)),
(TrainingArtifact9::record(), TrainingArtifactUnion::TrainingArtifact9(TrainingArtifact9)),
]
}
#[derive(Debug)]
pub struct TrainingArtifact0;
impl Timeline for TrainingArtifact0 {}
impl WeaponAttack for TrainingArtifact0 {}
impl TrainingArtifact0 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk70 Em280 Er78").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(33.3333))
.em(SCORE.em(33.3333))
.er(SCORE.er(33.3333))
}
}
#[derive(Debug)]
pub struct TrainingArtifact1;
impl Timeline for TrainingArtifact1 {}
impl WeaponAttack for TrainingArtifact1 {}
impl TrainingArtifact1 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk168 Em167").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(80.))
.em(SCORE.em(20.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact2;
impl Timeline for TrainingArtifact2 {}
impl WeaponAttack for TrainingArtifact2 {}
impl TrainingArtifact2 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk168 Er46").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(80.))
.er(SCORE.er(20.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact3;
impl Timeline for TrainingArtifact3 {}
impl WeaponAttack for TrainingArtifact3 {}
impl TrainingArtifact3 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk41 Em671").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(20.))
.em(SCORE.em(80.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact4;
impl Timeline for TrainingArtifact4 {}
impl WeaponAttack for TrainingArtifact4 {}
impl TrainingArtifact4 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em671 Er46").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(80.))
.er(SCORE.er(20.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact5;
impl Timeline for TrainingArtifact5 {}
impl WeaponAttack for TrainingArtifact5 {}
impl TrainingArtifact5 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk42 Er186").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(20.))
.er(SCORE.er(80.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact6;
impl Timeline for TrainingArtifact6 {}
impl WeaponAttack for TrainingArtifact6 {}
impl TrainingArtifact6 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em167 Er186").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(20.))
.er(SCORE.er(80.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact7;
impl Timeline for TrainingArtifact7 {}
impl WeaponAttack for TrainingArtifact7 {}
impl TrainingArtifact7 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk105 Em420").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(50.))
.em(SCORE.em(50.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact8;
impl Timeline for TrainingArtifact8 {}
impl WeaponAttack for TrainingArtifact8 {}
impl TrainingArtifact8 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk105 Er116").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(50.))
.er(SCORE.er(50.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact9;
impl Timeline for TrainingArtifact9 {}
impl WeaponAttack for TrainingArtifact9 {}
impl TrainingArtifact9 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em420 Er116").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(50.))
.er(SCORE.er(50.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact10;
impl Timeline for TrainingArtifact10 {}
impl WeaponAttack for TrainingArtifact10 {}
impl TrainingArtifact10 {
pub fn record() -> Artifact {
Artifact::default()
.name("Atk210").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.atk(SCORE.atk(100.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact11;
impl Timeline for TrainingArtifact11 {}
impl WeaponAttack for TrainingArtifact11 {}
impl TrainingArtifact11 {
pub fn record() -> Artifact {
Artifact::default()
.name("Em839").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.em(SCORE.em(100.))
}
}
#[derive(Debug)]
pub struct TrainingArtifact12;
impl Timeline for TrainingArtifact12 {}
impl WeaponAttack for TrainingArtifact12 {}
impl TrainingArtifact12 {
pub fn record() -> Artifact {
Artifact::default()
.name("Er233").version(1.0).preference(&[])
.elemental_dmg(15.).physical_dmg(25.).cr(20.)
.er(SCORE.er(100.))
}
}
| TrainingArtifact2(x) => x,
TrainingArtifact3(x) => x,
TrainingArtifact4(x) => x,
TrainingArtifact5(x) => x,
TrainingArtifact6(x) => x,
TrainingArtifact7(x) => x,
TrainingArtifact8(x) => x,
TrainingArtifact9(x) => x,
}
} | function_block-function_prefix_line | [] |
Rust | common/functions/src/scalars/dates/date.rs | flaneur2020/databend | b2758473f59bd23f1a278699e6cf292724c204cd |
use common_datavalues::DataValueArithmeticOperator;
use common_exception::Result;
use super::interval_function::MonthsArithmeticFunction;
use super::interval_function::SecondsArithmeticFunction;
use super::now::NowFunction;
use super::RoundFunction;
use super::ToStartOfISOYearFunction;
use super::ToStartOfMonthFunction;
use super::ToStartOfQuarterFunction;
use super::ToStartOfWeekFunction;
use super::ToStartOfYearFunction;
use super::ToYYYYMMDDFunction;
use super::ToYYYYMMDDhhmmssFunction;
use super::ToYYYYMMFunction;
use super::TodayFunction;
use super::TomorrowFunction;
use super::YesterdayFunction;
use crate::scalars::FactoryFuncRef;
#[derive(Clone)]
pub struct DateFunction {}
impl DateFunction {
pub fn register(map: FactoryFuncRef) -> Result<()> {
let mut map = map.write();
map.insert("today".into(), TodayFunction::try_create);
map.insert("yesterday".into(), YesterdayFunction::try_create);
map.insert("tomorrow".into(), TomorrowFunction::try_create);
map.insert("now".into(), NowFunction::try_create);
map.insert("toYYYYMM".into(), ToYYYYMMFunction::try_create);
map.insert("toYYYYMMDD".into(), ToYYYYMMDDFunction::try_create);
map.insert(
"toYYYYMMDDhhmmss".into(),
ToYYYYMMDDhhmmssFunction::try_create,
);
map.insert("toStartOfYear".into(), ToStartOfYearFunction::try_create);
map.insert(
"toStartOfISOYear".into(),
ToStartOfISOYearFunction::try_create,
);
map.insert(
"toStartOfQuarter".into(),
ToStartOfQuarterFunction::try_create,
);
map.insert("toStartOfWeek".into(), ToStartOfWeekFunction::try_create);
map.insert("toStartOfMonth".into(), ToStartOfMonthFunction::try_create);
{
map.insert("toStartOfSecond".into(), |display_name| {
RoundFunction::try_create(display_name, 1)
});
map.insert("toStartOfMinute".into(), |display_name| {
RoundFunction::try_create(display_name, 60)
});
map.insert("toStartOfFiveMinutes".into(), |display_name| {
RoundFunction::try_create(display_name, 5 * 60)
});
map.insert("toStartOfTenMinutes".into(), |display_name| {
RoundFunction::try_create(display_name, 10 * 60)
});
map.insert("toStartOfFifteenMinutes".into(), |display_name| {
RoundFunction::try_create(display_name, 15 * 60)
});
map.insert("timeSlot".into(), |display_name| {
RoundFunction::try_create(display_name, 30 * 60)
});
map.insert("toStartOfHour".into(), |display_name| {
RoundFunction::try_create(display_name, 60 * 60)
});
map.insert("toStartOfDay".into(), |display_name| {
RoundFunction::try_create(display_name, 60 * 60 * 24)
});
}
{
map.insert("addYears".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
12, /* one year is 12 months */
)
});
map.insert("subtractYears".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
12, /* one year is 12 months */
)
});
map.insert("addMonths".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
1,
)
});
map.insert("subtractMonths".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
1,
)
});
map.insert("addDays".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
24 * 3600, /* one day is 24 * 3600 seconds */
)
});
map.insert("subtractDays".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
24 * 3600, /* one day is 24 * 3600 seconds */
)
});
map.insert("addHours".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
3600, /* one hour is 3600 seconds */
)
});
map.insert("subtractHours".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
3600, /* one hour is 3600 seconds */
)
});
map.insert("addMinutes".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
60, /* one minute is 60 seconds */
)
});
map.insert("subtractMinutes".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
60, /* one minute is 60 seconds */
)
});
map.insert("addSeconds".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
1,
)
});
map.insert("subtractSeconds".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
1,
)
});
}
Ok(())
}
}
|
use common_datavalues::DataValueArithmeticOperator;
use common_exception::Result;
use super::interval_function::MonthsArithmeticFunction;
use super::interval_function::SecondsArithmeticFunction;
use super::now::NowFunction;
use super::RoundFunction;
use super::ToStartOfISOYearFunction;
use super::ToStartOfMonthFunction;
use super::ToStartOfQuarterFunction;
use super::ToStar | });
map.insert("toStartOfFifteenMinutes".into(), |display_name| {
RoundFunction::try_create(display_name, 15 * 60)
});
map.insert("timeSlot".into(), |display_name| {
RoundFunction::try_create(display_name, 30 * 60)
});
map.insert("toStartOfHour".into(), |display_name| {
RoundFunction::try_create(display_name, 60 * 60)
});
map.insert("toStartOfDay".into(), |display_name| {
RoundFunction::try_create(display_name, 60 * 60 * 24)
});
}
{
map.insert("addYears".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
12, /* one year is 12 months */
)
});
map.insert("subtractYears".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
12, /* one year is 12 months */
)
});
map.insert("addMonths".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
1,
)
});
map.insert("subtractMonths".into(), |display_name| {
MonthsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
1,
)
});
map.insert("addDays".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
24 * 3600, /* one day is 24 * 3600 seconds */
)
});
map.insert("subtractDays".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
24 * 3600, /* one day is 24 * 3600 seconds */
)
});
map.insert("addHours".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
3600, /* one hour is 3600 seconds */
)
});
map.insert("subtractHours".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
3600, /* one hour is 3600 seconds */
)
});
map.insert("addMinutes".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
60, /* one minute is 60 seconds */
)
});
map.insert("subtractMinutes".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
60, /* one minute is 60 seconds */
)
});
map.insert("addSeconds".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Plus,
1,
)
});
map.insert("subtractSeconds".into(), |display_name| {
SecondsArithmeticFunction::try_create(
display_name,
DataValueArithmeticOperator::Minus,
1,
)
});
}
Ok(())
}
}
| tOfWeekFunction;
use super::ToStartOfYearFunction;
use super::ToYYYYMMDDFunction;
use super::ToYYYYMMDDhhmmssFunction;
use super::ToYYYYMMFunction;
use super::TodayFunction;
use super::TomorrowFunction;
use super::YesterdayFunction;
use crate::scalars::FactoryFuncRef;
#[derive(Clone)]
pub struct DateFunction {}
impl DateFunction {
pub fn register(map: FactoryFuncRef) -> Result<()> {
let mut map = map.write();
map.insert("today".into(), TodayFunction::try_create);
map.insert("yesterday".into(), YesterdayFunction::try_create);
map.insert("tomorrow".into(), TomorrowFunction::try_create);
map.insert("now".into(), NowFunction::try_create);
map.insert("toYYYYMM".into(), ToYYYYMMFunction::try_create);
map.insert("toYYYYMMDD".into(), ToYYYYMMDDFunction::try_create);
map.insert(
"toYYYYMMDDhhmmss".into(),
ToYYYYMMDDhhmmssFunction::try_create,
);
map.insert("toStartOfYear".into(), ToStartOfYearFunction::try_create);
map.insert(
"toStartOfISOYear".into(),
ToStartOfISOYearFunction::try_create,
);
map.insert(
"toStartOfQuarter".into(),
ToStartOfQuarterFunction::try_create,
);
map.insert("toStartOfWeek".into(), ToStartOfWeekFunction::try_create);
map.insert("toStartOfMonth".into(), ToStartOfMonthFunction::try_create);
{
map.insert("toStartOfSecond".into(), |display_name| {
RoundFunction::try_create(display_name, 1)
});
map.insert("toStartOfMinute".into(), |display_name| {
RoundFunction::try_create(display_name, 60)
});
map.insert("toStartOfFiveMinutes".into(), |display_name| {
RoundFunction::try_create(display_name, 5 * 60)
});
map.insert("toStartOfTenMinutes".into(), |display_name| {
RoundFunction::try_create(display_name, 10 * 60)
| random | [
{
"content": "-- {ErrorCode 3, but it not work, because it's trimed in msql-srv}\n\nUSE not_exists_db;\n\nUSE default;\n\nUSE system;\n",
"file_path": "tests/suites/0_stateless/07_0000_use_database.sql",
"rank": 0,
"score": 56735.32093857074
},
{
"content": "use common_streams::SendableDataB... |
Rust | src/raycasting_engine.rs | N-Hoque/rustenstein3D | 97a483eeb20977a4d241d7b68e5be12e673fcad9 |
use rsfml::{
graphics::{
Color, PrimitiveType, RenderStates, RenderTarget, RenderWindow, Vertex, VertexArray,
},
system::{Vector2f, Vector2i},
window::Key,
};
use crate::{event_handler::EventHandler, map::Map, texture_loader::TextureLoader};
pub struct RaycastEngine {
player_position: Vector2f,
vector_direction: Vector2f,
cam_plane: Vector2f,
map: Map,
window_size: Vector2f,
vertex_array: Vec<Box<VertexArray>>,
textures_id: Vec<i32>,
ground: Vec<Box<VertexArray>>,
sky: Vec<Box<VertexArray>>,
no_ground: bool,
}
impl RaycastEngine {
pub fn new(map: Map, window_size: &Vector2f, no_ground: bool) -> RaycastEngine {
RaycastEngine {
player_position: Vector2f { x: 22., y: 12. },
vector_direction: Vector2f { x: -1., y: 0. },
cam_plane: Vector2f { x: 0., y: 0.66 },
map,
window_size: Vector2f {
x: window_size.x,
y: window_size.y - 80.,
},
vertex_array: RaycastEngine::create_line_array(window_size),
textures_id: Vec::new(),
ground: RaycastEngine::create_ground_array(window_size),
sky: RaycastEngine::create_ground_array(window_size),
no_ground,
}
}
pub fn update(&mut self, event_handler: &EventHandler) {
self.textures_id.clear();
let ray_pos = self.player_position.clone();
let mut ray_dir = Vector2f { x: 0., y: 0. };
let mut map_pos = Vector2i { x: 0, y: 0 };
let mut side_dist = Vector2f { x: 0., y: 0. };
let mut delta_dist = Vector2f { x: 0., y: 0. };
let mut step = Vector2i { x: 0, y: 0 };
let mut draw_start: i32 = 0;
let mut draw_end: i32 = 0;
let mut camera_x: f32;
let mut side: i32;
let mut perpendicular_wall_dist: f32 = 0.;
let mut wall_x: f32 = 0.;
for x in 0..(self.window_size.x as i32) {
camera_x = 2. * x as f32 / self.window_size.x - 1.;
ray_dir.x = self.vector_direction.x + self.cam_plane.x * camera_x;
ray_dir.y = self.vector_direction.y + self.cam_plane.y * camera_x;
map_pos.x = ray_pos.x as i32;
map_pos.y = ray_pos.y as i32;
delta_dist.x = (1. + (ray_dir.y * ray_dir.y) / (ray_dir.x * ray_dir.x)).sqrt();
delta_dist.y = (1. + (ray_dir.x * ray_dir.x) / (ray_dir.y * ray_dir.y)).sqrt();
side = 0;
self.calculate_step(
&ray_dir,
&mut step,
&ray_pos,
&map_pos,
&delta_dist,
&mut side_dist,
);
self.hit_wall(
&mut map_pos,
&mut side_dist,
&mut step,
&mut delta_dist,
&mut side,
);
self.calculate_wall_height(
side,
&mut draw_start,
&mut draw_end,
&map_pos,
&ray_pos,
&ray_dir,
&step,
&mut perpendicular_wall_dist,
);
self.calculate_wall_texture(
side,
&ray_dir,
x,
&map_pos,
&step,
&ray_pos,
draw_end,
draw_start,
&mut wall_x,
);
if !self.no_ground {
self.calculate_ground(
side,
&map_pos,
wall_x,
&ray_dir,
perpendicular_wall_dist,
&mut draw_end,
x,
);
}
}
self.update_events(event_handler);
}
fn calculate_ground(
&mut self,
side: i32,
map_pos: &Vector2i,
wall_x: f32,
ray_dir: &Vector2f,
perpendicular_wall_dist: f32,
draw_end: &mut i32,
x: i32,
) {
if *draw_end < 0 {
*draw_end = self.window_size.y as i32;
}
self.ground.get_mut(x as usize).unwrap().clear();
self.sky.get_mut(x as usize).unwrap().clear();
let mut vertex = Vertex::default();
let mut current_dist: f32;
let mut weight: f32;
let mut current_floor = Vector2f { x: 0., y: 0. };
let mut tex_coord = Vector2f { x: 0., y: 0. };
let mut pos = Vector2f { x: x as f32, y: 0. };
let dist_player: f32 = 0.;
let (map_pos_x, map_pos_y) = (map_pos.x as f32, map_pos.y as f32);
let floor = if side == 0 && ray_dir.x > 0. {
Vector2f {
x: map_pos_x,
y: map_pos_y + wall_x,
}
} else if side == 0 && ray_dir.x < 0. {
Vector2f {
x: map_pos_x + 1.,
y: map_pos_y + wall_x,
}
} else if side == 1 && ray_dir.y > 0. {
Vector2f {
x: map_pos_x + wall_x,
y: map_pos_y,
}
} else {
Vector2f {
x: map_pos_x + wall_x,
y: map_pos_y + 1.,
}
};
for y in (*draw_end + 1)..(self.window_size.y as i32) {
current_dist = self.window_size.y / (2. * y as f32 - self.window_size.y as f32);
weight = (current_dist - dist_player) / (perpendicular_wall_dist - dist_player);
current_floor.x = weight * floor.x + (1. - weight) * self.player_position.x;
current_floor.y = weight * floor.y + (1. - weight) * self.player_position.y;
tex_coord.x = ((current_floor.x * 128.) as i32 % 128) as f32;
tex_coord.y = ((current_floor.y * 128.) as i32 % 128) as f32;
pos.y = y as f32;
vertex.position.x = pos.x;
vertex.position.y = pos.y;
vertex.tex_coords.x = tex_coord.x;
vertex.tex_coords.y = tex_coord.y;
self.ground.get_mut(x as usize).unwrap().append(&vertex);
pos.y = self.window_size.y - y as f32;
vertex.position.x = pos.x;
vertex.position.y = pos.y;
vertex.tex_coords.x = tex_coord.x;
vertex.tex_coords.y = tex_coord.y;
self.sky.get_mut(x as usize).unwrap().append(&vertex);
}
}
fn calculate_wall_height(
&mut self,
side: i32,
draw_start: &mut i32,
draw_end: &mut i32,
map_pos: &Vector2i,
ray_pos: &Vector2f,
ray_dir: &Vector2f,
step: &Vector2i,
perpendicular_wall_dist: &mut f32,
) {
*perpendicular_wall_dist = if side == 0 {
(map_pos.x as f32 - ray_pos.x + (1 - step.x) as f32 / 2.) / ray_dir.x
} else {
(map_pos.y as f32 - ray_pos.y + (1 - step.y) as f32 / 2.) / ray_dir.y
}
.abs();
let line_height: i32 = if *perpendicular_wall_dist as i32 == 0 {
self.window_size.y as i32
} else {
((self.window_size.y / *perpendicular_wall_dist) as i32).abs()
};
*draw_start = (self.window_size.y as i32 / 2) - (line_height / 2);
if *draw_start < 0 {
*draw_start = 0;
}
*draw_end = line_height / 2 + self.window_size.y as i32 / 2;
if *draw_end > self.window_size.y as i32 {
*draw_end = self.window_size.y as i32 - 1;
}
}
fn calculate_wall_texture(
&mut self,
side: i32,
ray_dir: &Vector2f,
x: i32,
map_pos: &Vector2i,
step: &Vector2i,
ray_pos: &Vector2f,
draw_end: i32,
draw_start: i32,
wall_x: &mut f32,
) {
let mut texture_id = self
.map
.get_block(map_pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", map_pos));
*wall_x = if side == 1 {
ray_pos.x
+ ((map_pos.y as f32 - ray_pos.y + (1. - step.y as f32) / 2.) / ray_dir.y)
* ray_dir.x
} else {
ray_pos.y
+ ((map_pos.x as f32 - ray_pos.x + (1. - step.x as f32) / 2.) / ray_dir.x)
* ray_dir.y
};
*wall_x -= wall_x.floor();
let mut texture_x = (*wall_x * 128.) as i32;
if side == 0 && ray_dir.x > 0. {
texture_x = 128 - texture_x - 1;
}
if side == 1 && ray_dir.y < 0. {
texture_x = 128 - texture_x - 1;
}
if side == 1 {
texture_id += 5;
}
self.textures_id.push(texture_id);
self.vertex_array.get_mut(x as usize).unwrap().clear();
self.vertex_array
.get_mut(x as usize)
.unwrap()
.append(&Vertex::new(
Vector2f::new(x as f32, draw_end as f32),
Color::WHITE,
Vector2f::new(texture_x as f32, 128.),
));
self.vertex_array
.get_mut(x as usize)
.unwrap()
.append(&Vertex::new(
Vector2f::new(x as f32, draw_start as f32),
Color::WHITE,
Vector2f::new(texture_x as f32, 0.),
));
}
fn calculate_step(
&self,
ray_dir: &Vector2f,
step: &mut Vector2i,
ray_pos: &Vector2f,
map_pos: &Vector2i,
delta_dist: &Vector2f,
side_dist: &mut Vector2f,
) {
if ray_dir.x < 0. {
step.x = -1;
side_dist.x = (ray_pos.x - map_pos.x as f32) * delta_dist.x;
} else {
step.x = 1;
side_dist.x = (map_pos.x as f32 + 1. - ray_pos.x) * delta_dist.x;
}
if ray_dir.y < 0. {
step.y = -1;
side_dist.y = (ray_pos.y - map_pos.y as f32) * delta_dist.y;
} else {
step.y = 1;
side_dist.y = (map_pos.y as f32 + 1. - ray_pos.y) * delta_dist.y;
}
}
fn hit_wall(
&self,
map_pos: &mut Vector2i,
side_dist: &mut Vector2f,
step: &mut Vector2i,
delta_dist: &mut Vector2f,
side: &mut i32,
) {
let mut hit: bool = false;
while !hit {
if side_dist.x < side_dist.y {
side_dist.x += delta_dist.x;
map_pos.x += step.x;
*side = 0;
} else {
side_dist.y += delta_dist.y;
map_pos.y += step.y;
*side = 1;
}
hit = match self.map.get_block(map_pos) {
Some(block) if block == 0 => false,
_ => true,
};
}
}
fn update_events(&mut self, event_handler: &EventHandler) {
let mut pos = Vector2i { x: 0, y: 0 };
if event_handler.is_key_pressed(Key::W) {
pos.x = (self.player_position.x + (self.vector_direction.x * 0.1)) as i32;
pos.y = self.player_position.y as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.x += self.vector_direction.x * 0.1;
}
pos.y = (self.player_position.y + (self.vector_direction.y * 0.1)) as i32;
pos.x = self.player_position.x as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.y += self.vector_direction.y * 0.1;
}
}
if event_handler.is_key_pressed(Key::S) {
pos.x = (self.player_position.x - (self.vector_direction.x * 0.1)) as i32;
pos.y = self.player_position.y as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.x -= self.vector_direction.x * 0.1;
}
pos.y = (self.player_position.y - (self.vector_direction.y * 0.1)) as i32;
pos.x = self.player_position.x as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.y -= self.vector_direction.y * 0.1;
}
}
let mouse_move = match event_handler.has_mouse_moved_event() {
Some((x, _)) => x as f32 - (self.window_size.x / 2.) as f32,
None => 0.,
} / -250.;
let old_dir_x = self.vector_direction.x;
self.vector_direction.x = self.vector_direction.x * (mouse_move).cos()
- self.vector_direction.y * (mouse_move).sin();
self.vector_direction.y =
old_dir_x * (mouse_move).sin() + self.vector_direction.y * (mouse_move).cos();
let old_cam_plane_x = self.cam_plane.x;
self.cam_plane.x =
self.cam_plane.x * (mouse_move).cos() - self.cam_plane.y * (mouse_move).sin();
self.cam_plane.y =
old_cam_plane_x * (mouse_move).sin() + self.cam_plane.y * (mouse_move).cos();
}
fn create_line_array(window_size: &Vector2f) -> Vec<Box<VertexArray>> {
let mut lines: Vec<Box<VertexArray>> = Vec::new();
for _ in 0..(window_size.x as i32) {
let mut line: Box<VertexArray> = Box::new(VertexArray::default());
line.set_primitive_type(PrimitiveType::Lines);
lines.push(line);
}
lines
}
fn create_ground_array(window_size: &Vector2f) -> Vec<Box<VertexArray>> {
let mut lines: Vec<Box<VertexArray>> = Vec::new();
for _ in 0..(window_size.x as i32) {
let line: Box<VertexArray> = Box::new(VertexArray::default());
lines.push(line);
}
lines
}
pub fn get_player_pos(&self) -> Vector2f {
self.player_position.clone()
}
pub fn draw<'r>(&self, render_window: &'r mut RenderWindow, texture_loader: &'r TextureLoader) {
let mut render_states = RenderStates::default();
for (line_idx, line) in self.vertex_array.iter().enumerate() {
render_states.texture =
Some(texture_loader.get_texture(self.textures_id[line_idx as usize]));
render_window.draw_with_renderstates(&*(*line), render_states);
}
render_states.texture = Some(texture_loader.get_texture(0));
for gr in self.ground.iter() {
render_window.draw_with_renderstates(&*(*gr), render_states);
}
render_states.texture = Some(texture_loader.get_texture(11));
for sky in self.sky.iter() {
render_window.draw_with_renderstates(&*(*sky), render_states);
}
}
}
|
use rsfml::{
graphics::{
Color, PrimitiveType, RenderStates, RenderTarget, RenderWindow, Vertex, VertexArray,
},
system::{Vector2f, Vector2i},
window::Key,
};
use crate::{event_handler::EventHandler, map::Map, texture_loader::TextureLoader};
pub struct RaycastEngine {
player_position: Vector2f,
vector_direction: Vector2f,
cam_plane: Vector2f,
map: Map,
window_size: Vector2f,
vertex_array: Vec<Box<VertexArray>>,
textures_id: Vec<i32>,
ground: Vec<Box<VertexArray>>,
sky: Vec<Box<VertexArray>>,
no_ground: bool,
}
impl RaycastEngine {
pub fn new(map: Map, window_size: &Vector2f, no_ground: bool) -> RaycastEngine {
RaycastEngine {
player_position: Vector2f { x: 22., y: 12. },
vector_direction: Vector2f { x: -1., y: 0. },
cam_plane: Vector2f { x: 0., y: 0.66 },
map,
window_size: Vector2f {
x: window_size.x,
y: window_size.y - 80.,
},
vertex_array: RaycastEngine::create_line_array(window_size),
textures_id: Vec::new(),
ground: RaycastEngine::create_ground_array(window_size),
sky: RaycastEngine::create_ground_array(window_size),
no_ground,
}
}
pub fn update(&mut self, event_handler: &EventHandler) {
self.textures_id.clear();
let ray_pos = self.player_position.clone();
let mut ray_dir = Vector2f { x: 0., y: 0. };
let mut map_pos = Vector2i { x: 0, y: 0 };
let mut side_dist = Vector2f { x: 0., y: 0. };
let mut delta_dist = Vector2f { x: 0., y: 0. };
let mut step = Vector2i { x: 0, y: 0 };
let mut draw_start: i32 = 0;
let mut draw_end: i32 = 0;
let mut camera_x: f32;
let mut side: i32;
let mut perpendicular_wall_dist: f32 = 0.;
let mut wall_x: f32 = 0.;
for x in 0..(self.window_size.x as i32) {
camera_x = 2. * x as f32 / self.window_size.x - 1.;
ray_dir.x = self.vector_direction.x + self.cam_plane.x * camera_x;
ray_dir.y = self.vector_direction.y + self.cam_plane.y * camera_x;
map_pos.x = ray_pos.x as i32;
map_pos.y = ray_pos.y as i32;
delta_dist.x = (1. + (ray_dir.y * ray_dir.y) / (ray_dir.x * ray_dir.x)).sqrt();
delta_dist.y = (1. + (ray_dir.x * ray_dir.x) / (ray_dir.y * ray_dir.y)).sqrt();
side = 0;
self.calculate_step(
&ray_dir,
&mut step,
&ray_pos,
&map_pos,
&delta_dist,
&mut side_dist,
);
self.hit_wall(
&mut map_pos,
&mut side_dist,
&mut step,
&mut delta_dist,
&mut side,
);
self.calculate_wall_height(
side,
&mut draw_start,
&mut draw_end,
&map_pos,
&ray_pos,
&ray_dir,
&step,
&mut perpendicular_wall_dist,
);
self.calculate_wall_texture(
side,
&ray_dir,
x,
&map_pos,
&step,
&ray_pos,
draw_end,
draw_start,
&mut wall_x,
);
if !self.no_ground {
self.calculate_ground(
side,
&map_pos,
wall_x,
&ray_dir,
perpendicular_wall_dist,
&mut draw_end,
x,
);
}
}
self.update_events(event_handler);
}
fn calculate_ground(
&mut self,
side: i32,
map_pos: &Vector2i,
wall_x: f32,
ray_dir: &Vector2f,
perpendicular_wall_dist: f32,
draw_end: &mut i32,
x: i32,
) {
if *draw_end < 0 {
*draw_end = self.window_size.y as i32;
}
self.ground.get_mut(x as usize).unwrap().clear();
self.sky.get_mut(x as usize).unwrap().clear();
let mut vertex = Vertex::default();
let mut current_dist: f32;
let mut weight: f32;
let mut current_floor = Vector2f { x: 0., y: 0. };
let mut tex_coord = Vector2f { x: 0., y: 0. };
let mut pos = Vector2f { x: x as f32, y: 0. };
let dist_player: f32 = 0.;
let (map_pos_x, map_pos_y) = (map_pos.x as f32, map_pos.y as f32);
let floor = if side == 0 && ray_dir.x > 0. {
Vector2f {
x: map_pos_x,
y: map_pos_y + wall_x,
}
} else if side == 0 && ray_dir.x < 0. {
Vector2f {
x: map_pos_x + 1.,
y: map_pos_y + wall_x,
}
} else if side == 1 && ray_dir.y > 0. {
Vector2f {
x: map_pos_x + wall_x,
y: map_pos_y,
}
} else {
Vector2f {
x: map_pos_x + wall_x,
y: map_pos_y + 1.,
}
};
for y in (*draw_end + 1)..(self.window_size.y as i32) {
current_dist = self.window_size.y / (2. * y as f32 - self.window_size.y as f32);
weight = (current_dist - dist_player) / (perpendicular_wall_dist - dist_player);
current_floor.x = weight * floor.x + (1. - weight) * self.player_position.x;
current_floor.y = weight * floor.y + (1. - weight) * self.player_position.y;
tex_coord.x = ((current_floor.x * 128.) as i32 % 128) as f32;
tex_coord.y = ((current_floor.y * 128.) as i32 % 128) as f32;
pos.y = y as f32;
vertex.position.x = pos.x;
vertex.position.y = pos.y;
vertex.tex_coords.x = tex_coord.x;
vertex.tex_coords.y = tex_coord.y;
self.ground.get_mut(x as usize).unwrap().append(&vertex);
pos.y = self.window_size.y - y as f32;
vertex.position.x = pos.x;
vertex.position.y = pos.y;
vertex.tex_coords.x = tex_coord.x;
vertex.tex_coords.y = tex_coord.y;
self.sky.get_mut(x as usize).unwrap().append(&vertex);
}
}
fn calculate_wall_height(
&mut self,
side: i32,
draw_start: &mut i32,
draw_end: &mut i32,
map_pos: &Vector2i,
ray_pos: &Vector2f,
ray_dir: &Vector2f,
step: &Vector2i,
perpendicular_wall_dist: &mut f32,
) {
*perpendicular_wall_dist = if side == 0 {
(map_pos.x as f32 - ray_pos.x + (1 - step.x) as f32 / 2.) / ray_dir.x
} else {
(map_pos.y as f32 - ray_pos.y + (1 - step.y) as f32 / 2.) / ray_dir.y
}
.abs();
let line_height: i32 = if *perpendicular_wall_dist as i32 == 0 {
self.window_size.y as i32
} else {
((self.window_size.y / *perpendicular_wall_dist) as i32).abs()
};
*draw_start = (self.window_size.y as i32 / 2) - (line_height / 2);
if *draw_start < 0 {
*draw_start = 0;
}
*draw_end = line_height / 2 + self.window_size.y as i32 / 2;
if *draw_end > self.window_size.y as i32 {
*draw_end = self.window_size.y as i32 - 1;
}
}
fn calculate_wall_texture(
&mut self,
side: i32,
ray_dir: &Vector2f,
x: i32,
map_pos: &Vector2i,
step: &Vector2i,
ray_pos: &Vector2f,
draw_end: i32,
draw_start: i32,
wall_x: &mut f32,
) {
let mut texture_id = self
.map
.get_block(map_pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", map_pos));
*wall_x = if side == 1 {
ray_pos.x
+ ((map_pos.y as f32 - ray_pos.y + (1. - step.y as f32) / 2.) / ray_dir.y)
* ray_dir.x
} else {
ray_pos.y
+ ((map_pos.x as f32 - ray_pos.x + (1. - step.x as f32) / 2.) / ray_dir.x)
* ray_dir.y
};
*wall_x -= wall_x.floor();
let mut texture_x = (*wall_x * 128.) as i32;
if side == 0 && ray_dir.x > 0. {
texture_x = 128 - texture_x - 1;
}
if side == 1 && ray_dir.y < 0. {
texture_x = 128 - texture_x - 1;
}
if side == 1 {
texture_id += 5;
}
self.textures_id.push(texture_id);
self.vertex_array.get_mut(x as usize).unwrap().clear();
self.vertex_array
.get_mut(x as usize)
.unwrap()
.append(&Vertex::new(
Vector2f::new(x as f32, draw_end as f32),
Color::WHITE,
Vector2f::new(texture_x as f32, 128.),
));
self.vertex_array
.get_mut(x as usize)
.unwrap()
.append(&Vertex::new(
Vector2f::new(x as f32, draw_start as f32),
Color::WHITE,
Vector2f::new(texture_x as f32, 0.),
));
}
|
fn hit_wall(
&self,
map_pos: &mut Vector2i,
side_dist: &mut Vector2f,
step: &mut Vector2i,
delta_dist: &mut Vector2f,
side: &mut i32,
) {
let mut hit: bool = false;
while !hit {
if side_dist.x < side_dist.y {
side_dist.x += delta_dist.x;
map_pos.x += step.x;
*side = 0;
} else {
side_dist.y += delta_dist.y;
map_pos.y += step.y;
*side = 1;
}
hit = match self.map.get_block(map_pos) {
Some(block) if block == 0 => false,
_ => true,
};
}
}
fn update_events(&mut self, event_handler: &EventHandler) {
let mut pos = Vector2i { x: 0, y: 0 };
if event_handler.is_key_pressed(Key::W) {
pos.x = (self.player_position.x + (self.vector_direction.x * 0.1)) as i32;
pos.y = self.player_position.y as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.x += self.vector_direction.x * 0.1;
}
pos.y = (self.player_position.y + (self.vector_direction.y * 0.1)) as i32;
pos.x = self.player_position.x as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.y += self.vector_direction.y * 0.1;
}
}
if event_handler.is_key_pressed(Key::S) {
pos.x = (self.player_position.x - (self.vector_direction.x * 0.1)) as i32;
pos.y = self.player_position.y as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.x -= self.vector_direction.x * 0.1;
}
pos.y = (self.player_position.y - (self.vector_direction.y * 0.1)) as i32;
pos.x = self.player_position.x as i32;
if self
.map
.get_block(&pos)
.expect(&format!("ERROR: Cannot get block ID {:?}", &pos))
== 0
{
self.player_position.y -= self.vector_direction.y * 0.1;
}
}
let mouse_move = match event_handler.has_mouse_moved_event() {
Some((x, _)) => x as f32 - (self.window_size.x / 2.) as f32,
None => 0.,
} / -250.;
let old_dir_x = self.vector_direction.x;
self.vector_direction.x = self.vector_direction.x * (mouse_move).cos()
- self.vector_direction.y * (mouse_move).sin();
self.vector_direction.y =
old_dir_x * (mouse_move).sin() + self.vector_direction.y * (mouse_move).cos();
let old_cam_plane_x = self.cam_plane.x;
self.cam_plane.x =
self.cam_plane.x * (mouse_move).cos() - self.cam_plane.y * (mouse_move).sin();
self.cam_plane.y =
old_cam_plane_x * (mouse_move).sin() + self.cam_plane.y * (mouse_move).cos();
}
fn create_line_array(window_size: &Vector2f) -> Vec<Box<VertexArray>> {
let mut lines: Vec<Box<VertexArray>> = Vec::new();
for _ in 0..(window_size.x as i32) {
let mut line: Box<VertexArray> = Box::new(VertexArray::default());
line.set_primitive_type(PrimitiveType::Lines);
lines.push(line);
}
lines
}
fn create_ground_array(window_size: &Vector2f) -> Vec<Box<VertexArray>> {
let mut lines: Vec<Box<VertexArray>> = Vec::new();
for _ in 0..(window_size.x as i32) {
let line: Box<VertexArray> = Box::new(VertexArray::default());
lines.push(line);
}
lines
}
pub fn get_player_pos(&self) -> Vector2f {
self.player_position.clone()
}
pub fn draw<'r>(&self, render_window: &'r mut RenderWindow, texture_loader: &'r TextureLoader) {
let mut render_states = RenderStates::default();
for (line_idx, line) in self.vertex_array.iter().enumerate() {
render_states.texture =
Some(texture_loader.get_texture(self.textures_id[line_idx as usize]));
render_window.draw_with_renderstates(&*(*line), render_states);
}
render_states.texture = Some(texture_loader.get_texture(0));
for gr in self.ground.iter() {
render_window.draw_with_renderstates(&*(*gr), render_states);
}
render_states.texture = Some(texture_loader.get_texture(11));
for sky in self.sky.iter() {
render_window.draw_with_renderstates(&*(*sky), render_states);
}
}
}
| fn calculate_step(
&self,
ray_dir: &Vector2f,
step: &mut Vector2i,
ray_pos: &Vector2f,
map_pos: &Vector2i,
delta_dist: &Vector2f,
side_dist: &mut Vector2f,
) {
if ray_dir.x < 0. {
step.x = -1;
side_dist.x = (ray_pos.x - map_pos.x as f32) * delta_dist.x;
} else {
step.x = 1;
side_dist.x = (map_pos.x as f32 + 1. - ray_pos.x) * delta_dist.x;
}
if ray_dir.y < 0. {
step.y = -1;
side_dist.y = (ray_pos.y - map_pos.y as f32) * delta_dist.y;
} else {
step.y = 1;
side_dist.y = (map_pos.y as f32 + 1. - ray_pos.y) * delta_dist.y;
}
} | function_block-full_function | [
{
"content": "pub fn parse_arguments() -> ParsedResult {\n\n let args = std::env::args().collect::<Vec<String>>();\n\n let arg_length = args.len();\n\n\n\n let mut arguments = Arguments {\n\n window_dimensions: (768, 480),\n\n no_ground: false,\n\n framerate_limit: 30,\n\n };\n\... |
Rust | datafusion/src/logical_plan/window_frames.rs | cube-js/arrow-datafusion | 4e9d31e05b69017d972ae4c1ffbeeaab163fd654 |
use crate::error::{DataFusionError, Result};
use crate::execution::context::ExecutionContextState;
use crate::logical_plan::Expr;
use crate::scalar::ScalarValue;
use crate::sql::planner::SqlToRel;
use serde_derive::{Deserialize, Serialize};
use sqlparser::ast;
use sqlparser::ast::DateTimeField;
use std::cmp::Ordering;
use std::convert::TryInto;
use std::convert::{From, TryFrom};
use std::fmt;
#[derive(Debug, Clone, PartialEq)]
pub struct WindowFrame {
pub units: WindowFrameUnits,
pub start_bound: WindowFrameBound,
pub end_bound: WindowFrameBound,
}
impl fmt::Display for WindowFrame {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(
f,
"{} BETWEEN {} AND {}",
self.units, self.start_bound, self.end_bound
)?;
Ok(())
}
}
impl TryFrom<ast::WindowFrame> for WindowFrame {
type Error = DataFusionError;
fn try_from(value: ast::WindowFrame) -> Result<Self> {
let start_bound = value.start_bound.try_into()?;
let end_bound = value
.end_bound
.map(WindowFrameBound::try_from)
.unwrap_or(Ok(WindowFrameBound::CurrentRow))?;
check_window_bound_order(&start_bound, &end_bound)?;
let is_allowed_range_bound = |s: &ScalarValue| match s {
ScalarValue::Int64(Some(i)) => *i == 0,
_ => false,
};
let units = value.units.into();
if units == WindowFrameUnits::Range {
for bound in &[&start_bound, &end_bound] {
match bound {
WindowFrameBound::Preceding(Some(v))
| WindowFrameBound::Following(Some(v)) if !is_allowed_range_bound(v) => {
Err(DataFusionError::NotImplemented(format!(
"With WindowFrameUnits={}, the bound cannot be {} PRECEDING or FOLLOWING at the moment",
units, v
)))
}
_ => Ok(()),
}?;
}
}
Ok(Self {
units,
start_bound,
end_bound,
})
}
}
#[allow(missing_docs)]
pub fn check_window_bound_order(
start_bound: &WindowFrameBound,
end_bound: &WindowFrameBound,
) -> Result<()> {
if let WindowFrameBound::Following(None) = start_bound {
Err(DataFusionError::Execution(
"Invalid window frame: start bound cannot be unbounded following".to_owned(),
))
} else if let WindowFrameBound::Preceding(None) = end_bound {
Err(DataFusionError::Execution(
"Invalid window frame: end bound cannot be unbounded preceding".to_owned(),
))
} else {
match start_bound.logical_cmp(&end_bound) {
None => Err(DataFusionError::Execution(format!(
"Invalid window frame: start bound ({}) is incompatble with the end bound ({})",
start_bound, end_bound
))),
Some(o) if o > Ordering::Equal => Err(DataFusionError::Execution(format!(
"Invalid window frame: start bound ({}) cannot be larger than end bound ({})",
start_bound, end_bound
))),
Some(_) => Ok(()),
}
}
}
impl Default for WindowFrame {
fn default() -> Self {
WindowFrame {
units: WindowFrameUnits::Range,
start_bound: WindowFrameBound::Preceding(None),
end_bound: WindowFrameBound::CurrentRow,
}
}
}
#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub enum WindowFrameBound {
Preceding(Option<ScalarValue>),
CurrentRow,
Following(Option<ScalarValue>),
}
impl TryFrom<ast::WindowFrameBound> for WindowFrameBound {
type Error = DataFusionError;
fn try_from(value: ast::WindowFrameBound) -> Result<Self> {
let value_to_scalar = |v| -> Result<_> {
match v {
None => Ok(None),
Some(ast::Value::Number(v, _)) => match v.parse() {
Err(_) => Err(DataFusionError::Plan(format!("could not convert window frame bound '{}' to int64", v))),
Ok(v) => Ok(Some(ScalarValue::Int64(Some(v)))),
},
Some(ast::Value::Interval { value, leading_field, leading_precision, last_field, fractional_seconds_precision })
=> Ok(Some(interval_to_scalar(&value, &leading_field, &leading_precision, &last_field, &fractional_seconds_precision)?)),
Some(o) => Err(DataFusionError::Plan(format!("window frame bound must be a positive integer or an INTERVAL, got {}", o))),
}
};
match value {
ast::WindowFrameBound::Preceding(v) => {
Ok(Self::Preceding(value_to_scalar(v)?))
}
ast::WindowFrameBound::Following(v) => {
Ok(Self::Following(value_to_scalar(v)?))
}
ast::WindowFrameBound::CurrentRow => Ok(Self::CurrentRow),
}
}
}
fn interval_to_scalar(
value: &str,
leading_field: &Option<DateTimeField>,
leading_precision: &Option<u64>,
last_field: &Option<DateTimeField>,
fractional_seconds_precision: &Option<u64>,
) -> Result<ScalarValue> {
match SqlToRel::<ExecutionContextState>::sql_interval_to_literal(
value,
leading_field,
leading_precision,
last_field,
fractional_seconds_precision,
)? {
Expr::Literal(v) => Ok(v),
o => panic!("unexpected result of interval_to_literal: {:?}", o),
}
}
impl fmt::Display for WindowFrameBound {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self {
WindowFrameBound::CurrentRow => f.write_str("CURRENT ROW"),
WindowFrameBound::Preceding(None) => f.write_str("UNBOUNDED PRECEDING"),
WindowFrameBound::Following(None) => f.write_str("UNBOUNDED FOLLOWING"),
WindowFrameBound::Preceding(Some(n)) => write!(f, "{} PRECEDING", n),
WindowFrameBound::Following(Some(n)) => write!(f, "{} FOLLOWING", n),
}
}
}
impl WindowFrameBound {
pub fn logical_cmp(&self, other: &Self) -> Option<Ordering> {
use WindowFrameBound::{CurrentRow, Following, Preceding};
let ord = |v: &WindowFrameBound| match v {
Preceding(_) => 0,
CurrentRow => 1,
Following(_) => 2,
};
let lo = ord(self);
let ro = ord(other);
let o = lo.cmp(&ro);
if o != Ordering::Equal {
return Some(o);
}
let (l, r) = match (self, other) {
(Preceding(Some(l)), Preceding(Some(r))) => (r, l),
(Following(Some(l)), Following(Some(r))) => (l, r),
(CurrentRow, CurrentRow) => return Some(Ordering::Equal),
(Preceding(None), Preceding(None)) => return Some(Ordering::Equal),
(Preceding(None), Preceding(Some(_))) => return Some(Ordering::Less),
(Preceding(Some(_)), Preceding(None)) => return Some(Ordering::Greater),
(Following(None), Following(None)) => return Some(Ordering::Equal),
(Following(Some(_)), Following(None)) => return Some(Ordering::Less),
(Following(None), Following(Some(_))) => return Some(Ordering::Greater),
_ => panic!("unhandled bounds: {} and {}", self, other),
};
match (l, r) {
(ScalarValue::Int64(Some(l)), ScalarValue::Int64(Some(r))) => Some(l.cmp(r)),
(
ScalarValue::IntervalDayTime(Some(l)),
ScalarValue::IntervalDayTime(Some(r)),
) => Some(l.cmp(r)),
(
ScalarValue::IntervalYearMonth(Some(l)),
ScalarValue::IntervalYearMonth(Some(r)),
) => Some(l.cmp(r)),
_ => None,
}
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum WindowFrameUnits {
Rows,
Range,
Groups,
}
impl fmt::Display for WindowFrameUnits {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
f.write_str(match self {
WindowFrameUnits::Rows => "ROWS",
WindowFrameUnits::Range => "RANGE",
WindowFrameUnits::Groups => "GROUPS",
})
}
}
impl From<ast::WindowFrameUnits> for WindowFrameUnits {
fn from(value: ast::WindowFrameUnits) -> Self {
match value {
ast::WindowFrameUnits::Range => Self::Range,
ast::WindowFrameUnits::Groups => Self::Groups,
ast::WindowFrameUnits::Rows => Self::Rows,
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_window_frame_creation() -> Result<()> {
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Following(None),
end_bound: None,
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: start bound cannot be unbounded following".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(None),
end_bound: Some(ast::WindowFrameBound::Preceding(None)),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: end bound cannot be unbounded preceding".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(Some(1)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(2))),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: start bound (1 PRECEDING) cannot be larger than end bound (2 PRECEDING)".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(Some(2)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"This feature is not implemented: With WindowFrameUnits=RANGE, the bound cannot be 2 PRECEDING or FOLLOWING at the moment".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Rows,
start_bound: ast::WindowFrameBound::Preceding(Some(2)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),
};
let result = WindowFrame::try_from(window_frame);
assert!(result.is_ok());
Ok(())
}
#[test]
fn test_eq() {
assert_eq!(
WindowFrameBound::Preceding(Some(0)),
WindowFrameBound::CurrentRow
);
assert_eq!(
WindowFrameBound::CurrentRow,
WindowFrameBound::Following(Some(0))
);
assert_eq!(
WindowFrameBound::Following(Some(2)),
WindowFrameBound::Following(Some(2))
);
assert_eq!(
WindowFrameBound::Following(None),
WindowFrameBound::Following(None)
);
assert_eq!(
WindowFrameBound::Preceding(Some(2)),
WindowFrameBound::Preceding(Some(2))
);
assert_eq!(
WindowFrameBound::Preceding(None),
WindowFrameBound::Preceding(None)
);
}
#[test]
fn test_ord() {
assert!(WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::CurrentRow);
assert!(
WindowFrameBound::Preceding(Some(2)) < WindowFrameBound::Preceding(Some(1))
);
assert!(
WindowFrameBound::Preceding(Some(u64::MAX))
< WindowFrameBound::Preceding(Some(u64::MAX - 1))
);
assert!(
WindowFrameBound::Preceding(None)
< WindowFrameBound::Preceding(Some(1000000))
);
assert!(
WindowFrameBound::Preceding(None)
< WindowFrameBound::Preceding(Some(u64::MAX))
);
assert!(WindowFrameBound::Preceding(None) < WindowFrameBound::Following(Some(0)));
assert!(
WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::Following(Some(1))
);
assert!(WindowFrameBound::CurrentRow < WindowFrameBound::Following(Some(1)));
assert!(
WindowFrameBound::Following(Some(1)) < WindowFrameBound::Following(Some(2))
);
assert!(WindowFrameBound::Following(Some(2)) < WindowFrameBound::Following(None));
assert!(
WindowFrameBound::Following(Some(u64::MAX))
< WindowFrameBound::Following(None)
);
}
}
|
use crate::error::{DataFusionError, Result};
use crate::execution::context::ExecutionContextState;
use crate::logical_plan::Expr;
use crate::scalar::ScalarValue;
use crate::sql::planner::SqlToRel;
use serde_derive::{Deserialize, Serialize};
use sqlparser::ast;
use sqlparser::ast::DateTimeField;
use std::cmp::Ordering;
use std::convert::TryInto;
use std::convert::{From, TryFrom};
use std::fmt;
#[derive(Debug, Clone, PartialEq)]
pub struct WindowFrame {
pub units: WindowFrameUnits,
pub start_bound: WindowFrameBound,
pub end_bound: WindowFrameBound,
}
impl fmt::Display for WindowFrame {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(
f,
"{} BETWEEN {} AND {}",
self.units, self.start_bound, self.end_bound
)?;
Ok(())
}
}
impl TryFrom<ast::WindowFrame> for WindowFrame {
type Error = DataFusionError;
fn try_from(value: ast::WindowFrame) -> Result<Self> {
let start_bound = value.start_bound.try_into()?;
let end_bound = value
.end_bound
.map(WindowFrameBound::try_from)
.unwrap_or(Ok(WindowFrameBound::CurrentRow))?;
check_window_bound_order(&start_bound, &end_bound)?;
let is_allowed_range_bound = |s: &ScalarValue| match s {
ScalarValue::Int64(Some(i)) => *i == 0,
_ => false,
};
let units = value.units.into();
if units == WindowFrameUnits::Range {
for bound in &[&start_bound, &end_bound] {
match bound {
WindowFrameBound::Preceding(Some(v))
| WindowFrameBound::Following(Some(v)) if !is_allowed_range_bound(v) => {
Err(DataFusionError::NotImplemented(format!(
"With WindowFrameUnits={}, the bound cannot be {} PRECEDING or FOLLOWING at the moment",
units, v
)))
}
_ => Ok(()),
}?;
}
}
Ok(Self {
units,
start_bound,
end_bound,
})
}
}
#[allow(missing_docs)]
pub fn check_window_bound_order(
start_bound: &WindowFrameBound,
end_bound: &WindowFrameBound,
) -> Result<()> {
if let WindowFrameBound::Following(None) = start_bound {
Err(DataFusionError::Execution(
"Invalid window frame: start bound cannot be unbounded following".to_owned(),
))
} else if let WindowFrameBound::Preceding(None) = end_bound {
Err(DataFusionError::Execution(
"Invalid window frame: end bound cannot be unbounded preceding".to_owned(),
))
} else {
match start_bound.logical_cmp(&end_bound) {
None => Err(DataFusionError::Execution(format!(
"Invalid window frame: start bound ({}) is incompatble with the end bound ({})",
start_bound, end_bound
))),
Some(o) if o > Ordering::Equal => Err(DataFusionError::Execution(format!(
"Invalid window frame: start bound ({}) cannot be larger than end bound ({})",
start_bound, end_bound
))),
Some(_) => Ok(()),
}
}
}
impl Default for WindowFrame {
fn default() -> Self {
WindowFrame {
units: WindowFrameUnits::Range,
start_bound: WindowFrameBound::Preceding(None),
end_bound: WindowFrameBound::CurrentRow,
}
}
}
#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub enum WindowFrameBound {
Preceding(Option<ScalarValue>),
CurrentRow,
Following(Option<ScalarValue>),
}
impl TryFrom<ast::WindowFrameBound> for WindowFrameBound {
type Error = DataFusionError;
fn try_from(value: ast::WindowFrameBound) -> Result<Self> {
let value_to_scalar = |v| -> Result<_> {
match v {
None => Ok(None),
Some(ast::Value::Number(v, _)) => match v.parse() {
Err(_) => Err(DataFusionError::Plan(format!("could not convert window frame bound '{}' to int64", v))),
Ok(v) => Ok(Some(ScalarValue::Int64(Some(v)))),
},
Some(ast::Value::Interval { value, leading_field, leading_precision, last_field, fractional_seconds_precision })
=> Ok(Some(interval_to_scalar(&value, &leading_field, &leading_precision, &last_field, &fractional_seconds_precision)?)),
Some(o) => Err(DataFusionError::Plan(format!("window frame bound must be a positive integer or an INTERVAL, got {}", o))),
}
};
match value {
ast::WindowFrameBound::Preceding(v) => {
Ok(Self::Preceding(value_to_scalar(v)?))
}
ast::WindowFrameBound::Following(v) => {
Ok(Self::Following(value_to_scalar(v)?))
}
ast::WindowFrameBound::CurrentRow => Ok(Self::CurrentRow),
}
}
}
fn interval_to_scalar(
value: &str,
leading_field: &Option<DateTimeField>,
leading_precision: &Option<u64>,
last_field: &Option<DateTimeField>,
fractional_seconds_precision: &Option<u64>,
) -> Result<ScalarValue> {
match SqlToRel::<ExecutionContextState>::sql_interval_to_literal(
value,
leading_field,
leading_precision,
last_field,
fractional_seconds_precision,
)? {
Expr::Literal(v) => Ok(v),
o => panic!("unexpected result of interval_to_literal: {:?}", o),
}
}
impl fmt::Display for WindowFrameBound {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self {
WindowFrameBound::CurrentRow => f.write_str("CURRENT ROW"),
WindowFrameBound::Preceding(None) => f.write_str("UNBOUNDED PRECEDING"),
WindowFrameBound::Following(None) => f.write_str("UNBOUNDED FOLLOWING"),
WindowFrameBound::Preceding(Some(n)) => write!(f, "{} PRECEDING", n),
WindowFrameBound::Following(Some(n)) => write!(f, "{} FOLLOWING", n),
}
}
}
impl WindowFrameBound {
pub fn logical_cmp(&self, other: &Self) -> Option<Ordering> {
use WindowFrameBound::{CurrentRow, Following, Preceding};
let ord = |v: &WindowFrameBound| match v {
Preceding(_) => 0,
CurrentRow => 1,
Following(_) => 2,
};
let lo = ord(self);
let ro = ord(other);
let o = lo.cmp(&ro);
if o != Ordering::Equal {
return Some(o);
}
let (l, r) = match (self, other) {
(Preceding(Some(l)), Preceding(Some(r))) => (r, l),
(Following(Some(l)), Following(Some(r))) => (l, r),
(CurrentRow, CurrentRow) => return Some(Ordering::Equal),
(Preceding(None), Preceding(None)) => return Some(Ordering::Equal),
(Preceding(None), Preceding(Some(_))) => return Some(Ordering::Less),
(Preceding(Some(_)), Preceding(None)) => return Some(Ordering::Greater),
(Following(None), Following(None)) => return Some(Ordering::Equal),
(Following(Some(_)), Following(None)) => return Some(Ordering::Less),
(Following(None), Following(Some(_))) => return Some(Ordering::Greater),
_ => panic!("unhandled bounds: {} and {}", self, other),
};
match (l, r) {
(ScalarValue::Int64(Some(l)), ScalarValue::Int64(Some(r))) => Some(l.cmp(r)),
(
ScalarValue::IntervalDayTime(Some(l)),
ScalarValue::IntervalDayTime(Some(r)),
) => Some(l.cmp(r)),
(
ScalarValue::IntervalYearMonth(Some(l)),
ScalarValue::IntervalYearMonth(Some(r)),
) => Some(l.cmp(r)),
_ => None,
}
}
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum WindowFrameUnits {
Rows,
Range,
Groups,
}
impl fmt::Display for WindowFrameUnits {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
f.write_str( | )
}
}
impl From<ast::WindowFrameUnits> for WindowFrameUnits {
fn from(value: ast::WindowFrameUnits) -> Self {
match value {
ast::WindowFrameUnits::Range => Self::Range,
ast::WindowFrameUnits::Groups => Self::Groups,
ast::WindowFrameUnits::Rows => Self::Rows,
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_window_frame_creation() -> Result<()> {
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Following(None),
end_bound: None,
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: start bound cannot be unbounded following".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(None),
end_bound: Some(ast::WindowFrameBound::Preceding(None)),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: end bound cannot be unbounded preceding".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(Some(1)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(2))),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: start bound (1 PRECEDING) cannot be larger than end bound (2 PRECEDING)".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(Some(2)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"This feature is not implemented: With WindowFrameUnits=RANGE, the bound cannot be 2 PRECEDING or FOLLOWING at the moment".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Rows,
start_bound: ast::WindowFrameBound::Preceding(Some(2)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),
};
let result = WindowFrame::try_from(window_frame);
assert!(result.is_ok());
Ok(())
}
#[test]
fn test_eq() {
assert_eq!(
WindowFrameBound::Preceding(Some(0)),
WindowFrameBound::CurrentRow
);
assert_eq!(
WindowFrameBound::CurrentRow,
WindowFrameBound::Following(Some(0))
);
assert_eq!(
WindowFrameBound::Following(Some(2)),
WindowFrameBound::Following(Some(2))
);
assert_eq!(
WindowFrameBound::Following(None),
WindowFrameBound::Following(None)
);
assert_eq!(
WindowFrameBound::Preceding(Some(2)),
WindowFrameBound::Preceding(Some(2))
);
assert_eq!(
WindowFrameBound::Preceding(None),
WindowFrameBound::Preceding(None)
);
}
#[test]
fn test_ord() {
assert!(WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::CurrentRow);
assert!(
WindowFrameBound::Preceding(Some(2)) < WindowFrameBound::Preceding(Some(1))
);
assert!(
WindowFrameBound::Preceding(Some(u64::MAX))
< WindowFrameBound::Preceding(Some(u64::MAX - 1))
);
assert!(
WindowFrameBound::Preceding(None)
< WindowFrameBound::Preceding(Some(1000000))
);
assert!(
WindowFrameBound::Preceding(None)
< WindowFrameBound::Preceding(Some(u64::MAX))
);
assert!(WindowFrameBound::Preceding(None) < WindowFrameBound::Following(Some(0)));
assert!(
WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::Following(Some(1))
);
assert!(WindowFrameBound::CurrentRow < WindowFrameBound::Following(Some(1)));
assert!(
WindowFrameBound::Following(Some(1)) < WindowFrameBound::Following(Some(2))
);
assert!(WindowFrameBound::Following(Some(2)) < WindowFrameBound::Following(None));
assert!(
WindowFrameBound::Following(Some(u64::MAX))
< WindowFrameBound::Following(None)
);
}
}
| match self {
WindowFrameUnits::Rows => "ROWS",
WindowFrameUnits::Range => "RANGE",
WindowFrameUnits::Groups => "GROUPS",
} | if_condition | [
{
"content": "fn handle<F, R>(args: &[ColumnarValue], op: F, name: &str) -> Result<ColumnarValue>\n\nwhere\n\n R: AsRef<[u8]>,\n\n F: Fn(&str) -> R,\n\n{\n\n match &args[0] {\n\n ColumnarValue::Array(a) => match a.data_type() {\n\n DataType::Utf8 => {\n\n Ok(ColumnarVal... |
Rust | src/runtime/thread/continuation.rs | jamesbornholt/shuttle | 24ffc0aa2a2c30059c263ea7e5516f90af1c828b |
#![allow(deprecated)]
use crate::runtime::execution::ExecutionState;
use generator::{Generator, Gn};
use scoped_tls::scoped_thread_local;
use std::cell::{Cell, RefCell};
use std::collections::VecDeque;
use std::ops::Deref;
use std::ops::DerefMut;
use std::rc::Rc;
scoped_thread_local! {
pub(crate) static CONTINUATION_POOL: ContinuationPool
}
pub(crate) struct Continuation {
generator: Generator<'static, ContinuationInput, ContinuationOutput>,
function: ContinuationFunction,
state: ContinuationState,
}
#[allow(clippy::type_complexity)]
#[derive(Clone)]
struct ContinuationFunction(Rc<Cell<Option<Box<dyn FnOnce() + Send>>>>);
unsafe impl Send for ContinuationFunction {}
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
enum ContinuationInput {
Resume,
Exit,
}
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
enum ContinuationOutput {
Yielded,
Finished,
Exited,
}
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
enum ContinuationState {
NotReady,
Ready,
Running,
}
impl Continuation {
pub fn new(stack_size: usize) -> Self {
let function = ContinuationFunction(Rc::new(Cell::new(None)));
let mut gen = {
let function = function.clone();
Gn::new_opt(stack_size, move || {
loop {
match generator::yield_(ContinuationOutput::Finished) {
None | Some(ContinuationInput::Exit) => break,
_ => (),
}
let f = function.0.take().expect("must have a function to run");
f();
}
ContinuationOutput::Exited
})
};
let ret = gen.resume().unwrap();
debug_assert_eq!(ret, ContinuationOutput::Finished);
Self {
generator: gen,
function,
state: ContinuationState::NotReady,
}
}
pub fn initialize(&mut self, fun: Box<dyn FnOnce() + Send>) {
debug_assert_eq!(
self.state,
ContinuationState::NotReady,
"shouldn't replace a function before it runs"
);
let old = self.function.0.replace(Some(fun));
debug_assert!(old.is_none(), "shouldn't replace a function before it runs");
self.state = ContinuationState::Ready;
}
pub fn resume(&mut self) -> bool {
debug_assert!(self.state == ContinuationState::Ready || self.state == ContinuationState::Running);
let ret = self.resume_with_input(ContinuationInput::Resume);
debug_assert_ne!(
ret,
ContinuationOutput::Exited,
"continuation should not exit if resumed from user code"
);
ret == ContinuationOutput::Finished
}
fn resume_with_input(&mut self, input: ContinuationInput) -> ContinuationOutput {
self.generator.set_para(input);
let ret = self.generator.resume().unwrap();
if ret == ContinuationOutput::Finished {
self.state = ContinuationState::NotReady;
}
ret
}
fn reusable(&self) -> bool {
self.state == ContinuationState::NotReady
}
}
impl Drop for Continuation {
fn drop(&mut self) {
if self.reusable() {
let ret = self.resume_with_input(ContinuationInput::Exit);
debug_assert_eq!(ret, ContinuationOutput::Exited);
}
}
}
pub(crate) struct ContinuationPool {
continuations: Rc<RefCell<VecDeque<Continuation>>>,
}
impl ContinuationPool {
pub fn new() -> Self {
Self {
continuations: Rc::new(RefCell::new(VecDeque::new())),
}
}
pub fn acquire(stack_size: usize) -> PooledContinuation {
if CONTINUATION_POOL.is_set() {
CONTINUATION_POOL.with(|p| p.acquire_inner(stack_size))
} else {
let p = Self::new();
p.acquire_inner(stack_size)
}
}
fn acquire_inner(&self, stack_size: usize) -> PooledContinuation {
let continuation = self
.continuations
.borrow_mut()
.pop_front()
.unwrap_or_else(move || Continuation::new(stack_size));
PooledContinuation {
continuation: Some(continuation),
queue: self.continuations.clone(),
}
}
}
impl Drop for ContinuationPool {
fn drop(&mut self) {
for c in self.continuations.borrow_mut().iter_mut() {
c.state = ContinuationState::Running;
}
}
}
pub(crate) struct PooledContinuation {
continuation: Option<Continuation>,
queue: Rc<RefCell<VecDeque<Continuation>>>,
}
impl Drop for PooledContinuation {
fn drop(&mut self) {
let c = self.continuation.take().unwrap();
if c.reusable() {
self.queue.borrow_mut().push_back(c);
}
}
}
impl Deref for PooledContinuation {
type Target = Continuation;
fn deref(&self) -> &Self::Target {
self.continuation.as_ref().unwrap()
}
}
impl DerefMut for PooledContinuation {
fn deref_mut(&mut self) -> &mut Self::Target {
self.continuation.as_mut().unwrap()
}
}
impl std::fmt::Debug for PooledContinuation {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
f.debug_struct("PooledContinuation").finish()
}
}
unsafe impl Send for PooledContinuation {}
pub(crate) fn switch() {
if ExecutionState::maybe_yield() {
let r = generator::yield_(ContinuationOutput::Yielded).unwrap();
assert!(matches!(r, ContinuationInput::Resume));
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::Config;
#[test]
fn reusable_continuation_drop() {
let pool = ContinuationPool::new();
let config: Config = Default::default();
let mut c = pool.acquire_inner(config.stack_size);
c.initialize(Box::new(|| {
let _ = 1 + 1;
}));
let r = c.resume();
assert!(r, "continuation only has one step");
drop(c);
assert_eq!(
pool.continuations.borrow().len(),
1,
"continuation should be reusable because the function finished"
);
let mut c = pool.acquire_inner(config.stack_size);
c.initialize(Box::new(|| {
generator::yield_with(ContinuationOutput::Yielded);
let _ = 1 + 1;
}));
let r = c.resume();
assert!(!r, "continuation yields once, shouldn't be finished yet");
drop(c);
assert_eq!(
pool.continuations.borrow().len(),
0,
"continuation should not be reusable because the function wasn't finished"
);
let c = pool.acquire_inner(config.stack_size);
drop(pool);
drop(c);
}
}
|
#![allow(deprecated)]
use crate::runtime::execution::ExecutionState;
use generator::{Generator, Gn};
use scoped_tls::scoped_thread_local;
use std::cell::{Cell, RefCell};
use std::collections::VecDeque;
use std::ops::Deref;
use std::ops::DerefMut;
use std::rc::Rc;
scoped_thread_local! {
pub(crate) static CONTINUATION_POOL: ContinuationPool
}
pub(crate) struct Continuation {
generator: Generator<'static, ContinuationInput, ContinuationOutput>,
function: ContinuationFunction,
state: ContinuationState,
}
#[allow(clippy::type_complexity)]
#[derive(Clone)]
struct ContinuationFunction(Rc<Cell<Option<Box<dyn FnOnce() + Send>>>>);
unsafe impl Send for ContinuationFunction {}
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
enum ContinuationInput {
Resume,
Exit,
}
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
enum ContinuationOutput {
Yielded,
Finished,
Exited,
}
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
enum ContinuationState {
NotReady,
Ready,
Running,
}
impl Continuation {
pub fn new(stack_size: usize) -> Self {
let function = ContinuationFunction(Rc::new(Cell::new(None)));
let mut gen = {
let function = function.clone();
Gn::new_opt(stack_size, move || {
loop {
match generator::yield_(ContinuationOutput::Finished) {
None | Some(ContinuationInput::Exit) => break,
_ => (),
}
let f = function.0.take().expect("must have a function to run");
f();
}
ContinuationOutput::Exited
})
};
let ret = gen.resume().unwrap();
debug_assert_eq!(ret, ContinuationOutput::Finished);
Self {
generator: gen,
function,
state: ContinuationState::NotReady,
}
}
|
pub fn resume(&mut self) -> bool {
debug_assert!(self.state == ContinuationState::Ready || self.state == ContinuationState::Running);
let ret = self.resume_with_input(ContinuationInput::Resume);
debug_assert_ne!(
ret,
ContinuationOutput::Exited,
"continuation should not exit if resumed from user code"
);
ret == ContinuationOutput::Finished
}
fn resume_with_input(&mut self, input: ContinuationInput) -> ContinuationOutput {
self.generator.set_para(input);
let ret = self.generator.resume().unwrap();
if ret == ContinuationOutput::Finished {
self.state = ContinuationState::NotReady;
}
ret
}
fn reusable(&self) -> bool {
self.state == ContinuationState::NotReady
}
}
impl Drop for Continuation {
fn drop(&mut self) {
if self.reusable() {
let ret = self.resume_with_input(ContinuationInput::Exit);
debug_assert_eq!(ret, ContinuationOutput::Exited);
}
}
}
pub(crate) struct ContinuationPool {
continuations: Rc<RefCell<VecDeque<Continuation>>>,
}
impl ContinuationPool {
pub fn new() -> Self {
Self {
continuations: Rc::new(RefCell::new(VecDeque::new())),
}
}
pub fn acquire(stack_size: usize) -> PooledContinuation {
if CONTINUATION_POOL.is_set() {
CONTINUATION_POOL.with(|p| p.acquire_inner(stack_size))
} else {
let p = Self::new();
p.acquire_inner(stack_size)
}
}
fn acquire_inner(&self, stack_size: usize) -> PooledContinuation {
let continuation = self
.continuations
.borrow_mut()
.pop_front()
.unwrap_or_else(move || Continuation::new(stack_size));
PooledContinuation {
continuation: Some(continuation),
queue: self.continuations.clone(),
}
}
}
impl Drop for ContinuationPool {
fn drop(&mut self) {
for c in self.continuations.borrow_mut().iter_mut() {
c.state = ContinuationState::Running;
}
}
}
pub(crate) struct PooledContinuation {
continuation: Option<Continuation>,
queue: Rc<RefCell<VecDeque<Continuation>>>,
}
impl Drop for PooledContinuation {
fn drop(&mut self) {
let c = self.continuation.take().unwrap();
if c.reusable() {
self.queue.borrow_mut().push_back(c);
}
}
}
impl Deref for PooledContinuation {
type Target = Continuation;
fn deref(&self) -> &Self::Target {
self.continuation.as_ref().unwrap()
}
}
impl DerefMut for PooledContinuation {
fn deref_mut(&mut self) -> &mut Self::Target {
self.continuation.as_mut().unwrap()
}
}
impl std::fmt::Debug for PooledContinuation {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
f.debug_struct("PooledContinuation").finish()
}
}
unsafe impl Send for PooledContinuation {}
pub(crate) fn switch() {
if ExecutionState::maybe_yield() {
let r = generator::yield_(ContinuationOutput::Yielded).unwrap();
assert!(matches!(r, ContinuationInput::Resume));
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::Config;
#[test]
fn reusable_continuation_drop() {
let pool = ContinuationPool::new();
let config: Config = Default::default();
let mut c = pool.acquire_inner(config.stack_size);
c.initialize(Box::new(|| {
let _ = 1 + 1;
}));
let r = c.resume();
assert!(r, "continuation only has one step");
drop(c);
assert_eq!(
pool.continuations.borrow().len(),
1,
"continuation should be reusable because the function finished"
);
let mut c = pool.acquire_inner(config.stack_size);
c.initialize(Box::new(|| {
generator::yield_with(ContinuationOutput::Yielded);
let _ = 1 + 1;
}));
let r = c.resume();
assert!(!r, "continuation yields once, shouldn't be finished yet");
drop(c);
assert_eq!(
pool.continuations.borrow().len(),
0,
"continuation should not be reusable because the function wasn't finished"
);
let c = pool.acquire_inner(config.stack_size);
drop(pool);
drop(c);
}
}
| pub fn initialize(&mut self, fun: Box<dyn FnOnce() + Send>) {
debug_assert_eq!(
self.state,
ContinuationState::NotReady,
"shouldn't replace a function before it runs"
);
let old = self.function.0.replace(Some(fun));
debug_assert!(old.is_none(), "shouldn't replace a function before it runs");
self.state = ContinuationState::Ready;
} | function_block-function_prefix_line | [
{
"content": "/// Run the given function under a randomized concurrency scheduler for some number of iterations.\n\n/// Each iteration will run a (potentially) different randomized schedule.\n\npub fn check_random<F>(f: F, iterations: usize)\n\nwhere\n\n F: Fn() + Send + Sync + 'static,\n\n{\n\n use crate... |
Rust | fyrox-sound/src/dsp/filters.rs | Libertus-Lab/Fyrox | c925304f42744659fd3a6be5c4a1a8609556033a |
use crate::dsp::DelayLine;
use fyrox_core::{
inspect::{Inspect, PropertyInfo},
visitor::{Visit, VisitResult, Visitor},
};
#[derive(Debug, Clone, Visit)]
pub struct OnePole {
a0: f32,
b1: f32,
last: f32,
}
impl Default for OnePole {
fn default() -> Self {
Self {
a0: 1.0,
b1: 0.0,
last: 0.0,
}
}
}
fn get_b1(fc: f32) -> f32 {
(-2.0 * std::f32::consts::PI * fc.min(1.0).max(0.0)).exp()
}
impl OnePole {
pub fn new(fc: f32) -> Self {
let b1 = get_b1(fc);
Self {
b1,
a0: 1.0 - b1,
last: 0.0,
}
}
pub fn set_fc(&mut self, fc: f32) {
self.b1 = get_b1(fc);
self.a0 = 1.0 - self.b1;
}
pub fn set_pole(&mut self, pole: f32) {
self.b1 = pole.min(1.0).max(0.0);
self.a0 = 1.0 - self.b1;
}
pub fn feed(&mut self, sample: f32) -> f32 {
let result = sample * self.a0 + self.last * self.b1;
self.last = result;
result
}
}
#[derive(Debug, Clone, Visit)]
pub struct LpfComb {
low_pass: OnePole,
delay_line: DelayLine,
feedback: f32,
}
impl Default for LpfComb {
fn default() -> Self {
Self {
low_pass: Default::default(),
delay_line: Default::default(),
feedback: 0.0,
}
}
}
impl LpfComb {
pub fn new(len: usize, fc: f32, feedback: f32) -> Self {
Self {
low_pass: OnePole::new(fc),
delay_line: DelayLine::new(len),
feedback,
}
}
pub fn set_feedback(&mut self, feedback: f32) {
self.feedback = feedback;
}
pub fn feedback(&self) -> f32 {
self.feedback
}
pub fn set_fc(&mut self, fc: f32) {
self.low_pass.set_fc(fc)
}
pub fn len(&self) -> usize {
self.delay_line.len()
}
pub fn feed(&mut self, sample: f32) -> f32 {
let result = sample + self.feedback * self.low_pass.feed(self.delay_line.last());
self.delay_line.feed(result);
result
}
}
#[derive(Debug, Clone, Visit)]
pub struct AllPass {
delay_line: DelayLine,
gain: f32,
}
impl Default for AllPass {
fn default() -> Self {
Self {
delay_line: Default::default(),
gain: 1.0,
}
}
}
impl AllPass {
pub fn new(len: usize, gain: f32) -> Self {
Self {
delay_line: DelayLine::new(len),
gain,
}
}
pub fn set_gain(&mut self, gain: f32) {
self.gain = gain;
}
pub fn len(&self) -> usize {
self.delay_line.len()
}
pub fn feed(&mut self, sample: f32) -> f32 {
let delay_line_output = self.delay_line.last();
let am_arm = -self.gain * delay_line_output;
let sum_left = sample + am_arm;
let b0_arm = sum_left * self.gain;
self.delay_line.feed(sum_left);
delay_line_output + b0_arm
}
}
pub enum BiquadKind {
LowPass,
HighPass,
BandPass,
AllPass,
LowShelf,
HighShelf,
}
#[derive(Clone, Debug, Inspect, Visit)]
pub struct Biquad {
pub b0: f32,
pub b1: f32,
pub b2: f32,
pub a1: f32,
pub a2: f32,
#[inspect(skip)]
prev1: f32,
#[inspect(skip)]
prev2: f32,
}
impl Biquad {
pub fn new(kind: BiquadKind, fc: f32, gain: f32, quality: f32) -> Self {
let mut filter = Self::default();
filter.tune(kind, fc, gain, quality);
filter
}
pub fn from_coefficients(b0: f32, b1: f32, b2: f32, a1: f32, a2: f32) -> Self {
Self {
b0,
b1,
b2,
a1,
a2,
prev1: 0.0,
prev2: 0.0,
}
}
pub fn tune(&mut self, kind: BiquadKind, fc: f32, gain: f32, quality: f32) {
let w0 = 2.0 * std::f32::consts::PI * fc;
let w0_cos = w0.cos();
let w0_sin = w0.sin();
let alpha = w0_sin / (2.0 * quality);
let (b0, b1, b2, a0, a1, a2) = match kind {
BiquadKind::LowPass => {
let b0 = (1.0 - w0_cos) / 2.0;
let b1 = 1.0 - w0_cos;
let b2 = b0;
let a0 = 1.0 + alpha;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::HighPass => {
let b0 = (1.0 + w0_cos) / 2.0;
let b1 = -(1.0 + w0_cos);
let b2 = b0;
let a0 = 1.0 + alpha;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::BandPass => {
let b0 = w0_sin / 2.0;
let b1 = 0.0;
let b2 = -b0;
let a0 = 1.0 + alpha;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::AllPass => {
let b0 = 1.0 - alpha;
let b1 = -2.0 * w0_cos;
let b2 = 1.0 + alpha;
let a0 = b2;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::LowShelf => {
let sq = 2.0 * gain.sqrt() * alpha;
let b0 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos + sq);
let b1 = 2.0 * gain * ((gain - 1.0) - (gain + 1.0) * w0_cos);
let b2 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos - sq);
let a0 = (gain + 1.0) + (gain - 1.0) * w0_cos + sq;
let a1 = -2.0 * ((gain - 1.0) + (gain + 1.0) * w0_cos);
let a2 = (gain + 1.0) + (gain - 1.0) * w0_cos - sq;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::HighShelf => {
let sq = 2.0 * gain.sqrt() * alpha;
let b0 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos + sq);
let b1 = -2.0 * gain * ((gain - 1.0) + (gain + 1.0) * w0_cos);
let b2 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos - sq);
let a0 = (gain + 1.0) - (gain - 1.0) * w0_cos + sq;
let a1 = 2.0 * ((gain - 1.0) - (gain + 1.0) * w0_cos);
let a2 = (gain + 1.0) - (gain - 1.0) * w0_cos - sq;
(b0, b1, b2, a0, a1, a2)
}
};
self.b0 = b0 / a0;
self.b1 = b1 / a0;
self.b2 = b2 / a0;
self.a1 = a1 / a0;
self.a2 = a2 / a0;
}
pub fn feed(&mut self, sample: f32) -> f32 {
let result = sample * self.b0 + self.prev1;
self.prev1 = sample * self.b1 - result * self.a1 + self.prev2;
self.prev2 = sample * self.b2 - result * self.a2;
result
}
}
impl Default for Biquad {
fn default() -> Self {
Self {
b0: 1.0,
b1: 0.0,
b2: 0.0,
a1: 0.0,
a2: 0.0,
prev1: 0.0,
prev2: 0.0,
}
}
}
|
use crate::dsp::DelayLine;
use fyrox_core::{
inspect::{Inspect, PropertyInfo},
visitor::{Visit, VisitResult, Visitor},
};
#[derive(Debug, Clone, Visit)]
pub struct OnePole {
a0: f32,
b1: f32,
last: f32,
}
impl Default for OnePole {
fn default() -> Self {
Self {
a0: 1.0,
b1: 0.0,
last: 0.0,
}
}
}
fn get_b1(fc: f32) -> f32 {
(-2.0 * std::f32::consts::PI * fc.min(1.0).max(0.0)).exp()
}
impl OnePole {
pub fn new(fc: f32) -> Self {
let b1 = get_b1(fc);
Self {
b1,
a0: 1.0 - b1,
last: 0.0,
}
}
pub fn set_fc(&mut self, fc: f32) {
self.b1 = get_b1(fc);
self.a0 = 1.0 - self.b1;
}
pub fn set_pole(&mut self, pole: f32) {
self.b1 = pole.min(1.0).max(0.0);
self.a0 = 1.0 - self.b1;
}
pub fn feed(&mut self, sample: f32) -> f32 {
let result = sample * self.a0 + self.last * self.b1;
self.last = result;
result
}
}
#[derive(Debug, Clone, Visit)]
pub struct LpfComb {
low_pass: OnePole,
delay_line: DelayLine,
feedback: f32,
}
impl Default for LpfComb {
fn default() -> Self {
Self {
low_pass: Default::default(),
delay_line: Default::default(),
feedback: 0.0,
}
}
}
impl LpfComb {
pub fn new(len: usize, fc: f32, feedback: f32) -> Self {
Self {
low_pass: OnePole::new(fc),
delay_line: DelayLine::new(len),
feedback,
}
}
pub fn set_feedback(&mut self, feedback: f32) {
self.feedback = feedback;
}
pub fn feedback(&self) -> f32 {
self.feedback
}
pub fn set_fc(&mut self, fc: f32) {
self.low_pass.set_fc(fc)
}
pub fn len(&self) -> usize {
self.delay_line.len()
}
pub fn feed(&mut self, sample: f32) -> f32 {
let result = sample + self.feedback * self.low_pass.feed(self.delay_line.last());
self.delay_line.feed(result);
result
}
}
#[derive(Debug, Clone, Visit)]
pub struct AllPass {
delay_line: DelayLine,
gain: f32,
}
impl Default for AllPass {
fn default() -> Self {
Self {
delay_line: Default::default(),
gain: 1.0,
}
}
}
impl AllPass {
pub fn new(len: usize, gain: f32) -> Self {
Self {
delay_line: DelayLine::new(len),
gain,
}
}
pub fn set_gain(&mut self, gain: f32) {
self.gain = gain;
}
pub fn len(&self) -> usize {
self.delay_line.len()
}
pub fn feed(&mut self, sample: f32) -> f32 {
let delay_line_output = self.delay_line.last();
let am_arm = -self.gain * delay_line_output;
let sum_left = sample + am_arm;
let b0_arm = sum_left * self.gain;
self.delay_line.feed(sum_left);
delay_line_output + b0_arm
}
}
pub enum BiquadKind {
LowPass,
HighPass,
BandPass,
AllPass,
LowShelf,
HighShelf,
}
#[derive(Clone, Debug, Inspect, Visit)]
pub struct Biquad {
pub b0: f32,
pub b1: f32,
pub b2: f32,
pub a1: f32,
pub a2: f32,
#[inspect(skip)]
prev1: f32,
#[inspect(skip)]
prev2: f32,
}
impl Biquad {
pub fn new(kind: BiquadKind, fc: f32, gain: f32, quality: f32) -> Self {
let mut filter = Self::default();
filter.tune(kind, fc, gain, quality);
filter
}
pub fn from_coefficients(b0: f32, b1: f32, b2: f32, a1: f32, a2: f32) -> Self {
Self {
b0,
b1,
b2,
a1,
a2,
prev1: 0.0,
prev2: 0.0,
}
}
pub fn tune(&mut self, kind: BiquadKind, fc: f32, gain: f32, quality: f32) {
let w0 = 2.0 * std::f32::consts::PI * fc;
let w0_cos = w0.cos();
let w0_sin = w0.sin();
let alpha = w0_sin / (2.0 * quality);
let (b0, b1, b2, a0, a1, a2) = match kind {
BiquadKind::LowPass => {
let b0 = (1.0 - w0_cos) / 2.0;
let b1 = 1.0 - w0_cos;
let b2 = b0;
let a0 = 1.0 + alpha;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::HighPass => {
let b0 = (1.0 + w0_cos) / 2.0;
let b1 = -(1.0 + w0_cos);
let b2 = b0;
let a0 = 1.0 + alpha;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::BandPass => {
let b0 = w0_sin / 2.0;
let b1 = 0.0;
let b2 = -b0;
let a0 = 1.0 + alpha;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::AllPass => {
let b0 = 1.0 - alpha;
let b1 = -2.0 * w0_cos;
let b2 = 1.0 + alpha;
let a0 = b2;
let a1 = -2.0 * w0_cos;
let a2 = 1.0 - alpha;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::LowShelf => {
let sq = 2.0 * gain.sqrt() * alpha;
let b0 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos + sq);
let b1 = 2.0 * gain * ((gain - 1.0) - (gain + 1.0) * w0_cos);
let b2 = gain * ((gain + 1.0) - (gain - 1.0) * w0_cos - sq);
let a0 = (gain + 1.0) + (gain - 1.0) * w0_cos + sq;
let a1 = -2.0 * ((gain - 1.0) + (gain + 1.0) * w0_cos);
let a2 = (gain + 1.0) + (gain - 1.0) * w0_cos - sq;
(b0, b1, b2, a0, a1, a2)
}
BiquadKind::HighShelf => {
let sq = 2.0 * gain.sqrt() * alpha;
let b0 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos + sq);
let b1 = -2.0 * gain * ((gain - 1.0) + (gain + 1.0) * w0_cos);
let b2 = gain * ((gain + 1.0) + (gain - 1.0) * w0_cos - sq);
let a0 = (gain + 1.0) - (gain - 1.0) * w0_cos + sq;
let a1 = 2.0 * ((gain - 1.0) - (gain + 1.0) * w0_cos);
let a2 = (gain + 1.0) - (gain - 1.0) * w0_cos - sq;
(b0, b1, b2, a0, a1, a2)
}
};
self.b0 = b0 / a0;
self.b1 = b1 / a0;
self.b2 = b2 / a0;
self.a1 = a1 / a0;
self.a2 = a2 / a0;
}
pub fn feed(&mut self, sample: f32) -> f32 {
let result = sample * self.b0 + self.prev1;
self.prev1 = sample * self.b1 - result * self.a1 + self.prev2;
self.prev2 = sample * self.b2 - result * self.a2;
result
}
}
impl Default for Biquad {
|
}
| fn default() -> Self {
Self {
b0: 1.0,
b1: 0.0,
b2: 0.0,
a1: 0.0,
a2: 0.0,
prev1: 0.0,
prev2: 0.0,
}
} | function_block-full_function | [
{
"content": "fn write_node(name: &str, node: &mut Node, visitor: &mut Visitor) -> VisitResult {\n\n let mut region = visitor.enter_region(name)?;\n\n\n\n let mut id = node.id();\n\n id.visit(\"TypeUuid\", &mut region)?;\n\n\n\n node.visit(\"NodeData\", &mut region)?;\n\n\n\n Ok(())\n\n}\n\n\n\ni... |
Rust | vm-bindings/build_support/builder.rs | feenkcom/gtoolkit-vm | 0647fe53203d614d776cb5af4f228cddc4a5f29d | use file_matcher::{FileNamed, OneEntry, OneEntryCopier};
use std::fmt::Debug;
use std::path::{Path, PathBuf};
use std::{env, fmt, fs};
const VM_CLIENT_VMMAKER_VM_VAR: &str = "VM_CLIENT_VMMAKER";
const VM_CLIENT_VMMAKER_IMAGE_VAR: &str = "VM_CLIENT_VMMAKER_IMAGE";
pub trait Builder: Debug {
fn is_compiled(&self) -> bool {
self.vm_binary().exists()
}
fn profile(&self) -> String {
std::env::var("PROFILE").unwrap()
}
fn is_debug(&self) -> bool {
self.profile() == "debug"
}
fn ensure_build_tools(&self) {}
fn vmmaker_vm(&self) -> Option<PathBuf> {
std::env::var(VM_CLIENT_VMMAKER_VM_VAR).map_or(None, |path| {
let path = Path::new(&path);
if path.exists() {
Some(path.to_path_buf())
} else {
panic!(
"Specified {} does not exist: {}",
VM_CLIENT_VMMAKER_VM_VAR,
path.display()
);
}
})
}
fn vmmaker_image(&self) -> Option<PathBuf> {
std::env::var(VM_CLIENT_VMMAKER_IMAGE_VAR).map_or(None, |path| {
let path = Path::new(&path);
if path.exists() {
Some(path.to_path_buf())
} else {
panic!(
"Specified {} does not exist: {}",
VM_CLIENT_VMMAKER_IMAGE_VAR,
path.display()
);
}
})
}
fn output_directory(&self) -> PathBuf {
Path::new(env::var("OUT_DIR").unwrap().as_str()).to_path_buf()
}
fn vm_binary(&self) -> PathBuf;
fn vm_sources_directory(&self) -> PathBuf {
std::env::current_dir()
.unwrap()
.parent()
.unwrap()
.to_path_buf()
.join("opensmalltalk-vm")
}
fn compiled_libraries_directory(&self) -> PathBuf;
fn exported_libraries_directory(&self) -> PathBuf {
let target = std::env::var("CARGO_TARGET");
let mut path = PathBuf::new()
.join("..")
.join(std::env::var("CARGO_TARGET_DIR").unwrap_or("target".to_string()));
if let Ok(target) = target {
path = path.join(target);
}
path.join(self.profile()).join("shared_libraries")
}
fn compile_sources(&self);
fn squeak_include_directory(&self) -> PathBuf {
self.vm_sources_directory()
.join("extracted")
.join("vm")
.join("include")
}
fn common_include_directory(&self) -> PathBuf {
self.squeak_include_directory().join("common")
}
fn platform_include_directory(&self) -> PathBuf;
fn generated_config_directory(&self) -> PathBuf {
self.output_directory()
.join("build")
.join("build")
.join("include")
.join("pharovm")
}
fn generated_include_directory(&self) -> PathBuf {
self.output_directory()
.join("build")
.join("generated")
.join("64")
.join("vm")
.join("include")
}
fn generate_bindings(&self) {
let include_dir = self.vm_sources_directory().join("include");
let generated_vm_include_dir = self.generated_include_directory();
assert!(
generated_vm_include_dir.exists(),
"Generated vm include directory must exist: {:?}",
generated_vm_include_dir.display()
);
let generated_config_directory = self.generated_config_directory();
assert!(
generated_config_directory.exists(),
"Generated config.h directory must exist: {:?}",
generated_config_directory.display()
);
let bindings = bindgen::Builder::default()
.whitelist_function("vm_.*")
.whitelist_function("free")
.header(
include_dir
.join("pharovm")
.join("pharoClient.h")
.display()
.to_string(),
)
.clang_arg(format!("-I{}", &include_dir.display()))
.clang_arg(format!("-I{}", &include_dir.join("pharovm").display()))
.clang_arg(format!("-I{}", generated_config_directory.display()))
.clang_arg(format!("-I{}", generated_vm_include_dir.display()))
.clang_arg(format!("-I{}", self.common_include_directory().display()))
.clang_arg(format!("-I{}", self.platform_include_directory().display()))
.clang_arg("-DLSB_FIRST=1")
.parse_callbacks(Box::new(bindgen::CargoCallbacks))
.generate()
.expect("Unable to generate bindings");
bindings
.write_to_file(self.output_directory().join("bindings.rs"))
.expect("Couldn't write bindings!");
}
fn link_libraries(&self);
fn export_shared_libraries(&self) {
if !self.exported_libraries_directory().exists() {
fs::create_dir_all(self.exported_libraries_directory()).unwrap();
}
for shared_library in self.shared_libraries_to_export() {
let target = self.exported_libraries_directory();
match shared_library.copy(&target) {
Ok(_) => {}
Err(error) => {
panic!(
"Could not copy {:?} to {} due to {}",
&shared_library,
&target.display(),
error
)
}
}
}
}
fn shared_libraries_to_export(&self) -> Vec<OneEntry>;
fn print_directories(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_map()
.entry(&"is_compiled".to_string(), &self.is_compiled())
.entry(
&"output_directory".to_string(),
&self.output_directory().display(),
)
.entry(&"vm_binary".to_string(), &self.vm_binary().display())
.entry(
&"vm_sources_directory".to_string(),
&self.vm_sources_directory().display(),
)
.entry(
&"compiled_libraries_directory".to_string(),
&self.compiled_libraries_directory().display(),
)
.entry(
&"exported_libraries_directory".to_string(),
&self.exported_libraries_directory().display(),
)
.finish()
}
fn boxed(self) -> Box<dyn Builder>;
fn filenames_from_libdir(&self, filenames: Vec<&str>, libdir: PathBuf) -> Vec<OneEntry> {
filenames
.into_iter()
.map(FileNamed::exact)
.map(|each| each.within(&libdir))
.collect()
}
}
| use file_matcher::{FileNamed, OneEntry, OneEntryCopier};
use std::fmt::Debug;
use std::path::{Path, PathBuf};
use std::{env, fmt, fs};
const VM_CLIENT_VMMAKER_VM_VAR: &str = "VM_CLIENT_VMMAKER";
const VM_CLIENT_VMMAKER_IMAGE_VAR: &str = "VM_CLIENT_VMMAKER_IMAGE";
pub trait Builder: Debug {
fn is_compiled(&self) -> bool {
self.vm_binary().exists()
}
fn profile(&self) -> String {
std::env::var("PROFILE").un | (), &self.is_compiled())
.entry(
&"output_directory".to_string(),
&self.output_directory().display(),
)
.entry(&"vm_binary".to_string(), &self.vm_binary().display())
.entry(
&"vm_sources_directory".to_string(),
&self.vm_sources_directory().display(),
)
.entry(
&"compiled_libraries_directory".to_string(),
&self.compiled_libraries_directory().display(),
)
.entry(
&"exported_libraries_directory".to_string(),
&self.exported_libraries_directory().display(),
)
.finish()
}
fn boxed(self) -> Box<dyn Builder>;
fn filenames_from_libdir(&self, filenames: Vec<&str>, libdir: PathBuf) -> Vec<OneEntry> {
filenames
.into_iter()
.map(FileNamed::exact)
.map(|each| each.within(&libdir))
.collect()
}
}
| wrap()
}
fn is_debug(&self) -> bool {
self.profile() == "debug"
}
fn ensure_build_tools(&self) {}
fn vmmaker_vm(&self) -> Option<PathBuf> {
std::env::var(VM_CLIENT_VMMAKER_VM_VAR).map_or(None, |path| {
let path = Path::new(&path);
if path.exists() {
Some(path.to_path_buf())
} else {
panic!(
"Specified {} does not exist: {}",
VM_CLIENT_VMMAKER_VM_VAR,
path.display()
);
}
})
}
fn vmmaker_image(&self) -> Option<PathBuf> {
std::env::var(VM_CLIENT_VMMAKER_IMAGE_VAR).map_or(None, |path| {
let path = Path::new(&path);
if path.exists() {
Some(path.to_path_buf())
} else {
panic!(
"Specified {} does not exist: {}",
VM_CLIENT_VMMAKER_IMAGE_VAR,
path.display()
);
}
})
}
fn output_directory(&self) -> PathBuf {
Path::new(env::var("OUT_DIR").unwrap().as_str()).to_path_buf()
}
fn vm_binary(&self) -> PathBuf;
fn vm_sources_directory(&self) -> PathBuf {
std::env::current_dir()
.unwrap()
.parent()
.unwrap()
.to_path_buf()
.join("opensmalltalk-vm")
}
fn compiled_libraries_directory(&self) -> PathBuf;
fn exported_libraries_directory(&self) -> PathBuf {
let target = std::env::var("CARGO_TARGET");
let mut path = PathBuf::new()
.join("..")
.join(std::env::var("CARGO_TARGET_DIR").unwrap_or("target".to_string()));
if let Ok(target) = target {
path = path.join(target);
}
path.join(self.profile()).join("shared_libraries")
}
fn compile_sources(&self);
fn squeak_include_directory(&self) -> PathBuf {
self.vm_sources_directory()
.join("extracted")
.join("vm")
.join("include")
}
fn common_include_directory(&self) -> PathBuf {
self.squeak_include_directory().join("common")
}
fn platform_include_directory(&self) -> PathBuf;
fn generated_config_directory(&self) -> PathBuf {
self.output_directory()
.join("build")
.join("build")
.join("include")
.join("pharovm")
}
fn generated_include_directory(&self) -> PathBuf {
self.output_directory()
.join("build")
.join("generated")
.join("64")
.join("vm")
.join("include")
}
fn generate_bindings(&self) {
let include_dir = self.vm_sources_directory().join("include");
let generated_vm_include_dir = self.generated_include_directory();
assert!(
generated_vm_include_dir.exists(),
"Generated vm include directory must exist: {:?}",
generated_vm_include_dir.display()
);
let generated_config_directory = self.generated_config_directory();
assert!(
generated_config_directory.exists(),
"Generated config.h directory must exist: {:?}",
generated_config_directory.display()
);
let bindings = bindgen::Builder::default()
.whitelist_function("vm_.*")
.whitelist_function("free")
.header(
include_dir
.join("pharovm")
.join("pharoClient.h")
.display()
.to_string(),
)
.clang_arg(format!("-I{}", &include_dir.display()))
.clang_arg(format!("-I{}", &include_dir.join("pharovm").display()))
.clang_arg(format!("-I{}", generated_config_directory.display()))
.clang_arg(format!("-I{}", generated_vm_include_dir.display()))
.clang_arg(format!("-I{}", self.common_include_directory().display()))
.clang_arg(format!("-I{}", self.platform_include_directory().display()))
.clang_arg("-DLSB_FIRST=1")
.parse_callbacks(Box::new(bindgen::CargoCallbacks))
.generate()
.expect("Unable to generate bindings");
bindings
.write_to_file(self.output_directory().join("bindings.rs"))
.expect("Couldn't write bindings!");
}
fn link_libraries(&self);
fn export_shared_libraries(&self) {
if !self.exported_libraries_directory().exists() {
fs::create_dir_all(self.exported_libraries_directory()).unwrap();
}
for shared_library in self.shared_libraries_to_export() {
let target = self.exported_libraries_directory();
match shared_library.copy(&target) {
Ok(_) => {}
Err(error) => {
panic!(
"Could not copy {:?} to {} due to {}",
&shared_library,
&target.display(),
error
)
}
}
}
}
fn shared_libraries_to_export(&self) -> Vec<OneEntry>;
fn print_directories(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_map()
.entry(&"is_compiled".to_string | random | [
{
"content": "#[no_mangle]\n\npub fn gtoolkit_vm_is_on_worker_thread(gt_vm_ptr: *const Mutex<Option<GToolkitVM>>) -> bool {\n\n gt_vm_ptr.with(|| false, |gt_vm| gt_vm.is_on_worker_thread())\n\n}\n\n\n",
"file_path": "experimental/src/lib.rs",
"rank": 1,
"score": 118262.39327501913
},
{
"c... |
Rust | src/mock.rs | fossabot/client-rust | 4540c1cdfa9a4d17ac15a1242daf32ef53a17133 |
use crate::{
pd::{PdClient, PdRpcClient, RetryClient},
request::DispatchHook,
Config, Error, Key, Result, Timestamp,
};
use fail::fail_point;
use futures::future::{ready, BoxFuture, FutureExt};
use grpcio::CallOption;
use kvproto::{errorpb, kvrpcpb, metapb, tikvpb::TikvClient};
use std::{future::Future, sync::Arc, time::Duration};
use tikv_client_store::{HasError, KvClient, KvConnect, Region, RegionId, Store};
pub async fn pd_rpc_client() -> PdRpcClient<MockKvConnect, MockCluster> {
let config = Config::default();
PdRpcClient::new(
&config,
|_, _| MockKvConnect,
|e, sm| {
futures::future::ok(RetryClient::new_with_cluster(
e,
sm,
config.timeout,
MockCluster,
))
},
)
.await
.unwrap()
}
#[derive(Clone, Eq, PartialEq, Debug)]
pub struct MockKvClient {
addr: String,
}
pub struct MockKvConnect;
pub struct MockCluster;
pub struct MockPdClient;
impl KvClient for MockKvClient {
fn dispatch<Resp, RpcFuture>(
&self,
_request_name: &'static str,
_fut: grpcio::Result<RpcFuture>,
) -> BoxFuture<'static, Result<Resp>>
where
RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,
Resp: HasError + Sized + Clone + Send + 'static,
RpcFuture: Send + 'static,
{
unimplemented!()
}
fn get_rpc_client(&self) -> Arc<TikvClient> {
unimplemented!()
}
}
impl KvConnect for MockKvConnect {
type KvClient = MockKvClient;
fn connect(&self, address: &str) -> Result<Self::KvClient> {
Ok(MockKvClient {
addr: address.to_owned(),
})
}
}
impl MockPdClient {
pub fn region1() -> Region {
let mut region = Region::default();
region.region.id = 1;
region.region.set_start_key(vec![0]);
region.region.set_end_key(vec![10]);
let mut leader = metapb::Peer::default();
leader.store_id = 41;
region.leader = Some(leader);
region
}
pub fn region2() -> Region {
let mut region = Region::default();
region.region.id = 2;
region.region.set_start_key(vec![10]);
region.region.set_end_key(vec![250, 250]);
let mut leader = metapb::Peer::default();
leader.store_id = 42;
region.leader = Some(leader);
region
}
}
impl PdClient for MockPdClient {
type KvClient = MockKvClient;
fn map_region_to_store(
self: Arc<Self>,
region: Region,
) -> BoxFuture<'static, Result<Store<Self::KvClient>>> {
Box::pin(ready(Ok(Store::new(
region,
MockKvClient {
addr: String::new(),
},
Duration::from_secs(60),
))))
}
fn region_for_key(&self, key: &Key) -> BoxFuture<'static, Result<Region>> {
let bytes: &[_] = key.into();
let region = if bytes.is_empty() || bytes[0] < 10 {
Self::region1()
} else {
Self::region2()
};
Box::pin(ready(Ok(region)))
}
fn region_for_id(&self, id: RegionId) -> BoxFuture<'static, Result<Region>> {
let result = match id {
1 => Ok(Self::region1()),
2 => Ok(Self::region2()),
_ => Err(Error::region_not_found(id)),
};
Box::pin(ready(result))
}
fn get_timestamp(self: Arc<Self>) -> BoxFuture<'static, Result<Timestamp>> {
unimplemented!()
}
}
impl DispatchHook for kvrpcpb::ResolveLockRequest {
fn dispatch_hook(
&self,
_opt: CallOption,
) -> Option<BoxFuture<'static, Result<kvrpcpb::ResolveLockResponse>>> {
fail_point!("region-error", |_| {
let mut resp = kvrpcpb::ResolveLockResponse::default();
resp.region_error = Some(errorpb::Error::default());
Some(ready(Ok(resp)).boxed())
});
Some(ready(Ok(kvrpcpb::ResolveLockResponse::default())).boxed())
}
}
|
use crate::{
pd::{PdClient, PdRpcClient, RetryClient},
request::DispatchHook,
Config, Error, Key, Result, Timestamp,
};
use fail::fail_point;
use futures::future::{ready, BoxFuture, FutureExt};
use grpcio::CallOption;
use kvproto::{errorpb, kvrpcpb, metapb, tikvpb::TikvClient};
use std::{future::Future, sync::Arc, time::Duration};
use tikv_client_store::{HasError, KvClient, KvConnect, Region, RegionId, Store};
pub async fn pd_rpc_client() -> PdRpcClient<MockKvConnect, MockCluster> {
let config = Config::default();
PdRpcClient::new(
&config,
|_, _| MockKvConnect,
|e, sm| {
futures::future::ok(RetryClient::new_with_cluster(
e,
sm,
config.timeout,
MockCluster,
))
},
)
.await
.unwrap()
}
#[derive(Clone, Eq, PartialEq, Debug)]
pub struct MockKvClient {
addr: String,
}
pub struct MockKvConnect;
pub struct MockCluster;
pub struct MockPdClient;
impl KvClient for MockKvClient {
fn dispatch<Resp, RpcFuture>(
&self,
_request_name: &'st | _ => Err(Error::region_not_found(id)),
};
Box::pin(ready(result))
}
fn get_timestamp(self: Arc<Self>) -> BoxFuture<'static, Result<Timestamp>> {
unimplemented!()
}
}
impl DispatchHook for kvrpcpb::ResolveLockRequest {
fn dispatch_hook(
&self,
_opt: CallOption,
) -> Option<BoxFuture<'static, Result<kvrpcpb::ResolveLockResponse>>> {
fail_point!("region-error", |_| {
let mut resp = kvrpcpb::ResolveLockResponse::default();
resp.region_error = Some(errorpb::Error::default());
Some(ready(Ok(resp)).boxed())
});
Some(ready(Ok(kvrpcpb::ResolveLockResponse::default())).boxed())
}
}
| atic str,
_fut: grpcio::Result<RpcFuture>,
) -> BoxFuture<'static, Result<Resp>>
where
RpcFuture: Future<Output = std::result::Result<Resp, ::grpcio::Error>>,
Resp: HasError + Sized + Clone + Send + 'static,
RpcFuture: Send + 'static,
{
unimplemented!()
}
fn get_rpc_client(&self) -> Arc<TikvClient> {
unimplemented!()
}
}
impl KvConnect for MockKvConnect {
type KvClient = MockKvClient;
fn connect(&self, address: &str) -> Result<Self::KvClient> {
Ok(MockKvClient {
addr: address.to_owned(),
})
}
}
impl MockPdClient {
pub fn region1() -> Region {
let mut region = Region::default();
region.region.id = 1;
region.region.set_start_key(vec![0]);
region.region.set_end_key(vec![10]);
let mut leader = metapb::Peer::default();
leader.store_id = 41;
region.leader = Some(leader);
region
}
pub fn region2() -> Region {
let mut region = Region::default();
region.region.id = 2;
region.region.set_start_key(vec![10]);
region.region.set_end_key(vec![250, 250]);
let mut leader = metapb::Peer::default();
leader.store_id = 42;
region.leader = Some(leader);
region
}
}
impl PdClient for MockPdClient {
type KvClient = MockKvClient;
fn map_region_to_store(
self: Arc<Self>,
region: Region,
) -> BoxFuture<'static, Result<Store<Self::KvClient>>> {
Box::pin(ready(Ok(Store::new(
region,
MockKvClient {
addr: String::new(),
},
Duration::from_secs(60),
))))
}
fn region_for_key(&self, key: &Key) -> BoxFuture<'static, Result<Region>> {
let bytes: &[_] = key.into();
let region = if bytes.is_empty() || bytes[0] < 10 {
Self::region1()
} else {
Self::region2()
};
Box::pin(ready(Ok(region)))
}
fn region_for_id(&self, id: RegionId) -> BoxFuture<'static, Result<Region>> {
let result = match id {
1 => Ok(Self::region1()),
2 => Ok(Self::region2()),
| random | [
{
"content": "pub fn new_mvcc_get_request(key: impl Into<Key>, timestamp: Timestamp) -> kvrpcpb::GetRequest {\n\n let mut req = kvrpcpb::GetRequest::default();\n\n req.set_key(key.into().into());\n\n req.set_version(timestamp.version());\n\n req\n\n}\n\n\n\nimpl KvRequest for kvrpcpb::BatchGetReques... |
Rust | 2021/05_hydrothermal-venture/src/main.rs | macisamuele/adventofcode | 34d8994493446f951afc4584d6da7f83e85fd8f8 | use helpers::input_lines;
use scan_fmt::scan_fmt;
use std::collections::HashMap;
use std::str::FromStr;
const INPUT: &str = include_str!("../input.txt");
#[derive(Debug, PartialEq, Eq, Hash)]
struct Point {
x: usize,
y: usize,
}
#[derive(Debug, PartialEq, Eq, Hash)]
struct Line {
point1: Point,
point2: Point,
}
impl FromStr for Line {
type Err = anyhow::Error;
fn from_str(line: &str) -> Result<Self, Self::Err> {
let (x1, y1, x2, y2) = scan_fmt!(line, "{},{} -> {},{}", usize, usize, usize, usize)?;
Ok(Self {
point1: Point { x: x1, y: y1 },
point2: Point { x: x2, y: y2 },
})
}
}
impl Line {
fn to_horizontal_points(&self) -> impl Iterator<Item = Point> {
let y: usize = self.point1.y;
let (min_x, max_x): (usize, usize) = if self.point1.y == self.point2.y {
if self.point1.x < self.point2.x {
(self.point1.x, self.point2.x + 1)
} else {
(self.point2.x, self.point1.x + 1)
}
} else {
(0, 0)
};
(min_x..max_x).map(move |x| Point { x, y })
}
fn to_vertical_points(&self) -> impl Iterator<Item = Point> {
let x: usize = self.point1.x;
let (min_y, max_y): (usize, usize) = if self.point1.x == self.point2.x {
if self.point1.y < self.point2.y {
(self.point1.y, self.point2.y + 1)
} else {
(self.point2.y, self.point1.y + 1)
}
} else {
(0, 0)
};
(min_y..max_y).map(move |y| Point { x, y })
}
fn to_diagonal_points(&self) -> impl Iterator<Item = Point> {
let (min_x, max_x): (usize, usize) = if self.point1.x < self.point2.x {
(self.point1.x, self.point2.x + 1)
} else {
(self.point2.x, self.point1.x + 1)
};
let (min_y, max_y): (usize, usize) = if self.point1.y < self.point2.y {
(self.point1.y, self.point2.y + 1)
} else {
(self.point2.y, self.point1.y + 1)
};
let (is_x_negative_increment, is_y_negative_increment, points_in_line) =
if max_x - min_x == max_y - min_y {
(
self.point1.x > self.point2.x,
self.point1.y > self.point2.y,
max_x - min_x,
)
} else {
(false, false, 0)
};
let point1_x = self.point1.x;
let point1_y = self.point1.y;
(0..points_in_line).map(move |point_number| Point {
x: if is_x_negative_increment {
point1_x - point_number
} else {
point1_x + point_number
},
y: if is_y_negative_increment {
point1_y - point_number
} else {
point1_y + point_number
},
})
}
}
fn register_point(sparse_grid: &mut HashMap<Point, usize>, key: Point) {
let current_value = sparse_grid.get(&key).map_or(0, |value| *value);
sparse_grid.insert(key, current_value + 1);
}
fn part01(lines: &[Line]) -> usize {
let mut sparse_grid = HashMap::new();
for line in lines {
for point in line.to_horizontal_points().chain(line.to_vertical_points()) {
register_point(&mut sparse_grid, point);
}
}
sparse_grid.values().filter(|count| **count >= 2).count()
}
fn part02(lines: &[Line]) -> usize {
let mut sparse_grid = HashMap::new();
for line in lines {
for point in line
.to_horizontal_points()
.chain(line.to_vertical_points())
.chain(line.to_diagonal_points())
{
register_point(&mut sparse_grid, point);
}
}
sparse_grid.values().filter(|count| **count >= 2).count()
}
fn main() -> anyhow::Result<()> {
let lines: Vec<Line> = input_lines(INPUT)?
.iter()
.map(|line| line.parse())
.collect::<Result<_, _>>()?;
println!("Part 1: {}", part01(&lines));
println!("Part 2: {}", part02(&lines));
Ok(())
}
| use helpers::input_lines;
use scan_fmt::scan_fmt;
use std::collections::HashMap;
use std::str::FromStr;
const INPUT: &str = include_str!("../input.txt");
#[derive(Debug, PartialEq, Eq, Hash)]
struct Point {
x: usize,
y: usize,
}
#[derive(Debug, PartialEq, Eq, Hash)]
struct Line {
point1: Point,
point2: Point,
}
impl FromStr for Line {
type Err = anyhow::Error;
|
}
impl Line {
fn to_horizontal_points(&self) -> impl Iterator<Item = Point> {
let y: usize = self.point1.y;
let (min_x, max_x): (usize, usize) = if self.point1.y == self.point2.y {
if self.point1.x < self.point2.x {
(self.point1.x, self.point2.x + 1)
} else {
(self.point2.x, self.point1.x + 1)
}
} else {
(0, 0)
};
(min_x..max_x).map(move |x| Point { x, y })
}
fn to_vertical_points(&self) -> impl Iterator<Item = Point> {
let x: usize = self.point1.x;
let (min_y, max_y): (usize, usize) = if self.point1.x == self.point2.x {
if self.point1.y < self.point2.y {
(self.point1.y, self.point2.y + 1)
} else {
(self.point2.y, self.point1.y + 1)
}
} else {
(0, 0)
};
(min_y..max_y).map(move |y| Point { x, y })
}
fn to_diagonal_points(&self) -> impl Iterator<Item = Point> {
let (min_x, max_x): (usize, usize) = if self.point1.x < self.point2.x {
(self.point1.x, self.point2.x + 1)
} else {
(self.point2.x, self.point1.x + 1)
};
let (min_y, max_y): (usize, usize) = if self.point1.y < self.point2.y {
(self.point1.y, self.point2.y + 1)
} else {
(self.point2.y, self.point1.y + 1)
};
let (is_x_negative_increment, is_y_negative_increment, points_in_line) =
if max_x - min_x == max_y - min_y {
(
self.point1.x > self.point2.x,
self.point1.y > self.point2.y,
max_x - min_x,
)
} else {
(false, false, 0)
};
let point1_x = self.point1.x;
let point1_y = self.point1.y;
(0..points_in_line).map(move |point_number| Point {
x: if is_x_negative_increment {
point1_x - point_number
} else {
point1_x + point_number
},
y: if is_y_negative_increment {
point1_y - point_number
} else {
point1_y + point_number
},
})
}
}
fn register_point(sparse_grid: &mut HashMap<Point, usize>, key: Point) {
let current_value = sparse_grid.get(&key).map_or(0, |value| *value);
sparse_grid.insert(key, current_value + 1);
}
fn part01(lines: &[Line]) -> usize {
let mut sparse_grid = HashMap::new();
for line in lines {
for point in line.to_horizontal_points().chain(line.to_vertical_points()) {
register_point(&mut sparse_grid, point);
}
}
sparse_grid.values().filter(|count| **count >= 2).count()
}
fn part02(lines: &[Line]) -> usize {
let mut sparse_grid = HashMap::new();
for line in lines {
for point in line
.to_horizontal_points()
.chain(line.to_vertical_points())
.chain(line.to_diagonal_points())
{
register_point(&mut sparse_grid, point);
}
}
sparse_grid.values().filter(|count| **count >= 2).count()
}
fn main() -> anyhow::Result<()> {
let lines: Vec<Line> = input_lines(INPUT)?
.iter()
.map(|line| line.parse())
.collect::<Result<_, _>>()?;
println!("Part 1: {}", part01(&lines));
println!("Part 2: {}", part02(&lines));
Ok(())
}
| fn from_str(line: &str) -> Result<Self, Self::Err> {
let (x1, y1, x2, y2) = scan_fmt!(line, "{},{} -> {},{}", usize, usize, usize, usize)?;
Ok(Self {
point1: Point { x: x1, y: y1 },
point2: Point { x: x2, y: y2 },
})
} | function_block-full_function | [
{
"content": "type Point = (usize, usize);\n\n\n",
"file_path": "2021/15_chiton/src/main.rs",
"rank": 0,
"score": 208321.5886531291
},
{
"content": "fn part02(line: &str) -> usize {\n\n let mut game = GameTable::new(\n\n line.as_bytes()\n\n .iter()\n\n .map(|b... |
Rust | src/connectivity/network/tests/dhcp_interop/dhcp_validity/src/lib.rs | EnderNightLord-ChromeBook/fuchsia-pine64-pinephone | 05e2c059b57b6217089090a0315971d1735ecf57 |
use {
anyhow::{format_err, Context as _, Error},
fidl_fuchsia_net as fnet, fidl_fuchsia_net_dhcpv6 as fdhcpv6,
fidl_fuchsia_net_interfaces as finterfaces, fidl_fuchsia_net_name as fnetname,
fidl_fuchsia_net_stack as fstack,
fidl_fuchsia_net_stack_ext::FidlReturn as _,
fidl_fuchsia_netemul_guest::{
CommandListenerMarker, GuestDiscoveryMarker, GuestInteractionMarker,
},
fuchsia_async::TimeoutExt as _,
fuchsia_component::client,
netemul_guest_lib::wait_for_command_completion,
std::time::Duration,
};
pub async fn configure_dhcp_server(guest_name: &str, command_to_run: &str) -> Result<(), Error> {
let mut env = vec![];
let guest_discovery_service = client::connect_to_service::<GuestDiscoveryMarker>()?;
let (gis, gis_ch) = fidl::endpoints::create_proxy::<GuestInteractionMarker>()?;
let () = guest_discovery_service.get_guest(None, guest_name, gis_ch)?;
let (client_proxy, server_end) = fidl::endpoints::create_proxy::<CommandListenerMarker>()?;
gis.execute_command(command_to_run, &mut env.iter_mut(), None, None, None, server_end)?;
wait_for_command_completion(client_proxy.take_event_stream(), None).await
}
pub async fn verify_v4_addr_present(addr: fnet::IpAddress, timeout: Duration) -> Result<(), Error> {
let interface_state = client::connect_to_service::<finterfaces::StateMarker>()?;
let mut if_map = std::collections::HashMap::new();
fidl_fuchsia_net_interfaces_ext::wait_interface(
fidl_fuchsia_net_interfaces_ext::event_stream_from_state(&interface_state)?,
&mut if_map,
|if_map| {
if_map
.iter()
.filter_map(|(_, properties)| properties.addresses.as_ref())
.flatten()
.find_map(|a| if a.addr?.addr == addr { Some(()) } else { None })
},
)
.on_timeout(timeout, || Err(anyhow::anyhow!("timed out")))
.await
.map_err(|e| {
e.context(format!(
"DHCPv4 client got unexpected addresses: {}, address missing: {:?}",
if_map.iter().fold(String::from("addresses present:"), |s, (id, properties)| {
s + &format!(" {:?}: {:?}", id, properties.addresses)
}),
addr
))
})
}
pub async fn verify_v6_dns_servers(
interface_id: u64,
want_dns_servers: Vec<fnetname::DnsServer_>,
) -> Result<(), Error> {
let stack = client::connect_to_service::<fstack::StackMarker>()
.context("connecting to stack service")?;
let info = stack
.get_interface_info(interface_id)
.await
.squash_result()
.context("getting interface info")?;
let addr = info
.properties
.addresses
.into_iter()
.find_map(|addr: fnet::Subnet| match addr.addr {
fnet::IpAddress::Ipv4(_addr) => None,
fnet::IpAddress::Ipv6(addr) => {
if addr.addr[..8] == [0xfe, 0x80, 0, 0, 0, 0, 0, 0] {
Some(addr)
} else {
None
}
}
})
.ok_or(format_err!("no addresses found to start DHCPv6 client on"))?;
let provider = client::connect_to_service::<fdhcpv6::ClientProviderMarker>()
.context("connecting to DHCPv6 client")?;
let (client_end, server_end) = fidl::endpoints::create_endpoints::<fdhcpv6::ClientMarker>()
.context("creating DHCPv6 client channel")?;
let () = provider.new_client(
fdhcpv6::NewClientParams {
interface_id: Some(interface_id),
address: Some(fnet::Ipv6SocketAddress {
address: addr,
port: fdhcpv6::DEFAULT_CLIENT_PORT,
zone_index: interface_id,
}),
models: Some(fdhcpv6::OperationalModels {
stateless: Some(fdhcpv6::Stateless {
options_to_request: Some(vec![fdhcpv6::RequestableOptionCode::DnsServers]),
}),
}),
},
server_end,
)?;
let client_proxy = client_end.into_proxy().context("getting client proxy from channel")?;
let got_dns_servers = client_proxy.watch_servers().await.context("watching DNS servers")?;
if got_dns_servers == want_dns_servers {
Ok(())
} else {
Err(format_err!(
"DHCPv6 client received unexpected DNS servers:\ngot dns servers: {:?}\n, want dns servers: {:?}\n",
got_dns_servers,
want_dns_servers
))
}
}
|
use {
anyhow::{format_err, Context as _, Error},
fidl_fuchsia_net as fnet, fidl_fuchsia_net_dhcpv6 as fdhcpv6,
fidl_fuchsia_net_interfaces as finterfaces, fidl_fuchsia_net_name as fnetname,
fidl_fuchsia_net_stack as fstack,
fidl_fuchsia_net_stack_ext::FidlReturn as _,
fidl_fuchsia_netemul_guest::{
CommandListenerMarker, GuestDiscoveryMarker, GuestInteractionMarker,
},
fuchsia_async::TimeoutExt as _,
fuchsia_component::client,
netemul_guest_lib::wait_for_command_completion,
std::time::Duration,
};
pub async fn configure_dhcp_server(guest_name: &str, command_to_run: &str) -> Result<(), Error> {
let mut env = vec![];
let guest_discovery_service = client::connect_to_service::<GuestDiscoveryMarker>()?;
let (gis, gis_ch) = fidl::endpoints::create_proxy::<GuestInteractionMarker>()?;
let () = guest_discovery_service.get_guest(None, guest_name, gis_ch)?;
let (client_proxy, server_end) = fidl::endpoints::create_proxy::<CommandListenerMarker>()?;
gis.execute_command(command_to_run, &mut env.iter_mut(), None, None, None, server_end)?;
wait_for_command_completion(client_proxy.take_event_stream(), None).await
}
|
pub async fn verify_v6_dns_servers(
interface_id: u64,
want_dns_servers: Vec<fnetname::DnsServer_>,
) -> Result<(), Error> {
let stack = client::connect_to_service::<fstack::StackMarker>()
.context("connecting to stack service")?;
let info = stack
.get_interface_info(interface_id)
.await
.squash_result()
.context("getting interface info")?;
let addr = info
.properties
.addresses
.into_iter()
.find_map(|addr: fnet::Subnet| match addr.addr {
fnet::IpAddress::Ipv4(_addr) => None,
fnet::IpAddress::Ipv6(addr) => {
if addr.addr[..8] == [0xfe, 0x80, 0, 0, 0, 0, 0, 0] {
Some(addr)
} else {
None
}
}
})
.ok_or(format_err!("no addresses found to start DHCPv6 client on"))?;
let provider = client::connect_to_service::<fdhcpv6::ClientProviderMarker>()
.context("connecting to DHCPv6 client")?;
let (client_end, server_end) = fidl::endpoints::create_endpoints::<fdhcpv6::ClientMarker>()
.context("creating DHCPv6 client channel")?;
let () = provider.new_client(
fdhcpv6::NewClientParams {
interface_id: Some(interface_id),
address: Some(fnet::Ipv6SocketAddress {
address: addr,
port: fdhcpv6::DEFAULT_CLIENT_PORT,
zone_index: interface_id,
}),
models: Some(fdhcpv6::OperationalModels {
stateless: Some(fdhcpv6::Stateless {
options_to_request: Some(vec![fdhcpv6::RequestableOptionCode::DnsServers]),
}),
}),
},
server_end,
)?;
let client_proxy = client_end.into_proxy().context("getting client proxy from channel")?;
let got_dns_servers = client_proxy.watch_servers().await.context("watching DNS servers")?;
if got_dns_servers == want_dns_servers {
Ok(())
} else {
Err(format_err!(
"DHCPv6 client received unexpected DNS servers:\ngot dns servers: {:?}\n, want dns servers: {:?}\n",
got_dns_servers,
want_dns_servers
))
}
}
| pub async fn verify_v4_addr_present(addr: fnet::IpAddress, timeout: Duration) -> Result<(), Error> {
let interface_state = client::connect_to_service::<finterfaces::StateMarker>()?;
let mut if_map = std::collections::HashMap::new();
fidl_fuchsia_net_interfaces_ext::wait_interface(
fidl_fuchsia_net_interfaces_ext::event_stream_from_state(&interface_state)?,
&mut if_map,
|if_map| {
if_map
.iter()
.filter_map(|(_, properties)| properties.addresses.as_ref())
.flatten()
.find_map(|a| if a.addr?.addr == addr { Some(()) } else { None })
},
)
.on_timeout(timeout, || Err(anyhow::anyhow!("timed out")))
.await
.map_err(|e| {
e.context(format!(
"DHCPv4 client got unexpected addresses: {}, address missing: {:?}",
if_map.iter().fold(String::from("addresses present:"), |s, (id, properties)| {
s + &format!(" {:?}: {:?}", id, properties.addresses)
}),
addr
))
})
} | function_block-full_function | [] |
Rust | src/csv2json/mod.rs | perzanko/csv2json | aae4c50856f73fc0f88450dd2f38ad8fc6ffaeae | extern crate serde_json;
use std::collections::HashMap;
use std::env;
use std::fs::File;
use std::io;
use std::io::prelude::*;
use std::process;
use std::time::Instant;
type Lines = Vec<String>;
type Nav = String;
type NavKeys = Vec<String>;
type Args = Vec<String>;
type Rows = Vec<HashMap<String, String>>;
type Hash = HashMap<String, String>;
pub fn new() {
let start_time = Instant::now();
let (input_file, output_file) = parse_args(&env::args().collect::<Args>());
if is_str_empty(&input_file) || is_str_empty(&output_file) {
show_help();
process::exit(0x0100);
}
let nav_with_lines: (Nav, Lines) = read_file(&input_file).unwrap();
let nav: NavKeys = fetch_keys(&nav_with_lines.0);
let rows: Rows = generate_rows(&nav_with_lines.1, &nav);
let json = serde_json::to_string(&rows).unwrap();
match write_file(&output_file, &json) {
Ok(()) => println!("Ok, done! - {}", output_file),
Err(err) => println!("Something went wrong. {}", err),
};
println!("Rows: {}", rows.len());
println!("Elapsed: {} ms", get_elapsed_time(start_time));
}
fn parse_args(args: &Args) -> (String, String) {
let mut input_file = String::new();
let mut output_file = String::new();
let mut args: Args = args.clone();
args.remove(0);
args.chunks(2).for_each(|x| match x[0].as_ref() {
"--input" => {
input_file = x[1].clone();
}
"-i" => {
input_file = x[1].clone();
}
"--output" => {
output_file = x[1].clone();
}
"-o" => {
output_file = x[1].clone();
}
_ => {}
});
(input_file, output_file)
}
fn read_file(file_path: &String) -> Result<(Nav, Lines), io::Error> {
let file = File::open(file_path)?;
let buf_reader = io::BufReader::new(file);
let mut lines = Vec::new();
let mut nav = String::new();
for (i, line) in buf_reader.lines().enumerate() {
let line = line.unwrap();
if i == 0 {
nav = line
} else {
lines.push(line)
}
}
Ok((nav, lines))
}
fn write_file(file_path: &String, data: &String) -> Result<(), io::Error> {
let mut file = File::create(file_path)?;
file.write_all(&data.as_bytes())?;
Ok(())
}
fn fetch_keys(keys_str: &String) -> NavKeys {
let mut i: i16 = -1;
keys_str
.split(",")
.collect::<Vec<&str>>()
.into_iter()
.map(|key| {
i += 1;
String::from(key)
})
.collect()
}
fn generate_rows(lines: &Lines, nav: &NavKeys) -> Vec<Hash> {
lines
.into_iter()
.map(|line| {
let mut hash: HashMap<String, String> = HashMap::new();
let mut i = 0;
let nav = nav;
line.split(",")
.collect::<Vec<&str>>()
.into_iter()
.for_each(|x| {
i += 1;
hash.insert(nav[i - 1].clone(), String::from(x));
});
return hash;
})
.collect()
}
fn show_help() {
print!(
"
Created by perzanko
----
.o88b. .d8888. db db .d888b. d88b .d8888. .d88b. d8b db
d8P Y8 88' YP 88 88 VP `8D `8P' 88' YP .8P Y8. 888o 88
8P `8bo. Y8 8P odD' 88 `8bo. 88 88 88V8o 88
8b `Y8b. `8b d8' .88' 88 `Y8b. 88 88 88 V8o88
Y8b d8 db 8D `8bd8' j88. db. 88 db 8D `8b d8' 88 V888
`Y88P' `8888Y' YP 888888D Y8888P `8888Y' `Y88P' VP V8P
This tool provides simple and efficient csv to json conversion.
Usage: csv2json --input [path] --output [path]
-h, --help print this help
-i, --input input path of CSV file
-o, --output output path of converted JSON
"
)
}
fn is_str_empty(text: &String) -> bool {
if text.trim().len() == 0 {
true
} else {
false
}
}
fn get_elapsed_time(start_time: Instant) -> String {
let x = start_time.elapsed();
((x.as_secs() * 1_000) + (x.subsec_nanos() / 1_000_000) as u64).to_string()
}
| extern crate serde_json;
use std::collections::HashMap;
use std::env;
use std::fs::File;
use std::io;
use std::io::prelude::*;
use std::process;
use std::time::Instant;
type Lines = Vec<String>;
type Nav = String;
type NavKeys = Vec<String>;
type Args = Vec<String>;
type Rows = Vec<HashMap<String, String>>;
type Hash = HashMap<String, String>;
pub fn new() {
let start_time = Instant::now();
let (input_file, output_file) = parse_args(&env::args().collect::<Args>());
if is_str_empty(&input_file) || is_str_empty(&output_file) {
show_help();
process::exit(0x0100);
}
let nav_with_lines: (Nav, Lines) = read_file(&input_file).unwrap();
let nav: NavKeys = fetch_keys(&nav_with_lines.0);
let rows: Rows = generate_rows(&nav_with_lines.1, &nav);
let json = serde_json::to_string(&rows).unwrap();
match write_file(&output_file, &json) {
Ok(()) => println!("Ok, done! - {}", output_file),
Err(err) => println!("Something went wrong. {}", err),
};
println!("Rows: {}", rows.len());
println!("Elapsed: {} ms", get_elapsed_time(start_time));
}
fn parse_args(args: &Args) -> (String, String) {
|
fn read_file(file_path: &String) -> Result<(Nav, Lines), io::Error> {
let file = File::open(file_path)?;
let buf_reader = io::BufReader::new(file);
let mut lines = Vec::new();
let mut nav = String::new();
for (i, line) in buf_reader.lines().enumerate() {
let line = line.unwrap();
if i == 0 {
nav = line
} else {
lines.push(line)
}
}
Ok((nav, lines))
}
fn write_file(file_path: &String, data: &String) -> Result<(), io::Error> {
let mut file = File::create(file_path)?;
file.write_all(&data.as_bytes())?;
Ok(())
}
fn fetch_keys(keys_str: &String) -> NavKeys {
let mut i: i16 = -1;
keys_str
.split(",")
.collect::<Vec<&str>>()
.into_iter()
.map(|key| {
i += 1;
String::from(key)
})
.collect()
}
fn generate_rows(lines: &Lines, nav: &NavKeys) -> Vec<Hash> {
lines
.into_iter()
.map(|line| {
let mut hash: HashMap<String, String> = HashMap::new();
let mut i = 0;
let nav = nav;
line.split(",")
.collect::<Vec<&str>>()
.into_iter()
.for_each(|x| {
i += 1;
hash.insert(nav[i - 1].clone(), String::from(x));
});
return hash;
})
.collect()
}
fn show_help() {
print!(
"
Created by perzanko
----
.o88b. .d8888. db db .d888b. d88b .d8888. .d88b. d8b db
d8P Y8 88' YP 88 88 VP `8D `8P' 88' YP .8P Y8. 888o 88
8P `8bo. Y8 8P odD' 88 `8bo. 88 88 88V8o 88
8b `Y8b. `8b d8' .88' 88 `Y8b. 88 88 88 V8o88
Y8b d8 db 8D `8bd8' j88. db. 88 db 8D `8b d8' 88 V888
`Y88P' `8888Y' YP 888888D Y8888P `8888Y' `Y88P' VP V8P
This tool provides simple and efficient csv to json conversion.
Usage: csv2json --input [path] --output [path]
-h, --help print this help
-i, --input input path of CSV file
-o, --output output path of converted JSON
"
)
}
fn is_str_empty(text: &String) -> bool {
if text.trim().len() == 0 {
true
} else {
false
}
}
fn get_elapsed_time(start_time: Instant) -> String {
let x = start_time.elapsed();
((x.as_secs() * 1_000) + (x.subsec_nanos() / 1_000_000) as u64).to_string()
}
| let mut input_file = String::new();
let mut output_file = String::new();
let mut args: Args = args.clone();
args.remove(0);
args.chunks(2).for_each(|x| match x[0].as_ref() {
"--input" => {
input_file = x[1].clone();
}
"-i" => {
input_file = x[1].clone();
}
"--output" => {
output_file = x[1].clone();
}
"-o" => {
output_file = x[1].clone();
}
_ => {}
});
(input_file, output_file)
} | function_block-function_prefix_line | [
{
"content": "fn main() {\n\n csv2json::new();\n\n}\n",
"file_path": "src/main.rs",
"rank": 15,
"score": 25552.07465452124
},
{
"content": "# csv2json\n\n\n\nThis tool provides simple and efficient csv to json converting, written in Rust.\n\n\n\n## Getting Started\n\n\n\nYou need to have ... |
Rust | python/src/lib.rs | kngwyu/rogue-gym | 00de77e6c9f3d2b9ed602f93abb5526c13791ca9 | #[macro_use]
extern crate failure;
extern crate ndarray;
extern crate numpy;
extern crate pyo3;
extern crate rect_iter;
extern crate rogue_gym_core;
#[cfg(unix)]
extern crate rogue_gym_devui;
mod fearures;
mod state_impls;
mod thread_impls;
use fearures::{MessageFlagInner, StatusFlagInner};
use ndarray::{Array2, Axis, Zip};
use numpy::PyArray3;
use pyo3::{
basic::{PyObjectProtocol, PyObjectReprProtocol, PyObjectStrProtocol},
exceptions::RuntimeError,
prelude::*,
};
use rect_iter::{Get2D, GetMut2D, RectRange};
use rogue_gym_core::character::player::Status;
use rogue_gym_core::dungeon::{Positioned, X, Y};
use rogue_gym_core::{error::*, symbol, GameConfig, RunTime};
use state_impls::GameStateImpl;
use std::collections::HashMap;
use std::fmt::Display;
use std::str::from_utf8_unchecked;
use thread_impls::ThreadConductor;
fn pyresult<T, E: Display>(result: Result<T, E>) -> PyResult<T> {
pyresult_with(result, "Error in rogue-gym")
}
fn pyresult_with<T, E: Display>(result: Result<T, E>, msg: &str) -> PyResult<T> {
result.map_err(|e| PyErr::new::<RuntimeError, _>(format!("{}: {}", msg, e)))
}
#[pyclass]
#[derive(Clone, Debug, PartialEq)]
struct PlayerState {
map: Vec<Vec<u8>>,
history: Array2<bool>,
status: Status,
symbols: u8,
message: MessageFlagInner,
is_terminal: bool,
}
impl PlayerState {
fn new(w: X, h: Y, symbols: u8) -> Self {
let (w, h) = (w.0 as usize, h.0 as usize);
PlayerState {
map: vec![vec![b' '; w]; h],
history: Array2::from_elem([h, w], false),
status: Status::default(),
symbols,
message: MessageFlagInner::new(),
is_terminal: false,
}
}
fn reset(&mut self, runtime: &RunTime) -> GameResult<()> {
self.status = runtime.player_status();
self.draw_map(runtime)?;
self.message = MessageFlagInner::new();
self.is_terminal = false;
Ok(())
}
fn draw_map(&mut self, runtime: &RunTime) -> GameResult<()> {
self.history = runtime.history(&self.status).unwrap();
runtime.draw_screen(|Positioned(cd, tile)| -> GameResult<()> {
*self
.map
.try_get_mut_p(cd)
.into_chained(|| "in python::GameState::react")? = tile.to_byte();
Ok(())
})
}
fn dungeon_str(&self) -> impl Iterator<Item = &str> {
self.map.iter().map(|v| unsafe { from_utf8_unchecked(v) })
}
fn gray_image_with_offset<'py>(
&self,
py: Python<'py>,
offset: usize,
) -> PyResult<&'py PyArray3<f32>> {
let (h, w) = (self.map.len(), self.map[0].len());
let py_array = PyArray3::zeros(py, [1 + offset, h, w], false);
RectRange::zero_start(w, h)
.unwrap()
.into_iter()
.for_each(|(x, y)| unsafe {
let symbol = symbol::tile_to_sym(*self.map.get_xy(x, y)).unwrap();
*py_array.uget_mut([0, y, x]) = f32::from(symbol) / f32::from(self.symbols);
});
Ok(py_array)
}
fn symbol_image_with_offset<'py>(
&self,
py: Python<'py>,
offset: usize,
) -> PyResult<&'py PyArray3<f32>> {
let (h, w) = (self.map.len(), self.map[0].len());
let channels = usize::from(self.symbols);
let py_array = PyArray3::zeros(py, [channels + offset, h, w], false);
pyresult(symbol::construct_symbol_map(
&self.map,
h,
w,
self.symbols - 1,
|idx| unsafe { py_array.uget_mut(idx) },
))?;
Ok(py_array)
}
fn copy_hist(&self, py_array: &PyArray3<f32>, offset: usize) {
let mut array = py_array.as_array_mut();
let hist_array = array.index_axis_mut(Axis(0), usize::from(offset));
Zip::from(hist_array).and(&self.history).apply(|p, &r| {
*p = if r { 1.0 } else { 0.0 };
});
}
}
impl<'p> PyObjectReprProtocol<'p> for PlayerState {
type Success = String;
type Result = PyResult<String>;
}
impl<'p> PyObjectStrProtocol<'p> for PlayerState {
type Success = String;
type Result = PyResult<String>;
}
impl<'p> PyObjectProtocol<'p> for PlayerState {
fn __repr__(&'p self) -> <Self as PyObjectReprProtocol>::Result {
let mut dungeon = self.dungeon_str().fold(String::new(), |mut res, s| {
res.push_str(s);
res.push('\n');
res
});
dungeon.push_str(&format!("{}", self.status));
Ok(dungeon)
}
fn __str__(&'p self) -> <Self as PyObjectStrProtocol>::Result {
self.__repr__()
}
}
#[pymethods]
impl PlayerState {
#[getter]
fn status(&self) -> PyResult<HashMap<String, u32>> {
Ok(self
.status
.to_dict_vec()
.into_iter()
.map(|(s, v)| (s.to_owned(), v))
.collect())
}
#[getter]
fn dungeon(&self) -> PyResult<Vec<String>> {
Ok(self.dungeon_str().map(|s| s.to_string()).collect())
}
#[getter]
fn dungeon_level(&self) -> PyResult<u32> {
Ok(self.status.dungeon_level)
}
#[getter]
fn gold(&self) -> PyResult<u32> {
Ok(self.status.gold)
}
#[getter]
fn symbols(&self) -> PyResult<usize> {
Ok(usize::from(self.symbols))
}
#[getter]
fn is_terminal(&self) -> PyResult<bool> {
Ok(self.is_terminal)
}
fn status_vec(&self, flag: u32) -> Vec<i32> {
let flag = StatusFlagInner(flag);
flag.to_vector(&self.status)
}
fn gray_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.gray_image_with_offset(py, flag.len())?;
flag.copy_status(&self.status, 1, &mut array.as_array_mut());
Ok(array)
}
fn gray_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.gray_image_with_offset(py, flag.len() + 1)?;
let offset = flag.copy_status(&self.status, 1, &mut array.as_array_mut());
self.copy_hist(&array, offset);
Ok(array)
}
fn symbol_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.symbol_image_with_offset(py, flag.len())?;
flag.copy_status(
&self.status,
usize::from(self.symbols),
&mut array.as_array_mut(),
);
Ok(array)
}
fn symbol_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.symbol_image_with_offset(py, flag.len() + 1)?;
let offset = flag.copy_status(
&self.status,
usize::from(self.symbols),
&mut array.as_array_mut(),
);
self.copy_hist(&array, offset);
Ok(array)
}
}
#[pyclass]
struct GameState {
inner: GameStateImpl,
config: GameConfig,
}
#[pymethods]
impl GameState {
#[new]
fn __new__(obj: &PyRawObject, max_steps: usize, config_str: Option<String>) -> PyResult<()> {
let config = if let Some(cfg) = config_str {
pyresult_with(GameConfig::from_json(&cfg), "Failed to parse config")?
} else {
GameConfig::default()
};
let inner = pyresult(GameStateImpl::new(config.clone(), max_steps))?;
obj.init(GameState { inner, config });
Ok(())
}
fn screen_size(&self) -> (i32, i32) {
(self.config.height, self.config.width)
}
fn set_seed(&mut self, seed: u64) -> PyResult<()> {
self.config.seed = Some(seed as u128);
Ok(())
}
fn reset(&mut self) -> PyResult<()> {
pyresult(self.inner.reset(self.config.clone()))
}
fn prev(&self) -> PlayerState {
self.inner.state()
}
fn react(&mut self, input: u8) -> PyResult<()> {
pyresult(self.inner.react(input))
}
fn dump_history(&self) -> PyResult<String> {
pyresult_with(
self.inner.runtime.saved_inputs_as_json(),
"Error when getting history",
)
}
fn dump_config(&self) -> PyResult<String> {
pyresult_with(self.config.to_json(), "Error when getting config")
}
fn symbols(&self) -> PyResult<usize> {
Ok(self.inner.symbols())
}
}
#[pyclass]
struct ParallelGameState {
conductor: ThreadConductor,
configs: Vec<GameConfig>,
symbols: u8,
}
#[pymethods]
impl ParallelGameState {
#[new]
fn __new__(
obj: &PyRawObject,
py: Python,
max_steps: usize,
configs: Vec<String>,
) -> PyResult<()> {
let configs = {
let mut res = vec![];
for cfg in configs {
res.push(pyresult_with(
GameConfig::from_json(&cfg),
"Failed to parse config",
)?);
}
res
};
let symbols = configs[0]
.symbol_max()
.expect("Failed to get symbol max")
.to_byte()
+ 1;
let cloned = configs.clone();
let conductor = py.allow_threads(move || ThreadConductor::new(cloned, max_steps));
let conductor = pyresult(conductor)?;
obj.init(ParallelGameState {
conductor,
configs,
symbols,
});
Ok(())
}
fn screen_size(&self) -> (i32, i32) {
(self.configs[0].height, self.configs[0].width)
}
fn symbols(&self) -> PyResult<usize> {
Ok(usize::from(self.symbols))
}
fn seed(&mut self, py: Python, seed: Vec<u128>) -> PyResult<()> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.seed(seed));
pyresult(res)
}
fn states(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.states());
pyresult(res)
}
fn step(&mut self, py: Python, input: Vec<u8>) -> PyResult<Vec<PlayerState>> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.step(input));
pyresult(res)
}
fn reset(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.reset());
pyresult(res)
}
fn close(&mut self, py: Python) -> PyResult<()> {
let ParallelGameState {
ref mut conductor, ..
} = self;
pyresult(py.allow_threads(move || conductor.close()))
}
}
#[cfg(unix)]
#[pyfunction]
fn replay(game: &GameState, py: Python, interval_ms: u64) -> PyResult<()> {
use rogue_gym_devui::show_replay;
let inputs = game.inner.runtime.saved_inputs().to_vec();
let config = game.config.clone();
let res = py.allow_threads(move || show_replay(config, inputs, interval_ms));
pyresult(res)
}
#[cfg(unix)]
#[pyfunction]
fn play_cli(game: &GameState) -> PyResult<()> {
use rogue_gym_devui::play_game;
pyresult(play_game(game.config.clone(), false))?;
Ok(())
}
#[pymodule(_rogue_gym)]
fn init_mod(_py: Python, m: &PyModule) -> PyResult<()> {
m.add_class::<GameState>()?;
m.add_class::<PlayerState>()?;
m.add_class::<ParallelGameState>()?;
#[cfg(unix)]
m.add_wrapped(pyo3::wrap_pyfunction!(replay))?;
#[cfg(unix)]
m.add_wrapped(pyo3::wrap_pyfunction!(play_cli))?;
Ok(())
}
| #[macro_use]
extern crate failure;
extern crate ndarray;
extern crate numpy;
extern crate pyo3;
extern crate rect_iter;
exter | sage: MessageFlagInner,
is_terminal: bool,
}
impl PlayerState {
fn new(w: X, h: Y, symbols: u8) -> Self {
let (w, h) = (w.0 as usize, h.0 as usize);
PlayerState {
map: vec![vec![b' '; w]; h],
history: Array2::from_elem([h, w], false),
status: Status::default(),
symbols,
message: MessageFlagInner::new(),
is_terminal: false,
}
}
fn reset(&mut self, runtime: &RunTime) -> GameResult<()> {
self.status = runtime.player_status();
self.draw_map(runtime)?;
self.message = MessageFlagInner::new();
self.is_terminal = false;
Ok(())
}
fn draw_map(&mut self, runtime: &RunTime) -> GameResult<()> {
self.history = runtime.history(&self.status).unwrap();
runtime.draw_screen(|Positioned(cd, tile)| -> GameResult<()> {
*self
.map
.try_get_mut_p(cd)
.into_chained(|| "in python::GameState::react")? = tile.to_byte();
Ok(())
})
}
fn dungeon_str(&self) -> impl Iterator<Item = &str> {
self.map.iter().map(|v| unsafe { from_utf8_unchecked(v) })
}
fn gray_image_with_offset<'py>(
&self,
py: Python<'py>,
offset: usize,
) -> PyResult<&'py PyArray3<f32>> {
let (h, w) = (self.map.len(), self.map[0].len());
let py_array = PyArray3::zeros(py, [1 + offset, h, w], false);
RectRange::zero_start(w, h)
.unwrap()
.into_iter()
.for_each(|(x, y)| unsafe {
let symbol = symbol::tile_to_sym(*self.map.get_xy(x, y)).unwrap();
*py_array.uget_mut([0, y, x]) = f32::from(symbol) / f32::from(self.symbols);
});
Ok(py_array)
}
fn symbol_image_with_offset<'py>(
&self,
py: Python<'py>,
offset: usize,
) -> PyResult<&'py PyArray3<f32>> {
let (h, w) = (self.map.len(), self.map[0].len());
let channels = usize::from(self.symbols);
let py_array = PyArray3::zeros(py, [channels + offset, h, w], false);
pyresult(symbol::construct_symbol_map(
&self.map,
h,
w,
self.symbols - 1,
|idx| unsafe { py_array.uget_mut(idx) },
))?;
Ok(py_array)
}
fn copy_hist(&self, py_array: &PyArray3<f32>, offset: usize) {
let mut array = py_array.as_array_mut();
let hist_array = array.index_axis_mut(Axis(0), usize::from(offset));
Zip::from(hist_array).and(&self.history).apply(|p, &r| {
*p = if r { 1.0 } else { 0.0 };
});
}
}
impl<'p> PyObjectReprProtocol<'p> for PlayerState {
type Success = String;
type Result = PyResult<String>;
}
impl<'p> PyObjectStrProtocol<'p> for PlayerState {
type Success = String;
type Result = PyResult<String>;
}
impl<'p> PyObjectProtocol<'p> for PlayerState {
fn __repr__(&'p self) -> <Self as PyObjectReprProtocol>::Result {
let mut dungeon = self.dungeon_str().fold(String::new(), |mut res, s| {
res.push_str(s);
res.push('\n');
res
});
dungeon.push_str(&format!("{}", self.status));
Ok(dungeon)
}
fn __str__(&'p self) -> <Self as PyObjectStrProtocol>::Result {
self.__repr__()
}
}
#[pymethods]
impl PlayerState {
#[getter]
fn status(&self) -> PyResult<HashMap<String, u32>> {
Ok(self
.status
.to_dict_vec()
.into_iter()
.map(|(s, v)| (s.to_owned(), v))
.collect())
}
#[getter]
fn dungeon(&self) -> PyResult<Vec<String>> {
Ok(self.dungeon_str().map(|s| s.to_string()).collect())
}
#[getter]
fn dungeon_level(&self) -> PyResult<u32> {
Ok(self.status.dungeon_level)
}
#[getter]
fn gold(&self) -> PyResult<u32> {
Ok(self.status.gold)
}
#[getter]
fn symbols(&self) -> PyResult<usize> {
Ok(usize::from(self.symbols))
}
#[getter]
fn is_terminal(&self) -> PyResult<bool> {
Ok(self.is_terminal)
}
fn status_vec(&self, flag: u32) -> Vec<i32> {
let flag = StatusFlagInner(flag);
flag.to_vector(&self.status)
}
fn gray_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.gray_image_with_offset(py, flag.len())?;
flag.copy_status(&self.status, 1, &mut array.as_array_mut());
Ok(array)
}
fn gray_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.gray_image_with_offset(py, flag.len() + 1)?;
let offset = flag.copy_status(&self.status, 1, &mut array.as_array_mut());
self.copy_hist(&array, offset);
Ok(array)
}
fn symbol_image(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.symbol_image_with_offset(py, flag.len())?;
flag.copy_status(
&self.status,
usize::from(self.symbols),
&mut array.as_array_mut(),
);
Ok(array)
}
fn symbol_image_with_hist(&self, flag: Option<u32>) -> PyResult<&PyArray3<f32>> {
let (py, flag) = (
unsafe { Python::assume_gil_acquired() },
StatusFlagInner::from(flag),
);
let array = self.symbol_image_with_offset(py, flag.len() + 1)?;
let offset = flag.copy_status(
&self.status,
usize::from(self.symbols),
&mut array.as_array_mut(),
);
self.copy_hist(&array, offset);
Ok(array)
}
}
#[pyclass]
struct GameState {
inner: GameStateImpl,
config: GameConfig,
}
#[pymethods]
impl GameState {
#[new]
fn __new__(obj: &PyRawObject, max_steps: usize, config_str: Option<String>) -> PyResult<()> {
let config = if let Some(cfg) = config_str {
pyresult_with(GameConfig::from_json(&cfg), "Failed to parse config")?
} else {
GameConfig::default()
};
let inner = pyresult(GameStateImpl::new(config.clone(), max_steps))?;
obj.init(GameState { inner, config });
Ok(())
}
fn screen_size(&self) -> (i32, i32) {
(self.config.height, self.config.width)
}
fn set_seed(&mut self, seed: u64) -> PyResult<()> {
self.config.seed = Some(seed as u128);
Ok(())
}
fn reset(&mut self) -> PyResult<()> {
pyresult(self.inner.reset(self.config.clone()))
}
fn prev(&self) -> PlayerState {
self.inner.state()
}
fn react(&mut self, input: u8) -> PyResult<()> {
pyresult(self.inner.react(input))
}
fn dump_history(&self) -> PyResult<String> {
pyresult_with(
self.inner.runtime.saved_inputs_as_json(),
"Error when getting history",
)
}
fn dump_config(&self) -> PyResult<String> {
pyresult_with(self.config.to_json(), "Error when getting config")
}
fn symbols(&self) -> PyResult<usize> {
Ok(self.inner.symbols())
}
}
#[pyclass]
struct ParallelGameState {
conductor: ThreadConductor,
configs: Vec<GameConfig>,
symbols: u8,
}
#[pymethods]
impl ParallelGameState {
#[new]
fn __new__(
obj: &PyRawObject,
py: Python,
max_steps: usize,
configs: Vec<String>,
) -> PyResult<()> {
let configs = {
let mut res = vec![];
for cfg in configs {
res.push(pyresult_with(
GameConfig::from_json(&cfg),
"Failed to parse config",
)?);
}
res
};
let symbols = configs[0]
.symbol_max()
.expect("Failed to get symbol max")
.to_byte()
+ 1;
let cloned = configs.clone();
let conductor = py.allow_threads(move || ThreadConductor::new(cloned, max_steps));
let conductor = pyresult(conductor)?;
obj.init(ParallelGameState {
conductor,
configs,
symbols,
});
Ok(())
}
fn screen_size(&self) -> (i32, i32) {
(self.configs[0].height, self.configs[0].width)
}
fn symbols(&self) -> PyResult<usize> {
Ok(usize::from(self.symbols))
}
fn seed(&mut self, py: Python, seed: Vec<u128>) -> PyResult<()> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.seed(seed));
pyresult(res)
}
fn states(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.states());
pyresult(res)
}
fn step(&mut self, py: Python, input: Vec<u8>) -> PyResult<Vec<PlayerState>> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.step(input));
pyresult(res)
}
fn reset(&mut self, py: Python) -> PyResult<Vec<PlayerState>> {
let ParallelGameState {
ref mut conductor, ..
} = self;
let res = py.allow_threads(move || conductor.reset());
pyresult(res)
}
fn close(&mut self, py: Python) -> PyResult<()> {
let ParallelGameState {
ref mut conductor, ..
} = self;
pyresult(py.allow_threads(move || conductor.close()))
}
}
#[cfg(unix)]
#[pyfunction]
fn replay(game: &GameState, py: Python, interval_ms: u64) -> PyResult<()> {
use rogue_gym_devui::show_replay;
let inputs = game.inner.runtime.saved_inputs().to_vec();
let config = game.config.clone();
let res = py.allow_threads(move || show_replay(config, inputs, interval_ms));
pyresult(res)
}
#[cfg(unix)]
#[pyfunction]
fn play_cli(game: &GameState) -> PyResult<()> {
use rogue_gym_devui::play_game;
pyresult(play_game(game.config.clone(), false))?;
Ok(())
}
#[pymodule(_rogue_gym)]
fn init_mod(_py: Python, m: &PyModule) -> PyResult<()> {
m.add_class::<GameState>()?;
m.add_class::<PlayerState>()?;
m.add_class::<ParallelGameState>()?;
#[cfg(unix)]
m.add_wrapped(pyo3::wrap_pyfunction!(replay))?;
#[cfg(unix)]
m.add_wrapped(pyo3::wrap_pyfunction!(play_cli))?;
Ok(())
}
| n crate rogue_gym_core;
#[cfg(unix)]
extern crate rogue_gym_devui;
mod fearures;
mod state_impls;
mod thread_impls;
use fearures::{MessageFlagInner, StatusFlagInner};
use ndarray::{Array2, Axis, Zip};
use numpy::PyArray3;
use pyo3::{
basic::{PyObjectProtocol, PyObjectReprProtocol, PyObjectStrProtocol},
exceptions::RuntimeError,
prelude::*,
};
use rect_iter::{Get2D, GetMut2D, RectRange};
use rogue_gym_core::character::player::Status;
use rogue_gym_core::dungeon::{Positioned, X, Y};
use rogue_gym_core::{error::*, symbol, GameConfig, RunTime};
use state_impls::GameStateImpl;
use std::collections::HashMap;
use std::fmt::Display;
use std::str::from_utf8_unchecked;
use thread_impls::ThreadConductor;
fn pyresult<T, E: Display>(result: Result<T, E>) -> PyResult<T> {
pyresult_with(result, "Error in rogue-gym")
}
fn pyresult_with<T, E: Display>(result: Result<T, E>, msg: &str) -> PyResult<T> {
result.map_err(|e| PyErr::new::<RuntimeError, _>(format!("{}: {}", msg, e)))
}
#[pyclass]
#[derive(Clone, Debug, PartialEq)]
struct PlayerState {
map: Vec<Vec<u8>>,
history: Array2<bool>,
status: Status,
symbols: u8,
mes | random | [
{
"content": "#![cfg_attr(test, feature(test))]\n\n#[macro_use]\n\nextern crate bitflags;\n\n#[macro_use]\n\nextern crate derive_more;\n\n#[macro_use]\n\nextern crate enum_iterator;\n\n#[macro_use]\n\nextern crate failure;\n\nextern crate fixedbitset;\n\nextern crate ndarray;\n\nextern crate num_traits;\n\n#[ma... |
Rust | src/bin/2019_day20.rs | ibookstein/aoc | 6beb8369f80d47eef95022ced9a9b9a9bccc7d99 | use aoc::aoc_input::get_input;
use itertools::iproduct;
use std::collections::{HashMap, HashSet};
use std::convert::{TryFrom, TryInto};
use std::ops::Index;
use std::str::FromStr;
type Vertex = usize;
type Label = (usize, usize);
type LabelMap = HashMap<Label, Vertex>;
type VertexSet = HashSet<Vertex>;
type AdjacencyList = Vec<VertexSet>;
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
enum BfsReply {
Halt,
Continue,
}
#[derive(Debug)]
struct Graph {
label_map: LabelMap,
adj_list: AdjacencyList,
}
impl Graph {
fn new() -> Graph {
Graph {
label_map: LabelMap::new(),
adj_list: AdjacencyList::new(),
}
}
fn get_or_insert_vertex(&mut self, label: &Label) -> Vertex {
match self.label_map.get(label) {
Some(v) => *v,
None => {
let new_vertex = self.adj_list.len();
self.adj_list.push(VertexSet::new());
self.label_map.insert(label.to_owned(), new_vertex);
new_vertex
}
}
}
fn add_edge_by_labels(&mut self, from_label: &Label, to_label: &Label) {
let from_vertex = self.get_or_insert_vertex(from_label);
let to_vertex = self.get_or_insert_vertex(to_label);
self.adj_list[from_vertex].insert(to_vertex);
}
fn add_bidirectional_edge_by_labels(&mut self, label1: &Label, label2: &Label) {
self.add_edge_by_labels(label1, label2);
self.add_edge_by_labels(label2, label1);
}
fn bfs_layers(&self, origin: Vertex, mut func: impl FnMut(usize, &VertexSet) -> BfsReply) {
let mut visited = VertexSet::new();
visited.insert(origin);
let mut current_layer = VertexSet::new();
current_layer.insert(origin);
let mut depth = 0usize;
while !current_layer.is_empty() {
match func(depth, ¤t_layer) {
BfsReply::Halt => return,
BfsReply::Continue => (),
}
let new_layer: VertexSet = current_layer
.iter()
.flat_map(|v| &self.adj_list[*v])
.cloned()
.filter(|v| !visited.contains(v))
.collect();
visited.extend(&new_layer);
current_layer = new_layer;
depth += 1;
}
}
}
#[derive(Debug)]
struct AsciiGrid {
grid: Vec<u8>,
width: usize,
}
impl AsciiGrid {
fn height(&self) -> usize {
self.grid.len() / self.width
}
fn width(&self) -> usize {
self.width
}
}
impl Index<Label> for AsciiGrid {
type Output = u8;
fn index(&self, index: Label) -> &Self::Output {
self.grid.index(self.width * index.1 + index.0)
}
}
impl FromStr for AsciiGrid {
type Err = &'static str;
fn from_str(s: &str) -> Result<Self, Self::Err> {
let mut grid: Vec<u8> = Vec::new();
let mut width: Option<usize> = None;
for line in s.lines() {
if !line.is_ascii() {
return Err("Non-ASCII line");
}
if line.is_empty() {
return Err("Empty line");
}
if width.is_some() && width.unwrap() != line.len() {
return Err("Non-uniform line length");
}
width = Some(line.len());
grid.extend(line.bytes());
}
if grid.len() == 0 {
return Err("No lines");
}
Ok(AsciiGrid {
grid,
width: width.unwrap(),
})
}
}
#[derive(Debug)]
struct Maze {
graph: Graph,
start: Vertex,
end: Vertex,
}
impl TryFrom<&AsciiGrid> for Maze {
type Error = &'static str;
fn try_from(grid: &AsciiGrid) -> Result<Self, Self::Error> {
let width = grid.width();
let height = grid.height();
let mid_x = width / 2;
let mid_y = height / 2;
let wall = '#' as u8;
let empty = '.' as u8;
let space = ' ' as u8;
let tiles = [wall, empty];
let left_width = (2..width - 2)
.take_while(|x| tiles.contains(&grid[(*x, mid_y)]))
.count();
let right_width = (2..width - 2)
.rev()
.take_while(|x| tiles.contains(&grid[(*x, mid_y)]))
.count();
let top_height = (2..height - 2)
.take_while(|y| tiles.contains(&grid[(mid_x, *y)]))
.count();
let bottom_height = (2..height - 2)
.rev()
.take_while(|y| tiles.contains(&grid[(mid_x, *y)]))
.count();
let mut portals = HashMap::<[u8; 2], Vec<Label>>::new();
let outer_ys = 2..height - 2;
let inner_ys = 4 + top_height..height - bottom_height - 4;
let outer_xs = 2..width - 2;
let inner_xs = 4 + left_width..width - right_width - 4;
let leftbound1 = outer_ys.clone().map(|y| (0, y));
let leftbound2 = inner_ys.clone().map(|y| (width - right_width - 4, y));
for (x, y) in leftbound1.chain(leftbound2) {
let key = [grid[(x, y)], grid[(x + 1, y)]];
if key[0] != space {
portals.entry(key).or_default().push((x + 2, y));
}
}
let rightbound1 = inner_ys.map(|y| (2 + left_width, y));
let rightbound2 = outer_ys.map(|y| (width - 2, y));
for (x, y) in rightbound1.chain(rightbound2) {
let key = [grid[(x, y)], grid[(x + 1, y)]];
if key[0] != space {
portals.entry(key).or_default().push((x - 1, y));
}
}
let topbound1 = outer_xs.clone().map(|x| (x, 0));
let topbound2 = inner_xs.clone().map(|x| (x, height - bottom_height - 4));
for (x, y) in topbound1.chain(topbound2) {
let key = [grid[(x, y)], grid[(x, y + 1)]];
if key[0] != space {
portals.entry(key).or_default().push((x, y + 2));
}
}
let bottombound1 = inner_xs.map(|x| (x, 2 + top_height));
let bottombound2 = outer_xs.map(|x| (x, height - 2));
for (x, y) in bottombound1.chain(bottombound2) {
let key = [grid[(x, y)], grid[(x, y + 1)]];
if key[0] != space {
portals.entry(key).or_default().push((x, y - 1));
}
}
let start_portal = ['A' as u8; 2];
let end_portal = ['Z' as u8; 2];
let mut graph = Graph::new();
let mut start: Option<Vertex> = None;
let mut end: Option<Vertex> = None;
for (key, value) in portals.iter() {
match value[..] {
[point] => {
if *key == start_portal {
start = Some(graph.get_or_insert_vertex(&point))
} else if *key == end_portal {
end = Some(graph.get_or_insert_vertex(&point))
} else {
return Err("Bad portal");
}
}
[point1, point2] => graph.add_bidirectional_edge_by_labels(&point1, &point2),
_ => {
return Err("Bad portal");
}
}
}
if start.is_none() {
return Err("Start portal not found");
}
if end.is_none() {
return Err("End portal not found");
}
for coord in iproduct!(2..width - 2, 2..height - 2) {
if grid[coord] != empty {
continue;
}
let (x, y) = coord;
let adjacents = [(x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)];
for adj in adjacents.iter().copied() {
if grid[adj] != empty {
continue;
}
graph.add_bidirectional_edge_by_labels(&coord, &adj);
}
}
Ok(Maze {
graph,
start: start.unwrap(),
end: end.unwrap(),
})
}
}
impl Maze {
fn start_end_distance(&self) -> usize {
let mut result: Option<usize> = None;
self.graph.bfs_layers(self.start, |depth, layer| {
if layer.contains(&self.end) {
result = Some(depth);
BfsReply::Halt
} else {
BfsReply::Continue
}
});
result.unwrap()
}
}
fn main() {
let input = get_input(2019, 20);
let grid: AsciiGrid = input.parse().unwrap();
let maze: Maze = (&grid).try_into().unwrap();
println!("Start-end distance: {}", maze.start_end_distance());
}
| use aoc::aoc_input::get_input;
use itertools::iproduct;
use std::collections::{HashMap, HashSet};
use std::convert::{TryFrom, TryInto};
use std::ops::Index;
use std::str::FromStr;
type Vertex = usize;
type Label = (usize, usize);
type LabelMap = HashMap<Label, Vertex>;
type VertexSet = HashSet<Vertex>;
type AdjacencyList = Vec<VertexSet>;
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
enum BfsReply {
Halt,
Continue,
}
#[derive(Debug)]
struct Graph {
label_map: LabelMap,
adj_list: AdjacencyList,
}
impl Graph {
fn new() -> Graph {
Graph {
label_map: LabelMap::new(),
adj_list: AdjacencyList::new(),
}
}
fn get_or_insert_vertex(&mut self, label: &Label) -> Vertex {
match self.label_map.get(label) {
Some(v) => *v,
None => {
let new_vertex = self.adj_list.len();
self.adj_list.push(VertexSet::new());
self.label_map.insert(label.to_owned(), new_vertex);
new_vertex
}
}
}
fn add_edge_by_labels(&mut self, from_label: &Label, to_label: &Label) {
let from_vertex = self.get_or_insert_vertex(from_label);
let to_vertex = self.get_or_insert_vertex(to_label);
self.adj_list[from_vertex].insert(to_vertex);
}
fn add_bidirectional_edge_by_labels(&mut self, label1: &Label, label2: &Label) {
self.add_edge_by_labels(label1, label2);
self.add_edge_by_labels(label2, label1);
}
fn bfs_layers(&self, origin: Vertex, mut func: impl FnMut(usize, &VertexSet) -> BfsReply) {
let mut visited = VertexSet::new();
visited.insert(origin);
let mut current_layer = VertexSet::new();
current_layer.insert(origin);
let mut depth = 0usize;
while !current_layer.is_e | nsert_vertex(&point))
} else if *key == end_portal {
end = Some(graph.get_or_insert_vertex(&point))
} else {
return Err("Bad portal");
}
}
[point1, point2] => graph.add_bidirectional_edge_by_labels(&point1, &point2),
_ => {
return Err("Bad portal");
}
}
}
if start.is_none() {
return Err("Start portal not found");
}
if end.is_none() {
return Err("End portal not found");
}
for coord in iproduct!(2..width - 2, 2..height - 2) {
if grid[coord] != empty {
continue;
}
let (x, y) = coord;
let adjacents = [(x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)];
for adj in adjacents.iter().copied() {
if grid[adj] != empty {
continue;
}
graph.add_bidirectional_edge_by_labels(&coord, &adj);
}
}
Ok(Maze {
graph,
start: start.unwrap(),
end: end.unwrap(),
})
}
}
impl Maze {
fn start_end_distance(&self) -> usize {
let mut result: Option<usize> = None;
self.graph.bfs_layers(self.start, |depth, layer| {
if layer.contains(&self.end) {
result = Some(depth);
BfsReply::Halt
} else {
BfsReply::Continue
}
});
result.unwrap()
}
}
fn main() {
let input = get_input(2019, 20);
let grid: AsciiGrid = input.parse().unwrap();
let maze: Maze = (&grid).try_into().unwrap();
println!("Start-end distance: {}", maze.start_end_distance());
}
| mpty() {
match func(depth, ¤t_layer) {
BfsReply::Halt => return,
BfsReply::Continue => (),
}
let new_layer: VertexSet = current_layer
.iter()
.flat_map(|v| &self.adj_list[*v])
.cloned()
.filter(|v| !visited.contains(v))
.collect();
visited.extend(&new_layer);
current_layer = new_layer;
depth += 1;
}
}
}
#[derive(Debug)]
struct AsciiGrid {
grid: Vec<u8>,
width: usize,
}
impl AsciiGrid {
fn height(&self) -> usize {
self.grid.len() / self.width
}
fn width(&self) -> usize {
self.width
}
}
impl Index<Label> for AsciiGrid {
type Output = u8;
fn index(&self, index: Label) -> &Self::Output {
self.grid.index(self.width * index.1 + index.0)
}
}
impl FromStr for AsciiGrid {
type Err = &'static str;
fn from_str(s: &str) -> Result<Self, Self::Err> {
let mut grid: Vec<u8> = Vec::new();
let mut width: Option<usize> = None;
for line in s.lines() {
if !line.is_ascii() {
return Err("Non-ASCII line");
}
if line.is_empty() {
return Err("Empty line");
}
if width.is_some() && width.unwrap() != line.len() {
return Err("Non-uniform line length");
}
width = Some(line.len());
grid.extend(line.bytes());
}
if grid.len() == 0 {
return Err("No lines");
}
Ok(AsciiGrid {
grid,
width: width.unwrap(),
})
}
}
#[derive(Debug)]
struct Maze {
graph: Graph,
start: Vertex,
end: Vertex,
}
impl TryFrom<&AsciiGrid> for Maze {
type Error = &'static str;
fn try_from(grid: &AsciiGrid) -> Result<Self, Self::Error> {
let width = grid.width();
let height = grid.height();
let mid_x = width / 2;
let mid_y = height / 2;
let wall = '#' as u8;
let empty = '.' as u8;
let space = ' ' as u8;
let tiles = [wall, empty];
let left_width = (2..width - 2)
.take_while(|x| tiles.contains(&grid[(*x, mid_y)]))
.count();
let right_width = (2..width - 2)
.rev()
.take_while(|x| tiles.contains(&grid[(*x, mid_y)]))
.count();
let top_height = (2..height - 2)
.take_while(|y| tiles.contains(&grid[(mid_x, *y)]))
.count();
let bottom_height = (2..height - 2)
.rev()
.take_while(|y| tiles.contains(&grid[(mid_x, *y)]))
.count();
let mut portals = HashMap::<[u8; 2], Vec<Label>>::new();
let outer_ys = 2..height - 2;
let inner_ys = 4 + top_height..height - bottom_height - 4;
let outer_xs = 2..width - 2;
let inner_xs = 4 + left_width..width - right_width - 4;
let leftbound1 = outer_ys.clone().map(|y| (0, y));
let leftbound2 = inner_ys.clone().map(|y| (width - right_width - 4, y));
for (x, y) in leftbound1.chain(leftbound2) {
let key = [grid[(x, y)], grid[(x + 1, y)]];
if key[0] != space {
portals.entry(key).or_default().push((x + 2, y));
}
}
let rightbound1 = inner_ys.map(|y| (2 + left_width, y));
let rightbound2 = outer_ys.map(|y| (width - 2, y));
for (x, y) in rightbound1.chain(rightbound2) {
let key = [grid[(x, y)], grid[(x + 1, y)]];
if key[0] != space {
portals.entry(key).or_default().push((x - 1, y));
}
}
let topbound1 = outer_xs.clone().map(|x| (x, 0));
let topbound2 = inner_xs.clone().map(|x| (x, height - bottom_height - 4));
for (x, y) in topbound1.chain(topbound2) {
let key = [grid[(x, y)], grid[(x, y + 1)]];
if key[0] != space {
portals.entry(key).or_default().push((x, y + 2));
}
}
let bottombound1 = inner_xs.map(|x| (x, 2 + top_height));
let bottombound2 = outer_xs.map(|x| (x, height - 2));
for (x, y) in bottombound1.chain(bottombound2) {
let key = [grid[(x, y)], grid[(x, y + 1)]];
if key[0] != space {
portals.entry(key).or_default().push((x, y - 1));
}
}
let start_portal = ['A' as u8; 2];
let end_portal = ['Z' as u8; 2];
let mut graph = Graph::new();
let mut start: Option<Vertex> = None;
let mut end: Option<Vertex> = None;
for (key, value) in portals.iter() {
match value[..] {
[point] => {
if *key == start_portal {
start = Some(graph.get_or_i | random | [
{
"content": "pub fn digits<T>(mut num: T, radix: T) -> impl Iterator<Item = T>\n\nwhere\n\n T: UnsignedDigits<T>,\n\n{\n\n let zero = T::zero();\n\n\n\n let mut divisor = T::one();\n\n while num >= divisor * radix {\n\n divisor *= radix;\n\n }\n\n\n\n std::iter::from_fn(move || {\n\n ... |
Rust | src/cli/commands/color_commands.rs | dandycheung/pastel | 3719824a56fb9eb92eb960068e513b95486756a7 | use crate::colorspace::get_mixing_function;
use crate::commands::prelude::*;
use pastel::ColorblindnessType;
use pastel::Fraction;
fn clamp(lower: f64, upper: f64, x: f64) -> f64 {
f64::max(f64::min(upper, x), lower)
}
macro_rules! color_command {
($cmd_name:ident, $config:ident, $matches:ident, $color:ident, $body:block) => {
pub struct $cmd_name;
impl ColorCommand for $cmd_name {
fn run(
&self,
out: &mut Output,
$matches: &ArgMatches,
$config: &Config,
$color: &Color,
) -> Result<()> {
let output = $body;
out.show_color($config, &output)
}
}
};
}
color_command!(SaturateCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.saturate(amount)
});
color_command!(DesaturateCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.desaturate(amount)
});
color_command!(LightenCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.lighten(amount)
});
color_command!(DarkenCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.darken(amount)
});
color_command!(RotateCommand, _config, matches, color, {
let degrees = number_arg(matches, "degrees")?;
color.rotate_hue(degrees)
});
color_command!(ComplementCommand, _config, _matches, color, {
color.complementary()
});
color_command!(ToGrayCommand, _config, _matches, color, { color.to_gray() });
color_command!(TextColorCommand, _config, _matches, color, {
color.text_color()
});
color_command!(MixCommand, config, matches, color, {
let mut print_spectrum = PrintSpectrum::Yes;
let base = ColorArgIterator::from_color_arg(
config,
matches.value_of("base").expect("required argument"),
&mut print_spectrum,
)?;
let fraction = Fraction::from(1.0 - number_arg(matches, "fraction")?);
let mix = get_mixing_function(matches.value_of("colorspace").expect("required argument"));
mix(&base, color, fraction)
});
color_command!(ColorblindCommand, config, matches, color, {
let cb_ty = matches.value_of("type").expect("required argument");
let cb_ty = cb_ty.to_lowercase();
let cb_ty = match cb_ty.as_ref() {
"prot" => ColorblindnessType::Protanopia,
"deuter" => ColorblindnessType::Deuteranopia,
"trit" => ColorblindnessType::Tritanopia,
&_ => {
unreachable!("Unknown property");
}
};
color.simulate_colorblindness(cb_ty)
});
color_command!(SetCommand, config, matches, color, {
let property = matches.value_of("property").expect("required argument");
let property = property.to_lowercase();
let property = property.as_ref();
let value = number_arg(matches, "value")?;
match property {
"red" | "green" | "blue" => {
let mut rgba = color.to_rgba();
let value = clamp(0.0, 255.0, value) as u8;
match property {
"red" => {
rgba.r = value;
}
"green" => {
rgba.g = value;
}
"blue" => {
rgba.b = value;
}
_ => unreachable!(),
}
Color::from_rgba(rgba.r, rgba.g, rgba.b, rgba.alpha)
}
"hsl-hue" | "hsl-saturation" | "hsl-lightness" => {
let mut hsla = color.to_hsla();
match property {
"hsl-hue" => {
hsla.h = value;
}
"hsl-saturation" => {
hsla.s = value;
}
"hsl-lightness" => {
hsla.l = value;
}
_ => unreachable!(),
}
Color::from_hsla(hsla.h, hsla.s, hsla.l, hsla.alpha)
}
"lightness" | "lab-a" | "lab-b" => {
let mut lab = color.to_lab();
match property {
"lightness" => {
lab.l = value;
}
"lab-a" => {
lab.a = value;
}
"lab-b" => {
lab.b = value;
}
_ => unreachable!(),
}
Color::from_lab(lab.l, lab.a, lab.b, lab.alpha)
}
"hue" | "chroma" => {
let mut lch = color.to_lch();
match property {
"hue" => {
lch.h = value;
}
"chroma" => {
lch.c = value;
}
_ => unreachable!(),
}
Color::from_lch(lch.l, lch.c, lch.h, lch.alpha)
}
&_ => {
unreachable!("Unknown property");
}
}
});
| use crate::colorspace::get_mixing_function;
use crate::commands::prelude::*;
use pastel::ColorblindnessType;
use pastel::Fraction;
fn clamp(lower: f64, upper: f64, x: f64) -> f64 {
f64::max(f64::min(upper, x), lower)
}
macro_rules! color_command {
($cmd_name:ident, $config:ident, $matches:ident, $color:ident, $body:block) => {
pub struct $cmd_name;
impl ColorCommand for $cmd_name {
fn run(
&self,
out: &mut Output,
$matches: &ArgMatches,
$config: &Config,
$color: &Color,
| match property {
"hsl-hue" => {
hsla.h = value;
}
"hsl-saturation" => {
hsla.s = value;
}
"hsl-lightness" => {
hsla.l = value;
}
_ => unreachable!(),
}
Color::from_hsla(hsla.h, hsla.s, hsla.l, hsla.alpha)
}
"lightness" | "lab-a" | "lab-b" => {
let mut lab = color.to_lab();
match property {
"lightness" => {
lab.l = value;
}
"lab-a" => {
lab.a = value;
}
"lab-b" => {
lab.b = value;
}
_ => unreachable!(),
}
Color::from_lab(lab.l, lab.a, lab.b, lab.alpha)
}
"hue" | "chroma" => {
let mut lch = color.to_lch();
match property {
"hue" => {
lch.h = value;
}
"chroma" => {
lch.c = value;
}
_ => unreachable!(),
}
Color::from_lch(lch.l, lch.c, lch.h, lch.alpha)
}
&_ => {
unreachable!("Unknown property");
}
}
});
| ) -> Result<()> {
let output = $body;
out.show_color($config, &output)
}
}
};
}
color_command!(SaturateCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.saturate(amount)
});
color_command!(DesaturateCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.desaturate(amount)
});
color_command!(LightenCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.lighten(amount)
});
color_command!(DarkenCommand, _config, matches, color, {
let amount = number_arg(matches, "amount")?;
color.darken(amount)
});
color_command!(RotateCommand, _config, matches, color, {
let degrees = number_arg(matches, "degrees")?;
color.rotate_hue(degrees)
});
color_command!(ComplementCommand, _config, _matches, color, {
color.complementary()
});
color_command!(ToGrayCommand, _config, _matches, color, { color.to_gray() });
color_command!(TextColorCommand, _config, _matches, color, {
color.text_color()
});
color_command!(MixCommand, config, matches, color, {
let mut print_spectrum = PrintSpectrum::Yes;
let base = ColorArgIterator::from_color_arg(
config,
matches.value_of("base").expect("required argument"),
&mut print_spectrum,
)?;
let fraction = Fraction::from(1.0 - number_arg(matches, "fraction")?);
let mix = get_mixing_function(matches.value_of("colorspace").expect("required argument"));
mix(&base, color, fraction)
});
color_command!(ColorblindCommand, config, matches, color, {
let cb_ty = matches.value_of("type").expect("required argument");
let cb_ty = cb_ty.to_lowercase();
let cb_ty = match cb_ty.as_ref() {
"prot" => ColorblindnessType::Protanopia,
"deuter" => ColorblindnessType::Deuteranopia,
"trit" => ColorblindnessType::Tritanopia,
&_ => {
unreachable!("Unknown property");
}
};
color.simulate_colorblindness(cb_ty)
});
color_command!(SetCommand, config, matches, color, {
let property = matches.value_of("property").expect("required argument");
let property = property.to_lowercase();
let property = property.as_ref();
let value = number_arg(matches, "value")?;
match property {
"red" | "green" | "blue" => {
let mut rgba = color.to_rgba();
let value = clamp(0.0, 255.0, value) as u8;
match property {
"red" => {
rgba.r = value;
}
"green" => {
rgba.g = value;
}
"blue" => {
rgba.b = value;
}
_ => unreachable!(),
}
Color::from_rgba(rgba.r, rgba.g, rgba.b, rgba.alpha)
}
"hsl-hue" | "hsl-saturation" | "hsl-lightness" => {
let mut hsla = color.to_hsla();
| random | [
{
"content": "/// Trim a number such that it fits into the range [lower, upper].\n\npub fn clamp(lower: Scalar, upper: Scalar, x: Scalar) -> Scalar {\n\n Scalar::max(Scalar::min(upper, x), lower)\n\n}\n\n\n\n#[derive(Debug, Clone, Copy)]\n\npub struct Fraction {\n\n f: Scalar,\n\n}\n\n\n\nimpl Fraction {\... |
Rust | mshv-ioctls/src/ioctls/system.rs | russell-islam/mshv | 99da566389546aedb56fc3d279e01c5dbde79bce |
use crate::ioctls::vm::{new_vmfd, VmFd};
use crate::ioctls::Result;
use crate::mshv_ioctls::*;
use libc::{open, O_CLOEXEC, O_NONBLOCK};
use mshv_bindings::*;
use std::fs::File;
use std::os::raw::c_char;
use std::os::unix::io::{FromRawFd, RawFd};
use vmm_sys_util::errno;
use vmm_sys_util::ioctl::ioctl_with_ref;
pub struct Mshv {
hv: File,
}
impl Mshv {
#[allow(clippy::new_ret_no_self)]
pub fn new() -> Result<Self> {
let fd = Self::open_with_cloexec(true)?;
let ret = unsafe { Self::new_with_fd_number(fd) };
Ok(ret)
}
pub unsafe fn new_with_fd_number(fd: RawFd) -> Self {
Mshv {
hv: File::from_raw_fd(fd),
}
}
pub fn open_with_cloexec(close_on_exec: bool) -> Result<RawFd> {
let open_flags = O_NONBLOCK | if close_on_exec { O_CLOEXEC } else { 0 };
let ret = unsafe { open("/dev/mshv\0".as_ptr() as *const c_char, open_flags) };
if ret < 0 {
Err(errno::Error::last())
} else {
Ok(ret)
}
}
pub fn create_vm(&self) -> Result<VmFd> {
let creation_flags: u64 = HV_PARTITION_CREATION_FLAG_LAPIC_ENABLED as u64;
let mut pr = mshv_create_partition {
partition_creation_properties: hv_partition_creation_properties {
disabled_processor_features: hv_partition_processor_features { as_uint64: [0; 2] },
disabled_processor_xsave_features: hv_partition_processor_xsave_features {
as_uint64: 0_u64,
},
},
synthetic_processor_features: hv_partition_synthetic_processor_features {
as_uint64: [0; 1],
},
flags: creation_flags,
};
/* TODO pass in arg for this */
unsafe {
pr.synthetic_processor_features
.__bindgen_anon_1
.set_hypervisor_present(1);
pr.synthetic_processor_features.__bindgen_anon_1.set_hv1(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_partition_reference_counter(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_synic_regs(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_synthetic_timer_regs(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_partition_reference_tsc(1);
/* Need this for linux on CH, as there's no PIT or HPET */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_frequency_regs(1);
/* Linux I'm using appears to require vp assist page... */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_intr_ctrl_regs(1);
/* According to Hv#1 spec, these must be set also, but they aren't in KVM? */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_vp_index(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_hypercall_regs(1);
/* Windows requires this */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_guest_idle_reg(1);
}
let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CREATE_PARTITION(), &pr) };
if ret >= 0 {
let vm_file = unsafe { File::from_raw_fd(ret) };
Ok(new_vmfd(vm_file))
} else {
Err(errno::Error::last())
}
}
pub fn check_stable(&self) -> Result<bool> {
let cap: u32 = MSHV_CAP_CORE_API_STABLE;
let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CHECK_EXTENSION(), &cap) };
match ret {
0 => Ok(false),
r if r > 0 => Ok(true),
_ => Err(errno::Error::last()),
}
}
pub fn get_msr_index_list(&self) -> Result<MsrList> {
/* return all the MSRs we currently support */
Ok(MsrList::from_entries(&[
IA32_MSR_TSC,
IA32_MSR_EFER,
IA32_MSR_KERNEL_GS_BASE,
IA32_MSR_APIC_BASE,
IA32_MSR_PAT,
IA32_MSR_SYSENTER_CS,
IA32_MSR_SYSENTER_ESP,
IA32_MSR_SYSENTER_EIP,
IA32_MSR_STAR,
IA32_MSR_LSTAR,
IA32_MSR_CSTAR,
IA32_MSR_SFMASK,
IA32_MSR_MTRR_DEF_TYPE,
IA32_MSR_MTRR_PHYSBASE0,
IA32_MSR_MTRR_PHYSMASK0,
IA32_MSR_MTRR_PHYSBASE1,
IA32_MSR_MTRR_PHYSMASK1,
IA32_MSR_MTRR_PHYSBASE2,
IA32_MSR_MTRR_PHYSMASK2,
IA32_MSR_MTRR_PHYSBASE3,
IA32_MSR_MTRR_PHYSMASK3,
IA32_MSR_MTRR_PHYSBASE4,
IA32_MSR_MTRR_PHYSMASK4,
IA32_MSR_MTRR_PHYSBASE5,
IA32_MSR_MTRR_PHYSMASK5,
IA32_MSR_MTRR_PHYSBASE6,
IA32_MSR_MTRR_PHYSMASK6,
IA32_MSR_MTRR_PHYSBASE7,
IA32_MSR_MTRR_PHYSMASK7,
IA32_MSR_MTRR_FIX64K_00000,
IA32_MSR_MTRR_FIX16K_80000,
IA32_MSR_MTRR_FIX16K_a0000,
IA32_MSR_MTRR_FIX4K_c0000,
IA32_MSR_MTRR_FIX4K_c8000,
IA32_MSR_MTRR_FIX4K_d0000,
IA32_MSR_MTRR_FIX4K_d8000,
IA32_MSR_MTRR_FIX4K_e0000,
IA32_MSR_MTRR_FIX4K_e8000,
IA32_MSR_MTRR_FIX4K_f0000,
IA32_MSR_MTRR_FIX4K_f8000,
IA32_MSR_TSC_AUX,
IA32_MSR_BNDCFGS,
IA32_MSR_DEBUG_CTL,
IA32_MSR_SPEC_CTRL,
])
.unwrap())
}
}
#[allow(dead_code)]
#[cfg(test)]
mod tests {
use super::*;
#[test]
#[ignore]
fn test_create_vm() {
let hv = Mshv::new().unwrap();
let vm = hv.create_vm();
assert!(vm.is_ok());
}
#[test]
#[ignore]
fn test_get_msr_index_list() {
let hv = Mshv::new().unwrap();
let msr_list = hv.get_msr_index_list().unwrap();
assert!(msr_list.as_fam_struct_ref().nmsrs == 44);
let mut found = false;
for index in msr_list.as_slice() {
if *index == IA32_MSR_SYSENTER_CS {
found = true;
break;
}
}
assert!(found);
/* Test all MSRs in the list individually and determine which can be get/set */
let vm = hv.create_vm().unwrap();
let vcpu = vm.create_vcpu(0).unwrap();
let mut num_errors = 0;
for idx in hv.get_msr_index_list().unwrap().as_slice().iter() {
let mut get_set_msrs = Msrs::from_entries(&[msr_entry {
index: *idx,
..Default::default()
}])
.unwrap();
vcpu.get_msrs(&mut get_set_msrs).unwrap_or_else(|_| {
println!("Error getting MSR: 0x{:x}", *idx);
num_errors += 1;
0
});
vcpu.set_msrs(&get_set_msrs).unwrap_or_else(|_| {
println!("Error setting MSR: 0x{:x}", *idx);
num_errors += 1;
0
});
}
assert!(num_errors == 0);
}
}
|
use crate::ioctls::vm::{new_vmfd, VmFd};
use crate::ioctls::Result;
use crate::mshv_ioctls::*;
use libc::{open, O_CLOEXEC, O_NONBLOCK};
use mshv_bindings::*;
use std::fs::File;
use std::os::raw::c_char;
use std::os::unix::io::{FromRawFd, RawFd};
use vmm_sys_util::errno;
use vmm_sys_util::ioctl::ioctl_with_ref;
pub struct Mshv {
hv: File,
}
impl Mshv {
#[allow(clippy::new_ret_no_self)]
pub fn new() -> Result<Self> {
let fd = Self::open_with_cloexec(true)?;
let ret = unsafe { Self::new_with_fd_number(fd) };
Ok(ret)
}
pub unsafe fn new_with_fd_number(fd: RawFd) -> Self {
Mshv {
hv: File::from_raw_fd(fd),
}
}
pub fn open_with_cloexec(close_on_exec: bool) -> Result<RawFd> {
let open_flags = O_NONBLOCK | if close_on_exec { O_CLOEXEC } else { 0 };
let ret = unsafe { open("/dev/mshv\0".as_ptr() as *const c_char, open_flags) };
if ret < 0 {
Err(errno::Error::last())
} else {
Ok(ret)
}
}
|
pub fn check_stable(&self) -> Result<bool> {
let cap: u32 = MSHV_CAP_CORE_API_STABLE;
let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CHECK_EXTENSION(), &cap) };
match ret {
0 => Ok(false),
r if r > 0 => Ok(true),
_ => Err(errno::Error::last()),
}
}
pub fn get_msr_index_list(&self) -> Result<MsrList> {
/* return all the MSRs we currently support */
Ok(MsrList::from_entries(&[
IA32_MSR_TSC,
IA32_MSR_EFER,
IA32_MSR_KERNEL_GS_BASE,
IA32_MSR_APIC_BASE,
IA32_MSR_PAT,
IA32_MSR_SYSENTER_CS,
IA32_MSR_SYSENTER_ESP,
IA32_MSR_SYSENTER_EIP,
IA32_MSR_STAR,
IA32_MSR_LSTAR,
IA32_MSR_CSTAR,
IA32_MSR_SFMASK,
IA32_MSR_MTRR_DEF_TYPE,
IA32_MSR_MTRR_PHYSBASE0,
IA32_MSR_MTRR_PHYSMASK0,
IA32_MSR_MTRR_PHYSBASE1,
IA32_MSR_MTRR_PHYSMASK1,
IA32_MSR_MTRR_PHYSBASE2,
IA32_MSR_MTRR_PHYSMASK2,
IA32_MSR_MTRR_PHYSBASE3,
IA32_MSR_MTRR_PHYSMASK3,
IA32_MSR_MTRR_PHYSBASE4,
IA32_MSR_MTRR_PHYSMASK4,
IA32_MSR_MTRR_PHYSBASE5,
IA32_MSR_MTRR_PHYSMASK5,
IA32_MSR_MTRR_PHYSBASE6,
IA32_MSR_MTRR_PHYSMASK6,
IA32_MSR_MTRR_PHYSBASE7,
IA32_MSR_MTRR_PHYSMASK7,
IA32_MSR_MTRR_FIX64K_00000,
IA32_MSR_MTRR_FIX16K_80000,
IA32_MSR_MTRR_FIX16K_a0000,
IA32_MSR_MTRR_FIX4K_c0000,
IA32_MSR_MTRR_FIX4K_c8000,
IA32_MSR_MTRR_FIX4K_d0000,
IA32_MSR_MTRR_FIX4K_d8000,
IA32_MSR_MTRR_FIX4K_e0000,
IA32_MSR_MTRR_FIX4K_e8000,
IA32_MSR_MTRR_FIX4K_f0000,
IA32_MSR_MTRR_FIX4K_f8000,
IA32_MSR_TSC_AUX,
IA32_MSR_BNDCFGS,
IA32_MSR_DEBUG_CTL,
IA32_MSR_SPEC_CTRL,
])
.unwrap())
}
}
#[allow(dead_code)]
#[cfg(test)]
mod tests {
use super::*;
#[test]
#[ignore]
fn test_create_vm() {
let hv = Mshv::new().unwrap();
let vm = hv.create_vm();
assert!(vm.is_ok());
}
#[test]
#[ignore]
fn test_get_msr_index_list() {
let hv = Mshv::new().unwrap();
let msr_list = hv.get_msr_index_list().unwrap();
assert!(msr_list.as_fam_struct_ref().nmsrs == 44);
let mut found = false;
for index in msr_list.as_slice() {
if *index == IA32_MSR_SYSENTER_CS {
found = true;
break;
}
}
assert!(found);
/* Test all MSRs in the list individually and determine which can be get/set */
let vm = hv.create_vm().unwrap();
let vcpu = vm.create_vcpu(0).unwrap();
let mut num_errors = 0;
for idx in hv.get_msr_index_list().unwrap().as_slice().iter() {
let mut get_set_msrs = Msrs::from_entries(&[msr_entry {
index: *idx,
..Default::default()
}])
.unwrap();
vcpu.get_msrs(&mut get_set_msrs).unwrap_or_else(|_| {
println!("Error getting MSR: 0x{:x}", *idx);
num_errors += 1;
0
});
vcpu.set_msrs(&get_set_msrs).unwrap_or_else(|_| {
println!("Error setting MSR: 0x{:x}", *idx);
num_errors += 1;
0
});
}
assert!(num_errors == 0);
}
}
| pub fn create_vm(&self) -> Result<VmFd> {
let creation_flags: u64 = HV_PARTITION_CREATION_FLAG_LAPIC_ENABLED as u64;
let mut pr = mshv_create_partition {
partition_creation_properties: hv_partition_creation_properties {
disabled_processor_features: hv_partition_processor_features { as_uint64: [0; 2] },
disabled_processor_xsave_features: hv_partition_processor_xsave_features {
as_uint64: 0_u64,
},
},
synthetic_processor_features: hv_partition_synthetic_processor_features {
as_uint64: [0; 1],
},
flags: creation_flags,
};
/* TODO pass in arg for this */
unsafe {
pr.synthetic_processor_features
.__bindgen_anon_1
.set_hypervisor_present(1);
pr.synthetic_processor_features.__bindgen_anon_1.set_hv1(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_partition_reference_counter(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_synic_regs(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_synthetic_timer_regs(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_partition_reference_tsc(1);
/* Need this for linux on CH, as there's no PIT or HPET */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_frequency_regs(1);
/* Linux I'm using appears to require vp assist page... */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_intr_ctrl_regs(1);
/* According to Hv#1 spec, these must be set also, but they aren't in KVM? */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_vp_index(1);
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_hypercall_regs(1);
/* Windows requires this */
pr.synthetic_processor_features
.__bindgen_anon_1
.set_access_guest_idle_reg(1);
}
let ret = unsafe { ioctl_with_ref(&self.hv, MSHV_CREATE_PARTITION(), &pr) };
if ret >= 0 {
let vm_file = unsafe { File::from_raw_fd(ret) };
Ok(new_vmfd(vm_file))
} else {
Err(errno::Error::last())
}
} | function_block-full_function | [
{
"content": "/// Helper function to create a new `VmFd`.\n\n///\n\n/// This should not be exported as a public function because the preferred way is to use\n\n/// `create_vm` from `Mshv`. The function cannot be part of the `VmFd` implementation because\n\n/// then it would be exported with the public `VmFd` in... |
Rust | src/test/debuginfo/recursive-struct.rs | komaeda/rust | b2c6b8c29f13f8d1f242da89e587960b95337819 |
#![allow(unused_variables)]
#![feature(box_syntax)]
#![feature(omit_gdb_pretty_printer_section)]
#![omit_gdb_pretty_printer_section]
use self::Opt::{Empty, Val};
enum Opt<T> {
Empty,
Val { val: T }
}
struct UniqueNode<T> {
next: Opt<Box<UniqueNode<T>>>,
value: T
}
struct LongCycle1<T> {
next: Box<LongCycle2<T>>,
value: T,
}
struct LongCycle2<T> {
next: Box<LongCycle3<T>>,
value: T,
}
struct LongCycle3<T> {
next: Box<LongCycle4<T>>,
value: T,
}
struct LongCycle4<T> {
next: Option<Box<LongCycle1<T>>>,
value: T,
}
struct LongCycleWithAnonymousTypes {
next: Opt<Box<Box<Box<Box<Box<LongCycleWithAnonymousTypes>>>>>>,
value: usize,
}
fn main() {
let stack_unique: UniqueNode<u16> = UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 1,
}
},
value: 0,
};
let unique_unique: Box<UniqueNode<u32>> = box UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 3,
}
},
value: 2,
};
let vec_unique: [UniqueNode<f32>; 1] = [UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 7.5,
}
},
value: 6.5,
}];
let borrowed_unique: &UniqueNode<f64> = &UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 9.5,
}
},
value: 8.5,
};
let long_cycle1: LongCycle1<u16> = LongCycle1 {
next: box LongCycle2 {
next: box LongCycle3 {
next: box LongCycle4 {
next: None,
value: 23,
},
value: 22,
},
value: 21
},
value: 20
};
let long_cycle2: LongCycle2<u32> = LongCycle2 {
next: box LongCycle3 {
next: box LongCycle4 {
next: None,
value: 26,
},
value: 25,
},
value: 24
};
let long_cycle3: LongCycle3<u64> = LongCycle3 {
next: box LongCycle4 {
next: None,
value: 28,
},
value: 27,
};
let long_cycle4: LongCycle4<f32> = LongCycle4 {
next: None,
value: 29.5,
};
let long_cycle_w_anonymous_types = box box box box box LongCycleWithAnonymousTypes {
next: Val {
val: box box box box box LongCycleWithAnonymousTypes {
next: Empty,
value: 31,
}
},
value: 30
};
zzz();
}
fn zzz() {()}
|
#![allow(unused_variables)]
#![feature(box_syntax)]
#![feature(omit_gdb_pretty_printer_section)]
#![omit_gdb_pretty_printer_section]
use self::Opt::{Empty, Val};
enum Opt<T> {
Empty,
Val { val: T }
}
struct UniqueNode<T> {
next: Opt<Box<UniqueNode<T>>>,
value: T
}
struct LongCycle1<T> {
next: Box<LongCycle2<T>>,
value: T,
}
struct LongCycle2<T> {
next: Box<LongCycle3<T>>,
value: T,
}
struct LongCycle3<T> {
next: Box<LongCycle4<T>>,
value: T,
}
struct LongCycle4<T> {
next: Option<Box<LongCycle1<T>>>,
value: T,
}
struct LongCycleWithAnonymousTypes {
next: Opt<Box<Box<Box<Box<Box<LongCycleWithAnonymousTypes>>>>>>,
value: usize,
}
fn main() {
let stack_unique: UniqueNode<u16> = UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 1,
}
},
value: 0,
};
|
let vec_unique: [UniqueNode<f32>; 1] = [UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 7.5,
}
},
value: 6.5,
}];
let borrowed_unique: &UniqueNode<f64> = &UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 9.5,
}
},
value: 8.5,
};
let long_cycle1: LongCycle1<u16> = LongCycle1 {
next: box LongCycle2 {
next: box LongCycle3 {
next: box LongCycle4 {
next: None,
value: 23,
},
value: 22,
},
value: 21
},
value: 20
};
let long_cycle2: LongCycle2<u32> = LongCycle2 {
next: box LongCycle3 {
next: box LongCycle4 {
next: None,
value: 26,
},
value: 25,
},
value: 24
};
let long_cycle3: LongCycle3<u64> = LongCycle3 {
next: box LongCycle4 {
next: None,
value: 28,
},
value: 27,
};
let long_cycle4: LongCycle4<f32> = LongCycle4 {
next: None,
value: 29.5,
};
let long_cycle_w_anonymous_types = box box box box box LongCycleWithAnonymousTypes {
next: Val {
val: box box box box box LongCycleWithAnonymousTypes {
next: Empty,
value: 31,
}
},
value: 30
};
zzz();
}
fn zzz() {()}
| let unique_unique: Box<UniqueNode<u32>> = box UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
value: 3,
}
},
value: 2,
}; | assignment_statement | [] |
Rust | shared/rust/src/api/endpoints/jig.rs | corinnewo/ji-cloud | 58fc898703ca0fc5b962e644dfcfbcce8547c525 | use crate::{
api::Method,
domain::{
jig::{
JigBrowseQuery, JigBrowseResponse, JigCountResponse, JigCreateRequest, JigId,
JigResponse, JigSearchQuery, JigSearchResponse, JigUpdateDraftDataRequest,
JigUpdateRequest,
},
CreateResponse,
},
error::{EmptyError, MetadataNotFound},
};
use super::ApiEndpoint;
pub mod module;
pub mod additional_resource;
pub mod player;
pub struct Create;
impl ApiEndpoint for Create {
type Req = JigCreateRequest;
type Res = CreateResponse<JigId>;
type Err = MetadataNotFound;
const PATH: &'static str = "/v1/jig";
const METHOD: Method = Method::Post;
}
pub struct Update;
impl ApiEndpoint for Update {
type Req = JigUpdateRequest;
type Res = ();
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}";
const METHOD: Method = Method::Patch;
}
pub struct GetLive;
impl ApiEndpoint for GetLive {
type Req = ();
type Res = JigResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/live";
const METHOD: Method = Method::Get;
}
pub struct GetDraft;
impl ApiEndpoint for GetDraft {
type Req = ();
type Res = JigResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/draft";
const METHOD: Method = Method::Get;
}
pub struct UpdateDraftData;
impl ApiEndpoint for UpdateDraftData {
type Req = JigUpdateDraftDataRequest;
type Res = ();
type Err = MetadataNotFound;
const PATH: &'static str = "/v1/jig/{id}/draft";
const METHOD: Method = Method::Patch;
}
pub struct Publish;
impl ApiEndpoint for Publish {
type Req = ();
type Res = ();
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/draft/publish";
const METHOD: Method = Method::Put;
}
pub struct Browse;
impl ApiEndpoint for Browse {
type Req = JigBrowseQuery;
type Res = JigBrowseResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/browse";
const METHOD: Method = Method::Get;
}
pub struct Search;
impl ApiEndpoint for Search {
type Req = JigSearchQuery;
type Res = JigSearchResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig";
const METHOD: Method = Method::Get;
}
pub struct Clone;
impl ApiEndpoint for Clone {
type Req = ();
type Res = CreateResponse<JigId>;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/clone";
const METHOD: Method = Method::Post;
}
pub struct Delete;
impl ApiEndpoint for Delete {
type Req = ();
type Res = ();
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}";
const METHOD: Method = Method::Delete;
}
pub struct Count;
impl ApiEndpoint for Count {
type Req = ();
type Res = JigCountResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/count";
const METHOD: Method = Method::Get;
}
| use crate::{
api::Method,
domain::{
jig::{
JigBrowseQuery, JigBrowseResponse, JigCountResponse, JigCreateRequest, JigId,
JigResponse, JigSearchQuery, JigSearchResponse, JigUpdateDraftDataRequest,
JigUpdateRequest,
},
CreateResponse,
},
error::{EmptyError, MetadataNotFound},
};
use super::ApiEndpoint;
pub | ApiEndpoint for Browse {
type Req = JigBrowseQuery;
type Res = JigBrowseResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/browse";
const METHOD: Method = Method::Get;
}
pub struct Search;
impl ApiEndpoint for Search {
type Req = JigSearchQuery;
type Res = JigSearchResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig";
const METHOD: Method = Method::Get;
}
pub struct Clone;
impl ApiEndpoint for Clone {
type Req = ();
type Res = CreateResponse<JigId>;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/clone";
const METHOD: Method = Method::Post;
}
pub struct Delete;
impl ApiEndpoint for Delete {
type Req = ();
type Res = ();
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}";
const METHOD: Method = Method::Delete;
}
pub struct Count;
impl ApiEndpoint for Count {
type Req = ();
type Res = JigCountResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/count";
const METHOD: Method = Method::Get;
}
| mod module;
pub mod additional_resource;
pub mod player;
pub struct Create;
impl ApiEndpoint for Create {
type Req = JigCreateRequest;
type Res = CreateResponse<JigId>;
type Err = MetadataNotFound;
const PATH: &'static str = "/v1/jig";
const METHOD: Method = Method::Post;
}
pub struct Update;
impl ApiEndpoint for Update {
type Req = JigUpdateRequest;
type Res = ();
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}";
const METHOD: Method = Method::Patch;
}
pub struct GetLive;
impl ApiEndpoint for GetLive {
type Req = ();
type Res = JigResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/live";
const METHOD: Method = Method::Get;
}
pub struct GetDraft;
impl ApiEndpoint for GetDraft {
type Req = ();
type Res = JigResponse;
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/draft";
const METHOD: Method = Method::Get;
}
pub struct UpdateDraftData;
impl ApiEndpoint for UpdateDraftData {
type Req = JigUpdateDraftDataRequest;
type Res = ();
type Err = MetadataNotFound;
const PATH: &'static str = "/v1/jig/{id}/draft";
const METHOD: Method = Method::Patch;
}
pub struct Publish;
impl ApiEndpoint for Publish {
type Req = ();
type Res = ();
type Err = EmptyError;
const PATH: &'static str = "/v1/jig/{id}/draft/publish";
const METHOD: Method = Method::Put;
}
pub struct Browse;
impl | random | [
{
"content": "pub fn delete_jig(state: Rc<State>, jig_id: JigId) {\n\n state.loader.load(clone!(state => async move {\n\n let path = Delete::PATH.replace(\"{id}\",&jig_id.0.to_string());\n\n match api_with_auth_empty::<EmptyError, ()>(&path, Delete::METHOD, None).await {\n\n Ok(_) =>... |
Rust | src/columnar_transposition.rs | sula0/embedo | fa3ddcc54ea481ecffe5c765706aa6e1b42a6be1 | use crate::util;
const META_ROWS: usize = 2;
const EMPTY_CHAR: u32 = 32;
pub fn encrypt(text: &str, key: &str) -> String {
let mut result = String::new();
let cols = key.len();
let required_rows = text.len() as f32 / cols as f32;
let rows = META_ROWS + (required_rows as f32).ceil() as usize;
let mut matrix = vec![vec![32; cols]; rows];
let key_chars: Vec<char> = key.to_uppercase().chars().collect();
let text_chars: Vec<char> = text.chars().collect();
/*
Keys vec contains tuple consisted of the alphabetized value
of the key char and its index. Later we sort by the alphabetized
value to get the column reading order.
*/
let mut keys: Vec<(u32, u32)> = vec![];
/*
Fill up the matrix.
First row contains the key. Second row contains
the order of alphabets in the key. Rest of the rows
are filled with the text which will be encrypted.
*/
for i in 0..rows {
for j in 0..cols {
if i == 0 {
matrix[i][j] = key_chars[j] as u32;
} else if i == 1 {
let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);
matrix[i][j] = alphabetized_char;
keys.push((j as u32, alphabetized_char));
} else {
let char_index = (i - META_ROWS) + j + ((i - META_ROWS) * (cols - 1));
if char_index < text_chars.len() {
matrix[i][j] = text_chars[char_index] as u32;
} else {
matrix[i][j] = EMPTY_CHAR;
}
}
}
}
keys.sort_by(|a, b| a.1.cmp(&b.1));
/*
Read the columns of the text. Order of reading
is determined but the key alphabets.
*/
for j in keys.iter() {
for i in META_ROWS..rows {
let c = matrix[i as usize][j.0 as usize];
result += std::str::from_utf8(&[c as u8]).unwrap();
}
}
result
}
pub fn decrypt(text: &str, key: &str) -> String {
let mut result = String::new();
let cols = key.len();
let required_rows = text.len() as f32 / cols as f32;
let rows = META_ROWS + (required_rows as f32).ceil() as usize;
let mut matrix = vec![vec![32; cols]; rows];
let key_chars: Vec<char> = key.to_uppercase().chars().collect();
let text_chars: Vec<char> = text.chars().collect();
/*
Keys vec contains tuple consisted of the alphabetized value
of the key char and its index. Later we sort by the alphabetized
value to get the column reading order.
*/
let mut keys: Vec<(u32, u32)> = vec![];
/*
Fill up the matrix.
First row contains the key. Second row contains
the order of alphabets in the key. Rest of the rows
are filled with the text which will be decrypted.
*/
for i in 0..rows {
for j in 0..cols {
if i == 0 {
matrix[i][j] = key_chars[j] as u32;
} else if i == 1 {
let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);
matrix[i][j] = alphabetized_char;
keys.push((j as u32, alphabetized_char));
}
}
}
keys.sort_by(|a, b| a.1.cmp(&b.1));
let mut char_index: usize = 0;
/*
Write the columns of the text. Order of writing
is determined but the key alphabets.
*/
for j in keys.iter() {
for i in META_ROWS..rows {
if char_index < text_chars.len() {
matrix[i as usize][j.0 as usize] = text_chars[char_index] as u32;
} else {
matrix[i as usize][j.0 as usize] = EMPTY_CHAR;
}
char_index += 1;
}
}
for i in META_ROWS..rows {
for j in 0..cols {
let c = matrix[i as usize][j as usize];
result += std::str::from_utf8(&[c as u8]).unwrap();
}
}
result
}
| use crate::util;
const META_ROWS: usize = 2;
const EMPTY_CHAR: u32 = 32;
pub fn encrypt(text: &str, key: &str) -> String {
let mut result = String::new();
let cols = key.len();
let required_rows = text.len() as f32 / cols as f32;
let rows = META_ROWS + (required_rows as f32).ceil() as usize;
let mut matrix = vec![vec![32; cols]; rows];
let key_chars: Vec<char> = key.to_uppercase().chars().collect();
let text_chars: Vec<char> = text.chars().collect();
/*
Keys vec contains tuple consisted of the alphabetized value
of the key char and its index. Later we sort by the alphabetized
value to get the column reading order.
*/
let mut keys: Vec<(u32, u32)> = vec![];
/*
Fill up the matrix.
First row contains the key. Second row contains
the order of alphabets in the key. Rest of the rows
are filled with the text which will be encrypted.
*/
for i in 0..rows {
for j in 0..cols {
if i == 0 {
matrix[i][j] = key_chars[j] as u32;
} else if i == 1 {
let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);
matrix[i][j] = alphabetized_char;
keys.push((j as u32, alphabetized_char));
} else {
let char_index = (i - META_ROWS) + j + ((i - META_ROWS) * (cols - 1));
if char_index < text_chars.len() {
matrix[i][j] = text_chars[char_index] as u32;
} else {
matrix[i][j] = EMPTY_CHAR;
}
}
}
}
keys.sort_by(|a, b| a.1.cmp(&b.1));
/*
Read the columns of the text. Order of reading
is determined but the key alphabets.
*/
for j in keys.iter() {
for i in META_ROWS..rows {
let c = matrix[i as usize][j.0 as usize];
result += std::str::from_utf8(&[c as u8]).unwrap();
}
}
result
}
pub fn decr | f i == 1 {
let alphabetized_char = util::alphabetize_char(key_chars[j] as u32, true);
matrix[i][j] = alphabetized_char;
keys.push((j as u32, alphabetized_char));
}
}
}
keys.sort_by(|a, b| a.1.cmp(&b.1));
let mut char_index: usize = 0;
/*
Write the columns of the text. Order of writing
is determined but the key alphabets.
*/
for j in keys.iter() {
for i in META_ROWS..rows {
if char_index < text_chars.len() {
matrix[i as usize][j.0 as usize] = text_chars[char_index] as u32;
} else {
matrix[i as usize][j.0 as usize] = EMPTY_CHAR;
}
char_index += 1;
}
}
for i in META_ROWS..rows {
for j in 0..cols {
let c = matrix[i as usize][j as usize];
result += std::str::from_utf8(&[c as u8]).unwrap();
}
}
result
}
| ypt(text: &str, key: &str) -> String {
let mut result = String::new();
let cols = key.len();
let required_rows = text.len() as f32 / cols as f32;
let rows = META_ROWS + (required_rows as f32).ceil() as usize;
let mut matrix = vec![vec![32; cols]; rows];
let key_chars: Vec<char> = key.to_uppercase().chars().collect();
let text_chars: Vec<char> = text.chars().collect();
/*
Keys vec contains tuple consisted of the alphabetized value
of the key char and its index. Later we sort by the alphabetized
value to get the column reading order.
*/
let mut keys: Vec<(u32, u32)> = vec![];
/*
Fill up the matrix.
First row contains the key. Second row contains
the order of alphabets in the key. Rest of the rows
are filled with the text which will be decrypted.
*/
for i in 0..rows {
for j in 0..cols {
if i == 0 {
matrix[i][j] = key_chars[j] as u32;
} else i | function_block-random_span | [
{
"content": "pub fn encrypt(text: &str, n: u32) -> String {\n\n let mut result = String::new();\n\n\n\n for c in text.chars() {\n\n let is_upper = c.is_uppercase();\n\n\n\n let encrypted = (util::alphabetize_char(c as u32, is_upper) + n) % 26;\n\n result += std::str::from_utf8(&[util... |
Rust | experiments/src/bin/graphs.rs | petrosagg/differential-dataflow | 2e38abbb62aedf02cb9b6b5debb73c29b6e97dbb | extern crate rand;
extern crate timely;
extern crate differential_dataflow;
use std::rc::Rc;
use rand::{Rng, SeedableRng, StdRng};
use timely::dataflow::*;
use differential_dataflow::input::Input;
use differential_dataflow::Collection;
use differential_dataflow::operators::*;
use differential_dataflow::trace::Trace;
use differential_dataflow::operators::arrange::ArrangeByKey;
use differential_dataflow::operators::arrange::ArrangeBySelf;
use differential_dataflow::trace::implementations::spine_fueled::Spine;
type Node = usize;
use differential_dataflow::trace::implementations::ord::OrdValBatch;
type GraphTrace = Spine<Node, Node, (), isize, Rc<OrdValBatch<Node, Node, (), isize>>>;
fn main() {
let nodes: usize = std::env::args().nth(1).unwrap().parse().unwrap();
let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();
timely::execute_from_args(std::env::args().skip(3), move |worker| {
let index = worker.index();
let peers = worker.peers();
let timer = ::std::time::Instant::now();
let (mut graph, mut trace) = worker.dataflow(|scope| {
let (graph_input, graph) = scope.new_collection();
let graph_indexed = graph.arrange_by_key();
(graph_input, graph_indexed.trace)
});
let seed: &[_] = &[1, 2, 3, index];
let mut rng1: StdRng = SeedableRng::from_seed(seed);
if index == 0 { println!("performing workload on random graph with {} nodes, {} edges:", nodes, edges); }
let worker_edges = edges/peers + if index < (edges % peers) { 1 } else { 0 };
for _ in 0 .. worker_edges {
graph.insert((rng1.gen_range(0, nodes) as Node, rng1.gen_range(0, nodes) as Node));
}
graph.close();
while worker.step() { }
if index == 0 { println!("{:?}\tgraph loaded", timer.elapsed()); }
let mut roots = worker.dataflow(|scope| {
let (roots_input, roots) = scope.new_collection();
reach(&mut trace, roots);
roots_input
});
if index == 0 { roots.insert(0); }
roots.close();
while worker.step() { }
if index == 0 { println!("{:?}\treach complete", timer.elapsed()); }
let mut roots = worker.dataflow(|scope| {
let (roots_input, roots) = scope.new_collection();
bfs(&mut trace, roots);
roots_input
});
if index == 0 { roots.insert(0); }
roots.close();
while worker.step() { }
if index == 0 { println!("{:?}\tbfs complete", timer.elapsed()); }
}).unwrap();
}
use differential_dataflow::operators::arrange::TraceAgent;
type TraceHandle = TraceAgent<GraphTrace>;
fn reach<G: Scope<Timestamp = ()>> (
graph: &mut TraceHandle,
roots: Collection<G, Node>
) -> Collection<G, Node> {
let graph = graph.import(&roots.scope());
roots.iterate(|inner| {
let graph = graph.enter(&inner.scope());
let roots = roots.enter(&inner.scope());
graph.join_core(&inner.arrange_by_self(), |_src,&dst,&()| Some(dst))
.concat(&roots)
.distinct_total()
})
}
fn bfs<G: Scope<Timestamp = ()>> (
graph: &mut TraceHandle,
roots: Collection<G, Node>
) -> Collection<G, (Node, u32)> {
let graph = graph.import(&roots.scope());
let roots = roots.map(|r| (r,0));
roots.iterate(|inner| {
let graph = graph.enter(&inner.scope());
let roots = roots.enter(&inner.scope());
graph.join_map(&inner, |_src,&dest,&dist| (dest, dist+1))
.concat(&roots)
.reduce(|_key, input, output| output.push((*input[0].0,1)))
})
}
| extern crate rand;
extern crate timely;
extern crate differential_dataflow;
use std::rc::Rc;
use rand::{Rng, SeedableRng, StdRng};
use timely::dataflow::*;
use differential_dataflow::input::Input;
use differential_dataflow::Collection;
use differential_dataflow::operators::*;
use differential_dataflow::trace::Trace;
use differential_dataflow::operators::arrange::ArrangeByKey;
use differential_dataflow::operators::arrange::ArrangeBySelf;
use differential_dataflow::trace::implementations::spine_fueled::Spine;
type Node = usize;
use differential_dataflow::trace::implementations::ord::OrdValBatch;
type GraphTrace = Spine<Node, Node, (), isize, Rc<OrdValBatch<Node, Node, (), isize>>>;
fn main() {
let nodes: usize = std::env::args().nth(1).unwrap().parse().unwrap();
let edges: usize = std::env::args().nth(2).unwrap().parse().unwrap();
timely::execute_from_args(std::env::args().skip(3), move |worker| {
let index = worker.index();
let peers = worker.peers();
let timer = ::std::time::Instant::now();
let (mut graph, mut trace) = worker.dataflow(|scope| {
let (graph_input, graph) = scope.new_collection();
let graph_indexed = graph.arrange_by_key();
(graph_input, graph_indexed.trace)
});
let seed: &[_] = &[1, 2, 3, index];
let mut rng1: StdRng = SeedableRng::from_seed(seed);
if index == 0 { println!("performing workload on random graph with {} nodes, {} edges:", nodes, edges); }
let worker_edges = edges/peers + if index < (edges % peers) { 1 } else { 0 };
for _ in 0 .. worker_edges {
graph.insert((rng1.gen_range(0, nodes) as Node, rng1.gen_range(0, nodes) as Node));
}
graph.close();
while worker.step() { }
if index == 0 { println!("{:?}\tgraph loaded", timer.elapsed()); }
let mut roots = worker.dataflow(|scope| {
let (roots_input, roots) = scope.new_collection();
reach(&mut trace, roots);
roots_input
});
if index == 0 { roots.insert(0); }
roots.close();
while worker.step() { }
if index == 0 { println!("{:?}\treach complete", timer.elapsed()); }
let mut roots = worker.dataflow(|scope| {
let (roots_input, roots) = scope.new_collection();
bfs(&mut trace, roots);
roots_input
});
if index == 0 { roots.insert(0); }
roots.close();
while worker.step() { }
if index == 0 { println!("{:?}\tbfs complete", timer.elapsed()); }
}).unwrap();
}
use differential_dataflow::operators::arrange::TraceAgent;
type TraceHandle = TraceAgent<GraphTrace>;
fn reach<G: Scope<Timestamp = ()>> (
graph: &mut TraceHandle,
roots: Collection<G, Node>
) -> Collection<G, Node> {
let graph = graph.import(&roots.scope());
roots.iterate(|inner| {
let graph = graph.enter(&inne |
fn bfs<G: Scope<Timestamp = ()>> (
graph: &mut TraceHandle,
roots: Collection<G, Node>
) -> Collection<G, (Node, u32)> {
let graph = graph.import(&roots.scope());
let roots = roots.map(|r| (r,0));
roots.iterate(|inner| {
let graph = graph.enter(&inner.scope());
let roots = roots.enter(&inner.scope());
graph.join_map(&inner, |_src,&dest,&dist| (dest, dist+1))
.concat(&roots)
.reduce(|_key, input, output| output.push((*input[0].0,1)))
})
}
| r.scope());
let roots = roots.enter(&inner.scope());
graph.join_core(&inner.arrange_by_self(), |_src,&dst,&()| Some(dst))
.concat(&roots)
.distinct_total()
})
} | function_block-function_prefixed | [
{
"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... |
Rust | boa/src/exec/mod.rs | RageKnify/boa | 7d318f0582a2aac5a01af762635000c686452ab4 |
mod array;
mod block;
mod break_node;
mod call;
mod conditional;
mod declaration;
mod field;
mod identifier;
mod iteration;
mod new;
mod object;
mod operator;
mod return_smt;
mod spread;
mod statement_list;
mod switch;
mod throw;
mod try_node;
#[cfg(test)]
mod tests;
use crate::{
syntax::ast::{constant::Const, node::Node},
BoaProfiler, Context, Result, Value,
};
pub trait Executable {
fn run(&self, interpreter: &mut Context) -> Result<Value>;
}
#[derive(Debug, Eq, PartialEq)]
pub(crate) enum InterpreterState {
Executing,
Return,
Break(Option<String>),
Continue(Option<String>),
}
#[derive(Debug)]
pub struct Interpreter {
state: InterpreterState,
}
impl Default for Interpreter {
fn default() -> Self {
Self::new()
}
}
impl Interpreter {
pub fn new() -> Self {
Self {
state: InterpreterState::Executing,
}
}
#[inline]
pub(crate) fn set_current_state(&mut self, new_state: InterpreterState) {
self.state = new_state
}
#[inline]
pub(crate) fn get_current_state(&self) -> &InterpreterState {
&self.state
}
}
impl Executable for Node {
fn run(&self, interpreter: &mut Context) -> Result<Value> {
let _timer = BoaProfiler::global().start_event("Executable", "exec");
match *self {
Node::Const(Const::Null) => Ok(Value::null()),
Node::Const(Const::Num(num)) => Ok(Value::rational(num)),
Node::Const(Const::Int(num)) => Ok(Value::integer(num)),
Node::Const(Const::BigInt(ref num)) => Ok(Value::from(num.clone())),
Node::Const(Const::Undefined) => Ok(Value::Undefined),
Node::Const(Const::String(ref value)) => Ok(Value::string(value.to_string())),
Node::Const(Const::Bool(value)) => Ok(Value::boolean(value)),
Node::Block(ref block) => block.run(interpreter),
Node::Identifier(ref identifier) => identifier.run(interpreter),
Node::GetConstField(ref get_const_field_node) => get_const_field_node.run(interpreter),
Node::GetField(ref get_field) => get_field.run(interpreter),
Node::Call(ref call) => call.run(interpreter),
Node::WhileLoop(ref while_loop) => while_loop.run(interpreter),
Node::DoWhileLoop(ref do_while) => do_while.run(interpreter),
Node::ForLoop(ref for_loop) => for_loop.run(interpreter),
Node::If(ref if_smt) => if_smt.run(interpreter),
Node::ConditionalOp(ref op) => op.run(interpreter),
Node::Switch(ref switch) => switch.run(interpreter),
Node::Object(ref obj) => obj.run(interpreter),
Node::ArrayDecl(ref arr) => arr.run(interpreter),
Node::FunctionDecl(ref decl) => decl.run(interpreter),
Node::FunctionExpr(ref function_expr) => function_expr.run(interpreter),
Node::ArrowFunctionDecl(ref decl) => decl.run(interpreter),
Node::BinOp(ref op) => op.run(interpreter),
Node::UnaryOp(ref op) => op.run(interpreter),
Node::New(ref call) => call.run(interpreter),
Node::Return(ref ret) => ret.run(interpreter),
Node::Throw(ref throw) => throw.run(interpreter),
Node::Assign(ref op) => op.run(interpreter),
Node::VarDeclList(ref decl) => decl.run(interpreter),
Node::LetDeclList(ref decl) => decl.run(interpreter),
Node::ConstDeclList(ref decl) => decl.run(interpreter),
Node::Spread(ref spread) => spread.run(interpreter),
Node::This => {
Ok(interpreter.realm().environment.get_this_binding())
}
Node::Try(ref try_node) => try_node.run(interpreter),
Node::Break(ref break_node) => break_node.run(interpreter),
Node::Continue(ref continue_node) => continue_node.run(interpreter),
}
}
}
|
mod array;
mod block;
mod break_node;
mod call;
mod conditional;
mod declaration;
mod field;
mod identifier;
mod iteration;
mod new;
mod object;
mod operator;
mod return_smt;
mod spread;
mod statement_list;
mod switch;
mod throw;
mod try_node;
#[cfg(test)]
mod tests;
use crate::{
syntax::ast::{constant::Const, node::Node},
BoaProfiler, Context, Result, Value,
};
pub trait Executable {
fn run(&self, interpreter: &mut Context) -> Result<Value>;
}
#[derive(Debug, Eq, PartialEq)]
pub(crate) enum InterpreterState {
Executing,
Return,
Break(Option<String>),
Continue(Option<String>),
}
#[derive(Debug)]
pub struct Interpreter {
state: InterpreterState,
}
impl Default for Interpreter {
fn default() -> Self {
Self::new()
}
}
impl Interpreter {
pub fn new() -> Self {
Self {
state: InterpreterState::Executing,
}
}
#[inline]
pub(crate) fn set_current_state(&mut self, new_state: InterpreterState) {
self.state = new_state
}
#[inline]
pub(crate) fn get_current_state(&self) -> &InterpreterState {
&self.state
}
}
impl Executable for Node {
fn run(&self, interpreter: &mut Context) -> Result<Value> {
let _timer = BoaProfiler::global().start_event("Executable", "exec");
match *self {
Node::Const(Const::Null) => Ok(Value::null()),
Node::Const(Const::Num(num)) => Ok(Value::rational(num)),
Node::Const(Const::Int(num)) => Ok(Value::integer(num)),
Node::Const(Const::BigInt(ref num)) => Ok(Value::from(num.clone())),
Node::Const(Const::Undefined) => Ok(Value::Undefined),
Node::Const(Const::String(ref value)) => Ok(Value::string(value.to_string())),
Node::Const(Const::Bool(value)) => Ok(Value::boolean(value)),
Node::Block(ref block) => block.run(interpreter),
Node::Identifier(ref identifier) => identifier.run(interpreter),
Node::GetConstField(ref get_const_field_node) => get_const_field_node.run(interpreter),
Node::GetField(ref get_field) => get_field.run(interpreter),
Node::Call(ref call) => call.run(interpreter),
Node::WhileLoop(ref while_loo |
}
| p) => while_loop.run(interpreter),
Node::DoWhileLoop(ref do_while) => do_while.run(interpreter),
Node::ForLoop(ref for_loop) => for_loop.run(interpreter),
Node::If(ref if_smt) => if_smt.run(interpreter),
Node::ConditionalOp(ref op) => op.run(interpreter),
Node::Switch(ref switch) => switch.run(interpreter),
Node::Object(ref obj) => obj.run(interpreter),
Node::ArrayDecl(ref arr) => arr.run(interpreter),
Node::FunctionDecl(ref decl) => decl.run(interpreter),
Node::FunctionExpr(ref function_expr) => function_expr.run(interpreter),
Node::ArrowFunctionDecl(ref decl) => decl.run(interpreter),
Node::BinOp(ref op) => op.run(interpreter),
Node::UnaryOp(ref op) => op.run(interpreter),
Node::New(ref call) => call.run(interpreter),
Node::Return(ref ret) => ret.run(interpreter),
Node::Throw(ref throw) => throw.run(interpreter),
Node::Assign(ref op) => op.run(interpreter),
Node::VarDeclList(ref decl) => decl.run(interpreter),
Node::LetDeclList(ref decl) => decl.run(interpreter),
Node::ConstDeclList(ref decl) => decl.run(interpreter),
Node::Spread(ref spread) => spread.run(interpreter),
Node::This => {
Ok(interpreter.realm().environment.get_this_binding())
}
Node::Try(ref try_node) => try_node.run(interpreter),
Node::Break(ref break_node) => break_node.run(interpreter),
Node::Continue(ref continue_node) => continue_node.run(interpreter),
}
} | function_block-function_prefixed | [
{
"content": "#[inline]\n\npub fn this_time_value(value: &Value, ctx: &mut Context) -> Result<Date> {\n\n if let Value::Object(ref object) = value {\n\n if let ObjectData::Date(ref date) = object.borrow().data {\n\n return Ok(*date);\n\n }\n\n }\n\n Err(ctx.construct_type_error... |
Rust | term/src/test/csi.rs | bcully/wezterm | ea401e1f58ca5a088ac5d5e1d7963f36269afb76 | use super::*;
#[test]
fn test_vpa() {
let mut term = TestTerm::new(3, 4, 0);
term.assert_cursor_pos(0, 0, None);
term.print("a\r\nb\r\nc");
term.assert_cursor_pos(1, 2, None);
term.print("\x1b[d");
term.assert_cursor_pos(1, 0, None);
term.print("\r\n\r\n");
term.assert_cursor_pos(0, 2, None);
term.print("\x1b[2d");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[-2d");
term.assert_cursor_pos(0, 1, None);
}
#[test]
fn test_rep() {
let mut term = TestTerm::new(3, 4, 0);
term.print("h");
term.cup(1, 0);
term.print("\x1b[2ba");
assert_visible_contents(&term, file!(), line!(), &["hhha", " ", " "]);
}
#[test]
fn test_irm() {
let mut term = TestTerm::new(3, 8, 0);
term.print("foo");
term.cup(0, 0);
term.print("\x1b[4hBAR");
assert_visible_contents(
&term,
file!(),
line!(),
&["BARfoo ", " ", " "],
);
}
#[test]
fn test_ich() {
let mut term = TestTerm::new(3, 4, 0);
term.print("hey!wat?");
term.cup(1, 0);
term.print("\x1b[2@");
assert_visible_contents(&term, file!(), line!(), &["h e", "wat?", " "]);
term.print("\x1b[12@");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
term.print("\x1b[-12@");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
}
#[test]
fn test_ech() {
let mut term = TestTerm::new(3, 4, 0);
term.print("hey!wat?");
term.cup(1, 0);
term.print("\x1b[2X");
assert_visible_contents(&term, file!(), line!(), &["h !", "wat?", " "]);
term.print("\x1b[12X");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
term.print("\x1b[-12X");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
}
#[test]
fn test_dch() {
let mut term = TestTerm::new(1, 12, 0);
term.print("hello world");
term.cup(1, 0);
term.print("\x1b[P");
assert_visible_contents(&term, file!(), line!(), &["hllo world "]);
term.cup(4, 0);
term.print("\x1b[2P");
assert_visible_contents(&term, file!(), line!(), &["hlloorld "]);
term.print("\x1b[-2P");
assert_visible_contents(&term, file!(), line!(), &["hlloorld "]);
}
#[test]
fn test_cup() {
let mut term = TestTerm::new(3, 4, 0);
term.cup(1, 1);
term.assert_cursor_pos(1, 1, None);
term.cup(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.cup(2, 2);
term.assert_cursor_pos(2, 2, None);
term.cup(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.cup(500, 500);
term.assert_cursor_pos(3, 2, None);
}
#[test]
fn test_hvp() {
let mut term = TestTerm::new(3, 4, 0);
term.hvp(1, 1);
term.assert_cursor_pos(1, 1, None);
term.hvp(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.hvp(2, 2);
term.assert_cursor_pos(2, 2, None);
term.hvp(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.hvp(500, 500);
term.assert_cursor_pos(3, 2, None);
}
#[test]
fn test_dl() {
let mut term = TestTerm::new(3, 1, 0);
term.print("a\r\nb\r\nc");
term.cup(0, 1);
term.delete_lines(1);
assert_visible_contents(&term, file!(), line!(), &["a", "c", " "]);
term.assert_cursor_pos(0, 1, None);
term.cup(0, 0);
term.delete_lines(2);
assert_visible_contents(&term, file!(), line!(), &[" ", " ", " "]);
term.print("1\r\n2\r\n3");
term.cup(0, 1);
term.delete_lines(-2);
assert_visible_contents(&term, file!(), line!(), &["1", "2", "3"]);
}
#[test]
fn test_cha() {
let mut term = TestTerm::new(3, 4, 0);
term.cup(1, 1);
term.assert_cursor_pos(1, 1, None);
term.print("\x1b[G");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[2G");
term.assert_cursor_pos(1, 1, None);
term.print("\x1b[0G");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[-1G");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[100G");
term.assert_cursor_pos(3, 1, None);
}
#[test]
fn test_ed() {
let mut term = TestTerm::new(3, 3, 0);
term.print("abc\r\ndef\r\nghi");
term.cup(1, 2);
term.print("\x1b[J");
assert_visible_contents(&term, file!(), line!(), &["abc", "def", "g "]);
term.print("\x1b[44m");
term.print("\x1b[2J");
let attr = CellAttributes::default()
.set_background(color::AnsiColor::Navy)
.clone();
let mut line: Line = " ".into();
line.fill_range(0..=2, &Cell::new(' ', attr.clone()));
assert_lines_equal(
file!(),
line!(),
&term.screen().visible_lines(),
&[line.clone(), line.clone(), line],
Compare::TEXT | Compare::ATTRS,
);
}
| use super::*;
#[test]
fn test_vpa() {
let mut term = TestTerm::new(3, 4, 0);
term.assert_cursor_pos(0, 0, None);
term.print("a\r\nb\r\nc");
term.assert_cursor_pos(1, 2, None);
term.print("\x1b[d");
term.assert_cursor_pos(1, 0, None);
term.print("\r\n\r\n");
term.assert_cursor_pos(0, 2, None);
term.print("\x1b[2d");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[-2d");
term.assert_cursor_pos(0, 1, None);
}
#[test]
fn test_rep() {
let mut term = TestTerm::new(3, 4, 0);
term.print("h");
term.cup(1, 0);
term.print("\x1b[2ba");
assert_visible_contents(&term, file!(), line!(), &["hhha", " ", " "]);
}
#[test]
fn test_irm() {
let mut term = TestTerm::new(3, 8, 0);
term.print("foo");
term.cup(0, 0);
term.print("\x1b[4hBAR");
assert_visible_contents(
&term,
file!(),
line!(),
&["BARfoo ", " ", " "],
);
}
#[test]
fn test_ich() {
let mut term = TestTerm::new(3, 4, 0);
term.print("hey!wat?");
term.cup(1, 0);
term.print("\x1b[2@");
|
#[test]
fn test_ech() {
let mut term = TestTerm::new(3, 4, 0);
term.print("hey!wat?");
term.cup(1, 0);
term.print("\x1b[2X");
assert_visible_contents(&term, file!(), line!(), &["h !", "wat?", " "]);
term.print("\x1b[12X");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
term.print("\x1b[-12X");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
}
#[test]
fn test_dch() {
let mut term = TestTerm::new(1, 12, 0);
term.print("hello world");
term.cup(1, 0);
term.print("\x1b[P");
assert_visible_contents(&term, file!(), line!(), &["hllo world "]);
term.cup(4, 0);
term.print("\x1b[2P");
assert_visible_contents(&term, file!(), line!(), &["hlloorld "]);
term.print("\x1b[-2P");
assert_visible_contents(&term, file!(), line!(), &["hlloorld "]);
}
#[test]
fn test_cup() {
let mut term = TestTerm::new(3, 4, 0);
term.cup(1, 1);
term.assert_cursor_pos(1, 1, None);
term.cup(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.cup(2, 2);
term.assert_cursor_pos(2, 2, None);
term.cup(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.cup(500, 500);
term.assert_cursor_pos(3, 2, None);
}
#[test]
fn test_hvp() {
let mut term = TestTerm::new(3, 4, 0);
term.hvp(1, 1);
term.assert_cursor_pos(1, 1, None);
term.hvp(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.hvp(2, 2);
term.assert_cursor_pos(2, 2, None);
term.hvp(-1, -1);
term.assert_cursor_pos(0, 0, None);
term.hvp(500, 500);
term.assert_cursor_pos(3, 2, None);
}
#[test]
fn test_dl() {
let mut term = TestTerm::new(3, 1, 0);
term.print("a\r\nb\r\nc");
term.cup(0, 1);
term.delete_lines(1);
assert_visible_contents(&term, file!(), line!(), &["a", "c", " "]);
term.assert_cursor_pos(0, 1, None);
term.cup(0, 0);
term.delete_lines(2);
assert_visible_contents(&term, file!(), line!(), &[" ", " ", " "]);
term.print("1\r\n2\r\n3");
term.cup(0, 1);
term.delete_lines(-2);
assert_visible_contents(&term, file!(), line!(), &["1", "2", "3"]);
}
#[test]
fn test_cha() {
let mut term = TestTerm::new(3, 4, 0);
term.cup(1, 1);
term.assert_cursor_pos(1, 1, None);
term.print("\x1b[G");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[2G");
term.assert_cursor_pos(1, 1, None);
term.print("\x1b[0G");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[-1G");
term.assert_cursor_pos(0, 1, None);
term.print("\x1b[100G");
term.assert_cursor_pos(3, 1, None);
}
#[test]
fn test_ed() {
let mut term = TestTerm::new(3, 3, 0);
term.print("abc\r\ndef\r\nghi");
term.cup(1, 2);
term.print("\x1b[J");
assert_visible_contents(&term, file!(), line!(), &["abc", "def", "g "]);
term.print("\x1b[44m");
term.print("\x1b[2J");
let attr = CellAttributes::default()
.set_background(color::AnsiColor::Navy)
.clone();
let mut line: Line = " ".into();
line.fill_range(0..=2, &Cell::new(' ', attr.clone()));
assert_lines_equal(
file!(),
line!(),
&term.screen().visible_lines(),
&[line.clone(), line.clone(), line],
Compare::TEXT | Compare::ATTRS,
);
}
| assert_visible_contents(&term, file!(), line!(), &["h e", "wat?", " "]);
term.print("\x1b[12@");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
term.print("\x1b[-12@");
assert_visible_contents(&term, file!(), line!(), &["h ", "wat?", " "]);
} | function_block-function_prefix_line | [
{
"content": "fn assert_all_contents(term: &Terminal, file: &str, line: u32, expect_lines: &[&str]) {\n\n print_all_lines(&term);\n\n let screen = term.screen();\n\n\n\n let expect: Vec<Line> = expect_lines.iter().map(|s| (*s).into()).collect();\n\n\n\n assert_lines_equal(file, line, &screen.all_lin... |
Rust | src/materialized/src/bin/materialized/sys.rs | bobbyiliev/materialize | 44e3bcae151179075232ad436ae72f5883361fd1 |
use std::alloc::{self, Layout};
use std::io::{self, Write};
use std::process;
use std::ptr;
use std::sync::atomic::{AtomicUsize, Ordering};
use anyhow::{bail, Context};
use nix::errno;
use nix::sys::signal;
use tracing::trace;
#[cfg(not(any(target_os = "macos", target_os = "linux", target_os = "ios")))]
pub fn adjust_rlimits() {
trace!("rlimit crate does not support this OS; not adjusting nofile limit");
}
#[cfg(any(target_os = "macos", target_os = "linux", target_os = "ios"))]
pub fn adjust_rlimits() {
use rlimit::Resource;
use tracing::warn;
let (soft, hard) = match Resource::NOFILE.get() {
Ok(limits) => limits,
Err(e) => {
trace!("unable to read initial nofile rlimit: {}", e);
return;
}
};
trace!("initial nofile rlimit: ({}, {})", soft, hard);
#[cfg(target_os = "macos")]
let hard = {
use mz_ore::result::ResultExt;
use std::cmp;
use sysctl::Sysctl;
let res = sysctl::Ctl::new("kern.maxfilesperproc")
.and_then(|ctl| ctl.value())
.map_err_to_string()
.and_then(|v| match v {
sysctl::CtlValue::Int(v) => u64::try_from(v)
.map_err(|_| format!("kern.maxfilesperproc unexpectedly negative: {}", v)),
o => Err(format!("unexpected sysctl value type: {:?}", o)),
});
match res {
Ok(v) => {
trace!("sysctl kern.maxfilesperproc hard limit: {}", v);
cmp::min(v, hard)
}
Err(e) => {
trace!("error while reading sysctl: {}", e);
hard
}
}
};
trace!("attempting to adjust nofile rlimit to ({0}, {0})", hard);
if let Err(e) = Resource::NOFILE.set(hard, hard) {
trace!("error adjusting nofile rlimit: {}", e);
return;
}
let (soft, hard) = match Resource::NOFILE.get() {
Ok(limits) => limits,
Err(e) => {
trace!("unable to read adjusted nofile rlimit: {}", e);
return;
}
};
trace!("adjusted nofile rlimit: ({}, {})", soft, hard);
const RECOMMENDED_SOFT: u64 = 1024;
if soft < RECOMMENDED_SOFT {
warn!(
"soft nofile rlimit ({}) is dangerously low; at least {} is recommended",
soft, RECOMMENDED_SOFT
)
}
}
pub fn enable_sigbus_sigsegv_backtraces() -> Result<(), anyhow::Error> {
const STACK_SIZE: usize = 2 << 20;
const STACK_ALIGN: usize = 16;
let buf_layout =
Layout::from_size_align(STACK_SIZE, STACK_ALIGN).expect("layout known to be valid");
let buf = unsafe { alloc::alloc(buf_layout) };
let stack = libc::stack_t {
ss_sp: buf as *mut libc::c_void,
ss_flags: 0,
ss_size: STACK_SIZE,
};
let ret = unsafe { libc::sigaltstack(&stack, ptr::null_mut()) };
if ret == -1 {
let errno = errno::from_i32(errno::errno());
bail!("failed to configure alternate signal stack: {}", errno);
}
let action = signal::SigAction::new(
signal::SigHandler::Handler(handle_sigbus_sigsegv),
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
unsafe { signal::sigaction(signal::SIGBUS, &action) }
.context("failed to install SIGBUS handler")?;
unsafe { signal::sigaction(signal::SIGSEGV, &action) }
.context("failed to install SIGSEGV handler")?;
Ok(())
}
pub fn enable_sigusr2_coverage_dump() -> Result<(), anyhow::Error> {
let action = signal::SigAction::new(
signal::SigHandler::Handler(handle_sigusr2_signal),
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
unsafe { signal::sigaction(signal::SIGUSR2, &action) }
.context("failed to install SIGUSR2 handler")?;
Ok(())
}
extern "C" fn handle_sigbus_sigsegv(_: i32) {
static SEEN: AtomicUsize = AtomicUsize::new(0);
match SEEN.fetch_add(1, Ordering::SeqCst) {
0 => {
panic!("received SIGSEGV or SIGBUS (maybe a stack overflow?)");
}
_ => {
let _ = io::stderr().write_all(b"SIGBUS or SIGSEGV while handling SIGSEGV or SIGBUS\n");
let _ = io::stderr().write_all(b"(maybe a stack overflow while allocating?)\n");
process::abort();
}
}
}
pub fn enable_termination_signal_cleanup() -> Result<(), anyhow::Error> {
let action = signal::SigAction::new(
signal::SigHandler::Handler(handle_termination_signal),
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
for signum in &[
signal::SIGHUP,
signal::SIGINT,
signal::SIGALRM,
signal::SIGTERM,
signal::SIGUSR1,
] {
unsafe { signal::sigaction(*signum, &action) }
.with_context(|| format!("failed to install handler for {}", signum))?;
}
Ok(())
}
extern "C" {
fn __llvm_profile_write_file() -> libc::c_int;
}
extern "C" fn handle_sigusr2_signal(_: i32) {
let _ = unsafe { __llvm_profile_write_file() };
}
extern "C" fn handle_termination_signal(signum: i32) {
let _ = unsafe { __llvm_profile_write_file() };
let action = signal::SigAction::new(
signal::SigHandler::SigDfl,
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
unsafe { signal::sigaction(signum.try_into().unwrap(), &action) }
.unwrap_or_else(|_| panic!("failed to uninstall handler for {}", signum));
let ret = unsafe { libc::raise(signum) };
if ret == -1 {
let errno = errno::from_i32(errno::errno());
panic!("failed to re-raise signal {}: {}", signum, errno);
}
}
|
use std::alloc::{self, Layout};
use std::io::{self, Write};
use std::process;
use std::ptr;
use std::sync::atomic::{AtomicUsize, Ordering};
use anyhow::{bail, Context};
use nix::errno;
use nix::sys::signal;
use tracing::trace;
#[cfg(not(any(target_os = "macos", target_os = "linux", target_os = "ios")))]
pub fn adjust_rlimits() {
trace!("rlimit crate does not support this OS; not adjusting nofile limit");
}
#[cfg(any(target_os = "macos", target_os = "linux", target_os = "ios"))]
pub fn adjust_rlimits() {
use rlimit::Resource;
use tracing::warn;
let (soft, hard) = match Resource::NOFILE.get() {
Ok(limits) => limits,
Err(e) => {
trace!("unable to read initial nofile rlimit: {}", e);
return;
}
};
trace!("initial nofile rlimit: ({}, {})", soft, hard);
#[cfg(target_os = "macos")]
let hard = {
use mz_ore::result::ResultExt;
use std::cmp;
use sysctl::Sysctl;
let res = sysctl::Ctl::new("kern.maxfilesperproc")
.and_then(|ctl| ctl.value())
.map_err_to_string()
.and_then(|v| match v {
sysctl::CtlValue::Int(v) => u64::try_from(v)
.map_err(|_| format!("kern.maxfilesperproc unexpectedly negative: {}", v)),
o => Err(format!("unexpected sysctl value type: {:?}", o)),
});
match res {
Ok(v) => {
trace!("sysctl kern.maxfilesperproc hard limit: {}", v);
cmp::min(v, hard)
}
Err(e) => {
trace!("error while reading sysctl: {}", e);
hard
}
}
};
trace!("attempting to adjust nofile rlimit to ({0}, {0})", hard);
if let Err(e) = Resource::NOFILE.set(hard, hard) {
trace!("error adjusting nofile rlimit: {}", e);
return;
}
let (soft, hard) = match Resource::NOFILE.get() {
Ok(limits) => limits,
Err(e) => {
trace!("unable to read adjusted nofile rlimit: {}", e);
return;
}
};
trace!("adjusted nofile rlimit: ({}, {})", soft, hard);
const RECOMMENDED_SOFT: u64 = 1024;
if soft < RECOMMENDED_SOFT {
warn!(
"soft nofile rlimit ({}) is dangerously low; at least {} is recommended",
soft, RECOMMENDED_SOFT
)
}
}
pub fn enable_sigbus_sigsegv_backtraces() -> Result<(), anyhow::Error> {
const STACK_SIZE: usize = 2 << 20;
const STACK_ALIGN: usize = 16;
let buf_layout =
Layout::from_size_align(STACK_SIZE, STACK_ALIGN).expect("layout known to be valid");
let buf = unsafe { alloc::alloc(buf_layout) };
let stack = libc::stack_ |
pub fn enable_sigusr2_coverage_dump() -> Result<(), anyhow::Error> {
let action = signal::SigAction::new(
signal::SigHandler::Handler(handle_sigusr2_signal),
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
unsafe { signal::sigaction(signal::SIGUSR2, &action) }
.context("failed to install SIGUSR2 handler")?;
Ok(())
}
extern "C" fn handle_sigbus_sigsegv(_: i32) {
static SEEN: AtomicUsize = AtomicUsize::new(0);
match SEEN.fetch_add(1, Ordering::SeqCst) {
0 => {
panic!("received SIGSEGV or SIGBUS (maybe a stack overflow?)");
}
_ => {
let _ = io::stderr().write_all(b"SIGBUS or SIGSEGV while handling SIGSEGV or SIGBUS\n");
let _ = io::stderr().write_all(b"(maybe a stack overflow while allocating?)\n");
process::abort();
}
}
}
pub fn enable_termination_signal_cleanup() -> Result<(), anyhow::Error> {
let action = signal::SigAction::new(
signal::SigHandler::Handler(handle_termination_signal),
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
for signum in &[
signal::SIGHUP,
signal::SIGINT,
signal::SIGALRM,
signal::SIGTERM,
signal::SIGUSR1,
] {
unsafe { signal::sigaction(*signum, &action) }
.with_context(|| format!("failed to install handler for {}", signum))?;
}
Ok(())
}
extern "C" {
fn __llvm_profile_write_file() -> libc::c_int;
}
extern "C" fn handle_sigusr2_signal(_: i32) {
let _ = unsafe { __llvm_profile_write_file() };
}
extern "C" fn handle_termination_signal(signum: i32) {
let _ = unsafe { __llvm_profile_write_file() };
let action = signal::SigAction::new(
signal::SigHandler::SigDfl,
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
unsafe { signal::sigaction(signum.try_into().unwrap(), &action) }
.unwrap_or_else(|_| panic!("failed to uninstall handler for {}", signum));
let ret = unsafe { libc::raise(signum) };
if ret == -1 {
let errno = errno::from_i32(errno::errno());
panic!("failed to re-raise signal {}: {}", signum, errno);
}
}
| t {
ss_sp: buf as *mut libc::c_void,
ss_flags: 0,
ss_size: STACK_SIZE,
};
let ret = unsafe { libc::sigaltstack(&stack, ptr::null_mut()) };
if ret == -1 {
let errno = errno::from_i32(errno::errno());
bail!("failed to configure alternate signal stack: {}", errno);
}
let action = signal::SigAction::new(
signal::SigHandler::Handler(handle_sigbus_sigsegv),
signal::SaFlags::SA_NODEFER | signal::SaFlags::SA_ONSTACK,
signal::SigSet::empty(),
);
unsafe { signal::sigaction(signal::SIGBUS, &action) }
.context("failed to install SIGBUS handler")?;
unsafe { signal::sigaction(signal::SIGSEGV, &action) }
.context("failed to install SIGSEGV handler")?;
Ok(())
} | function_block-function_prefixed | [
{
"content": "fn encode_element(buf: &mut BytesMut, elem: Option<&Value>, ty: &Type) -> Result<(), io::Error> {\n\n match elem {\n\n None => buf.put_i32(-1),\n\n Some(elem) => {\n\n let base = buf.len();\n\n buf.put_i32(0);\n\n elem.encode_binary(ty, buf)?;\n\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.