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,\\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>,\\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,\\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,\\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>,\\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) -> 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 {\\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 {\\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 {\\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]"}}},{"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 for WindowFrame {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrame) -> Result {\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),\n \n \n \n \n \n \n CurrentRow,\n \n \n \n \n \n Following(Option),\n}\n\nimpl TryFrom for WindowFrameBound {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrameBound) -> Result {\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,\n leading_precision: &Option,\n last_field: &Option,\n fractional_seconds_precision: &Option,\n) -> Result {\n match SqlToRel::::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 {\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 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 for WindowFrame {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrame) -> Result {\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),\n \n \n \n \n \n \n CurrentRow,\n \n \n \n \n \n Following(Option),\n}\n\nimpl TryFrom for WindowFrameBound {\n type Error = DataFusionError;\n\n fn try_from(value: ast::WindowFrameBound) -> Result {\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,\n leading_precision: &Option,\n last_field: &Option,\n fractional_seconds_precision: &Option,\n) -> Result {\n match SqlToRel::::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 {\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 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(args: &[ColumnarValue], op: F, name: &str) -> Result\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\n\nwhere\n\n R: AsRef,\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 {\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 {\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>>`, 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(expr: &Expr, replacement_fn: &F) -> Result\n\nwhere\n\n F: Fn(&Expr) -> Result>,\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>,\n\n value_columns: &mut Vec>,\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::()\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: F) -> JoinHandle\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 {\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 {\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 {\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(v: Vec, rewriter: &mut R) -> Result>\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 {\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(value: (Result, Result)) -> 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 {\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> {\n\n let mut filenames: Vec = 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 for BallistaError {\n\n fn from(e: String) -> Self {\n\n BallistaError::General(e)\n\n }\n\n}\n\n\n\nimpl From for BallistaError {\n\n fn from(e: ArrowError) -> Self {\n\n BallistaError::ArrowError(e)\n\n }\n\n}\n\n\n\nimpl From 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 {\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 {\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 {\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 {\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> {\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(boxed_expr: Box, rewriter: &mut R) -> Result>\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 {\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 {\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::>()?;\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]) -> 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 {\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::(&[\n\n a.as_ref()\n\n ])?))),\n\n DataType::LargeUtf8 => {\n\n Ok(ColumnarValue::Array(Arc::new(md5_array::(&[\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 {\n\n handle(args, sha_process::, \"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 {\n\n handle(args, sha_process::, \"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 {\n\n handle(args, sha_process::, \"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 {\n\n handle(args, sha_process::, \"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 {\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 {\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 {\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 {\n\n handle::(\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 {\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) -> 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) -> 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 {\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 {\n\n handle::(\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 {\n\n handle::(\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 {\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| 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 {\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 {\n\n handle::(\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 {\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::().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::().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::().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::().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::().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> {\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>,\n\n aggr_expr: Vec>,\n\n mut input: SendableRecordBatchStream,\n\n) -> ArrowResult {\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 {\n\n let timestamps = &args[0]\n\n .as_any()\n\n .downcast_ref::()\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::()\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 = 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 {\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 {\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>(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, 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(args: &[ArrayRef]) -> Result\n\nwhere\n\n T::Native: StringOffsetSizeTrait,\n\n{\n\n let string_array: &GenericStringArray = args[0]\n\n .as_any()\n\n .downcast_ref::>()\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 = args[1]\n\n .as_any()\n\n .downcast_ref::>()\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(args: &[ArrayRef]) -> Result\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::>();\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(inner: F) -> ScalarFunctionImplementation\n\nwhere\n\n F: Fn(&[ArrayRef]) -> Result + 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::::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::>()\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(args: &[ArrayRef]) -> Result {\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::();\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(args: &[ArrayRef]) -> Result\n\nwhere\n\n T::Native: StringOffsetSizeTrait,\n\n{\n\n let string_array: &GenericStringArray = args[0]\n\n .as_any()\n\n .downcast_ref::>()\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::>();\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 {\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::()?)),\n\n \"Int16Scalar\" => ScalarValue::Int16(Some(p.extract::()?)),\n\n \"Int32Scalar\" => ScalarValue::Int32(Some(p.extract::()?)),\n\n \"Int64Scalar\" => ScalarValue::Int64(Some(p.extract::()?)),\n\n \"UInt8Scalar\" => ScalarValue::UInt8(Some(p.extract::()?)),\n\n \"UInt16Scalar\" => ScalarValue::UInt16(Some(p.extract::()?)),\n\n \"UInt32Scalar\" => ScalarValue::UInt32(Some(p.extract::()?)),\n\n \"UInt64Scalar\" => ScalarValue::UInt64(Some(p.extract::()?)),\n\n \"FloatScalar\" => ScalarValue::Float32(Some(p.extract::()?)),\n\n \"DoubleScalar\" => ScalarValue::Float64(Some(p.extract::()?)),\n\n \"BooleanScalar\" => ScalarValue::Boolean(Some(p.extract::()?)),\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 {\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(args: &[ArrayRef]) -> Result {\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(\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(\n\n args: &[&dyn Array],\n\n op: F,\n\n name: &str,\n\n) -> Result\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::>()\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 {\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,\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 {\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(\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 {\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> {\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 {\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],\n\n partition_by: &[Arc],\n\n order_by: &[PhysicalSortExpr],\n\n window_frame: Option,\n\n input_schema: &Schema,\n\n) -> Result> {\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 = (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],\n\n schema: &Schema,\n\n signature: &Signature,\n\n) -> Result>> {\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::>>()?;\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::>>()\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 {\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| {\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::>()?;\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> {\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 = 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 {\n\n // downcast all arguments to strings\n\n let args = downcast_vec!(args, StringArray).collect::>>()?;\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 {\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 {\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 {\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::()\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- ,\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
(bytes: &[u8]) -> Result {\n\n T::decode(bytes).map_err(|e| {\n\n BallistaError::Internal(format!(\n\n \"Could not deserialize {}: {}\",\n\n type_name::(),\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 {\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 {\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 = 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 {\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 {\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(\n\n col: &ArrayRef,\n\n row: usize,\n\n) -> Result {\n\n let dict_col = col.as_any().downcast_ref::>().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 {\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- ) -> Vec
{\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(msg: &T) -> Result> {\n\n let mut value: Vec = 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::(),\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(input: &str) -> SHA2DigestOutput {\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(args: &[ColumnarValue], op: F, name: &str) -> Result\\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\\n\\nwhere\\n\\n R: AsRef,\\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 {\\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 {\\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>>`, 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(expr: &Expr, replacement_fn: &F) -> Result\\n\\nwhere\\n\\n F: Fn(&Expr) -> Result>,\\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>,\\n\\n value_columns: &mut Vec>,\\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::()\\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: F) -> JoinHandle\\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 {\\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 {\\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 {\\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(v: Vec, rewriter: &mut R) -> Result>\\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 {\\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(value: (Result, Result)) -> 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 {\\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> {\\n\\n let mut filenames: Vec = 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 for BallistaError {\\n\\n fn from(e: String) -> Self {\\n\\n BallistaError::General(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From for BallistaError {\\n\\n fn from(e: ArrowError) -> Self {\\n\\n BallistaError::ArrowError(e)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From 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 {\\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 {\\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 {\\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 {\\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> {\\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