,\\n\\n) -> Result, log::SetLoggerError> {\\n\\n log::set_max_level(options.log_level);\\n\\n\\n\\n let logger = Logger::new(event_proxy);\\n\\n let path = logger.file_path();\\n\\n log::set_boxed_logger(Box::new(logger))?;\\n\\n\\n\\n Ok(path)\\n\\n}\\n\\n\\n\\npub struct Logger {\\n\\n logfile: Mutex,\\n\\n stdout: Mutex>,\\n\\n event_proxy: Mutex>,\\n\\n}\\n\\n\\n\\nimpl Logger {\\n\",\n \"file_path\": \"alacritty/src/logging.rs\",\n \"rank\": 63,\n \"score\": 162336.29875859205\n },\n {\n \"content\": \"fn main() {\\n\\n println!(\\\"cargo:rustc-env=GIT_HASH={}\\\", commit_hash());\\n\\n\\n\\n let dest = env::var(\\\"OUT_DIR\\\").unwrap();\\n\\n let mut file = File::create(&Path::new(&dest).join(\\\"gl_bindings.rs\\\")).unwrap();\\n\\n\\n\\n Registry::new(Api::Gl, (3, 3), Profile::Core, Fallbacks::All, [\\\"GL_ARB_blend_func_extended\\\"])\\n\\n .write_bindings(GlobalGenerator, &mut file)\\n\\n .unwrap();\\n\\n\\n\\n #[cfg(windows)]\\n\\n embed_resource::compile(\\\"../extra/windows/windows.rc\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty/build.rs\",\n \"rank\": 64,\n \"score\": 159922.64689870435\n },\n {\n \"content\": \"#[inline]\\n\\nfn load_glyph(\\n\\n active_tex: &mut GLuint,\\n\\n atlas: &mut Vec,\\n\\n current_atlas: &mut usize,\\n\\n rasterized: &RasterizedGlyph,\\n\\n) -> Glyph {\\n\\n // At least one atlas is guaranteed to be in the `self.atlas` list; thus\\n\\n // the unwrap.\\n\\n match atlas[*current_atlas].insert(rasterized, active_tex) {\\n\\n Ok(glyph) => glyph,\\n\\n Err(AtlasInsertError::Full) => {\\n\\n *current_atlas += 1;\\n\\n if *current_atlas == atlas.len() {\\n\\n let new = Atlas::new(ATLAS_SIZE);\\n\\n *active_tex = 0; // Atlas::new binds a texture. Ugh this is sloppy.\\n\\n atlas.push(new);\\n\\n }\\n\\n load_glyph(active_tex, atlas, current_atlas, rasterized)\\n\\n },\\n\\n Err(AtlasInsertError::GlyphTooLarge) => Glyph {\\n\",\n \"file_path\": \"alacritty/src/renderer/mod.rs\",\n \"rank\": 65,\n \"score\": 158099.38226962477\n },\n {\n \"content\": \"/// This trait defines the behaviour needed to read and/or write to a stream.\\n\\n/// It defines an abstraction over mio's interface in order to allow either one\\n\\n/// read/write object or a separate read and write object.\\n\\npub trait EventedReadWrite {\\n\\n type Reader: io::Read;\\n\\n type Writer: io::Write;\\n\\n\\n\\n fn register(\\n\\n &mut self,\\n\\n _: &mio::Poll,\\n\\n _: &mut dyn Iterator- ,\\n\\n _: mio::Ready,\\n\\n _: mio::PollOpt,\\n\\n ) -> io::Result<()>;\\n\\n fn reregister(&mut self, _: &mio::Poll, _: mio::Ready, _: mio::PollOpt) -> io::Result<()>;\\n\\n fn deregister(&mut self, _: &mio::Poll) -> io::Result<()>;\\n\\n\\n\\n fn reader(&mut self) -> &mut Self::Reader;\\n\\n fn read_token(&self) -> mio::Token;\\n\\n fn writer(&mut self) -> &mut Self::Writer;\\n\\n fn write_token(&self) -> mio::Token;\\n\\n}\\n\\n\\n\\n/// Events concerning TTY child processes.\\n\\n#[derive(Debug, PartialEq)]\\n\\npub enum ChildEvent {\\n\\n /// Indicates the child has exited.\\n\\n Exited,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/tty/mod.rs\",\n \"rank\": 66,\n \"score\": 157806.87039479468\n },\n {\n \"content\": \"/// Merge two key/value mappings.\\n\\nfn merge_mapping(mut base: Mapping, replacement: Mapping) -> Mapping {\\n\\n for (key, value) in replacement {\\n\\n let value = match base.remove(&key) {\\n\\n Some(base_value) => merge(base_value, value),\\n\\n None => value,\\n\\n };\\n\\n base.insert(key, value);\\n\\n }\\n\\n\\n\\n base\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn merge_primitive() {\\n\\n let base = Value::Null;\\n\\n let replacement = Value::Bool(true);\\n\",\n \"file_path\": \"alacritty/src/config/serde_utils.rs\",\n \"rank\": 67,\n \"score\": 157053.0728284591\n },\n {\n \"content\": \"pub fn default_title() -> String {\\n\\n DEFAULT_NAME.to_string()\\n\\n}\\n\\n\\n\\nimpl WindowConfig {\\n\\n #[inline]\\n\\n pub fn dynamic_title(&self) -> bool {\\n\\n self.dynamic_title.0\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn set_dynamic_title(&mut self, dynamic_title: bool) {\\n\\n self.dynamic_title.0 = dynamic_title;\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n pub fn dimensions(&self) -> Option
{\\n\\n if self.dimensions.columns.0 != 0\\n\\n && self.dimensions.lines.0 != 0\\n\\n && self.startup_mode != StartupMode::Maximized\\n\",\n \"file_path\": \"alacritty/src/config/window.rs\",\n \"rank\": 68,\n \"score\": 149290.17870740956\n },\n {\n \"content\": \"fn default_log_level() -> LevelFilter {\\n\\n LevelFilter::Warn\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty/src/config/debug.rs\",\n \"rank\": 69,\n \"score\": 147786.7027558108\n },\n {\n \"content\": \"/// Converts the string slice into a Windows-standard representation for \\\"W\\\"-\\n\\n/// suffixed function variants, which accept UTF-16 encoded string values.\\n\\npub fn win32_string + ?Sized>(value: &S) -> Vec {\\n\\n OsStr::new(value).encode_wide().chain(once(0)).collect()\\n\\n}\\n\",\n \"file_path\": \"alacritty_terminal/src/tty/windows/mod.rs\",\n \"rank\": 70,\n \"score\": 146089.34981570355\n },\n {\n \"content\": \"/// Move by whitespace separated word, like W/B/E/gE in vi.\\n\\nfn word(\\n\\n term: &mut Term,\\n\\n mut point: Point,\\n\\n direction: Direction,\\n\\n side: Side,\\n\\n) -> Point {\\n\\n // Make sure we jump above wide chars.\\n\\n point = term.expand_wide(point, direction);\\n\\n\\n\\n if direction == side {\\n\\n // Skip whitespace until right before a word.\\n\\n let mut next_point = advance(term, point, direction);\\n\\n while !is_boundary(term, point, direction) && is_space(term, next_point) {\\n\\n point = next_point;\\n\\n next_point = advance(term, point, direction);\\n\\n }\\n\\n\\n\\n // Skip non-whitespace until right inside word boundary.\\n\\n let mut next_point = advance(term, point, direction);\\n\\n while !is_boundary(term, point, direction) && !is_space(term, next_point) {\\n\",\n \"file_path\": \"alacritty_terminal/src/vi_mode.rs\",\n \"rank\": 71,\n \"score\": 142648.37352204975\n },\n {\n \"content\": \"/// Move by semantically separated word, like w/b/e/ge in vi.\\n\\nfn semantic(\\n\\n term: &mut Term,\\n\\n mut point: Point,\\n\\n direction: Direction,\\n\\n side: Side,\\n\\n) -> Point {\\n\\n // Expand semantically based on movement direction.\\n\\n let expand_semantic = |point: Point| {\\n\\n // Do not expand when currently on a semantic escape char.\\n\\n let cell = &term.grid()[point.line][point.col];\\n\\n if term.semantic_escape_chars().contains(cell.c)\\n\\n && !cell.flags.intersects(Flags::WIDE_CHAR_SPACER | Flags::LEADING_WIDE_CHAR_SPACER)\\n\\n {\\n\\n point\\n\\n } else if direction == Direction::Left {\\n\\n term.semantic_search_left(point)\\n\\n } else {\\n\\n term.semantic_search_right(point)\\n\\n }\\n\\n };\\n\",\n \"file_path\": \"alacritty_terminal/src/vi_mode.rs\",\n \"rank\": 72,\n \"score\": 142648.37352204975\n },\n {\n \"content\": \"fn default_match_background() -> CellRgb {\\n\\n CellRgb::Rgb(Rgb { r: 0xff, g: 0xff, b: 0xff })\\n\\n}\\n\\n\\n\\n#[serde(default)]\\n\\n#[derive(Deserialize, Debug, Copy, Clone, Default, PartialEq, Eq)]\\n\\npub struct BarColors {\\n\\n #[serde(deserialize_with = \\\"failure_default\\\")]\\n\\n foreground: Option,\\n\\n #[serde(deserialize_with = \\\"failure_default\\\")]\\n\\n background: Option,\\n\\n}\\n\\n\\n\\n#[serde(default)]\\n\\n#[derive(Deserialize, Clone, Debug, PartialEq, Eq)]\\n\\npub struct PrimaryColors {\\n\\n #[serde(deserialize_with = \\\"failure_default\\\")]\\n\\n pub background: Rgb,\\n\\n #[serde(deserialize_with = \\\"failure_default\\\")]\\n\\n pub foreground: Rgb,\\n\",\n \"file_path\": \"alacritty_terminal/src/config/colors.rs\",\n \"rank\": 73,\n \"score\": 140633.74220381508\n },\n {\n \"content\": \"/// Find next end of line to move to.\\n\\nfn last(term: &Term, mut point: Point) -> Point {\\n\\n let cols = term.cols();\\n\\n\\n\\n // Expand across wide cells.\\n\\n point = term.expand_wide(point, Direction::Right);\\n\\n\\n\\n // Find last non-empty cell in the current line.\\n\\n let occupied = last_occupied_in_line(term, point.line).unwrap_or_default();\\n\\n\\n\\n if point.col < occupied.col {\\n\\n // Jump to last occupied cell when not already at or beyond it.\\n\\n occupied\\n\\n } else if is_wrap(term, point) {\\n\\n // Jump to last occupied cell across linewraps.\\n\\n while point.line > 0 && is_wrap(term, point) {\\n\\n point.line -= 1;\\n\\n }\\n\\n\\n\\n last_occupied_in_line(term, point.line).unwrap_or(point)\\n\\n } else {\\n\\n // Jump to last column when beyond the last occupied cell.\\n\\n Point::new(point.line, cols - 1)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/vi_mode.rs\",\n \"rank\": 74,\n \"score\": 140334.31044072044\n },\n {\n \"content\": \"/// Find first non-empty cell in line.\\n\\nfn first_occupied_in_line(term: &Term, line: usize) -> Option> {\\n\\n (0..term.cols().0)\\n\\n .map(|col| Point::new(line, Column(col)))\\n\\n .find(|&point| !is_space(term, point))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/vi_mode.rs\",\n \"rank\": 75,\n \"score\": 139394.9940100836\n },\n {\n \"content\": \"/// Find last non-empty cell in line.\\n\\nfn last_occupied_in_line(term: &Term, line: usize) -> Option> {\\n\\n (0..term.cols().0)\\n\\n .map(|col| Point::new(line, Column(col)))\\n\\n .rfind(|&point| !is_space(term, point))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/vi_mode.rs\",\n \"rank\": 76,\n \"score\": 139394.9940100836\n },\n {\n \"content\": \"#[cfg(all(feature = \\\"x11\\\", not(any(target_os = \\\"macos\\\", windows))))]\\n\\nfn x_embed_window(window: &GlutinWindow, parent_id: std::os::raw::c_ulong) {\\n\\n let (xlib_display, xlib_window) = match (window.xlib_display(), window.xlib_window()) {\\n\\n (Some(display), Some(window)) => (display, window),\\n\\n _ => return,\\n\\n };\\n\\n\\n\\n let xlib = Xlib::open().expect(\\\"get xlib\\\");\\n\\n\\n\\n unsafe {\\n\\n let atom = (xlib.XInternAtom)(xlib_display as *mut _, \\\"_XEMBED\\\".as_ptr() as *const _, 0);\\n\\n (xlib.XChangeProperty)(\\n\\n xlib_display as _,\\n\\n xlib_window as _,\\n\\n atom,\\n\\n atom,\\n\\n 32,\\n\\n PropModeReplace,\\n\\n [0, 1].as_ptr(),\\n\\n 2,\\n\\n );\\n\",\n \"file_path\": \"alacritty/src/window.rs\",\n \"rank\": 77,\n \"score\": 139332.88772750433\n },\n {\n \"content\": \"/// Find next non-empty cell to move to.\\n\\nfn first_occupied(term: &Term, mut point: Point) -> Point {\\n\\n let cols = term.cols();\\n\\n\\n\\n // Expand left across wide chars, since we're searching lines left to right.\\n\\n point = term.expand_wide(point, Direction::Left);\\n\\n\\n\\n // Find first non-empty cell in current line.\\n\\n let occupied = first_occupied_in_line(term, point.line)\\n\\n .unwrap_or_else(|| Point::new(point.line, cols - 1));\\n\\n\\n\\n // Jump across wrapped lines if we're already at this line's first occupied cell.\\n\\n if point == occupied {\\n\\n let mut occupied = None;\\n\\n\\n\\n // Search for non-empty cell in previous lines.\\n\\n for line in (point.line + 1)..term.total_lines() {\\n\\n if !is_wrap(term, Point::new(line, cols - 1)) {\\n\\n break;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/vi_mode.rs\",\n \"rank\": 78,\n \"score\": 138229.5660208111\n },\n {\n \"content\": \"fn cubic_bezier(p0: f64, p1: f64, p2: f64, p3: f64, x: f64) -> f64 {\\n\\n (1.0 - x).powi(3) * p0\\n\\n + 3.0 * (1.0 - x).powi(2) * x * p1\\n\\n + 3.0 * (1.0 - x) * x.powi(2) * p2\\n\\n + x.powi(3) * p3\\n\\n}\\n\\n\\n\\nimpl VisualBell {\\n\\n /// Ring the visual bell, and return its intensity.\\n\\n pub fn ring(&mut self) -> f64 {\\n\\n let now = Instant::now();\\n\\n self.start_time = Some(now);\\n\\n self.intensity_at_instant(now)\\n\\n }\\n\\n\\n\\n /// Get the currently intensity of the visual bell. The bell's intensity\\n\\n /// ramps down from 1.0 to 0.0 at a rate determined by the bell's duration.\\n\\n pub fn intensity(&self) -> f64 {\\n\\n self.intensity_at_instant(Instant::now())\\n\\n }\\n\",\n \"file_path\": \"alacritty_terminal/src/term/mod.rs\",\n \"rank\": 79,\n \"score\": 135878.12577408817\n },\n {\n \"content\": \" ErrorKind::Interrupted | ErrorKind::WouldBlock => {\\n\\n break;\\n\\n },\\n\\n _ => return Err(err),\\n\\n },\\n\\n }\\n\\n }\\n\\n\\n\\n if processed > 0 {\\n\\n // Queue terminal redraw.\\n\\n self.event_proxy.send_event(Event::Wakeup);\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn pty_write(&mut self, state: &mut State) -> io::Result<()> {\\n\\n state.ensure_next();\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 80,\n \"score\": 132416.0212083869\n },\n {\n \"content\": \"use crate::thread;\\n\\nuse crate::tty;\\n\\n\\n\\n/// Max bytes to read from the PTY.\\n\\nconst MAX_READ: usize = 0x10_000;\\n\\n\\n\\n/// Messages that may be sent to the `EventLoop`.\\n\\n#[derive(Debug)]\\n\\npub enum Msg {\\n\\n /// Data that should be written to the PTY.\\n\\n Input(Cow<'static, [u8]>),\\n\\n\\n\\n /// Indicates that the `EventLoop` should shut down, as Alacritty is shutting down.\\n\\n Shutdown,\\n\\n\\n\\n /// Instruction to resize the PTY.\\n\\n Resize(SizeInfo),\\n\\n}\\n\\n\\n\\n/// The main event!.. loop.\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 81,\n \"score\": 132413.21471076278\n },\n {\n \"content\": \" ) -> io::Result<()>\\n\\n where\\n\\n X: Write,\\n\\n {\\n\\n let mut processed = 0;\\n\\n let mut terminal = None;\\n\\n\\n\\n loop {\\n\\n match self.pty.reader().read(&mut buf[..]) {\\n\\n Ok(0) => break,\\n\\n Ok(got) => {\\n\\n // Record bytes read; used to limit time spent in pty_read.\\n\\n processed += got;\\n\\n\\n\\n // Send a copy of bytes read to a subscriber. Used for\\n\\n // example with ref test recording.\\n\\n writer = writer.map(|w| {\\n\\n w.write_all(&buf[..got]).unwrap();\\n\\n w\\n\\n });\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 82,\n \"score\": 132412.74785143757\n },\n {\n \"content\": \"//! The main event loop which performs I/O on the pseudoterminal.\\n\\n\\n\\nuse std::borrow::Cow;\\n\\nuse std::collections::VecDeque;\\n\\nuse std::fs::File;\\n\\nuse std::io::{self, ErrorKind, Read, Write};\\n\\nuse std::marker::Send;\\n\\nuse std::sync::Arc;\\n\\nuse std::thread::JoinHandle;\\n\\n\\n\\nuse log::error;\\n\\n#[cfg(not(windows))]\\n\\nuse mio::unix::UnixReady;\\n\\nuse mio::{self, Events, PollOpt, Ready};\\n\\nuse mio_extras::channel::{self, Receiver, Sender};\\n\\n\\n\\nuse crate::ansi;\\n\\nuse crate::event::{self, Event, EventListener};\\n\\nuse crate::sync::FairMutex;\\n\\nuse crate::term::{SizeInfo, Term};\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 83,\n \"score\": 132412.6723182083\n },\n {\n \"content\": \" // Register TTY through EventedRW interface.\\n\\n self.pty.register(&self.poll, &mut tokens, Ready::readable(), poll_opts).unwrap();\\n\\n\\n\\n let mut events = Events::with_capacity(1024);\\n\\n\\n\\n let mut pipe = if self.ref_test {\\n\\n Some(File::create(\\\"./alacritty.recording\\\").expect(\\\"create alacritty recording\\\"))\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\\n 'event_loop: loop {\\n\\n if let Err(err) = self.poll.poll(&mut events, None) {\\n\\n match err.kind() {\\n\\n ErrorKind::Interrupted => continue,\\n\\n _ => panic!(\\\"EventLoop polling error: {:?}\\\", err),\\n\\n }\\n\\n }\\n\\n\\n\\n for event in events.iter() {\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 84,\n \"score\": 132408.34159152675\n },\n {\n \"content\": \" error!(\\\"Error reading from PTY in event loop: {}\\\", err);\\n\\n break 'event_loop;\\n\\n }\\n\\n }\\n\\n\\n\\n if event.readiness().is_writable() {\\n\\n if let Err(err) = self.pty_write(&mut state) {\\n\\n error!(\\\"Error writing to PTY in event loop: {}\\\", err);\\n\\n break 'event_loop;\\n\\n }\\n\\n }\\n\\n }\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n\\n\\n // Register write interest if necessary.\\n\\n let mut interest = Ready::readable();\\n\\n if state.needs_write() {\\n\\n interest.insert(Ready::writable());\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 85,\n \"score\": 132405.5241496801\n },\n {\n \"content\": \" B: Into>,\\n\\n {\\n\\n let bytes = bytes.into();\\n\\n // terminal hangs if we send 0 bytes through.\\n\\n if bytes.len() == 0 {\\n\\n return;\\n\\n }\\n\\n\\n\\n self.0.send(Msg::Input(bytes)).expect(\\\"send event loop msg\\\");\\n\\n }\\n\\n}\\n\\n\\n\\nimpl event::OnResize for Notifier {\\n\\n fn on_resize(&mut self, size: &SizeInfo) {\\n\\n self.0.send(Msg::Resize(*size)).expect(\\\"expected send event loop msg\\\");\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for State {\\n\\n fn default() -> State {\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 86,\n \"score\": 132403.2143706173\n },\n {\n \"content\": \" 'write_many: while let Some(mut current) = state.take_current() {\\n\\n 'write_one: loop {\\n\\n match self.pty.writer().write(current.remaining_bytes()) {\\n\\n Ok(0) => {\\n\\n state.set_current(Some(current));\\n\\n break 'write_many;\\n\\n },\\n\\n Ok(n) => {\\n\\n current.advance(n);\\n\\n if current.finished() {\\n\\n state.goto_next();\\n\\n break 'write_one;\\n\\n }\\n\\n },\\n\\n Err(err) => {\\n\\n state.set_current(Some(current));\\n\\n match err.kind() {\\n\\n ErrorKind::Interrupted | ErrorKind::WouldBlock => break 'write_many,\\n\\n _ => return Err(err),\\n\\n }\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 87,\n \"score\": 132402.54901682638\n },\n {\n \"content\": \"\\n\\n pub fn channel(&self) -> Sender {\\n\\n self.tx.clone()\\n\\n }\\n\\n\\n\\n /// Drain the channel.\\n\\n ///\\n\\n /// Returns `false` when a shutdown message was received.\\n\\n fn drain_recv_channel(&mut self, state: &mut State) -> bool {\\n\\n while let Ok(msg) = self.rx.try_recv() {\\n\\n match msg {\\n\\n Msg::Input(input) => state.write_list.push_back(input),\\n\\n Msg::Shutdown => return false,\\n\\n Msg::Resize(size) => self.pty.on_resize(&size),\\n\\n }\\n\\n }\\n\\n\\n\\n true\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 88,\n \"score\": 132398.6720077375\n },\n {\n \"content\": \" match event.token() {\\n\\n token if token == channel_token => {\\n\\n if !self.channel_event(channel_token, &mut state) {\\n\\n break 'event_loop;\\n\\n }\\n\\n },\\n\\n\\n\\n token if token == self.pty.child_event_token() => {\\n\\n if let Some(tty::ChildEvent::Exited) = self.pty.next_child_event() {\\n\\n if !self.hold {\\n\\n self.terminal.lock().exit();\\n\\n }\\n\\n self.event_proxy.send_event(Event::Wakeup);\\n\\n break 'event_loop;\\n\\n }\\n\\n },\\n\\n\\n\\n token\\n\\n if token == self.pty.read_token()\\n\\n || token == self.pty.write_token() =>\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 89,\n \"score\": 132397.21903739794\n },\n {\n \"content\": \" /// Returns a `bool` indicating whether or not the event loop should continue running.\\n\\n #[inline]\\n\\n fn channel_event(&mut self, token: mio::Token, state: &mut State) -> bool {\\n\\n if !self.drain_recv_channel(state) {\\n\\n return false;\\n\\n }\\n\\n\\n\\n self.poll\\n\\n .reregister(&self.rx, token, Ready::readable(), PollOpt::edge() | PollOpt::oneshot())\\n\\n .unwrap();\\n\\n\\n\\n true\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn pty_read(\\n\\n &mut self,\\n\\n state: &mut State,\\n\\n buf: &mut [u8],\\n\\n mut writer: Option<&mut X>,\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 90,\n \"score\": 132395.6493013755\n },\n {\n \"content\": \"///\\n\\n/// Handles all the PTY I/O and runs the PTY parser which updates terminal\\n\\n/// state.\\n\\npub struct EventLoop {\\n\\n poll: mio::Poll,\\n\\n pty: T,\\n\\n rx: Receiver,\\n\\n tx: Sender,\\n\\n terminal: Arc>>,\\n\\n event_proxy: U,\\n\\n hold: bool,\\n\\n ref_test: bool,\\n\\n}\\n\\n\\n\\n/// Helper type which tracks how much of a buffer has been written.\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 91,\n \"score\": 132394.73865784993\n },\n {\n \"content\": \" {\\n\\n #[cfg(unix)]\\n\\n if UnixReady::from(event.readiness()).is_hup() {\\n\\n // Don't try to do I/O on a dead PTY.\\n\\n continue;\\n\\n }\\n\\n\\n\\n if event.readiness().is_readable() {\\n\\n if let Err(err) = self.pty_read(&mut state, &mut buf, pipe.as_mut())\\n\\n {\\n\\n // On Linux, a `read` on the master side of a PTY can fail\\n\\n // with `EIO` if the client side hangs up. In that case,\\n\\n // just loop back round for the inevitable `Exited` event.\\n\\n // This sucks, but checking the process is either racy or\\n\\n // blocking.\\n\\n #[cfg(target_os = \\\"linux\\\")]\\n\\n if err.kind() == ErrorKind::Other {\\n\\n continue;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 92,\n \"score\": 132393.65237662225\n },\n {\n \"content\": \"\\n\\n // Get reference to terminal. Lock is acquired on initial\\n\\n // iteration and held until there's no bytes left to parse\\n\\n // or we've reached `MAX_READ`.\\n\\n if terminal.is_none() {\\n\\n terminal = Some(self.terminal.lock());\\n\\n }\\n\\n let terminal = terminal.as_mut().unwrap();\\n\\n\\n\\n // Run the parser.\\n\\n for byte in &buf[..got] {\\n\\n state.parser.advance(&mut **terminal, *byte, &mut self.pty.writer());\\n\\n }\\n\\n\\n\\n // Exit if we've processed enough bytes.\\n\\n if processed > MAX_READ {\\n\\n break;\\n\\n }\\n\\n },\\n\\n Err(err) => match err.kind() {\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 93,\n \"score\": 132393.564203824\n },\n {\n \"content\": \" fn advance(&mut self, n: usize) {\\n\\n self.written += n;\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn remaining_bytes(&self) -> &[u8] {\\n\\n &self.source[self.written..]\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn finished(&self) -> bool {\\n\\n self.written >= self.source.len()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl EventLoop\\n\\nwhere\\n\\n T: tty::EventedPty + event::OnResize + Send + 'static,\\n\\n U: EventListener + Send + 'static,\\n\\n{\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 94,\n \"score\": 132389.0930642473\n },\n {\n \"content\": \" /// Create a new event loop.\\n\\n pub fn new(\\n\\n terminal: Arc>>,\\n\\n event_proxy: U,\\n\\n pty: T,\\n\\n hold: bool,\\n\\n ref_test: bool,\\n\\n ) -> EventLoop {\\n\\n let (tx, rx) = channel::channel();\\n\\n EventLoop {\\n\\n poll: mio::Poll::new().expect(\\\"create mio Poll\\\"),\\n\\n pty,\\n\\n tx,\\n\\n rx,\\n\\n terminal,\\n\\n event_proxy,\\n\\n hold,\\n\\n ref_test,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 95,\n \"score\": 132387.25036924946\n },\n {\n \"content\": \" State { write_list: VecDeque::new(), parser: ansi::Processor::new(), writing: None }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl State {\\n\\n #[inline]\\n\\n fn ensure_next(&mut self) {\\n\\n if self.writing.is_none() {\\n\\n self.goto_next();\\n\\n }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn goto_next(&mut self) {\\n\\n self.writing = self.write_list.pop_front().map(Writing::new);\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn take_current(&mut self) -> Option {\\n\\n self.writing.take()\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 96,\n \"score\": 132385.51739821292\n }\n]"}}},{"rowIdx":980,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/engine.rs"},"repo_name":{"kind":"string","value":"0ncorhynchus/mictyris"},"commit":{"kind":"string","value":"5f8bffe0fb6833048bac9d240050b92f5acd9a0d"},"file_code":{"kind":"string","value":"mod auxiliary;\npub mod procedure;\nmod storage;\n\nuse self::auxiliary::*;\nuse self::procedure::*;\nuse self::storage::*;\nuse crate::lexer::Identifier;\nuse crate::parser::{Datum, Formals, ListDatum, Lit};\nuse crate::pass::*;\nuse std::fmt;\nuse std::rc::Rc;\n\nuse Value::*;\n\n#[derive(Clone, Debug, PartialEq)]\npub enum Value {\n Symbol(Identifier),\n Character(char),\n Number(f64),\n Pair(Location, Location, bool),\n Vector(Vec),\n Str(String),\n Bool(bool),\n\n \n Null,\n Unspecified,\n Undefined,\n\n Procedure(Proc),\n}\n\nimpl Value {\n pub fn number(&self) -> Option {\n match self {\n Number(num) => Some(*num),\n _ => None,\n }\n }\n\n pub fn pair(&self) -> Option<(Location, Location, bool)> {\n match self {\n Pair(car, cdr, mutable) => Some((car.clone(), cdr.clone(), *mutable)),\n _ => None,\n }\n }\n}\n\n#[derive(Clone, Debug, PartialEq)]\npub struct EvalError {\n pub message: String,\n}\n\nimpl fmt::Display for EvalError {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{}\", self.message)\n }\n}\n\n#[derive(Default)]\npub struct Engine {\n env: Env,\n store: Store,\n}\n\nimpl Engine {\n pub fn new() -> Self {\n let mut engine = Self::default();\n engine.register_proc(\"list\", procedure::list);\n engine.register_proc(\"cons\", procedure::cons);\n engine.register_proc(\"<\", procedure::less);\n engine.register_proc(\"+\", procedure::add);\n engine.register_proc(\"car\", procedure::car);\n engine.register_proc(\"cdr\", procedure::cdr);\n engine.register_proc(\"set-car!\", procedure::setcar);\n engine.register_proc(\"eqv?\", procedure::eqv);\n engine.register_proc(\"apply\", procedure::apply);\n engine.register_proc(\"call-with-current-continuation\", procedure::cwcc);\n engine.register_proc(\"call/cc\", procedure::cwcc);\n engine.register_proc(\"values\", procedure::values);\n engine.register_proc(\"call-with-values\", procedure::cwv);\n engine\n }\n\n pub fn register(&mut self, variable: &str, value: Value) {\n let location = self.store.reserve();\n self.store.update(&location, value);\n self.env.borrow_mut().insert(variable, location);\n }\n\n pub fn register_proc(&mut self, variable: &str, proc: F)\n where\n F: Fn(&[Value], ExprCont) -> CommCont,\n {\n let location = self.store.reserve();\n self.store\n .update(&location, Procedure(Proc::new(Rc::new(proc))));\n self.env.borrow_mut().insert(variable, location);\n }\n\n pub fn eval(&mut self, ast: &AST) -> Answer {\n let expr_cont: ExprCont = Rc::new(|mut values: Vec| {\n let answer = values.pop().unwrap_or(Unspecified);\n let cont: CommCont = Rc::new(move |_store: &mut Store| Ok(answer.clone()));\n cont\n });\n\n let cont = eval(ast, Rc::clone(&self.env), expr_cont);\n cont(&mut self.store)\n }\n\n pub fn eval_and_print(&mut self, ast: &AST) {\n let expr_cont: ExprCont = Rc::new(|mut values: Vec| {\n if let Some(value) = values.pop() {\n write(value)\n } else {\n Rc::new(|_| Ok(Unspecified))\n }\n });\n\n let cont = eval(ast, Rc::clone(&self.env), expr_cont);\n match cont(&mut self.store) {\n Ok(_) => (),\n Err(err) => eprintln!(\"Error: {}\", err),\n }\n }\n}\n\nfn eval(ast: &AST, env: Env, expr_cont: ExprCont) -> CommCont {\n match ast {\n AST::Const(lit) => eval_literal(lit, expr_cont),\n AST::Var(ident) => eval_variable(ident, env, expr_cont),\n AST::Call(f, args) => eval_proc_call(f, args, env, expr_cont),\n AST::Lambda(args, commands, expr) => match args {\n Formals::List(args) => eval_lambda(args, commands, expr, env, expr_cont),\n Formals::Dot(args, var) => eval_lambda_dot(args, var, commands, expr, env, expr_cont),\n },\n AST::Cond(test, conseq, alter) => match alter {\n Some(alter) => eval_conditional1(test, conseq, alter, env, expr_cont),\n None => eval_conditional2(test, conseq, env, expr_cont),\n },\n AST::Assign(ident, expr) => eval_assign(ident, expr, env, expr_cont),\n }\n}\n\nfn eval_literal(lit: &Lit, expr_cont: ExprCont) -> CommCont {\n fn literal(store: &mut Store, lit: &Lit) -> Value {\n match lit {\n Lit::Bool(b) => Bool(*b),\n Lit::Number(n) => Number(*n),\n Lit::Character(c) => Character(*c),\n Lit::Str(s) => Str(s.clone()),\n Lit::Quote(d) => eval_datum(store, d),\n }\n }\n\n fn eval_datum(store: &mut Store, datum: &Datum) -> Value {\n match datum {\n Datum::Bool(b) => Bool(*b),\n Datum::Number(n) => Number(*n),\n Datum::Character(c) => Character(*c),\n Datum::Str(s) => Str(s.clone()),\n Datum::Symbol(ident) => Symbol(ident.clone()),\n Datum::List(data) => match data {\n ListDatum::List(data) => data.iter().rev().fold(Null, |acc, x| {\n let cdr = store.reserve();\n store.update(&cdr, acc);\n\n let car = store.reserve();\n let x = eval_datum(store, x);\n store.update(&car, x);\n\n Pair(car, cdr, true)\n }),\n ListDatum::Cons(data, last) => {\n let last = eval_datum(store, last);\n data.iter().rev().fold(last, |acc, x| {\n let cdr = store.reserve();\n store.update(&cdr, acc);\n\n let car = store.reserve();\n let x = eval_datum(store, x);\n store.update(&car, x);\n\n Pair(car, cdr, true)\n })\n }\n ListDatum::Abbrev(_) => unimplemented!(),\n },\n Datum::Vector(data) => {\n let mut locations = Vec::with_capacity(data.len());\n for elem in data {\n let elem = eval_datum(store, elem);\n let loc = store.reserve();\n store.update(&loc, elem);\n locations.push(loc);\n }\n Vector(locations)\n }\n }\n }\n\n let lit = lit.clone();\n Rc::new(move |store| send(literal(store, &lit), &expr_cont)(store))\n}\n\nfn eval_variable(ident: &str, env: Env, expr_cont: ExprCont) -> CommCont {\n let location = match env.borrow().lookup(ident) {\n Some(location) => location,\n None => {\n return wrong(\"undefined variable\");\n }\n };\n let cont = single(move |value| send(value, &expr_cont));\n hold(location, cont)\n}\n\nfn eval_proc_call(f: &AST, args: &[AST], env: Env, cont: ExprCont) -> CommCont {\n let mut exprs = Vec::with_capacity(args.len() + 1);\n exprs.push(f.clone());\n exprs.extend_from_slice(args);\n\n let cont: ExprCont = Rc::new(move |values: Vec| {\n let (f, args) = values.split_first().unwrap();\n applicate(f, args, Rc::clone(&cont))\n });\n\n eval_list(&exprs, env, cont)\n}\n\nfn eval_list(exprs: &[AST], env: Env, cont: ExprCont) -> CommCont {\n match exprs.split_first() {\n None => cont(vec![]),\n Some((head, tail)) => {\n let tail = tail.to_vec();\n let copied_env = Rc::clone(&env);\n\n let cont = single(move |value: Value| {\n let cont = Rc::clone(&cont);\n\n let cont: ExprCont = Rc::new(move |mut values| {\n values.insert(0, value.clone());\n cont(values)\n });\n\n eval_list(&tail, Rc::clone(&copied_env), cont)\n });\n\n eval(head, env, cont)\n }\n }\n}\n\nfn eval_lambda(\n args: &[String],\n commands: &[AST],\n expr: &AST,\n env: Env,\n cont: ExprCont,\n) -> CommCont {\n let args = args.to_vec();\n let commands = commands.to_vec();\n let expr = expr.clone();\n Rc::new(move |store: &mut Store| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n let env = Rc::clone(&env);\n\n let inner = Rc::new(move |values: &[Value], cont: ExprCont| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n\n if values.len() == args.len() {\n let env = Rc::clone(&env);\n let f = Rc::new(move |locations: &[Location]| {\n let env = extends(&env, &args, &locations);\n let cont = eval(&expr, Rc::clone(&env), Rc::clone(&cont));\n eval_commands(&commands, env, cont)\n });\n tievals(f, values)\n } else {\n wrong(\"wrong number of arguments\")\n }\n });\n\n \n\n let proc = Procedure(Proc::new(inner));\n send(proc, &cont)(store)\n })\n}\n\n#[allow(unused_variables)]\nfn eval_lambda_dot(\n args: &[String],\n var: &str,\n commands: &[AST],\n expr: &AST,\n env: Env,\n cont: ExprCont,\n) -> CommCont {\n let min_args = args.len();\n let mut args = args.to_vec();\n args.push(var.to_string());\n let commands = commands.to_vec();\n let expr = expr.clone();\n Rc::new(move |store: &mut Store| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n let env = Rc::clone(&env);\n let location = store.reserve();\n\n let inner = Rc::new(move |values: &[Value], cont: ExprCont| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n\n if values.len() >= min_args {\n let env = Rc::clone(&env);\n let f = Rc::new(move |locations: &[Location]| {\n let env = extends(&env, &args, &locations);\n let cont = eval(&expr, Rc::clone(&env), Rc::clone(&cont));\n eval_commands(&commands, env, cont)\n });\n tievalsrest(f, values, min_args)\n } else {\n wrong(\"too few arguments\")\n }\n });\n\n \n\n let proc = Procedure(Proc::new(inner));\n send(proc, &cont)(store)\n })\n}\n\nfn eval_commands(commands: &[AST], env: Env, cont: CommCont) -> CommCont {\n match commands.split_first() {\n Some((head, tail)) => {\n let tail = tail.to_vec();\n let copied_env = Rc::clone(&env);\n let cont = Rc::new(move |_: Vec| {\n eval_commands(&tail, Rc::clone(&copied_env), Rc::clone(&cont))\n });\n eval(head, env, cont)\n }\n None => cont,\n }\n}\n\nfn eval_conditional1(test: &AST, conseq: &AST, alter: &AST, env: Env, cont: ExprCont) -> CommCont {\n let conseq = conseq.clone();\n let alter = alter.clone();\n let copied_env = Rc::clone(&env);\n let cont = single(move |value| {\n let cont = Rc::clone(&cont);\n let env = Rc::clone(&copied_env);\n if truish(value) {\n eval(&conseq.clone(), env, cont)\n } else {\n eval(&alter.clone(), env, cont)\n }\n });\n eval(test, env, cont)\n}\n\nfn eval_conditional2(test: &AST, conseq: &AST, env: Env, cont: ExprCont) -> CommCont {\n let conseq = conseq.clone();\n let copied_env = Rc::clone(&env);\n let cont = single(move |value| {\n if truish(value) {\n eval(&conseq.clone(), Rc::clone(&copied_env), Rc::clone(&cont))\n } else {\n send(Unspecified, &cont)\n }\n });\n eval(test, env, cont)\n}\n\nfn eval_assign(ident: &str, expr: &AST, env: Env, cont: ExprCont) -> CommCont {\n let ident = ident.to_string();\n let copied_env = Rc::clone(&env);\n let cont = single(move |value: Value| {\n let location = match env.borrow().lookup(&ident) {\n Some(location) => location,\n None => {\n return wrong(\"undefined variable\");\n }\n };\n assign(location, value, send(Unspecified, &cont))\n });\n eval(expr, copied_env, cont)\n}\n\npub type Answer = Result;\n\n#[derive(Clone)]\npub struct Proc {\n inner: Rc CommCont>,\n}\n\nimpl Proc {\n fn new(inner: Rc CommCont>) -> Self {\n Self { inner }\n }\n}\n\nimpl fmt::Debug for Proc {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"Proc\")\n }\n}\n\nimpl PartialEq for Proc {\n fn eq(&self, other: &Self) -> bool {\n Rc::ptr_eq(&self.inner, &other.inner)\n }\n}\n\npub type CommCont = Rc Answer>;\npub type ExprCont = Rc) -> CommCont>;\n\npub fn write(value: Value) -> CommCont {\n fn fmt(store: &Store, value: &Value) -> String {\n match value {\n Symbol(ident) => format!(\"{}\", ident),\n Character(c) => format!(\"#\\\\{}\", c),\n Number(n) => format!(\"{}\", n),\n Pair(loc1, loc2, _) => format!(\n \"({} . {})\",\n fmt(store, &store.get(loc1)),\n fmt(store, &store.get(loc2)),\n ),\n Vector(locations) => {\n let mut strings = Vec::with_capacity(locations.len());\n for loc in locations {\n strings.push(fmt(store, &store.get(loc)));\n }\n format!(\"#({})\", strings.join(\" \"))\n }\n Str(s) => s.clone(),\n Bool(b) => format!(\"{}\", b),\n Null => \"()\".to_string(),\n Unspecified => \"\".to_string(),\n Undefined => \"\".to_string(),\n Procedure(_) => \"\".to_string(),\n }\n }\n\n Rc::new(move |store: &mut Store| {\n println!(\"{}\", fmt(store, &value));\n Ok(Unspecified)\n })\n}\n"},"prefix":{"kind":"string","value":"mod auxiliary;\npub mod procedure;\nmod storage;\n\nuse self::auxiliary::*;\nuse self::procedure::*;\nuse self::storage::*;\nuse crate::lexer::Identifier;\nuse crate::parser::{Datum, Formals, ListDatum, Lit};\nuse crate::pass::*;\nuse std::fmt;\nuse std::rc::Rc;\n\nuse Value::*;\n\n#[derive(Clone, Debug, PartialEq)]\npub enum Value {\n Symbol(Identifier),\n Character(char),\n Number(f64),\n Pair(Location, Location, bool),\n Vector(Vec),\n Str(String),\n Bool(bool),\n\n \n Null,\n Unspecified,\n Undefined,\n\n Procedure(Proc),\n}\n\nimpl Value {\n pub fn number(&self) -> Option {\n match self {\n Number(num) => Some(*num),\n _ => None,\n }\n }\n\n pub fn pair(&self) -> Option<(Location, Location, bool)> {\n match self {\n Pair(car, cdr, mutable) => Some((car.clone(), cdr.clone(), *mutable)),\n _ => None,\n }\n }\n}\n\n#[derive(Clone, Debug, PartialEq)]\npub struct EvalError {\n pub message: String,\n}\n\nimpl fmt::Display for EvalError {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{}\", self.message)\n }\n}\n\n#[derive(Default)]\npub struct Engine {\n env: Env,\n store: Store,\n}\n\nimpl Engine {\n pub fn new() -> Self {\n let mut engine = Self::default();\n engine.register_proc(\"list\", procedure::list);\n engine.register_proc(\"cons\", procedure::cons);\n engine.register_proc(\"<\", procedure::less);\n engine.register_proc(\"+\", procedure::add);\n engine.register_proc(\"car\", procedure::car);\n engine.register_proc(\"cdr\", procedure::cdr);\n engine.register_proc(\"set-car!\", procedure::setcar);\n engine.register_proc(\"eqv?\", procedure::eqv);\n engine.register_proc(\"apply\", procedure::apply);\n engine.register_proc(\"call-with-current-continuation\", procedure::cwcc);\n engine.register_proc(\"call/cc\", procedure::cwcc);\n engine.register_proc(\"values\", procedure::values);\n engine.register_proc(\"call-with-values\", procedure::cwv);\n engine\n }\n\n pub fn register(&mut self, variable: &str, value: Value) {\n let location = self.store.reserve();\n self.store.update(&location, value);\n self.env.borrow_mut().insert(variable, location);\n }\n\n pub fn register_proc(&mut self, variable: &str, proc: F)\n where\n F: Fn(&[Value], ExprCont) -> CommCont,\n {\n let location = self.store.reserve();\n self.store\n .update(&location, Procedure(Proc::new(Rc::new(proc))));\n self.env.borrow_mut().insert(variable, location);\n }\n\n pub fn eval(&mut self, ast: &AST) -> Answer {\n let expr_cont: ExprCont = Rc::new(|mut values: Vec| {\n let answer = values.pop().unwrap_or(Unspecified);\n let cont: CommCont = Rc::new(move |_store: &mut Store| Ok(answer.clone()));\n cont\n });\n\n let cont = eval(ast, Rc::clone(&self.env), expr_cont);\n cont(&mut self.store)\n }\n\n pub fn eval_and_print(&mut self, ast: &AST) {\n let expr_cont: ExprCont = Rc::new(|mut values: Vec| {\n if let Some(value) = values.pop() {\n write(value)\n } else {\n Rc::new(|_| Ok(Unspecified))\n }\n });\n\n let cont = eval(ast, Rc::clone(&self.env), expr_cont);\n match cont(&mut self.store) {\n Ok(_) => (),\n Err(err) => eprintln!(\"Error: {}\", err),\n }\n }\n}\n\nfn eval(ast: &AST, env: Env, expr_cont: ExprCont) -> CommCont {\n match ast {\n AST::Const(lit) => eval_literal(lit, expr_cont),\n AST::Var(ident) => eval_variable(ident, env, expr_cont),\n AST::Call(f, args) => eval_proc_call(f, args, env, expr_cont),\n AST::Lambda(args, commands, expr) => match args {\n Formals::List(args) => eval_lambda(args, commands, expr, env, expr_cont),\n Formals::Dot(args, var) => eval_lambda_dot(args, var, commands, expr, env, expr_cont),\n },\n AST::Cond(test, conseq, alter) => match alter {\n Some(alter) => eval_conditional1(test, conseq, alter, env, expr_cont),\n None => eval_conditional2(test, conseq, env, expr_cont),\n },\n AST::Assign(ident, expr) => eval_assign(ident, expr, env, expr_cont),\n }\n}\n\nfn eval_literal(lit: &Lit, expr_cont: ExprCont) -> CommCont {\n fn literal(store: &mut Store, lit: &Lit) -> Value {\n match lit {\n Lit::Bool(b) => Bool(*b),\n Lit::Number(n) => Number(*n),\n Lit::Character(c) => Character(*c),\n Lit::Str(s) => Str(s.clone()),\n Lit::Quote(d) => eval_datum(store, d),\n }\n }\n\n fn eval_datum(store: &mut Store, datum: &Datum) -> Value {\n match datum {\n Datum::Bool(b) => Bool(*b),\n Datum::Number(n) => Number(*n),\n Datum::Character(c) => Character(*c),\n Datum::Str(s) => Str(s.clone()),\n Datum::Symbol(ident) => Symbol(ident.clone()),\n Datum::List(data) => match data {\n ListDatum::List(data) => data.iter().rev().fold(Null, |acc, x| {\n let cdr = store.reserve();\n store.update(&cdr, acc);\n\n let car = store.reserve();\n let x = eval_datum(store, x);\n store.update(&car, x);\n\n Pair(car, cdr, true)\n }),\n ListDatum::Cons(data, last) => {\n let last = eval_datum(store, last);\n data.iter().rev().fold(last, |acc, x| {\n let cdr = store.reserve();\n store.update(&cdr, acc);\n\n let car = store.reserve();\n let x = eval_datum(store, x);\n store.update(&car, x);\n\n Pair(car, cdr, true)\n })\n }\n ListDatum::Abbrev(_) => unimplemented!(),\n },\n Datum::Vector(data) => {\n let mut locations = Vec::with_capacity(data.len());\n for elem in data {\n let elem = eval_datum(store, elem);\n let loc = store.reserve();\n store.update(&loc, elem);\n locations.push(loc);\n }\n Vector(locations)\n }\n }\n }\n\n let lit = lit.clone();\n Rc::new(move |store| send(literal(store, &lit), &expr_cont)(store))\n}\n\nfn eval_variable(ident: &str, env: Env, expr_cont: ExprCont) -> CommCont {\n let location = match env.borrow().lookup(ident) {\n Some(location) => location,\n None => {\n return wrong(\"undefined variable\");\n }\n };\n let cont = single(move |value| send(value, &expr_cont));\n hold(location, cont)\n}\n\nfn eval_proc_call(f: &AST, args: &[AST], env: Env, cont: ExprCont) -> CommCont {\n let mut exprs = Vec::with_capacity(args.len() + 1);\n exprs.push(f.clone());\n exprs.extend_from_slice(args);\n\n let cont: ExprCont = Rc::new(move |values: Vec| {\n let (f, args) = values.split_first().unwrap();\n applicate(f, args, Rc::clone(&cont))\n });\n\n eval_list(&exprs, env, cont)\n}\n\nfn eval_list(exprs: &[AST], env: Env, cont: ExprCont) -> CommCont {\n match exprs.split_first() {\n None => cont(vec![]),\n Some((head, tail)) => {\n let tail = tail.to_vec();\n let copied_env = Rc::clone(&env);\n\n let cont = single(move |value: Value| {\n let cont = Rc::clone(&cont);\n\n let cont: ExprCont = Rc::new(move |mut values| {\n values.insert(0, value.clone());\n cont(values)\n });\n\n eval_list(&tail, Rc::clone(&copied_env), cont)\n });\n\n eval(head, env, cont)\n }\n }\n}\n\nfn eval_lambda(\n args: &[String],\n commands: &[AST],\n expr: &AST,\n env: Env,\n cont: ExprCont,\n) -> CommCont {\n let args = args.to_vec();\n let commands = commands.to_vec();\n let expr = expr.clone();\n Rc::new(move |store: &mut Store| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n let env = Rc::clone(&env);\n\n let inner = Rc::new(move |values: &[Value], cont: ExprCont| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n\n if values.len() == args.len() {\n let env = Rc::clone(&env);\n let f = Rc::new(move |locations: &[Location]| {\n let env = extends(&env, &args, &locations);\n let cont = eval(&expr, Rc::clone(&env), Rc::clone(&cont));\n eval_commands(&commands, env, cont)\n });\n tievals(f, values)\n } else {\n wrong(\"wrong number of arguments\")\n }\n });\n\n \n\n let proc = Procedure(Proc::new(inner));\n send(proc, &cont)(store)\n })\n}\n\n#[allow(unused_variables)]\nfn eval_lambda_dot(\n args: &[String],\n var: &str,\n commands: &[AST],\n expr: &AST,\n env: Env,\n cont: ExprCont,\n) -> CommCont {\n let min_args = args.len();\n let mut args = args.to_vec();\n args.push(var.to_string());\n let commands = commands.to_vec();\n let expr = expr.clone();\n Rc::new(move |store: &mut Store| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n let env = Rc::clone(&env);\n let location = store.reserve();\n\n let inner = Rc::new(move |values: &[Value], cont: ExprCont| {\n let args = args.clone();\n let commands = commands.clone();\n let expr = expr.clone();\n\n if values.len() >= min_args {\n let env = Rc::clone(&env);\n let f = Rc::new(move |locations: &[Location]| {\n let env = extends(&env, &args, &locations);\n let cont = eval(&expr, Rc::clone(&env), Rc::clone(&cont));\n eval_commands(&commands, env, cont)\n });\n tievalsrest(f, values, min_args)\n } else {\n wrong(\"too few arguments\")\n }\n });\n\n \n\n let proc = Procedure(Proc::new(inner));\n send(proc, &cont)(store)\n })\n}\n\nfn eval_commands(commands: &[AST], env: Env, cont: CommCont) -> CommCont {\n match commands.split_first() {\n Some((head, tail)) => {\n let tail = tail.to_vec();\n let copied_env = Rc::clone(&env);\n let cont = Rc::new(move |_: Vec| {\n eval_commands(&tail, Rc::clone(&copied_env), Rc::clone(&cont))\n });\n eval(head, env, cont)\n }\n None => cont,\n }\n}\n\nfn eval_conditional1(test: &AST, conseq: &AST, alter: &AST, env: Env, cont: ExprCont) -> CommCont {\n let conseq = conseq.clone();\n let alter = alter.clone();\n let copied_env = Rc::clone(&env);\n let cont = single(move |value| {\n let cont = Rc::clone(&cont);\n let env = Rc::clone(&copied_env);\n if truish(value) {\n eval(&conseq.clone(), env, cont)\n } else {\n eval(&alter.clone(), env, cont)\n }\n });\n eval(test, env, cont)\n}\n\nfn eval_conditional2(test: &AST, conseq: &AST, env: Env, cont: ExprCont) -> CommCont {\n let conseq = conseq.clone();\n let copied_env = Rc::clone(&env);\n let cont = single(move |value| {\n if truish(value) {\n eval(&conseq.clone(), Rc::clone(&copied_env), Rc::clone(&cont))\n } else {\n send(Unspecified, &cont)\n }\n });\n eval(test, env, cont)\n}\n\nfn eval_assign(ident: &str, expr: &AST, env: Env, cont: ExprCont) -> CommCont {\n let ident = ident.to_string();\n let copied_env = Rc::clone(&env);\n let cont = single(move |value: Value| {\n let location = match env.borrow().lookup(&ident) {\n Some(location) => location,\n None => {\n return wrong(\"undefined variable\");\n }\n };\n assign(location, value, send(Unspecified, &cont))\n });\n eval(expr, copied_env, cont)\n}\n\npub type Answer = Result;\n\n#[derive(Clone)]\npub struct Proc {\n inner: Rc CommCont>,\n}\n\nimpl Proc {\n fn new(inner: Rc CommCont>) -> Self {\n Self { inner }\n }\n}\n\nimpl fmt::Debug for Proc {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"Proc\")\n }\n}\n\nimpl PartialEq for Proc {\n fn eq(&self, other: &Self) -> bool {\n Rc::ptr_eq(&self.inner, &other.inner)\n }\n}\n\npub type CommCont = Rc Answer>;\npub type ExprCont = Rc) -> CommCont>;\n\n"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"pub fn write(value: Value) -> CommCont {\n fn fmt(store: &Store, value: &Value) -> String {\n match value {\n Symbol(ident) => format!(\"{}\", ident),\n Character(c) => format!(\"#\\\\{}\", c),\n Number(n) => format!(\"{}\", n),\n Pair(loc1, loc2, _) => format!(\n \"({} . {})\",\n fmt(store, &store.get(loc1)),\n fmt(store, &store.get(loc2)),\n ),\n Vector(locations) => {\n let mut strings = Vec::with_capacity(locations.len());\n for loc in locations {\n strings.push(fmt(store, &store.get(loc)));\n }\n format!(\"#({})\", strings.join(\" \"))\n }\n Str(s) => s.clone(),\n Bool(b) => format!(\"{}\", b),\n Null => \"()\".to_string(),\n Unspecified => \"\".to_string(),\n Undefined => \"\".to_string(),\n Procedure(_) => \"\".to_string(),\n }\n }\n\n Rc::new(move |store: &mut Store| {\n println!(\"{}\", fmt(store, &value));\n Ok(Unspecified)\n })\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn cdr(values: &[Value], cont: ExprCont) -> CommCont {\n\n onearg(\n\n |arg, cont| match arg.pair() {\n\n Some((_, cdr, _)) => hold(cdr, cont),\n\n None => wrong(\"non-pair argument\"),\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":4,"score":243173.6051900477},{"content":"pub fn car(values: &[Value], cont: ExprCont) -> CommCont {\n\n onearg(\n\n |arg, cont| match arg.pair() {\n\n Some((car, _, _)) => hold(car, cont),\n\n None => wrong(\"non-pair argument\"),\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":5,"score":243173.6051900477},{"content":"pub fn onearg(f: F, values: &[Value], cont: ExprCont) -> CommCont\n\nwhere\n\n F: Fn(&Value, ExprCont) -> CommCont,\n\n{\n\n match values {\n\n [arg] => f(arg, cont),\n\n _ => wrong(\"wrong number of arguments\"),\n\n }\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":8,"score":231611.68536269834},{"content":"pub fn twoarg(f: F, values: &[Value], cont: ExprCont) -> CommCont\n\nwhere\n\n F: Fn(&Value, &Value, ExprCont) -> CommCont,\n\n{\n\n match values {\n\n [arg1, arg2] => f(arg1, arg2, cont),\n\n _ => wrong(\"wrong number of arguments\"),\n\n }\n\n}\n","file_path":"src/engine/auxiliary.rs","rank":9,"score":231611.68536269834},{"content":"pub fn applicate(f: &Value, args: &[Value], cont: ExprCont) -> CommCont {\n\n match f {\n\n Procedure(proc) => (proc.inner)(args, cont),\n\n _ => wrong(\"bad procedure\"),\n\n }\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":10,"score":229000.6432012883},{"content":"pub fn extends(root: &Env, args: &[String], locations: &[Location]) -> Env {\n\n let mut env = Environment::make_scope(Rc::clone(root));\n\n let itr = args.iter().zip(locations.iter().cloned());\n\n for (ident, location) in itr {\n\n env.insert(ident, location);\n\n }\n\n Rc::new(RefCell::new(env))\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":12,"score":214943.18103095662},{"content":"pub fn values(values: &[Value], cont: ExprCont) -> CommCont {\n\n cont(values.to_vec())\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":13,"score":212329.58123037138},{"content":"pub fn hold(location: Location, cont: ExprCont) -> CommCont {\n\n Rc::new(move |store: &mut Store| {\n\n let cont = send(store.get(&location), &cont);\n\n cont(store)\n\n })\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":15,"score":208868.34517005362},{"content":"pub fn send(value: Value, cont: &ExprCont) -> CommCont {\n\n cont(vec![value])\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":16,"score":207967.08881278677},{"content":"pub fn cwv(values: &[Value], cont: ExprCont) -> CommCont {\n\n twoarg(\n\n |lhs, rhs, cont| {\n\n let rhs = rhs.clone();\n\n let cont = Rc::clone(&cont);\n\n applicate(\n\n &lhs,\n\n &[],\n\n Rc::new(move |values| applicate(&rhs, &values, Rc::clone(&cont))),\n\n )\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n","file_path":"src/engine/procedure.rs","rank":17,"score":207894.10277114413},{"content":"pub fn setcar(values: &[Value], cont: ExprCont) -> CommCont {\n\n twoarg(\n\n |pair, value, cont| match pair.pair() {\n\n Some((car, _, mutable)) => {\n\n if mutable {\n\n assign(car, value.clone(), send(Unspecified, &cont))\n\n } else {\n\n wrong(\"immutable argument\")\n\n }\n\n }\n\n None => wrong(\"non-pair argument\"),\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":18,"score":207894.10277114416},{"content":"pub fn list(values: &[Value], cont: ExprCont) -> CommCont {\n\n match values.split_first() {\n\n Some((head, tail)) => {\n\n let head = head.clone();\n\n list(\n\n tail,\n\n single(move |value| cons(&[head.clone(), value], Rc::clone(&cont))),\n\n )\n\n }\n\n None => send(Null, &cont),\n\n }\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":19,"score":207894.10277114416},{"content":"// support function\n\npub fn valueslist(values: &[Value], cont: ExprCont) -> CommCont {\n\n onearg(\n\n |arg, cont| match arg {\n\n Pair(_, _, _) => {\n\n let arg = arg.clone();\n\n let cont = cont.clone();\n\n cdr(\n\n &[arg.clone()],\n\n Rc::new(move |values| {\n\n let arg = arg.clone();\n\n let cont = cont.clone();\n\n valueslist(\n\n &values,\n\n Rc::new(move |values| {\n\n let cont = cont.clone();\n\n car(\n\n &[arg.clone()],\n\n single(move |value| {\n\n let mut values = values.clone();\n\n values.insert(0, value);\n","file_path":"src/engine/procedure.rs","rank":20,"score":207894.10277114416},{"content":"pub fn eqv(values: &[Value], cont: ExprCont) -> CommCont {\n\n twoarg(|lhs, rhs, cont| send(Bool(lhs == rhs), &cont), values, cont)\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":21,"score":207894.10277114416},{"content":"pub fn add(values: &[Value], cont: ExprCont) -> CommCont {\n\n let mut args = Vec::with_capacity(values.len());\n\n for v in values {\n\n match v.number() {\n\n Some(num) => args.push(num),\n\n None => return wrong(\"non-numeric argument\"),\n\n }\n\n }\n\n send(Number(args.into_iter().sum()), &cont)\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":22,"score":207894.10277114416},{"content":"pub fn cwcc(values: &[Value], cont: ExprCont) -> CommCont {\n\n onearg(\n\n |arg, cont| match arg {\n\n Procedure(proc) => {\n\n let proc = Rc::clone(&proc.inner);\n\n let cont = Rc::clone(&cont);\n\n Rc::new(move |store| {\n\n let new_cont = Rc::clone(&cont);\n\n let new_proc = Procedure(Proc::new(Rc::new(move |values, _cont| {\n\n new_cont(values.to_vec())\n\n })));\n\n proc(&[new_proc], Rc::clone(&cont))(store)\n\n })\n\n }\n\n _ => wrong(\"bad procedure argument\"),\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":23,"score":207894.10277114416},{"content":"pub fn apply(values: &[Value], cont: ExprCont) -> CommCont {\n\n twoarg(\n\n |operator, operand, cont| match operator {\n\n Procedure(proc) => {\n\n let proc = Rc::clone(&proc.inner);\n\n valueslist(\n\n &[operand.clone()],\n\n Rc::new(move |values| proc(&values, Rc::clone(&cont))),\n\n )\n\n }\n\n _ => wrong(\"bad procedure argument\"),\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":24,"score":207894.10277114413},{"content":"pub fn cons(values: &[Value], cont: ExprCont) -> CommCont {\n\n twoarg(\n\n |head, tail, cont| {\n\n let head = head.clone();\n\n let tail = tail.clone();\n\n Rc::new(move |store: &mut Store| {\n\n let loc1 = store.reserve();\n\n store.update(&loc1, head.clone());\n\n let loc2 = store.reserve();\n\n store.update(&loc2, tail.clone());\n\n send(Pair(loc1, loc2, true), &cont)(store)\n\n })\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":25,"score":207894.10277114416},{"content":"pub fn less(values: &[Value], cont: ExprCont) -> CommCont {\n\n twoarg(\n\n |lhs, rhs, cont| {\n\n let lhs = match lhs.number() {\n\n Some(num) => num,\n\n None => return wrong(\"non-numeric argument\"),\n\n };\n\n let rhs = match rhs.number() {\n\n Some(num) => num,\n\n None => return wrong(\"non-numeric argument\"),\n\n };\n\n send(Bool(lhs < rhs), &cont)\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":26,"score":207894.10277114416},{"content":"pub fn single(f: F) -> ExprCont\n\nwhere\n\n F: Fn(Value) -> CommCont,\n\n{\n\n Rc::new(move |mut values| {\n\n if values.len() == 1 {\n\n f(values.pop().unwrap())\n\n } else {\n\n wrong(\"wrong number of return values\")\n\n }\n\n })\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":27,"score":204344.07473813996},{"content":"pub fn assign(location: Location, value: Value, cont: CommCont) -> CommCont {\n\n Rc::new(move |store: &mut Store| {\n\n store.update(&location, value.clone());\n\n cont(store)\n\n })\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":29,"score":193715.07080382708},{"content":"pub fn wrong(message: &'static str) -> CommCont {\n\n let err = EvalError {\n\n message: message.to_string(),\n\n };\n\n Rc::new(move |_| Err(err.clone()))\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":30,"score":189881.1018194704},{"content":"pub fn tievals(f: Rc CommCont>, values: &[Value]) -> CommCont {\n\n match values.split_first() {\n\n Some((head, tail)) => {\n\n let head = head.clone();\n\n let tail = tail.to_vec();\n\n let f = Rc::clone(&f);\n\n Rc::new(move |store: &mut Store| {\n\n let location = store.reserve();\n\n let loc = location.clone();\n\n let f = Rc::clone(&f);\n\n let new_f = Rc::new(move |locations: &[Location]| {\n\n let mut new_locs = Vec::with_capacity(locations.len() + 1);\n\n new_locs.push(loc.clone());\n\n new_locs.extend_from_slice(locations);\n\n f(&new_locs)\n\n });\n\n\n\n store.update(&location, head.clone());\n\n tievals(new_f, &tail)(store)\n\n })\n\n }\n\n None => f(&[]),\n\n }\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":31,"score":186369.9902899071},{"content":"pub fn tievalsrest(f: Rc CommCont>, values: &[Value], n: usize) -> CommCont {\n\n let rest = values[..n].to_vec();\n\n list(\n\n &values[n..],\n\n single(move |value| {\n\n let mut rest = rest.clone();\n\n rest.push(value);\n\n tievals(Rc::clone(&f), &rest)\n\n }),\n\n )\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":32,"score":178576.65756667516},{"content":"pub fn truish(value: Value) -> bool {\n\n value != Bool(false)\n\n}\n\n\n","file_path":"src/engine/auxiliary.rs","rank":33,"score":175793.40151237213},{"content":"pub fn pass(expr: &Expr) -> Option {\n\n match expr {\n\n Expr::Variable(variable) => Some(AST::Var(variable.clone())),\n\n Expr::Literal(literal) => Some(AST::Const(literal.clone())),\n\n Expr::ProcCall(operator, operands) => {\n\n let operator = Box::new(pass(operator)?);\n\n let operands = operands.iter().map(pass).collect::>>()?;\n\n Some(AST::Call(operator, operands))\n\n }\n\n Expr::Lambda(formals, defs, body) => {\n\n let inner_formals =\n\n Formals::List(defs.iter().map(|d| d.get_var().to_string()).collect());\n\n let mut commands = body.iter().map(pass).collect::>>()?;\n\n let expr = Box::new(commands.pop()?);\n\n let inner = AST::Lambda(inner_formals, commands, expr);\n\n\n\n let mut args = Vec::with_capacity(defs.len());\n\n for d in defs {\n\n args.push(pass(d.get_expr())?);\n\n }\n","file_path":"src/pass.rs","rank":34,"score":158866.65836120793},{"content":"fn is_initial(c: char) -> bool {\n\n match c {\n\n '!' | '$' | '%' | '&' | '*' | '/' | ':' => true,\n\n '<' | '=' | '>' | '?' | '^' | '_' | '~' => true,\n\n c if 'a' <= c && c <= 'z' => true,\n\n c if 'A' <= c && c <= 'Z' => true,\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"src/lexer.rs","rank":38,"score":80855.78523974445},{"content":"fn is_delimiter(c: char) -> bool {\n\n match c {\n\n '(' | ')' | '\"' | ';' => true,\n\n c => is_whitespace(c),\n\n }\n\n}\n\n\n","file_path":"src/lexer.rs","rank":39,"score":80855.78523974445},{"content":"fn is_whitespace(c: char) -> bool {\n\n match c {\n\n ' ' | '\\t' | '\\n' => true,\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"src/lexer.rs","rank":40,"score":80855.78523974445},{"content":"fn is_subsequent(c: char) -> bool {\n\n match c {\n\n c if is_initial(c) => true,\n\n c if c.is_digit(10) => true,\n\n '+' | '-' | '.' | '@' => true,\n\n _ => false,\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub struct Token {\n\n pub kind: TokenKind,\n\n}\n\n\n\nimpl Token {\n\n pub fn new(kind: TokenKind) -> Self {\n\n Self { kind }\n\n }\n\n}\n\n\n","file_path":"src/lexer.rs","rank":41,"score":80855.78523974445},{"content":" inner: HashMap::new(),\n\n }\n\n }\n\n\n\n pub fn insert(&mut self, ident: &str, location: Location) {\n\n self.inner.insert(ident.to_lowercase(), location);\n\n }\n\n\n\n pub fn lookup(&self, ident: &str) -> Option {\n\n match self.inner.get(ident) {\n\n Some(location) => Some(location.clone()),\n\n None => self.root.as_ref()?.borrow().lookup(ident),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Default)]\n\npub struct Store;\n\n\n\nimpl Store {\n","file_path":"src/engine/storage.rs","rank":42,"score":49607.5474468838},{"content":"use super::Value;\n\nuse std::cell::RefCell;\n\nuse std::collections::HashMap;\n\nuse std::rc::Rc;\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub struct Location(Rc>);\n\n\n\npub type Env = Rc>;\n\n\n\n#[derive(Default, Clone)]\n\npub struct Environment {\n\n root: Option,\n\n inner: HashMap,\n\n}\n\n\n\nimpl Environment {\n\n pub fn make_scope(root: Env) -> Self {\n\n Self {\n\n root: Some(root),\n","file_path":"src/engine/storage.rs","rank":43,"score":49602.997268819134},{"content":" pub fn get(&self, location: &Location) -> Value {\n\n location.0.borrow().clone()\n\n }\n\n\n\n pub fn reserve(&mut self) -> Location {\n\n Location(Rc::new(RefCell::new(Value::Undefined)))\n\n }\n\n\n\n pub fn update(&mut self, location: &Location, value: Value) {\n\n *location.0.borrow_mut() = value;\n\n }\n\n}\n","file_path":"src/engine/storage.rs","rank":44,"score":49599.894383046274},{"content":"use super::*;\n\nuse std::cell::RefCell;\n\nuse std::rc::Rc;\n\n\n","file_path":"src/engine/auxiliary.rs","rank":45,"score":49068.14870109735},{"content":" cont(values)\n\n }),\n\n )\n\n }),\n\n )\n\n }),\n\n )\n\n }\n\n Null => cont(vec![]),\n\n _ => wrong(\"non-list argument\"),\n\n },\n\n values,\n\n cont,\n\n )\n\n}\n\n\n","file_path":"src/engine/procedure.rs","rank":46,"score":48967.91228247738},{"content":"use super::*;\n\n\n","file_path":"src/engine/procedure.rs","rank":47,"score":48958.93186402434},{"content":"fn main() -> io::Result<()> {\n\n let mut engine = engine::Engine::new();\n\n engine.register(\"pi\", Number(std::f64::consts::PI));\n\n\n\n loop {\n\n print!(\"mictyris> \");\n\n io::stdout().flush()?;\n\n\n\n let mut buffer = String::new();\n\n if io::stdin().read_line(&mut buffer)? == 0 {\n\n // EOF\n\n println!();\n\n break;\n\n }\n\n\n\n match buffer.trim() {\n\n \"\" => continue,\n\n \"quit\" => break,\n\n _ => (),\n\n }\n","file_path":"src/main.rs","rank":48,"score":37542.10285693365},{"content":" Cons(Vec, Box),\n\n Abbrev(Box),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Formals {\n\n List(Vec),\n\n Dot(Vec, String),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Def {\n\n Variable(String, Box),\n\n}\n\n\n\nimpl Def {\n\n pub fn get_var(&self) -> &str {\n\n match self {\n\n Self::Variable(var, _) => var,\n\n }\n","file_path":"src/parser.rs","rank":61,"score":24.4854933544541},{"content":" pub fn new(input: &'a str) -> Self {\n\n Self {\n\n lexer: Lookahead::new(Lexer::new(input)),\n\n }\n\n }\n\n\n\n pub fn parse(&mut self) -> Option {\n\n let tok = self.lexer.next()?;\n\n match tok.kind {\n\n TokenKind::Ident(ident) => Some(Variable(ident.var()?)),\n\n TokenKind::Bool(b) => Some(Literal(Lit::Bool(b))),\n\n TokenKind::Number(num) => Some(Literal(Lit::Number(num))),\n\n TokenKind::Character(c) => Some(Literal(Lit::Character(c))),\n\n TokenKind::Str(s) => Some(Literal(Lit::Str(s))),\n\n TokenKind::OpenParen => match self.lexer.first()?.kind.ident() {\n\n Some(ident) => match ident {\n\n Identifier::Lambda => self.parse_lambda(),\n\n Identifier::If => self.parse_conditional(),\n\n Identifier::Set => self.parse_assign(),\n\n Identifier::Var(_) => self.parse_call(),\n","file_path":"src/parser.rs","rank":62,"score":22.6635396667816},{"content":" let mut parser = Parser::new(input);\n\n let answer = ProcCall(\n\n Box::new(Lambda(\n\n Formals::List(vec![\"x\".to_string()]),\n\n vec![],\n\n vec![Variable(\"x\".to_string())],\n\n )),\n\n vec![Literal(Lit::Bool(true))],\n\n );\n\n assert_eq!(parser.parse(), Some(answer));\n\n }\n\n}\n","file_path":"src/parser.rs","rank":63,"score":21.07826865993251},{"content":"use crate::lexer::*;\n\n\n\nuse Expr::*;\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Expr {\n\n Variable(String), // variable\n\n Literal(Lit), // literal\n\n ProcCall(Box, Vec), // procedure call\n\n Lambda(Formals, Vec, Vec), // lambda expression\n\n Cond(Box, Box, Option>), // conditional\n\n Assignment(String, Box), // assignment\n\n Derived, // derived expression\n\n MacroUse, // macro use\n\n MacroBlock, // macro block\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Lit {\n\n Bool(bool),\n","file_path":"src/parser.rs","rank":64,"score":20.50721708253855},{"content":" And,\n\n Or,\n\n Case,\n\n Let,\n\n LetStar,\n\n Letrec,\n\n Do,\n\n Delay,\n\n Quasiquote,\n\n}\n\n\n\nimpl Identifier {\n\n pub fn var(&self) -> Option {\n\n match self {\n\n Self::Var(var) => Some(var.to_string()),\n\n _ => None,\n\n }\n\n }\n\n}\n\n\n","file_path":"src/lexer.rs","rank":65,"score":19.588998368345344},{"content":" let mut exprs = Vec::new();\n\n loop {\n\n if self.eat_close_paren() {\n\n break;\n\n }\n\n exprs.push(self.parse()?);\n\n }\n\n Some(exprs)\n\n }\n\n\n\n fn parse_datum(&mut self) -> Option {\n\n let tok = self.lexer.next()?;\n\n match tok.kind {\n\n TokenKind::Ident(ident) => Some(Datum::Symbol(ident)),\n\n TokenKind::Bool(b) => Some(Datum::Bool(b)),\n\n TokenKind::Number(num) => Some(Datum::Number(num)),\n\n TokenKind::Character(c) => Some(Datum::Character(c)),\n\n TokenKind::Str(s) => Some(Datum::Str(s)),\n\n TokenKind::OpenParen => self.parse_list(),\n\n TokenKind::SharpParen => self.parse_vector(),\n","file_path":"src/parser.rs","rank":66,"score":17.77319737237873},{"content":"#[derive(Clone, Debug, PartialEq)]\n\npub enum TokenKind {\n\n Ident(Identifier),\n\n Bool(bool),\n\n Number(f64),\n\n Character(char),\n\n Str(String),\n\n OpenParen,\n\n CloseParen,\n\n SharpParen,\n\n Quote,\n\n Backquote,\n\n Comma,\n\n CommaAt,\n\n Dot,\n\n}\n\n\n\nimpl TokenKind {\n\n pub fn ident(&self) -> Option<&Identifier> {\n\n match self {\n","file_path":"src/lexer.rs","rank":67,"score":17.3725697570015},{"content":" Number(f64),\n\n Character(char),\n\n Str(String),\n\n Quote(Datum),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Datum {\n\n Bool(bool),\n\n Number(f64),\n\n Character(char),\n\n Str(String),\n\n Symbol(Identifier),\n\n List(ListDatum),\n\n Vector(Vec),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum ListDatum {\n\n List(Vec),\n","file_path":"src/parser.rs","rank":68,"score":17.207950434450176},{"content":"\n\n let mut parser = parser::Parser::new(&buffer);\n\n let expr = match parser.parse() {\n\n Some(expr) => expr,\n\n None => continue,\n\n };\n\n let ast = match pass::pass(&expr) {\n\n Some(ast) => ast,\n\n None => continue,\n\n };\n\n engine.eval_and_print(&ast);\n\n }\n\n Ok(())\n\n}\n","file_path":"src/main.rs","rank":69,"score":17.131773365201873},{"content":" }\n\n\n\n pub fn get_expr(&self) -> &Expr {\n\n match self {\n\n Self::Variable(_, expr) => expr,\n\n }\n\n }\n\n}\n\n\n\npub struct Lookahead\n\nwhere\n\n I: Iterator,\n\n{\n\n inner: I,\n\n first: Option,\n\n second: Option,\n\n}\n\n\n\nimpl Lookahead\n\nwhere\n","file_path":"src/parser.rs","rank":70,"score":16.88801641426189},{"content":"use crate::parser::*;\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum AST {\n\n Const(Lit),\n\n Var(String),\n\n Call(Box, Vec),\n\n Lambda(Formals, Vec, Box),\n\n Cond(Box, Box, Option>),\n\n Assign(String, Box),\n\n}\n\n\n","file_path":"src/pass.rs","rank":71,"score":16.593497363173665},{"content":"}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_parse_ident() {\n\n let mut lexer = Lexer::new(\"lambda ...\");\n\n assert_eq!(lexer.parse(), Some(Token::new(Ident(Identifier::Lambda))));\n\n assert_eq!(\n\n lexer.parse(),\n\n Some(Token::new(Ident(Identifier::Var(\"...\".to_string()))))\n\n );\n\n assert_eq!(lexer.parse(), None);\n\n }\n\n\n\n #[test]\n\n fn test_parse_bool() {\n\n let mut lexer = Lexer::new(\"#t #f\");\n","file_path":"src/lexer.rs","rank":72,"score":16.315781109755637},{"content":" let expr = AST::Call(Box::new(inner), args);\n\n Some(AST::Lambda(formals.clone(), vec![], Box::new(expr)))\n\n }\n\n Expr::Cond(test, consequent, alternate) => {\n\n let test = Box::new(pass(test)?);\n\n let consequent = Box::new(pass(consequent)?);\n\n let alternate = match alternate {\n\n Some(alt) => Some(Box::new(pass(alt)?)),\n\n None => None,\n\n };\n\n Some(AST::Cond(test, consequent, alternate))\n\n }\n\n Expr::Assignment(var, expr) => {\n\n let expr = Box::new(pass(expr)?);\n\n Some(AST::Assign(var.clone(), expr))\n\n }\n\n _ => None,\n\n }\n\n}\n","file_path":"src/pass.rs","rank":73,"score":15.42729449055194},{"content":" Self::Ident(ident) => Some(ident),\n\n _ => None,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Identifier {\n\n Var(String),\n\n Else,\n\n Arrow,\n\n Define,\n\n Unquote,\n\n UnquoteSplicing,\n\n Quote,\n\n Lambda,\n\n If,\n\n Set,\n\n Begin,\n\n Cond,\n","file_path":"src/lexer.rs","rank":74,"score":15.034214066039233},{"content":"pub mod engine;\n\npub mod lexer;\n\npub mod parser;\n\npub mod pass;\n\n\n\nuse engine::Value::*;\n\nuse std::io::{self, Write};\n\n\n","file_path":"src/main.rs","rank":75,"score":15.001000075859121},{"content":" return Some(Datum::List(ListDatum::List(data)));\n\n }\n\n TokenKind::Dot => {\n\n if data.is_empty() {\n\n return None;\n\n }\n\n self.lexer.next();\n\n let last = Box::new(self.parse_datum()?);\n\n if self.eat_close_paren() {\n\n return Some(Datum::List(ListDatum::Cons(data, last)));\n\n }\n\n return None;\n\n }\n\n _ => data.push(self.parse_datum()?),\n\n }\n\n }\n\n None\n\n }\n\n\n\n fn parse_vector(&mut self) -> Option {\n","file_path":"src/parser.rs","rank":76,"score":14.65211858262899},{"content":"\n\npub struct Cursor<'a> {\n\n chars: Chars<'a>,\n\n last_len: usize,\n\n}\n\n\n\nimpl<'a> Cursor<'a> {\n\n pub fn new(input: &'a str) -> Self {\n\n Self {\n\n last_len: input.len(),\n\n chars: input.chars(),\n\n }\n\n }\n\n\n\n pub fn peek(&self) -> Option {\n\n self.chars.clone().next()\n\n }\n\n\n\n pub fn eat(&mut self) -> Option {\n\n self.chars.next()\n","file_path":"src/lexer/cursor.rs","rank":77,"score":14.500248862746709},{"content":"use super::{is_delimiter, is_initial, is_subsequent, is_whitespace};\n\nuse std::str::Chars;\n\n\n\nuse TokenKind::*;\n\n\n\n#[derive(Debug, PartialEq)]\n\npub struct Token {\n\n pub kind: TokenKind,\n\n pub len: usize,\n\n}\n\n\n\nimpl Token {\n\n pub fn new(kind: TokenKind, len: usize) -> Self {\n\n Self { kind, len }\n\n }\n\n}\n\n\n\n#[derive(Clone, Copy, Debug, PartialEq)]\n\npub enum TokenKind {\n\n // Atomosphere\n","file_path":"src/lexer/cursor.rs","rank":78,"score":14.329282333463517},{"content":" }\n\n\n\n pub fn terminated bool>(&self, pred: P) -> bool {\n\n if let Some(c) = self.peek() {\n\n pred(c)\n\n } else {\n\n true\n\n }\n\n }\n\n\n\n pub fn len_eaten(&mut self) -> usize {\n\n let current = self.chars.as_str().len();\n\n let len = self.last_len - current;\n\n self.last_len = current;\n\n len\n\n }\n\n\n\n pub fn get_token(&mut self) -> Option {\n\n let kind = self.get_token_kind()?;\n\n let len = self.len_eaten();\n","file_path":"src/lexer/cursor.rs","rank":79,"score":14.296316565248834},{"content":" };\n\n Some(Ident(ident))\n\n }\n\n\n\n fn parse_bool(&mut self, start: usize) -> Option {\n\n match self.substr(start) {\n\n \"#t\" => Some(Bool(true)),\n\n \"#f\" => Some(Bool(false)),\n\n _ => None,\n\n }\n\n }\n\n\n\n fn parse_number(&mut self, start: usize) -> Option {\n\n let num: f64 = self.substr(start).parse().ok()?;\n\n Some(Number(num))\n\n }\n\n\n\n fn parse_character(&mut self, start: usize) -> Option {\n\n let s = self.substr(start + 2);\n\n\n","file_path":"src/lexer.rs","rank":80,"score":14.216213078510679},{"content":" let mut data = Vec::new();\n\n loop {\n\n if self.eat_close_paren() {\n\n break;\n\n }\n\n data.push(self.parse_datum()?);\n\n }\n\n Some(Datum::Vector(data))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn test_lookahead() {\n\n let xs = [1, 2, 3];\n\n let mut iter = Lookahead::new(xs.iter());\n\n\n","file_path":"src/parser.rs","rank":81,"score":13.906723756431488},{"content":" _ => None,\n\n },\n\n None => self.parse_call(),\n\n },\n\n TokenKind::Quote => Some(Literal(Lit::Quote(self.parse_datum()?))),\n\n _ => None,\n\n }\n\n }\n\n\n\n fn eat_close_paren(&mut self) -> bool {\n\n if let Some(tok) = self.lexer.first() {\n\n if tok.kind == TokenKind::CloseParen {\n\n self.lexer.next();\n\n return true;\n\n }\n\n }\n\n false\n\n }\n\n\n\n fn parse_lambda(&mut self) -> Option {\n","file_path":"src/parser.rs","rank":82,"score":13.640086142842843},{"content":" Some(Token::new(kind, len))\n\n }\n\n\n\n pub fn get_token_kind(&mut self) -> Option {\n\n match self.eat()? {\n\n '(' => Some(OpenParen),\n\n ')' => Some(CloseParen),\n\n '#' => match self.eat()? {\n\n '(' => Some(SharpParen),\n\n '\\\\' => {\n\n self.eat()?;\n\n self.eat_until(is_delimiter);\n\n Some(Character)\n\n }\n\n 't' | 'f' => Some(Bool),\n\n 'i' | 'e' | 'b' | 'o' | 'd' | 'x' => {\n\n self.eat_until(is_delimiter);\n\n Some(Number)\n\n }\n\n _ => None,\n","file_path":"src/lexer/cursor.rs","rank":83,"score":13.024286486650428},{"content":"\n\n fn string(&mut self) -> Option<()> {\n\n while let Some(c) = self.eat() {\n\n match c {\n\n '\"' => return Some(()),\n\n '\\\\' => match self.eat()? {\n\n '\"' | '\\\\' => (),\n\n _ => return None,\n\n },\n\n _ => (),\n\n }\n\n }\n\n None\n\n }\n\n\n\n fn triple_dot(&mut self) -> bool {\n\n if self.eat() != Some('.') {\n\n return false;\n\n }\n\n if self.eat() != Some('.') {\n","file_path":"src/lexer/cursor.rs","rank":84,"score":12.992025358805742},{"content":" self.lexer.next();\n\n let formals = self.parse_formals()?;\n\n let (defs, body) = self.parse_body()?;\n\n if self.eat_close_paren() {\n\n Some(Lambda(formals, defs, body))\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n fn parse_formals(&mut self) -> Option {\n\n match self.lexer.next()?.kind {\n\n TokenKind::Ident(ident) => Some(Formals::Dot(vec![], ident.var()?)),\n\n TokenKind::OpenParen => {\n\n let mut idents = Vec::new();\n\n while let Some(tok) = self.lexer.next() {\n\n match tok.kind {\n\n TokenKind::CloseParen => {\n\n return Some(Formals::List(idents));\n\n }\n","file_path":"src/parser.rs","rank":85,"score":12.654757851697395},{"content":" let c = if s.len() == 1 {\n\n s.chars().next()?\n\n } else {\n\n match s.to_lowercase().as_str() {\n\n \"space\" => ' ',\n\n \"newline\" => '\\n',\n\n _ => return None,\n\n }\n\n };\n\n\n\n Some(Character(c))\n\n }\n\n}\n\n\n\nimpl Iterator for Lexer<'_> {\n\n type Item = Token;\n\n\n\n fn next(&mut self) -> Option {\n\n self.parse()\n\n }\n","file_path":"src/lexer.rs","rank":86,"score":12.45740195043116},{"content":" }\n\n\n\n fn parse_assign(&mut self) -> Option {\n\n self.lexer.next();\n\n let var = self.lexer.next()?.kind.ident()?.var()?;\n\n let expr = Box::new(self.parse()?);\n\n if self.eat_close_paren() {\n\n Some(Assignment(var, expr))\n\n } else {\n\n None\n\n }\n\n }\n\n\n\n fn parse_call(&mut self) -> Option {\n\n let operator = Box::new(self.parse()?);\n\n let operands = self.parse_to_close()?;\n\n Some(ProcCall(operator, operands))\n\n }\n\n\n\n fn parse_to_close(&mut self) -> Option> {\n","file_path":"src/parser.rs","rank":87,"score":12.291696221908134},{"content":" I: Iterator,\n\n{\n\n pub fn new(mut inner: I) -> Self {\n\n let first = inner.next();\n\n let second = inner.next();\n\n Self {\n\n inner,\n\n first,\n\n second,\n\n }\n\n }\n\n\n\n pub fn first(&self) -> Option<&I::Item> {\n\n self.first.as_ref()\n\n }\n\n\n\n pub fn second(&self) -> Option<&I::Item> {\n\n self.second.as_ref()\n\n }\n\n}\n","file_path":"src/parser.rs","rank":88,"score":12.27172796416627},{"content":"impl fmt::Display for Identifier {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n match self {\n\n Self::Var(ident) => write!(f, \"{}\", ident),\n\n Self::Else => write!(f, \"else\"),\n\n Self::Arrow => write!(f, \"=>\"),\n\n Self::Define => write!(f, \"define\"),\n\n Self::Unquote => write!(f, \"unquote\"),\n\n Self::UnquoteSplicing => write!(f, \"unquote-splicing\"),\n\n Self::Quote => write!(f, \"quote\"),\n\n Self::Lambda => write!(f, \"lambda\"),\n\n Self::If => write!(f, \"if\"),\n\n Self::Set => write!(f, \"set!\"),\n\n Self::Begin => write!(f, \"begin\"),\n\n Self::Cond => write!(f, \"cond\"),\n\n Self::And => write!(f, \"and\"),\n\n Self::Or => write!(f, \"or\"),\n\n Self::Case => write!(f, \"case\"),\n\n Self::Let => write!(f, \"let\"),\n\n Self::LetStar => write!(f, \"let*\"),\n","file_path":"src/lexer.rs","rank":89,"score":11.964074420599323},{"content":" }\n\n }\n\n\n\n pub fn parse(&mut self) -> Option {\n\n let tok = self.cursor.get_token()?;\n\n\n\n let start = self.pos;\n\n self.pos += tok.len;\n\n\n\n let kind = match tok.kind {\n\n cursor::TokenKind::Whitespace => return self.parse(),\n\n cursor::TokenKind::Comment => return self.parse(),\n\n\n\n cursor::TokenKind::Ident => self.parse_ident(start)?,\n\n cursor::TokenKind::Bool => self.parse_bool(start)?,\n\n cursor::TokenKind::Number => self.parse_number(start)?,\n\n cursor::TokenKind::Character => self.parse_character(start)?,\n\n cursor::TokenKind::Str => Str(self.substr(start).to_string()),\n\n\n\n cursor::TokenKind::OpenParen => OpenParen,\n","file_path":"src/lexer.rs","rank":90,"score":11.958200348107608},{"content":" Self::Letrec => write!(f, \"letrec\"),\n\n Self::Do => write!(f, \"do\"),\n\n Self::Delay => write!(f, \"delay\"),\n\n Self::Quasiquote => write!(f, \"quasiquote\"),\n\n }\n\n }\n\n}\n\n\n\npub struct Lexer<'a> {\n\n cursor: cursor::Cursor<'a>,\n\n input: &'a str,\n\n pos: usize,\n\n}\n\n\n\nimpl<'a> Lexer<'a> {\n\n pub fn new(input: &'a str) -> Self {\n\n Self {\n\n cursor: cursor::Cursor::new(input),\n\n input,\n\n pos: 0,\n","file_path":"src/lexer.rs","rank":91,"score":11.926171834487917},{"content":" assert_eq!(lexer.parse(), Some(Token::new(Bool(true))));\n\n assert_eq!(lexer.parse(), Some(Token::new(Bool(false))));\n\n assert_eq!(lexer.parse(), None);\n\n }\n\n\n\n #[test]\n\n fn test_parse_number() {\n\n let mut lexer = Lexer::new(\"0.1 100\");\n\n assert_eq!(lexer.parse(), Some(Token::new(Number(0.1))));\n\n assert_eq!(lexer.parse(), Some(Token::new(Number(100.0))));\n\n assert_eq!(lexer.parse(), None);\n\n }\n\n\n\n #[test]\n\n fn test_parse_character() {\n\n let mut lexer = Lexer::new(\"#\\\\a #\\\\space\");\n\n assert_eq!(lexer.parse(), Some(Token::new(Character('a'))));\n\n assert_eq!(lexer.parse(), Some(Token::new(Character(' '))));\n\n assert_eq!(lexer.parse(), None);\n\n }\n","file_path":"src/lexer.rs","rank":92,"score":11.711581534529138},{"content":" self.eat_until(is_delimiter);\n\n Some(Number)\n\n }\n\n _ => None,\n\n }\n\n }\n\n\n\n fn eat_while bool>(&mut self, pred: P) {\n\n while let Some(c) = self.peek() {\n\n if pred(c) {\n\n self.eat();\n\n } else {\n\n break;\n\n }\n\n }\n\n }\n\n\n\n fn eat_until bool>(&mut self, pred: P) {\n\n self.eat_while(|c| !pred(c));\n\n }\n","file_path":"src/lexer/cursor.rs","rank":93,"score":11.694829489046045},{"content":" if tok.kind == TokenKind::CloseParen {\n\n if exprs.is_empty() {\n\n return None;\n\n } else {\n\n return Some((defs, exprs));\n\n }\n\n } else {\n\n exprs.push(self.parse()?);\n\n }\n\n }\n\n None\n\n }\n\n\n\n fn parse_define(&mut self) -> Option {\n\n self.lexer.next(); // eat '('\n\n self.lexer.next(); // eat \"define\"\n\n let var = self.lexer.next()?.kind.ident()?.var()?;\n\n let expr = Box::new(self.parse()?);\n\n if self.eat_close_paren() {\n\n Some(Def::Variable(var, expr))\n","file_path":"src/parser.rs","rank":94,"score":11.68169352249493},{"content":" #[test]\n\n fn test_parse_string() {\n\n let mut lexer = Cursor::new(\"\\\"string\\\"\\\"\\\\\\\"\\\"\");\n\n assert_eq!(lexer.get_token(), Some(Token::new(Str, 8)));\n\n assert_eq!(lexer.get_token(), Some(Token::new(Str, 4)));\n\n assert_eq!(lexer.get_token(), None);\n\n\n\n let mut lexer = Cursor::new(\"\\\"string\");\n\n assert_eq!(lexer.get_token(), None);\n\n\n\n let mut lexer = Cursor::new(\"\\\\a\");\n\n assert_eq!(lexer.get_token(), None);\n\n }\n\n\n\n #[test]\n\n fn test_parse_character() {\n\n let mut lexer = Cursor::new(\"#\\\\a\");\n\n assert_eq!(lexer.get_token(), Some(Token::new(Character, 3)));\n\n\n\n let mut lexer = Cursor::new(\"#\\\\\");\n","file_path":"src/lexer/cursor.rs","rank":95,"score":11.54597331615398},{"content":" TokenKind::Dot => {\n\n if idents.is_empty() {\n\n return None;\n\n }\n\n let last = self.lexer.next()?.kind.ident()?.var()?;\n\n if self.eat_close_paren() {\n\n return Some(Formals::Dot(idents, last));\n\n }\n\n return None;\n\n }\n\n TokenKind::Ident(ident) => {\n\n idents.push(ident.var()?);\n\n }\n\n _ => return None,\n\n }\n\n }\n\n None\n\n }\n\n _ => None,\n\n }\n","file_path":"src/parser.rs","rank":96,"score":11.382446248909996},{"content":" TokenKind::Quote => self.parse_abbrev_list(),\n\n TokenKind::Backquote => self.parse_abbrev_list(),\n\n TokenKind::Comma => self.parse_abbrev_list(),\n\n TokenKind::CommaAt => self.parse_abbrev_list(),\n\n _ => None,\n\n }\n\n }\n\n\n\n fn parse_abbrev_list(&mut self) -> Option {\n\n Some(Datum::List(ListDatum::Abbrev(Box::new(\n\n self.parse_datum()?,\n\n ))))\n\n }\n\n\n\n fn parse_list(&mut self) -> Option {\n\n let mut data = Vec::new();\n\n while let Some(tok) = self.lexer.first() {\n\n match tok.kind {\n\n TokenKind::CloseParen => {\n\n self.lexer.next();\n","file_path":"src/parser.rs","rank":97,"score":10.805422604058768},{"content":"\n\nimpl Iterator for Lookahead\n\nwhere\n\n I: Iterator,\n\n{\n\n type Item = I::Item;\n\n\n\n fn next(&mut self) -> Option {\n\n let mut retval = self.inner.next();\n\n std::mem::swap(&mut retval, &mut self.first);\n\n std::mem::swap(&mut self.first, &mut self.second);\n\n retval\n\n }\n\n}\n\n\n\npub struct Parser<'a> {\n\n lexer: Lookahead>,\n\n}\n\n\n\nimpl<'a> Parser<'a> {\n","file_path":"src/parser.rs","rank":98,"score":10.486747256872901},{"content":" assert_eq!(lexer.get_token(), None);\n\n\n\n let mut lexer = Cursor::new(\"#\\\\newline\");\n\n assert_eq!(lexer.get_token(), Some(Token::new(Character, 9)));\n\n }\n\n\n\n #[test]\n\n fn test_parse_boolean() {\n\n let mut lexer = Cursor::new(\"#t #f\");\n\n assert_eq!(lexer.get_token(), Some(Token::new(Bool, 2)));\n\n assert_eq!(lexer.get_token(), Some(Token::new(Whitespace, 1)));\n\n assert_eq!(lexer.get_token(), Some(Token::new(Bool, 2)));\n\n }\n\n\n\n #[test]\n\n fn test_parse_peculiar_identifier() {\n\n let mut lexer = Cursor::new(\"+ - ... \");\n\n assert_eq!(lexer.get_token(), Some(Token::new(Ident, 1)));\n\n assert_eq!(lexer.get_token(), Some(Token::new(Whitespace, 1)));\n\n assert_eq!(lexer.get_token(), Some(Token::new(Ident, 1)));\n","file_path":"src/lexer/cursor.rs","rank":99,"score":9.175788956599776}],"string":"[\n {\n \"content\": \"pub fn cdr(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n onearg(\\n\\n |arg, cont| match arg.pair() {\\n\\n Some((_, cdr, _)) => hold(cdr, cont),\\n\\n None => wrong(\\\"non-pair argument\\\"),\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 4,\n \"score\": 243173.6051900477\n },\n {\n \"content\": \"pub fn car(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n onearg(\\n\\n |arg, cont| match arg.pair() {\\n\\n Some((car, _, _)) => hold(car, cont),\\n\\n None => wrong(\\\"non-pair argument\\\"),\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 5,\n \"score\": 243173.6051900477\n },\n {\n \"content\": \"pub fn onearg(f: F, values: &[Value], cont: ExprCont) -> CommCont\\n\\nwhere\\n\\n F: Fn(&Value, ExprCont) -> CommCont,\\n\\n{\\n\\n match values {\\n\\n [arg] => f(arg, cont),\\n\\n _ => wrong(\\\"wrong number of arguments\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 8,\n \"score\": 231611.68536269834\n },\n {\n \"content\": \"pub fn twoarg(f: F, values: &[Value], cont: ExprCont) -> CommCont\\n\\nwhere\\n\\n F: Fn(&Value, &Value, ExprCont) -> CommCont,\\n\\n{\\n\\n match values {\\n\\n [arg1, arg2] => f(arg1, arg2, cont),\\n\\n _ => wrong(\\\"wrong number of arguments\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 9,\n \"score\": 231611.68536269834\n },\n {\n \"content\": \"pub fn applicate(f: &Value, args: &[Value], cont: ExprCont) -> CommCont {\\n\\n match f {\\n\\n Procedure(proc) => (proc.inner)(args, cont),\\n\\n _ => wrong(\\\"bad procedure\\\"),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 10,\n \"score\": 229000.6432012883\n },\n {\n \"content\": \"pub fn extends(root: &Env, args: &[String], locations: &[Location]) -> Env {\\n\\n let mut env = Environment::make_scope(Rc::clone(root));\\n\\n let itr = args.iter().zip(locations.iter().cloned());\\n\\n for (ident, location) in itr {\\n\\n env.insert(ident, location);\\n\\n }\\n\\n Rc::new(RefCell::new(env))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 12,\n \"score\": 214943.18103095662\n },\n {\n \"content\": \"pub fn values(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n cont(values.to_vec())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 13,\n \"score\": 212329.58123037138\n },\n {\n \"content\": \"pub fn hold(location: Location, cont: ExprCont) -> CommCont {\\n\\n Rc::new(move |store: &mut Store| {\\n\\n let cont = send(store.get(&location), &cont);\\n\\n cont(store)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 15,\n \"score\": 208868.34517005362\n },\n {\n \"content\": \"pub fn send(value: Value, cont: &ExprCont) -> CommCont {\\n\\n cont(vec![value])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 16,\n \"score\": 207967.08881278677\n },\n {\n \"content\": \"pub fn cwv(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n twoarg(\\n\\n |lhs, rhs, cont| {\\n\\n let rhs = rhs.clone();\\n\\n let cont = Rc::clone(&cont);\\n\\n applicate(\\n\\n &lhs,\\n\\n &[],\\n\\n Rc::new(move |values| applicate(&rhs, &values, Rc::clone(&cont))),\\n\\n )\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 17,\n \"score\": 207894.10277114413\n },\n {\n \"content\": \"pub fn setcar(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n twoarg(\\n\\n |pair, value, cont| match pair.pair() {\\n\\n Some((car, _, mutable)) => {\\n\\n if mutable {\\n\\n assign(car, value.clone(), send(Unspecified, &cont))\\n\\n } else {\\n\\n wrong(\\\"immutable argument\\\")\\n\\n }\\n\\n }\\n\\n None => wrong(\\\"non-pair argument\\\"),\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 18,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"pub fn list(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n match values.split_first() {\\n\\n Some((head, tail)) => {\\n\\n let head = head.clone();\\n\\n list(\\n\\n tail,\\n\\n single(move |value| cons(&[head.clone(), value], Rc::clone(&cont))),\\n\\n )\\n\\n }\\n\\n None => send(Null, &cont),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 19,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"// support function\\n\\npub fn valueslist(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n onearg(\\n\\n |arg, cont| match arg {\\n\\n Pair(_, _, _) => {\\n\\n let arg = arg.clone();\\n\\n let cont = cont.clone();\\n\\n cdr(\\n\\n &[arg.clone()],\\n\\n Rc::new(move |values| {\\n\\n let arg = arg.clone();\\n\\n let cont = cont.clone();\\n\\n valueslist(\\n\\n &values,\\n\\n Rc::new(move |values| {\\n\\n let cont = cont.clone();\\n\\n car(\\n\\n &[arg.clone()],\\n\\n single(move |value| {\\n\\n let mut values = values.clone();\\n\\n values.insert(0, value);\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 20,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"pub fn eqv(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n twoarg(|lhs, rhs, cont| send(Bool(lhs == rhs), &cont), values, cont)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 21,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"pub fn add(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n let mut args = Vec::with_capacity(values.len());\\n\\n for v in values {\\n\\n match v.number() {\\n\\n Some(num) => args.push(num),\\n\\n None => return wrong(\\\"non-numeric argument\\\"),\\n\\n }\\n\\n }\\n\\n send(Number(args.into_iter().sum()), &cont)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 22,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"pub fn cwcc(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n onearg(\\n\\n |arg, cont| match arg {\\n\\n Procedure(proc) => {\\n\\n let proc = Rc::clone(&proc.inner);\\n\\n let cont = Rc::clone(&cont);\\n\\n Rc::new(move |store| {\\n\\n let new_cont = Rc::clone(&cont);\\n\\n let new_proc = Procedure(Proc::new(Rc::new(move |values, _cont| {\\n\\n new_cont(values.to_vec())\\n\\n })));\\n\\n proc(&[new_proc], Rc::clone(&cont))(store)\\n\\n })\\n\\n }\\n\\n _ => wrong(\\\"bad procedure argument\\\"),\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 23,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"pub fn apply(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n twoarg(\\n\\n |operator, operand, cont| match operator {\\n\\n Procedure(proc) => {\\n\\n let proc = Rc::clone(&proc.inner);\\n\\n valueslist(\\n\\n &[operand.clone()],\\n\\n Rc::new(move |values| proc(&values, Rc::clone(&cont))),\\n\\n )\\n\\n }\\n\\n _ => wrong(\\\"bad procedure argument\\\"),\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 24,\n \"score\": 207894.10277114413\n },\n {\n \"content\": \"pub fn cons(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n twoarg(\\n\\n |head, tail, cont| {\\n\\n let head = head.clone();\\n\\n let tail = tail.clone();\\n\\n Rc::new(move |store: &mut Store| {\\n\\n let loc1 = store.reserve();\\n\\n store.update(&loc1, head.clone());\\n\\n let loc2 = store.reserve();\\n\\n store.update(&loc2, tail.clone());\\n\\n send(Pair(loc1, loc2, true), &cont)(store)\\n\\n })\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 25,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"pub fn less(values: &[Value], cont: ExprCont) -> CommCont {\\n\\n twoarg(\\n\\n |lhs, rhs, cont| {\\n\\n let lhs = match lhs.number() {\\n\\n Some(num) => num,\\n\\n None => return wrong(\\\"non-numeric argument\\\"),\\n\\n };\\n\\n let rhs = match rhs.number() {\\n\\n Some(num) => num,\\n\\n None => return wrong(\\\"non-numeric argument\\\"),\\n\\n };\\n\\n send(Bool(lhs < rhs), &cont)\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 26,\n \"score\": 207894.10277114416\n },\n {\n \"content\": \"pub fn single(f: F) -> ExprCont\\n\\nwhere\\n\\n F: Fn(Value) -> CommCont,\\n\\n{\\n\\n Rc::new(move |mut values| {\\n\\n if values.len() == 1 {\\n\\n f(values.pop().unwrap())\\n\\n } else {\\n\\n wrong(\\\"wrong number of return values\\\")\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 27,\n \"score\": 204344.07473813996\n },\n {\n \"content\": \"pub fn assign(location: Location, value: Value, cont: CommCont) -> CommCont {\\n\\n Rc::new(move |store: &mut Store| {\\n\\n store.update(&location, value.clone());\\n\\n cont(store)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 29,\n \"score\": 193715.07080382708\n },\n {\n \"content\": \"pub fn wrong(message: &'static str) -> CommCont {\\n\\n let err = EvalError {\\n\\n message: message.to_string(),\\n\\n };\\n\\n Rc::new(move |_| Err(err.clone()))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 30,\n \"score\": 189881.1018194704\n },\n {\n \"content\": \"pub fn tievals(f: Rc CommCont>, values: &[Value]) -> CommCont {\\n\\n match values.split_first() {\\n\\n Some((head, tail)) => {\\n\\n let head = head.clone();\\n\\n let tail = tail.to_vec();\\n\\n let f = Rc::clone(&f);\\n\\n Rc::new(move |store: &mut Store| {\\n\\n let location = store.reserve();\\n\\n let loc = location.clone();\\n\\n let f = Rc::clone(&f);\\n\\n let new_f = Rc::new(move |locations: &[Location]| {\\n\\n let mut new_locs = Vec::with_capacity(locations.len() + 1);\\n\\n new_locs.push(loc.clone());\\n\\n new_locs.extend_from_slice(locations);\\n\\n f(&new_locs)\\n\\n });\\n\\n\\n\\n store.update(&location, head.clone());\\n\\n tievals(new_f, &tail)(store)\\n\\n })\\n\\n }\\n\\n None => f(&[]),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 31,\n \"score\": 186369.9902899071\n },\n {\n \"content\": \"pub fn tievalsrest(f: Rc CommCont>, values: &[Value], n: usize) -> CommCont {\\n\\n let rest = values[..n].to_vec();\\n\\n list(\\n\\n &values[n..],\\n\\n single(move |value| {\\n\\n let mut rest = rest.clone();\\n\\n rest.push(value);\\n\\n tievals(Rc::clone(&f), &rest)\\n\\n }),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 32,\n \"score\": 178576.65756667516\n },\n {\n \"content\": \"pub fn truish(value: Value) -> bool {\\n\\n value != Bool(false)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 33,\n \"score\": 175793.40151237213\n },\n {\n \"content\": \"pub fn pass(expr: &Expr) -> Option {\\n\\n match expr {\\n\\n Expr::Variable(variable) => Some(AST::Var(variable.clone())),\\n\\n Expr::Literal(literal) => Some(AST::Const(literal.clone())),\\n\\n Expr::ProcCall(operator, operands) => {\\n\\n let operator = Box::new(pass(operator)?);\\n\\n let operands = operands.iter().map(pass).collect::>>()?;\\n\\n Some(AST::Call(operator, operands))\\n\\n }\\n\\n Expr::Lambda(formals, defs, body) => {\\n\\n let inner_formals =\\n\\n Formals::List(defs.iter().map(|d| d.get_var().to_string()).collect());\\n\\n let mut commands = body.iter().map(pass).collect::>>()?;\\n\\n let expr = Box::new(commands.pop()?);\\n\\n let inner = AST::Lambda(inner_formals, commands, expr);\\n\\n\\n\\n let mut args = Vec::with_capacity(defs.len());\\n\\n for d in defs {\\n\\n args.push(pass(d.get_expr())?);\\n\\n }\\n\",\n \"file_path\": \"src/pass.rs\",\n \"rank\": 34,\n \"score\": 158866.65836120793\n },\n {\n \"content\": \"fn is_initial(c: char) -> bool {\\n\\n match c {\\n\\n '!' | '$' | '%' | '&' | '*' | '/' | ':' => true,\\n\\n '<' | '=' | '>' | '?' | '^' | '_' | '~' => true,\\n\\n c if 'a' <= c && c <= 'z' => true,\\n\\n c if 'A' <= c && c <= 'Z' => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 38,\n \"score\": 80855.78523974445\n },\n {\n \"content\": \"fn is_delimiter(c: char) -> bool {\\n\\n match c {\\n\\n '(' | ')' | '\\\"' | ';' => true,\\n\\n c => is_whitespace(c),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 39,\n \"score\": 80855.78523974445\n },\n {\n \"content\": \"fn is_whitespace(c: char) -> bool {\\n\\n match c {\\n\\n ' ' | '\\\\t' | '\\\\n' => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 40,\n \"score\": 80855.78523974445\n },\n {\n \"content\": \"fn is_subsequent(c: char) -> bool {\\n\\n match c {\\n\\n c if is_initial(c) => true,\\n\\n c if c.is_digit(10) => true,\\n\\n '+' | '-' | '.' | '@' => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub struct Token {\\n\\n pub kind: TokenKind,\\n\\n}\\n\\n\\n\\nimpl Token {\\n\\n pub fn new(kind: TokenKind) -> Self {\\n\\n Self { kind }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 41,\n \"score\": 80855.78523974445\n },\n {\n \"content\": \" inner: HashMap::new(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn insert(&mut self, ident: &str, location: Location) {\\n\\n self.inner.insert(ident.to_lowercase(), location);\\n\\n }\\n\\n\\n\\n pub fn lookup(&self, ident: &str) -> Option {\\n\\n match self.inner.get(ident) {\\n\\n Some(location) => Some(location.clone()),\\n\\n None => self.root.as_ref()?.borrow().lookup(ident),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Default)]\\n\\npub struct Store;\\n\\n\\n\\nimpl Store {\\n\",\n \"file_path\": \"src/engine/storage.rs\",\n \"rank\": 42,\n \"score\": 49607.5474468838\n },\n {\n \"content\": \"use super::Value;\\n\\nuse std::cell::RefCell;\\n\\nuse std::collections::HashMap;\\n\\nuse std::rc::Rc;\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub struct Location(Rc>);\\n\\n\\n\\npub type Env = Rc>;\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct Environment {\\n\\n root: Option,\\n\\n inner: HashMap,\\n\\n}\\n\\n\\n\\nimpl Environment {\\n\\n pub fn make_scope(root: Env) -> Self {\\n\\n Self {\\n\\n root: Some(root),\\n\",\n \"file_path\": \"src/engine/storage.rs\",\n \"rank\": 43,\n \"score\": 49602.997268819134\n },\n {\n \"content\": \" pub fn get(&self, location: &Location) -> Value {\\n\\n location.0.borrow().clone()\\n\\n }\\n\\n\\n\\n pub fn reserve(&mut self) -> Location {\\n\\n Location(Rc::new(RefCell::new(Value::Undefined)))\\n\\n }\\n\\n\\n\\n pub fn update(&mut self, location: &Location, value: Value) {\\n\\n *location.0.borrow_mut() = value;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/engine/storage.rs\",\n \"rank\": 44,\n \"score\": 49599.894383046274\n },\n {\n \"content\": \"use super::*;\\n\\nuse std::cell::RefCell;\\n\\nuse std::rc::Rc;\\n\\n\\n\",\n \"file_path\": \"src/engine/auxiliary.rs\",\n \"rank\": 45,\n \"score\": 49068.14870109735\n },\n {\n \"content\": \" cont(values)\\n\\n }),\\n\\n )\\n\\n }),\\n\\n )\\n\\n }),\\n\\n )\\n\\n }\\n\\n Null => cont(vec![]),\\n\\n _ => wrong(\\\"non-list argument\\\"),\\n\\n },\\n\\n values,\\n\\n cont,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 46,\n \"score\": 48967.91228247738\n },\n {\n \"content\": \"use super::*;\\n\\n\\n\",\n \"file_path\": \"src/engine/procedure.rs\",\n \"rank\": 47,\n \"score\": 48958.93186402434\n },\n {\n \"content\": \"fn main() -> io::Result<()> {\\n\\n let mut engine = engine::Engine::new();\\n\\n engine.register(\\\"pi\\\", Number(std::f64::consts::PI));\\n\\n\\n\\n loop {\\n\\n print!(\\\"mictyris> \\\");\\n\\n io::stdout().flush()?;\\n\\n\\n\\n let mut buffer = String::new();\\n\\n if io::stdin().read_line(&mut buffer)? == 0 {\\n\\n // EOF\\n\\n println!();\\n\\n break;\\n\\n }\\n\\n\\n\\n match buffer.trim() {\\n\\n \\\"\\\" => continue,\\n\\n \\\"quit\\\" => break,\\n\\n _ => (),\\n\\n }\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 48,\n \"score\": 37542.10285693365\n },\n {\n \"content\": \" Cons(Vec, Box),\\n\\n Abbrev(Box),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Formals {\\n\\n List(Vec),\\n\\n Dot(Vec, String),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Def {\\n\\n Variable(String, Box),\\n\\n}\\n\\n\\n\\nimpl Def {\\n\\n pub fn get_var(&self) -> &str {\\n\\n match self {\\n\\n Self::Variable(var, _) => var,\\n\\n }\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 61,\n \"score\": 24.4854933544541\n },\n {\n \"content\": \" pub fn new(input: &'a str) -> Self {\\n\\n Self {\\n\\n lexer: Lookahead::new(Lexer::new(input)),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn parse(&mut self) -> Option {\\n\\n let tok = self.lexer.next()?;\\n\\n match tok.kind {\\n\\n TokenKind::Ident(ident) => Some(Variable(ident.var()?)),\\n\\n TokenKind::Bool(b) => Some(Literal(Lit::Bool(b))),\\n\\n TokenKind::Number(num) => Some(Literal(Lit::Number(num))),\\n\\n TokenKind::Character(c) => Some(Literal(Lit::Character(c))),\\n\\n TokenKind::Str(s) => Some(Literal(Lit::Str(s))),\\n\\n TokenKind::OpenParen => match self.lexer.first()?.kind.ident() {\\n\\n Some(ident) => match ident {\\n\\n Identifier::Lambda => self.parse_lambda(),\\n\\n Identifier::If => self.parse_conditional(),\\n\\n Identifier::Set => self.parse_assign(),\\n\\n Identifier::Var(_) => self.parse_call(),\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 62,\n \"score\": 22.6635396667816\n },\n {\n \"content\": \" let mut parser = Parser::new(input);\\n\\n let answer = ProcCall(\\n\\n Box::new(Lambda(\\n\\n Formals::List(vec![\\\"x\\\".to_string()]),\\n\\n vec![],\\n\\n vec![Variable(\\\"x\\\".to_string())],\\n\\n )),\\n\\n vec![Literal(Lit::Bool(true))],\\n\\n );\\n\\n assert_eq!(parser.parse(), Some(answer));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 63,\n \"score\": 21.07826865993251\n },\n {\n \"content\": \"use crate::lexer::*;\\n\\n\\n\\nuse Expr::*;\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Expr {\\n\\n Variable(String), // variable\\n\\n Literal(Lit), // literal\\n\\n ProcCall(Box, Vec), // procedure call\\n\\n Lambda(Formals, Vec, Vec), // lambda expression\\n\\n Cond(Box, Box, Option>), // conditional\\n\\n Assignment(String, Box), // assignment\\n\\n Derived, // derived expression\\n\\n MacroUse, // macro use\\n\\n MacroBlock, // macro block\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Lit {\\n\\n Bool(bool),\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 64,\n \"score\": 20.50721708253855\n },\n {\n \"content\": \" And,\\n\\n Or,\\n\\n Case,\\n\\n Let,\\n\\n LetStar,\\n\\n Letrec,\\n\\n Do,\\n\\n Delay,\\n\\n Quasiquote,\\n\\n}\\n\\n\\n\\nimpl Identifier {\\n\\n pub fn var(&self) -> Option {\\n\\n match self {\\n\\n Self::Var(var) => Some(var.to_string()),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 65,\n \"score\": 19.588998368345344\n },\n {\n \"content\": \" let mut exprs = Vec::new();\\n\\n loop {\\n\\n if self.eat_close_paren() {\\n\\n break;\\n\\n }\\n\\n exprs.push(self.parse()?);\\n\\n }\\n\\n Some(exprs)\\n\\n }\\n\\n\\n\\n fn parse_datum(&mut self) -> Option {\\n\\n let tok = self.lexer.next()?;\\n\\n match tok.kind {\\n\\n TokenKind::Ident(ident) => Some(Datum::Symbol(ident)),\\n\\n TokenKind::Bool(b) => Some(Datum::Bool(b)),\\n\\n TokenKind::Number(num) => Some(Datum::Number(num)),\\n\\n TokenKind::Character(c) => Some(Datum::Character(c)),\\n\\n TokenKind::Str(s) => Some(Datum::Str(s)),\\n\\n TokenKind::OpenParen => self.parse_list(),\\n\\n TokenKind::SharpParen => self.parse_vector(),\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 66,\n \"score\": 17.77319737237873\n },\n {\n \"content\": \"#[derive(Clone, Debug, PartialEq)]\\n\\npub enum TokenKind {\\n\\n Ident(Identifier),\\n\\n Bool(bool),\\n\\n Number(f64),\\n\\n Character(char),\\n\\n Str(String),\\n\\n OpenParen,\\n\\n CloseParen,\\n\\n SharpParen,\\n\\n Quote,\\n\\n Backquote,\\n\\n Comma,\\n\\n CommaAt,\\n\\n Dot,\\n\\n}\\n\\n\\n\\nimpl TokenKind {\\n\\n pub fn ident(&self) -> Option<&Identifier> {\\n\\n match self {\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 67,\n \"score\": 17.3725697570015\n },\n {\n \"content\": \" Number(f64),\\n\\n Character(char),\\n\\n Str(String),\\n\\n Quote(Datum),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Datum {\\n\\n Bool(bool),\\n\\n Number(f64),\\n\\n Character(char),\\n\\n Str(String),\\n\\n Symbol(Identifier),\\n\\n List(ListDatum),\\n\\n Vector(Vec),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum ListDatum {\\n\\n List(Vec),\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 68,\n \"score\": 17.207950434450176\n },\n {\n \"content\": \"\\n\\n let mut parser = parser::Parser::new(&buffer);\\n\\n let expr = match parser.parse() {\\n\\n Some(expr) => expr,\\n\\n None => continue,\\n\\n };\\n\\n let ast = match pass::pass(&expr) {\\n\\n Some(ast) => ast,\\n\\n None => continue,\\n\\n };\\n\\n engine.eval_and_print(&ast);\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 69,\n \"score\": 17.131773365201873\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn get_expr(&self) -> &Expr {\\n\\n match self {\\n\\n Self::Variable(_, expr) => expr,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct Lookahead\\n\\nwhere\\n\\n I: Iterator,\\n\\n{\\n\\n inner: I,\\n\\n first: Option,\\n\\n second: Option,\\n\\n}\\n\\n\\n\\nimpl Lookahead\\n\\nwhere\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 70,\n \"score\": 16.88801641426189\n },\n {\n \"content\": \"use crate::parser::*;\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum AST {\\n\\n Const(Lit),\\n\\n Var(String),\\n\\n Call(Box, Vec),\\n\\n Lambda(Formals, Vec, Box),\\n\\n Cond(Box, Box, Option>),\\n\\n Assign(String, Box),\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/pass.rs\",\n \"rank\": 71,\n \"score\": 16.593497363173665\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_parse_ident() {\\n\\n let mut lexer = Lexer::new(\\\"lambda ...\\\");\\n\\n assert_eq!(lexer.parse(), Some(Token::new(Ident(Identifier::Lambda))));\\n\\n assert_eq!(\\n\\n lexer.parse(),\\n\\n Some(Token::new(Ident(Identifier::Var(\\\"...\\\".to_string()))))\\n\\n );\\n\\n assert_eq!(lexer.parse(), None);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_parse_bool() {\\n\\n let mut lexer = Lexer::new(\\\"#t #f\\\");\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 72,\n \"score\": 16.315781109755637\n },\n {\n \"content\": \" let expr = AST::Call(Box::new(inner), args);\\n\\n Some(AST::Lambda(formals.clone(), vec![], Box::new(expr)))\\n\\n }\\n\\n Expr::Cond(test, consequent, alternate) => {\\n\\n let test = Box::new(pass(test)?);\\n\\n let consequent = Box::new(pass(consequent)?);\\n\\n let alternate = match alternate {\\n\\n Some(alt) => Some(Box::new(pass(alt)?)),\\n\\n None => None,\\n\\n };\\n\\n Some(AST::Cond(test, consequent, alternate))\\n\\n }\\n\\n Expr::Assignment(var, expr) => {\\n\\n let expr = Box::new(pass(expr)?);\\n\\n Some(AST::Assign(var.clone(), expr))\\n\\n }\\n\\n _ => None,\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/pass.rs\",\n \"rank\": 73,\n \"score\": 15.42729449055194\n },\n {\n \"content\": \" Self::Ident(ident) => Some(ident),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Identifier {\\n\\n Var(String),\\n\\n Else,\\n\\n Arrow,\\n\\n Define,\\n\\n Unquote,\\n\\n UnquoteSplicing,\\n\\n Quote,\\n\\n Lambda,\\n\\n If,\\n\\n Set,\\n\\n Begin,\\n\\n Cond,\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 74,\n \"score\": 15.034214066039233\n },\n {\n \"content\": \"pub mod engine;\\n\\npub mod lexer;\\n\\npub mod parser;\\n\\npub mod pass;\\n\\n\\n\\nuse engine::Value::*;\\n\\nuse std::io::{self, Write};\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 75,\n \"score\": 15.001000075859121\n },\n {\n \"content\": \" return Some(Datum::List(ListDatum::List(data)));\\n\\n }\\n\\n TokenKind::Dot => {\\n\\n if data.is_empty() {\\n\\n return None;\\n\\n }\\n\\n self.lexer.next();\\n\\n let last = Box::new(self.parse_datum()?);\\n\\n if self.eat_close_paren() {\\n\\n return Some(Datum::List(ListDatum::Cons(data, last)));\\n\\n }\\n\\n return None;\\n\\n }\\n\\n _ => data.push(self.parse_datum()?),\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n fn parse_vector(&mut self) -> Option {\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 76,\n \"score\": 14.65211858262899\n },\n {\n \"content\": \"\\n\\npub struct Cursor<'a> {\\n\\n chars: Chars<'a>,\\n\\n last_len: usize,\\n\\n}\\n\\n\\n\\nimpl<'a> Cursor<'a> {\\n\\n pub fn new(input: &'a str) -> Self {\\n\\n Self {\\n\\n last_len: input.len(),\\n\\n chars: input.chars(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn peek(&self) -> Option {\\n\\n self.chars.clone().next()\\n\\n }\\n\\n\\n\\n pub fn eat(&mut self) -> Option {\\n\\n self.chars.next()\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 77,\n \"score\": 14.500248862746709\n },\n {\n \"content\": \"use super::{is_delimiter, is_initial, is_subsequent, is_whitespace};\\n\\nuse std::str::Chars;\\n\\n\\n\\nuse TokenKind::*;\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct Token {\\n\\n pub kind: TokenKind,\\n\\n pub len: usize,\\n\\n}\\n\\n\\n\\nimpl Token {\\n\\n pub fn new(kind: TokenKind, len: usize) -> Self {\\n\\n Self { kind, len }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Copy, Debug, PartialEq)]\\n\\npub enum TokenKind {\\n\\n // Atomosphere\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 78,\n \"score\": 14.329282333463517\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn terminated bool>(&self, pred: P) -> bool {\\n\\n if let Some(c) = self.peek() {\\n\\n pred(c)\\n\\n } else {\\n\\n true\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn len_eaten(&mut self) -> usize {\\n\\n let current = self.chars.as_str().len();\\n\\n let len = self.last_len - current;\\n\\n self.last_len = current;\\n\\n len\\n\\n }\\n\\n\\n\\n pub fn get_token(&mut self) -> Option {\\n\\n let kind = self.get_token_kind()?;\\n\\n let len = self.len_eaten();\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 79,\n \"score\": 14.296316565248834\n },\n {\n \"content\": \" };\\n\\n Some(Ident(ident))\\n\\n }\\n\\n\\n\\n fn parse_bool(&mut self, start: usize) -> Option {\\n\\n match self.substr(start) {\\n\\n \\\"#t\\\" => Some(Bool(true)),\\n\\n \\\"#f\\\" => Some(Bool(false)),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn parse_number(&mut self, start: usize) -> Option {\\n\\n let num: f64 = self.substr(start).parse().ok()?;\\n\\n Some(Number(num))\\n\\n }\\n\\n\\n\\n fn parse_character(&mut self, start: usize) -> Option {\\n\\n let s = self.substr(start + 2);\\n\\n\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 80,\n \"score\": 14.216213078510679\n },\n {\n \"content\": \" let mut data = Vec::new();\\n\\n loop {\\n\\n if self.eat_close_paren() {\\n\\n break;\\n\\n }\\n\\n data.push(self.parse_datum()?);\\n\\n }\\n\\n Some(Datum::Vector(data))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn test_lookahead() {\\n\\n let xs = [1, 2, 3];\\n\\n let mut iter = Lookahead::new(xs.iter());\\n\\n\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 81,\n \"score\": 13.906723756431488\n },\n {\n \"content\": \" _ => None,\\n\\n },\\n\\n None => self.parse_call(),\\n\\n },\\n\\n TokenKind::Quote => Some(Literal(Lit::Quote(self.parse_datum()?))),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn eat_close_paren(&mut self) -> bool {\\n\\n if let Some(tok) = self.lexer.first() {\\n\\n if tok.kind == TokenKind::CloseParen {\\n\\n self.lexer.next();\\n\\n return true;\\n\\n }\\n\\n }\\n\\n false\\n\\n }\\n\\n\\n\\n fn parse_lambda(&mut self) -> Option {\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 82,\n \"score\": 13.640086142842843\n },\n {\n \"content\": \" Some(Token::new(kind, len))\\n\\n }\\n\\n\\n\\n pub fn get_token_kind(&mut self) -> Option {\\n\\n match self.eat()? {\\n\\n '(' => Some(OpenParen),\\n\\n ')' => Some(CloseParen),\\n\\n '#' => match self.eat()? {\\n\\n '(' => Some(SharpParen),\\n\\n '\\\\\\\\' => {\\n\\n self.eat()?;\\n\\n self.eat_until(is_delimiter);\\n\\n Some(Character)\\n\\n }\\n\\n 't' | 'f' => Some(Bool),\\n\\n 'i' | 'e' | 'b' | 'o' | 'd' | 'x' => {\\n\\n self.eat_until(is_delimiter);\\n\\n Some(Number)\\n\\n }\\n\\n _ => None,\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 83,\n \"score\": 13.024286486650428\n },\n {\n \"content\": \"\\n\\n fn string(&mut self) -> Option<()> {\\n\\n while let Some(c) = self.eat() {\\n\\n match c {\\n\\n '\\\"' => return Some(()),\\n\\n '\\\\\\\\' => match self.eat()? {\\n\\n '\\\"' | '\\\\\\\\' => (),\\n\\n _ => return None,\\n\\n },\\n\\n _ => (),\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n fn triple_dot(&mut self) -> bool {\\n\\n if self.eat() != Some('.') {\\n\\n return false;\\n\\n }\\n\\n if self.eat() != Some('.') {\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 84,\n \"score\": 12.992025358805742\n },\n {\n \"content\": \" self.lexer.next();\\n\\n let formals = self.parse_formals()?;\\n\\n let (defs, body) = self.parse_body()?;\\n\\n if self.eat_close_paren() {\\n\\n Some(Lambda(formals, defs, body))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n fn parse_formals(&mut self) -> Option {\\n\\n match self.lexer.next()?.kind {\\n\\n TokenKind::Ident(ident) => Some(Formals::Dot(vec![], ident.var()?)),\\n\\n TokenKind::OpenParen => {\\n\\n let mut idents = Vec::new();\\n\\n while let Some(tok) = self.lexer.next() {\\n\\n match tok.kind {\\n\\n TokenKind::CloseParen => {\\n\\n return Some(Formals::List(idents));\\n\\n }\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 85,\n \"score\": 12.654757851697395\n },\n {\n \"content\": \" let c = if s.len() == 1 {\\n\\n s.chars().next()?\\n\\n } else {\\n\\n match s.to_lowercase().as_str() {\\n\\n \\\"space\\\" => ' ',\\n\\n \\\"newline\\\" => '\\\\n',\\n\\n _ => return None,\\n\\n }\\n\\n };\\n\\n\\n\\n Some(Character(c))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Iterator for Lexer<'_> {\\n\\n type Item = Token;\\n\\n\\n\\n fn next(&mut self) -> Option {\\n\\n self.parse()\\n\\n }\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 86,\n \"score\": 12.45740195043116\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn parse_assign(&mut self) -> Option {\\n\\n self.lexer.next();\\n\\n let var = self.lexer.next()?.kind.ident()?.var()?;\\n\\n let expr = Box::new(self.parse()?);\\n\\n if self.eat_close_paren() {\\n\\n Some(Assignment(var, expr))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n }\\n\\n\\n\\n fn parse_call(&mut self) -> Option {\\n\\n let operator = Box::new(self.parse()?);\\n\\n let operands = self.parse_to_close()?;\\n\\n Some(ProcCall(operator, operands))\\n\\n }\\n\\n\\n\\n fn parse_to_close(&mut self) -> Option> {\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 87,\n \"score\": 12.291696221908134\n },\n {\n \"content\": \" I: Iterator,\\n\\n{\\n\\n pub fn new(mut inner: I) -> Self {\\n\\n let first = inner.next();\\n\\n let second = inner.next();\\n\\n Self {\\n\\n inner,\\n\\n first,\\n\\n second,\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn first(&self) -> Option<&I::Item> {\\n\\n self.first.as_ref()\\n\\n }\\n\\n\\n\\n pub fn second(&self) -> Option<&I::Item> {\\n\\n self.second.as_ref()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 88,\n \"score\": 12.27172796416627\n },\n {\n \"content\": \"impl fmt::Display for Identifier {\\n\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n\\n match self {\\n\\n Self::Var(ident) => write!(f, \\\"{}\\\", ident),\\n\\n Self::Else => write!(f, \\\"else\\\"),\\n\\n Self::Arrow => write!(f, \\\"=>\\\"),\\n\\n Self::Define => write!(f, \\\"define\\\"),\\n\\n Self::Unquote => write!(f, \\\"unquote\\\"),\\n\\n Self::UnquoteSplicing => write!(f, \\\"unquote-splicing\\\"),\\n\\n Self::Quote => write!(f, \\\"quote\\\"),\\n\\n Self::Lambda => write!(f, \\\"lambda\\\"),\\n\\n Self::If => write!(f, \\\"if\\\"),\\n\\n Self::Set => write!(f, \\\"set!\\\"),\\n\\n Self::Begin => write!(f, \\\"begin\\\"),\\n\\n Self::Cond => write!(f, \\\"cond\\\"),\\n\\n Self::And => write!(f, \\\"and\\\"),\\n\\n Self::Or => write!(f, \\\"or\\\"),\\n\\n Self::Case => write!(f, \\\"case\\\"),\\n\\n Self::Let => write!(f, \\\"let\\\"),\\n\\n Self::LetStar => write!(f, \\\"let*\\\"),\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 89,\n \"score\": 11.964074420599323\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn parse(&mut self) -> Option {\\n\\n let tok = self.cursor.get_token()?;\\n\\n\\n\\n let start = self.pos;\\n\\n self.pos += tok.len;\\n\\n\\n\\n let kind = match tok.kind {\\n\\n cursor::TokenKind::Whitespace => return self.parse(),\\n\\n cursor::TokenKind::Comment => return self.parse(),\\n\\n\\n\\n cursor::TokenKind::Ident => self.parse_ident(start)?,\\n\\n cursor::TokenKind::Bool => self.parse_bool(start)?,\\n\\n cursor::TokenKind::Number => self.parse_number(start)?,\\n\\n cursor::TokenKind::Character => self.parse_character(start)?,\\n\\n cursor::TokenKind::Str => Str(self.substr(start).to_string()),\\n\\n\\n\\n cursor::TokenKind::OpenParen => OpenParen,\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 90,\n \"score\": 11.958200348107608\n },\n {\n \"content\": \" Self::Letrec => write!(f, \\\"letrec\\\"),\\n\\n Self::Do => write!(f, \\\"do\\\"),\\n\\n Self::Delay => write!(f, \\\"delay\\\"),\\n\\n Self::Quasiquote => write!(f, \\\"quasiquote\\\"),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\npub struct Lexer<'a> {\\n\\n cursor: cursor::Cursor<'a>,\\n\\n input: &'a str,\\n\\n pos: usize,\\n\\n}\\n\\n\\n\\nimpl<'a> Lexer<'a> {\\n\\n pub fn new(input: &'a str) -> Self {\\n\\n Self {\\n\\n cursor: cursor::Cursor::new(input),\\n\\n input,\\n\\n pos: 0,\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 91,\n \"score\": 11.926171834487917\n },\n {\n \"content\": \" assert_eq!(lexer.parse(), Some(Token::new(Bool(true))));\\n\\n assert_eq!(lexer.parse(), Some(Token::new(Bool(false))));\\n\\n assert_eq!(lexer.parse(), None);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_parse_number() {\\n\\n let mut lexer = Lexer::new(\\\"0.1 100\\\");\\n\\n assert_eq!(lexer.parse(), Some(Token::new(Number(0.1))));\\n\\n assert_eq!(lexer.parse(), Some(Token::new(Number(100.0))));\\n\\n assert_eq!(lexer.parse(), None);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_parse_character() {\\n\\n let mut lexer = Lexer::new(\\\"#\\\\\\\\a #\\\\\\\\space\\\");\\n\\n assert_eq!(lexer.parse(), Some(Token::new(Character('a'))));\\n\\n assert_eq!(lexer.parse(), Some(Token::new(Character(' '))));\\n\\n assert_eq!(lexer.parse(), None);\\n\\n }\\n\",\n \"file_path\": \"src/lexer.rs\",\n \"rank\": 92,\n \"score\": 11.711581534529138\n },\n {\n \"content\": \" self.eat_until(is_delimiter);\\n\\n Some(Number)\\n\\n }\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn eat_while bool>(&mut self, pred: P) {\\n\\n while let Some(c) = self.peek() {\\n\\n if pred(c) {\\n\\n self.eat();\\n\\n } else {\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n fn eat_until bool>(&mut self, pred: P) {\\n\\n self.eat_while(|c| !pred(c));\\n\\n }\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 93,\n \"score\": 11.694829489046045\n },\n {\n \"content\": \" if tok.kind == TokenKind::CloseParen {\\n\\n if exprs.is_empty() {\\n\\n return None;\\n\\n } else {\\n\\n return Some((defs, exprs));\\n\\n }\\n\\n } else {\\n\\n exprs.push(self.parse()?);\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n fn parse_define(&mut self) -> Option {\\n\\n self.lexer.next(); // eat '('\\n\\n self.lexer.next(); // eat \\\"define\\\"\\n\\n let var = self.lexer.next()?.kind.ident()?.var()?;\\n\\n let expr = Box::new(self.parse()?);\\n\\n if self.eat_close_paren() {\\n\\n Some(Def::Variable(var, expr))\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 94,\n \"score\": 11.68169352249493\n },\n {\n \"content\": \" #[test]\\n\\n fn test_parse_string() {\\n\\n let mut lexer = Cursor::new(\\\"\\\\\\\"string\\\\\\\"\\\\\\\"\\\\\\\\\\\\\\\"\\\\\\\"\\\");\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Str, 8)));\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Str, 4)));\\n\\n assert_eq!(lexer.get_token(), None);\\n\\n\\n\\n let mut lexer = Cursor::new(\\\"\\\\\\\"string\\\");\\n\\n assert_eq!(lexer.get_token(), None);\\n\\n\\n\\n let mut lexer = Cursor::new(\\\"\\\\\\\\a\\\");\\n\\n assert_eq!(lexer.get_token(), None);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_parse_character() {\\n\\n let mut lexer = Cursor::new(\\\"#\\\\\\\\a\\\");\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Character, 3)));\\n\\n\\n\\n let mut lexer = Cursor::new(\\\"#\\\\\\\\\\\");\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 95,\n \"score\": 11.54597331615398\n },\n {\n \"content\": \" TokenKind::Dot => {\\n\\n if idents.is_empty() {\\n\\n return None;\\n\\n }\\n\\n let last = self.lexer.next()?.kind.ident()?.var()?;\\n\\n if self.eat_close_paren() {\\n\\n return Some(Formals::Dot(idents, last));\\n\\n }\\n\\n return None;\\n\\n }\\n\\n TokenKind::Ident(ident) => {\\n\\n idents.push(ident.var()?);\\n\\n }\\n\\n _ => return None,\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n _ => None,\\n\\n }\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 96,\n \"score\": 11.382446248909996\n },\n {\n \"content\": \" TokenKind::Quote => self.parse_abbrev_list(),\\n\\n TokenKind::Backquote => self.parse_abbrev_list(),\\n\\n TokenKind::Comma => self.parse_abbrev_list(),\\n\\n TokenKind::CommaAt => self.parse_abbrev_list(),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n\\n\\n fn parse_abbrev_list(&mut self) -> Option {\\n\\n Some(Datum::List(ListDatum::Abbrev(Box::new(\\n\\n self.parse_datum()?,\\n\\n ))))\\n\\n }\\n\\n\\n\\n fn parse_list(&mut self) -> Option {\\n\\n let mut data = Vec::new();\\n\\n while let Some(tok) = self.lexer.first() {\\n\\n match tok.kind {\\n\\n TokenKind::CloseParen => {\\n\\n self.lexer.next();\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 97,\n \"score\": 10.805422604058768\n },\n {\n \"content\": \"\\n\\nimpl Iterator for Lookahead\\n\\nwhere\\n\\n I: Iterator,\\n\\n{\\n\\n type Item = I::Item;\\n\\n\\n\\n fn next(&mut self) -> Option {\\n\\n let mut retval = self.inner.next();\\n\\n std::mem::swap(&mut retval, &mut self.first);\\n\\n std::mem::swap(&mut self.first, &mut self.second);\\n\\n retval\\n\\n }\\n\\n}\\n\\n\\n\\npub struct Parser<'a> {\\n\\n lexer: Lookahead>,\\n\\n}\\n\\n\\n\\nimpl<'a> Parser<'a> {\\n\",\n \"file_path\": \"src/parser.rs\",\n \"rank\": 98,\n \"score\": 10.486747256872901\n },\n {\n \"content\": \" assert_eq!(lexer.get_token(), None);\\n\\n\\n\\n let mut lexer = Cursor::new(\\\"#\\\\\\\\newline\\\");\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Character, 9)));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_parse_boolean() {\\n\\n let mut lexer = Cursor::new(\\\"#t #f\\\");\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Bool, 2)));\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Whitespace, 1)));\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Bool, 2)));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_parse_peculiar_identifier() {\\n\\n let mut lexer = Cursor::new(\\\"+ - ... \\\");\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Ident, 1)));\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Whitespace, 1)));\\n\\n assert_eq!(lexer.get_token(), Some(Token::new(Ident, 1)));\\n\",\n \"file_path\": \"src/lexer/cursor.rs\",\n \"rank\": 99,\n \"score\": 9.175788956599776\n }\n]"}}},{"rowIdx":981,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/network.rs"},"repo_name":{"kind":"string","value":"Aloxaf/mcfly"},"commit":{"kind":"string","value":"0f50f2deeed7c8ec75d41711369c2fc927006a4e"},"file_code":{"kind":"string","value":"#![allow(clippy::unreadable_literal)]\nuse crate::node::Node;\nuse crate::training_sample_generator::TrainingSampleGenerator;\nuse crate::history::Features;\nuse rand::Rng;\n\n#[derive(Debug, Copy, Clone)]\npub struct Network {\n pub final_bias: f64,\n pub final_weights: [f64; 3],\n pub final_sum: f64,\n pub final_output: f64,\n pub hidden_nodes: [Node; 3],\n pub hidden_node_sums: [f64; 3],\n pub hidden_node_outputs: [f64; 3],\n}\n\nimpl Default for Network {\n fn default() -> Network {\n Network {\n final_bias: -0.3829333755179377,\n final_weights: [\n 0.44656858145177714,\n -1.9550439349609872,\n -2.963322601316632\n ],\n final_sum: 0.0,\n final_output: 0.0,\n hidden_nodes: [\n Node {\n offset: -0.878184962836099,\n age: -0.9045522440219468,\n length: 0.5406937685800283,\n exit: -0.3472765681766297,\n recent_failure: -0.05291342121445077,\n selected_dir: -0.35027519196134,\n dir: -0.2466069217936986,\n overlap: 0.4791784213482642,\n immediate_overlap: 0.5565797758340211,\n selected_occurrences: -0.3600203296209723,\n occurrences: 0.15694312742881805\n },\n Node {\n offset: -0.04362945902379799,\n age: -0.25381913331319716,\n length: 0.4238780143901607,\n exit: 0.21906785628210726,\n recent_failure: -0.9510136025685453,\n selected_dir: -0.04654084670567356,\n dir: -2.2858050301068693,\n overlap: -0.562274365705918,\n immediate_overlap: -0.47252489212451904,\n selected_occurrences: 0.2446391951417497,\n occurrences: -1.4846489581676605\n },\n Node {\n offset: -0.11992725490486622,\n age: 0.3759013420273308,\n length: 1.674601413922965,\n exit: -0.15529596916772864,\n recent_failure: -0.7819181782432957,\n selected_dir: -1.1890532332896768,\n dir: 0.34723729558743677,\n overlap: 0.09372412920642742,\n immediate_overlap: 0.393989158881144,\n selected_occurrences: -0.2383372126951215,\n occurrences: -2.196219880265691\n }\n ],\n hidden_node_sums: [\n 0.0,\n 0.0,\n 0.0\n ],\n hidden_node_outputs: [\n 0.0,\n 0.0,\n 0.0\n ]\n }\n }\n}\n\nimpl Network {\n pub fn random() -> Network {\n let mut rng = rand::thread_rng();\n\n Network {\n final_bias: rng.gen_range(-1.0, 1.0),\n final_weights: [rng.gen_range(-1.0, 1.0), rng.gen_range(-1.0, 1.0), rng.gen_range(-1.0, 1.0)],\n hidden_nodes: [Node::random(), Node::random(), Node::random()],\n hidden_node_sums: [0.0, 0.0, 0.0],\n hidden_node_outputs: [0.0, 0.0, 0.0],\n final_sum: 0.0,\n final_output: 0.0,\n }\n }\n\n pub fn compute(&mut self, features: &Features) {\n self.final_sum = self.final_bias;\n for i in 0..self.hidden_nodes.len() {\n self.hidden_node_sums[i] = self.hidden_nodes[i].dot(features);\n self.hidden_node_outputs[i] = self.hidden_node_sums[i].tanh();\n self.final_sum += self.hidden_node_outputs[i] * self.final_weights[i];\n }\n self.final_output = self.final_sum.tanh();\n }\n\n pub fn dot(&self, features: &Features) -> f64 {\n let mut network_output = self.final_bias;\n for (node, output_weight) in self.hidden_nodes.iter().zip(self.final_weights.iter()) {\n let node_output = node.output(features);\n network_output += node_output * output_weight;\n }\n network_output\n }\n\n pub fn output(&self, features: &Features) -> f64 {\n self.dot(features).tanh()\n }\n\n pub fn average_error(&self, generator: &TrainingSampleGenerator, records: usize) -> f64 {\n let mut error = 0.0;\n let mut samples = 0.0;\n generator.generate(Some(records), |features: &Features, correct: bool| {\n let target = if correct { 1.0 } else { -1.0 };\n let output = self.output(features);\n error += 0.5 * (target - output).powi(2);\n samples += 1.0;\n });\n\n error / samples\n }\n}\n"},"prefix":{"kind":"string","value":"#![allow(clippy::unreadable_literal)]\nuse crate::node::Node;\nuse crate::training_sample_generator::TrainingSampleGenerator;\nuse crate::history::Features;\nuse rand::Rng;\n\n#[derive(Debug, Copy, Clone)]\npub struct Network {\n pub final_bias: f64,\n pub final_weights: [f64; 3],\n pub final_sum: f64,\n pub final_output: f64,\n pub hidden_nodes: [Node; 3],\n pub hidden_node_sums: [f64; 3],\n pub hidden_node_outputs: [f64; 3],\n}\n\nimpl Default for Network {\n fn default() -> Network {\n Network {\n final_bias: -0.3829333755179377,\n final_weights: [\n 0.44656858145177714,\n -1.9550439349609872,\n -2.963322601316632\n ],\n final_sum: 0.0,\n final_output: 0.0,\n hidden_nodes: [\n Node {\n offset: -0.878184962836099,\n age: -0.9045522440219468,\n length: 0.5406937685800283,\n exit: -0.3472765681766297,\n recent_failure: -0.05291342121445077,\n selected_dir: -0.35027519196134,\n dir: -0.2466069217936986,\n overlap: 0.4791784213482642,\n immediate_overlap: 0.5565797758340211,\n selected_occurrences: -0.3600203296209723,\n occurrences: 0.15694312742881805\n },\n Node {\n offset: -0.04362945902379799,\n age: -0.25381913331319716,\n length: 0.4238780143901607,\n exit: 0.21906785628210726,\n recent_failure: -0.9510136025685453,\n selected_dir: -0.04654084670567356,\n dir: -2.2858050301068693,\n overlap: -0.562274365705918,\n immediate_overlap: -0.47252489212451904,\n selected_occurrences: 0.2446391951417497,\n occurrences: -1.4846489581676605\n },\n Node {\n offset: -0.11992725490486622,\n age: 0.3759013420273308,\n length: 1.674601413922965,\n exit: -0.15529596916772864,\n recent_failure: -0.7819181782432957,\n selected_dir: -1.1890532332896768,\n dir: 0.34723729558743677,\n overlap: 0.09372412920642742,\n immediate_overlap: 0.393989158881144,\n selected_occurrences: -0.2383372126951215,\n occurrences: -2.196219880265691\n }\n ],\n hidden_node_sums: [\n 0.0,\n 0.0,\n 0.0\n ],\n hidden_node_outputs: [\n 0.0,\n 0.0,\n 0.0\n ]\n }\n }\n}\n\nimpl Network {\n pub fn random() -> Network {\n let mut rng = rand::thread_rng();\n\n Network {\n final_bias: rng.gen_range(-1.0, 1.0),\n final_weights: [rng.gen_range(-1.0, 1.0), rng.gen_range(-1.0, 1.0), rng.gen_range(-1.0, 1.0)],\n hidden_nodes: [Node::random(), Node::random(), Node::random()],\n hidden_node_sums: [0.0, 0.0, 0.0],\n hidden_node_outputs: [0.0, 0.0, 0.0],\n final_sum: 0.0,\n final_output: 0.0,\n }\n }\n\n pub fn compute(&mut self, features: &Features) {\n self.final_sum = self.final_bias;\n for i in 0..self.hidden_nodes.len() {\n self.hidden_node_sums[i] = self.hidden_nodes[i].dot(features);\n self.hidden_node_outputs[i] = self.hidden_node_sums[i].tanh();\n sel"},"suffix":{"kind":"string","value":"\n\n pub fn dot(&self, features: &Features) -> f64 {\n let mut network_output = self.final_bias;\n for (node, output_weight) in self.hidden_nodes.iter().zip(self.final_weights.iter()) {\n let node_output = node.output(features);\n network_output += node_output * output_weight;\n }\n network_output\n }\n\n pub fn output(&self, features: &Features) -> f64 {\n self.dot(features).tanh()\n }\n\n pub fn average_error(&self, generator: &TrainingSampleGenerator, records: usize) -> f64 {\n let mut error = 0.0;\n let mut samples = 0.0;\n generator.generate(Some(records), |features: &Features, correct: bool| {\n let target = if correct { 1.0 } else { -1.0 };\n let output = self.output(features);\n error += 0.5 * (target - output).powi(2);\n samples += 1.0;\n });\n\n error / samples\n }\n}\n"},"middle":{"kind":"string","value":"f.final_sum += self.hidden_node_outputs[i] * self.final_weights[i];\n }\n self.final_output = self.final_sum.tanh();\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"pub fn use_tiocsti(string: &str) {\n\n for byte in string.as_bytes() {\n\n let a: *const u8 = byte;\n\n if unsafe { ioctl(0, libc::TIOCSTI as u32, a) } < 0 {\n\n panic!(\"Error encountered when calling ioctl\");\n\n }\n\n }\n\n}\n","file_path":"src/fake_typer.rs","rank":0,"score":89140.51610810748},{"content":"fn output_row(writer: &mut Writer, features: &Features, correct: bool) {\n\n writer\n\n .write_record(&[\n\n format!(\"{}\", features.age_factor),\n\n format!(\"{}\", features.length_factor),\n\n format!(\"{}\", features.exit_factor),\n\n format!(\"{}\", features.recent_failure_factor),\n\n format!(\"{}\", features.selected_dir_factor),\n\n format!(\"{}\", features.dir_factor),\n\n format!(\"{}\", features.overlap_factor),\n\n format!(\"{}\", features.immediate_overlap_factor),\n\n format!(\"{}\", features.selected_occurrences_factor),\n\n format!(\"{}\", features.occurrences_factor),\n\n if correct {\n\n String::from(\"t\")\n\n } else {\n\n String::from(\"f\")\n\n },\n\n ])\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Expected to write to CSV ({})\", err)));\n\n writer.flush().unwrap_or_else(|err| panic!(format!(\"McFly error: Expected to flush CSV ({})\", err)));\n\n}\n","file_path":"src/training_cache.rs","rank":1,"score":77339.90674662417},{"content":"pub fn read(cache_path: &PathBuf) -> Vec<(Features, bool)> {\n\n let mut data_set: Vec<(Features, bool)> = Vec::new();\n\n\n\n let mut reader = Reader::from_path(cache_path).unwrap_or_else(|err| panic!(format!(\"McFly error: Expected to be able to read from CSV ({})\", err)));\n\n\n\n for result in reader.records() {\n\n let record = result.unwrap_or_else(|err| panic!(format!(\"McFly error: Expected to be able to unwrap cached result ({})\", err)));\n\n\n\n let features = Features {\n\n age_factor: record[0].parse().unwrap(),\n\n length_factor: record[1].parse().unwrap(),\n\n exit_factor: record[2].parse().unwrap(),\n\n recent_failure_factor: record[3].parse().unwrap(),\n\n selected_dir_factor: record[4].parse().unwrap(),\n\n dir_factor: record[5].parse().unwrap(),\n\n overlap_factor: record[6].parse().unwrap(),\n\n immediate_overlap_factor: record[7].parse().unwrap(),\n\n selected_occurrences_factor: record[8].parse().unwrap(),\n\n occurrences_factor: record[9].parse().unwrap()\n\n };\n\n\n\n data_set.push((features, record[10].eq(\"t\")));\n\n }\n\n\n\n data_set\n\n}\n\n\n","file_path":"src/training_cache.rs","rank":2,"score":72755.75198182782},{"content":"pub fn write(data_set: &[(Features, bool)], cache_path: &PathBuf) {\n\n let mut writer = Writer::from_path(cache_path).unwrap_or_else(|err| panic!(format!(\"McFly error: Expected to be able to write a CSV ({})\", err)));\n\n output_header(&mut writer);\n\n\n\n for (features, correct) in data_set {\n\n output_row(&mut writer, features, *correct);\n\n }\n\n}\n\n\n","file_path":"src/training_cache.rs","rank":3,"score":70728.34004358845},{"content":"pub fn migrate(connection: &Connection) {\n\n make_schema_versions_table(connection);\n\n\n\n let current_version: u16 = connection\n\n .query_row::, _, _>(\n\n \"select max(version) FROM schema_versions ORDER BY version DESC LIMIT 1\",\n\n NO_PARAMS,\n\n |row| row.get(0),\n\n )\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Query to work ({})\", err)))\n\n .unwrap_or(0);\n\n\n\n if current_version < CURRENT_SCHEMA_VERSION {\n\n print!(\n\n \"McFly: Upgrading McFly DB to version {}, please wait...\",\n\n CURRENT_SCHEMA_VERSION\n\n );\n\n io::stdout().flush().unwrap_or_else(|err| panic!(format!(\"McFly error: STDOUT flush should work ({})\", err)));\n\n }\n\n\n","file_path":"src/history/schema.rs","rank":4,"score":69608.51234032755},{"content":"pub fn bash_history_file_path() -> PathBuf {\n\n let path =\n\n PathBuf::from(env::var(\"HISTFILE\").unwrap_or_else(|err| panic!(format!(\"McFly error: Please ensure HISTFILE is set for your shell ({})\", err))));\n\n fs::canonicalize(&path).unwrap_or_else(|err| panic!(format!(\"McFly error: The contents of $HISTFILE appear invalid ({})\", err)))\n\n}\n\n\n","file_path":"src/bash_history.rs","rank":5,"score":67134.50407950423},{"content":"pub fn first_time_setup(connection: &Connection) {\n\n make_schema_versions_table(connection);\n\n write_current_schema_version(connection);\n\n}\n\n\n","file_path":"src/history/schema.rs","rank":6,"score":65676.29177772088},{"content":"pub fn add_db_functions(db: &Connection) {\n\n let network = Network::default();\n\n db.create_scalar_function(\"nn_rank\", 10, true, move |ctx| {\n\n let age_factor = ctx.get::(0)?;\n\n let length_factor = ctx.get::(1)?;\n\n let exit_factor = ctx.get::(2)?;\n\n let recent_failure_factor = ctx.get::(3)?;\n\n let selected_dir_factor = ctx.get::(4)?;\n\n let dir_factor = ctx.get::(5)?;\n\n let overlap_factor = ctx.get::(6)?;\n\n let immediate_overlap_factor = ctx.get::(7)?;\n\n let selected_occurrences_factor = ctx.get::(8)?;\n\n let occurrences_factor = ctx.get::(9)?;\n\n\n\n let features = Features {\n\n age_factor,\n\n length_factor,\n\n exit_factor,\n\n recent_failure_factor,\n\n selected_dir_factor,\n","file_path":"src/history/db_extensions.rs","rank":7,"score":63960.989204976664},{"content":"fn output_header(writer: &mut Writer) {\n\n writer\n\n .write_record(&[\n\n \"age_factor\",\n\n \"length_factor\",\n\n \"exit_factor\",\n\n \"recent_failure_factor\",\n\n \"selected_dir_factor\",\n\n \"dir_factor\",\n\n \"overlap_factor\",\n\n \"immediate_overlap_factor\",\n\n \"selected_occurrences_factor\",\n\n \"occurrences_factor\",\n\n \"correct\",\n\n ])\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Expected to write to CSV ({})\", err)));\n\n writer.flush().unwrap_or_else(|err| panic!(format!(\"McFly error: Expected to flush CSV ({})\", err)));\n\n}\n\n\n","file_path":"src/training_cache.rs","rank":8,"score":63941.97095862917},{"content":"fn handle_addition(settings: &Settings, history: &mut History) {\n\n if history.should_add(&settings.command) {\n\n history.add(\n\n &settings.command,\n\n &settings.session_id,\n\n &settings.dir,\n\n &settings.when_run,\n\n settings.exit_code,\n\n &settings.old_dir,\n\n );\n\n\n\n if settings.append_to_histfile {\n\n let histfile = PathBuf::from(env::var(\"HISTFILE\")\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Please ensure that HISTFILE is set ({})\", err))));\n\n bash_history::append_history_entry(&settings.command, &histfile)\n\n }\n\n }\n\n}\n\n\n","file_path":"src/main.rs","rank":9,"score":61813.14369458346},{"content":"fn handle_move(settings: &Settings, history: &mut History) {\n\n history.update_paths(&settings.old_dir.clone().unwrap(), &settings.dir, true);\n\n}\n\n\n","file_path":"src/main.rs","rank":10,"score":61813.14369458346},{"content":"fn handle_train(settings: &Settings, history: &mut History) {\n\n Trainer::new(settings, history).train();\n\n}\n\n\n","file_path":"src/main.rs","rank":11,"score":61813.14369458346},{"content":"pub fn delete_last_history_entry_if_search(path: &PathBuf) {\n\n let bash_history_contents = read_ignoring_utf_errors(&path);\n\n\n\n let mut lines = bash_history_contents\n\n .split('\\n')\n\n .map(String::from)\n\n .collect::>();\n\n\n\n if !lines.is_empty() && lines[lines.len() - 1].is_empty() {\n\n lines.pop();\n\n }\n\n\n\n if lines.is_empty() || !lines[lines.len() - 1].starts_with(\"#mcfly:\") {\n\n return; // Abort if empty or the last line isn't a comment.\n\n }\n\n\n\n lines.pop();\n\n\n\n if !lines.is_empty() && has_leading_timestamp(&lines[lines.len() - 1]) {\n\n lines.pop();\n\n }\n\n\n\n lines.push(String::from(\"\")); // New line at end of file expected by bash.\n\n\n\n fs::write(&path, lines.join(\"\\n\")).unwrap_or_else(|_| panic!(\"McFly error: Unable to update {:?}\", &path));\n\n}\n\n\n","file_path":"src/bash_history.rs","rank":12,"score":60933.71035962482},{"content":"pub fn normalize_path(incoming_path: &str) -> String {\n\n let expanded_path = shellexpand::full(incoming_path).unwrap_or_else(|err| panic!(format!(\"McFly error: Unable to expand command path ({})\", err)));\n\n\n\n let current_dir = env::var(\"PWD\").unwrap_or_else(|err| panic!(format!(\"McFly error: Unable to determine current directory ({})\", err)));\n\n let current_dir_path = Path::new(¤t_dir);\n\n\n\n let path_buf = if expanded_path.starts_with('/') {\n\n RelativePath::new(&expanded_path.into_owned()).normalize().to_path(\"/\")\n\n } else {\n\n let to_current_dir = RelativePath::new(&expanded_path).to_path(current_dir_path);\n\n RelativePath::new(to_current_dir.to_str().unwrap()).normalize().to_path(\"/\")\n\n };\n\n\n\n path_buf.to_str().unwrap_or_else(|| panic!(\"McFly error: Path must be a valid UTF8 string\")).to_string()\n\n}\n\n\n","file_path":"src/path_update_helpers.rs","rank":13,"score":59847.82575198195},{"content":"pub fn full_history(path: &PathBuf) -> Vec {\n\n let bash_history_contents = read_ignoring_utf_errors(&path);\n\n\n\n bash_history_contents\n\n .split('\\n')\n\n .filter(|line| !has_leading_timestamp(line) && !line.is_empty())\n\n .map(String::from)\n\n .collect::>()\n\n}\n\n\n","file_path":"src/bash_history.rs","rank":14,"score":57772.13250976625},{"content":"pub fn delete_lines(path: &PathBuf, command: &str) {\n\n let history_contents = read_ignoring_utf_errors(&path);\n\n\n\n let lines = history_contents\n\n .split('\\n')\n\n .map(String::from)\n\n .filter(|cmd| !cmd.eq(command))\n\n .collect::>();\n\n\n\n fs::write(&path, lines.join(\"\\n\")).unwrap_or_else(|_| panic!(\"McFly error: Unable to update {:?}\", &path));\n\n}\n\n\n","file_path":"src/bash_history.rs","rank":15,"score":57772.13250976625},{"content":"pub fn append_history_entry(command: &str, path: &PathBuf) {\n\n let mut file = OpenOptions::new()\n\n .write(true)\n\n .append(true)\n\n .open(path)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: please make sure HISTFILE exists ({})\", err)));\n\n\n\n if let Err(e) = writeln!(file, \"{}\", command) {\n\n eprintln!(\"Couldn't append to file {:?}: {}\", &path, e);\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::has_leading_timestamp;\n\n\n\n #[test]\n\n fn has_leading_timestamp_works() {\n\n assert_eq!(false, has_leading_timestamp(\"abc\"));\n\n assert_eq!(false, has_leading_timestamp(\"#abc\"));\n\n assert_eq!(false, has_leading_timestamp(\"#123456\"));\n\n assert_eq!(true, has_leading_timestamp(\"#1234567890\"));\n\n assert_eq!(false, has_leading_timestamp(\"#123456789\"));\n\n assert_eq!(false, has_leading_timestamp(\"# 1234567890\"));\n\n assert_eq!(false, has_leading_timestamp(\"1234567890\"));\n\n assert_eq!(false, has_leading_timestamp(\"hello 1234567890\"));\n\n }\n\n}\n","file_path":"src/bash_history.rs","rank":16,"score":56320.23058608254},{"content":"pub fn parse_mv_command(command: &str) -> Vec {\n\n let mut in_double_quote = false;\n\n let mut in_single_quote = false;\n\n let mut escaped = false;\n\n let mut buffer = String::new();\n\n let mut result: Vec = Vec::new();\n\n\n\n for grapheme in command.graphemes(true) {\n\n match grapheme {\n\n \"\\\\\" => {\n\n escaped = true;\n\n }\n\n \"\\\"\" => {\n\n if escaped {\n\n escaped = false;\n\n buffer.push_str(grapheme);\n\n } else if in_double_quote {\n\n in_double_quote = false;\n\n if !buffer.is_empty() {\n\n result.push(buffer);\n","file_path":"src/path_update_helpers.rs","rank":17,"score":56320.23058608254},{"content":"pub fn last_history_line(path: &PathBuf) -> Option {\n\n // Could switch to https://github.com/mikeycgto/rev_lines\n\n full_history(path).last().map(|s| s.trim().to_string())\n\n}\n\n\n","file_path":"src/bash_history.rs","rank":18,"score":56320.23058608254},{"content":"pub fn clean(settings: &Settings, history: &History, command: &str) {\n\n // Clean up the database.\n\n history.delete_command(command);\n\n\n\n // Clean up the contents of MCFLY_HISTORY and all other temporary history files in the same\n\n // directory.\n\n clean_temporary_files(&settings.mcfly_history, command);\n\n\n\n // Clean up HISTFILE.\n\n let histfile =\n\n PathBuf::from(env::var(\"HISTFILE\").unwrap_or_else(|err| panic!(format!(\"McFly error: Please ensure that HISTFILE is set ({})\", err))));\n\n bash_history::delete_lines(&histfile, command);\n\n}\n\n\n","file_path":"src/history_cleaner.rs","rank":19,"score":54579.948368321464},{"content":"fn main() {\n\n let settings = Settings::parse_args();\n\n\n\n let mut history = History::load();\n\n\n\n match settings.mode {\n\n Mode::Add => {\n\n handle_addition(&settings, &mut history);\n\n }\n\n Mode::Search => {\n\n handle_search(&settings, &history);\n\n }\n\n Mode::Train => {\n\n handle_train(&settings, &mut history);\n\n }\n\n Mode::Move => {\n\n handle_move(&settings, &mut history);\n\n }\n\n }\n\n}\n","file_path":"src/main.rs","rank":20,"score":45499.73857536139},{"content":"fn make_schema_versions_table(connection: &Connection) {\n\n connection\n\n .execute_batch(\n\n \"CREATE TABLE IF NOT EXISTS schema_versions( \\\n\n id INTEGER PRIMARY KEY AUTOINCREMENT, \\\n\n version INTEGER NOT NULL, \\\n\n when_run INTEGER NOT NULL);\n\n\n\n CREATE UNIQUE INDEX IF NOT EXISTS schema_versions_index ON schema_versions (version);\",\n\n )\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Unable to create schema_versions db table ({})\", err)));\n\n}\n\n\n","file_path":"src/history/schema.rs","rank":21,"score":33666.39164644902},{"content":"fn write_current_schema_version(connection: &Connection) {\n\n let insert = format!(\n\n \"INSERT INTO schema_versions (version, when_run) VALUES ({}, strftime('%s','now'))\",\n\n CURRENT_SCHEMA_VERSION\n\n );\n\n connection\n\n .execute_batch(&insert)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Unable to update schema_versions ({})\", err)));\n\n}\n\n\n","file_path":"src/history/schema.rs","rank":22,"score":33666.39164644902},{"content":"#[allow(clippy::if_same_then_else)]\n\nfn has_leading_timestamp(line: &str) -> bool {\n\n let mut matched_chars = 0;\n\n\n\n for (index, c) in line.chars().enumerate() {\n\n if index == 0 && c == '#' {\n\n matched_chars += 1;\n\n } else if index > 0 && index < 11 && (c.is_digit(10)) {\n\n matched_chars += 1;\n\n } else if index > 11 {\n\n break;\n\n }\n\n }\n\n\n\n matched_chars == 11\n\n}\n\n\n","file_path":"src/bash_history.rs","rank":23,"score":33077.44954993237},{"content":"fn handle_search(settings: &Settings, history: &History) {\n\n let result = Interface::new(settings, history).display();\n\n if let Some(cmd) = result.selection {\n\n fake_typer::use_tiocsti(&cmd);\n\n\n\n if result.run {\n\n fake_typer::use_tiocsti(&\"\\n\".to_string());\n\n }\n\n }\n\n}\n\n\n","file_path":"src/main.rs","rank":24,"score":31862.54326259064},{"content":"fn read_ignoring_utf_errors(path: &PathBuf) -> String {\n\n let mut f = File::open(path).unwrap_or_else(|_| panic!(\"McFly error: {:?} file not found\", &path));\n\n let mut buffer = Vec::new();\n\n f.read_to_end(&mut buffer).unwrap_or_else(|_| panic!(\"McFly error: Unable to read from {:?}\", &path));\n\n String::from_utf8_lossy(&buffer).to_string()\n\n}\n\n\n","file_path":"src/bash_history.rs","rank":25,"score":30514.204973013842},{"content":"use crate::history::Features;\n\nuse rand::Rng;\n\nuse std::f64;\n\n\n\n#[derive(Debug, Copy, Clone, Default)]\n\npub struct Node {\n\n pub offset: f64,\n\n pub age: f64,\n\n pub length: f64,\n\n pub exit: f64,\n\n pub recent_failure: f64,\n\n pub selected_dir: f64,\n\n pub dir: f64,\n\n pub overlap: f64,\n\n pub immediate_overlap: f64,\n\n pub selected_occurrences: f64,\n\n pub occurrences: f64,\n\n}\n\n\n\nimpl Node {\n","file_path":"src/node.rs","rank":26,"score":29912.50903173243},{"content":" pub fn random() -> Node {\n\n let mut rng = rand::thread_rng();\n\n\n\n Node {\n\n offset: rng.gen_range(-1.0, 1.0),\n\n age: rng.gen_range(-1.0, 1.0),\n\n length: rng.gen_range(-1.0, 1.0),\n\n exit: rng.gen_range(-1.0, 1.0),\n\n recent_failure: rng.gen_range(-1.0, 1.0),\n\n selected_dir: rng.gen_range(-1.0, 1.0),\n\n dir: rng.gen_range(-1.0, 1.0),\n\n overlap: rng.gen_range(-1.0, 1.0),\n\n immediate_overlap: rng.gen_range(-1.0, 1.0),\n\n selected_occurrences: rng.gen_range(-1.0, 1.0),\n\n occurrences: rng.gen_range(-1.0, 1.0),\n\n }\n\n }\n\n\n\n pub fn dot(&self, features: &Features) -> f64 {\n\n self.offset\n","file_path":"src/node.rs","rank":27,"score":29904.23671344071},{"content":" + features.age_factor * self.age\n\n + features.length_factor * self.length\n\n + features.exit_factor * self.exit\n\n + features.recent_failure_factor * self.recent_failure\n\n + features.selected_dir_factor * self.selected_dir\n\n + features.dir_factor * self.dir\n\n + features.overlap_factor * self.overlap\n\n + features.immediate_overlap_factor * self.immediate_overlap\n\n + features.selected_occurrences_factor * self.selected_occurrences\n\n + features.occurrences_factor * self.occurrences\n\n }\n\n\n\n pub fn output(&self, features: &Features) -> f64 {\n\n self.dot(features).tanh()\n\n }\n\n}\n","file_path":"src/node.rs","rank":28,"score":29897.688057811858},{"content":"fn cmd_strings(connection: &Connection) -> Vec<(i64, String)> {\n\n let query = \"SELECT id, cmd FROM commands ORDER BY id DESC\";\n\n let mut statement = connection.prepare(query).unwrap();\n\n let command_iter = statement\n\n .query_map(NO_PARAMS, |row| (row.get(0), row.get(1)))\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Query Map to work ({})\", err)));\n\n\n\n let mut vec = Vec::new();\n\n for result in command_iter {\n\n if let Ok(command) = result {\n\n vec.push(command);\n\n }\n\n }\n\n\n\n vec\n\n}\n","file_path":"src/history/schema.rs","rank":36,"score":29087.36113972865},{"content":"fn clean_temporary_files(mcfly_history: &PathBuf, command: &str) {\n\n let path = mcfly_history.as_path();\n\n if let Some(directory) = path.parent() {\n\n let expanded_path =\n\n fs::canonicalize(directory).unwrap_or_else(|err| panic!(format!(\"McFly error: The contents of $MCFLY_HISTORY appear invalid ({})\", err)));\n\n let paths = fs::read_dir(&expanded_path).unwrap();\n\n\n\n for path in paths {\n\n if let Ok(entry) = path {\n\n if let Some(file_name) = entry.path().file_name() {\n\n if let Some(valid_unicode_str) = file_name.to_str() {\n\n if valid_unicode_str.starts_with(\"mcfly.\") {\n\n bash_history::delete_lines(&entry.path(), command);\n\n }\n\n }\n\n }\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/history_cleaner.rs","rank":37,"score":28578.818596897443},{"content":"use unicode_segmentation::UnicodeSegmentation;\n\n\n\n#[derive(Debug)]\n\npub struct FixedLengthGraphemeString {\n\n pub string: String,\n\n pub grapheme_length: u16,\n\n pub max_grapheme_length: u16,\n\n}\n\n\n\nimpl FixedLengthGraphemeString {\n\n pub fn empty(max_grapheme_length: u16) -> FixedLengthGraphemeString {\n\n FixedLengthGraphemeString {\n\n string: String::new(),\n\n grapheme_length: 0,\n\n max_grapheme_length,\n\n }\n\n }\n\n\n\n pub fn new>(s: S, max_grapheme_length: u16) -> FixedLengthGraphemeString {\n\n let mut fixed_length_grapheme_string =\n","file_path":"src/fixed_length_grapheme_string.rs","rank":38,"score":25044.323453196896},{"content":" FixedLengthGraphemeString::empty(max_grapheme_length);\n\n fixed_length_grapheme_string.push_grapheme_str(s);\n\n fixed_length_grapheme_string\n\n }\n\n\n\n pub fn push_grapheme_str>(&mut self, s: S) {\n\n for grapheme in s.into().graphemes(true) {\n\n if self.grapheme_length >= self.max_grapheme_length {\n\n return;\n\n }\n\n self.string.push_str(grapheme);\n\n self.grapheme_length += 1;\n\n }\n\n }\n\n\n\n pub fn push_str(&mut self, s: &str) {\n\n self.string.push_str(s);\n\n }\n\n}\n\n\n","file_path":"src/fixed_length_grapheme_string.rs","rank":39,"score":25041.043346819057},{"content":"#[cfg(test)]\n\nmod tests {\n\n use super::FixedLengthGraphemeString;\n\n\n\n #[test]\n\n fn length_works() {\n\n let input = FixedLengthGraphemeString::new(\"こんにちは世界\", 20);\n\n assert_eq!(input.grapheme_length, 7);\n\n }\n\n\n\n #[test]\n\n fn max_length_works() {\n\n let mut input = FixedLengthGraphemeString::new(\"こんにちは世界\", 5);\n\n assert_eq!(input.string, \"こんにちは\");\n\n input.push_grapheme_str(\"世界\");\n\n assert_eq!(input.string, \"こんにちは\");\n\n input.max_grapheme_length = 7;\n\n input.push_grapheme_str(\"世界\");\n\n assert_eq!(input.string, \"こんにちは世界\");\n\n }\n\n}\n","file_path":"src/fixed_length_grapheme_string.rs","rank":40,"score":25039.03123647981},{"content":"\n\n let node0 = network.hidden_nodes[0];\n\n let node1 = network.hidden_nodes[1];\n\n let node2 = network.hidden_nodes[2];\n\n network = Network {\n\n hidden_nodes: [\n\n Node {\n\n offset: node0.offset - node_increments[0].offset,\n\n age: node0.age - node_increments[0].age,\n\n length: node0.length - node_increments[0].length,\n\n exit: node0.exit - node_increments[0].exit,\n\n recent_failure: node0.recent_failure - node_increments[0].recent_failure,\n\n selected_dir: node0.selected_dir - node_increments[0].selected_dir,\n\n dir: node0.dir - node_increments[0].dir,\n\n overlap: node0.overlap - node_increments[0].overlap,\n\n immediate_overlap: node0.immediate_overlap - node_increments[0].immediate_overlap,\n\n selected_occurrences: node0.selected_occurrences - node_increments[0].selected_occurrences,\n\n occurrences: node0.occurrences - node_increments[0].occurrences,\n\n },\n\n Node {\n","file_path":"src/trainer.rs","rank":41,"score":28.462234456081788},{"content":" let d_o_2_d_s_2 = 1.0 - network.hidden_node_sums[2].tanh().powi(2);\n\n let d_e_d_s_0 = d_e_d_o_3 * d_o_3_d_s_3 * d_s_3_d_o_0 * d_o_0_d_s_0;\n\n let d_e_d_s_1 = d_e_d_o_3 * d_o_3_d_s_3 * d_s_3_d_o_1 * d_o_1_d_s_1;\n\n let d_e_d_s_2 = d_e_d_o_3 * d_o_3_d_s_3 * d_s_3_d_o_2 * d_o_2_d_s_2;\n\n\n\n node_increments[0].offset = momentum * node_increments[0].offset + lr * d_e_d_s_0 * 1.0;\n\n node_increments[0].age = momentum * node_increments[0].age + lr * d_e_d_s_0 * features.age_factor;\n\n node_increments[0].length = momentum * node_increments[0].length + lr * d_e_d_s_0 * features.length_factor;\n\n node_increments[0].exit = momentum * node_increments[0].exit + lr * d_e_d_s_0 * features.exit_factor;\n\n node_increments[0].recent_failure = momentum * node_increments[0].recent_failure + lr * d_e_d_s_0 * features.recent_failure_factor;\n\n node_increments[0].selected_dir = momentum * node_increments[0].selected_dir + lr * d_e_d_s_0 * features.selected_dir_factor;\n\n node_increments[0].dir = momentum * node_increments[0].dir + lr * d_e_d_s_0 * features.dir_factor;\n\n node_increments[0].overlap = momentum * node_increments[0].overlap + lr * d_e_d_s_0 * features.overlap_factor;\n\n node_increments[0].immediate_overlap = momentum * node_increments[0].immediate_overlap + lr * d_e_d_s_0 * features.immediate_overlap_factor;\n\n node_increments[0].selected_occurrences = momentum * node_increments[0].selected_occurrences + lr * d_e_d_s_0 * features.selected_occurrences_factor;\n\n node_increments[0].occurrences = momentum * node_increments[0].occurrences + lr * d_e_d_s_0 * features.occurrences_factor;\n\n\n\n node_increments[1].offset = momentum * node_increments[1].offset + lr * d_e_d_s_1 * 1.0;\n\n node_increments[1].age = momentum * node_increments[1].age + lr * d_e_d_s_1 * features.age_factor;\n\n node_increments[1].length = momentum * node_increments[1].length + lr * d_e_d_s_1 * features.length_factor;\n","file_path":"src/trainer.rs","rank":42,"score":27.752867766317337},{"content":" offset: node1.offset - node_increments[1].offset,\n\n age: node1.age - node_increments[1].age,\n\n length: node1.length - node_increments[1].length,\n\n exit: node1.exit - node_increments[1].exit,\n\n recent_failure: node1.recent_failure - node_increments[1].recent_failure,\n\n selected_dir: node1.selected_dir - node_increments[1].selected_dir,\n\n dir: node1.dir - node_increments[1].dir,\n\n overlap: node1.overlap - node_increments[1].overlap,\n\n immediate_overlap: node1.immediate_overlap - node_increments[1].immediate_overlap,\n\n selected_occurrences: node1.selected_occurrences - node_increments[1].selected_occurrences,\n\n occurrences: node1.occurrences - node_increments[1].occurrences,\n\n },\n\n Node {\n\n offset: node2.offset - node_increments[2].offset,\n\n age: node2.age - node_increments[2].age,\n\n length: node2.length - node_increments[2].length,\n\n exit: node2.exit - node_increments[2].exit,\n\n recent_failure: node2.recent_failure - node_increments[2].recent_failure,\n\n selected_dir: node2.selected_dir - node_increments[2].selected_dir,\n\n dir: node2.dir - node_increments[2].dir,\n","file_path":"src/trainer.rs","rank":43,"score":27.0498643621335},{"content":" node_increments[1].exit = momentum * node_increments[1].exit + lr * d_e_d_s_1 * features.exit_factor;\n\n node_increments[1].recent_failure = momentum * node_increments[1].recent_failure + lr * d_e_d_s_1 * features.recent_failure_factor;\n\n node_increments[1].selected_dir = momentum * node_increments[1].selected_dir + lr * d_e_d_s_1 * features.selected_dir_factor;\n\n node_increments[1].dir = momentum * node_increments[1].dir + lr * d_e_d_s_1 * features.dir_factor;\n\n node_increments[1].overlap = momentum * node_increments[1].overlap + lr * d_e_d_s_1 * features.overlap_factor;\n\n node_increments[1].immediate_overlap = momentum * node_increments[1].immediate_overlap + lr * d_e_d_s_1 * features.immediate_overlap_factor;\n\n node_increments[1].selected_occurrences = momentum * node_increments[1].selected_occurrences + lr * d_e_d_s_1 * features.selected_occurrences_factor;\n\n node_increments[1].occurrences = momentum * node_increments[1].occurrences + lr * d_e_d_s_1 * features.occurrences_factor;\n\n\n\n node_increments[2].offset = momentum * node_increments[2].offset + lr * d_e_d_s_2 * 1.0;\n\n node_increments[2].age = momentum * node_increments[2].age + lr * d_e_d_s_2 * features.age_factor;\n\n node_increments[2].length = momentum * node_increments[2].length + lr * d_e_d_s_2 * features.length_factor;\n\n node_increments[2].exit = momentum * node_increments[2].exit + lr * d_e_d_s_2 * features.exit_factor;\n\n node_increments[2].recent_failure = momentum * node_increments[2].recent_failure + lr * d_e_d_s_2 * features.recent_failure_factor;\n\n node_increments[2].selected_dir = momentum * node_increments[2].selected_dir + lr * d_e_d_s_2 * features.selected_dir_factor;\n\n node_increments[2].dir = momentum * node_increments[2].dir + lr * d_e_d_s_2 * features.dir_factor;\n\n node_increments[2].overlap = momentum * node_increments[2].overlap + lr * d_e_d_s_2 * features.overlap_factor;\n\n node_increments[2].immediate_overlap = momentum * node_increments[2].immediate_overlap + lr * d_e_d_s_2 * features.immediate_overlap_factor;\n\n node_increments[2].selected_occurrences = momentum * node_increments[2].selected_occurrences + lr * d_e_d_s_2 * features.selected_occurrences_factor;\n\n node_increments[2].occurrences = momentum * node_increments[2].occurrences + lr * d_e_d_s_2 * features.occurrences_factor;\n","file_path":"src/trainer.rs","rank":44,"score":25.103203928561193},{"content":"#![allow(clippy::module_inception)]\n\nuse crate::bash_history;\n\nuse rusqlite::{Connection, MappedRows, Row, NO_PARAMS};\n\nuse std::{fmt, fs, io};\n\nuse std::io::Write;\n\nuse std::path::PathBuf;\n\n//use std::time::Instant;\n\nuse crate::history::{db_extensions, schema};\n\nuse crate::simplified_command::SimplifiedCommand;\n\nuse crate::path_update_helpers;\n\nuse std::time::{Instant, SystemTime, UNIX_EPOCH};\n\nuse crate::network::Network;\n\nuse crate::settings::Settings;\n\nuse rusqlite::types::ToSql;\n\n\n\n#[derive(Debug, Clone, Default)]\n\npub struct Features {\n\n pub age_factor: f64,\n\n pub length_factor: f64,\n\n pub exit_factor: f64,\n","file_path":"src/history/history.rs","rank":45,"score":21.192191288838593},{"content":" pub recent_failure_factor: f64,\n\n pub selected_dir_factor: f64,\n\n pub dir_factor: f64,\n\n pub overlap_factor: f64,\n\n pub immediate_overlap_factor: f64,\n\n pub selected_occurrences_factor: f64,\n\n pub occurrences_factor: f64,\n\n}\n\n\n\n#[derive(Debug, Clone, Default)]\n\npub struct Command {\n\n pub id: i64,\n\n pub cmd: String,\n\n pub cmd_tpl: String,\n\n pub session_id: String,\n\n pub rank: f64,\n\n pub when_run: Option,\n\n pub exit_code: Option,\n\n pub selected: bool,\n\n pub dir: Option,\n","file_path":"src/history/history.rs","rank":46,"score":21.113948943040203},{"content":"use crate::history::History;\n\nuse crate::settings::Settings;\n\nuse crate::history::Features;\n\nuse crate::node::Node;\n\nuse crate::network::Network;\n\nuse crate::training_sample_generator::TrainingSampleGenerator;\n\n\n\n#[derive(Debug)]\n\npub struct Trainer<'a> {\n\n settings: &'a Settings,\n\n history: &'a mut History,\n\n}\n\n\n\nimpl<'a> Trainer<'a> {\n\n pub fn new(settings: &'a Settings, history: &'a mut History) -> Trainer<'a> {\n\n Trainer { settings, history }\n\n }\n\n\n\n pub fn train(&mut self) {\n\n let lr = 0.000005;\n","file_path":"src/trainer.rs","rank":47,"score":19.456318622194587},{"content":" pub features: Features,\n\n}\n\n\n\nimpl fmt::Display for Command {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n self.cmd.fmt(f)\n\n }\n\n}\n\n\n\nimpl From for String {\n\n fn from(command: Command) -> Self {\n\n command.cmd\n\n }\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct History {\n\n pub connection: Connection,\n\n pub network: Network,\n\n}\n","file_path":"src/history/history.rs","rank":48,"score":18.080807443994964},{"content":" out.push_str(&format!(\"{}\", color::Fg(color::LightBlue)));\n\n out.push_grapheme_str(format!(\"rnk: {:.*} \", 2, command.rank));\n\n out.push_grapheme_str(format!(\"age: {:.*} \", 2, command.features.age_factor));\n\n out.push_grapheme_str(format!(\"lng: {:.*} \", 2, command.features.length_factor));\n\n out.push_grapheme_str(format!(\"ext: {:.*} \", 0, command.features.exit_factor));\n\n out.push_grapheme_str(format!(\"r_ext: {:.*} \", 0, command.features.recent_failure_factor));\n\n out.push_grapheme_str(format!(\"dir: {:.*} \", 3, command.features.dir_factor));\n\n out.push_grapheme_str(format!(\"s_dir: {:.*} \", 3, command.features.selected_dir_factor));\n\n out.push_grapheme_str(format!(\"ovlp: {:.*} \", 3, command.features.overlap_factor));\n\n out.push_grapheme_str(format!(\"i_ovlp: {:.*} \", 3, command.features.immediate_overlap_factor));\n\n out.push_grapheme_str(format!(\"occ: {:.*}\", 2, command.features.occurrences_factor));\n\n out.push_grapheme_str(format!(\"s_occ: {:.*} \", 2, command.features.selected_occurrences_factor));\n\n out.push_str(&base_color);\n\n }\n\n\n\n out.string\n\n }\n\n}\n\n\n\n// TODO:\n","file_path":"src/interface.rs","rank":49,"score":14.835927805564841},{"content":" overlap: node2.overlap - node_increments[2].overlap,\n\n immediate_overlap: node2.immediate_overlap - node_increments[2].immediate_overlap,\n\n selected_occurrences: node2.selected_occurrences - node_increments[2].selected_occurrences,\n\n occurrences: node2.occurrences - node_increments[2].occurrences,\n\n }\n\n ],\n\n hidden_node_sums: [0.0, 0.0, 0.0],\n\n hidden_node_outputs: [0.0, 0.0, 0.0],\n\n final_bias: network.final_bias - output_increments[0],\n\n final_weights: [network.final_weights[0] - output_increments[1], network.final_weights[1] - output_increments[2], network.final_weights[2] - output_increments[3]],\n\n final_sum: 0.0,\n\n final_output: 0.0,\n\n };\n\n });\n\n\n\n if batch_error / batch_samples < best_restart_error {\n\n best_restart_error = batch_error / batch_samples;\n\n best_restart_network = network;\n\n cycles_since_best_restart_error = 0;\n\n } else {\n","file_path":"src/trainer.rs","rank":50,"score":14.233636049125655},{"content":" dir_factor,\n\n overlap_factor,\n\n immediate_overlap_factor,\n\n selected_occurrences_factor,\n\n occurrences_factor,\n\n };\n\n\n\n Ok(network.output(&features))\n\n }).unwrap_or_else(|err| panic!(format!(\"McFly error: Successful create_scalar_function ({})\", err)));\n\n}\n","file_path":"src/history/db_extensions.rs","rank":51,"score":13.985483677593157},{"content":"\n\n self.connection\n\n .execute(\n\n \"UPDATE contextual_commands\n\n SET rank = nn_rank(age_factor, length_factor, exit_factor,\n\n recent_failure_factor, selected_dir_factor, dir_factor,\n\n overlap_factor, immediate_overlap_factor,\n\n selected_occurrences_factor, occurrences_factor);\",\n\n NO_PARAMS,\n\n )\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Ranking of temp table to work ({})\", err)));\n\n\n\n self.connection\n\n .execute(\n\n \"CREATE INDEX temp.MyIndex ON contextual_commands(id);\",\n\n NO_PARAMS,\n\n )\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Creation of index on temp table to work ({})\", err)));\n\n\n\n // println!(\"Seconds: {}\", (beginning_of_execution.elapsed().as_secs() as f64) + (beginning_of_execution.elapsed().subsec_nanos() as f64 / 1000_000_000.0));\n","file_path":"src/history/history.rs","rank":52,"score":13.663961457337916},{"content":" let momentum = 0.0;\n\n let batch_size = 1000;\n\n let plateau_threshold = 3000;\n\n let generator = TrainingSampleGenerator::new(self.settings, self.history);\n\n\n\n println!(\"Evaluating error rate on current {:#?}\", self.history.network);\n\n let mut best_overall_network = self.history.network;\n\n let mut best_overall_error = self.history.network.average_error(&generator, batch_size * 10);\n\n println!(\"Current network error rate is {}\", best_overall_error);\n\n\n\n loop {\n\n let mut best_restart_network = Network::random();\n\n let mut best_restart_error = 10000.0;\n\n let mut cycles_since_best_restart_error = 0;\n\n let mut network = Network::random();\n\n let mut node_increments = [Node::default(), Node::default(), Node::default()];\n\n let mut output_increments = [0.0, 0.0, 0.0, 0.0];\n\n\n\n loop {\n\n let mut batch_error = 0.0;\n","file_path":"src/trainer.rs","rank":53,"score":13.317087559396164},{"content":" }\n\n\n\n pub fn commands(&self, session_id: &Option, num: i16, offset: u16, random: bool) -> Vec {\n\n let order = if random { \"RANDOM()\" } else { \"id\" };\n\n let query = if session_id.is_none() {\n\n format!(\"SELECT id, cmd, cmd_tpl, session_id, when_run, exit_code, selected, dir FROM commands ORDER BY {} DESC LIMIT :limit OFFSET :offset\", order)\n\n } else {\n\n format!(\"SELECT id, cmd, cmd_tpl, session_id, when_run, exit_code, selected, dir FROM commands WHERE session_id = :session_id ORDER BY {} DESC LIMIT :limit OFFSET :offset\", order)\n\n };\n\n\n\n if session_id.is_none() {\n\n self.run_query(&query, &[\n\n (\":limit\", &num),\n\n (\":offset\", &offset),\n\n ])\n\n } else {\n\n self.run_query(&query, &[\n\n (\":session_id\", &session_id.to_owned().unwrap()),\n\n (\":limit\", &num),\n\n (\":offset\", &offset),\n","file_path":"src/history/history.rs","rank":54,"score":12.39810459733944},{"content":" features: Features {\n\n age_factor: row.get_checked(9).unwrap_or_else(|err| panic!(format!(\"McFly error: age_factor to be readable ({})\", err))),\n\n length_factor: row.get_checked(10).unwrap_or_else(|err| panic!(format!(\"McFly error: length_factor to be readable ({})\", err))),\n\n exit_factor: row.get_checked(11).unwrap_or_else(|err| panic!(format!(\"McFly error: exit_factor to be readable ({})\", err))),\n\n recent_failure_factor: row.get_checked(12)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: recent_failure_factor to be readable ({})\", err))),\n\n selected_dir_factor: row.get_checked(13)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: selected_dir_factor to be readable ({})\", err))),\n\n dir_factor: row.get_checked(14).unwrap_or_else(|err| panic!(format!(\"McFly error: dir_factor to be readable ({})\", err))),\n\n overlap_factor: row.get_checked(15).unwrap_or_else(|err| panic!(format!(\"McFly error: overlap_factor to be readable ({})\", err))),\n\n immediate_overlap_factor: row.get_checked(16)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: immediate_overlap_factor to be readable ({})\", err))),\n\n selected_occurrences_factor: row.get_checked(17)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: selected_occurrences_factor to be readable ({})\", err))),\n\n occurrences_factor: row.get_checked(18)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: occurrences_factor to be readable ({})\", err))),\n\n },\n\n },\n\n )\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Query Map to work ({})\", err)));\n","file_path":"src/history/history.rs","rank":55,"score":12.387688984599652},{"content":"\n\n println!(\"Done!\");\n\n\n\n data_set\n\n }\n\n\n\n pub fn generate(&self, records: Option, mut handler: F) where F: FnMut(&Features, bool) {\n\n let mut positive_examples = 0;\n\n let mut negative_examples = 0;\n\n let records = records.unwrap_or_else(|| self.data_set.len());\n\n\n\n loop {\n\n if let Some((features, correct)) = rand::thread_rng().choose(&self.data_set) {\n\n if *correct && positive_examples <= negative_examples {\n\n handler(features, *correct);\n\n positive_examples += 1;\n\n } else if !*correct && negative_examples <= positive_examples {\n\n handler(features, *correct);\n\n negative_examples += 1;\n\n }\n\n }\n\n\n\n if positive_examples + negative_examples >= records {\n\n break;\n\n }\n\n }\n\n }\n\n}\n","file_path":"src/training_sample_generator.rs","rank":56,"score":11.7534615925689},{"content":"use crate::history::Command;\n\nuse crate::history::Features;\n\nuse crate::history::History;\n\nuse crate::settings::Settings;\n\nuse crate::training_cache;\n\nuse rand::Rng;\n\n\n\n#[derive(Debug)]\n\npub struct TrainingSampleGenerator<'a> {\n\n settings: &'a Settings,\n\n history: &'a History,\n\n data_set: Vec<(Features, bool)>,\n\n}\n\n\n\nimpl<'a> TrainingSampleGenerator<'a> {\n\n pub fn new(settings: &'a Settings, history: &'a History) -> TrainingSampleGenerator<'a> {\n\n let cache_path = Settings::mcfly_training_cache_path();\n\n let data_set =\n\n if settings.refresh_training_cache || !cache_path.exists() {\n\n let ds = TrainingSampleGenerator::generate_data_set(history);\n","file_path":"src/training_sample_generator.rs","rank":57,"score":11.658602882473328},{"content":" let mut batch_samples = 0.0;\n\n\n\n // Two node network example:\n\n // (Note: we currently are using a three node version, s_0 to s_2 and o_0 to o_2.)\n\n //\n\n // b_1\n\n // \\\n\n // f_1 --- s_1 -- o_1\n\n // \\ / \\\n\n // x b_3 -- s_3 -> o_3 -> e\n\n // / \\ /\n\n // f_2 --- s_2 -- o_2\n\n // /\n\n // b_2\n\n //\n\n // Error (e) = 0.5(t - o_3)^2\n\n // Final output (o_3) = tanh(s_3)\n\n // Final sum (s_3) = b_3 + w3_1*o_1 + w3_2*o_2\n\n // Hidden node 1 output (o_1) = tanh(s_1)\n\n // Hidden node 1 sum (s_1) = b_1 + w1_1*f_1 + w1_2*f_2\n","file_path":"src/trainer.rs","rank":58,"score":11.193090577883089},{"content":"use rusqlite;\n\nuse rusqlite::Connection;\n\nuse crate::history::history::Features;\n\nuse crate::network::Network;\n\n\n","file_path":"src/history/db_extensions.rs","rank":59,"score":10.997498576742046},{"content":" training_cache::write(&ds, &cache_path);\n\n ds\n\n } else {\n\n training_cache::read(&cache_path)\n\n };\n\n\n\n TrainingSampleGenerator { settings, history, data_set }\n\n }\n\n\n\n pub fn generate_data_set(history: &History) -> Vec<(Features, bool)> {\n\n let mut data_set: Vec<(Features, bool)> = Vec::new();\n\n let commands = history.commands(&None, -1, 0, true);\n\n\n\n let mut positive_examples = 0;\n\n let mut negative_examples = 0;\n\n\n\n println!(\"Generating training set for {} commands\", commands.len());\n\n\n\n for (i, command) in commands.iter().enumerate() {\n\n if command.dir.is_none() || command.exit_code.is_none() || command.when_run.is_none() { continue; }\n","file_path":"src/training_sample_generator.rs","rank":60,"score":10.243557601541902},{"content":"\n\n #[allow(unused_variables)]\n\n let beginning_of_execution = Instant::now();\n\n self.connection.execute_named(\n\n \"CREATE TEMP TABLE contextual_commands AS SELECT\n\n id, cmd, cmd_tpl, session_id, when_run, exit_code, selected, dir,\n\n\n\n /* to be filled in later */\n\n 0.0 AS rank,\n\n\n\n /* length of the command string */\n\n LENGTH(c.cmd) / :max_length AS length_factor,\n\n\n\n /* age of the last execution of this command (0.0 is new, 1.0 is old) */\n\n MIN((:when_run_max - when_run) / :history_duration) AS age_factor,\n\n\n\n /* average error state (1: always successful, 0: always errors) */\n\n SUM(CASE WHEN exit_code = 0 THEN 1.0 ELSE 0.0 END) / COUNT(*) as exit_factor,\n\n\n\n /* recent failure (1 if failed recently, 0 if not) */\n","file_path":"src/history/history.rs","rank":61,"score":10.189970509795302},{"content":" if positive_examples <= negative_examples {\n\n if let Some(our_command_index) = results.iter().position(|ref c| c.cmd.eq(&command.cmd)) {\n\n let what_should_have_been_first = &results[our_command_index];\n\n data_set.push((what_should_have_been_first.features.clone(), true));\n\n positive_examples += 1;\n\n }\n\n }\n\n\n\n if negative_examples <= positive_examples {\n\n // Get the features for another command that isn't the correct one.\n\n if let Some(random_command) = rand::thread_rng().choose(&results\n\n .iter()\n\n .filter(|c| !c.cmd.eq(&command.cmd))\n\n .collect::>())\n\n {\n\n data_set.push((random_command.features.clone(), false));\n\n negative_examples += 1;\n\n }\n\n }\n\n }\n","file_path":"src/training_sample_generator.rs","rank":62,"score":10.139210910859843},{"content":"pub mod bash_history;\n\npub mod command_input;\n\npub mod fake_typer;\n\npub mod fixed_length_grapheme_string;\n\npub mod history;\n\npub mod history_cleaner;\n\npub mod interface;\n\npub mod path_update_helpers;\n\npub mod settings;\n\npub mod simplified_command;\n\npub mod trainer;\n\npub mod training_cache;\n\npub mod training_sample_generator;\n\npub mod node;\n\npub mod network;\n","file_path":"src/lib.rs","rank":63,"score":9.887830151362577},{"content":" Exact(usize),\n\n}\n\n\n\n#[derive(Debug)]\n\n/// CommandInput data structure\n\npub struct CommandInput {\n\n /// The command itself\n\n pub command: String,\n\n /// The current cursor position\n\n pub cursor: usize,\n\n /// A cache of the length of command in graphemes (not bytes or chars!)\n\n pub len: usize,\n\n}\n\n\n\nimpl fmt::Display for CommandInput {\n\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n\n self.command.fmt(f)\n\n }\n\n}\n\n\n","file_path":"src/command_input.rs","rank":64,"score":9.873555940457477},{"content":" MAX(CASE WHEN exit_code != 0 AND :now - when_run < 120 THEN 1.0 ELSE 0.0 END) AS recent_failure_factor,\n\n\n\n /* percentage run in this directory (1: always run in this directory, 0: never run in this directory) */\n\n SUM(CASE WHEN dir = :directory THEN 1.0 ELSE 0.0 END) / COUNT(*) as dir_factor,\n\n\n\n /* percentage of time selected in this directory (1: only selected in this dir, 0: only selected elsewhere) */\n\n SUM(CASE WHEN dir = :directory AND selected = 1 THEN 1.0 ELSE 0.0 END) / (SUM(CASE WHEN selected = 1 THEN 1.0 ELSE 0.0 END) + 1) as selected_dir_factor,\n\n\n\n /* average contextual overlap of this command (0: none of the last 3 commands has ever overlapped with this command, 1: all of the last three commands always overlap with this command) */\n\n SUM((\n\n SELECT COUNT(DISTINCT c2.cmd_tpl) FROM commands c2\n\n WHERE c2.id >= c.id - :lookback AND c2.id < c.id AND c2.cmd_tpl IN (:last_commands0, :last_commands1, :last_commands2)\n\n ) / :lookback_f64) / COUNT(*) AS overlap_factor,\n\n\n\n /* average overlap with the last command (0: this command never follows the last command, 1: this command always follows the last command) */\n\n SUM((SELECT COUNT(*) FROM commands c2 WHERE c2.id = c.id - 1 AND c2.cmd_tpl = :last_commands0)) / COUNT(*) AS immediate_overlap_factor,\n\n\n\n /* percentage selected (1: this is the most commonly selected command, 0: this command is never selected) */\n\n SUM(CASE WHEN selected = 1 THEN 1.0 ELSE 0.0 END) / :max_selected_occurrences AS selected_occurrences_factor,\n\n\n","file_path":"src/history/history.rs","rank":65,"score":9.524113840185743},{"content":"use crate::bash_history;\n\nuse clap::{crate_version, crate_authors, value_t};\n\nuse clap::AppSettings;\n\nuse clap::{App, Arg, SubCommand};\n\nuse std::env;\n\nuse std::path::PathBuf;\n\nuse std::time::SystemTime;\n\nuse std::time::UNIX_EPOCH;\n\nuse dirs::home_dir;\n\n\n\n#[derive(Debug)]\n\npub enum Mode {\n\n Add,\n\n Search,\n\n Train,\n\n Move\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum KeyScheme {\n","file_path":"src/settings.rs","rank":66,"score":9.380028092497094},{"content":"pub use self::history::{Command, Features, History};\n\n\n\nmod db_extensions;\n\nmod history;\n\nmod schema;\n","file_path":"src/history/mod.rs","rank":67,"score":9.057607658097634},{"content":" age_factor, length_factor, exit_factor, recent_failure_factor,\n\n selected_dir_factor, dir_factor, overlap_factor, immediate_overlap_factor,\n\n selected_occurrences_factor, occurrences_factor\n\n FROM contextual_commands\n\n WHERE cmd LIKE (:like)\n\n ORDER BY rank DESC LIMIT :limit\";\n\n let mut statement = self.connection.prepare(query).unwrap_or_else(|err| panic!(format!(\"McFly error: Prepare to work ({})\", err)));\n\n let command_iter = statement\n\n .query_map_named(\n\n &[(\":like\", &like_query), (\":limit\", &num)],\n\n |row| Command {\n\n id: row.get_checked(0).unwrap_or_else(|err| panic!(format!(\"McFly error: id to be readable ({})\", err))),\n\n cmd: row.get_checked(1).unwrap_or_else(|err| panic!(format!(\"McFly error: cmd to be readable ({})\", err))),\n\n cmd_tpl: row.get_checked(2).unwrap_or_else(|err| panic!(format!(\"McFly error: cmd_tpl to be readable ({})\", err))),\n\n session_id: row.get_checked(3).unwrap_or_else(|err| panic!(format!(\"McFly error: session_id to be readable ({})\", err))),\n\n when_run: row.get_checked(4).unwrap_or_else(|err| panic!(format!(\"McFly error: when_run to be readable ({})\", err))),\n\n exit_code: row.get_checked(5).unwrap_or_else(|err| panic!(format!(\"McFly error: exit_code to be readable ({})\", err))),\n\n selected: row.get_checked(6).unwrap_or_else(|err| panic!(format!(\"McFly error: selected to be readable ({})\", err))),\n\n dir: row.get_checked(7).unwrap_or_else(|err| panic!(format!(\"McFly error: dir to be readable ({})\", err))),\n\n rank: row.get_checked(8).unwrap_or_else(|err| panic!(format!(\"McFly error: rank to be readable ({})\", err))),\n","file_path":"src/history/history.rs","rank":68,"score":9.04318694062998},{"content":" .execute_named(\n\n \"DELETE FROM commands WHERE cmd = :command\",\n\n &[(\":command\", &command)],\n\n )\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: DELETE from commands to work ({})\", err)));\n\n }\n\n\n\n pub fn update_paths(&self, old_path: &str, new_path: &str, print_output: bool) {\n\n let normalized_old_path = path_update_helpers::normalize_path(old_path);\n\n let normalized_new_path = path_update_helpers::normalize_path(new_path);\n\n\n\n if normalized_old_path.len() > 1 && normalized_new_path.len() > 1 {\n\n let like_query = normalized_old_path.to_string() + \"/%\";\n\n\n\n let mut dir_update_statement = self.connection.prepare(\n\n \"UPDATE commands SET dir = :new_dir || SUBSTR(dir, :length) WHERE dir = :exact OR dir LIKE (:like)\"\n\n ).unwrap();\n\n\n\n let mut old_dir_update_statement = self.connection.prepare(\n\n \"UPDATE commands SET old_dir = :new_dir || SUBSTR(old_dir, :length) WHERE old_dir = :exact OR old_dir LIKE (:like)\"\n","file_path":"src/history/history.rs","rank":69,"score":8.871721658695522},{"content":"\n\nimpl Default for Settings {\n\n fn default() -> Settings {\n\n Settings {\n\n mode: Mode::Add,\n\n command: String::new(),\n\n session_id: String::new(),\n\n mcfly_history: PathBuf::new(),\n\n dir: String::new(),\n\n when_run: None,\n\n exit_code: None,\n\n old_dir: None,\n\n refresh_training_cache: false,\n\n append_to_histfile: false,\n\n debug: false,\n\n lightmode: false,\n\n key_scheme: KeyScheme::Emacs\n\n }\n\n }\n\n}\n","file_path":"src/settings.rs","rank":70,"score":8.864538501817716},{"content":"impl CommandInput {\n\n pub fn from>(s: S) -> CommandInput {\n\n let mut input = CommandInput {\n\n command: s.into(),\n\n cursor: 0,\n\n len: 0,\n\n };\n\n input.recompute_caches();\n\n input.cursor = input.len;\n\n input\n\n }\n\n\n\n pub fn clear(&mut self) {\n\n self.command.clear();\n\n self.recompute_caches();\n\n }\n\n\n\n pub fn set(&mut self, str: &str) {\n\n self.command = str.to_string();\n\n self.recompute_caches();\n","file_path":"src/command_input.rs","rank":71,"score":8.83164648518991},{"content":" Emacs,\n\n Vim\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct Settings {\n\n pub mode: Mode,\n\n pub debug: bool,\n\n pub session_id: String,\n\n pub mcfly_history: PathBuf,\n\n pub command: String,\n\n pub dir: String,\n\n pub when_run: Option,\n\n pub exit_code: Option,\n\n pub old_dir: Option,\n\n pub append_to_histfile: bool,\n\n pub refresh_training_cache: bool,\n\n pub lightmode: bool,\n\n pub key_scheme: KeyScheme\n\n}\n","file_path":"src/settings.rs","rank":72,"score":8.639407246926611},{"content":" when_run_min -= 60.0 * 60.0;\n\n }\n\n\n\n let max_occurrences: f64 = self.connection\n\n .query_row(\n\n \"SELECT COUNT(*) AS c FROM commands GROUP BY cmd ORDER BY c DESC LIMIT 1\",\n\n NO_PARAMS,\n\n |row| row.get(0),\n\n )\n\n .unwrap_or(1.0);\n\n\n\n let max_selected_occurrences: f64 = self.connection\n\n .query_row(\"SELECT COUNT(*) AS c FROM commands WHERE selected = 1 GROUP BY cmd ORDER BY c DESC LIMIT 1\", NO_PARAMS,\n\n |row| row.get(0)).unwrap_or(1.0);\n\n\n\n let max_length: f64 = self.connection\n\n .query_row(\"SELECT MAX(LENGTH(cmd)) FROM commands\", NO_PARAMS, |row| {\n\n row.get(0)\n\n })\n\n .unwrap_or(100.0);\n","file_path":"src/history/history.rs","rank":73,"score":8.57908806609486},{"content":" return true;\n\n }\n\n !command.eq(&last_command.unwrap().cmd)\n\n }\n\n\n\n pub fn add(\n\n &self,\n\n command: &str,\n\n session_id: &str,\n\n dir: &str,\n\n when_run: &Option